CSC 2107 DATA STRUCTURE LAB

AMERICAN INTERNATIONAL UNIVERSITY-

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

COURSE PLAN SEMESTER: SUMMER 2024-2025

I. Course Core and Title V. Vision:
CSC 2107 Data Structure (Lab) Our vision is to be the preeminent Department of
Computer Science through creating recognized
II. Credit professionals who will provide innovative solutions by
1 credit hour (3 hours of lab per week) leveraging contemporary research methods and
development techniques of computing that is in line with
III. Nature the national and global context.
Core Course for CS, DS, CNCS
VI. Mission:
IV. Prerequisite The mission of the Department of Computer Science of
CSC 1204: Discrete Mathematics AIUB is to educate students in a student-centric dynamic
CSC 1205: Object Oriented Programming 1 learning environment; to provide advanced facilities for
conducting innovative research and development to meet
the challenges of the modern era of computing, and to
motivate them towards a life-long learning process.

VII - Course Description

• Understand what data structure is.

• Recall C/C++ elementary coding techniques in the lab session
• Recall Basic Data Structures.
• Solve simple to complex real-life problems by applying basic data structures.
• Use of array, structure, and pointers.
• Apply different types of algorithms to search and sort and manipulate data using such data structure. Sorting
Algorithm: Selection Sort, Bubble Sort, Insertion Sort
• Searching Algorithm: Linear and Binary Search
• Apply algorithms for efficient searching, insertion, and deletion operation for every data structure by
computer programs.
• Implement Stack and Queue and solve problems related to them applying proper techniques.
• Use Linked List to solve problems.
• Basic concept of Node, creating a singly, doubly, circular linked list. Insertion and deletion operation on
linked list.
• Use concepts of Graph to solve searching and optimizing problems.
• BFS, DFS, Prim’s algorithm and Kruskal’s algorithm
• Use concepts of Tree to solve searching problems.
• Construct BST, Search, Insert and Delete node from BST.

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

CSC 2107 DATA STRUCTURE LAB

VIII – Course outcomes (CO) Matrix

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

Domain PO
COs * Description Level *** Assessed
C P A ****
Apply concepts of basic data structures to solve simple arithmetic
CO1 3 PO-a-4
problems.
CO2
Solve real-life problems using advanced concepts of data structure. 3 PO-a-4
**
Determine approaches required to solve complex problems based on
CO3 3 PO-e-1
specific requirements.
CO4 Use determined approaches in solving complex real-life problems with
3 PO-e-1
** specific requirements.

C: Cognitive; P: Psychomotor; A: Affective Domain

* CO assessment method and rubric of COs assessment is provided in later section
** COs will be mapped with the Program Outcomes (POs) for PO attainment
*** The numbers under the ‘Level of Domain’ columns represent the level of Bloom’s Taxonomy each
CO corresponds to.
**** The numbers under ‘PO Assessed’ column represent the POs each CO corresponds to.

IX – Topics to be covered in the class*

Time CO Teaching Assessment

Frame Mapped Topics Activities Strategy(s)
CO1, OBE, Mission & Vision of AIUB, Implementation Lecture, Question-
Week 1 CO2 of basic programming problems with loop, answer, Lab Practice Lab Tasks
CO1, Array and function Implementation of 1D & 2D Lecture, Question-
Week 2 CO2 array, String, operations and its applications answer, Lab Practice Lab Tasks
CO2, Lecture, Question-
Week 3 CO3 Searching, Sorting answer, Lab Practice Lab Tasks
Week 4 CO2 Lab Exam Lab Exam Lab Exam
Mid-Term (Week 5)
CO2, Lecture, Question-
Week 6 CO3 Pointer, Structure answer, Lab Practice Lab Tasks
CO2, Implementation of Singly and Doubly Lecture, Question-
Week 7 CO3 Linked List. answer, Lab Practice Lab Tasks
CO3, Lecture, Question-
Week 8 CO4 Implementation of Stack and Queue answer, Lab Practice Lab Tasks
CO3, Lecture, Question-
Week 9 CO4 Applications of Stack and Queue answer, Lab Practice Lab Tasks
CO3,
Week 10 CO4 Lab Exam Lab Exam Lab Exam
Final-Term (Week 11)
* The faculty reserves the right to change, amend, add, or delete any of the contents.

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

