Quiz-AIML

Quiz-AIML

University

10 Qs

quiz-placeholder

Similar activities

Computational Thinking in Python[Quiz 3]

Computational Thinking in Python[Quiz 3]

University

15 Qs

JRB2 Quiz 4

JRB2 Quiz 4

University

10 Qs

TOOLS FOR AD & TECHNOLOGY DEVELOPMENT (W4-W6)

TOOLS FOR AD & TECHNOLOGY DEVELOPMENT (W4-W6)

University

10 Qs

Understanding Email, Contacts and Calendaring

Understanding Email, Contacts and Calendaring

University

10 Qs

ICT 0513 - Chapter 4 : System Unit

ICT 0513 - Chapter 4 : System Unit

University

15 Qs

BB

BB

University

10 Qs

Tree and Planar Graph

Tree and Planar Graph

University

10 Qs

CodeMonkey for B.Ed IT

CodeMonkey for B.Ed IT

University

10 Qs

Quiz-AIML

Quiz-AIML

Assessment

Quiz

Computers

University

Easy

Created by

Naveen Kandwal

Used 3+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

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

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?