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. What are the strategies/principles used in Stacks and Queues?

a: LILO and FILO Explanation

Explanation

b: FILO and LILO Explanation

Explanation

c: FIFO and LIFO Explanation

Explanation

d: LIFO and FIFO Explanation

Explanation

e: b and d Explanation

Explanation

2. How many pointers are used for reference in Stacks and Queues?

a: 1 and 2 Explanation

Explanation

b: 2 and 1 Explanation

Explanation

c: Depends Explanation

Explanation

d: Can't say Explanation

Explanation

3. How many queues are needed to implement a stack. Consider the situation where no other data structure like arrays or linked list is available to you.?

a: 1 Explanation

Explanation

b: 2 Explanation

Explanation

c: 3 Explanation

Explanation

d: 4 Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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