Course Outline

Part A
1. Course No./Course Code: CSE 211
2. Course Title: Data Structures & Algorithms I
3. Course Type (GED/Core Course/Electives): Core Course
4. Year/Level/Semester/Term: 2nd Year, 1st Semester
5. Academic Session: Spring 2024
6. Course Teacher/Instructor: A. S. M. Shafi (ASM)
7. Prerequisite (If any): None
8. Credit Value: 3.0
9. Contact Hours: 3 hours/week
10. Total Marks: 100
11. Rationale of the Course:
This course introduces the structured way of handling data so that a complex problem can be solved in an efficient
way. Students will learn to use and link data structures. Also, will know something of all of these (sorting and
searching, categorized efficiency in time and memory use, linked list and tree data structures, hash tables, stacks
and queues) by the end of the course.
12. Course Objectives:
a) To introduce the structured way of handling data so that a complex problem can be solved in an efficient
way.
b) To use and design linked data structures.
c) To know something of all of these (sorting and searching, categorized efficiency in time and memory use,
linked list and tree data structures, hash tables, stacks and queues) by the end of the course.
d) To be familiar enough with the concepts that they should take any of them further and make use of them.
13. Course Learning Outcomes (CLOs) and Mapping of CLOs with Program Learning Outcomes (PLOs)
a. Program Learning Outcomes (PLOs)
PLO 1: Apply knowledge of mathematics, natural science, engineering fundamentals and
Engineering an engineering specialization to the solution of complex engineering problems.
Knowledge

PLO 2: Identify, formulate, research literature and analyze complex engineering problems
Problem analysis reaching substantiated conclusions using first principles of mathematics, natural
sciences and engineering sciences.

PLO 3: Design solutions for complex engineering problems and design systems,
Design/development components or processes that meet specified needs with appropriate consideration
of solutions for public health and safety, cultural, societal, and environmental considerations.

PLO 4: Conduct investigations of complex problems using research-based knowledge and

Investigation research methods including design of experiments, analysis and interpretation of
data, and synthesis of information to provide valid conclusions.

PLO 5: Create, select and apply appropriate techniques, resources and modern engineering
Modern tool usage and IT tools, including prediction and modeling, to complex engineering activities
with an understanding of their limitations.

PLO 6: Apply reasoning informed by contextual knowledge to assess societal, health,

The engineer and safety, legal and cultural issues and the consequent responsibilities relevant to
society professional engineering practice and solutions to complex engineering problems.

PLO 7: Understand and evaluate the sustainability and impact of professional engineering
Environment and work in the solution of complex engineering problems in societal and
sustainability environmental contexts.
 PLO 8: Apply ethical principles and commit to professional ethics and responsibilities and
Ethics norms of engineering practice.

PLO 9: Function effectively as an individual, and as a member or leader in diverse teams

Individual work and and in multi-disciplinary settings.
teamwork

PLO 10: Communicate effectively on complex engineering activities with the engineering
Communication 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.

PLO 11: Demonstrate knowledge and understanding of engineering management principles

Project management and economic decision-making and apply these to one’s own work, as a member
and finance and leader in a team, to manage projects and in multidisciplinary environments.

PLO 12: Recognize the need for, and have the preparation and ability to engage in
Life-long learning independent and life-long learning in the broadest context of technological change.

b. Course Learning Outcome (CLOs) details in table

CLO1 Explain the concept of array, stack, queue, linked list, trees and graph.

CLO2 Design data structures for various computing applications.

CLO3 Analyze computing problems and find appropriate solutions using data structure.

CLO4 Design algorithms using efficient data structure.

c. Mapping of CLOs with Program Learning Outcomes (PLOs)

Course
Learning
Program Learning Outcomes (PLOs)
Outcomes
(CLOs)

1 2 3 4 5 6 7 8 9 10 11 12

CLO1 ✓

CLO2 ✓

CLO3 ✓

CLO4 ✓

Part B
14. Course plan specifying content, CLOs, co-curricular activities (if any), teaching learning and assessment
strategy mapped with CLOs.

Week Topic Teaching-

Assessment Corresponding
Learning
Strategy CLOs
Strategy

Data Structure, Classification of data Lecture,

1 Midterm CLO1
structure, Operations on data structure, Group
 Algorithm and Program; Complexity of an Discussion
algorithm: Time complexity, Space
complexity, Time space tradeoff,
Mathematical notation and function

Importance of data structure; Advantages

and disadvantages of various data structure;
Lecture,
Mathematical Notations and Functions;
2 Group Midterm CLO1
Algorithmic Notations; Control Structures:
Discussion
Sequence logic, Selection logic, Iterative
logic.

Asymptotic Notations: Omega, Big O and