CSC 2107 DATA STRUCTURE LAB

X – Mapping of PO/PLO and K, P, A of this course:

PO Indicator PO Indicators Definition

Domain K P A
ID (As per the requirement of WKs)
Apply information and concepts in specialized engineering P1
Cognitive Level 3
PO-a-4 sciences with the in-depth of analysis of a complex computer K4 P3
(Applying)
science and engineering problem. P7
Select modern engineering and IT tools and apply appropriate P1
Cognitive Level 3
PO-e-1 techniques to solve complex computer science and K6 P4
(Applying)
engineering problems considering the limitations. P5

XI – K, P, A Definitions

Indicator Title Description

Forefront specialist Engineering specialist knowledge that provides theoretical frameworks and
K4 knowledge for practice bodies of knowledge for the accepted practice areas in the engineering
discipline; much is at the forefront of the discipline
Engineering Practice Knowledge of engineering practice (technology) in the practice areas in the
K6
(Technology) engineering discipline
Cannot be resolved without in-depth engineering knowledge at the level of one
Depth of knowledge
P1 or more of K3, K4, K5, K6 or K8 which allows a fundamentals-based, first
required
principles analytical approach
P3 Have no obvious solution and require abstract thinking, originality in analysis
Depth of analysis required to formulate suitable models
P4 Familiarity of issues Involve infrequently encountered issues
P5 Extent of applicable Are outside problems encompassed by standards and codes of practice
codes for professional engineering
P7 Interdependence Are high level problems including many component parts or sub-problems

XII – Mapping of CO Assessment Method and Rubric

The mapping between Course Outcome(s) (COs) and The Selected Assessment method(s) and the mapping between
Assessment method(s) and Evaluation Rubric(s) is shown below:

Mapped Assessment Assessment

COs Description
POs Method Rubric
CO1 Apply concepts of basic data structures to solve simple PO-a-4 Lab Tasks Rubric for Task
arithmetic problems.
Solve real-life problems using advanced concepts of data
CO2 structure. PO-a-4 Lab Tasks Rubric for Task
Determine approaches required to solve complex
CO3 problems based on specific requirements. PO-a-4 Lab Tasks Rubric for Task
Use determined approaches in solving complex real-life
CO4 v problems with specific requirements. PO-a-4 Lab Tasks Rubric for Task

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

CSC 2107 DATA STRUCTURE LAB

XIII – Evaluation and Assessment Criteria

CO1 [PO-a-4] Apply concepts of basic data structures to solve simple arithmetic problems.

Assessment Missing/Incorrect Inadequate Satisfactory Excellent

Attribute/Criteria (0) (1-2) (3-4) (5)
No knowledge and Limited Having Adequate, clear, Demonstrates a deep
no proper use of understanding well-structured understanding of various
data structure or the and knowledge about basic data structures as well as
way of using data knowledge of data structure and their provides clear explanations
Knowledge and structure is data structure uses of the purpose,
proper use of incorrect. with characteristics, and
Data Structure significant operations associated with
errors each data structure.

No Solution using Solution Solution having Adequate Demonstrates outstanding

data structure or demonstrates understanding and meets understanding and
solution process is significant basic requirements but application of data
Solution
incorrect. errors and may lack depth or structures with exemplary
lack of optimization in certain efficiency and
efficiency. aspects. optimization.

CO2 [PO-a-4] Apply the proper data structures to solve simple to complex problems.

Assessment Missing/Incorrect Inadequate Satisfactory Excellent

