Home
Current Affairs January 2024

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

Correct Answer :

D. All of the above


Related Questions

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

The elements of an array are stored successively in memory cells because

A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

B. the architecture of computer memory does not allow arrays to store other than serially

C. both of above

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

_______ 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 data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

A. elementary items

B. atoms

C. scalars

D. all 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

When determining the efficiency of algorithm, the space factor is measured by

A. Counting the maximum memory needed by the algorithm

B. Counting the minimum memory needed by the algorithm

C. Counting the average memory needed by the algorithm

D. Counting the maximum disk space needed by the algorithm

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

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

Which of the following data structure is linear type?

A. Graph

B. Binary tree

C. Trees

D. Stack

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

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

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 store the homogeneous data elements?

A. Arrays

B. Records

C. Pointers

D. None

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

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

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

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

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

Which of the following is non-liner data structure?

A. List

B. Stacks

C. Trees

D. Strings

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

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

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

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

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

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