Modern Academy for Computer Science
And Management Technology in Maadi
Department: Computer Science.
Course Specifications
1- 1- Basic Information
Academic year / Level: 2nd year /1st term Specialization: Computer Science
Title: Data Structures Code: CS 201
Lecture: 2 Tutorial: --- Practical: 2 Total: 3 (Hour/week)
On completion of this course the student will be able to:
Overall – 2 The concepts and implementations of several types of data structures such as arrays, linked lists, queues and
Aims stacks. The concepts and implementations of Tree structures, searching (sequential search - binary search),
:of Course Sorting (insertion sort - selection sort – quick sort), and Hashing. Construct a preliminary design of a program
and select the appropriate data structure for implementation. Improve their skills as software programmers
using basic definitions combined with modern languages (C++).
3 – Intended Learning Outcomes of Course (ILOs):
On completing this course, students should have knowledge and understanding of:
A-Knowledge a1. List the overall characteristics of the data structure. [A16]
and a2. Define the importance of data structures [A5,A6]
Understandin a3. Recognize an efficient data structure to solve a problem [A1].
:g a4. Identify the usage of each type of data structures [A2].
a5. Identify methods and methodologies for searching, sorting and accessing data. [A4]
a6. Realize the inputs and outputs functions that are used in C++. [A14]
a7. List the principals of Programming techniques. [A14]
a8. List complexities of Programming techniques. [A14]
On completion of this course the student will be able to:
B-Intellectual b1. Analyze comparison between different approaches used in data structure [B13]
:Skills b2. Apply various scheduling approaches comparing different results[B13,ITB15]
b3.Recognizing strengths and weaknesses of different algorithms. [B12]
b4. Apply various algorithm techniques analyzing their performance. [ B13]
b5. Summarize different data structure techniques by applying small coding example using C++ [B15]
b6. Applying data structure techniques using C++ Examples. [B12]
b7. Deduce the results of programs by tracing small programs to. [B11]
b8. Analyze problems to get appropriate solution approach for goals [ITB16,ITB19,ITB20]
b9. Test results and performance. [B17]
On completion of this course the student will be able to:
C-Professional c1. Design programs Using Windows operating systems and Visual Studio programming facilities. [ITC14]
and Practical c2. Perform under direct supervision, as a part of a team that implements one of the various indexing
:Skills techniques. [C12,ITC17]
c3. Perform presentation and communication skills through giving a project about a selected topic from the
course. [C21]
c4. Design small coding projects to enhance programming skills. [C20]
c5. Create experience with some software packages (C++). [C14]
c6. Generate practical skills in dealing with the applications in the lab.[C20]
c7. Apply the concepts of data structures to solve a problem [C4].
c8. Enhance the data structure algorithms through the design and implementation of small coding projects.
[C12,C25]
On completion of this course the student will be able to:
D-General and d1. Use fundamental research skills, through the use of online recourses and library base material to
Transferable implement a selected topic from the course. [D1]
:Skills d2. Use self-learning and scientific writing abilities through producing codes for a selected topic from the
course. [D1]
d3. Work effectively as an individual during the lab and the exercises.[D7]
d4.Work effectively as a member of a team during preparing reports about some of the computer subjects.
[D4]
No Topic
:Contents-4 1 Algorithms, Performance Analysis
2 Searching And Sorting Algorithms
3 Basic Data Structures (Stack, Queue)
4 Linked Lists
5 Binary Trees
6 Binary Search Tree
7 AVL
8 Graphs
Lectures: (√ ) Practical training: ( √) Exercises : ( )
Teaching–5 Presentation: ( .. ) Open Discussion: ( √ ) Projects: ( √ )
E. Learning: ( √) Web-Site searches: ( √ ) Self Studies: ( … )
and Case Study: ( … ) Chat Room: ( √) Virtual Class: ( … )
Learning Virtual Lab: ( … ) Voice Lectures: ( √ ) Movie Lectures: ( √ )
:Methods Simulation Lab: ( … ) Others (list): ( √)
1- Voice Lab 2- Movie Lab
6-Student Assessment Methods:
- Assignment (√ ) - Quiz ( ) - Reports ( √ )
A-Student - Researches ( ) - Projects ( √ ) -Discussion ( √ )
Assessment - Presentations () - Participation ( √ ) - Midterm Exam ( √ )
:Methods - Practical Exam ( √ ) - Open Book Exam ( ) - Oral Exam ( )
- Final Exam (√ ) - Others(list) ( )
Assessment method Week no.
B-Assessment 1. Assignment 5th and 12th
:Schedule 2- Reports 14th and 15th
3- Discussion Every week
4- Participation Every week
5-Practical Exam and Project 14th and 15th
7- Midterm Exam 7th
8- Final Exam 16th
Assessment Method Marks Percentage (%)
C-Weighting of 1- Practical Exam and project 10 10%
Assessment 2- Final-term examination 50 50%
:s 3- Midterm examination 20 20%
1-Assignments 20 20%
2- Reports
4- Year work
3- Discussion
4- Participation
Total 100 points 100%
7-List of References:
A-lecture notes. Lecture Notes. , Data Structures, Staff member, Modern Academy for Computer Science and Management
Technology.
B- Essential books
(text books) ADTs, Data Structures, and Problem Solving with C++ 2nd Edition (2021).
C- Recommended [1] John Carey , Shreyans Doshi , Payas Rajan “C++ Data Structures and Algorithm Design Principles:
Books Leverage the power of modern C++ to build robust and scalable applications”, Packt Publishing, 2019
[2] Navarro, Gonzalo. Compact data structures: A practical approach. Cambridge University Press, 2016.
[3] Nell Dale , Chip Weems , Tim Richards, “C++ Plus Data Structures”, Jones & Bartlett Learning, 2016
D- Periodicals,
Web- Sites, …………………………………………………………………………………..
etc….
9- Facilities and 1- White Board √ 2-PC / Laptop √
teaching Lecture√..Class.. Lab√ Lecture√.. Class….. Lab √
materials: 3- Printers √ 4- Data Show √
Lecture…..Class….. Lab…√ Lecture√ .Class Lab√
5- White Board for Presentation √ 6- Laser Pointer ...
7- Laboratories(List): √ 8- Software Packages (list): √
Computer labs √ Visual Studio C++
Virtual lab Simulation lab
9- Library ... 10- E. Library √
(i,e. Ebsco, IEEE, Egyptian
knowledge Bank, etc)
11-Webinars: √ 12-Chat Room: √
Moodle √ Zoom √ YouTube What’sUp √
WebEx MS’Teams √ FaceBook Messenger √
Others(list): Imo Viber line skype
Telegram Others(list)
13- Social Media Networks: √ 14- Website/ Mobile Application
Facebook √ LinkedIn Others(list):
15- Internet connection √ 16- Recording movie System √
(Cable or Wireless) ( Camera, mic, speaker, etc)
17- Supplies and raw materials (list) 18- Others(list):
- Course Coordinator: Dr. Mohamed El-Gammal Signature:…………
- Head of Department: Prof Mahmoud Gadallah Signature:…………
Date: / /
Course Intended Learning Outcomes
Year: 2021-2022 Academic term : 1st term
Title: Data Structures Code: - CS201
Academic year /level: 2nd year Specialization: CS
a. Knowledge and b. Intellectual Skills c. Professional Skills d. General
Hours Understanding Skills
Course
Content
Lab.
Lec.
b1
b2
b3
b4
b5
b6
b7
b8
b9
d1
d2
d3
d4
a1
a2
a4
a5
c1
c3
c4
c8
a3
a6
a7
a8
c2
c5
c6
c7
Algorithms 2
Performan 2 √ √ √ √
√ √ √ √ √ √ √ √
ce Analysis
Searching , 4 √ √ √ √ √ √ √ √
Sorting 4 √ √ √ √
Algorithms
Basic Data 4 √ √ √ √ √ √ √ √ √ √ √
Structures √ √
4 √ √ √ √ √ √ √ √ √
(Stack,
Queue)
Linked 4 √ √ √ √ √ √ √ √ √ √ √ √ √
Lists 2 √ √ √ √ √ √ √ √ √
Binary 4 √ √ √ √ √ √ √ √ √ √ √ √
4 √ √ √ √ √ √ √ √ √
Trees √
Binary 4 √ √ √ √ √ √ √
Search √ √ √
4 √ √ √ √ √ √ √
Tree
AVL 4 √ √ √ √ √ √ √ √ √
√ √
2 √ √ √ √ √ √ √
Graphs 2 √ √
2 √ √ √ √ √ √ √
Teaching and learning methods versus Intended Learning Outcomes
Year: 2021-2022 Academic term : 1st term
Title: Data Structures Code: - CS201
Academic year /level: 2nd year Specialization: CS
Course Assessment Methods versus Intended Learning Outcomes
Year: 2021-2022 Academic term : 1st term
Title: Data Structures Code: - CS201
Academic year /level: 2nd year Specialization: CS
Methods a.Knowledge &Understanding b. Intellectual Skills c.Professional Skills d.General Skills
of
b1
b2
b3
b4
b5
b6
b6
b7
b8
b9
d1
d2
d3
d4
a1
a2
a3
a4
a5
a6
a7
a8
evaluatin
c1
c2
c3
c4
c5
c6
c7
c8
g ILOs
Written √ √ √ √
Exams
(Final+ √ √ √ √ √ √ √ √ √ √ √
midter
m)
Assign √ √ √ √ √ √
√ √ √ √ √ √ √
ments √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √
Reports
Particip √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √
ation
Discussi √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √ √
on
Lab √ √ √ √ √ √
√ √ √ √ √ √ √ √
Exam √ √ √ √
