Quiz-AIML

Quiz-AIML

University

10 Qs

quiz-placeholder

Similar activities

Quiz on Stacks and Data Structures 2

Quiz on Stacks and Data Structures 2

University

10 Qs

CCIS 104 Quiz # 1.3

CCIS 104 Quiz # 1.3

University

11 Qs

The DSA Adventure - Day 5

The DSA Adventure - Day 5

University

12 Qs

unit-2 stack

unit-2 stack

University

10 Qs

SD_Stack&Queue

SD_Stack&Queue

University

10 Qs

Stack in Data Structure

Stack in Data Structure

University

10 Qs

Computer Architecture

Computer Architecture

University

10 Qs

Scratch Vocabulary

Scratch Vocabulary

3rd Grade - University

9 Qs

Quiz-AIML

Quiz-AIML

Assessment

Quiz

Computers

University

Easy

Created by

Naveen Kandwal

Used 2+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A stack is represented by the vector S,TOP. It denotes

Middle of the stack

End of stack

Top of the stack

None of the above

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which one of the following is a true condition for any recursive procedure?

Decision criteria must be nearer in some sense to a solution

Each time decision criteria for stopping the process calls itself

Each time the procedure calls itself it must be nearer in some sense to a solution

Each time a procedure calls recursive defined function for stopping the process

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What are the main applications of tree data structures?
i. Manipulate hierarchical data

ii. Make information easy to search

iii. Manipulate sorted lists of data

iv. Router algorithms

v. Form of a multi-stage decision-making, like Chess Game.

vi. As a workflow for compositing digital images for visual effects

i, ii, iii, iv and vi

i, ii, iii, iv and v

i, ii, iii, iv, v and vi

i, iii, iv, v and vi

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following pairs of traversals is not sufficient to build a binary tree from the

given traversals?

Preorder and Inorder

Preorder and Postorder

Inorder and Postorder

All of the above

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

How many different trees are there with four nodes: a, b, c, d?

30

120

60

90

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which type of traversal of a binary search tree outputs the value in sorted order?

Pre-order

In-order

Post-order

None

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A stack is represented by the vector S,TOP. It denotes

Middle of the stack

Top of the stack

End of stack

None of the above

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?