Search Header Logo

Data Structure & Algorithm Quizizz

Authored by Princess Sinyahan

Other

University

Used 4+ times

Data Structure & Algorithm Quizizz
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

30 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

This operation adds an item to the top of the stacks.

Peek

Pop

Pull

Push

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If a tree consist of nodes where each has two(2) child nodes at most, what is it called?

Binary Tree

Dual Tree

Double Tree

Twin Tree

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Whta is the process of visiting all nodes in a specific order?

Abstraction

Inheritance

Polymorphism

Traversal

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

This operation adds an item to the queue.

Dequeue

Enqueue

Pop

Push

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

This is the tree's highest level.

Degree

Depth

Edge

Subtree

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Complete the Java code below.

Queue queue = new LinkedList();

________.offer("Ma'am BK");

add

Linkedlist

Queue

queue

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the ff. is NOT a step in converting an infix into postfix expression?

If the token is an operand, append it to the postfix expression.

If the token is an operator, push it to the stack if empty.

If left parenthesis is encountered, pop all the elements until a right parenthesis is encountered.

Classify the token as operand or operator.

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?