Algouniversity - Nomdic Gurukul - 14th august

Algouniversity - Nomdic Gurukul - 14th august

Professional Development

6 Qs

quiz-placeholder

Similar activities

Fondamentaux - Sujets des présentations

Fondamentaux - Sujets des présentations

Professional Development

10 Qs

Stack and Queue

Stack and Queue

Professional Development

10 Qs

PreTrainingCollectionsArrays

PreTrainingCollectionsArrays

Professional Development

9 Qs

AWS SQS and SNS Quiz

AWS SQS and SNS Quiz

Professional Development

10 Qs

Application Attack Indicators

Application Attack Indicators

Professional Development

10 Qs

06/10/2022 - Binary tree traversal - PRE ORDER

06/10/2022 - Binary tree traversal - PRE ORDER

Professional Development

6 Qs

Linked List Traversal

Linked List Traversal

Professional Development

10 Qs

PDS - 04225 Chapter 11 - Part 1 - Sorting Algorithms

PDS - 04225 Chapter 11 - Part 1 - Sorting Algorithms

University - Professional Development

10 Qs

Algouniversity - Nomdic Gurukul - 14th august

Algouniversity - Nomdic Gurukul - 14th august

Assessment

Quiz

Computers

Professional Development

Hard

Created by

Suraj Kumar

Used 4+ times

FREE Resource

6 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In order traversal of binary search tree will produce ?

unsorted list

reverse of input

sorted list

none of the above

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image
In order traversal of binary search tree will produce ?
unsorted list
reverse of input
sorted list
none of the above

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image
push() and pop() functions are found in
queues
lists
stacks
trees

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image
Minimum number of queues required for priority queue implementation?
5.0
4.0
3.0
2.0

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The minimum number of edges required to create a cyclid graph of n vertices is
n
n-1
n+1
2n

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What about recursion is true in comparison with iteration?
very expensive in terms of memory.
low performance.
every recursive program can be written with iteration too.
all of the above are true!