Question # 1

A complete binary tree us a tree that is ___ filled with the possible exception of the bottom level.

Choose an answer

partially

completely

incompletely

partly

The maximum number of external nodes for a binary tree of Height H is ____

Choose an answer

2^h

2^h+1

2^h+2

2^h+3

Which traversal gives a decreasing order of elements in a heap where the max element is stored at the top?

Choose an answer

post-order

level -order

in order

none of the above

_____ only removes items in reserve order as they were entered

Choose an answer

Stack

Queue

Both of these

None of these

Consider the following paragraph with blanks. A …….…….. is a linear list where …………… and ………… take place at the same end . This end is called the …….………. What would be the correct filling the above blank positions?

Choose an answer

(i) queue (ii) insertion (iii) removals (iv) top

(i) stack (ii) insertion (iii) removals (iv) bottom

(i) stack (ii) insertion (iii) removals (iv) top

(i) tree (ii) insertion (iii) removals (iv) top

Which of the following statement is NOT correct?

Choose an answer

In linked list the elements are necessarily to be contiguous

In the linked list the elements may locate at far positions in the memory

in the linked list each elements also has he address of the elements next to it

In an array the elements are contiguous

Which one of the following is NOT the property of equivalence relation

Choose an answer

Reflexive

Symmetric

Transitive

Associative

Which of the following is a non linear data structure?

Choose an answer

Linked List

Stack

Tree

Queue

it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.

Choose an answer

Variable

Constant

Inconsistent

None of the above

A simple sorting algorithm like selection sort or bubble sort have a wrostcase of

Choose an answer

O(1) time because all lists take the same amount of time to sort

O(n) time because it has to perform n swaps to order the list.

O(n² ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted.

O(n³ ) time, because the worst case has really random input which takes longer to sort.

A binary tree with N internal nodes has ____ links ,links to internal node and ____links to external

Choose an answer

N+1, 2N, N-1

N+1, N-1, 2N

2N, N-1, N+1

N-1, 2N, N+1

More Classes

Other Links

CS-301 Final Term Exams Preparation Virtual University MCQs With Answers

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer