Quiz on Stacks and Data Structures 2
Authored by HASAN YIGIT
Computers
University
Used 2+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the defining principle of a stack?
First-in-first-out (FIFO)
Last-in-first-out (LIFO)
Random order
None of the above
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What happens during a pop operation?
The stack is duplicated.
The bottom element is removed.
The top element is removed.
Nothing happens.
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which data structure is commonly used to implement a dynamic stack?
Array
Linked List
Queue
Binary Tree
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which application is NOT a real-life use case of stacks?
Undo feature in text editors
Managing memory in recursion
Routing in computer networks
Page-visited history in browsers
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which notation is easier for humans to read but harder for computers to evaluate?
Prefix
Infix
Postfix
Reverse Polish Notation
6.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
What does the following code snippet do? void push(struct Stack* stack, int item) { if (isFull(stack)) return; stack->array[++stack->top] = item; }
Removes an item from the stack
Adds an item to the stack
Checks if the stack is full
Initializes the stack
7.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
Which of the following is a valid check for balanced brackets using a stack? if (stack == NULL) return 0; else if (!isMatchingPair(pop(&stack), exp[i])) return 0;
Checks if the stack is balanced.
Removes unbalanced brackets.
Pushes unmatched brackets onto the stack.
Returns true if brackets are balanced.
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
