[go: up one dir, main page]

0% found this document useful (0 votes)
235 views3 pages

CSE225.7 Course Outline

This document provides the course outline for CSE 225: Data Structures and Algorithms at North South University for the summer 2020 semester. The course will be taught by Dr. Ahmedul Kabir and will cover topics such as data representation, analysis of algorithm efficiency, common data structures like lists, stacks, queues, trees, graphs, and sorting/searching algorithms. Students are required to obtain the listed textbook and will be assessed through class participation, quizzes, a midterm, final exam, and lab work. The course will meet twice per week for lectures and labs according to the provided schedule.

Uploaded by

Abdullah Al Amin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
235 views3 pages

CSE225.7 Course Outline

This document provides the course outline for CSE 225: Data Structures and Algorithms at North South University for the summer 2020 semester. The course will be taught by Dr. Ahmedul Kabir and will cover topics such as data representation, analysis of algorithm efficiency, common data structures like lists, stacks, queues, trees, graphs, and sorting/searching algorithms. Students are required to obtain the listed textbook and will be assessed through class participation, quizzes, a midterm, final exam, and lab work. The course will meet twice per week for lectures and labs according to the provided schedule.

Uploaded by

Abdullah Al Amin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

North South University

Department of Electrical and Computer Engineering


CSE 225: Data Structures and Algorithm
(Section 7)
Course Outline- Summer 2020
Instructor: Dr. Ahmedul Kabir (ALK1)
Class Location: NAC 408
Class Hours: RA 9:40 – 11:10
Lab Location: LIB 603
Lab Hours: RA 1:00 – 2:30
Office Hour: RA 11:20 – 12:50
Office Location: TBA
Email: ahmedul.kabir@northsouth.edu

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

Required Text and Materials:


• C++ Plus Data Structures, Fifth Edition by Nell Dale

Reference Text and Materials:


• Data Structures and Algorithms in C++, Michael T. Goodrich, Roberto Tamassia, David
Mount
• C++: The Complete Reference, Herbert Schildt
• Additional reading Materials will be provided and uploaded in Google Class room by the
instructor.

Outcomes of the Course


1) Introduce the basic data structures for storage and retrieval of ordered or unordered data
using arrays, linked lists, binary trees, heaps and graphs.
2) Introduce the concept of problem domain analysis and exploit the domain features to improve
data structures efficiency.
3) Develop the concept of asymptotic analysis using Big-O techniques to compare different
algorithmic solutions.
Marks Distribution:

Assessment Tools Weightage (%)


Class Performance Participation & Attendance 10%
Quizzes (Best 2 out of 3) 20%
Midterm 20%
Final Exam 30%
Lab Work 20%

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.

General course administration: The class presentations will be interactive lectures.


Instructor will provide lecture slides after the lecture sessions.

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.

You might also like