Home
Current Affairs January 2024

What is the correct answer?

4

Which of the following data structure is linear data structure?

A. Trees

B. Graphs

C. Arrays

D. None of above

Correct Answer :

C. Arrays


Related Questions

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

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

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

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

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

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

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 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 data structure is linear type?

A. Graph

B. Binary tree

C. Trees

D. Stack

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

A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

A. Stacks linked list

B. Queue linked list

C. Both of them

D. Neither of them

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

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

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

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 data structure is linear data structure?

A. Trees

B. Graphs

C. Arrays

D. None of above

What is the correct answer?

4

Which of the following is not a limitation of binary search algorithm?

A. must use a sorted array

B. requirement of sorted array is expensive when a lot of insertion and deletions are needed

C. there must be a mechanism to access middle element directly

D. binary search algorithm is not efficient when the data elements are more than 1000.

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

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

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

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

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

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

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

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)