logo

MCQ Problems / Explanations



Which of the following data structure is not linear data structure?

Last updated: Sat, 8 Feb

The following data structure store the ho- mogeneous data elements

Last updated: Sat, 8 Feb

The difference between linear array and a record is

Last updated: Sat, 8 Feb

A connected graph T without any cycles is called

Last updated: Sat, 8 Feb

In a graph if e=[u, v], Then u and v are called

Last updated: Sat, 8 Feb

In a Heap tree values in a node is greater than

Last updated: Sat, 8 Feb

The in order traversal of tree will yield a sorted listing of elements of tree in

Last updated: Sat, 8 Feb

The following data structure can’t store the non-homogeneous data elements

Last updated: Sat, 8 Feb

The memory address of fifth element of anarray can be calculated by the formula

Last updated: Sat, 8 Feb

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

Last updated: Sat, 8 Feb

The elements of an array are stored suc- cessively in memory cells because

Last updated: Sat, 8 Feb

An algorithm that calls itself directly or indi- rectly is known as

Last updated: Sat, 8 Feb

The following sorting algorithm is of divide- and-conquer type

Last updated: Sat, 8 Feb

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

Last updated: Sat, 8 Feb

The term “push” and “pop” is related to the

Last updated: Sat, 8 Feb

Two dimensional arrays are also called

Last updated: Sat, 8 Feb

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

Last updated: Sat, 8 Feb

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

Last updated: Sat, 8 Feb

All the above* Which of the following data structures are indexed structures

Last updated: Sat, 8 Feb

The space factor when determining the effi- ciency of algorithm is measured by

Last updated: Sat, 8 Feb

The time factor when determining the effi- ciency of algorithm is measured by

Last updated: Sat, 8 Feb

Two main measures for the efficiency of an algorithm are

Last updated: Sat, 8 Feb

The indirect change of the values of a vari- able in one module by another module is called

Last updated: Sat, 8 Feb

The complexity of merge sort algorithm is

Last updated: Sat, 8 Feb

Each array declaration need not give, implicitlyor explicitly, the information about the

Last updated: Sat, 8 Feb

Linked lists are best suited for

Last updated: Sat, 8 Feb

Arrays are best data structures for

Last updated: Sat, 8 Feb

Finding the location of the element with a given value is called

Last updated: Sat, 8 Feb

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

Last updated: Sat, 8 Feb

Which of the following data structure is lin- ear data structure?

Last updated: Sat, 8 Feb

The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

Last updated: Sat, 8 Feb

When converting binary tree into extended binary tree, all the original nodes in binary tree are

Last updated: Sat, 8 Feb

When representing any algebraic expression E the following uses only binary operations in a 2-tree

Last updated: Sat, 8 Feb

When in order traversing a tree resulted E AC K F H D B G; the preorder traversal would return

Last updated: Sat, 8 Feb

The complexity of Bubble sort algorithm is

Last updated: Sat, 8 Feb

The depth of a complete binary tree is given by

Last updated: Sat, 8 Feb

A binary tree whose every node has either zero or two children is called

Last updated: Sat, 8 Feb

To represent hierarchical relationship be- tween elements, the following data structure is not suitable

Last updated: Sat, 8 Feb

The following data structure is linear type

Last updated: Sat, 8 Feb

The following data structure is non-linear type

Last updated: Sat, 8 Feb

This data structure allows deletions at both ends of the list but insertion at only one end.

Last updated: Sat, 8 Feb

The following data structure allows deleting data elements from front and inserting at rear

Last updated: Sat, 8 Feb

The complexity of the average case of analgorithm is

Last updated: Sat, 8 Feb

The Average case occur in linear search al- gorithm

Last updated: Sat, 8 Feb

The Worst case occur in linear search algo- rithm when

Last updated: Sat, 8 Feb

A variable P is called pointer if

Last updated: Sat, 8 Feb

If every node u in G is adjacent to every other node v in G, A graph is said to be

Last updated: Sat, 8 Feb

In a graph if e=(u, v) means

Last updated: Sat, 8 Feb

In a binary tree, certain null entries are re-placed by special pointers which point to nodes higher in tree for ef...

Last updated: Sat, 8 Feb

The following name does not relate to stacks

Last updated: Sat, 8 Feb

The following is two-way list

Last updated: Sat, 8 Feb

The situation when in a linked list START=NULL is

