C Programming and Data Structures: Unit III: b. Linear Data Structures Stacks and Queues

Linear Data Structures Stacks and Queues

C Programming and Data Structures

C Programming and Data Structures: Unit III: b. Linear Data Structures Stacks and Queues : Syllabus, Contents

Unit III

Chapter 4

Linear Data Structures Stacks and Queues


Syllabus

Stack ADT - Implementation of Stack - Applications - Queue ADT - Priority Queues - Queue Implementation - Applications.


Contents

Part I: Stacks

4.1 Concept of Stack

4.2 Stack ADT

4.3 Implementation of Stack

4.4 Applications of Stack..... May-15,........ Marks 12

4.5 Expression

4.6 Infix to Postfix Conversion .... May-14,16, Dec.-16,..... Marks 16

4.7 Evaluation of Postfix Expressions.... Dec.-15,18,..... Marks 16

Part II: Queues

4.8 Concept of Queue

4.9 Queue ADT

4.10 Queue Implementation....May-15, .....Marks 16

4.11 Priority Queues......Dec.-19, .......Marks 15

4.12 Applications of Queue.......Dec.-19,...Marks 15

4.13 Two Marks Questions with Answers

 

C Programming and Data Structures: Unit III: b. Linear Data Structures Stacks and Queues : Tag: : C Programming and Data Structures - Linear Data Structures Stacks and Queues