Attribute/Criteria (0) (1-2) (3-4) (5)
Knowledge of data Limited Adequately applies
Demonstrates a deep
structure is not understanding advanced data understanding of the
clear, not well about the real-life structures to solve
real-life problem.
organized and no problem and way real-life problems
Analyzes the problem
Knowledge and use of proper data to use proper data but may lack depth
requirements and
proper use of Data structure regarding structure to solve or optimization in
constraints
Structure complex problem. real life problems certain aspects. effectively,
can have considering relevant
significant errors. factors for selecting
appropriate data
structures
Demonstrates
Shows limited Adequately analyzes exceptional ability in
understanding or the problem with problem analysis,
analysis of the some gaps in with a comprehensive
problem, lacks understanding or understanding of the
depth in depth, identifies problem, insightful
Fails to understand identifying relevant data structure identification of data
real life problem relevant data concepts, and offers structure concepts,
and approach to structure reasonable thorough analysis of
Problem Analysis the solution concepts recommendations complexity
Fails to solve real Based on analysis, Solution is having Demonstrates
life problems the solution adequate outstanding
applying Demonstrates understanding, understanding and
Solution appropriate data significant errors relevancy and meets application of data
© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 4 of 8
CSC 2107 DATA STRUCTURE LAB
structures and lack of basic requirements structures with
effectively or efficiency. but having lack depth exemplary efficiency
irrelevant solution or optimization in and optimization
certain aspects. which is completely
relevant to the
complex problem.

CO3 [PO-e-1] Determine approaches required to solve complex problems based on specific
requirements.
Assessment Missing/Incorrect Inadequate Satisfactory Excellent
Attribute/Criteria (0) (1-2) (3-4) (5)
Fails to determine Shows limited
meaningful understanding to Adequately Demonstrates an
problem-solving determine determines exceptional ability to
approaches with approaches and problem-solving determine approaches
proper knowledge to specify approaches having for complex problems
of data structure or requirements or some gaps in with understanding of
identify relevant analysis of understanding of various data structures
Knowledge and approaches and problem-solving specific as well as provides clear
proper use of data structure approaches is requirements and explanations of the
Data Structure effectively. not adequate. data structure. specific requirements.
Solution having
adequate Demonstrates
understanding of outstanding
Solution solution understanding of
demonstrates approaches and approaches that can
inadequate meets basic draw a specific solution
No Solution using approaches that requirements, and based on the
with proper may have the solution requirements and the
approaches or significant errors process may have solution shows
solution is and lack of some minor area exemplary efficiency
Solution irrelevant efficiency. to improve. and optimization.

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

CSC 2107 DATA STRUCTURE LAB

CO4 [PO-e-1] Use determined approaches in solving complex real-life problems with
specific requirements.

Assessment Missing/Incorrect Inadequate Satisfactory Excellent

Attribute/Criteria (0) (1-2) (3-4) (5)

Knowledge and Knowledge of data Inadequate Adequately applies Demonstrates a deep

proper use of structure is not understanding to advanced data understanding of
Data Structure clear, not well use approaches structures to solve using determined
organized and no solving complex complex real-life approaches to solve
use of proper data real-life problem problems but may complex real-life
structure regarding and way to use lack depth or problems. Analyzes
complex real-life proper data optimization in the problem
problem. structure to solve certain aspects. requirements and
complex real-life constraints
problems can have effectively,
significant errors considering relevant
to fix. data structure
Problem Analysis Fails to analysis Demonstrates Adequately Demonstrates
and understand narrow analysis analyzes to use exceptional ability in
specific ability to use appropriate problem analysis,
requirements of appropriate approaches to with a
complex real-life approaches solving solve the complex comprehensive
problem and fails complex real-life real-life problem understanding of the
to approach problems with with some gaps in complex real-life
determining the specific understanding or problem, insightful
solution requirements. depth, identifies identification of data
relevant data structure concepts,
structure concepts thorough analysis of
complexity
irrelevant solution Based on analysis, Solution is having Demonstrates
or cannot solve the solution of adequate outstanding
complex real life complex real-life understanding understanding and
problems problems about the application of data
determining demonstrates approaches and structures with
Solution approaches and significant errors showing efficiency exemplary efficiency
applying and lack of but can be and optimization
appropriate data efficiency. improved. which is completely
structures. relevant to the real-
life complex
problem.

