Monday, 1 August 2016

RGPV Data Structure Objectives | RGPV CS-112 Data Structure MCQ www.rgpv.ac.in

RGPV Data Structure Objectives | RGPV CS-112 Data Structure MCQ



QUESTION_TEXT
Answer Choice 1
Answer Choice 2
Answer Choice 3
Answer Choice 4
  Big Oh notation is a method that is used to express the _______ of the running time of an algorithm
Lower bound
Upper bound
Both (a) and (b)
None of these
Which of the following is non-liner data structure?
Stacks
 List 
Strings
Trees
   Which of the following is an example of primitive data structure
Integer
Array
Tree
Stack
Which of the following data structure is based on First In First Out(FIFO)
    Integer
Array
 Stack
 Queue
    _______ is a data structure which arrange its nodes in the form of hierarchal structure
  Stack
Graph
 Linked List
Tree
    Which of the following is correct representation of Omega (Ω ) notation
F (n) >= g (n)
 F (n) <= g (n)
 C1 g (n) <= F (n) <= C2 g (n)
None of these
  Efficiency of an algorithm is a trade of between which of the following
  Time and Space
 Input & Output
Compilation & Running
None
 Which of the following is typical data structure operation
  Insertion
 Deletion
 Searching
 All of the above
  Which of the following is not true for algorithm
It is a set of instructions that defines the solution for a given problem
 It can be represented in the form of pseudo code or flowchart
It should have at least one valid input value 
It is possible to have multiple algorithm for same problem
 _________notation is a method that is used to express the running time of an algorithm between lower and upper bound
 Big Oh
Beta
Theta
Omega
__________is a programming technique in which function call itself
Iteration
Recursion
Analysis
None of the above     
   The algorithm design technology used in the quick sort and merge sort algorithm is:
   Dynamic Programming
Backtracking
Divide & Conquer
Greedy Method
The worst case time complexity of insertion sort algorithm to sort n element is
   O(n) 
O(n log 2 n)
O(n^1.2)
O(n^2)
   In the quick sort method, a desirable choice for partitioning elements will be
     First element of list 
Last element of list
Median of List
None
   What is the index number of the last element of an array with 29 elements?
29
28
0
Programmer - defined
   Which of the following algorithm does not divide the list
    Linear Search
 Binary Search
Merge sort
Quick sort
Which of the following statements is used in binary search algorithm to halve an array
 Mid=(beg+ end) /2 
Mid=(beg)+ end/2 
Mid=(beg-end) /2 
Mid= mid /2 
    In which sorting there is a need of secondary storage device
  Internal
External
Both
 None
_________ is a collection of heterogeneous data elemen
    Array
 Stack
 structure
None
Which string library functions is used to compare two strings, which avoids the comparison on the basis of case sensitivity
   Strrev
Strcmp
Strcmpi
 Strcat
  The five items: A,B,C,D and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is:
 
B
C
 D
If a POP operation is performed on an empty stack, then which of the following situations will occur?
Overflow
Underflow 
Array out of bound
 None of the above
Stack is useful for implementing
  radix 
 breadth first search
recursion 
none of the above
  CPU Scheduler can be implemented by which of the following data structures?
Stack
 Queue
Graph 
Tree
Which of the following statements is true about doubly linked list?
  It allows list traversal only in forward direction    
 It allows list traversal only in backward direction 
It allows list traversal only in both forward and backward direction  
It allows complete list traversal starting from  any of the nodes
The minimum number of fields with each node of double linked list is
     1    
2
3
4
Traversing a binary tree first root and then left and right subtrees is called ___________Traversal
Postorder
 Preorder
Inorder
None of the above
 The first node in a binary tree is called _________
Child 
parent
sibling
forest
What is the worst case time for quick sort to sort an array of n elements?
   O(n) 
O(n log 2 n)
O(n^1.2)
O(n^2)
The number of nodes in a full binary tree of depth 4 is
15
16
14
13
Which of the following is useful in traversing a given graph by breadth first search?
Stack
Set
 List
Queue
Linked lists are best suited
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
 for both of above situation
for none of above situation
In linear search algorithm the Worst case occurs when
The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
Which of the following case does not exist in complexity theory
Best Case
Worst Case
Average Case
Null Case
The memory address of the first element of an array is called
floor address
foundation address
 first address
base address
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
underflow
overflow
housefull
 saturated
The situation when in a linked list START=NULL is
underflow
overflow
housefull
 saturated
The term "push" and "pop" is related to the
Array
List
Stack
All of the above
Other name for directed graph is ..........
Direct graph
Diagram
Dir-graph
Digraph
A terminal node in a binary tree is called ............
Root
Leaf
Child
Branch
A graph is said to be ....... if every node u in G is adjacent to every other node v in G.
Absolute
 Entire
 Inclusive
 Complete
