Scribd
Upload
6 views2 pages

Syllabus dsa

Uploaded by

roypraveen272
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

Syllabus dsa

Uploaded by

roypraveen272
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

COURSE CONTENT

Introduction: Basic Terminology, Types and application of Data Structures, Algorithm, Efficiency of an
algorithm, Time-space trade-off and complexity, asymptotic notation.

Array: Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, and Column
Major Order, Derivation of Index Formulae for 1-D,2-D, and multi-D Array, Application of arrays, Sparse
Matrices, and their representations, arithmetic operations on matrices.

Recursion: Tail recursion, Head Recursion, Nested recursion, Removal of recursion. Problem solving
using iteration and recursion with examples such as Fibonacci numbers, and Hanoi towers. Trade-offs
between iteration and recursion.

Searching & Sorting: Linear search, Binary Search, Indexed Sequential search, Hashing, Insertion Sort,
Bubble sort, Selection sort, Quick Sort, Merge Sort.

Linked lists: Introduction, Singly Linked Lists, Doubly Linked List, Circularly Linked List, Operations on
a Linked List. Insertion, Deletion, Traversal, Reversing, Application of Linked List: Polynomial
Representation, Addition and Multiplication, Generalized Linked List.

Stack: Introduction, Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked List
Implementation of Stack, Application of Stack: Prefix and Postfix Expressions, Evaluation of postfix
expression.

Queue: Introduction, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array
and linked implementation of queues, Double Ended queue, and Priority Queue.

Trees: Binary Tree and Its array and linked list representation, Strict Binary Tree, Complete Binary Tree,
Tree Traversal algorithms: In-order, Pre-order, and Post-order, level order, Constructing Binary Tree from
given Tree Traversal, BST Operation: Searching, Insertion, Deletion, Threaded Binary Trees, Traversals
in Threaded Binary Trees, Heaps, Heap Sort.

Graph-Introduction to graph, Concepts, and representation.


Text Book
1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein “Data Structures”.
2. Sahni Sartaj, “Data structures, algorithms, and applications in Java”, McGraw-Hill
Reference Books
1. Michael T. Goodrich; Roberto Tamassia; Michael H. Goldwasser; Subhasish Banerjee “Data
Structures and Algorithms in Java”, Wiley.
2. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with
applications”, Mc Graw Hill
3. James Cutajar “Beginning Java Data Structures and Algorithms”, O’Reilly.
4. John Hubbard "Data Structures with Java" Schaum's Outline Series.
5. Narasimha Karumanchi "Data Structures and Algorithms Made Easy in Java" Career Monk

You might also like