FR.

Conceicao Rodrigues College Of Engineering

Department of Computer Engineering
S.E. (AI&DS) (semester
III) (2022-2023)
Lesson Plan

Branch: AI&DS Semester:III

Subject: Data Structures Credits-4
Course code: CSC303

Course Title: Data Structures SEE: 3 Hours – Theory

& Oral Examination
Total Contact Hours: 36 Hours Duration of SEE: 3 Hrs
SEE Marks: 80 (Theory) + 20 (IA)
Lesson Plan Author: Date:
Checked By: Date:

Pre-requisite: C Programming

Syllabus:

Course Objectives: The course aims:

1 To understand the need and significance of Data structures as a computer
Professional
2 To teach concept and implementation of linear and Nonlinear data structures.
3 To analyze various data structures and select the appropriate one to solve a
specific real- world problem.
4 To introduce various techniques for representation of the data in the real world.
5 To teach various searching techniques.

Course Outcomes:
1 Students will be able to implement Linear and Non-Linear data structures.
2 Students will be able to handle various operations like searching, insertion,
deletion and traversals on various data structures.
3 Students will be able to explain various data structures, related terminologies and
its types.
4 Students will be able to choose appropriate data structure and apply it to solve
problems in various domains.
5 Students will be able to analyze and Implement appropriate searching
techniques for a given problem.
6 Students will be able to demonstrate the ability to analyze, design, apply
and use data structures to solve engineering problems and evaluate their
solutions.
Module Detailed Content Hours
1 Introduction to Data Structures 2
1.1 Introduction to Data Structures, Concept of ADT, Types of Data
Structures- Linear and Nonlinear, Operations on Data Structures.
2 Stack and Queues 8
2.1 Introduction, ADT of Stack, Operations on Stack, Array
Implementation of Stack, Applications of Stack-Well form-ness of
Parenthesis, Infix to Postfix Conversion and Postfix Evaluation,
Recursion.
2.2 Introduction, ADT of Queue, Operations on Queue, Array
Implementation of
Queue, Types of Queue-Circular Queue, Priority Queue,
Introduction of Double Ended Queue, Applications of Queue.
3 Linked List 10
3.1 Introduction, Representation of Linked List, Linked List v/s Array,
Types of Linked List - Singly Linked List, Circular Linked List,
Doubly Linked List, Operations on Singly Linked List and Doubly
Linked List, Stack and Queue using Singly Linked List, Singly
Linked List Application-Polynomial Representation and Addition.
4 Trees 11
4.1 Introduction, Tree Terminologies, Binary Tree, Binary Tree
Representation, Types of Binary Tree, Binary Tree Traversals, Binary
Search Tree, Operations on Binary Search Tree, Applications of
Binary Tree-Expression Tree, Huffman Encoding, Search Trees-
AVL, rotations in AVL Tree, operations on AVL Tree,
Introduction of B Tree, B+ Tree.
5 Graphs 4
5.1 Introduction, Graph Terminologies, Representation of Graph, Graph
Traversals- Depth First Search (DFS) and Breadth First Search
(BFS), Graph Application- Topological Sorting.
6 Searching Techniques 4
6.1 Linear Search, Binary Search, Hashing-Concept, Hash Functions,
Collision resolution Techniques

Textbooks:
1 Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein, “Data
Structures Using C”, Pearson Publication.
2 Reema Thareja, “Data Structures using C”, Oxford Press.
3 Richard F. Gilberg and Behrouz A. Forouzan, “Data Structures: A
Pseudocode Approach with C”, 2ndEdition, CENGAGE Learning.
4 Jean Paul Tremblay, P. G. Sorenson, “Introduction to Data Structure and Its
Applications”, McGraw-Hill Higher Education
5 Data Structures Using C, ISRD Group, 2ndEdition, Tata McGraw-Hill.
References:
1 Prof. P. S. Deshpande, Prof. O. G. Kakde, “C and Data Structures”, DreamTech
press.
2 E. Balagurusamy, “Data Structure Using C”, Tata McGraw-Hill Education India.
3 Rajesh K Shukla, “Data Structures using C and C++”, Wiley-India
4 GAV PAI, “Data Structures”, Schaum’s Outlines.
5 Robert Kruse, C. L. Tondo, Bruce Leung, “Data Structures and Program
Design in C”, Pearson Edition

