BCS301: Data Structure

 BCS301: Data Structure

___________________________________________________________________________________

UNIT 1:

Introduction: 

Basic Terminology, 

Elementary Data Organization, 

Built in Data Types in C. 

Algorithm, 

Efficiency of an Algorithm, 

Time and Space Complexity, 

Asymptotic notations: 

Big Oh, Big Theta and Big Omega, 

Time-Space trade-off. 

Abstract Data Types (ADT) 

 Arrays: 

Definition, 

Single and Multidimensional Arrays, 

Representation of Arrays: 

Row Major Order, and Column Major Order, 

Derivation of Index Formulae for 1-D,2-D,3-D and n-D Array Application of arrays, 

Sparse Matrices and their representations. 

Linked lists: 

Array Implementation and 

Pointer Implementation of Singly Linked Lists, 

Doubly Linked List, 

Circularly Linked List, 

Operations on a Linked List. 

Insertion, 

Deletion, 

Traversal, 

Polynomial Representation 

and Addition Subtraction & 

Multiplications of Single variable 

& Two variables Polynomial.  

___________________________________________________________________________________

                                                                   UNIT 2:

to be continued...