Theta; Linear Array: definition, graphical
representation, C/C++ representation, storing Lecture,
3 and retrieving data into/from linear array; Group Midterm CLO 1, CLO2
Algorithm to search the largest element of a Discussion
list, algorithm to search a particular element
from a list.

Algorithm on Linear Array: Algorithm to

find the summation of even and odd
numbers, Algorithm to find the summation of
even and odd indexed numbers, algorithm to Lecture,
4 insert an element into an array, algorithm to Group Midterm CLO1, CLO2
delete an element from an array; Two- Discussion
Dimensional Array: definition, graphical
representation, C/C++ representation and
memory representation.

Two-Dimensional Array: location of an

Lecture,
element of a two-dimensional array, Midterm,
5 Group CLO1, CLO2
algorithm to find out the summation of Class test 1
Discussion
boundary elements and diagonal elements.

Linked List: definition, types; Linear

Linked List: definition, algorithm to create
a linked list; Algorithm on Linear Linked
List: algorithm to search a node from a Lecture,
6 linked list, algorithm to insert a node into a Group Final Exam CLO1, CLO2
linked list, algorithm to delete a particular Discussion
node from a linked list, differences between
array and linked list. Doubly and Circular
Linked List

Stack: definition, array and linked-based

stack, PUSH and POP operation;
Applications of Stack: checking the validity
of an arithmetic expression, converting an
infix arithmetic expression to its postfix Lecture, Final Exam,
CLO1, CLO3,
7 expression, evaluating a postfix expression; Group Class test 2,
CLO4
Tower of Hanoi problem; Queue: Discussion Assignment
definition, array and linked-based queue,
algorithm to add an element to queue,
algorithm to delete an element from a queue;
Priority Queue.

Implementation of stack using queue and Lecture,

8 implementation of queue using stack; Group Final Exam CLO1, CLO4
Searching: definition, linear and binary Discussion
 search; Sorting: definition, selection and
insertion sort.

Sorting: bubble sort, merge sort and quick Lecture,

9 sort Group Final Exam CLO4
Discussion

Hashing: introduction, Hash function,

Methods of hashing: division, mid-square, Lecture, Final Exam,
10 folding, Hash collision resolution scheme: Group Class test 3, CLO3, CLO4
linear and quadratic probing, random and Discussion Assignment
double hashing, rehashing, chaining

Tree: definition, binary tree, tree

implementation, full and complete binary Lecture,
11 tree, parent child relationships; Tree Group Final Exam CLO1, CLO4
Traversal Techniques: Pre-order, In-order Discussion
and Post order.

BST: definition, creation procedures; Heap: Lecture,

12 definition, types, creation procedures; Group Final Exam CLO3, CLO4
Huffman coding Discussion

Graph: Basics of graph, adjacency matrix Lecture,

13 and list of a graph; Graph Traversal Group Final Exam CLO1, CLO4
Methods: BFS and DFS Discussion

Minimum Cost Spanning Tree: Spanning

subgraph, spanning tree, minimum cost Lecture,
Final Exam,
14 spanning tree, Prim’s and Kruskal’s Group CLO3, CLO4
Assignment
algorithm, differences between tree and Discussion
graph.

Part C
15. Assessment and Evaluation
1) Assessment Strategy: Class Test, Assignment, Midterm, Final Term
2) Marks Distribution:
a) Assessment:
I. Attendance - 10
II. Class test 1/Assignment 1 - 10
III. Class test 2/Assignment 2 - 10
b) Summative:
I. Midterm - 20
II. Final term - 50
Grading System (Letter Grading)
The UGC-approved common grading system is adopted for assigning a letter grade and grade point. This is
given in the following table:
Numerical Grade Letter Grade Grade Point

80% and above A+ 4.00

75% to less than 80% A 3.75

70% to less than 75% A- 3.50

65% to less than 70% B+ 3.25

60% to less than 65% B 3.00

 55% to less than 60% B- 2.75

50% to less than 55% C+ 2.50

45% to less than 50% C 2.25

40% to less than 45% D 2.00

Less than 40% F 0.00

F* Failure
I** Incomplete
W*** Withdrawal

* “F” means failure. Credits for courses with this grade do not apply toward graduation.
** “I” is given to students who have fulfilled the majority of the course requirements but have
been unable to complete the rest. The student is not required to register for the course in the
next semester.
*** “W” means withdrawal. A student may decide to withdraw from a course by the deadline
with the consent of the instructor and the academic advisor.
3) Make-up Procedures: N/A

Part D
16. Learning Materials
1) Recommended Readings:
a) Schaum’s Outline of Theory and Problems of Data Structures, Latest Edition,
Seymour Lipschutz.
2) Supplementary Readings:
a) Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Third
Edition, Addison Wesley.
b) Data Structure Fundamentals-Md. Rafiqul Islam, M. A. Mottalib
3) Others (as applicable for the discipline academic program): Provided materials in
google classroom.