Course Outcomes:
At the end of the course students will be able to:

CSC303.1 Able to implement Linear and (Application)

Non-Linear data structures.
CSC 303.2 Able to handle various (Application)
operations like searching,
insertion, deletion and
traversals on various data
structures.
CSC 303.3 Able to explain various data (Application)
structures, related
terminologies and its types.
CSC 303.4 Able to choose appropriate (Application)
data structure and apply it to
solve problems in various
domains.
CSC 303.5 Able to analyze and (Analyze and
Implement appropriate Application)
searching techniques for a
given problem.
CSC 303.6 Able to demonstrate the (Analyze and
ability to analyze, design, Application)
apply and use data structures
to solve engineering problems
and evaluate their solutions.
Program Outcomes (POs)
Engineering Graduates will be able to

1. Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.
2. Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
3. Design/Development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified needs
with appropriate consideration for public health and safety, and the cultural, societal,
and environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and
research methods including design of experiments, analysis and interpretation of
data, and synthesis of the information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling of complex
engineering activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate the
knowledge of, and the need for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member
or leader in diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with
the engineering community and with society at large, such as, being able to
comprehend and write effective reports and design documentation, make effective
presentations, and give and receive clear instructions.
11. Project Management and finance: Demonstrate knowledge and understanding of
the engineering and management principles and apply these to one’s work, as a
member and leader in a team, to manage projects and in multidisciplinary
environments.
12. Life-long learning: Recognized the need for, and have the preparation and ability to
 engage in independent and life-long learning in the broadest context of technological
change.

(A)Program Specific Outcomes (PSOs)

Student will have ability to

1. The graduate of BE in AI&DS program will have strong foundation and ability
to use cutting– edge AI tools and techniques to innovate and develop new
solutions.

Mapping of CO and PO/PSO

Relationship of course outcomes with program outcomes: Indicate 1 (low importance),

2 (Moderate Importance) or 3 (High Importance) in respective mapping cell.

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO
(Engg (Analys (De (inve (tools) (engg (Env) (Eth) (ind (com (PM) (life 1
Know is) sign) stiga) Soci) Team) m.) Long
) )
CSC303.1 3 3
CSC303.2 3 3
CSC303.3 3 1 3
CSC303.4 3 3 2 3
CSC303.5 3 3 3
CSC303.6 3 3 3 3
TOTAL 18 10 5 18
Course 3 2.5 2.5 3
To PO

Justification

PO1: CSC303.1, CSC303.2, CSC303.3, CSC303.4, CSC303.5 and CSC303.6 maps to

PO1 because engineering graduates will be able to use linear, non-linear data structures
and algorithms to provide a solution to complex engineering problems.

PO2: CSC 303.3, CSC303.4, CSC303.5 and CSC303.6 also maps to PO2 as engineering
graduates will be able to analyze a problem to make a decision about which data
structure, algorithm, searching or sorting techniques are appropriate to solve engineering
problems and evaluate their solutions.

PO3: CSC 303.4 and CSC 303.5 maps to PO3 since students will be able to develop
solution to real world problems with the help of data structure and searching/sorting
algorithm.
PSO1: CSC303.1, CSC303.2, CSC303.3, CSC 303.4, CSC 303.5 and CSC303.6 maps
to PSO1 as Engineering graduates will be able to have strong foundation and ability to
use cutting– edge AI tools and techniques to innovate and develop new solutions.

CO Assessment tools:

