Home
Current Affairs January 2024

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

Correct Answer :

D. the first data from the set to be stored


Related Questions

What is the correct answer?

4

Linked lists are best suited

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

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 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 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 data structure can't store the non-homogeneous data elements?

A. Arrays

B. Records

C. Pointers

D. Stacks

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

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

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

A. Graph

B. Binary tree

C. Trees

D. Stack

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

_____ is not the component of data structure.

A. Operations

B. Algorithms

C. Storage Structures

D. None of above

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

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

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

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

Inserting an item into the stack when stack is not full is called _______ Operation and deletion of item form the stack, when stack is not empty is called _______operation.

A. push, pop

B. insert, delete

C. pop, push

D. delete, insert

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

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

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

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

The complexity of Bubble sort algorithm is

A. O(n)

B. O(log n)

C. O(n2)

D. O(n log n)

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

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

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

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

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

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

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