1

Introduction
Course Code: CSC2106
Course Title: Data Structure

Dept. of Computer Science

Faculty of Science and Technology

Lecture No: Theory-01 Week No: 1 Semester: Summer: 2023-24

Lecturer: Professor Dr. Firoz Ahmed Email: [email protected]
 2

About Me

Professor Dr. Firoz Ahmed

Department of Computer Science
Mail: [email protected]

Research Interest
Internet of Things (IoT)
Mobile Ad Hoc Networks (MANETs)
Wireless Sensor Networks (WSNs)
 3

Lecture Outline

1. Mission, Vision & Goals of AIUB and Its Computer

Science Department
2. Course Objectives, Prerequisites, Importance, Contents &
Evaluation
3. Classroom Policies
4. Definition of Data Structures
5. Operations on Data Structures
6. Definition of Algorithm
7. Definition of Program
8. Books
9. References
 4

Vision & Mission of AIUB

Vision
 AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) envisions
promoting professionals and excellent leadership catering to the technological progress and
development needs of the country.

Mission
 AMERICAN INTERNATIONAL UNIVERSITY-BANGLADESH (AIUB) is committed to
provide quality and excellent computer-based academic programs responsive to the
emerging challenges of the time

 It is dedicated to nurture and produce competent world class professional imbued with strong
sense of ethical values ready to face the competitive world of arts, business, science, social
science and technology.
 5

Goals of AIUB

 Sustain development and progress of the university

 Continue to upgrade educational services and facilities responsive of
the demands for change and needs of the society
 Inculcate professional culture among management, faculty and
personnel in the attainment of the institution's vision, mission and goals
 Enhance research consciousness in discovering new dimensions for
curriculum development and enrichment
 Implement meaningful and relevant community outreach programs
reflective of the available resources and expertise of the university
 Establish strong networking of programs, sharing of resources and
expertise with local and international educational institutions and
organizations
 Accelerate the participation of alumni, students and professionals in the
implementation of educational programs and development of projects
designed to expand and improve global academic standards
 6

Vision & Mission of CS Dept.

Vision
Provides leadership in the pursuit of quality and excellent computer education
and produce highly skilled and globally competitive IT professionals.

Mission
Committed to educate students to think analytically and communicate
effectively; train them to acquire technological, industry and research-oriented
accepted skills; keep them abreast of the new trends and progress in the world
of information communication technology; and inculcate in them the value of
professional ethics.
 7

Goals of CS Department

 Enrich the computer education curriculum to suit the needs of the industry-
wide standards for both domestic and international markets
 Equip the faculty and staff with professional, modern technological and
research skills
 Upgrade continuously computer hardware's, facilities and instructional
materials to cope with the challenges of the information technology age
 Initiate and conduct relevant research, software development and outreach
services.
 Establish linkage with industry and other IT-based organizations/institutions
for sharing of resources and expertise, and better job opportunities for
students
 8

Course Evaluation

Mid Term Class Quizzes 40

Class Attendance/Performance 10
Midterm Written Exam 50
Mid Term Total 100 40%
Final Term Class Quizzes 40
Class Attendance/Performance 10
Midterm Written Exam 50
Final Term Total 100 60%
Grand Total Final Grade of the Course 100%
 9

Classroom Policies

Must be present inside the class in due time.

 Class Break: I would prefer to start the class in due time, giving a break 5/10 minutes. and
leave the class in 5/10 minutes early for theory/Laboratory class respectively
 Every class will start with a question-answer session about the last lecture. So, students
must be prepared with the contents and exercises from the last lecture.
 Students are suggested to ask questions during or after the lecture.

Late in Class:
 Student coming after 10 minutes of due time is considered late.
 1 late attendances are considered as one absent.
 Late during quiz is not given additional time.
 Students who are regularly late might have additional deduction of marks.
 A late student will be allowed to enter the class.
 Don’t ask permission to enter the class, just get in slowly and silently.
 To leave class you will need to ask for permission.
 10

Attendance

 At least 80% presence is required by the student. Absent classes must be

defended by the student through application and proper documentation to the
course teacher.

 Long absences/irregular presence/absences out of 25% range must go through

application procedures via department Head (+ probation office, if student is
in probation) to attend the following classes.

 Acceptance of an application for absence only gives permission to attend the