1) CSC305.1 Implement various linear and nonlinear data structures. Target: 2.5

Direct Method Weightage Target Marks

Unit Test 1 0.2 60% of students will 20 M
minimum score 80%
marks
University 0.2(TH) 60% of students will 80M
Exam minimum score 60%
(Theory ) marks
University 0.25(PR) 60% of students will 25M
Exam minimum score 80%
(Practical ) marks
Assignment 1 0.1 75% of students will 10M
minimum score 75%
marks
Lab Performance 0.2 75% of students will 100M
minimum score 70%
marks
Indirect Method Weightage Target
Course Exit 1 85% of students
Survey strongly agree and
agree

CSC303.1:
a) Direct Methods (80%): Unit Test 1+UniExam+ Assignment+ Lab
performance
CSC305.1 dm = 0.2UT1 +0.1Q1+ 0.2UniexamTH+0.25UniexamPR+
0.1Assignment +0.2Lab

b) InDirect Methods(20%): Course exit survey

CSC305.1idm
 CSC305.1 = 0.8* CSC305.1dm + 0.2* CSC305.1idm

2) CSC303.2 Implement various operations like searching, insertion, deletion and

traversals on various data structures.
Target: 2.5

Direct Method Weightage Target Marks

Unit Test 1 0.2 60% of students will 16 M
minimum score 80%
marks

University 0.25(TH) 60% of students will 80M

Exam minimum score 80%
(Theory ) marks
University 0.25(PR) 60% of students will 25M
Exam minimum score 60%
(Practical ) marks
Lab 0.2 75% of students will 20M
Performance
minimum score 70%
marks
Assignment 1 0.1 75% of students will 10M
minimum score 75%
marks

Indirect Method Weightage Target

Course Exit 1 85% of students
Survey strongly agree and
agree

CSC303.2:
a. Direct Methods (80%): Unit Test 1+UniExam+ Assignment+ Lab
performance
CSC305.2 dm = 0.2UT1 + 0.25UniexamTH+0.25UniexamPR+
0.1Assignment +0.2Lab
 b. InDirect Methods(20%): Course exit survey
CSC305.1idm
CSC305.2 = 0.8* CSC305.2dm + 0.2* CSC305.2idm

3) CSC303.3. Able to explain various data structures, related terminologies and its types.
Target: 2.7
Direct Method Weightage Target Marks
Unit Test 2 0.1 60% of students will 04 M
minimum score 80%
marks
Assignment 2 0.3 60% of students will 20M
minimum score 80%
marks
University 0.25(TH) 60% of students will 80M
Exam minimum score 60%
(Theory ) marks
University 0.25(PR) 60% of students will 25M
Exam minimum score 70%
(Practical ) marks
Lab 0.2 75% of students will 20M
Performance minimum score 70%
marks
Indirect Weightage Target
Method
Course Exit 1 85% of students
Survey strongly agree and agree

CSC303.3: Implement appropriate searching techniques for a given problem.

a) Direct Methods (80%): Unit Test 2+ Uni Exam+ Case study+ Lab
performance
CSC305.3dm = 0.1UT2 + 0.25UniexamTH+ 0.25UniexamPr
+0.2Lab
b) InDirect Methods(20%): Course exit
survey
CSC305.3idm

CSC305.3 = 0.8* CSC305.3dm + 0.2* CSC305.3idm

 CSC303.4 Choose appropriate data structure and apply it to solve
problems in
various domains
Target: 2.8

Direct Method Weightage Target Marks

Unit Test 1 0.2 60% of students will 20 M
minimum score 80%
marks
University 0.2(TH) 60% of students will 80M
Exam minimum score 60%
(Theory ) marks
University 0.25(PR) 60% of students will 25M
Exam minimum score 80%
(Practical ) marks
Assignment 2 0.1 75% of students will 10M
minimum score 75%
marks
Indirect Method Weightage Target
Course Exit 1 85% of students
Survey strongly agree and
agree

