[go: up one dir, main page]
Scribd
Upload
32 views2 pages

CSE256

Uploaded by

Home Tv
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
32 views2 pages

CSE256

Uploaded by

Home Tv
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

CSE256:DATA STRUCTURES AND ALGORITHMS

L:2 T:0 P:2 Credits:3

Course Outcomes: Through this course students should be able to

CO1 :: describe the process to find efficiency of algorithms and arrays in real world

CO2 :: illustrate the importance of Linked List in context of real world problems

CO3 :: differentiate the Stack and Queue data structures for problem solving

CO4 :: analyze the fundamental concepts and operations of trees

CO5 :: analyze the effectiveness of graphs in programming

CO6 :: evaluate and implement various hashing techniques

Unit I
Introduction : Basic Concepts and Notations, Complexity analysis: time space and trade off, how to
calculate complexity of iterative and recursive algorithm., Omega Notation, Theta Notation, O
Notation, Basic Data Structures
Arrays : Linear arrays: memory representation, Array operations: traversal, insertion, deletion,
sorting, searching and merging and their complexity analysis.
Sorting : Bubble sort, Insertion sort, Selection sort

Unit II
Linked Lists : Introduction, Memory representation and allocation, Linked List Operations: Traversal,
Insertion, Deletion and their complexity analysis, Header linked list, Two-way lists: operations on two
way linked lists, Grounded and Circular Linked List
Unit III
Stacks : Introduction: List and Array representations, Operations on stack (traversal, push and pop),
Arithmetic expressions: polish notation, evaluation and transformation of expressions.
Queue : Array and list representation, operations (traversal, insertion and deletion), Priority Queues,
Deques
Recursion : Introduction, Recursive implementation of Towers of Hanoi, Merge sort, Quick sort

Unit IV
Trees : Introduction, Memory representation, Basic terminologies and properties, Tree traversal:
Inorder, Preorder and Postorder, Binary Tree: Introduction, Insertion, Deletion and Searching, Binary
Search Tree: Introduction, Insertion, Deletion and Searching
AVL trees and Heaps : AVL Tree: Introduction, Insertion, Deletion and Searching, Heap Tree:
Introduction, Insertion, Deletion, Searching and Heap sort, Huffman coding
Unit V
Graphs : Introduction, Memory representation, Types of Graphs, Basic Properties, Graph Traversal:
BFS, DFS, Shortest path algorithm, Warshall's algorithm, Floyd Warshall Algorithm(modified warshall
algorithm)
Unit VI
Hashing : Hashing introduction: hash functions, hash table, Open hashing (separate chaining),
Closed hashing (open addressing): linear probing, quadratic probing and double hashing.

List of Practicals / Experiments:

Programs:
• Array: Program to implement insertion and deletion operations in arrays

• Searching: Program to implement different searching techniques - linear and binary search

• Sorting: Program to implement different sorting techniques – bubble, selection and insertion sort

• Linked List: Program to implement searching, insertion and deletion operations in linked list

• Doubly Linked List: Program to implement searching, insertion and deletion operations in doubly
linked list
• Stack: Program to implement push and pop operations in stacks using both arrays and linked list

Session 2024-25 Page:1/2


• Queues: Program to implement enqueue and dequeue operations in queues using both arrays and
linked list
• Recursions: Program to demonstrate concept of recursions with problem of tower of Hanoi

• Recursive Sorting: Program to implement recursive sorting techniques - merge sort, quick sort

• Tree: Program to create and traverse a binary tree recursively and iteratively.

• Binary Search Tree: Program to implement searching, insertion and deletion operations in BST

• Heaps: Program to implement insertion and deletion operations in Heaps

• Heaps: Program to implement Heap Sort

• AVL: Program to implement insertion and deletion operations in AVL

• Graphs: Program to implement creation and traversal in graphs.

Text Books:
1. DATA STRUCTURES by SEYMOUR LIPSCHUTZ, M.G.Hills

References:
1. DATA STRUCTURES AND ALGORITHMS BY PEARSON by ALFRED V. AHO, JEFFREY D.
ULLMAN AND JOHN E. HOPCROFT,, PEARSON

Session 2024-25 Page:2/2

You might also like