AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH

(AIUB)
Faculty of Science and Technology (FST)
Department of Computer Science (CS)
Undergraduate Program

COURSE PLAN SPRING 2020-2021 SEMESTER

I. Course Core and Title V. Vision:

Our vision is to be the preeminent Department of Computer
CSC 2106: Data Structure (Theory) Science through creating recognized professionals who will
provide innovative solutions by leveraging contemporary
II. Credit research methods and development techniques of computing
American International University-Bangladesh (AIUB)

that is in line with the national and global context.

3 credit hours (3 hours of theory per week) VI. Mission:
III. Nature The mission of the Department of Computer Science of AIUB
is to educate students in a student-centric dynamic learning
Core Course for CS, CSE, CSSE, SE, CIS environment; to provide advanced facilities for conducting
innovative research and development to meet the challenges of
IV. Prerequisite the modern era of computing, and to motivate them towards a
life-long learning process.
CSC 1103: Introduction to Programming Lab
CSC 1104: Introduction to Programming

VII - Course Description:

• Define what is data structure
• Recall C/C++ elementary coding techniques in the lab session
• Recall Basic Data Structures.
• Explain ADTs along with their advantages and disadvantages.
Details of array, stack, queue, linked list and trees and their applications
• Explain different types of algorithms to search and sort and manipulate data using such
data structure.
Sorting Algorithm: Selection Sort, Bubble Sort, Counting Sort
Searching Algorithm: Linear and Binary Search
• Demonstrate algorithms for efficient searching, insertion and deletion operation for every
data structure by computer programs.
• Explain Tree
Basic terminology (Node, Vertex, Leaf, Left subtree, Right subtree, Height, Depth, m-ary
tree), Binary tree, Binary tree representation, Binary tree traversal, Simulations.; Binary
search tree
• Explain Graphs
Definition and terminology, Representation techniques using 2D arrays and linked lists
• Explain Complexity Analysis (Space and Time)
Asymptotic Behavior, Worst-Case Analysis, Big-O Notation, Rules of Thumb

© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) 1

 VIII – Course outcomes (CO) Matrix:

By the end of this course, students should be able to:

Level of Domain* PO
C P A S Assessed**
CO1 Distinguish between the unique properties/features of different
2 2.1
data structures
CO2 Justify the selection of an appropriate data structure to find
5 2.2
the optimized solution for a given problem.
C: Cognitive; P: Psychomotor; A: Affective; S: Soft-skills (CT: Critical Thinking, TS: Teamwork)
*The numbers under the ‘Level of Domain’ columns represent the level of Bloom’s Taxonomy each CO corresponds to.
** The numbers under the ‘PO Assessed’ column represent the PO each CO corresponds to.
American International University-Bangladesh (AIUB)

IX – Topics to be covered in Theory class*:

Time Suggested Teaching CO

TOPICS Specific Objective(s)
Frame Activities Strategy(s) mapped
Elementary Discuss– CO1

1st two weeks and 1st theory class of 3rd week

data types and Class policy, course
data structures content, different data
types, introduction to data
Lecture,
structure.
Discussion, Student
Array, Pointer, Explain – Week 1
Group reporting,
Structure and ▪ Arrays, linear
study, question-
String searching, insertion
Justifying, answer
and deletion
session.
operations on array.
▪ Parallel and
Multidimensional
array Iteration
Continuation Discuss–
of ▪ Basic Pointer Lecture,
Array, Pointer, Discussion,
Arithmetic, pointer Week 2 Student
Group
Structure and – structure, pointer reporting,
study, CO1
String – array question-
Justifying,
answer
session

Stacks and its Explain –

applications ▪ ADT Data type
From 2nd class of 3rd week

and recursion Lecture,

▪ Stack operation Student
Week 3 Discussion,
[initialization, push, reporting,
&4 Group CO1,
pop, Isempty] Board
study, CO2,
▪ Implementation with Justifying,
work,
question- CO3,
array Perform CO4
Determine – exercises
answer
▪ Arithmetic Expression session.
conversion (Infix, Quiz
Postfix, Prefix) and
Expression evaluation
CSC 2106: DATA STRUCTURE 2
 To 4th week
Queue Explain – Group Student
▪ Linear queue study, reporting,
operation Week 4 Justifying, Board
[initialization, Perform work,
CO1,
enqueue, dequeue, exercises question-
CO2,
Isempty] answer
CO3
▪ Circular queue session.
Perform –
▪ Implementation
with array
Linear Sorting Explain – Discussion, Lecture, CO1,
and searching ▪ Bubble sort, Week Group Student CO3,
Insertion sort and 5 study, question- CO4
Selection sort Justifying, answer

From 1st class of 5th week to 1st class of 6th week

algorithms and Perform session.
Binary search exercises
algorithm
Perform –
▪ Applications of
Data Structures by
simulations.
Compare–
▪ Time Complexity
among all the
Sorting
Algorithms
Complexity Discuss– Week 5 Discussion,
Analysis ▪ Complexity Analysis Group Lecture,
(Space and Time) study, Student
▪ Time Complexity Justifying, reporting,
with respect to Array, Perform Board
Pointer and Structure exercises work, CO4
and for all the next question-
topics and make answer
comparison if session.
possible

Linked list Understand – Discussion, Lecture,