CSC303.4:
a) Direct Methods (80%): Unit Test 1+ UniExam+ Assignment
CSC305.4dm = 0.2UT1 + 0.25UniexamTH+0.25UniexamPR+ 0.1Assignment
b) InDirect Methods(20%): Course exit survey
CSC305.4idm

CSC305.4 = 0.8* CSC305.4dm + 0.2* CSC305.4idm

CSC303.5 Able to analyze and Implement appropriate searching

techniques for a given problem
Target: 2.8
 Direct Method Weightage Target Marks
Unit Test 2 0.1 60% of students will 04 M
minimum score 80%
marks
Assignment 2 0.3 60% of students will 20M
minimum score 80%
marks
University 0.2(TH) 60% of students will 80M
Exam minimum score 60%
(Theory ) marks
University 0.2(PR) 60% of students will 25M
Exam minimum score 70%
(Practical ) marks
Lab 0.2 75% of students will 20M
Performance minimum score 70%
marks
Indirect Weightage Target
Method
Course Exit 1 85% of students
Survey strongly agree and agree

CSC303.5:
b) Direct Methods (80%): Unit Test 2+ UniExam+ Assignment+ Lab
performance
CSC305.5dm = 0.2UT1 + 0.25UniexamTH+0.25UniexamPR+ 0.1Assignment +
0.2LabPerf
b) InDirect Methods(20%): Course exit survey
CSC305.5idm

CSC305.5 = 0.8* CSC305.5dm + 0.2* CSC305.5idm

CSC303.6 Able to demonstrate the ability to analyze, design, apply

and use data structures to solve engineering problems and evaluate their
solutions. Target: 2.8

Direct Method Weightage Target Marks

Demonstration 0.75 75% of students will 20M
of Mini minimum score 70%
 Project marks

Report 0.25 75% of students will

minimum
score 70% marks
Indirect Weightage Target
Method
Course 1 75% of students
Exit strongly agree and
Survey agree

CSC303.6:
a. Direct Methods (80%): Mini Project + Report
CSC305.6dm = 0.75MiniProject+0.25Report
b. InDirect Methods(20%): Course exit survey
CSC305.6idm

CSC305.6 = 0.8* CSC305.6dm + 0.2* CSC305.6idm

Course Outcomes Target:

Able to implement Linear and Non-Linear data structures.

CSC303.1
Target level: 2.5
CSC Able to handle various operations like searching, insertion,
303.2
deletion and traversals on various data structures.
Target level: 2.5
CSC Able to explain various data structures, related terminologies and its
303.3
types.
Target level: 2.7
CSC Able to choose appropriate data structure and apply it to solve
303.4 problems in various domains.
Target level: 2.8
CSC Able to analyze and Implement appropriate searching techniques for
303.5 a given problem.
Target level: 2.8
CSC Able to demonstrate the ability to analyze, design, apply and use
303.6 data structures to solve engineering problems and evaluate their
solutions.
Target level: 2.8
 CO Attainment of previous years

Course 2021-22
Outcomes
CSC 305.1: Implement various linear data structures. 2.48

CSC 305.2: Implement various nonlinear data structures. 2.28

CSC 305.3 Implement appropriate searching techniques 2.28

for a given problem

CSC 305.4: Choose appropriate data 2.28

structure and apply it to solve problems in
various domains
CSC 305.5: Able to analyze and Implement appropriate 2.28
searching techniques for a given problem.

CSC 303.6: Able to demonstrate the ability to analyze, 2.28

design, apply and use data structures to solve
engineering problems and evaluate their solutions.
Rubrics for Lab Experiments:

Sr. No Performance Excellent Good Satisfactory Unsatisfactory

