9 May 2013

Ten Facts About Internet and WWW....

           The history of technologies that caused the internet to be created dates back to the 50′s, but only in 1982 the modern internet was built based on the TCP/IP protocol.

In this article we’re going to share some interesting facts about the Internet, facts that every Internet user should know.

Fact 1: The WWW was created by one man:
While the internet is the result of an effort made by many scientists and programmers, the WWW was created by one man and later it was implemented on the Internet. That man is Tim Berners-Lee.

Fact 2: The weight of the Internet:
The most popular myths about the weight of the internet is rather a salt particle, a strawberry, however, information doesn’t have weight.Measuring the electrons that store 5 million terabytes, the answer is this: the internet weights around 28 grams.

Fact 3: Number of people connected to the Internet:

In December of 2011, 2.267.233.762 people were connected to the Internet. In 2012 the number gets close to 2,5 billion and Asia is still the continent with the most people connected to the Internet, twice as many as Europe and four times more than the United States Internet users.

Fact 4: Mosaic was not the first internet web browser:


The browser helped expand the world wide web, Mosaic, was not the first web browser in creation. Mosaic was just the first browser capable of displaying images. The first web browser was created by Tim Berners-Lee, the man who created the internet. At first it was named WWW but later the name was changed to Nexus. 

Fact 5: The first webcam streaming:

The first webcam, invented by the Cambridge university, sent a very important piece of information on the Internet: images of a coffee machine and this happened in 1991. The webcam was invented so that Cambridge researchers can see what the coffee is ready.

Fact 6: First video uploaded on YouTube:

“Me at the Zoo” was the first video to be uploaded on YouTube and it is still available today on youtube.com. The video was created by one of the three YouTube founders, Jawed Karim, in 2005.

Fact 7: The internet destroyed the autograph:

There are still people who collect autographs but celebrities are more open now than they were 10 years ago. Personal websites and social networking allows anyone to post a message for a celebrity to see. Celebrities often also reply to messages from users.

Fact 8: The Internet Users:

About 1/6 of Earth’s total population enjoys surfing the internet at least once per month. Many of the people who do not surf the internet, however, have noted that they would like to enjoy internet pictures and videos if they had the opportunity.

Fact 9: The internet Usage:

Over half of all the downloading and uploading online is file sharing that is often considered illegal. Another rising portion of the overall bandwidth that will likely get bigger and bigger is from streaming video services such as Netflix.

Fact 10:Security and Privacy Policy:

Security and privacy concerns have always been a problem on the Internet with many people often unaware of the potential risks they take when inputting confidential data, passwords and personal information into various websites. Viruses and spam emails are other sources over security concerns which frequently cause disruptions and headaches for users of the web.

From the Links:-
www.netquake.com
www.sciencekids.co.nz
www.hahanice.com

5 May 2013

Data Structure (IMP Questions)



1. What is data structure?
  •    A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.
2. List out the areas in which data structures are applied extensively?
  1. Compiler Design,
  2. Operating System,
  3. Database Management System,
  4. Statistical analysis package,
  5. Numerical Analysis,
  6. Graphics,
  7. Artificial Intelligence,
  8. Simulation
3. What are the major data structures used in the following areas : RDBMS, Network data model and Hierarchical data model.
  1. RDBMS = Array (i.e. Array of structures)
  2. Network data model = Graph
  3. Hierarchical data model = Trees
4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
  •   The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type.
5. Minimum number of queues needed to implement the priority queue?
  •   Two ques are needed for implementing priority queue. One queue is used for actual storing of data and another for storing priorities.
6. What is the data structures used to perform recursion?
  •   Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls.
  •   Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.


7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
  •  Polish Notation and Reverse Polish notations.
8. Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and Postfix notations.
  1. Prefix Notation: - * +ABC ^ - DE + FG
  2. Postfix Notation: AB + C * DE - FG + ^ -
9. Sorting is not possible by using which of the following methods? (Insertion, Selection, Exchange, Deletion)
  •   Sorting is not possible in Deletion. Using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). But no sorting method can be done just using deletion.
10. What are the methods available in storing sequential files ?
  1. Straight merging,
  2. Natural merging,
  3. Polyphase sort,
  4. Distribution of Initial runs.
11. List out few of the Application of tree data-structure?
  1. The manipulation of Arithmetic expression,
  2. Symbol Table construction,
  3. Syntax analysis.
12. List out few of the applications that make use of Multilinked Structures?
  1. Sparse matrix,
  2. Index generation.


