Scribd
Upload
6 views

DSA CIF

The document outlines the course structure for 'Data Structures and Algorithms' (CSE 213) offered by the Department of Computer Science & Engineering at LNMIIT, Jaipur. It details the learning objectives, course outcomes, topics covered, lab experiments, evaluation methods, and references. The course aims to equip students with the ability to choose appropriate data structures and algorithms for effective program design and problem-solving.

Uploaded by

varunrawat5758
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 views

DSA CIF

The document outlines the course structure for 'Data Structures and Algorithms' (CSE 213) offered by the Department of Computer Science & Engineering at LNMIIT, Jaipur. It details the learning objectives, course outcomes, topics covered, lab experiments, evaluation methods, and references. The course aims to equip students with the ability to choose appropriate data structures and algorithms for effective program design and problem-solving.

Uploaded by

varunrawat5758
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

LNMIIT, Jaipur

Department of Computer Science & Engineering

Programme: Course Title: Course Code:


B. Tech.: CSE, Data Structures and Algorithms CSE 213
ECE, MME &
CCE.
Type of Course: Prerequisites: Programming for Problem Solving (PPS) Total Contact Hours:
Program Core 40+30=70
Year/Semester: Lecture Hrs/Week: Tutorial Hrs/Week: Practical Hrs/Week: Credits:
1/Even 3 0 3 4.5

Learning Objectives:
The choice of data structures and algorithms impact the design and performance of programs. This course
aims at teaching the students to choose the appropriate data structures and algorithms to design and
implement applications. It also discusses systematic ways for solving problems using efficient and
effective data-structures of organizing in-memory data. Specifically, it discusses how to solve problems
using data structures such as linear lists, stacks, queues, hash tables, binary trees, heaps, multi-way trees,
and search trees. Also, it discusses basic algorithms for solving problems related to trees and graphs
including spanning trees, node connectivity, graph traversals and shortest paths.

Course outcomes (COs):


On completion of this course, the students will have the ability to: Bloom’s Level
CO-1 Understand the basic idea of Data structures and Algorithms and the 2
concept of time complexity.
CO2 Explain the structures properties and operations of Stacks and Queues. 2
CO-3 Define and explain the structure, properties, and operations on basic Lists 2
data structures.
CO-4 Define Graph data structure, its properties, and operations. Apply them on 3
solving related problems.
CO-5 Define basic Tree data structure, its properties, and operations. Apply them 3
on solving related problems.

Lecture CO
Course Topics
Hours
UNIT – I (Introduction)
1.1 Introduction to data structures, Abstract data types, Arrays. 2
1.2 Introduction to algorithms, Time and Space complexity of algorithms, CO1
asymptotic analysis, big O and other notations, importance of efficient 3
algorithms, program performance measurement.
UNIT – II (Linear Lists)
2.1 Sequential and Linked representations, comparison of insertion, deletion and 7 CO3
search operations for sequential and linked representation, singly linked lists,

CSE Department, LNMIIT Jaipur Page | 1-3


LNMIIT, Jaipur
Department of Computer Science & Engineering

doubly linked lists, circular lists.


UNIT – III (Stacks and Queues)
3.1 Stacks and Queues disciplines: sequential and linked implementations.
Applications of stack: Parenthesis/brackets matching, Expression conversion, 4 CO2
Expression evaluation. Queues and Circular Queues: concepts and
implementation.
UNIT-IV (Hashing)
4.1 Search efficiency in lists; hashing as a search structure, hash table, collision
2 CO3
avoidance, open addressing, probing.
UNIT-V (Graphs and Graph algorithms)
5.1 Definition, terminology, directed and undirected graphs, properties, 3
representation – adjacency matrix and linked adjacency chains.
CO4
5.2 Graph traversal algorithms, Spanning trees (Prim’s algorithm), Shortest path 5
algorithms (Dijkstra’s algorithm), Topological sorting (using DFS).
UNIT-VI (Trees and Tree algorithms)
6.1 Binary trees and their properties, terminology, sequential and linked 2
implementations, and tree traversal.
6.2 Binary search trees, search efficiency, insertion and deletion operations, 2
traversal operations, importance of balancing.
6.3 AVL trees, searching insertion and deletions in AVL trees, comparison with 4 CO5
AVL trees, search insert and delete operations.
6.4 Heaps as priority queues, heap implementation, insertion and deletion 4
operations, heap sort.
6.5 2-3-way search trees, Search, Insert and Delete operations. 2

Lab Experiments
Topic CO Mapping Hours
1. Review: Structures and Pointers CO1 2
2. Implementation of Linked Lists, its types CO2 4 (2 LAB SESSION)
3. Implementation of Stack, associated CO1 4 (2 LAB SESSION)
applications
4. Implementation of circular queue, associated CO1 2
applications
5. Implementation of tree, associated operations CO5 2
6. Implementation of heaps, related applications CO5 2
7. Implementation of graphs, associated CO4 4 (2 LAB SESSION)
operations and applications
10 LAB SESSIONS

CSE Department, LNMIIT Jaipur Page | 2-3


LNMIIT, Jaipur
Department of Computer Science & Engineering

Textbook references (IEEE format):

Text Books:

1. Aho A.V., J.E. Hopcroft, J.D. Ullman, Data Structures and algorithms, Pearson, 1983.

Reference books:
1. Robert L. Kruse, Bruce P. Leung, Clovis L. Tondo, Data Structures and Program Design In C
(2nd Edition), Prentice Hall, 1996.
2. Ellis Horowitz, Sartaj Sahni, Fundamentals of Data Structures, (9th edition), Computer Science
Press, 1988.
3. Niklaus Wirth, Algorithms + Data Structures = Programs, Prentice-Hall Series in Automatic
Computation, 1986.
4. Aaron M. Tenenbaum, Y. Langsam, Moshe J. Augenstein, Data Structures Using C., PHI
Learning, 2009.
Evaluation Method
Item Weightage (%)
Quizzes 10
Mid term 25
End term 40
Lab mid term 10
Lab End Term 15

*Please note, as per the existing institute’s attendance policy the student should have a minimum of 75%
attendance. Students who fail to attend a minimum of 75% lectures will be debarred from the End
Term/Final/Comprehensive examination.

CO and PO Correlation Matrix

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 1 3 3
CO2 3 2 1 3 3
CO3 3 2 1 3 3
CO4 3 2 1 3 3
CO5 3 2 1 3 3

Last Updated On:

Updated By:

Approved By:

CSE Department, LNMIIT Jaipur Page | 3-3

You might also like