 #### Basic ProgrammingData Structures Fundamentals Test Answer 25 questions in 10 minutes.

Data Structures Fundamentals Test |

A procedure that calls itself in a program is called _______.
Recursion
The count can be zero or CAPACITY - but no other value can occur
Tree
Repeat
Loop

In the linked representation of a sparse matrix - the head node for a column list stores_____
column number
a pointer to the next column head node
a+*b-/c-d-e+fgh
a pointer to the first node in the column list
All of the above

What is the value of the post-fix expression 6 3 2 4 + - *?
A parentheses balancing program
Something between 5 and 15
Something between -15 and -100
Something between 15 and 100
Something between -5 and -15

What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/(f+g-h)]
*+a-bc-/d+e-fgh
abc-+de-fg+h-/*
a+*b-/c-d-e+fgh
Two entries with different data have exactly the same key
*+a-bc/-de-+fgh

Which of the following data structures has a balanced condition?
Double Ended Queue
Stack
AVL Tree
the same degree

A given connected graph G is a Euler graph if and only if all vertices of G are of ______.
different degrees
the same degree
ABDC
even degrees
odd degrees

In which dynamically created linked list can the first node be recovered after moving to the second node?
Both b and c
2h + 1 + 1

What is the maximum number of statements that may be recursive calls in a single function declaration?
There is no fixed maximum
2
1
n (n is the argument)
Complete graph

Which of the following applications may use a stack?
All of the above
A parentheses balancing program
2d2
Keeping track of local variables at run time
Syntax analyzer for a compiler

Which term is used to describe an O(n) algorithm?
Linear
Post-order traversal
Logarithmic
Constant

What kind of initialization needs to be done for a chained hash table?
Dequeue
The key at each array location must be initialized
Both B and C must be carried out
The head pointer of each chain must be set to NULL
None

Which of these are standard operations of Stack Data Structure?
Insert - pop
Push - pop
Put - extract
Both insertion and removal are better than linear
Push - delete

What is the meaning of the statement: 'Entries in a stack are 'ordered''?
The entries must be stored in a linked list
Stack entries may be compared with the '<' operation
There is a first entry - a second entry - and so on
ABDC
A collection of stacks can be sorted

Which of the operations is simpler in the doubly linked list than it is in the simple linked list?
Deletion
Insertion
Both a and b
None of the above
More than that of A(G)

A matrix is called sparse when______
all of its elements are non-zero
None of the above
most of its elements are zero
most of its elements are non-zero

Which situation occurs frequently if the selected hash function is poor?
None of the above
Overflow
Collision
Underflow
efficient in accessing an entry

Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?
Pre-order traversal
Post-order traversal
In order traversal
11
Top-down traversal

#### GET PROVEN ADVICE FROM 100+ BEST BOOKS IN 1 BOOK 