Home
Current Affairs January 2024

What is the correct answer?

4

Which of the following is two way list?

A. grounded header list

B. circular header list

C. linked list with header and trailer nodes

D. none of above

Correct Answer :

D. none of above


Related Questions

What is the correct answer?

4

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

A. Stack

B. Input restricted dequeue

C. Priority queues

D. Output restricted qequeue

What is the correct answer?

4

Which of the following statement is true ?

A. Breath first search cannot be used to find converted components of a graph.

B. Optimal binary search tree construction can be performed efficiently using dynamic programming.

C. Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe

D. Depth first search can be used to find connected components of a graph.

What is the correct answer?

4

In linear search algorithm the Worst case occurs when

A. The item is somewhere in the middle of the array

B. The item is not in the array at all

C. The item is the last element in the array

D. The item is the last element in the array or is not there at all

What is the correct answer?

4

Which of the following data structure can't store the non-homogeneous data elements?

A. Arrays

B. Records

C. Pointers

D. Stacks

What is the correct answer?

4

When new data are to be inserted into a data structure, but there is no available space; this situation is usually called

A. underflow

B. overflow

C. housefull

D. saturated

What is the correct answer?

4

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

What is the correct answer?

4

Herder node is used as sentinel in ____

A. Graphs

B. Binary tree

C. Stacks

D. Queues

What is the correct answer?

4

When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

A. FAEKCDBHG

B. FAEKCDHGB

C. EAFKHDCBG

D. FEAKDCHBG

What is the correct answer?

4

For an algorithm the complexity of the average case is

A. Much more complicated to analyze than that of worst case

B. Much more simpler to analyze than that of worst case

C. Sometimes more complicated and some other times simpler than that of worst case

D. None or above

What is the correct answer?

4

______ 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

What is the correct answer?

4

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

What is the correct answer?

4

The complexity of merge sort algorithm is

A. O(n)

B. O(log n)

C. O(n2)

D. O(n log n)

What is the correct answer?

4

Which of the following is non-liner data structure?

A. List

B. Stacks

C. Trees

D. Strings

What is the correct answer?

4

The situation when in a linked list START=NULL is

A. underflow

B. overflow

C. housefull

D. saturated

What is the correct answer?

4

Two main measures for the efficiency of an algorithm are

A. Processor and memory

B. Complexity and capacity

C. Time and space

D. Data and space

What is the correct answer?

4

Which of the following data structure is linear type?

A. Graph

B. Binary tree

C. Trees

D. Stack

What is the correct answer?

4

_____ is not the component of data structure.

A. Operations

B. Algorithms

C. Storage Structures

D. None of above

What is the correct answer?

4

The Average case occur in linear search algorithm

A. When Item is somewhere in the middle of the array

B. When Item is not in the array at all

C. When Item is the last element in the array

D. When Item is the last element in the array or is not there at all

What is the correct answer?

4

The difference between linear array and a record is

A. An array is suitable for homogeneous data but the data items in a record may have different data type

B. In a record, there may not be a natural ordering in opposed to linear array.

C. A record form a hierarchical structure but a linear array does not

D. All of above

What is the correct answer?

4

The complexity of Binary search algorithm is

A. O(n)

B. O(log )

C. O(n2)

D. O(n log n)

What is the correct answer?

4

Which if the following is/are the levels of implementation of data structure

A. Application level

B. Abstract level

C. Implementation level

D. All of the above

What is the correct answer?

4

Linked list are not suitable data structure of which one of the following problems ?

A. Binary search

B. Insertion sort

C. Radix sort

D. Polynomial manipulation

What is the correct answer?

4

Merge sort uses ?

A. Divide and conquer strategy

B. Backtracking approach

C. Heuristic search

D. Greedy approach

What is the correct answer?

4

Which of the following data structure cant store the non-homogeneous data elements?

A. Arrays

B. Records

C. Pointers

D. None

What is the correct answer?

4

Which of the following data structure store the homogeneous data elements?

A. Arrays

B. Records

C. Pointers

D. None

What is the correct answer?

4

Which of the following data structure is linear data structure?

A. Trees

B. Graphs

C. Arrays

D. None of above

What is the correct answer?

4

The number of possible ordered trees with three nodes A,B,C is?

A. 16

B. 12

C. 6

D. 10

What is the correct answer?

4

_______ level is where the model becomes compatible executable code

A. Abstract level

B. Implementation level

C. Application level

D. All of the above

What is the correct answer?

4

Which of the following name does not relate to stacks?

A. FIFO lists

B. LIFO list

C. Piles

D. Push-down lists

What is the correct answer?

4

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