Solved Multiple Choice Questions of Data
Solved Multiple Choice Questions of Data
Set-1
9Is a pile in which items are added at one end and removed from the other.
A) Stack
B)Queue
C)List
D)None of the above
10is very useful in situation when data have to stored and then retrieved in reverse order.
A) Stack
B)Queue
C)List
D)Link list
11. Which of the following is not the type of queue?
A) Ordinary queue
B)Single ended queue
C)Circular queue
D)Priority queue
12. The property of binary tree is
A) The first subset is called left subtree
B)The second subtree is called right subtree
C)The root cannot contain NULL
D)The right subtree can be empty
13. 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
14. 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
15. State true of false.
i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.
A) True, True
Solved Multiple Choice Questions of Data
B)True, False
C)False, True
D)False, False
16 is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal
A) only a,b and c
B)only a and b
C)All of the above
D)None of the above
17. 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
18. A is an acyclic digraph, which has only one node with indegree 0, and other
nodes have
indegree 1.
A) Directed tree
B)Undirected tree
C)Dis-joint tree
D)Direction oriented tree
19 Is a directed tree in which outdegree of each node is less than or equal to
two.
A) Unary tree
B)Binary tree
C)Dinary tree
D)Both B and C
20. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the outdegree of every node is either o or 2.
A) True, False
B)False, True
C)True, True
D)False, False
Answers
1. D) All of the above
2. A) AVL tree
3. C) Implementation level
4. A) Last in first out
5. C) True, True
6. D) None of above
7. D) None of the above
8. A) push, pop
9. B) Queue
Solved Multiple Choice Questions of Data
10. A) Stack
11. B) Single ended queue
12. D) The right subtree can be empty
13. C) False, True
14.
Solved Multiple Choice Questions of Data
Solved Multiple Choice Questions of Data Structure
Set-1
Set-2
1. A directed graph is if there is a path from each vertex to every other vertex in
the
digraph.
A) Weakly connected
B)Strongly Connected
C)Tightly Connected
D)Linearly Connected
2. In the traversal we process all of a vertex’s descendents before we move to an
adjacent
vertex.
A) Depth First
B)Breadth First
C)With First
D)Depth Limited
17. There is an extra element at the head of the list called a ……….
A) Antinel
B)Sentinel
C)List header
D)List head
18. 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
19. A is a graph that has weights of costs associated with its edges.
A) Network
B)Weighted graph
C)Both A and B
D)None A and B
20. In general, the binary search method needs no more than comparisons.
A) [log2n]-1
B)[logn]+1
C)[log2n]
D)[log2n]+1
Solved Multiple Choice Questions of Data
Answers
1. B) Strongly Connected
2. A) Depth First
3. B) True, True, False
4. C) a-iii, b-i,
c-ii 5. B) (N+1)/2
6. A) Linear search
7. D) True, True
8. C) Merge Sort
9. A) True, True
10. B) Bipartite
11. B) 0 and -1
12. C) r=(r+1)% QUEUE_SIZE
13. C) Both i and ii
14. B) Linked Lists
15. C) 4
16. D) Traversal
17. B) Sentinel
18. A) vertices, edges
19. C) Both A and B
20. D) [log2n]+1
Solved Multiple Choice Questions of Data
Set-1
11)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
16) A is a linear list in which insertions and deletions are made to from either end of the
structure.
A. circular queue
B.random of queue
C.priority
D.dequeue
17) Indexing the. element in the list is not possible in linked lists.
A. middle
B.first
C.last
D.anywhere in between
18)A linear list in which the pointer points only to the successive node is......
A. singly linked list
B.circular linked list
C.doubly linked list
D.none of the above
19) may take place only when there is some minimum amount (or) no space left in free
storage
list.
A. Memory management
B.Garbage collection
C.Recycle bin
D.Memory management
20)A linear list in which the last node points to the first node is ........
A. singly linked list
B.circular linked list
C.doubly linked list
D.none of the above
Solved Multiple Choice Questions of Data
Answers
1) B. for the size of the structure and the data in the structure are constantly changing.
2) D. traversal
3) A.
Underflow 4)
A. 2
5) D. List traversed in two directions
6) B.
AVAIL 7)
A. 0
8) C. circular linked list
9) B. Two fields
10)A. first record of the actual data
11)A. Link field
12)B. predecessor node
13)A. List
14)A. small batches of records from a file
15)B. Sentinel
16)D. dequeue
17)A. middle
18)A. singly linked list
19)B. Garbage collection
20)B. circular linked list
Solved Multiple Choice Questions of Data
Set-2
1) 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
3) 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
6) The pointer that points to the first node in the list is........
A. FIRST
B.AVAIL
C.TOP
D.REAR
9) The list that requires two pointer variables FIRST and LAST is called........
A. Circular list
B.Header list
C.One way list
D.Two way list
10)If the availability list is null, then the condition is said to be.........
A. nil block
B.availability list underflow
C.availability list overflow
D.memory loss
13)A is a header list where the last node contains the null pointer.
A. grounded header list
B.bottom header list
C.down header list
D.dropped header list
15)A is a header list where the last node points back to the header node.
A. rounded header list
B.circular header list
C.common header list
D.forward header list
19)Which of the following conditions checks available free space in avail list?
A. Avail=Null
B.Null=Avail
C.Avail=Max stack
D.Avail=Top
20) A linear list in which each node has point to the predecessor and successors nodes is called
........
A. singly linked list
B.circular linked list
C.doubly linked list
D.linear linked list
Solved Multiple Choice Questions of Data
Answers
1) B. Avail list
2) B. one way chain
3) A. Circular
header 4) C. 2
5) A. Polynomials
6) A. FIRST
8) C. two way chain
9) D. Two way list
10) B. availability list underflow
11) C. free pool
12) D. None of the above
13) A. grounded header list
14) A. successor node
15) B. circular header list
16) D. all of the above
17) C. 3
18) A. it is possible to get into infinite loop
19) A. Avail=Null
20) C. doubly linked list
Solved Multiple Choice Questions of Data
Set-1
1) C. Searching
2) C. Merge Sort
3) A. Insertion sort
4) D. Tree Sort
5) Sorting a file F usually refers to sorting F with respect to a particular key called.....
A. Basic key
B.Primary key
C.Starting key
Solved Multiple Choice Questions of Data
D.Index key
5) B. Primary key
6) D. O(n logn)
7) Selection sort first finds them element in the list and put it in the first position.
A. Middle element
B.Largest element
C.Last element
D.Smallest element
7) D. Smallest element
9) The operation that combines the element is of A and B in a single sorted list C with n=r+s
element is called....
A. Inserting
B.Mixing
C.Merging
D.Sharing
9) C. Merging
10)C. heap
11)C. Radix
16) If the number of record to be sorted large and the key is short, then sorting can be efficient.
A. Merge
B.Heap
C.Radix
D.Bubble
16) C. Radix
18) If the number of record to be sorted large and the key is long, then sorting can be efficient.
A. Merge
B.Heap
C.Quick
D.Bubble
18) C. Quick
20) B. O(n2)
Solved Multiple Choice Questions of Data
Set-2
1) D. Item is the last element in the array or item is not there at all
2) C. Selection
3) The complexity of sorting algorithm measures the as a function of the number n of items to be
sorter.
A. average time
B.running time
C.average-case complexity
D.case-complexity
3) B. running time
4) D. binary search algorithm is not efficient when the data elements more than 1500.
6) D. pointer array
7) A. O(n)
logn) 9) C.
O(n2)
12) order is the best possible for array sorting algorithm which sorts n item.
A. O(n logn)
B.O(n2)
C.O(n+logn)
D.O(logn)
12) C. O(n+logn)
14) Sorting algorithm is frequently used when n is small where n is total number of
elements.
A. Heap
B.Insertion
C.Bubble
D.Quick
Solved Multiple Choice Questions of Data
14)B. Insertion
15) Which of the following is not the required condition for binary search algorithm?
A. The list must be sorted
B.There should be the direct access to the middle element in any sub list
C.There must be mechanism to delete and/or insert elements in list.
D.Number values should only be present
Set-1
2) A. LIFO
3) B. Back
6) C. Stacks
7) A. Reverse
8) A. Push
9) C. Pop
10)A pointer variable which contains the location at the top element of the stack is called.....
A. Top
B.Last
C.Final
D.End
10) A. Top
Solved Multiple Choice Questions of Data
Set-2
1) A. Overflow
2) B. Underflow
3) A. Before insertion
5) A. Front=Null
Solved Multiple Choice Questions of Data
6) The value of REAR is increased by 1 when.......
A. An element is deleted in a queue
B.An element is traversed in a queue
C.An element is added in a queue
D.An element is merged in a queue
8) is a collection of elements such that each element has been assigned a processing
priority.
A. Priority queue
B.Procedure queue
C.Main queue
D.Interrupt queue
8) A. Priority queue
9) Link fields hold pointers to the element in the linked representation of stack.
A. Neighboring
B.Last
C.First
D.Middle
9) A. Neighboring
Set-1
1) D. traversal
2) A. Threaded trees
3) B. Terminal nodes
4) Trees are said if they are similar and have same contents at corresponding nodes.
A. Duplicate
B.Carbon copy
C.Replica
D.Copies
4) D. Copies
5) Every node N in a binary tree T except the root has a unique parent called the of N.
A. Antecedents
B.Predecessor
C.Forerunner
D.Precursor
Solved Multiple Choice Questions of Data
5) B. Predecessor
7) C. Empty
8) C.
9) D. External node
Set-2
1) While converting binary tree into extended binary tree, all the original nodes in binary tree
are.......
A. Internal nodes on extended tree
B.External nodes on extended tree
C.Vanished on extended tree
D.Intermediate nodes on extended tree
2) 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. Leaf
B.Branch
C.Path
D.Thread
2) D. Thread
3) The in order traversal of tree will yield a sorted listing of elements of tree in....
A. Binary trees
B.Binary search trees
C.Merging
D.AVL Trees
4) A binary tree whose every node has either zero or two children is called.........
A. Complete binary tree
B.Binary Search tree
C.Extended binary tree
D.E2 tree
5) The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal.
A. ABFCDE
B.ADBFEC
Solved Multiple Choice Questions of Data
C.ABDECF
D.ABDCEF
5) C. ABDECF
6) B. FAEKCDHGB
7) In linked representation of Binary trees LEFT[k] contains the of at the node N, where k is the
location.
A. Data
B.Location and left child
C.Right child address
D.Null value
7) A. Data
10)B. Leaf
Solved Multiple Choice Questions of Data
Set-3
2) B. Edge
3) D. Path
7) C. Threads
8) A graph is said to be ........... if there is a path between any two of its nodes
A. Connected
B.Coupled
C.Attached
D.Allied
8) A. Connected
9) D. Complete
11)D. Digraph
12) Graph G is if for any pair u, v of nodes in G there is a path from u to v or path from v
to u.
A. Leterally connected
B.Widely Connected
C.Unliterally connected
D.Literally connected