following classes. This might still result in deduction of marks (for attendance)
which will be judged by the course teacher.
 11

Makeup Evaluation

 Makeup for missing evaluations like quizzes/assignment submission

date/presentation date/viva date/etc., (If somebody does not attend any quiz, it
is applicable for him/her. If he/she attends one quiz, he/she does not allow this
condition) must go through valid application procedure with supporting
document within the deadline of the actual evaluation date.
 Makeup for missing Midterm/Final term must go through Set B form along
with the supporting document within the 1st working day after exam week.
The set B exam is generally scheduled from the 2nd working day after the
exam week. Must get signature and exam date from the course teacher and get
it approved by the department Head (monetary penalty might be imposed).
 The course teacher will be the judge of accepting/rejecting the request for
makeup.
 12

Grading Policies

All the evaluation categories & marks will be uploaded to the VUES within one
week of the evaluation process except the attendance & performance, which will be
uploaded along with the major (mid/final term) written exam marks.
Letter grades ‘A+’ through ‘F’ is counted as grades. Other grades ‘I’ and ‘UW’ are
considered as temporary grades which are counted/calculated as ‘F’ grade in the
CGPA. These grades must/will be converted to the actual grades, i.e. ‘A+’ through
‘F’.
‘I: INCOMPLETE’ is given to students who have missed at most 30% of
evaluation categories (quiz/assignment/etc.). Students must contact the course teacher
for makeup, through valid application procedures immediately after grade release.
‘UW: UNOFFICIAL WITHDRAW’ is given when the missing evaluation
categories are too high (more than 30%) to makeup. A student getting ‘UW’ has no
option but to drop the course immediately after grade release
 13

Grading Policies…

Once a student’s gets ‘I’ or ‘UW’ and unable to fulfill the requirements with the
course teacher for makeup, must drop the course within officially mentioned time
period from the registration department.
Students in probation or falls into the probation due to ‘I’/’UW’ grade are not
allowed to drop the course.
Unable to do so will result in the automatic conversion of the grades ‘I’/’UW’
to ‘F’ grade after the 4th week of the following semester.
Any problem with the mark/grade must be consulted with the course teacher
within one week of the release of grades.
 14

Dropping Course

 Must fill up the drop form and get it signed by the course teacher, write an
application to the vice chancellor and get it signed by the department Head,
and finally submit the form & application to the registration department.
 The course teacher must write down the grades (if any) obtained in midterm,
final, and grand total on the drop form.
 No drop is accepted during the following periods:
 One week before midterm exam – grade release date of midterm
exam.
 One week before final term exam – grade release date of final grade.
 Student with ‘F’ grades in midterm, final term, or grand total cannot drop.
 Probation student are not allowed to drop any course.
 15

Contacts

 Contact information (email, Teams, office location, consulting hours, etc.) of

the course teacher must be stored by the students.

 It is mandatory to contact/notify (preferably consulting hour/email) the course

teacher for/of any problems/difficulties at the earliest possible. Late
notification might not be considered.

 Update & correct your email address & phone number at VUES, as the
teacher will contact/notify you of anything regarding the course through these
information in VUES.
 16

Finally

For any problems that could not be solved/understood during the lecture,
students are advised to contact during the consultation hours and solve the
problem

Any kind of dishonesty, plagiarism, misbehavior, misconduct, etc. will not be

tolerated. Might result in deduction of marks, ‘F’ grade, or reported to the AIUB
Disciplinary Committee for drastic punishment

Always check/visit the AIUB home page for notices, rules & regulations of
academic/university policies and important announcement for deadlines (Course
drop, Exam permit, Exam Schedule, etc.).
 17

Course Prerequisite

 Representing information in computers, Binary Number Systems, Conversions.

 Using IDE.

 Basic conception of Data Storage, Data types, Variable, Array (single &
multidimensional), Pointers, String, Functions, Recursion, Scope of variable &
function, etc.

 Knowing different Libraries & their Functions.

 Concept of Structure & Class.

 Knowing Object Oriented Programming concepts.

 18

Course Objective

 The objective of this course is to introduce the subject of data structures with
the explanation of how data can be stored or manipulated in computer in an
optimized way.

 An overview of data organization and certain data structures will be covered

along with a discussion of the different operations, which are applied to
these data structures.

 Here, the space and time complexity will be taken care for different
