Year:2023-24

Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

COURSE PLAN
Target 50% (Marks)
Level-1 40% (Population)
Level-2 40% (Population)
Level-3 50% (Population)

1. Method of Evaluation

UG Weightage (%)
CP-1-Understanding of Concepts (35%) 35
(Performance Test +Viva)

 Demonstrated through performance in written

examinations and Viva.

CP-2- Practical Application (30%) 30

 Assessed through programming assignments,

lab assessments,

CP-3-Problem-Solving Skills (35%) (Performance 35

Test +Viva)

 Evaluated through problem-solving

assessments, the final examination, and Viva

2. Passing Criteria

Scale UG

Out of 10 Point Scale SGPA – “5.0” in Each Semester

CGPA – “5.0”
Min. Individual Course Grade – “C”
Course Grade Point – “4.0”

*for UG, passing marks are 35/100 in a paper

3. Pedagogy
 Face to Face (Context-Based Learning)
 Online lectures(Adaptive Teaching)
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

 Class Test
 Video Lectures
 Presentation
 Concept Dairy (Student maintain the record of content which they understood from the
sessions)

4. References:
Text Books Web resources Journal Reference
s books
1. S. Lipschutz, "Data https://ocw.mit.edu/courses/civil-and-environmental- 1. A. V. Aho, J.
Structures with C", engineering/1-204-computer-algorithms-in-systems- E. Hopcroft, and
Schaum's Outline engineering-spring-2010/lecture-notes/ J. D. Ullman,
"Data Structures
Series, McGraw-Hill MIT1_204S10_lec05.pdf
and Algorithms",
Education (India) New Delhi:
Pvt. Limited, 2017. https://cse.iitkgp.ac.in/~pb/algo1-pb-101031.pdf
Pearson
https://www.cs.cmu.edu/~rjsimmon/15122-s16/lec/
Education, 2003.
2. Y. P. Kanetkar, "Data 10-linkedlist.pdf
structures through 2. E. Horowitz,
C", 4rd Edition, New https://cse.iitrpr.ac.in/ckn/courses/f2015/csl201/ and S. Sahni,
Delhi: BPB, 2022. w1.pdf "Fundamentals
of Data
Structures in C",
2nd Edition,
Hyderabad:
University Press,
2008.

GUIDELINES TO STUDY THE SUBJECT

Instructions to Students:

1. Go through the 'Syllabus' in the LMS section of the web-site (https://myupes-beta.upes.ac.in) in

order to find out the Reading List.
2. Get your schedule and try to pace your studies as close to the timeline as possible.
3. Get your on-line lecture notes (Content, videos) at Lecture Notes section. These are our lecture
notes. Make sure you use them during this course.
4. Check your LMS regularly
5. Go through study material
6. Check mails and announcements on LMS
7. Keep updated with the posts, assignments and examinations which shall be conducted on the LMS
8. Be regular, so that you do not suffer in any way
9. Cell Phones and other Electronic Communication Devices: Cell phones and other electronic
communication devices (such as Blackberries/Laptops) are not permitted in classes during Tests or
the Mid/Final Examination. Such devices MUST be turned off in the class room.
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

10. e-Mail and online learning tool: Each student in the class should have an e-mail id and a pass
word to access the LMS system regularly. Regularly, important information – Date of conducting
class tests, guest lectures, via online learning tool. The best way to arrange meetings with us or ask
specific questions is by email and prior appointment. All the assignments preferably should be
uploaded on online learning tool. Various research papers/reference material will be
mailed/uploaded on online learning platform time to time.
11. Attendance: Students are required to have minimum attendance of 75% in each subject. Students
with less than said percentage shall NOT be allowed to appear in the end semester examination.

This much should be enough to get you organized and on your way to having a great semester! If you need
us for anything, send your feedback through e-mail to your concerned faculty. Please use an appropriate
subject line to indicate your message details.

There will no doubt be many more activities in the coming weeks. So, to keep up to date with all the latest
developments, please keep visiting this website regularly.
RELATED OUTCOMES
1. The expected outcomes of the Program are:

PO1 Engineering Knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.
PO2 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.
PO3 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 the public health and safety, and the cultural, societal, and
environmental considerations.
PO4 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.
PO5 Modern Tool Usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
PO6 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.
PO7 Environment and Sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and
need for sustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
PO9 Individual and Team-work: Function effectively as an individual, and as a member or
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

leader in diverse teams, and in multidisciplinary settings.

PO10 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.
PO11 Project Management and Finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.
PO12 Life-long Learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.

2. The expected outcomes of the Specific Program are: (upto3)

3. The expected outcomes of the Course are: (minimum 3 and maximum 6)

State the significance and properties of the fundamental data structures.

CO 1
Implement common data structures while ensuring proper memory management and error handling.
CO 2
Illustrate expertise in understanding the common sorting and searching techniques with their
CO 3 complexities and implement them.

Analyse real-world problems by understanding the trade-offs involved in identifying the

appropriate data structure(s) based on problem requirements and using them to solve the problems
CO 4 efficiently.

4. Co-Relationship Matrix
Indicate the relationships by1- Slight (low) 2- Moderate (Medium) 3-Substantial (high)

Program
PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
PO4
Outcome 1 2 3 5 6 7 8 9 0 1 2 1 2 3
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

s
Course
Outcome
s
CO 1 1 2 1 1
CO 2 1 1 2 1
CO 3 1 1 2 1 2
CO 4 1 2 2 2 2
1.2
Average 1 1 2
5
1.25

5. Course outcomes assessment plan:

components

Course CP-1 CP-2 CP-3 Any other

Outcomes

CO 1 √ √ √ 
CO 2 √ √ √ 
CO 3 √ √ √ 
CO 4 √ √ √ 

BROAD PLAN OF COURSE COVERAGE

 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

Course Activities:

S. Planned
Description Remarks
No. From To No. of Sessions

1. Unit I: INTRODUCTION 12 Lecture Hours

2. Unit II: LINKED LIST 10 Lecture Hours

3. Unit III: STACK & QUEUE 10 Lecture Hours

4. Unit IV: TREE 10 Lecture Hours

5. Unit V: HASH TABLE & GRAPH 10 Lecture Hours

6. Unit VI: SORTING & SEARCHING 8 Lecture Hours

Total Session 60
Sessions: Total No. of Instructional periods available for the course, (Asynchronous sessions are
highlighted detailed course plan)

SESSION PLAN
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

UNIT-I
CO
Lect Map
ure Topics to be Covered ped

Overview, classification, and Importance of data structures in

1. Programming/problem-solving, 1

Basic terminology, and concepts: elements, operations, storage, memory allocation,

2 garbage collection, and compaction. 1

Iterative & Recursive approaches. Basic analysis of algorithms: Amortized analysis

3 and Asymptotic Analysis. 1

Array: Memory representation (1D and 2D), Array operations: insertion, deletion,
4 searching. 1

5 Structure: Nested Structure, Function pointer as member of a structure,

1

6 Self-referential structure. Anonymous Unions, ADTs.

1

SESSION PLAN
UNIT-II
CO
Lectur Mappe
e No. Topics to be Covered d
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

7 Singly-Linked List, Doubly-Linked List, its operations.

8 Circular Linked List, Header List, and its operations.

9 Sentinel node. Generalized Linked List. Skip List.

Applications of Linked Lists: polynomial manipulation, implementation of other

10 data structures.
2

SESSION PLAN
UNIT-III
CO
Lectur Mappe
e No. Topics to be Covered d

11 Stack data structure and operations.

12 Queue data structure and operations.

13 Implementation of Stack and Queue using Array and Linked List.

14 Circular Queue. Deque and its types. Priority Queue. Applications:

2
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

Stacks (Conversion of Infix to Prefix/Postfix, Expression evaluation, a note on DFS

15
in graph),
2

16 Queues (Job scheduling, a note on BFS in graph).

2

17 Mid Term Evaluation

SESSION PLAN
UNIT-IV
CO
Lectur Mappe
e No. Topics to be Covered d

18 Introduction to Tree data structure and its terminologies, Binary Tree: properties
4
traversal algorithms (level-order, in-order, pre-order, post-order). Threaded Binary
19 Tree.
4

20 Binary Search Trees (BST): properties, operations (insertion, deletion, searching).

4

21 Balanced BSTs. AVL Tree: properties, rotations, operations (insertion, deletion).

4

22 Red-Black Tree. Multi-way search Tree: properties

4

23 B-Tree: properties, operations (search, insertion, and deletion).

4
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

24 Applications of AVL Tree and B-Tree.

4
Binary Heaps: properties, heapify operations, Heap sorting.
25
4

SESSION PLAN
UNIT-V
Lect CO
ure Map
No. Topics to be Covered ped
Hashing and hash functions. Hash table data structure: structure, collisions, collision
26 resolution techniques, maintaining load factor.
4

27 Applications of hash tables: dictionaries, symbol tables.

4
Introduction to graph data structure and its terminologies. Graph representations:
28 adjacency matrix, adjacency list.
4

29 Graph traversal algorithms: depth-first search, breadth-first search (BFS).

4
Connected Components. Minimum spanning tree. Shortest path.
30
4

SESSION PLAN
UNIT-VI
Lect CO
ure Map
No. Topics to be Covered ped

31 Stability and In-place properties, Internal and external sorting

3
 Year:2023-24
Semester: II

1. Name of the Faculty: Amrendra Tripathi Course Code:

2. Course : Data Structures and Algorithms L: 4
3. Program : B.Tech (CSE-All Branches) ,B.C.A and B.Sc T: 0
4. Target : 60% P: 0
C: 4

Simple comparison-based sorting algorithms: bubble sort, selection sort, insertion sort.
32
3

33 Lower bound for comparison-based sorting algorithms.

3
Recursive implementation of merge sort, quicksort, and binary search. Complexities of
34& common sorting and searching algorithms.
35
3

36 End term Evaluation