# Data Structures and Algorithms Online QUIZ-2 by freefeast.info | Data structures with C Quiz

Binoy Wilson(admin)
October 7, 2011
Data Structures and Algorithms Online QUIZ-2 by freefeast.info | Data structures with C Quiz2018-03-14T13:35:24+00:00
Quiz

## Data Structures and Algorithms QUIZ-2

Start

Congratulations - you have completed

*Data Structures and Algorithms QUIZ-2*. You scored %%SCORE%% out of %%TOTAL%%. Your performance has been rated as %%RATING%%
Your answers are highlighted below.

Question 1 |

In what kind storage structure for strings, one can easily insert, delete, concatenate, and rearrange substrings?

A | fixed length storage structure |

B | variable length storage with fixed maximum |

C | linked list storage |

D | array list storage |

Question 2 |

What is the time taken by binary search algorithm to search a key in a sorted array of n elements ?

A | O(log2 n) |

B | O(n) |

C | O(n log2 n) |

D | O(n(sqrt)) |

Question 3 |

What is the worst case time required to search a given element in a sorted linked list of length n ?

A | O(1) |

B | O(log2 n) |

C | O(n) |

D | O(n log2 n) |

Question 4 |

Which data structure is needed to convert infix notations to postfix notations ?

A | linear list |

B | queue |

C | tree |

D | stack |

Question 5 |

A linear list in which elements can be added or removed at either end but not in the middle, is known as

A | queue |

B | deque |

C | stack |

D | tree |

Question 6 |

Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort ?

A | O(1) |

B | O(log2 n) |

C | O(n) |

D | O(n(sqrt)) |

Question 7 |

If each node in a tree has value greater than every value in its left subtree and has value less than every value in its right subtree, the tree is known as

A | complete tree |

B | full binary tree |

C | binary search tree |

D | threaded tree |

Question 8 |

Which of the following is a tabular listing of contents of certain registers and memory locations at different times during the execution of a program ?

A | Loop program |

B | Program trace |

C | subroutine program |

D | byte sorting program |

Question 9 |

Which of the following statement is false ?

A | every tree is bipartite graph |

B | a tree contains a cycle |

C | a tree with n nodes contains n-1 edges |

D | a tree is a connected graph |

Question 10 |

In what tree, for every node the height of its left subtree and right subtree differs at least by one

A | binary search tree |

B | AVL-tree |

C | Complete tree |

D | Threaded binary tree |

Question 11 |

A characteristic of the data that binary search uses but the linear search ignores the

A | order of the list |

B | length of the list |

C | maximum value in the list |

D | mean of data values |

Question 12 |

A full binary tree with n leaves contains

A | n nodes |

B | log2 n nodes |

C | 2n-1 nodes |

D | 2(sqrt)n nodes |

Question 13 |

A full binary tree with n non-leaf nodes contains

A | log2 n nodes |

B | n+1 nodes |

C | 2 n nodes |

D | 2n+1 nodes |

Question 14 |

Which of the following sorting algorithms does not have worst case running time of O(n(sqrt)) ?

A | insertion sort |

B | merge sort |

C | quick sort |

D | bubble sort |

Question 15 |

The infix expression A+((B-C)*D) is correctly represented in prefix notation as

A | A+B-C*D |

B | +A*-BCD |

C | ABC-D*+ |

D | A+BC-D* |

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
Get Results

There are 15 questions to complete.

You have completed

questions

question

Your score is

Correct

Wrong

Partial-Credit

You have not finished your quiz. If you leave this page, your progress will be lost.

Correct Answer

You Selected

Not Attempted

Final Score on Quiz

Attempted Questions Correct

Attempted Questions Wrong

Questions Not Attempted

Total Questions on Quiz

Question Details

Results

Date

Score

Hint

Time allowed

minutes

seconds

Time used

Answer Choice(s) Selected

Question Text

All done

Need more practice!

Keep trying!

Not bad!

Good work!

Perfect!