1. The term Data Structure refers to _____ and interrelationship between them.
A. Programming Language Statement
B. Coding Standards
C. Organization of data element
D .None of the above
2: Non Primitive data Structures are those which define set of _____ .
A. Static Elements
B. Primitive Elements
C. Derived Elements
D. None of the above
3.Which data structure allows deleting data elements from front and inserting at rear ?
A. Queues
B. Stacks
C. Binary search tree
D. Deques
4.If elements of the data structure forms a sequence of list then it is called as _____ .
A.Linear data structure
Non-primitive data structure
Primitive data structure
None of the above
5. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A. Priority queues
B. Output-restricted deque
C. Input-restricted deque
D. None of the above
6. Key value pair is usually seen in
A. Hash tables
B. Heaps
C. Both a and b
D. Skip list
7. Which of the following data structure is non-linear type ?
A. Lists
B. Stacks
C. Strings
D. None of the above
8. AVL trees have a faster __________
A. Insertion
B. Deletion
C. Updation
D. Retrieval
9.Which of the following data structure is linear type ?
A. Lists
B. Queues
C. Strings
D. All of the above
10.To represent hierarchical relationship between elements, which data structure is suitable ?
A. Priority
B. Tree
C. Deque
D. All of the above
11.Items in a priority queue are entered in a _____________ order
A. random
B. order of priority
C. as and when they come
D. none of the above
12.A binary tree whose every node has either zero or two children is called as _____ .
A. Binary search tree
B. Extended binary tree
C. Complete binary tree
D. None of the above
13.Breadth First search is used in
A. Binary trees
B. Stacks
C. Graphs
D. Both a and c
14.When representing any algebraic expression E which uses only binary operations in a 2-tree,
A. the operations in E will appear as external nodes and variables in internal nodes
B. the variables and operations in E will appear only in external nodes
C. the variables and operations in E will appear only in internal nodes
D. the variable in E will appear as external nodes and operations in internal nodes
15.Which of the following ways is a pre-order traversal?
A. Root->left sub tree-> right sub tree
B. Root->right sub tree-> left sub tree
C. right sub tree-> left sub tree->Root
D. left sub tree-> right sub tree->Root
16.What is the peculiarity of red black trees?
A. In red-black trees, the root do not contain data.
B. In red-black trees, the leaf nodes are not relevant and do not contain data.
C. In red-black trees, the leaf nodes are relevant but do not contain data.
D. Both a and c above
17.A binary tree can easily be converted into q 2-tree
A. by replacing each empty sub tree by a new external node
B. by inserting an external nodes for non-empty node
C. by inserting an internal nodes for non-empty node
D. by replacing each empty sub tree by a new internal node
18.When converting binary tree into extended binary tree, all the original nodes in binary tree are
A. external nodes on extended tree
B. vanished on extended tree
C. internal nodes on extended tree
D. None of the above
19. Can stack be described as a pointer?
A. Yes
B. No
20.The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal.
A. ADBFEC
B. ABDCEF
C. ABFCDE
D. ABDECF
21. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
A. branch
B. path
C. Leaf
D. thread
22.. On which principle does stack work?
A. FILO
B. FIFO
C. LILO
D. LIFO or FILO
23. On which principle does queue work?
A. FILO
B. FIFO
C. LILO
D. Both a and b
24. _____ defines a set of primitive elements which do not involves any other element as its sub-part.
A. Linear Data Structure
B. Primitive Data Structure
C. Non Linear Data Structure
D. Non-Primitive Data Structure
25.Which of the following is not a disadvantage to the usage of array?
A. Fixed size
B. There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size
C. Insertion based on position
D. Accessing elements at specified positions
26.What will be the value of top, if there is a size of stack STACK_SIZE is 5
A. 5
B. 6
C. 4
D. None
27.Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
28.Any node is the path from the root to the node is called
A. Successor node
B. Ancestor node
C. Internal node
D. None of the above
29.Which of the following data structure is linear type?
A. Array
B. Tree
C. Graphs
D. Hierarchy
30. _______ level is where the model becomes compatible executable code
A. Abstract level
B. Application level
C. Implementation level
D. All of the above
31._______ is very useful in situation when data have to stored and then retrieved in reverse order.
A. Stack
B. Queue
C. List
D. Link list
32.In a queue, the initial values of front pointer f rare pointer r should be _______ and ________ respectively.
A. 0 and 1
B. 0 and -1
C. -1 and 0
D. 1 and 0
33.There is an extra element at the head of the list called a __________
A. Antinel
B.Sentinel
C. List header
D. List head
34.Which is/are the application(s) of stack
A. Function calls
B. Large number Arithmetic
C. Evaluation of arithmetic expressions
D. All of the above
35.Which of the following is not the part of ADT description?
A. Data
B. Operations
C. Both of the above
D. None of the above
36.A graph is a collection of nodes, called ________ And line segments called arcs or ________ that connect pair of nodes.
A. Vertices, edges
B. Edges, vertices
C. Vertices, paths
D. Graph node, edges
37.The way in which the data item or items are logically related defines __________
A. Storage structure
B. Data structure
C. Data relationship
D. Data operation
38.In a circular queue, the value of r will be ________
A. r = r + 1
B. r = (r + 1)% [QUEUE_SIZE – 1]
C. r=( r + 1)% QUEUE_SIZE
D. r=(r - 1)% QUEUE_SIZE
39. There is an extra element at the head of the list called a __________
A. Antinel
B. Sentinel
C. List header
D. List head
40.State true or false.
(i) The degree of root node is always zero.
(ii) Nodes that are not root and not leaf are called as internal nodes.
A. True, True
B. True, False
C. False, True
D. False, False
41.The use of pointers to refer elements of a data structure in which elements are logically adjacent is _________.
A. Pointers
B. Linked allocation
C. Stack
D. Queue
42. In the _________ traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
A.Depth First
B. Breadth First
C. With First
D. Depth Limited
43. Which of the following statements are true?
1. Linked list has more storage over head than array, considering both are of same size.
2. Linked list's size is fixed whereas array's size can be varied dynamically.
3. The list elements cannot be inserted or removed from the linked list.
A. Only 1 and 2
B. Only 1
C. Only 2 and 3
D. Only 2
E .1, 2 and 3
44.Which of the following statements is/are true?
1. The time complexity for searching an element in binary search tree is O(log n).
2. The time complexity for searching an element in binary tree is O(n).
3. The time complexity for searching an element in binary tree and binary search tree cannot be determined.
A. Both 1 and 2
B. Only 1
C. Only 2
D. Only 2 and 3
E. 1, 2 and 3
45.Given four algorithms A, B, C, D with time complexities as follows: A-O(n) B-O(log log n) C-O(log n) D-O(1) where n > 1 Select the option, which gives the algorithms in increasing order of their time complexities.
A. C B A D
B. B C D A
C. A D B C
D. A D C B
E. None of these
46.Which of the following searching methods takes a time complexity of O(1) to search an element?
A. Linear search
B. Binary search
C. Hash based search (Hashing)
D. Tree based search
E. None of the above
47. A tree data structure has 100 nodes. What is the number of nodes in this tree having no ancestor?
A. 50
B. 1
C. 0
D. 55
E. None of these
48. Inorder traversal of Binary Search Tree gives which of the following?
A. Descending order of inserted elements
B. Random order of inserted elements
C. Ascending order of inserted elements
D. The order in which the elements are inserted
E. None of the above