bidezones.com /Data structure/ Linear Data Structures - List Sample Test,Sample questions

Question:
 A list that has no nodes is called________.

1. End list.

2.Zero list.

3.Null list.

4.Sentinel list.

Posted Date:-2022-07-11 12:27:14


Question:
 A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.

1. n.

2.n+1.

3.n+2

4.n-1.

Posted Date:-2022-07-11 12:45:08


Question:
 A vertex of degree one is called __________

1.padent

2.isolated vertex

3.null vertex

4.colored vertex

Posted Date:-2022-07-11 12:46:30


Question:
 An edge E is called _________ if it has identical endpoints.

1.multiple edges.

2.loops

3.finite

4.digraph

Posted Date:-2022-07-11 12:39:24


Question:
 Divide and conquer is an important algorithm design paradigm based on _______.

1. multi-branched recursion.

2.single-branched recursion

3. two-way recursion

4.None.

Posted Date:-2022-07-11 12:54:31


Question:
 Each entry in a linked list is a called a_______________.

1.Link.

2.Node

3. Data Structure

4.Avail

Posted Date:-2022-07-11 13:01:04


Question:
 In a graph G if e=(u,v), then u and v are called ___________.

1.endpoints.

2.adjacent nodes.

3.neighbours

4.All of the above

Posted Date:-2022-07-11 12:50:15


Question:
 In a linked list the _________field contains the address of next element in the list.

1.Link field.

2.Next element field

3. Start field

4. Info field .

Posted Date:-2022-07-11 12:26:19


Question:
 The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is

1. log2N

2.n-1

3.n

4.None of the above

Posted Date:-2022-07-11 12:59:20


Question:
 The correctness of a divide and conquer algorithm is usually proved by _________.

1.mathematical theorem.

2. de-Morgan `s law

3.mat hematical induction

4. none.

Posted Date:-2022-07-11 12:55:27


Question:
 The possibility of two different keys k1 & k2 yielding the same hash address is called_______

1. merge.

2.obstacle

3.overlapping

4.collision

Posted Date:-2022-07-11 12:37:02


Question:
 Which of the following is two way lists?

1.Grounded header list.

2.Circular header list.

3. Linked list with header and trailer nodes.

4.List traversed in two directions.

Posted Date:-2022-07-11 12:25:29


Question:
. If every node u in G is adjacent to every other node v in G, A graph is said to be _______.

1. isolate.

2.complete

3.finite

4.Strongly connected.

Posted Date:-2022-07-11 12:49:21


Question:
A connected graph T without any cycles is called _____________.

1. a tree graph.

2. free tree.

3.a tree.

4.All of the above

Posted Date:-2022-07-11 12:48:04


Question:
A ______________ list is a header list where the node points back to the header node.

1.. Circular header.

2.Grounded header.

3.Two way header.

4. One way header.

Posted Date:-2022-07-11 12:30:50


Question:
An algorithm that calls itself directly or indirectly is known as ____________.

1.Sub algorithm.

2.Recursion

3.Polish notation.

4.Traversal algorithm.

Posted Date:-2022-07-11 12:32:27


Question:
How do you instantiate an array in Java?

1.int arr[] = new int(3);

2. int arr[];

3.int arr[] = new int[3];

4.. int arr() = new int(3);

Posted Date:-2022-07-11 12:22:03


Question:
How many pointers are necessarily changed for the insertion in a Linked List?

1.1

2.2

3.3

4.6

Posted Date:-2022-07-11 12:31:28


Question:
Quick sort uses ____ for implementation.

1. recursion.

2.traversal

3.heaps

4.queues

Posted Date:-2022-07-11 13:02:40


Question:
Selection sort and quick sort both fall into the same category of sorting algorithms._________ is thatcategory.

1.O(n log n) sorts.

2.Divide-and-conquer sorts

3.Interchange sorts.

4.Average time is quadratic.

Posted Date:-2022-07-11 12:36:15


Question:
The average number of key comparisons done in a successful sequential search in a list of length n is_________

1.log n.

2.n-1/2.

3. n/2.

4.n+1/2.

Posted Date:-2022-07-11 12:53:24


Question:
The data items in a record form a ________ structure which can be described by means of level numbers.

1. hierarchical.

2.procedural

3.indexed

4.leveled

Posted Date:-2022-07-11 12:43:20


Question:
The efficiency of a BFS algorithm is dependent on _______.

1.Algorithm.

2.Tree

3.Problem

4.Graph

Posted Date:-2022-07-11 12:52:30


Question:
The efficient searching algorithm for algorithm for a sorted array is _________.

1. Binary search.

2. Linear search

3. Indexed search

4. Repeated search.

Posted Date:-2022-07-11 12:28:58


Question:
The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.

1. row major order.

2.column major order.

3.random order.

4.successive order.

Posted Date:-2022-07-11 12:34:10


Question:
The special list which consists of unused memory space is called __________.

1. Free space.

2.Empty space.

3.. Available space.

4. Free storage list.

Posted Date:-2022-07-11 12:28:00


Question:
The ____________ is used in an elegant sorting algorithm.

1. Heap sort.

2.Quick sort.

3.Merge sort.

4.Radix sort.

Posted Date:-2022-07-11 12:56:18


Question:
To insert a new node in linked list free node will be available in ___________.

1.Available list.

2.Avail list.

3. Free node list.

4. Memory space list.

Posted Date:-2022-07-11 12:29:46


Question:
Uniform distribution of the hash address throughout the given set L is _________

1. reduce the number of collision.

2.increase the number of collision.

3.totally avoid collision

4.manage address.

Posted Date:-2022-07-11 12:38:23


Question:
Which of the following is a correct way to declare a multidimensional array in Java?

1. int[] arr;

2. int arr[[]];

3.int[][]arr;

4. int[[]] arr;

Posted Date:-2022-07-11 12:22:57


Question:
Which of the following is true while inserting a new node in the list?

1.Check there is node in the list.

2.Check in the free node in the pool.

3.There is no node

4.Underflow

Posted Date:-2022-07-11 12:51:04


Question:
___ is finding a path/tour through the graph such that every vertex is visited exactly once.

1. Travelling Salesman tour.

2. Eulerian tour.

3.Hamiltonian tour.

4.None of These

Posted Date:-2022-07-11 12:57:06


Question:
______ is not a technique of tree traversal.

1.pre-order

2.post-order

3.prefix

4. in-order

Posted Date:-2022-07-11 12:35:07


Question:
_________ data structure is used to implement Depth First search.

1.Array.

2.Linked list.

3.Queue

4.Stack

Posted Date:-2022-07-11 12:58:00


Question:
_________involves maintaining two tables in memory.

1.Arranging.

2.Bonding

3.Combing

4.Chaining

Posted Date:-2022-07-11 12:42:36


More MCQS[bidezones.com ]

  1. Data Structures and algorithms MCQ Questions
  2. Data Structure -Abstract Data Types
  3. Data Structure Questions and Answers Singly Linked
  4. Data Structures &algorithms MCQ Questions
  5. Data Structure Multiple Choice Questions and Answers
  6. Data Structure (DS) MCQ Set 1
  7. Data Structure (DS) MCQ Set 2
  8. Data Structure and Algorithms (DSA) set 1
  9. Data Structure and Algorithms (DSA) set 2
  10. Data Structure and Algorithms (DSA) set 3
  11. Data Structure and Algorithms (DSA) set 4
  12. Data Structure and Algorithms (DSA) set 5
  13. Linear Data Structures - List
  14. Data Structure MCQ questions and answer
  15. Data Structure MCQ questions and answer