Home
Current Affairs January 2024

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

Correct Answer :

A. Arrays


Related Questions

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

Which of the following is not the required condition for binary search algorithm?

A. The list must be sorted

B. there should be the direct access to the middle element in any sublist

C. There must be mechanism to delete and/or insert elements in list

D. none of above

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

The term push and pop is related to the

A. array

B. lists

C. stacks

D. all of above

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

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

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

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

……………. 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

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 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

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

Which data structure allows deleting data elements from and inserting at rear?

A. Stacks

B. Dequeues

C. Queues

D. Binary search tree

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 situation when in a linked list START=NULL is

A. underflow

B. overflow

C. housefull

D. saturated

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

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

Which of the following algorithm design technique is used in the quick sort algorithm?

A. Dynamic programming

B. Greedy method

C. Divide and conquer

D. Backtracking

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

The complexity of linear search algorithm is

A. O(n)

B. O(log n)

C. O(n2)

D. O(n log n)

What is the correct answer?

4

The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?

A. 11

B. 12

C. 13

D. 14

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

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 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

_______ 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 data structures are indexed structures?

A. linear arrays

B. linked lists

C. both of above

D. none of 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

Two dimensional arrays are also called

A. tables arrays

B. matrix arrays

C. both of above

D. none of above

What is the correct answer?

4

The operation of processing each element in the list is known as

A. Sorting

B. Merging

C. Inserting

D. Traversal

What is the correct answer?

4

A data structure where elements can be added or removed at either end but not in the middle

A. Linked lists

B. Stacks

C. Queues

D. Deque