Scribd
Upload
77 views3 pages

Dsa Syllabus Veltech

The document outlines the course structure for 'Data Structures and Algorithms' at Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology, detailing course objectives, outcomes, and content. It includes prerequisites, learning resources, and a breakdown of topics covered over 45 hours, such as trees, graphs, sorting, and searching techniques. The course aims to equip students with the ability to implement and apply various data structures and algorithms to solve real-world problems.

Uploaded by

madamanchisathwik
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
77 views3 pages

Dsa Syllabus Veltech

The document outlines the course structure for 'Data Structures and Algorithms' at Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology, detailing course objectives, outcomes, and content. It includes prerequisites, learning resources, and a breakdown of topics covered over 45 hours, such as trees, graphs, sorting, and searching techniques. The course aims to equip students with the ability to implement and apply various data structures and algorithms to solve real-world problems.

Uploaded by

madamanchisathwik
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/ 3

Vel Tech Rangarajan Dr.

Sagunthala R&D Institute of Science and Technology


(Deemed to be University Estd. u/s 3 of UGC Act, 1956)
Avadi, Chennai-600062, Tamil Nadu, India

COURSE CODE COURSE TITLE L T P C


10211IT117 Data Structures and Algorithms 3 0 0 3
A. Preamble
This course aims at molding the learner to understand the various data structures, their
organization and operations. The course helps the learners to assess the applicability of
different data structures and associated algorithms for solving real world problem.

B. Prerequisite Course
10210CS101 - Problem Solving using C.

C. Course Objectives
Learners are exposed to:
• Understand basic elementary data structures.
• Illustrate the basic properties of Trees and Graphs.
• Implement various techniques of sorting and searching algorithms.
• Choose efficient data structure and apply them to solve problems.

D. Course Outcomes
Upon the successful completion of the course, students will be able to:
CO
Course Outcomes K - Level
No’s

Design modular algorithms to find solution for computational problem


CO1 K3
with time and space complexities using suitable linear data structure.
Demonstrate the familiarity with tree data structure, rule to manipulate
CO2 K3
those, and their canonical applications.
Solve unstructured problem using balanced search tree algorithm,
CO3 K3
hashing function.

CO4 Implement an appropriate algorithm using graph ADT for an application. K3

CO5 Apply sorting and searching techniques for real world problems. K3

Knowledge Level (Based on revised Bloom’s Taxonomy)


K1-Remember K2-Understand K3-Apply K4-Analyze K5-Evaluate K6-Create

E. Correlation of Cos with Program Outcomes and Programme Specific Outcomes:


Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 2 1 1 3 3
CO2 3 3 3 2 1 1 3 3
CO3 3 3 3 3 1 1 2 3
CO4 3 3 3 3 1 1 3 3 2
CO5 3 3 2 2 1 1 2 3 2
3- High; 2-Medium; 1-Low

17
F. Course Contents
Unit 1 Introduction to Data Structure L-9 Hours
Introduction: Dynamic aspects of operations on data, Characteristics of data, Creation,
Manipulation and Operations on data, Data Structure and its types, Abstract Data Types
(ADTs), Analysis of algorithms and its Types, Asymptotic Notation. Arrays: Allocation,
Operations and Storage with one-dimensional arrays and multidimensional arrays. Stacks:
Operations on Stacks, Applications of Stacks, Queues: Operations and its types. Linked
lists: Operations and Types of linked list (singly, doubly and circularly linked list),
Implementation of Stack and Queue using linked list, Applications of Linked List.
Case Study: Tower of Hanoi, Sparse matrix.

Unit 2 Trees L-9 Hours


Introduction to Trees – Definitions and concepts, Representation of Binary Tree, Types of
Binary tree, properties, structure and applications of binary tree, Binary Tree Traversal with
Recursive and Non-Recursive - Expression Tree, Binary Search Trees – Definition,
Properties and Operations of binary search tree. Priority Queue: Operations,
Implementations- Heaps: properties and types of Heaps, Binary Heap: Representation,
Declaration and Creation of Heap, Heapifying, Inserting and Deleting an element,
Destroying Heap, Heap Sort. Case Study: Priority Queue in bandwidth management

Unit 3 Special Trees & Hashing L-9 Hours


AVL Tree: Properties, Declarations, Rotations, Insertion, Deletion. B-Tree: Properties,
Insertion, Deletion –Trie: Insertion, Deletion, Searching. Hashing - Separate Chaining –
Open Addressing – Linear Probing – Quadratic Probing – Double Hashing –Rehashing.
Case Study: DNA sequence matching

Unit 4 Graphs L-9 Hours


Introduction to Graphs – Operations on graphs – Representation of Graph – Topological
Sort - Graph Traversal - Depth first search – Breadth First Search – Minimum Spanning
Tree – Prim’s Algorithm- Kruskal’s Algorithm – Disjoint subsets and Union-Find
algorithms – Shortest Path Algorithms – Unweighted Shortest Paths –Dijkstra’s
Algorithm. Applications of Graphs. Case Study: Representing Google maps,
Recommendations on e-commerce websites.

Unit 5 Sorting, Searching L-9 Hours


Searching Techniques: Linear Search, Binary Search. Sorting techniques: Insertion Sort,
Selection sort, Merge sort, Quick Sort, Shell sort, Bubble sort, Counting sort, Bucket
sort, Radix sort. Case Study: Tim Sort
Total: 45 Hours

G. Learning Resources

i. Text Books:
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition,
Pearson Education, Reprinted edition 2013.[Unit 1,2,3]
2. Ellis Horowitz, Sartaj Sahni, Susan Anderson Freed, “Fundamentals of Data
Structure in C”, Universities Press,2017. [Unit 4,5]

ii. Reference Books:


1. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”,
Pearson Education, First Edition, Reprint 2017.
Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology
(Deemed to be University Estd. u/s 3 of UGC Act, 1956)
Avadi, Chennai-600062, Tamil Nadu, India

2. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India


Edition, 2007.
3. Seymour Lipschutz, “Data Structures with C”, Scham’s outlines, Tata McGraw
Hill, 2017.

iii. Online References:


1. “Introduction to Data Structures and Algorithms” 31.12.2009. Accessed on Apr.
20, [Online]. Available: https://nptel.ac.in/courses/106/102/106102064/.
2. “Data Structures and algorithms”. Accessed on: Apr. 15, 2021 [Online].
Available: https://www.coursera.org/specializations/data-structures-algorithms.
3. “Data structures Visualization” 2011. Accessed on: Apr. 15, 2021 [Online].
Available: https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
4. “Data Structures Fundamentals” 2021, Accessed on: Apr. 20,2021 [Online].
Available: https://www.edx.org/course/data-structures-fundamentals

19

You might also like