13. In tree construction which is the suitable efficient data structure? (Array, Linked list, Stack, Queue)
  •   Linked list is the suitable efficient data structure.

14. What is the type of the algorithm used in solving the 8 Queens problem?
  •   Backtracking.

15. In an AVL tree, at what condition the balancing is to be done?
  •  If the 'pivotal value' (or the 'Height factor') is greater than 1 or less than -1.

16. What is the bucket size, when the overlapping and collision occur at same time?
  •   The Bucket Size will be one. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.

17. Classify the Hashing Functions based on the various methods by which the key value is found.
  1. Direct method,
  2. Subtraction method,
  3. Modulo-Division method,
  4. Digit-Extraction method,
  5. Mid-Square method,
  6. Folding method,
  7. Pseudo-random method.
18. What are the types of Collision Resolution Techniques and the methods used in each of the type?
  1. Open addressing (closed hashing), The methods used include: Overflow block.
  2. Closed addressing (open hashing), The methods used include: Linked list, Binary tree.
19. In RDBMS, what is the efficient data structure used in the internal storage representation?
  •   B+ tree used in the internal storage. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.

20. What is a spanning Tree?
  •   A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

21. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
  •   No. The Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

22. Which is the simplest file structure? (Sequential, Indexed, Random)
  •   Sequential is the simplest file structure.

23. Whether Linked List is linear or Non-linear data structure?
  •   According to Access strategies Linked list is a linear one.
  • According to Storage Linked List is a Non-linear one.

30 Apr 2013

C++ PDF Books For Study at Home...

Top C++ Books that makes C++ Learning Easy......

(1)The_C++_Programming_Language

by_Bjarne Stroustrup 
                                                This book introduces standard C++† and the key programming and design techniques supported by C++. Standard C++ is a far more powerful and polished language than the version of C++ introduced by the first edition of this book. New language features such as namespaces, exceptions, templates, and runtime type identification allow many techniques to be applied more directly than was possible before, and the standard library allows the programmer to start from a much higher level than the bare language. About a third of the information in the second edition of this book came from the first. This third edition is the result of a rewrite of even larger magnitude. It offers something to even the most experienced C++ programmer; at the same time, this book is easier for the novice to approach than its predecessors were. The explosion of C++ use and the massive amount of experience accumulated as a result makes this possible.

Click Here to Download The PDF Book... 

(2) The C++ Weekend Crash Course 
by_Stephen R. Davis
                                                     C++ Weekend Crash Course teaches the reader C++ in one admittedly busy weekend: 30 sessions of a half-hour each, for 15 hours stretching from Friday evening to Sunday afternoon. At the end of each part of the book, you’ll get a chance to pause, reflect, and review what you’ve just learned before pushing on through the rest. C++ Weekend Crash Course is intended for the beginner through the intermediate reader. This book serves the beginner by not assuming any knowledge of programming or programming concepts. The first few lessons go over real-world, non-techie explanations of what programming is. This book is also great for the home programmer. The multiple examples demonstrate programming techniques used in modern, high speed programs.

Click Here To Download PDF Book... 


(3) The C++ Essantials
by_Sharam Hekmat
                                                                           The book is divided into 12 chapters. Each chapter has a flat structure, consisting of an unnumbered sequence of sections, most of which are limited to one or two pages. The aim is to present each new topic in a confined space so that it can be quickly grasped. Each chapter ends with a list of exercises. Answers to all of the exercises are provided in an appendix. Readers are encouraged to attempt as many of the exercises as feasible and to compare their solutions against the ones provided. For the convenience of readers, the sample programs presented in this book (including the solutions to the exercises) and provided in electronic form.
Click Here To Download PDF Book...

(4) The C++ Tutorials
by_Juan SouliƩ
                                                                    The tutorial is divided in 6 parts and each part is divided on its turn into different sections covering a topic each one. You can access any section directly from the section index available on the left side bar, or begin the tutorial from any point and follow the links at the bottom of each section.Many sections include examples that describe the use of the newly acquired knowledge in the chapter. It is recommended to read these examples and to be able to understand each of the code lines that constitute it before passing to the next chapter. A good way to gain experience with a programming language is by modifying and adding new functionalities on your own to the example programs that you fully understand. Don't be scared to modify the examples provided with this tutorial, that's the way to learn!

Comments

© 2013-2016 ITTechnocrates. All rights resevered. Developed by Bhavya Mehta