Scribd
Upload
33 views3 pages

CS202 DSA Plan

Uploaded by

SmartSheets AI
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
33 views3 pages

CS202 DSA Plan

Uploaded by

SmartSheets AI
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

National Institute of Technology Karnataka, Surathkal

Department of Computer Science and Engineering


Course Plan (Part-A)

Name of the course: Data Course Code: CS202 No. of Credits (L-T-P) : (3-1-0) 4
Structures and Algorithms
Year:II Course Type: Program Core Academic Session: Odd Semester
Semester:III 2024
Section: S1

A. Prerequisites (if any): CS110 : Computer Programming


CS111 : Computer Programming Lab

B. Name and Contact Details of the Course Instructor: Vani M


Room #509,
Dept. of CS&E, NITK-Surathkal
0824-2473405 (O), E-mail: [email protected]

C. Assessment Pattern (Use Bloom’s taxonomy to design rubrics for evaluating students’ performance):

Evaluation
Level Knowledge Component Assessment(%)
No. Level
Surprise Test/
Tutorials/ Viva Mid-sem Exam Final Exam
40% 20% 40%
K1 Remember 30% 20% 20% 10%

K2 Understand 25% 20% 20% 20%


10% 20% 20% 20%
K3 Apply
K4 Analyse 20% 20% 20% 15%

K5 Evaluate 15% 10% 10% 15%

K6 Create 00% 10% 10% 20%


Total 100%

D. Assessment Process:

Evaluation Assessment Frequency Assessed by Reviewed by


Component
Tutorials Every week throughout the Course Instructor and DUGC
semester Teaching Assistant
Viva Once in a semester Course Instructor DUGC
Surprise Test Twice in a semester Course Instructor and DUGC
Teaching Assistant
Mid-Sem Exam Once in a semester Course Instructor DUGC
End-Sem Exam Once in a semester Course Instructor DUGC
E. Course Objectives:
Sl. Course
No. Objectives
1 To help the students to understand how to structure information to support efficient processing.

2 To provide knowledge in various data structures and algorithms.


To teach how to measure the effectiveness (in terms of time and space complexities) of algorithms.
3

F. Course (Learning) Outcomes (COs):


COs Course
Outcomes
1 Understand the properties of various data structures and identify the strengths and weaknesses of
different data structures.
2 Possess the ability to design efficient algorithms for solving computing problems
To write efficient programs using appropriate data structures
3
Understand the necessary mathematical abstraction to solve problems
4
Come up with analysis of efficiency and proofs of correctness
5

G. Course Articulation Matrix:


(Note: Enter correlation levels 1, 2, or 3 as defined below: 1 - Slight (Low), 2 - Moderate (Medium) 3 - Substantial (High), and
If there is no correlation, put “-”_)

COs PO PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PSO- PSO-
-1 2 3 4 5 6 7 8 9 10 11 12 1 2
1 3 3 3 3 2 - - - 3 - - 2 3 3

2 3 3 3 3 3 - - - 3 - - 2 3 3
3 3 3 3 3 - - - 2 - - 2 3 3
3
4 3 3 3 3 2 - - - 2 - - 2 3 3

5 3 2 2 2 2 - - - 2 - - 2 3 2
3 2.8 2.8 2.8 2.4 - - - 2.4 - - 2 3 2.8
Avg
.
H. Program Articulation Matrix:
(Note: Enter correlation levels 1, 2, or 3 as defined below: 1 - Slight (Low), 2 - Moderate (Medium) 3 - Substantial (High), and
If there is no correlation, put “-”)

PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 -1 -2
3 3 3 3 2 - - - 2 - - 3 3 3
I. Course Syllabus:

Modul Topic to be No. of hrs.


e covered
1 Introduction to basic data structures and algorithms, abstract data types, dynamic 6
memory allocation, pointer concepts classification of data structures (linear and
non-linear structures).
2 Classification of algorithms and their efficiencies, best case, average-case and 8
worst-case analysis, time complexity and space complexity, asymptotic notation,
Classical Searching & Sorting Algorithms
3 Linear list, circular list, doubly list, and doubly circular list, applications of linked 6
list.
4 Stack implementation using array and linked list, multiple stacks implementation 8
using array, implementation of recursion, evaluation of arithmetic expressions.
5 Queue implementation using array and linked list, deque, priority queue, circular 4
queue, application of queues
6 Definition and concepts, binary trees, representation of binary trees, operations on 8
binary trees, tree traversal methods, types of binary trees, applications of trees.
7 Introduction to graphs, graph terminologies, graph representation using array and 6
linked list, operations on graphs, graph traversals , shortest path problem, minimum
spanning trees.

J. List of Textbooks & Reference books, Online Course Resources:

Items Sl. Title, Author, Publisher, etc.


No.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction
1
to Algorithms. McGraw-Hill, 2001.
Textbooks Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Fundamentals of Computer
2
Algorithms (second edition), Universities Press, 2012.
3 D. Samanta, Classic Data structures, Prentice Hall, 2004

1 Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft. Data Structures and Algorithms.
Addison Wesley, 1983
Reference Donald Knuth, The Art of Computer Programming, vol. 1. Addison-Wesley, 3rd
2
books edition, 1997.
3 Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Pearson, 2014.

1 NPTEL videos (https://nptel.ac.in/courses/106/102/106102064/)

Online 2 CS50 Harvard Course (https://cs50.harvard.edu/college/2020/spring/)


Resources

Name of course instructor with date: Vani M.

**** END ***

You might also like