(Part-I) ▪ Dynamic storage Group Student
management Week 6 study, question- CO1,
▪ Singly Linked List Justifying, answer CO2,
▪ Insertion, Deletion Preparation, session. CO3,
and Search Perform CO4
Operation of exercises
Singly Linked List
Midterm Week
Week 7
Linked list Understand – Lecture,
(Part-II) ▪ Doubly Linked List Student
Discussion, CO1,
▪ Insertion, Deletion reporting,
Week 8 Group CO2,
and Search question-
study, CO3,
Operation of answer
Justifying, CO4
Doubly Linked List session.
Perform
▪ Implement stack
exercises
© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) 3
 and queue using
linked list
Tree Understand– Lecture, CO1
▪ Basic terminology Week 8 Discussion, Board work,
▪ Binary, complete, full &9 Justifying, question-
and balanced tree, Perform answer
▪ Tree traversal- exercises session.
inorder, preorder,
postorder

Binary search Understand – Discussion, Lecture, CO1,

tree ▪ Construction of binary Group Student CO2,
Week
search tree, Searching, study, reporting, CO3,
9 &10
Insertion and Deletion Justifying, CO4
operation with Perform
simulations. exercises
Heap Explain – Week CO1,
▪ Heap properties 11 Group Lecture, CO2,
(Priority ▪ heapify function. study, Student CO3
QUEUE) ▪ Creation of Max- Justifying, reporting,
heap and Min-heap Perform question-
using heapify exercises, answer
function Quiz session.
▪ Insertion and
Deletion operations
▪ Heap sort
algorithm

Graphs Understand – CO1,

▪ Basic terminology CO2,
▪ Representation: Lecture, CO3
adjacency matrix Student
& List reporting,
Discussion,
▪ Spanning tree question-
Week Group
▪ Traversing answer
12 study,
method (BFS session.
Justifying,
and DFS)
Perform
exercises
Hash Function Understand – Week
▪ Hash Function 13
Lecture,
Student
Discussion, reporting,
Group question-
study, answer
Justifying, session.
Perform
exercises

CSC 2106: DATA STRUCTURE 4

American International University-
Exercises Apply Week Perform questi
▪ Appropriate data 13 exercises on-
Structures based on answer
Real Life scenarios session,
Quiz
Compare
▪ Time Complexity if
applicable for all the CO4
previous lectures

Final term Week

Week 14

* The faculty reserves the right to change, amend, add or delete any of the content s.

XI- Course Requirements

At least 80% class attendance is necessary to sit for the exam. If there is any assignment given to the
students, they have to submit it before the deadline decided by the course teacher.

.
XII – Evaluation & Grading System
. following grading system will be strictly followed in this class
The
Marking system for Theory Classes
(Midterm and Final term)
Quiz/viva/MCQ 30%
Attendance 10%
Assignment & Miscellaneous 20%
Performance (Capacity
building/conceptual strength/ problem
solving capacity /subject
terminologies/ rigorous Lit. rev.):
Midterm/Final term components 40%
Total 100%

Final Grade/ Grand Total

Midterm: 40%
Grand Total - - - - - - - -40% of Midterm + 60% of Final Term
Final Term: 60%
The evaluation system will be strictly followed as par the AIUB grading policy.

© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) 5

American International University-Bangladesh (AIUB)

Letter Grade Point Numerical %

A+ 4.00 90-100
A 3.75 85-90
B+ 3.50 80-85
B 3.25 75-80
C+ 3.00 70-75
C 2.75 65-70
D+ 2.50 60-65
D 2.25 50-60
F 0.00 <50(Failed)
XIII – Teaching Methods

Maximum topics will be covered from the textbook. For the rest of the topics, reference books will be
followed. Some Class notes will be uploaded on the web. White board will be used for most of the time. For
some cases, multimedia projector will be used for the convenience of the students. Students must study up to
the last lecture before coming to the class and it is suggested that they should go through the relevant chapter
before coming to the class. Just being present in the class is not enough- students must participate in
classroom discussions.

XIV – Textbook/ References

1) Introduction to Algorithms (Second Edition), Thomas H. Cormen, Charles E. Leiserson, Ronald

L. Rivest, and Cliff Stein, published by MIT Press and McGraw-Hill.
2) Fundamentals of Computer Algorithms, Ellis Horowitz, Sartaz Sahni, and Rajasekaran,
Published by W.H. Freeman and Company, 1998. Indian Edition published by Galgotia
Publications, 2000.
3) Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, 3rd
Edition,Robert Sedgewick, Published by Addison Wesley Professional.
4) Data Structures and Program Design In C (2nd Edition), Robert L. Kruse, Bruce P. Leung,
Clovis L. Tondo.
5) Data Structures, Seymour Lipschutz, Schaum Ouline Series.

CSC 2106: DATA STRUCTURE 6

XV - List of Faculties Teaching the Course

• Md. Manzurul Hasan

• Md. Mazid-Ul-Haque
• Nazia Alfaz
• Dr. S.M. Hasan Mahmud

XVI – Verification:

Prepared by :

---------------------------------
Md. Manzurul Hasan
Course Convener

Date: 20.01.2021

Checked by: Certified by: Approved by:

.................................................... ...................................................... .................................................

... ........
Dr. Md. Mahbub Chowdhury Mishu Dr. Dip Nandi Mr. Mashiour Rahman
Head, Director, Associate Dean,
Department of Computer Science Faculty of Science & Technology Faculty of Science &
Technology

Date:.......................................... Date:............................................ Date:.......................................

© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) 7