Data Structures And Algorithms Exam

Two main measures for the efficiency of an algorithm are

1 Mark(s)

Processor and memory
Complexity and capacity
Time and space
Data and space

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

1 Mark(s)

Traversal
Search
Sort
None of above

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

1 Mark(s)

Underflow
Overflow
Housefull
Saturated

Two dimensional arrays are also called

1 Mark(s)

Tables arrays
Matrix arrays
Both of above
none of above

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

1 Mark(s)

Array
Lists
Stacks
All of above

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

1 Mark(s)

Arrays
Records
Pointers
None

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

1 Mark(s)

Arrays
Linked lists
Both of above
None of above

Which of the following is two way list?

1 Mark(s)

Grounded header list
Circular header list
Linked list with header and trailer nodes
None of above

Arrays are best data structures

1 Mark(s)

For relatively permanent collections of data
For the size of the structure and the data in the structure are constantly changing
For both of above situation
For none of above situation

When determining the efficiency of algorithm the time factor is measured by

1 Mark(s)

Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm

Binary search algorithm can not be applied to

1 Mark(s)

Sorted linked list
Sorted binary trees
Sorted linear array
Pointer array

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

1 Mark(s)

By this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
The architecture of computer memory does not allow arrays to store other than serially
Both of above
None of above

The complexity of Bubble sort algorithm is

1 Mark(s)

O(n)
O(log n)
O(n2)
O(n log n)

The Average case occur in linear search algorithm

1 Mark(s)

When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all

Linked lists are best suited

1 Mark(s)

For relatively permanent collections of data
For the size of the structure and the data in the structure are constantly changing
For both of above situation
For none of above situation

Which of the following case does not exist in complexity theory

1 Mark(s)

Best case
Worst case
Average case
Null case

The complexity of linear search algorithm is

1 Mark(s)

O(n)
O(log n)
O(n2)
O(n log n)

The complexity of merge sort algorithm is

1 Mark(s)

O(n)
O(log n)
O(n2)
O(n log n)

Which of the following data structures are indexed structures?

1 Mark(s)

Linear arrays
Linked lists
Both of above
none of above

Which of the following data structure store the homogeneous data elements?

1 Mark(s)

Arrays
Records
Pointers
None

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

1 Mark(s)

The list must be sorted
There should be the direct access to the middle element in any sublist
There must be mechanism to delete and/or insert elements in list
None of above

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

1 Mark(s)

Linked lists
Stacks
Queues
Deque

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

1 Mark(s)

Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm

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

1 Mark(s)

Floor address
Foundation address
First address
Base address

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

1 Mark(s)

Must use a sorted array
Requirement of sorted array is expensive when a lot of insertion and deletions are needed
There must be a mechanism to access middle element directly
Binary search algorithm is not efficient when the data elements are more than 1000.

In linear search algorithm the Worst case occurs when

1 Mark(s)

The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all

The difference between linear array and a record is

1 Mark(s)

An array is suitable for homogeneous data but the data items in a record may have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a linear array does not
All of above

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

1 Mark(s)

Sorting
Merging
Inserting
Traversal

If the values of a variable in one module is indirectly changed by another module, this situation is called

1 Mark(s)

Internal change
Inter-module change
Side effect
Side-module update

Which of the following statement is false?

1 Mark(s)

Arrays are dense lists and static data structure
Data elements in linked list need not be stored in adjacent space in memory
Pointers store the next data element of a list
Linked lists are collection of the nodes that contain information part and next pointer

Which of the following name does not relate to stacks?

1 Mark(s)

FIFO lists
LIFO list
Piles
Push-down lists

For an algorithm the complexity of the average case is

1 Mark(s)

Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above

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

1 Mark(s)

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

When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return

1 Mark(s)

FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG

Each array declaration need not give, implicitly or explicitly, the information about

1 Mark(s)

The name of array
The data type of array
The first data from the set to be stored
The index set of the array

The complexity of Binary search algorithm is

1 Mark(s)

O(n)
O(log n )
O(n2)
O(n log n)

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

1 Mark(s)

Elementary items
Atoms
Scalars
All of above

A variable P is called pointer if

1 Mark(s)

P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA

The situation when in a linked list START=NULL is

1 Mark(s)

Underflow
Overflow
Housefull
Saturated

Which of the following data structure is linear data structure?

1 Mark(s)

Trees
Graphs
Arrays
None of above

Data Structures And Algorithms Exam : Question 1 of 40