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 is the advantage of using linked list implementation of stack over array implementation?

a: Pushing into the stack is faster in linked list implementation. Explanation

Explanation

b: Popping from the stack is faster in linked list implementation. Explanation

Explanation

c: Linked list has a variable size, unlike an array. Explanation

Explanation

d: None of the above Explanation

Explanation

2. Insertion and Deletion operations in Queue and Stack are known as ?

a: Enqueue and Dequeue, Push and Pop Explanation

Explanation

b: Push and Pop, Enqueue and Dequeue Explanation

Explanation

c: Pop and Push, Dequeue and Enqueue Explanation

Explanation

d: Dequeue and Enqueue, Pop and Push Explanation

Explanation

3. What would be the time complexity to pop an element from the stack and dequeue an element from the queue ?

a: O(n) and O(1) Explanation

Explanation

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

Explanation

c: O(1) and O(1) Explanation

Explanation

d: O(n) and O(n) Explanation

Explanation

4. Which of the following is the best to implement a priority queue?

a: Heap Explanation

Explanation

b: Array Explanation

Explanation

c: Linnked List Explanation

Explanation

d: Tree Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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