Data Structure & Algorithm Quizizz

Data Structure & Algorithm Quizizz

University

30 Qs

quiz-placeholder

Similar activities

Разработка приложений в C# 1 аттестация

Разработка приложений в C# 1 аттестация

University

25 Qs

ITProf104 PEx

ITProf104 PEx

University

32 Qs

Arduino

Arduino

University

25 Qs

DATA STRUCTURES-Graphs and other topics

DATA STRUCTURES-Graphs and other topics

University

25 Qs

SUPERWRITE REVISION (8-11)

SUPERWRITE REVISION (8-11)

University

25 Qs

Push Down Automata Quiz

Push Down Automata Quiz

University

25 Qs

NUR336 module 5 knowledge check

NUR336 module 5 knowledge check

University

25 Qs

QUIZZ AIJ XII TKJ - BAB V - MANAJEMEN BANDWIDTH

QUIZZ AIJ XII TKJ - BAB V - MANAJEMEN BANDWIDTH

KG - Professional Development

30 Qs

Data Structure & Algorithm Quizizz

Data Structure & Algorithm Quizizz

Assessment

Quiz

Other

University

Hard

Created by

Princess Sinyahan

Used 4+ times

FREE Resource

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.

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?