You are on page 1of 2

COMPUTER APPLICATIONS

Program

: BCA

Semester :

III

Course Code : DS(C)231

Credits

:

3

Course Title : Data Structures

Sessions

:

48

Objective: This course is designed to provide all essential information that is needed to learn and master
Data Structure. It presents the basics to advanced features of Data Structures.

Schedule of Sessions
Topic

Session

An Introduction to Data Structures: Introduction, Definition, Classification of Data
Structures.
Arrays: Introduction, Primitive Operations of the Array ADT, One-Dimensional Arrays,
Initializing One-Dimensional Array, Accessing One-Dimensional Array Elements,
Implementation of One- Dimensional Array in Memory, Passing Arrays to Function,
Insertion in One- Dimensional Array, Deleting an Element from One-Dimensional Array,
Traversing of Array, Merging Two Arrays, Combining All Together, Multi-Dimensional
Arrays, Initialization of Multi-Dimensional Arrays, Accessing Two-Dimensional Array
Elements, Implementation of Two- Dimensional Array, Pointer and Array, Array of
Pointer, Array of Structures, Array within the Structure, Sparse Matrix, Limitation of
Linear Arrays.
Searching: Introduction, Linear vs. Binary Searching, Hashing.
Array Sorting: Introduction, Internal vs. External Sorting Methods, Insertion Sorting,
Selection Sorting, Bubble Sorting, Merging and Merge Sorting, Quick Sorting, Heap
Sorting, etc.
Recursion: Introduction, Types of Recursion, Recursion Essentials, Disadvantages of
Recursion, Simple Recursive Program, Tower of Hanoi, Recursion vs. Iterations.
Stacks: Introduction, Primitive Operations on the Stack ADT, Stack Implementation,
Operations on Stack, Stack Terminology, Algorithms for Push and Pop, Implementing
Stack Using Pointers, Applications of Stacks, Algorithm for Converting Infix Expression
to Postfix Form, Algorithm to Evaluate a Postfix Expression.
Queues: Introduction, Primitive Operations of the Queue ADT, Queue Implementation,
Algorithms for Insertion and Deletion in Queue (Using Arrays), Limitation of Simple
Queues, Algorithm for Insertion and Deletion in a Queue (Using Pointers), Variations in
a Queue.
Linked Lists: Introduction, Linked Lists, Key Terms, Primitive Operations of the Linked
List ADT, Representation of Linear Linked List, Operation on Linked List, Types of
Linked List, Singly Linked List, Circular Linked List, Doubly Linked List, Circular
Doubly Linked List, Application: Addition of Two Polynomials.
Trees: Introduction, Primitive Operations of the Tree ADS, Tree Terminology, Binary
Trees and its Types, Binary Tree Representation, Creation of Binary Tree, Conversion of
an Expression into Binary Tree, Binary Search Tree, Threaded Binary Trees, AVL /
Height Balanced Trees, Tree Traversal Techniques, B–Tree, B+–Tree.
Graphs: Introduction, Primitive Operations of the Graph ADS, Defining Graph and its
types, Basic Terminology, Graph Representation, Graph Traversal, Shortest Path

   

1

6

3
6
2

5

4

4

12

5

ĐŽŵƉŝůĞĚďLJZƵƉĂŶŬĂŚƵLJĂŶ͕ĞƉƚƚ͘ŽĨ/dΘDĂƚŚĞŵĂƚŝĐƐ͕/ĐĨĂŝhŶŝǀĞƌƐŝƚLJEĂŐĂůĂŶĚ 

Pearson Education Heileman. Tata McGraw Hill       ĐŽŵƉŝůĞĚďLJZƵƉĂŶŬĂŚƵLJĂŶ͕ĞƉƚƚ͘ŽĨ/dΘDĂƚŚĞŵĂƚŝĐƐ͕/ĐĨĂŝhŶŝǀĞƌƐŝƚLJEĂŐĂůĂŶĚ  . Total Recommended Readings 48 Author / Publication nd Computer Algorithms / C++. V. Ellis Horowitz. Algorithms and Object Oriented Programming A. Aho et. Universities Press Fundamentals of Algorithmics Gilles Brassard & Paul Brately. Kruskal’s Algorithm. PHI Data Structures and Program Design Robert L. 2 ed. Prim’s Algorithm. Sartaj Sahni & Sanguthevar Rajasekaran. Hamiltonian Paths. Dijkstra’s Algorithm.Problem. Kruse. Minimum Cost Spanning Trees.al. PHI Data Structures and Algorithms Data Structures.