Logo educatepk.com
MCQs & Books free for all subjects and educational help  
Subscribe email alerts:
MCQs Online
MCQs on Data structures and Algorithms
Books
MCQs on Data structures and Algorithms

Data structures and Algorithms MCQs and Quiz



Q No.1 of 10

A variable P is called pointer if


Option 1

P contains the address of an element in DATA
Option 2

P points to the address of first element in DATA
Option 3

P can store only memory addresses
Option 4

P contain the DATA and the address of DATA
Q No.2 of 10

Which of the following data structure can't store the non-homogeneous data elements?


Option 1

Arrays
Option 2

Records
Option 3

Pointers
Option 4

None of these
Q No.3 of 10

 

Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called


Option 1

elementary items
Option 2

atoms
Option 3

scalars
Option 4

All of these
Q No.4 of 10

Which of the following data structures are indexed structures?


Option 1

linear arrays
Option 2

linked lists
Option 3

Both of these
Option 4

None of these
Q No.5 of 10

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


Option 1

The list must be sorted
Option 2

there should be the direct access to the middle element in any sublist
Option 3

There must be mechanism to delete and/or insert elements in list
Option 4

None of these
Q No.6 of 10

The difference between linear array and a record is


Option 1

An array is suitable for homogeneous data but hte data items in a record may have different data type
Option 2

In a record, there may not be a natural ordering in opposed to linear array
Option 3

A record form a hierarchical structure but a lienear array does not
Option 4

All of these
Q No.7 of 10

Which of the following statement is false?


Option 1

Arrays are dense lists and static data structure 
Option 2

data elements in linked list need not be stored in adjecent space in memory
Option 3

pointers store the next data element of a list
Option 4

linked lists are collection of the nodes that contain information part and next pointer
Q No.8 of 10

Binary search algorithm cannot be applied to


Option 1

sorted linked list
Option 2

sorted binary trees
Option 3

sorted linear array
Option 4

pointer array
Q No.9 of 10

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


Option 1

housefull
Option 2

underflow
Option 3

overflow
Option 4

saturated
Q No.10 of 10

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


Option 1

underflow
Option 2

overflow
Option 3

housefull
Option 4

saturated

Correct Answers