Quiznetik
Data Structures (DS) | Set 4
1. The hashing file space is divided into_______________.
A. nodes and roots.
B. roots and slots.
C. buckets and slots.
D. slots and nodes.
Correct : C. buckets and slots.
2. Matrices with a relatively high proportion of zero entries are called _______ matrices.
A. sparse.
B. Null.
C. Zero.
D. worse.
Correct : A. sparse.
3. The Postfix equivalent of the Prefix Notation * + ab - cd is
A. ab + cd - *
B. abcd +-*
C. ab+cd*-
D. ab+-cd*
Correct : A. ab + cd - *
4. Data structure which is capable of expressing more complex relationship than that of physical adjacency is called______________.
A. linear data structure.
B. linked list.
C. non linear data Structure
D. data structure.
Correct : C. non linear data Structure
5. A tree is a data structure which represents hierarchical relationship between individual _________.
A. data items.
B. fields.
C. nodes.
D. linked list.
Correct : A. data items.
6. In a directed tree any node which has out degree 0 is called a terminal node or__________.
A. a tree.
B. a list.
C. a node.
D. a leaf.
Correct : D. a leaf.
7. In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
A. directed.
B. structure.
C. ordered.
D. degree of.
Correct : C. ordered.
8. ______________ a tree means processing it in such a way that each node is visited only once.
A. Traversing.
B. Implement.
C. Partition.
D. Node.
Correct : A. Traversing.
9. The length of the path is the number of_____________ on the path.
A. nodes.
B. fields.
C. data.
D. edges.
Correct : D. edges.
10. The children node of same parent is called____________.
A. binary tree.
B. tree.
C. sibling.
D. list.
Correct : C. sibling.
11. The situation in linked list START = NULL is called_________
A. Overflow
B. Underflow
C. Zero
D. None of the above
Correct : B. Underflow
12. A code which deals about short form of a program is called __________ code.
A. program.
B. data.
C. pseudo.
D. derived.
Correct : C. pseudo.
13. Which of the application may use a stack?
A. Expression Evaluation
B. Keeping track of local variables at run time.
C. Syntax analyzer for a compiler
D. All of the above.
Correct : A. Expression Evaluation
14. The queue which wraps around upon reaching the end of the array is called as____________.
A. circular queue.
B. linked queue.
C. doubly linked list.
D. representation of queue.
Correct : A. circular queue.
15. A _______________ is a reference to a memory location, which is used to store data that is described in a data type.
A. element.
B. variable.
C. pointer.
D. memory.
Correct : B. variable.
16. If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
A. ABCD
B. DCBA
C. DCAB
D. ABDC
Correct : B. DCBA
17. ____________ has certain attributes or properties which may be assigned values.
A. field system.
B. record.
C. entity.
D. files.
Correct : C. entity.
18. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________.
A. 6
B. 5
C. 7
D. 8
Correct : B. 5
19. Maximum degree in any vector in a graph with n vertices is ________.
A. n.
B. n-1.
C. n+1.
D. 2n+1.
Correct : B. n-1.
20. If FRONT = NULL then _________.
A. queue full
B. queue empty
C. dequeue
D. priority queue
Correct : B. queue empty
21. _______________ is a solution to a problem independent of programming language.
A. Efficient.
B. Linked list.
C. Data structure.
D. Algorithm.
Correct : D. Algorithm.
22. ________ is the situation where data-structure is empty.
A. Overflow.
B. Underflow.
C. Null.
D. Empty.
Correct : B. Underflow.
23. When elements are deleted the nodes go to_________.
A. registers.
B. free pool.
C. recycle bin.
D. gets deleted permanently.
Correct : B. free pool.
24. Expression into postfix expression: (A - B) * (D / E)
A. ABDE - * /
B. - * / ABDE
C. A B - D E * /
D. * - A B / D E
Correct : D. * - A B / D E
25. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called ________
A. elementary items.
B. atoms.
C. scalars.
D. structure.
Correct : D. structure.
26. Quick sort uses ____ for implementation.
A. recursion.
B. traversal.
C. heaps.
D. queues.
Correct : A. recursion.
27. What is the worst-case time for heap sort to sort an array of n elements?
A. O(log n).
B. O(n).
C. O(n log n).
D. O(n²).
Correct : C. O(n log n).
28. The __________________ denotes the greatest integer.
A. ceiling.
B. time.
C. space.
D. floor.
Correct : A. ceiling.
29. A binary tree of depth "d" is an almost complete binary tree if __________.
A. each leaf in the tree is either at level.
B. for any node.
C. both a and b.
D. None.
Correct : C. both a and b.
30. Program module contains its own list of variables called ____________.
A. global.
B. scope.
C. local.
D. external.
Correct : C. local.
31. The number of nodes in a complete binary tree of level 5 is__________.
A. 15.
B. 20.
C. 63.
D. 31.
Correct : D. 31.
32. The string with zero characters is called___________.
A. null string.
B. zero string.
C. one string.
D. empty string.
Correct : D. empty string.
33. The unit equal to the number of bits needed to represent a character is called a ________.
A. byte.
B. bit.
C. mega bytes.
D. kilo bytes.
Correct : A. byte.
34. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
A. 11
B. 12
C. 13
D. 14
Correct : D. 14
35. In variable length storage two dollar signs are used to signal the __________.
A. end of the string.
B. beginning of the string.
C. mid-level of the string.
D. index.
Correct : A. end of the string.
36. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
A. 2 deletions and 3 additions
B. 3 additions and 2 deletions
C. 3 deletions and 3 additions
D. 3 deletions and 4 additions
Correct : C. 3 deletions and 3 additions
37. Each node in a singly linked lists have ______ fields
A. 2
B. 3
C. 4
D. 5
Correct : A. 2
38. Quotation marks are also called as ____________.
A. string delimiters.
B. period.
C. stopper.
D. string.
Correct : A. string delimiters.
39. A string `s` consists of x, y and if x is an empty string then y is called as___________.
A. initial substring.
B. substring of s.
C. node of the string.
D. index.
Correct : A. initial substring.
40. The length of the string can be listed as an additional item in _____________.
A. base pointer.
B. pointer array.
C. node.
D. record.
Correct : B. pointer array.
41. Who invented Quick sort procedure?
A. Hoare.
B. Sedgewick.
C. Mellroy.
D. Coreman.
Correct : A. Hoare.
42. For the heap sort, access to nodes involves simple _______________ operations.
A. binary.
B. arithmetic
C. algebraic
D. logarithmic
Correct : B. arithmetic
43. The maximum number of nodes on level i of a binary tree is ___________.
A. 2i-1.
B. 3i-1.
C. i+1.
D. 2i+1.
Correct : A. 2i-1.
44. The number of edges in a regular graph of degree d and n vertices is _______.
A. maximum of n,d.
B. n+d.
C. nd.
D. nd/2.C
Correct : C. nd.
45. Which of the following is useful in traversing a given graph by Breath first search?
A. Stack.
B. Set.
C. List.
D. Queue.
Correct : D. Queue.
46. What is an external sorting algorithm?
A. Algorithm that uses tape or disk during the sort
B. Algorithm that uses main memory during the sort
C. Algorithm that involves swapping
D. Algorithm that are considered in place
Correct : A. Algorithm that uses tape or disk during the sort
47. Allocating memory for arrays during program compilation is___________.
A. dynamic memory allocation.
B. memory allocation.
C. static allocation.
D. random allocation.
Correct : C. static allocation.
48. The elements of an array are allocated in spaces________.
A. successively.
B. randomly.
C. alternately.
D. on any order.
Correct : A. successively.
49. Accessing and processing each array elements is called __________.
A. sorting.
B. traversing.
C. searching.
D. merging.
Correct : B. traversing.
50. An m*n array has _________number of elements.
A. m.
B. n.
C. m2.
D. m*n.
Correct : D. m*n.
51. The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.
A. row major order.
B. column major order.
C. random order.
D. successive order.
Correct : B. column major order.
52. ______ is not a technique of tree traversal.
A. pre-order
B. post-order
C. prefix
D. in-order
Correct : C. prefix
53. Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.
A. O(n log n) sorts.
B. Divide-and-conquer sorts.
C. Interchange sorts.
D. Average time is quadratic.
Correct : C. Interchange sorts.
54. The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
A. merge.
B. obstacle.
C. overlapping.
D. collision.
Correct : C. overlapping.
55. Uniform distribution of the hash address throughout the given set L is __________.
A. reduce the number of collision.
B. increase the number of collision.
C. totally avoid collision.
D. manage address.
Correct : A. reduce the number of collision.
56. An edge E is called _________ if it has identical endpoints.
A. multiple edges.
B. loops.
C. finite.
D. digraph.
Correct : B. loops.
57. __________involves maintaining two tables in memory.
A. Arranging.
B. Bonding.
C. Combing.
D. Chaining.
Correct : D. Chaining.
58. An _________ is a well defined list of steps for solving a problem.
A. Algorithm.
B. Program.
C. Procedure.
D. Process.
Correct : A. Algorithm.
59. The data items in a record form a ________ structure which can be described by means of level numbers.
A. hierarchical.
B. procedural.
C. indexed.
D. leveled.
Correct : A. hierarchical.
60. A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
A. n.
B. n+1.
C. n+2.
D. n-1.
Correct : B. n+1.
61. A vertex of degree one is called __________.
A. padent
B. isolated vertex
C. null vertex
D. colored vertex
Correct : A. padent
62. A connected graph T without any cycles is called _____________.
A. a tree graph.
B. free tree.
C. a tree.
D. all of the above.
Correct : D. all of the above.
63. If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
A. isolate.
B. complete.
C. finite.
D. Strongly connected.
Correct : B. complete.
64. In a graph G if e=(u,v), then u and v are called ___________.
A. endpoints.
B. adjacent nodes.
C. neighbours.
D. all of the above.
Correct : D. all of the above.
65. Which of the following is true while inserting a new node in the list?
A. Check there is node in the list.
B. Check in the free node in the pool.
C. There is no node.
D. Underflow.
Correct : B. Check in the free node in the pool.
66. Which of the following data structures are indexed structures?
A. Linear arrays.
B. Linked lists.
C. Arrays.
D. First address.
Correct : A. Linear arrays.
67. The efficiency of a BFS algorithm is dependent on _______.
A. Algorithm.
B. Tree.
C. Problem.
D. Graph.
Correct : D. Graph.
68. The average number of key comparisons done in a successful sequential search in a list of length n is ____________.
A. log n.
B. n-1/2.
C. n/2.
D. n+1/2.
Correct : D. n+1/2.
69. Divide and conquer is an important algorithm design paradigm based on _______.
A. multi-branched recursion.
B. single-branched recursion.
C. two-way recursion.
D. None.
Correct : A. multi-branched recursion.
70. The correctness of a divide and conquer algorithm is usually proved by _________.
A. mathematical theorem.
B. de-Morgan `s law.
C. mathematical induction.
D. none.
Correct : C. mathematical induction.
71. The ____________ is used in an elegant sorting algorithm.
A. Heap sort.
B. Quick sort.
C. Merge sort.
D. Radix sort.
Correct : A. Heap sort.
72. ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
A. Travelling Salesman tour.
B. Eulerian tour.
C. Hamiltonian tour.
D. None.
Correct : C. Hamiltonian tour.
73. ____________ data structure is used to implement Depth First search.
A. Array.
B. Linked list.
C. Queue.
D. Stack.
Correct : D. Stack.
74. The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
A. log2N
B. n-1
C. n
D. None of the above
Correct : B. n-1
75. Each entry in a linked list is a called a_______________.
A. Link.
B. Node.
C. Data Structure.
D. Avail.
Correct : B. Node.
76. Which of the following is two way lists?
A. Grounded header list.
B. Circular header list.
C. Linked list with header and trailer nodes.
D. List traversed in two directions.
Correct : D. List traversed in two directions.
77. In a linked list the _________field contains the address of next element in the list.
A. Link field.
B. Next element field.
C. Start field.
D. Info field .
Correct : A. Link field.
78. A list that has no nodes is called________.
A. End list.
B. Zero list.
C. Null list.
D. Sentinel list.
Correct : C. Null list.
79. The special list which consists of unused memory space is called __________.
A. Free space.
B. Empty space.
C. Available space.
D. Free storage list.
Correct : D. Free storage list.
80. The efficient searching algorithm for algorithm for a sorted array is _________.
A. Binary search.
B. Linear search.
C. Indexed search.
D. Repeated search.
Correct : A. Binary search.
81. To insert a new node in linked list free node will be available in ___________.
A. Available list.
B. Avail list.
C. Free node list.
D. Memory space list.
Correct : B. Avail list.
82. A ______________ list is a header list where the node points back to the header node.
A. Circular header.
B. Grounded header.
C. Two way header.
D. One way header.
Correct : A. Circular header.
83. How many pointers are necessarily changed for the insertion in a Linked List?
A. 1.
B. 2.
C. 3.
D. 5.
Correct : B. 2.
84. An algorithm that calls itself directly or indirectly is known as ____________.
A. Sub algorithm. .
B. Recursion.
C. Polish notation.
D. Traversal algorithm.
Correct : B. Recursion.