Indicator
1) Completeness Well Comparatively Inconsistent Improper
and correctness commented less use of comments formatting, No
[4] and comments, and comments.
formatted, Inconsistent formatting. Program
program formatting. Program functions
functions Program functions correctly for very
correctly for functions correctly for limited cases
all input correctly for most of the [1M]
cases. [4M] all input input
cases.[3M] cases.[2M]
2) Efficiency [3] The code Most of the Only Some The code lacks
could be code could be parts of the reusability. It is
reused as a reused in other code could be huge and
whole or programs. It is reused in other repeated at many
each routine fairly readable programs. The places[0M]
could be and easy to code is
reused. It is understand unnecessarily
readable and [2M] long and
easy to repeated. [1M]
understand
[3M]
3) Post Lab Answers to Answers to Answers of Answers to most
Questions [2] all questions most of the few questions of the questions
are correct questions are are incorrect are incorrect and
and correct but and lacks not explained in
explained in not explained sufficient depth.
depth. in much depth [0 mark]
[2M] depth. [0-1M]
[2-1.5M]
 4) Promptness The The The laboratory
laboratory laboratory report is
[1]
report is report is submitted in
submitted on submitted next practical
time next day. session.
[1 mark] [0.5 marks] [0 marks]

Rubrics for Assignments:

Performance Excellent Good Below average

Indicator
submitted on time or Submitted next day (1) Submitted in same
Timeline(2) early week
(2) (0.5)
Organization (2) Well organized, Organized to some Poorly
neat and clear extent, handwriting is organized(0.5)
handwriting, easy neat(1)
to read.(2)
Level of content (4) All points are Some important points Many important
covered and are omitted /addressed points are missing
answered accurately minimally (3) and the answers are
not accurate.
(4) (2)
Depth and Each point is Few points are not Many points are
breadth illustrated in depth illustrated in depth and not illustrated in
discussion (2) with proper have minimal depth and
justification
justification justification (1)
missing.(0.5)
wherever
required (2)
 Lesson Plan: DS
Semester III Year: 2021-22

Modes of Content Delivery:

I Class Room v Self Learning Online Ix Industry Visit

Teaching Resources
Ii Tutorial vi Slides X Group
Discussion
Iii Remedial vii Simulations/Demonstrations xi Seminar
Coaching
Iv Lab Experiment viii Expert Lecture xii Case Study

Sr. Planned Actual Topic Delivery Mechanisms

No. Date Date

1 25/7/2022 25/7/2022 Syllabus Discussion and Classroom teaching

Introduction to Data Structure

2 26/7/2022 26/7/2022 Introduction to Stack, queue, PPT presentation in classroom

linked list and tree

3 27/7/2022 27/7/2022 Introduction to Graph,Tree, PPT presentation in classroom

Introduction to Abstarct Data
Type, Stack ADT,

4 28/7/2022 28/7/2022 Pointers in C, passing array to Classroom teaching, Self

function, passing structure to learning online resources
function. Pointer to the array,
pointer to the structure, pointer to
the string

5 01/7/2022 01/8/2022 implementation of stack using Demonstration of program

array (without structure , with using CodeBlocks in
structure) classroom
6 02/08/2022 02/08/2022 Apllications of Data Structures: PPT presentation in classroom
Well form-ness of Parenthesis,
Recusrsion

7 04/08/2022 05/08/2022 Infix to Postfix conversion and Classroom teaching

I examples on it.

8 08/08/2022 05/08/2022 Implementation of Infix to Postfix PPT presentation in classroom

I

9 11/08/2022 8/8/2022 Algorithm and implementation of PPT presentation in classroom

Evaluation of postfix expression
with examples.

10 18/08/2022 8/8/2022 Queue-Introduction, Classroom teaching, Self

Representation using array and learning online resources
implementation of queue using
array.

11 22/08/2022 11/8/2022 Circular queue, implementation Demonstration of program

and applications of circular queue using CodeBlocks in
classroom

12 23/08/2022 18/8/2022 Double ended queue: Introduction, PPT presentation in classroom