A graph is said to be ....... if its edges are assigned data.
Tagged
Marked
Labelled
 Sticked
Three standards ways of traversing a binary tree T with root R .......
Prefix, infix, postfix
Pre-process, in-process, post-process
 Pre-traversal, in-traversal, post-traversal
Pre-order, in-order, post-order
In a graph if E=(u,v) means ......
u is adjacent to v but v is not adjacent to u
 e begins at u and ends at v
u is processor and v is successor
both b and c
Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
push, pop
 pop, push
 insert, delete
delete, insert
Which of the following is not the part of ADT description?
Data
 Operations
Both of the above
None of the above
Which if the following is/are the levels of implementation of data structure
Abstract level
Application level
 Implementation level
 All of the above
TREE[1]=NULL indicates tree is ........
Overflow
Underflow
Empty
Full








Correct Answer Choice Text

Upper bound
1
Trees
2
Integer
3
 Queue
4
Tree
5
F (n) >= g (n)
6
  Time and Space
7
 All of the above
8
It should have at least one valid input value 
9
Theta
10
Recursion
11
Divide & Conquer
12
O(n^2)
13
Median of List
14
28
15

16
 Mid=(beg+ end) /2 
17
External
18
 structure
19
Strcmpi
20
 D
21
Underflow 
22
recursion 
23
 Queue
24
It allows list traversal only in both forward and backward direction  
25
3
26
 Preorder
27
Child 
28
O(n^2)
29
15
30
Queue
31
for the size of the structure and the data in the structure are constantly changing
32
The item is the last element in the array or is not there at all
33
Time and space
34
Search
35
Null Case
36
base address
37
overflow
38
underflow
39
Stack
40
Digraph
41
Leaf
42
 Complete
43
Labelled
44
Pre-order, in-order, post-order
45
both b and c
46
push, pop
47
None of the above
48
 All of the above
49
Empty
50


1. Which if the following is/are the levels of implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
4. Stack is also called as
A) Last in first out
B) First in last out
C) Last in last out
D) First in first out
5. Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
A) True, False
B) False, True
C) True, True
D) False, False
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
7. 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
8. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
A) push, pop
B) pop, push
C) insert, delete
D) delete, insert
9. ……………. Is 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
10. ………… 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
11. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree
12. Which of the following data structure can’t store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks
13. A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
A) Queue linked list
B) Stacks linked list
C) Both of them
D) Neither of them
14. Which of the following is non-liner data structure?
A) Stacks
B) List
C) Strings
D) Trees
15. Herder node is used as sentinel in …..
A) Graphs
B) Stacks
C) Binary tree
D) Queues



16. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array
17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A) Input restricted dequeue
B) Output restricted qequeue
C) Priority queues
D) Stack
18. Which of the following data structure is non linear type?
A) Strings
B) Lists
C) Stacks
D) Graph
19. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack
20. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
21. 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
22. 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
23. State True of False.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair of vertices.
A) True, False, True
B) True, True, False
C) True, True, True
D) False, True, True
24. Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
A) a-iii, b-ii, c-i
B) a-i, b-ii, c-iii
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii
25. The number of comparisons done by sequential search is ………………
A) (N/2)+1
B) (N+1)/2
C) (N-1)/2
D) (N+2)/2
26. In ……………, search start at the beginning of the list and check every element in the list.
A) Linear search
B) Binary search
C) Hash Search
D) Binary Tree search
27. State True or False.
i) Binary search is used for searching in a sorted array.
ii) The time complexity of binary search is O(logn).
A) True, False
B) False, True
C) False, False
D) True, True
28. Which of the following is not the internal sort?
A) Insertion Sort
B) Bubble Sort
C) Merge Sort
D) Heap Sort
29. State True or False.
i) An undirected graph which contains no cycles is called forest.
ii) A graph is said to be complete if there is an edge between every pair of vertices.
A) True, True
B) False, True
C) False, False
D) True, False
30. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
A) Partite
B) Bipartite
C) Rooted
D) Bisects
31. 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
32. 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
33. Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
A) i-only
B) ii-only
C) Both i and ii
D) None of both
34. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
A) Lists
B) Linked Lists
C) Trees
D) Queues
35. 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
36. ………… is not the operation that can be performed on queue.
A) Insertion
B) Deletion
C) Retrieval
D) Traversal
37. There is an extra element at the head of the list called a ……….
A) Antinel
B) Sentinel
C) List header
D) List head
38. 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
39. 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
40. In general, the binary search method needs no more than ……………. comparisons.
A) [log2n]-1
B) [logn]+1
C) [log2n]
D) [log2n]+1
41. Which of the following is not the type of queue?
A) Ordinary queue
B) Single ended queue
C) Circular queue
D) Priority queue
42. 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
43. 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
44. 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
45. 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
B) True, False
C) False, True
D) False, False
46. ………………. 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
47. 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
48. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree
49. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
A) Unary tree
B) Binary tree
C) Trinary tree
D) Both B and C
50. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the out-degree of every node is either o or 2.
A) True, False
B) False, True
C) True, True
D) False, False
51. Which of the following data structures are indexed structures?
A. Linear arrays
B. Linked lists
C. Queue
D. Stack
52. Which of the following data structure store the homogeneous data elements?
A. Arrays
B. Records
C. Pointers
D. Lists
53. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….
A. Underflow
B. overflow
C. houseful
D. saturated
54. A data structure where elements can be added or removed at either end but not in the middle is called …
A. linked lists
B. stacks
C. queues
D. dequeue
55. Operations on a data structure may be …..
A. creation
B. destruction
C. selection
D. all of the above
56. 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
57. Which of the following are the operations applicable an primitive data structures?
A. create
B. destroy
C. update
D. all of the above
58. 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
59. Arrays are best data structures
A. for relatively permanent collections of data
B. for the size of the structure and the data in the structure are constantly changing
C. for both of above situation
D. for non of above situation
60. Which of the following statement is false?
A. Arrays are dense lists and static data structure.
B. Data elements in linked list need not be stored in adjacent space in memory
C. Pointers store the next data element of a list.
D. Linked lists are collection of the nodes that contain information part and next pointer.
Data Structures and Algorithms Multiple Choice Questions and Answers :-
61. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
62. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
63. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
64. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
65. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
66. Arrays are best data structures …………
A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are constantly changing
C) For both of above situation
D) For none of the above
67. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
68. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
69. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
70. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
71. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Tree
72. Which of the following data structure is linear type?
A) Array
B) Tree
C) Graphs
D) Hierarchy
73. The logical or mathematical model of a particular organization of data is called a ………
A) Data structure
B) Data arrangement
C) Data configuration
D) Data formation
74. The simplest type of data structure is ………………
A) Multidimensional array
B) Linear array
C) Two dimensional array
D) Three dimensional array
75. Linear arrays are also called ……………….
A) Straight line array
B) One-dimensional array
C) Vertical array
D) Horizontal array
76. Arrays are best data structures …………
A) For relatively permanent collections of data.
B) For the size of the structure and the data in the structure are constantly changing
C) For both of above situation
D) For none of the above
77. Which of the following data structures are indexed structures?
A) Linear arrays
B) Linked lists
C) Graphs
D) Trees
78. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field
79. A …………………… does not keep track of address of every element in the list.
A) Stack
B) String
C) Linear array
D) Queue
80. When does top value of the stack changes?
A) Before deletion
B) While checking underflow
C) At the time of deletion
D) After deletion
91. Arrays are best data structures
A) for relatively permanent collections of data
B) for the size of the structure and the data in the structure are constantly changing
C) for both of above situation
D) for none of above situation
92. Which of the following data structure is not linear data structure?
A) Arrays
B) Linked lists
C) Both of the above
D) None of the above
93. The disadvantage in using a circular linked list is …………………….
A) It is possible to get into infinite loop.
B) Last node points to first node.
C) Time consuming
D) Requires more memory space
94. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A) Singly Linked List
B) Circular Linked List
C) Doubly Linked List
D) Linear Linked List
95. 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
96. In a priority queue, insertion and deletion takes place at ………………
A) front, rear end
B) only at rear end
C) only at front end
D) any position
97. The time complexity of quick sort is …………..
A) O(n)
B) O(n2)
C) O(n log n)
D) O(log n)
98. Which of the following is an application of stack?
A) finding factorial
B) tower of Hanoi
C) infix to postfix conversion
D) all of the above
99. The data structure which is one ended is ………………
A) queue
B) stack
C) tree
D) graph
100. A list which displays the relationship of adjacency between elements is said to be
A) linear
B) non linear
C) linked list
D) trees



 Data Structure practical questions,   Data Structure rgpv practical papers,  Data Structure practical papers,  Data Structure cbcs practical questions, www.rgpv.ac.in
Share This
Previous Post
Next Post

Pellentesque vitae lectus in mauris sollicitudin ornare sit amet eget ligula. Donec pharetra, arcu eu consectetur semper, est nulla sodales risus, vel efficitur orci justo quis tellus. Phasellus sit amet est pharetra

2 comments: