CPCS204 01 Introduction
CPCS204 01 Introduction
CP
CS
20
4
CP
CS
20
4
Goals
Data Structure - I
CP Goals
CS Improve knowledge of standard data structures and
abstract data types
20
4 Improve knowledge of standard algorithms used to
solve several classical problems
CP Teaching Method
CS • This class is NOT used to teach you JAVA
20 • Majority of this class is used covering new data
4 structures, abstract data types, and algorithm analysis
• The teaching of these concepts dictate more
explanation and less of a focus on “code”
o Some code will be shown on the PowerPoint slides
• Such as after we explain a new abstract data type
• We’ll show the code of how you would implement it
o However, writing of actual code will most likely never be
done in class
• Again, that is not the purpose of this class
4 Dr. Jonathan (Yahya) Cazalas Dr. Muhammad Umair Ramzan
Data Structures - I
“No Bonus” marks for this course anymore
CP
CS
Text Book
20
4 "Object-Oriented Data Structures Using
Java",
Nell Dale, Jones & Bartlett Learning; 3rd
edition (February 25, 2011). ISBN-10:
1449613543. ISBN-13: 978-1449613549.
CP
CS
Reference Book
20
4
“Schaum’s Outlines, Data Structures
with Java",
John R. Hubbard; McGraw-Hill; 2nd
edition (2007). ISBN-07-147698-9.
CP General Policies
CS
• Attendance must be 75% or more
20
• All written exams will be cumulative
4
• Quizzes will be on blackboard, No Makeup
• Plagiarism / cheating will result in 0% marks
• Pay regular visit to Blackboard
• Need help for Assignments; contact lab
instructor
• No scale up / bonus for final grade
8 Dr. Jonathan (Yahya) Cazalas Dr. Muhammad Umair Ramzan
Data Structures - I
“No Bonus” marks for this course anymore
CP Assessments
CS Assessment Grading Percentage
20 Quizzes 05%
4
Lab & Project Work 30%
Assignments (3 * 5% each) 5%
Mid-Exam 1 10%
Final Exam 50%
CP
CS
20 Introduction to Data
4
Structure
CP What is Data?
CS • Data
20 o A collection of facts from which a conclusion may be drawn
4 o Example:
• Temperature is 35 degrees celcius
• Conclusion: It is HOT!
• Types of data:
o Textual: for example
» Your name (Muhammad)
o Numeric: for example
» Your id (090254)
o Audio: for example,
» Your voice
• Graph
15 Dr. Jonathan (Yahya) Cazalas Dr. Muhammad Umair Ramzan
Data Structures - I
“No Bonus” marks for this course anymore
CP
CS
20
4
Review Questions
Introduction to Data
Structure
CP 01
CS
• A collection of facts from which a
20
conclusion may be drawn is known as:
4 a) Information
b) Data
c) Both
d) None of above
CP 02
CS
• Which of the followings is not an example
20
of “data”?
4 a) James hairs are “brown”
b) Ahmed wears “Ghutrah” and “Agal”
c) This is my laptop
d) The price of laptop is SAR 5000
CP 03
CS
• Which of the followings is a valid type of
20
data?
4 a) Textual
b) Numeric
c) Sound
d) Image
e) All of above
CP 04
CS
• What is “Data Type”
20
a) Built-in construct of language to handle basic
4 types of data
b) A particular way of storing and organizing
data in a computer so that it can be used
efficiently
c) Both
d) None of Above
CP 05
CS
• What is “Data Structure”
20
a) Built-in construct of language to handle basic
4 types of data
b) A particular way of storing and organizing
data in a computer so that it can be used
efficiently
c) Both
d) None of Above
CP 06
CS
• “Data Structure” is also known as “Abstract
20
Data Type”
4
a) True
b) False
CP 07
CS
• The main purpose of “Data Structure” is to
20
facilitate efficient:
4 a) storage of data
b) retrieval of data
c) manipulation of data
d) All of Above
CP 08
CS
• Which of the following is a “data type”?
20
a) String
4
b) Array
c) double
d) None of above
CP 09
CS
• Which of the following is a “ADT”?
20
a) Array
4
b) Link List
c) Tree
d) Graph
e) All of above
CP 10
CS
• Which of the following is a “physical” data
20
structure?
4 a) Array
b) Linked List
c) Stack
d) Queues
e) a) & b)
CP 11
CS
• Which of the following is a “logical” data
20
structure?
4 a) Array
b) Linked List
c) Stack
d) Queues
e) c) & d)
CP 12
CS
• Which of the following is “odd (different)”
20
in the following list w.r.t. its existence
4 a) Array
b) stack
c) string
d) tree
e) None
CP 13
CS
• Which of the following is a “static” data
20
structure?
4 a) Array
b) Linked List
c) Stack
d) Queues
e) None of above
CP 14
CS
• Which of the following is a “dynamic” data
20
structure?
4 a) Array
b) Linked List
c) Stack
d) Queues
e) All of above
CP 15
CS
• Which of the following is “odd (different)”
20
in the following list w.r.t. memory allocation
4 a) Linked List
b) stack
c) string
d) tree
e) None
CP 16
CS
• Which of the following is a “linear” data
20
structure?
4 a) Array
b) Linked List
c) Stack
d) Queues
e) All of above
CP 17
CS
• Which of the following is a “Non-linear”
20
data structure?
4 a) Array
b) Graph
c) Stack
d) Tree
e) b) & d)
CP 18
CS
• Which of the following is “odd (different)”
20
in the following list w.r.t their
4 representation
a) Linked List
b) Graph
c) Tree
d) None of above
CP 19
CS
• Which of the following is a basic operation
20
of any Data Structure.
4 a) Sorting
b) Merging
c) Insertion
d) Deletion
e) All of above
CP 20
CS
• “Accessing each data element exactly once”
20
is
4 a) Traversing
b) Searching
c) Insertion
d) Merging
e) None of above
CP 21
CS
• “Finding the location of a given data
20
element” is
4 a) Traversing
b) Searching
c) Insertion
d) Merging
e) None of above
CP 22
CS
• “Adding a new data element to the
20
structure” is
4 a) Traversing
b) Searching
c) Insertion
d) Merging
e) None of above
CP 23
CS
• “Removing a data element from the
20
structure” is
4 a) Traversing
b) Searching
c) Sorting
d) Deletion
e) None of above
CP 24
CS
• “Arrange the data elements in some logical
20
fashion” is
4 a) Traversing
b) Searching
c) Sorting
d) Merging
e) None of above
CP 25
CS
• “Combining data elements form two or
20
more data structures into one” is
4 a) Traversing
b) Searching
c) Sorting
d) Merging
e) None of above
CP
CS
20
4
Allah (Alone) is
Sufficient for us, and He
is the Best Disposer of
affairs (for us).(Quran 3 : 173)
47 Dr. Jonathan (Yahya) Cazalas Dr. Muhammad Umair Ramzan