Course Description and Outcome Form

Department of Computer Science and Engineering

School of Engineering and Computer Science
Brac University

A. Course General Information:

Course Code: CSE 220

CSE 220L

Course Title: Data Structures

Data Structures Laboratory
Credit Hours (Theory+Lab): 3+0

Contact Hours (Theory+Lab): 3+3

Category: Program Core

Type: Required, Engineering , Lecture + laboratory

Prerequisites: CSE 111 Programming Language II

Co-requisites: NO

B. Course Catalog Description (Content):

This course is an introduction to data structures, where the students will study the elementary
data structures such as arrays, lists, stacks, queues, trees, graphs, etc. These data structures
will be used to study and implement different algorithms such as sorting, searching, tree
traversal, etc. The course includes a 3 hour mandatory laboratory per week as CSE220L. In the
laboratory, the students will use a standard programming language, usually Java, to implement
the various data structures and algorithms learned in the theory component of the course.

C. Course Objective:

a. Review linear arrays, exceptions and the various concepts of object oriented
programming such as inheritance, polymorphism, abstract class, interface etc.

b. Teach students the basics of circular array and advantage(s) of it over a linear array

c. Demonstrate the construction and manipulation of different types of linked lists

d. Introduce the students to stack and queue data structures and explain how they are
implemented

e. Discuss the fundamental concept of recursion so that they can build recursive models for
simple problems.

Department of CSE/SECS Course Description and Outcome Form Last Revision: Fall 2019 Page 1 of 7
 f. Introduce students to sorting and searching algorithms such as insertion sort, selection
sort, bubble sort, binary search, k-indexed sorting and searching, etc.

g. Discuss trees and graphs and explain related algorithms (e.g. tree or graph traversal)

Department of CSE/SECS Course Description and Outcome Form Last Revision: Fall 2019 Page 2 of 7
 D. Course Outcomes (COs):

Upon successful completion of this course, students will be able to

Sl. CO Description Weightage (%)
CO1 Show different operations such as insertion, removal, rotation, shifting, etc. on linear arrays, circular 25%
arrays, linked lists, Stack, Queue and Tree data structures.
CO2 Demonstrate basic algorithms related to sorting, searching, tree traversal and graph representation 25%
using various data structures.

CO3 Compare the suitability and merits of various data structures and basic algorithms when given certain 10%
requirements or constraints.

CO4 Apply concepts of recursion to solve programming problems 15%

CO5 Construct general purpose data structures and basic algorithms for solving programing problems 25%

E. Mapping of CO-PO-Taxonomy Domain & Level- Delivery-Assessment Tool:

Sl. CO Description POs Bloom’s Delivery methods Assessment

taxonomy and activities tools
domain/level
CO1 Show different operations such as insertion, removal, a Cognitive/ Apply Lecture + Lab Assignment,
rotation, shifting, etc. on linear arrays, circular arrays, Quiz, Exam, Lab
linked lists, Stack, Queue and Tree data structures. Work
CO2 Demonstrate basic algorithms related to sorting, a Cognitive/ Apply Lecture + Lab Assignment,
searching, tree traversal and graph representation using Quiz, Exam, Lab
various data structures. Work

CO3 Compare the suitability and merits of various data a Cognitive/Evaluate Lecture Exam
structures and basic algorithms when given certain
requirements or constraints.

Department of CSE/SECS Course Description and Outcome Form Last Revision: Fall 2019 Page 3 of 7
CO4 Apply concepts of recursion to solve programming a Cognitive/ Apply Lecture + Lab Assignment,
problems Quiz, Exam, Lab
Work
CO5 Construct general purpose data structures and basic c Cognitive/ Create Lab Lab work
algorithms for solving programing problems

Department of CSE/SECS Course Description and Outcome Form Last Revision: Fall 2019 Page 4 of 7
 F. Course Materials:

i. Text and Reference Books:

Sl. Title Author(s) Publication Edition Publisher ISBN

Year
1 Algorithms in Robert Sedgewick 2011 4th Addison-W ISBN-10: 032157351X
Java and Kevin Wayne Edition esley ISBN-13:
9780321573513
2 Introduction to Thomas H. Cormen, 2009 3rd MIT Press ISBN-10: 0262033844
Algorithms Charles E. Edition ISBN-13:
Leiserson, Ronald 9780262033848
L. Rivest and
Clifford Stein

G. Lesson Plan (Theory):

No Topic Week/Lecture# Related CO (if

any)
1 Arrays and Circular Arrays Lecture 1, 2, 3 CO1, CO3, CO5

2 Linked lists Lecture 4, 5, 6, 7, 8 CO1 CO3, CO5

3 Stacks (using arrays and linked lists) Lecture 9, 10 CO1 CO3, CO5

Review and Midterm Exam

4 Queues (using arrays and linked lists); Lecture 11, 12 CO1 CO3, CO5
Priority Queues

5 Elementary searching and sorting Lecture 13, 14, 15, 16 CO2 CO3, CO5
methods; key-indexed searching and
sorting; hashing

6 Recursion; Memoization Lecture 17, 18, 19 CO4, CO5

7 Introduction to Trees and BST Lecture 20, 21, 22 CO1, CO2, CO5

8 Introduction to Graphs Lecture 23, 24 CO2

Review and Final Exam

Lesson Plan (Laboratory):

No Topic Week/Lecture#
1 Linear array, Circular array Week 1

2 Singly Linked List (basic) Week 2

3 Singly Linked List (basic) Continuation Week 3

Department of CSE/SECS Course Description and Outcome Form Last Revision: Fall 2019 Page 5 of 7
 4 Dummy headed circular doubly linked list Week 4
5 Build a stack using List Week 5
Use the stack for parentheses checking
6 Build a queue using a circular array. Week 6
Apply the queue in a problem

7 Lab Midterm Assessment Week 7

8 Recursion Week 8
9 Searching, Sorting Week 9
10 Key-indexing, Hashing Week 10
11 Tree, graph Week 11

12 Lab Final Assessment Week 12

H. Assessment Tools:

Assessment Tools Weightage (%)

Class Participation & Attendance 5%

Quizzes 10-15%

Midterm Exam 20%

Assignment 5-10%

Lab 25%
Final Exam 30%

I. CO Assessment Plan:

Assessment Course Outcomes

Tools CO1 CO2 CO3 CO4 CO5
Assignments √ √ √

Quizzes √ √ √

Midterm Exam √ √ √

Lab √ √ √
Final Exam √ √ √ √

J. CO Attainment Policy:
As per BRAC University Policy.

Department of CSE/SECS Course Description and Outcome Form Last Revision: Fall 2019 Page 6 of 7
K. Grading policy:
As per BRAC University Policy

L. Course Coordinator: Ahanaf Hassan Rodoshi, Zaber Mohammad

Department of CSE/SECS Course Description and Outcome Form Last Revision: Fall 2019 Page 7 of 7