applications, Algorithm of insert
and remove in Doble ended queue.

13 25/08/2022 22/08/2022 Implementation of Deque, Priority Classroom teaching

queue, applications of it.

14 29/08/2022 22/08/2022 Implementation of Deque, Priority PPT presentation in classroom

queue, applications of
it…..continued

15 30/08/2022 23/08/2022 Intoduction to Linked List, PPT presentation in classroom

Difference between static and
dynamic memory allocation.

16 06/09/2022 23/08/2022 Types of linked list, Singly, Classroom teaching, Self

Circular and Doubly Linke List. learning online resources
17 08/09/2022 25/08/2022 Linked List: Introduction, Demonstration of program
Create_node() function of linked using CodeBlocks in
list classroom

18 12/09/2022 25/08/2022 Insert_end and insert_begin in PPT presentation in classroom

linked list

19 13/09/2022 29/08/2022 insert_begin, insert_pos, Classroom teaching

remove_first node functions in
linked lkist

20 15/09/2022 30/08/2022 Remove a.last node, b. node at PPT presentation in classroom

specific position, c. split,
d.concatenate etc opertaions on
linked list

21 19/09/2022 08/09/2022 Revision of all previous operations PPT presentation in classroom

22 20/09/2022 12/09/2022 Concatenate, create_linked_list, Classroom teaching, Self

copy and reverse function on learning online resources
linked list

23 22/09/2022 13/09/2022 Operations on circular linked list Demonstration of program

using CodeBlocks in
classroom

24 26/09/2022 15/09/2022 Doubly Linked list and PPT presentation in classroom

implementation of all operations on
it.

25 27/09/2022 20/09/2022 Applications of linked list, Classroom teaching

introduction to Tree data structure,
basic terminologies in tree data
structure.

26 29/09/2022 22/09/2022 Binary tee representations, tree PPT presentation in classroom

traversal techniques

27 03/10/2022 26/09/2022 construction of binary tree from PPT presentation in classroom

given traversal sequences,
Definition of Binary search Tree,
 algorithm for insert and search
operation, Construction of BST.

28 04/10/2022 27/09/2022 Insert, Search operation in BST Classroom teaching, Self

learning online resources

29 06/10/2022 29/09/2022 Delete operation with all four Demonstration of program

cases, count leaf nodes, count non using CodeBlocks in
leaf nodes in BST, classroom

30 10/10/2022 03/10/2022 AVL Search Tree, Rotations like PPT presentation in classroom
Rotate left and rotate right, practice
problems on AVL

31 11/10/2022 04/10/2022 Huffman Encoding, B-Tree and B+ Classroom teaching

Tree, Graph: Introduction, Basic
terminologies, Graph
representations

32 13/10/2022 6/10/2022 Graph traversal algorithms with PPT presentation in classroom

examples, DFS and BFS,
Topological sort, applications of
graph, practice questions on
topological sort, DFS and BFS

33 17/10/2022 10/10/2022 Binary search and hashing: PPT presentation in classroom

introduction, collision resolution
techniques: separate chaining

34 18/10/2022 11/10/2022 Topological sort, applications of Classroom teaching, Self

graph, practice questions on learning online resources
topological sort, DFS and BFS

35 20/10/2022 13/10/2022 Binary search and hashing: Demonstration of program

introduction, collision resolution using CodeBlocks in
techniques: separate chaining classroom

36 24/10/2022 14/10/2022 Collision Resolution Technique, PPT presentation in classroom

Open Addressing: Linear Probing

37 25/10/2022 14/10/2022 Quadratic Probing, Double hashing Classroom teaching

38 27/10/2022 14/10/2022 B Tree and B+ Tree Revision PPT presentation in classroom

39 27/10/2022 14/10/2022 Discussion on 1. Previous years Online class in the evening
question papers, 2. how to write
answers in exam and students
query solving