searching or sorting techniques to deal with data. We also include how these
efficient techniques could be implemented in real life applications.
 19

Importance of the course

 Data structure is required for all areas of computer science – especially for
the basic concept of programming.

 This course will give the basic for the understanding of the courses –
Algorithms, Database, Artificial Intelligence, object oriented programming,
etc.

 This course will give the basic for the understanding of the concepts – Data
storage, converting data into information, manipulation of data, etc.
 20

Course Content

 Mid-term
 Arrays [1D & 2D]
 Pointer, String, Structure
 Stack & Queue
 Application of Stack & Queue
 Searching & Sorting
 Final-term
 Linked Lists [Singly & Doubly]
 Introduction to Trees
 Binary Search Tree, Heap Tree
 Introduction to Graphs
 Generating Minimum Spanning Tree from Graph [Prim’s & Kruskal’s Algorithms]
 Graph Traversals [BFS & DFS]
Data & Structures

 What is Data?
o Data means raw facts or information that can be processed to get results.

 What is Structure?
o Some elementary items constitute a unit and that unit may be considered as a
structure.
o A structure may be treated as a frame where we organize some elementary items
in different ways.
Data Structures
Definition

 So, what is Data Structure?

o Data structure is a structure where we organize elementary data items in
different ways and there exits structural relationship among the items so that it
can be used efficiently.
o In other words, a data structure is means of structural relationships of elementary
data items for storing and retrieving data in computer’s memory.
Elements of a Data Structure

 Usually elementary data items are the elements of a data structure.

 Types of Elementary data items: Character, Integer, Floating point numbers etc.

 However, a data structure may be an element of another data structure. That means
a data structure may contain another data structure. For example: Array, Structure,
Stack, etc.

 We talk about or study Data Structures in two ways:

o Basic
• Having a concrete implementation.
• Example: Variable, Pointer, Array etc.
o Abstract Data Types (ADTs):
• ADTs are entities that are definition of data and operation but do not have
any concrete implementation.
• Example: List, Stack, Queue etc.
Operations on Data Structures

 Basic
o Insertion (addition of a new element in the data structure)
o Deletion (removal of the element from the data structure)
o Traversal (accessing data elements in the data structure)

 Additional
o Searching (locating a certain element in the data structure)
o Sorting (Arranging elements in a data structure in a specified order)
o Merging (combining elements of two similar data structures)
o Etc.
Algorithm
Definition

 Set of instructions that can be followed to perform a task. In other words, sequence
of steps that can be followed to solve a problem.

 To write an algorithm we do not strictly follow grammar of any particular

programming language.

 However its language may be near to a programming language.

Parts of an Algorithm

 Each and every algorithm can be divided into three sections:

o First section is input section, where we show which data elements are to be
given or fed to the algorithm as an input.

o The second section is the most important one, which is operational or

processing section. Here we have to do all necessary operations, such as
computation, taking decision, calling other procedures (or algorithms) etc.

o The third section is output, where we display or get the result with the help of
the previous two sections.
Program

 Sequence of instructions of any programming language that can be followed to

perform a particular task.

 Like an algorithm, generally a program has three sections such as input, processing
and output.

 For a particular problem (usually for a complex problem), at first we may write an
algorithm. Later, the algorithm may be converted into a program.

 In a program usually we use a large amount of data. Most of the cases these data are
not only elementary items, where exists structural relationship between elementary
data items.
o That means the program uses data structures.
Books

 “Schaum's Outline of Data Structures with C++”. By John R. Hubbard

 “Data Structures and Program Design”, Robert L. Kruse, 3rd Edition, 1996.
 “Data structures, algorithms and performance”, D. Wood, Addison-Wesley, 1993
 “Advanced Data Structures”, Peter Brass, Cambridge University Press, 2008
 “Data Structures and Algorithm Analysis”, Edition 3.2 (C++ Version), Clifford A.
Shaffer, Virginia Tech, Blacksburg, VA 24061 January 2, 2012
 “C++ Data Structures”, Nell Dale and David Teague, Jones and Bartlett
Publishers, 2001.
 “Data Structures and Algorithms with Object-Oriented Design Patterns in C+
+”, Bruno R. Preiss,
References

1. https://en.wikipedia.org/wiki/Data_structure