26-08-2016, 03:44 PM
mydatastru.doc (Size: 46 KB / Downloads: 8)
A data structure is a way of storing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to different kinds of applications.
Following are some Data Structure Sample questions:
1. What is data structure?
Answer: 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?
Answer: The name of areas are:
• Compiler Design,
• Operating System,
• Database Management System,
• Statistical analysis package,
• Numerical Analysis,
• Graphics,
• Artificial Intelligence,
• Simulation
3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model.
Answer: The major data structures used are as follows:
• RDBMS - Array (i.e. Array of structures)
• Network data model - Graph
• Hierarchical data model - Trees
4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
Answer: 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?
Answer: Two. One queue is used for actual storing of data and another for storing priorities.
6. What is the data structures used to perform recursion?
Answer: 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?
Answer: Polish and Reverse Polish notations.
8. Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and Postfix notations.
Answer: Prefix Notation: ^ - * +ABC - DE + FG
Postfix Notation: AB + C * DE - - FG + ^
9. How many null branches are there in a binary tree with 20 nodes?
Answer: 21 ( IF YOU HAVE N NODES , N+1 NULL NODES WIL BE THERE) NULL NODE IS NOTHING BUT ( LEAF NODE)
A binary tree with n nodes has exactly n+1 null nodes.
10. How many different trees are possible with 10 nodes ?
Answer: 1014
For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 2 3 - 3 = 5) trees.
In general:
If there are n nodes, there exist 2n - n different trees.
11. List out few of the Application of tree data-structure?
Answer: The list is as follows:
• The manipulation of Arithmetic expression,
• Symbol Table construction,
• Syntax analysis.
12. List out few of the applications that make use of Multilinked Structures?
Answer: The applications are listed below:
• Sparse matrix,
• Index generation.
13. In tree construction which is the suitable efficient data structure?
Answer: Linked list is the efficient data structure.
30. Whether Linked List is linear or Non-linear data structure?
Answer: According to Access strategies Linked list is a linear one.
According to Storage Linked List is a Non-linear one.
31. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
32. I am going to execute this code with THREE inserts and ONE get_front:
queue<int> s;
s.insert(1);
s.insert(2);
s.insert(3);
cout << s.DEL_front( );
what will be the structure of queue after manipulated with above code segment.
1 2 3 N , 1 at front is deleted hence 23N
33. Describe why it is a bad idea to implement a linked list version a queue which uses the head of the list as the rear of the queue.
Ans: BECAUSE WE CANNOT KNOW WHEN Q IS EMPTY OR FULL
34. One difference between a queue and a stack is:
1. A. Queues require dynamic memory, but stacks do not.
2. B. Stacks require dynamic memory, but queues do not.
3. C. Queues use two ends of the structure; stacks use only one. ( ANS)
4. D. Stacks use two ends of the structure, queues use only one.
35. If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed?
1. A. ABCD
2. B. ABDC
3. C. DCAB
4. D. DCBA (ANS)