Stacks, Queues and Deques

Question 1

Array Stack Implementation

Answer 1

Question 2

Array Queue Implementation - 1

Answer 2

Question 3

Array Queue Implementation - 2

Answer 3

Question 4

Why using Modulus Calculation

Answer 4

Question 5

Deque Implementation

Answer 5

Question 6

Deque methods - 1

Answer 6

Question 7

Deque methods - 2

Answer 7

Question 8

Deque methods - 3

Answer 8

Question 9

Linked Stack Implementation - 1

Answer 9

Question 10

Linked Stack Implementation - 2

Answer 10

Question 11

Linked Queue Implementation - 1

Answer 11

Question 12

Linked Queue Implementation - 2

Answer 12

Question 13

CIrcular Queue Implementation - 1

Answer 13

Question 14

Circular Queue Implementation - 2

Answer 14

Question 15

Implementation of Base Class of Doubly Linked List

Answer 15

Question 16

Implementation of Linked Queue with Double Linked Base Class

Answer 16

Question 17

Implementation of Positional List with Doubly Linked List - 1

Answer 17

Question 18

Implementation of Positional List with Doubly Linked List - 2

Answer 18

Question 19

Implementation of Positional List with Doubly Linked List - 3

Answer 19

Question 20

Implementation of Insertion Sort of Positional List

Answer 20

Question 21

Reverse Linked List with While Loop

Answer 21

Question 22

Reverse Linked List with Recusion

Answer 22

Question 23

PositionList ADT Methods

Answer 23

Question 24

Stack ADT Methods

Answer 24

Question 25

Queue ADT Methods

Answer 25

Question 26

Deque ADT Methods

Answer 26