Scribd
Upload
51 views2 pages

DS Course Outline

This document outlines a Data Structures course being offered in the Spring 2023 semester. The course is 3 credit hours and has Object Oriented Programming as a prerequisite. It will cover fundamental data structures and algorithms concepts. Topics include linked lists, stacks, queues, trees, graphs, hashing and more. Students will be evaluated based on assignments, quizzes, two midterms and a final exam. The instructor's name is Arooj Khalil and office hours are from 10am-4pm.

Uploaded by

شمشیر علی
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
51 views2 pages

DS Course Outline

This document outlines a Data Structures course being offered in the Spring 2023 semester. The course is 3 credit hours and has Object Oriented Programming as a prerequisite. It will cover fundamental data structures and algorithms concepts. Topics include linked lists, stacks, queues, trees, graphs, hashing and more. Students will be evaluated based on assignments, quizzes, two midterms and a final exam. The instructor's name is Arooj Khalil and office hours are from 10am-4pm.

Uploaded by

شمشیر علی
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/ 2

Course Outline

Data Structures SE
Semester Spring-2023, Section-4C
Instructor: Arooj khalil Office Hours: 10-4
Email: [email protected]
Credit 3 Prerequisite Object Oriented
Hours: Programming
Course Objectives:
CS2001 is a core Computer Science course with Object Oriented Programming as its
prerequisite. The course learning outcomes of this course are:
 Understand basic concepts of data structure and algorithms.
 Evaluate different data structures in terms of memory and time requirement
 Design appropriate data structures to solve real world problems related to the program
 Determine bugs in programs and recognize required operations with data structures

Text Book:
Any one of these books is recommended as a text book:

 Mark Allen Weiss, Data structures and algorithm analysis, Pearson Education, 2007.
 Adam Drozdek, Data structures and algorithms in C++, Course technology, 2004.
 Nell Dale, C++ Plus Data Structures, 3rd Edition, Jones and Bartlett, 2003.
 Michael T. Goodrich, Roberto Tamassia and David M. Mount, Data structures and algorithms, 2nd
Edition, John Wiley & Sons, 2011.
LECTURES TOPICS
1 Introduction
2 Time Complexity Analysis and Asymptotic Bounds
5 Linked Lists
Review of pointers
Singly linked lists, doubly linked lists, circular lists and
corresponding iterators

2 Stacks and Queues


MIDTERM 1
2 Recursion
3 Trees
Binary trees and their traversals
Binary search trees (Insertion, Deletion and Search)
3 Height Balanced Binary Search Trees (AVL Trees)
2 Heaps and heap sort
MIDTERM 2
1
Data compression and Huffman coding
2 Hashing
Hash tables and hash functions
Collision resolution
3
Graph data structure, Breadth first search and Depth first search
2 Advanced Topics
Course Outline
Data Structures SE
Semester Spring-2023, Section-4C
Tentative Grading Scheme:
Assignments(15 %)

Quizzes(15 %)

Midterms(30 %)

Final Exam (40 %)

Important Instructions:
o Quizzes may be announced or surprise
o There will be no make up quiz
o Minimum requirement to pass this course is to obtain at least 50% marks.
o All assignments and course work must be done individually. Plagiarism in any work (Quiz,
Assignment, Midterms, and Final Exam) from any source (Internet or a Student) will result in F
grade.
o No Late assignment Submissions
o All the CS department’s grading policies apply.

You might also like