Home
Current Affairs January 2024

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

Correct Answer :

A. AVL tree


Related Questions

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

A. Arrays

B. Records

C. Pointers

D. Stacks

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

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

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

The memory address of the first element of an array is called

A. floor address

B. foundation address

C. first address

D. base address

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

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

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

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 memory address of fifth element of an array can be calculated by the formula

A. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

B. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array

C. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array

D. None of above

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

______ 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

Merge sort uses ?

A. Divide and conquer strategy

B. Backtracking approach

C. Heuristic search

D. Greedy approach

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

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

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

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

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

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

A. Array

B. Stack

C. Tree

D. queue

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

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

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

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

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

A. Tree

B. Graph

C. Priority

D. Dequeue