CSE225.7 Course Outline
CSE225.7 Course Outline
Course Content:
• Data representation and analysis of running time of algorithms
• Efficient data structures: Lists, Stacks, Queues, Binary Search Trees, Heaps, Priority
Queues, Graphs
• Efficient algorithms of Sorting and Searching
• Elementary tree and graph algorithms
Schedule
Lecture
No.
1 Introduction
2 Pointers
3 Pointers & Dynamic Memory Allocation
4 Intro to C++
5 Intro to C++ (cont.)
6 Algorithm Analysis ADT Unsorted List (Linked List)
7 ADT Unsorted and Sorted List (Array)
8 Stack and Queue (Array)
9 Stack and Queue (Linked List)
10 ADT Unsorted and Sorted List (Linked List)
11 Programming with Recursion
12 Recursion (cont.)
13 *** Mid Term ***
14 Trees
15 Binary Search Tree
16 Heaps & Priority Queue
17 Graphs
18 Graphs (cont.)
19 Graph BFS, DFS
20 Hashing
21 Hashing (cont.)
22 Sorting Algorithms
23 Sorting Algorithms (cont.)
24 Course review
*** Final Exam ***
Lab :
Lab Outline and Manuals will be provided Separately.
Grading
According to NSU grading policy
Policy:
Exams and Quizzes: Exams and quizzes will be closed book and closed notes. No electronic devices
except non-programmable calculators will be allowed during exams. Calculators cannot be shared
with friends. There will be no makeup quizzes or exams. If you miss a quiz or exam, you will get
zero for that. Final exam will be comprehensive.
Assignments: There will be several home works/ Assignments throughout the semester. No late
submission will be accepted. To be successful in the exam, you should solve homework problems
independently, although you may discuss with your friends to understand a more comprehensive
picture of the problems.
Class performance: Asking questions, taking part in discussions, sudden exams, and so on.
Class etiquette: Distracting others in class is violating others rights to be attentive. So, laptop,
tablets, cell phones or any other devices cannot be turned on during class time. You have to
share any talk with the whole class. Attendance will be counted at the beginning of the class and if
you are late then no late attendance will be counted.
Grade dispute: If you dispute your grade on any homework, quiz or exam, you have one week time
from the date that the graded paper was returned to you to request a change in the grade. After this
time, no further change in grade will be considered.
Academic Honesty: Any means of unauthorized assistance in preparing materials which a student
submits as original work is deemed to be cheating and constitutes grounds for disciplinary action.
Instructors are expected to use reasonably practical means of preventing and detecting cheating. Any
student judged to have engaged in cheating might receive a reduced grade for the work in question, a
failing grade in the course, or such other lesser penalty, as the instructor deems appropriate. Serious
instances may be referred to the Disciplinary Committee in the Office of the Vice Chancellor.