40 31/10/2022 14/10/2022 Revision and Doubt solving Online class in the evening
session

Remedial classes

41 01/11/2022 24/11/2022 Revision, doubt solving and Classroom teaching using

discussion on topics given by black board
students.

42 03/11/2022 25/11/2022 Revision, doubt solving and Classroom teaching using

discussion on topics given by black board
students.

Subject: Data Structures Lab Credits-1

Course code: CSL303

Syllabus:

1) Array implementation of stack. *

2) Conversion of Infix to Postfix. *
3) Evaluation of Postfix expression.
4) Check continuity of different types of parenthesis using stack.
5) Array implementation of Queue.
6) Array implementation of Circular Queue *
7) Array implementation of Priority Queue.
8) Implementation of Singly linked list.*
9) Linked implementation of Stack.
10) Linked implementation of Queue.
11) Implementation of Circular Linked list.
12) Implementation of Doubly Linked list.
13) Implement Binary Search Tree. *
14) Implementation of Bubble Sort.
15) Implementation of Insertion Sort.
16) Implementation of Merge Sort.
17) Implementation of Quick Sort.*
18) Implementation of Binary Search.*
 20) Implementation of Hashing.
21) Implementation of Depth First Search and Breath First Search.
Term Work (25M): Lab Experiments (15M) +Assignment(5M)

List of Practicals and Lab Plan

Sub: Data Structures Year (2020-21)

Sr. Aim CO Weekly Plan

No Mapping
1. 1.1 Static implementation of Stack data structure CSC303.1 Third Week
1.2 Two Stacks in an Array
2. Application of Stack data structure: CSC303.1
2.1 Postfix expression Evaluation. Fourth Week
2.2 Infix to Reverse Polish Notation ( Infix to Postfix)
2.3 Infix to Polish Notation ( Infix to Prefix)
3. 3.1 Static Implementation of Linear Queue data structure CSC303.1 Fifth Week
3. 2 Static Implementation of Circular Queue
4. Linked List Implementation CSC303.1 Sixth Week
5. 5.1 Sparse Matrix Implementation using LL CSC303.1 Eighth Week
5.2 Polynomial Operations using LL
6. 6.1 Dynamic implementation of Stack CSC303.1 NinethWeek
6.2 Dynamic implementation of Queue
7. Implementation of Circular Linked List CSC303.1 TenthWeek
8. Implementation of Doubly Linked List CSC303.1 Tenth Week
 9. Implementation of Priority Queue CSC303.1 Tenth Week
10 Static implementation of Dequeue CSC303.1 TenthWeek
11 11.1 Implementation of BST( insertion, deletion, traversal) CSC303.2 Eleventh Week
11.2 Expression Tree
12 Graph Creation. BFS AND DFS Traversal CSC303.2 Eleventh Week
13 Searching Techniques CSC303.2 Twelth Week
13.1 Linear Search
13.2 Binary Search
14 Assignment 1 CSC303.2 Sixth week
CSC303.2
CSC303.2
15 Assignment 2 CSC303.2 Sixth week
CSC303.2
CSC303.2

Course Outcomes (given in syllabus):

Students will be able to:
1. Implement various linear and non linear data structures
2. Handle operations like insertion, deletion, searching and traversing on various data
structures.
3. select appropriate sorting technique for given problem.
4. select appropriate searching technique for given problem.
5. Apply the learned concepts in various domains like DBMS and Compiler construction.
6. Choose appropriate data structure for specified problem domain

Content beyond syllabus:

 Advanced Lists
 n-ary Tree
 Self-Balancing BSTs
 Trie
 Assignment 1

Sub: Data Structures

Class: SE
AI&DS
Assignment Date: 24 th September 2022
Date of submission: 30th October 2022
Course outcome:
CSC305.1: CO1: Implement various linear and non-linear data structures
CSC305.4: CO4: Choose appropriate data structure and apply it to solve problems
in various domains

