Data structure MCQ Quiz Hub

1. How do you instantiate an array in Java?
int arr[] = new int(3);
int arr[];
int arr[] = new int[3];
. int arr() = new int(3);

2. Which of the following is a correct way to declare a multidimensional array in Java?
int[] arr;
int arr[[]];
int[][]arr;
int[[]] arr;

3. Which of the following is two way lists?
Grounded header list.
Circular header list.
Linked list with header and trailer nodes.
List traversed in two directions.

4. In a linked list the _________field contains the address of next element in the list.
Link field.
Next element field
Start field
Info field .

5. A list that has no nodes is called________.
End list.
Zero list.
Null list.
Sentinel list.

6. The special list which consists of unused memory space is called __________.
Free space.
Empty space.
. Available space.
Free storage list.

7. The efficient searching algorithm for algorithm for a sorted array is _________.
Binary search.
Linear search
Indexed search
Repeated search.

8. To insert a new node in linked list free node will be available in ___________.
Available list.
Avail list.
Free node list.
Memory space list.

9. A ______________ list is a header list where the node points back to the header node.
. Circular header.
Grounded header.
Two way header.
One way header.

10. How many pointers are necessarily changed for the insertion in a Linked List?
1
2
3
6

11. An algorithm that calls itself directly or indirectly is known as ____________.
Sub algorithm.
Recursion
Polish notation.
Traversal algorithm.

12. The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.
row major order.
column major order.
random order.
successive order.

13. ______ is not a technique of tree traversal.
pre-order
post-order
prefix
in-order

14. Selection sort and quick sort both fall into the same category of sorting algorithms._________ is thatcategory.
O(n log n) sorts.
Divide-and-conquer sorts
Interchange sorts.
Average time is quadratic.

15. The possibility of two different keys k1 & k2 yielding the same hash address is called_______
merge.
obstacle
overlapping
collision

16. Uniform distribution of the hash address throughout the given set L is _________
reduce the number of collision.
increase the number of collision.
totally avoid collision
manage address.

17. An edge E is called _________ if it has identical endpoints.
multiple edges.
loops
finite
digraph

18. _________involves maintaining two tables in memory.
Arranging.
Bonding
Combing
Chaining

19. The data items in a record form a ________ structure which can be described by means of level numbers.
hierarchical.
procedural
indexed
leveled

20. A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
n.
n+1.
n+2
n-1.

21. A vertex of degree one is called __________
padent
isolated vertex
null vertex
colored vertex

22. A connected graph T without any cycles is called _____________.
a tree graph.
free tree.
a tree.
All of the above

23. . If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
isolate.
complete
finite
Strongly connected.

24. In a graph G if e=(u,v), then u and v are called ___________.
endpoints.
adjacent nodes.
neighbours
All of the above

25. Which of the following is true while inserting a new node in the list?
Check there is node in the list.
Check in the free node in the pool.
There is no node
Underflow

26. The efficiency of a BFS algorithm is dependent on _______.
Algorithm.
Tree
Problem
Graph

27. The average number of key comparisons done in a successful sequential search in a list of length n is_________
log n.
n-1/2.
n/2.
n+1/2.

28. Divide and conquer is an important algorithm design paradigm based on _______.
multi-branched recursion.
single-branched recursion
two-way recursion
None.

29. The correctness of a divide and conquer algorithm is usually proved by _________.
mathematical theorem.
de-Morgan `s law
mat hematical induction
none.

30. The ____________ is used in an elegant sorting algorithm.
Heap sort.
Quick sort.
Merge sort.
Radix sort.

31. ___ is finding a path/tour through the graph such that every vertex is visited exactly once.
Travelling Salesman tour.
Eulerian tour.
Hamiltonian tour.
None of These

32. _________ data structure is used to implement Depth First search.
Array.
Linked list.
Queue
Stack

33. The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
log2N
n-1
n
None of the above

34. Each entry in a linked list is a called a_______________.
Link.
Node
Data Structure
Avail

35. Quick sort uses ____ for implementation.
recursion.
traversal
heaps
queues