Time Left - 12:00 mins

Data Structure & Programming : Nuclear Quiz 1

Attempt now to get your rank among 361 students!

Question 1

In a full binary tree number of nodes is 63 then the height of the tree is :

Question 2

Which of the following traversal outputs the data in sorted order in a BST?

Question 3

The smallest element that can be found in time _______ in a binary max heap.

Question 4

What will be the position of 5, when a max heap is constructed on the input elements 5, 70, 45, 7, 12, 15, 13, 65, 30, 25?

Question 5

In a max-heap, element with the greatest key is always in the which node?

Question 6

You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?

Question 7

What would be the asymptotic time complexity to find an element in the linked list?

Question 8

A normal queue, if implemented using an array of size MAX_SIZE, gets full when

Question 9

A queue follows __________

Question 10

What is a full binary tree?

  • 361 attempts