Home
Current Affairs January 2024

What is the correct answer?

4

Which data structure is used in breadth first search of a graph to hold nodes?

A. Array

B. Stack

C. Tree

D. queue

Correct Answer :

D. queue


Related Questions

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

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

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

What is the correct answer?

4

Binary search algorithm can not be applied to

A. sorted linked list

B. sorted binary trees

C. sorted linear array

D. pointer array

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

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

What is the correct answer?

4

Finding the location of the element with a given value is:

A. Traversal

B. Search

C. Sort

D. None of above

What is the correct answer?

4

Which of the following data structure is non linear type?

A. Lists

B. Strings

C. Graph

D. Stacks

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

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

_______ 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

Each array declaration need not give, implicitly or explicitly, the information about

A. the name of array

B. the data type of array

C. the index set of the array

D. the first data from the set to be stored

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

Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

A. mn

B. max(m,n)

C. min(m,n)

D. m+n-1

What is the correct answer?

4

Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?

A. 3,4,5,2,1

B. 3,4,5,1,2

C. 5,4,3,1,2

D. 1,5,2,3,4

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

The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

A. 3 additions and 2 deletions

B. 2 deletions and 3 additions

C. 3 deletions and 4 additions

D. 3 deletions and 3 additions

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

To represent hierarchical relationship between elements, Which data structure is suitable?

A. Tree

B. Graph

C. Priority

D. Dequeue

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

A variable P is called pointer if

A. P contains the address of an element in DATA.

B. P points to the address of first element in DATA

C. P can store only memory addresses

D. P contain the DATA and the address of DATA

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

……………. Is a pile in which items are added at one end and removed from the other.

A. Queue

B. Stack

C. List

D. None of the above

What is the correct answer?

4

When determining the efficiency of algorithm the time factor is measured by

A. Counting microseconds

B. Counting the number of key operations

C. Counting the number of statements

D. Counting the kilobytes of algorithm

What is the correct answer?

4

If the values of a variable in one module is indirectly changed by another module, this situation is called

A. internal change

B. inter-module change

C. side effect

D. side-module update

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

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

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

Which of the following data structure is not linear data structure?

A. Arrays

B. Linked lists

C. Both of above

D. None of above

What is the correct answer?

4

Which of the following case does not exist in complexity theory

A. Best case

B. Null case

C. Worst case

D. Average case