Scribd
Upload
124 views

DS

This document outlines the course content for CS 211 Data Structures. It covers fundamental data structures like arrays, linked lists, stacks, queues, trees, graphs, and their implementations. Algorithms for searching and sorting are also included. The course discusses asymptotic analysis of algorithms for time and space complexity. CS 225 is the accompanying lab course that provides hands-on implementation of the data structures and algorithms.

Uploaded by

Shamik Tiwari
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
124 views

DS

This document outlines the course content for CS 211 Data Structures. It covers fundamental data structures like arrays, linked lists, stacks, queues, trees, graphs, and their implementations. Algorithms for searching and sorting are also included. The course discusses asymptotic analysis of algorithms for time and space complexity. CS 225 is the accompanying lab course that provides hands-on implementation of the data structures and algorithms.

Uploaded by

Shamik Tiwari
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

CS 211

Data Structures

3-1-0-4

Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations, Time-Space trade-off. Abstract Data [4] Types (ADT). Array: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major Order, [4] and Column Major Order, Application of arrays, Sparse Matrices and their representations. Linked list: Singly Linked Lists, Doubly Linked List, Circular Linked List, Insertion, Deletion, Traversal, Polynomial Representation and Addition, Generalized Linked List. [6] Stack: Primitive Stack operations: Push & Pop, Array and Linked list implementation of stack, Application of stack: Prefix and Postfix Expressions, Evaluation of Postfix Expression, Recursion, Tower of Hanoi Problem. [4] Queue: Queue operations, Circular queues, Array and Linked List Implementation of Queues, Dequeue and Priority Queue. [4] Tree: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and Linked List Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Array and Linked Representation of Binary trees, Tree Traversal algorithms: Inorder, Preorder and Postorder, Threaded Binary trees, Traversing Threaded Binary trees, Huffman algorithm. Binary Search Trees (BST), Insertion and Deletion in BST, AVL trees, m-way Search Trees, B tree. [6] Graph: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices, Adjacency List, Adjacency Multi list, Graph Traversal : Depth First Search and Breadth First Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm. Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm [6] Searching & Sorting: Sequential search, Binary Search, Comparison and Analysis, Hash Function, Collision Resolution Strategies. Insertion Sort, Selection Sort, Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Radix Sort. [6]

2 3 4

5 6

Text book 1. Lipschutz, Data Structures Schaums Outline Series, TMH,2003 References: 1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein Data Structures Using C and C++ , PHI,2006 2. Horowitz and Sahani, Fundamentals of Data Structures, Galgotia Publication,1998 3. Jean Paul Trembley and Paul G. Sorenson, An Introduction to Data Structures with applications, McGraw Hill,2007 4. R. Kruse etal, Data Structures and Program Design in C, Pearson Education,2008 5. G A V Pai, Data Structures and Algorithms, TMH,2006

CS 225

Data Structures Lab

0-0-3-1.5

Arrays Testing: Array declaration Array initialization Maximum and Minimum of array Addition & deletion of elements in the arrays Programs: To implement the array concepts for matrix applications. To implement the 1-D, 2-D and 3-D array concepts for data storage and retrieval. Stack Testing: Overflow Underflow Array implementation Linked list implementation Push Pop Programs: To implement various operations over the stack. To demonstrate applications of stack e.g. infix to prefix conversion. Queues Testing: Overflow Underflow Array implementation Linked list implementation Insertion Deletion Circular array Programs: To implement various operations over the queue. To demonstrate variations of queue e.g. dequeue. Linked List Testing: Dynamic memory allocation Structure Pointers Node definition Underflow Insertion Deletion Traversing Searching

Programs: To implement various operations over the linked list. To demonstrate variations of linked list e.g. Circular linked list. To implement linked list concepts for data storage and retrieval application. Tree Testing: Structure Node definition Array implementation Linked list implementation Insertion Deletion Searching Programs: To implement various operations over the linked list. To demonstrate variations of Tree e.g. binary search tree. To demonstrate applications of Tree. Graph Testing: Node definition Array implementation Linked list implementation Insertion Deletion Searching Programs: To implement various traversing of Graph. To demonstrate applications of Graph. Searching Testing: Linear Search Binary Search Programs: To demonstrate applications of searching. Sorting Testing: Bubble Sort. Insertion Sort. Selection Sort. Quick Sort. Heap Sort. Programs: To demonstrate applications of searching.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy