Scribd
Upload
43 views4 pages

CS203 DSA Lab 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
43 views4 pages

CS203 DSA Lab 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/ 4

National Institute of Technology Karnataka, Surathkal

Department of Computer Science and Engineering


Course Plan
(Part-A)

Name of the course: Data Structures Course Code: CS203 No. of Credits (L-T-P): (0-0-3)2
and Algorithms Lab
Year:II Course Type: program core Academic Session: Odd Semester
Semester:III 2024
Section: S1

A. Prerequisites (if any): CS111 : C 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 (%)
Regular Lab + Mid Sem Exam End Sem Exam
Viva+Test 20% 40%
40%
K1 Remember 10% 15% 15% 05%

K2 Understand 20% 25% 20% 20%


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

K5 Evaluate 15% 15% 15% 15%

K6 Create 20% 10% 20% 20%


Total 100%

D. Assessment Process:

Evaluation Assessment Frequency Assessed by Reviewed by


Component
Weekly Assessment Every week throughout the Course Instructor and DUGC
semester Laboratory tutor
Viva Five times in a semester Course Instructor and DUGC
Laboratory tutor
Mid Sem Exam Once a semester Course Instructor DUGC
Test Once a semester Course Instructor and DUGC
Laboratory tutor
End Sem Exam Once a semester Course Course Instructor DUGC
Instructor
E. Course Objectives:

Sl. Course
No. Objectives
1 Understand various data representation techniques in the real world.

2 To learn the basics of data structures and implement them.


To understand the basic concepts of linear and non-linear data structures and implement them efficiently.
3
To learn how to select suitable data structures for a given problem.
4
5 To understand and implement algorithms to solve problems using fundamental data structures.

6 To understand and analyse searching and sorting techniques through their implementation.

F. Course (Learning) Outcomes (COs):

COs Course
Outcomes
1 Ability to implement basic data structures.

2 Ability to choose appropriate data structures to solve a given problem.


Knowledge of various searching and sorting algorithms.
3
Understanding efficiency and efficacy of the searching and sorting algorithms
4
5 Ability to choose an appropriate algorithm in solving problems.

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 1 3 1 1 1 - - 1 1 - 3 3 2

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

5 2 3 3 3 1 1 - - 1 1 - 3 3 2
2.8 2.6 2.6 2.4 1 1 - - 1 1 - 3 3 2
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 2 1 1 - - 1 1 - 3 3 2

I. Course Syllabus:

Module Topic to be No. of hrs.


covered
1 Arrays 04
2 Lists 06
3 Stacks 04
4 Queues 04
5 Trees 08
6 Graphs 08
7 Sorting Algorithms 06
8 Searching Algorithms 04

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

Ite Sl. Title, Author, Publisher,


ms No. etc.
Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft. Data Structures and Algorithms.
1
Addison Wesley, 1983
Text books D. Samanta, Classic Data structures, Prentice Hall, 2004
2
3 Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Pearson, 2014.

1 Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction


to Algorithms. McGraw-Hill, 2001.
Reference Donald Knuth, The Art of Computer Programming, vol. 1. Addison-Wesley, 3rd
2
books edition, 1997.
3 Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Fundamentals of Computer
Algorithms (second edition), Universities Press, 2012.
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 and signature of course instructor with date:


Name and signature of DUGC/DPGC Secretary with date:

Name and signature of DUGC/DPGC Chairman with date:

Name and signature of HOD with date:

**** END ***

You might also like