Last updated: Sat, 8 Feb

When new data are to be inserted into a data structure, but there is no available space; this situation is usually ...

Last updated: Sat, 8 Feb

Binary search algorithm cannot be applied to

Last updated: Sat, 8 Feb

Which of the following statement is false ?

Last updated: Sat, 8 Feb

Each data item in a record may be a groupitem composed of sub-items; those items which are indecomposable are calle...

Last updated: Sat, 8 Feb

Literal means

Last updated: Sat, 8 Feb

a->b is systematically correct if_____

Last updated: Sat, 8 Feb

In selection sort of n elements,how many times is the swap function called in the complete execution of the algorit...

Last updated: Sat, 8 Feb

A function which calls itself is called as

Last updated: Sat, 8 Feb

Which of the following best describes sorting ?

Last updated: Sat, 8 Feb

a->b is systematically correct if_____

Last updated: Sat, 8 Feb

While incrementing a pointer, its value gets increased by the length of the data type to which it points. This leng...

Last updated: Sat, 8 Feb

main ( ) is an example of

Last updated: Sat, 8 Feb

A global variable is a variable

Last updated: Sat, 8 Feb

If a, b and c are integer variables with the values a=8, b=3 and c=-5. Then what is the value of the arithmetic exp...

Last updated: Sat, 8 Feb

A structure definition is called as

Last updated: Sat, 8 Feb

The constructed datatype in C is known as

Last updated: Sat, 8 Feb

To declare an array S that holds a 5-character string, you would write

Last updated: Sat, 8 Feb

If a function is declared as void fn(int *p), then which of the following statements is valid to call function fn?

Last updated: Sat, 8 Feb

NurseryLand.Nursery.Students = 10;

Last updated: Sat, 8 Feb

If string1=john,and string2=Rivers are merged,the process is called

Last updated: Sat, 8 Feb

_____is the problem of deciding whether or not a given string problem p appears in a text T.

Last updated: Sat, 8 Feb

_____operation of word processing invovles replacing one string in the text by another.

Last updated: Sat, 8 Feb

Groups of consecutive element in a string.Such as words,phrase and sentences are called___

Last updated: Sat, 8 Feb

String with zero characters is called____string

Last updated: Sat, 8 Feb

Finite sequence S of Zero or more chatacters is called_____

Last updated: Sat, 8 Feb

consider the function f defined here:struct item{int data;struct item * next;};int f (struct item *p){return((p==NU...

Last updated: Sat, 8 Feb

In worst case, the number of comparison need to search a singly linked list of length n for a given element is

Last updated: Sat, 8 Feb

Linked lists are not suitable to for the implementation of?

Last updated: Sat, 8 Feb

Which of the following statements about linked list data structure is/are TRUE?

Last updated: Sat, 8 Feb

In circular linked list, insertion of node requires modification of?

Last updated: Sat, 8 Feb

A variant of the linked list in which none of the node contains NULL pointer is?

Last updated: Sat, 8 Feb

A variation of linked list is circular linked list, in which the last node in the list points to first node of the ...

Last updated: Sat, 8 Feb

What kind of linked list is best to answer question like “What is the item at position n?”

Last updated: Sat, 8 Feb

A variant of linked list in which last node of the list points to the first node of the list is?

Last updated: Sat, 8 Feb

Consider the following definition in c programming languagestruct node{int data;struct node * next;}typedef struct ...

Last updated: Sat, 8 Feb

The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be us...

Last updated: Sat, 8 Feb

What would be the asymptotic time complexity to insert an element at the second position in the linked list?

Last updated: Sat, 8 Feb

What would be the asymptotic time complexity to find an element in the linked list?

Last updated: Sat, 8 Feb

What would be the asymptotic time complexity to add an element in the linked list?

Last updated: Sat, 8 Feb

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is init...

Last updated: Sat, 8 Feb

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

Last updated: Sat, 8 Feb

Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer an...

Last updated: Sat, 8 Feb

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer on...

Last updated: Sat, 8 Feb

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail p...

Last updated: Sat, 8 Feb

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

Last updated: Sat, 8 Feb

A linear collection of data elements where the linear node is given by means of pointer is called?

Last updated: Sat, 8 Feb

In a circular linked list

Last updated: Sat, 8 Feb

NULL link is not present in…

Last updated: Sat, 8 Feb