Scribd
Upload
225 views2 pages

Data Structures and Algorithms CS 232

The document provides a course outline for a Data Structures and Algorithms course. It includes 3 credits over 1 semester. Topics covered include arrays, stacks, queues, linked lists, trees, graphs and various searching and sorting algorithms. Evaluation is based 50% on in-semester assessments and 50% on an end-semester exam. The 16-week course breakdown covers these data structures and algorithms in detail over the sessions.

Uploaded by

Muhammad Arsalan Khan
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
225 views2 pages

Data Structures and Algorithms CS 232

The document provides a course outline for a Data Structures and Algorithms course. It includes 3 credits over 1 semester. Topics covered include arrays, stacks, queues, linked lists, trees, graphs and various searching and sorting algorithms. Evaluation is based 50% on in-semester assessments and 50% on an end-semester exam. The 16-week course breakdown covers these data structures and algorithms in detail over the sessions.

Uploaded by

Muhammad Arsalan Khan
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

Review Rev No 0

Course Outline CS 232 Credit Hours: 3-1 Page 1 of 2 pages


Feb 2017 Dated: 14.07.03

Data Structures and Algorithm

Text Book(s):
1. Data Structures by Seymour Lipschutz, Shaum’s Outline Series

Reference Book(s):
1. Data Structures and Algorithm Analysis in C++ by Mark Allen Weiss
2. Data Structures using C & C++ by Yedidyah Langsam,
3. Moshe J. Augenstein & Aaron M . Tanenbaum

Course Description:

Data Structure gives knowledge about the logical storage of data in the computers. This
course is designed such that every student of IT and CS gets know-how of the data
organization which is very important for a computer programmer. The course includes
Arrays, stacks, linked lists, queues, trees, graphs and applications of all the structures. It also
includes searching and sorting algorithms.

Pre- requisite:
CS 125- Object Oriented Programming

Grading Policy:

In Semester Evaluations: 50%


End Semester Evaluation: 50%
Review Rev No 0
Course Outline CS 232 Credit Hours: 3-1 Page 2 of 2 pages
Feb 2017 Dated: 14.07.03

Week-wise Breakdown

Week Topics/Activities Chapter

Introduction to Data Structure, Data structure Operations.


1 1, Notes
Abstract data type, Algorithmic Notations.

Arrays data structures, Algorithms for Traversing ,


2 4
inserting, deleting elements in array
Multi dimensional arrays, Stacks, Representation , Push &
3 4, 6
Pop algorithms
Arithmetic expressions in stacks , Infix ,Postfix and Prefix
4 Notations, Evaluating postfix expressions 6

Infix to postfix conversion


5 Recursion 6

Queue data structure, Queue representation


6 Algorithms for Traversing , inserting, deleting elements in 6
a queue
Linked list, Representation Algorithms for traversal,
7 searching , insertion & deletion 5

8 Header linked list, Two way lists 5

9 Sorting techniques & Algorithms 9

10 Searching techniques & Algorithms 9

Trees, Representation, Binary trees, Algorithms and


11 7
examples
12 Infix, Prefix and Postfix Traversal in a binary tree 7

13 Insertion and deletion in binary tree 7

14 Introduction to Graph 8

15 Revision

16 End Semester Exam

You might also like