narayansectionifldsfaslf;sd,fd,f.mx

narayansectionifldsfaslf;sd,fd,f.mx

Assessment

Quiz

others

1st Grade

Practice Problem

Hard

Created by

Tapas Mishra

Used 2+ times

FREE Resource

Student preview

quiz-placeholder

5 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A BST has 31 nodes. What would be the minimum hight to arrage it?

4
5
6
7

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A BST has the hight 7. How many minimum and maximum nodes can be occupied?

8 and 254
8 and 255
7 and 255
8 and 256

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a single linked list, you want to catch the 14th node, How many times, the head pointer has to traverse?

13
14
15
16

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In an array of size 20, you want to insert an element at index 6 (index starts from 0). How many shifting operations required?

13
14
15
16

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a graph of 6 vertices how many edges possible? If there is no edges possible between itself.

20
10
15
25

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?