Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
82 views

Cse2002 Data-structures-And-Algorithms LTP 2.0 2 Cse2002 Data-structures-And-Algorithms LTP 2.0 1 Cse2002-Data Structures and Algorithms

This document outlines a course on data structures and algorithms. The course code is CSE2002 and has 4 credits. It requires an introduction to problem solving course as a prerequisite. The objectives are to understand fundamental data structures, analyze algorithm complexities, and apply concepts to real-world problems. Students will be able to apply data structures and algorithms to problems, develop software using techniques, and choose appropriate designs. The course covers sorting, searching, lists, stacks, queues, trees, hashing, and graphs through 45 lecture hours. Student learning is assessed through exams, quizzes, and projects.

Uploaded by

pankaj yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
82 views

Cse2002 Data-structures-And-Algorithms LTP 2.0 2 Cse2002 Data-structures-And-Algorithms LTP 2.0 1 Cse2002-Data Structures and Algorithms

This document outlines a course on data structures and algorithms. The course code is CSE2002 and has 4 credits. It requires an introduction to problem solving course as a prerequisite. The objectives are to understand fundamental data structures, analyze algorithm complexities, and apply concepts to real-world problems. Students will be able to apply data structures and algorithms to problems, develop software using techniques, and choose appropriate designs. The course covers sorting, searching, lists, stacks, queues, trees, hashing, and graphs through 45 lecture hours. Student learning is assessed through exams, quizzes, and projects.

Uploaded by

pankaj yadav
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Course Code Data Structures and Algorithms CT C

CSE2002 LTP 4
Prerequisite: Introduction to Problem Solving and Programming
Objectives:
1. To understand various types of fundamental data structures (standard and user defined).
2. To learn about algorithm analysis for the run time complexities and the space requirements.
3. To acquire knowledge of data structures and algorithms for implementing various real-world problems.

Expected Outcomes:
Students will be able to
1. Apply the fundamental knowledge of various data structures and algorithms to analyze, design, formulate
and implement algorithm for any real time problem.
2. Apply current techniques in data structures and algorithmic principles for modeling and developing
software systems.
3. Choose an appropriate design paradigm that solves the given problem efficiently along with appropriate
data structures.
4. Map real-world problems to algorithmic solutions.

Student Outcomes (SO): a,b,i,l,m


a. An ability to apply the knowledge of mathematics, science and computing appropriate to the
discipline
b. An ability to analyze a problem, identify and define the computing requirements appropriate to its
solution.
i. Design and conduct experiments as well as analyze and interpret data
l. An ability to apply mathematical foundations, algorithmic principles and computer science theory in the
modelling and design of computer-based systems (CS)
m. An ability to apply design and development principles in the construction of software systems (CS).
Unit No Unit Content No. of SOs
hours
Introduction to Algorithm and Data Structures 6 Hours a,b
Algorithm: Introduction - Algorithm Design – Complexity- Asymptotic
1 notations. Data Structures: Introduction- Classification of Data structure -
Abstract Data Type (ADT).

Sorting and Searching 8 Hours a,b,l


Brute force approach: General method -Sorting (bubble, selection, insertion)
–Searching (Sequential/Linear)
2 Divide and Conquer approach: General method - Sorting ( merge, quick) –
Searching (Binary Search).

List, Statck and Queue ADT 10 Hours a,b,l,m


Linked List: Array Vs Linked List - Singly Linked List, Doubly Linked Lists –
3
Circular Linked Lists-implementation - application.
Stack and Queue: Introduction – implementation (static and dynamic) –
application – Circular queues-application.

TREES AND HASHING 10 Hours a,b,l,m


Linear Vs Non-Linear Data Structures -General Tree – Terminologies -Binary
Tree – Expression Tree - Traversals - Binary Search Tree – AVL Tree – Red
4
block Tree – Splay Tree – B Tree. - Hashing: Introduction – Hash Function-
Methods-Collision Resolution.

Graph ADT 9 Hours a,b,l,m


Graph: Introduction – Representations – Traversals - Topological Sorting –
Connected and Bi-Connected Components – Articulation Point - Shortest-
5 path algorithms (Dijkstra’s and Floyd’s algorithms) - Minimum spanning tree
(Prim’s and Kruskal’s algorithms).

Guest Lecture on Contemporary Topics 2 Hours


Total Lecture: 45 Hours
Mode of Teaching and Learning: Flipped Class Room, One Lecture to be videotaped, Digital/Computer
based models to augment lecture for practice/tutorial, 2 hours lectures by industry experts on
contemporary topics
Mode of Evaluation and assessment:
The assessment and evaluation components may consist of unannounced open book examinations,
quizzes, student’s portfolio generation and assessment, and any other innovative assessment practices
followed by faculty, in addition to the Continuous Assessment Tests and Final Examinations.
Text Books:
1. Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein,
Introduction to Algorithms, 3rd Edition, MIT Press, 2009

Reference Books:
1. Mark A. Weiss,Data Structures and Algorithm Analysis in C++, 4th Edition, Pearson, 2014
2. Aaron M. Tenenbaum, Yeedidyah Langsam, Moshe J. Augenstein, ‘Data structures using
C’, Pearson Education, 2010.
3. D. E. Knuth, Art of computer programming, Volume 1: Fundamental algorithms,
Addison Wesley, 2011.

Indicative List of Experiments (All the experiments need to be done in C Language)


Description SO
1 Implementation of Sorting Algorithms (Bubble Sort, Merge sort and Quick sort)
2 Implementation of Searching Algorithms (Linear and Binary)
3 Implementation of Single Linked List.
4 Implementation Double Linked List.
5 Implementation Stack using Array and Linked List. a,b,i,l,m
6 Implementation of Queue using Array and Linked List.
7 Implementation of Binary Tree Traversals.
8 Implementation of Binary Search Tree.
9 Implementation of BFS and DFS.
10 Implementation of Dijkstra Shortest Path Algorithms.
11 Implementation of Prims and Kruskal Algorithms.
12 Implementation Hashing Techniques.
Recommendation by the Board of Studies on 27.12.2021
Approval by Academic council on
Compiled by Dr. M. Ashwin & Dr. Sandip Mal

You might also like