XIV- Course Requirements

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

• Topics are supposed to be covered in the theory classes discussing different data structures and their applications.
For the implementation of different data structures, the lab classes will be used. Some Class notes will be uploaded
on the web guiding students to implement the various problems. White board will be used at the start of each lab
class. For some cases, multimedia projector will be used to demonstrate some problems for the convenience of the
students. Students must study up to the last lecture of theory classes before coming to the class and it is suggested
that they should go through the relevant topics before coming to the class. Just being present in the lab is not
enough-students must participate in lab tasks.

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

CSC 2107 DATA STRUCTURE LAB
XV – Evaluation & Grading System*

The following grading system will be strictly followed in this course.

Mid-term Final term

Class Attendance: 5 marks Class Attendance: 5 marks
Lab Task/ Assignment/ Home Task: 15 marks Lab Task/Assignment/Home Task: 15 marks
Lab Exam: 20 marks Lab Exam: 20 marks
Viva: 10 marks Viva: 10 marks
Total Mid-Term Marks: 50 Marks Total Final-Term Marks: 50 Marks
Grand Total: 100 Marks

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
I Incomplete
W Withdrawal
UW Unofficially Withdrawal
* The evaluation system will be strictly followed as par the AIUB grading policy.
* CO attainment will be achieved with 60% of the evaluation marks.

XVI – 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) Data Structures and Program Design In C (2nd Edition), Robert L. Kruse, Bruce P. Leung, Clovis L. Tondo.
4) Data Structures, Seymour Lipschutz, Schaum Ouline Series.
5) Data Structures Fundamentals, Md. Rafiqul Islam, Ph.D and M. A. Mottalib, Ph.D

XVII - List of Faculties Teaching the Course

FACULTY NAME SIGNATURE

DR. ASHRAF UDDIN
DR. MD. MANZURUL HASAN
JUBAYER AHAMED
JUENA AHMED NOSHIN
KAWSER IROM RUSHEE
MAHFUJUR RAHMAN
MD SAJID BIN-FAISAL
MD. ARIFUL ISLAM
MD. FARUK ABDULLAH AL SOHAN
MD. HASIBUL HASAN
MD. KHAIRUL ALAM MAZUMDER
MIR MD. KAWSUR
NAZIA ALFAZ
© Dept. of Computer Science, FST, AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) Page 7 of 8
CSC 2107 DATA STRUCTURE LAB
NYME AHMED
RIFAT AL MAMUN RUDRO
RIFATH MAHMUD
SAIKAT BAUL
SYED NAFIUL SHEFAT
SYEDA ANIKA TASNIM
SYMA KAMAL CHAITY
TAMANNA ZAMAN BRISTY
TANVIR AHMED
TOFAYET SULTAN
TOHEDUL ISLAM

XVIII – Verification

Prepared by: Moderated by:

Checked by:
--------------------------------- --------------------------------- ---------------------------------
Syed Nafiul Shefat Dr. M. Mahmudul Hasan Dr. Debajyoti Karmaker
Course Convener Point Of Contact Head (Undergraduate Program)
OBE Implementation Committee Department of Computer Science

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

Verified by: Certified by: Approved by:

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

Dr. Md. Abdullah-Al-Jubair Prof. Dr. Dip Nandi Mr. Mashiour Rahman
Director Associate Dean, Dean,
Faculty of Science & Technology Faculty of Science & Technology Faculty of Science & Technology

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

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