Scribd
Upload
19 views2 pages

Data Structures and Algorithms Outline: Textbook

This document outlines a course on data structures and algorithms. The objectives are to introduce data structures and complexity analysis, develop skills to analyze time and space requirements, and learn to select the appropriate data structure for a problem. The textbook is listed. Grading will be based on a midterm, quizzes, assignments, lab tests, and a final exam. The tentative course schedule lists topics like arrays, linked lists, trees, hashing and graphs that will be covered over the term. Academic integrity is expected and there are policies around missed quizzes, homework format, and the use of C++ in assessments.

Uploaded by

uzii09
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
19 views2 pages

Data Structures and Algorithms Outline: Textbook

This document outlines a course on data structures and algorithms. The objectives are to introduce data structures and complexity analysis, develop skills to analyze time and space requirements, and learn to select the appropriate data structure for a problem. The textbook is listed. Grading will be based on a midterm, quizzes, assignments, lab tests, and a final exam. The tentative course schedule lists topics like arrays, linked lists, trees, hashing and graphs that will be covered over the term. Academic integrity is expected and there are policies around missed quizzes, homework format, and the use of C++ in assessments.

Uploaded by

uzii09
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 2

Data Structures and Algorithms

Outline

Course Objectives

To introduce the basic theory of complexity and data structures as basic building blocks.

To develop the skills to analyze time (and space) requirements for a data structure and
associated algorithms.

To prepare the students to pick the right data structure for a given problem.

Textbook
E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++, Computer
Science Press, 1995.

Grading Scheme
Midterm

20%

Quizzes

4-5

15%

Assignments

5-6

20%

Lab Tests

2-3

10%

Final

35%

Tentative course outline and lecture plan

Topic
Introduction, Review of C++
Classes
Performance analysis and
measurement
Arrays, Multi-dimensional Arrays
and mapping functions
Stacks using arrays, Recursion,
quick sort
Queues using arrays, Evaluation of
expressions
Singly-linked lists
Stacks and queues using lists
Circular & Doubly-linked lists
Trees binary trees & traversals
Binary search trees
Height balanced trees 2-3-4 trees
Heap & priority queue, Heap Sort
Hashing
Graphs basic operations and
traversal, MST
Final

No. of
Lectures
2

Chapter 1

Chapter 2

Chapter 3

2
2
2
1
2
2
2
2
2
2
2

Chapter 4
Chapter 5
Chapter 5
Chapter 6
Chapter 7
Chapter 8

Miscellaneous

Academic integrity is expected of all the students. Plagiarism or cheating in any assessment
will result in at least an F grade in the course, and possibly more severe penalties.

There is no makeup for a missed quiz.

Only handwritten homeworks will be accepted.

Knowledge of C++ (including pointer & classes) is assumed for this course. All code
written in examinations, assignments and homeworks must be in C++.

You might also like