HOME
PARTNERS
CONTACT

Computer Science and Engineering Data Structures – 1 Experiments

Aim

Overview

Recap : Arrays

Recap : Linked List

Pretest

Stacks

Aim Concept Demo Arrays Practice Time Complexity Linked List Practice Exercise Quiz

Queues

Aim Concept Queues: Demo Queues Time Complexity Queues: Arrays Practice Queues: Linked List Practice Queues: Exercise Quiz

Analysis

Aim Overview Comparison of Stacks and Queues Applications of Stacks and Queues Quiz

Posttest

Stacks and Queues

Choose difficulty:

Beginner

Intermediate

Advanced

1. Which among the following represents a stack?

a: People waiting at a counter, where the action of popping is when someone has been served at the counter Explanation

Explanation

b: A hand of bangles where pushing is wearing a new bangle Explanation

Explanation

c: A pile of plates at a dinner party Explanation

Explanation

d: People going around a merry-go-round Explanation

Explanation

2. What is the time complexity of push operation in a stack? What is the time complexity of pop operation in a stack?

a: O(n), O(n) Explanation

Explanation

b: O(1), O(n) Explanation

Explanation

c: O(n), O(1) Explanation

Explanation

d: O(1), O(1) Explanation

Explanation

3. Consider these operations on an empty stack: push(3), push(5), pop(), push(10), push(11), pop(), push(100). What will be the stack configuration (first number is top of the stack, last is the bottom)

a: 100,10,3 Explanation

Explanation

b: 3,5,10,11,100 Explanation

Explanation

c: 3,10,100 Explanation

Explanation

d: None of the above Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)