Q. Question No. CO BL PI
No.
1 Implement a Stack data structure using two CSC303.1 3 1.4.1
instances of Queue and queue operations
allowed on the instances. Hint: newly entered
element is always at the front of ‘q1’, so that
pop operation just dequeues from ‘q1’. ‘q2’ is
used to put every new element at front of
‘q1’.
2 Write a program in C to implement addition CSC303.1 3 1.4.1
of two polynomials using linked list.
3 Write a C function for insertion of a node to CSC303.1 3 1.4.1
the immediate right of a key node in a doubly
linked list.
4 Write a C function for insertion of a node to CSC303.1 3 1.4.1
the immediate right of a key node in a doubly
linked list.
5 Write a C program to add values of the nodes CSC303.1 3 1.4.1
of a linked list, calculate the mean and display
the result.
6 Write a C program to implement Insert_Front CSC303.1 3 1.4.1
and Delete_Rear on Double Ended Queue
using array.
7 Explain following data structures, related CSC303.1 2 1.4.1
terminologies and its types. (Draw diagram,
Write definition and applications) Circular
queue Double ended queue Priority queue
Doubly linked list
8 Choose appropriate data structure that is best CSC303.4 5 2.1.3
suitable for solving following problems in
various domains.
1. Google maps uses this data structure for
building transportation systems and their
navigation system is based on the shortest
path algorithm between source and
destination.
2. Which data structure can be used to
simulate Facebook such that users and
relation between different users can be
represented?
3. In World Wide Web, web pages are stored
in data structure ‘X’. Also if there is a link of
page v on page u, this relationship is stored in
‘X’. It was the basic idea behind Google Page
Ranking Algorithm.
4. In Operating System, we come across
Resource Allocation. Relationships between
resources to the allocated process, or from
requesting process to the requested resource
are stored. If this leads to any formation of a
cycle then a deadlock will occur. Which data
structure is used to store this resource
allocation? CSC303.4 5 2.1.3
5. In computer science, which data structure
is used to represent networks of
communication?
6. Which data structure is used to store
hierarchical data, like folder structure,
organization structure, XML/HTML data?
7. Which data structure is used in many
search applications where data is constantly
entering/leaving?
 8. Which data structure is used in data
compression algorithms?
9. Which data structure is used to efficiently
store data in sorted form in order to access
and search stored elements quickly?
10. Pragya sells footballs. She has a large
container to store footballs which is closed
from below. Footballs are piled one on top of
the other in the box. When new balls are
supplied, Pragya puts the balls in the box
from the top. When a customer buys a ball,
she delivers the ball at the top of the pile to
the customer. Each ball has a code. She wants
to store the ball codes in a data structure to
keep track of her inventory. What data-
structure should she use

ASSIGNMENT NO. 2
DATA STRUCTURES YEAR
2022-2023 CLASS: S.E. AI&DS (semester III)
DATE: 12/10/2022 Deadline: 20/10/2022
 Fr. C.R.C.E. Bandra
Unit Test-I
DATA STRUCTURE (CSC303)
Class: S.E. (AI&DS) Time: 1.00pm- 2.00pm
Date: 6/09/2022 Total Marks: 20

CSC303.1: Implement various linear and non-linear Data Structures

CSC303.4: Choose appropriate data structure and apply it to solve problems in various
domains

Note: All assumptions need to state clearly.

 Fr. C.R.C.E. Bandra
Unit Test-II

Class: S.E. (AI&DS) Subject: Data Structure

Date 18/10/22 Time: 1.00Pm – 2.00Pm
CSC303.2: Implement various linear and Nonlinear data structures
CSC303.3: Implement appropriate searching technique for a given problem
Action Taken for weak students:
● Two remedial classes were conducted offline for weak students to teach the important topics and
solve their doubts.
Taken DSE students lectures from 21 st November 2022 and conducted unit tests