Scribd
Upload
30 views

Data Structures-Course Outline

This 3 credit course covers commonly used data structures like arrays, linked lists, stacks, queues, trees, and graphs. Students will learn how to store, retrieve, and manipulate data using these structures. Various searching and sorting algorithms will also be discussed along with their time complexities. Grading is based on exams, assignments, quizzes, labs, and a semester-long group project requiring the use of data structures and algorithms. Labs help students implement data structures practically.

Uploaded by

M Waqas Ashraf
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
30 views

Data Structures-Course Outline

This 3 credit course covers commonly used data structures like arrays, linked lists, stacks, queues, trees, and graphs. Students will learn how to store, retrieve, and manipulate data using these structures. Various searching and sorting algorithms will also be discussed along with their time complexities. Grading is based on exams, assignments, quizzes, labs, and a semester-long group project requiring the use of data structures and algorithms. Labs help students implement data structures practically.

Uploaded by

M Waqas Ashraf
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Data Structures (CS 201) CS Core

Data Structures (CS201) BS (CS Core)


Instructor: Shaukat Wasi Credit Hours: 3+1 Pre-requisite: Computer Programming

Objective:
The purpose of this course is to give students a detailed coverage of different data structures that form the foundation of any information systems. Usage of these data structures to store, retrieve and manipulate data and their applications and trade-offs involved in different scenarios will be covered in detail. Different searching and sorting algorithm are also discussed along with their complexity analysis and pros & cons in different situations.

Syllabus:
Introduction to Course and Conduct Object Oriented Programming - Recap Arrays Linked Data Structures Elementary Sorting Techniques Advanced Sorting Techniques Stack/Queues/ Priority Queues Trees/Binary Trees/BST/AVL Trees/B-Trees Graphs/ Non-Liner Data Structures Graph Algorithms

Text books:
1. Data Structures, Algorithms and OOP BY: Gory L. Heileman

Reference books:
1. Data Structures and Algorithms in C++ BY: Adam Drozdek 2. Algorithms and Data Structures in C++ by Leendert Ammeraal 3. C++ Data Structures BY: Dale 3rd Edition

-1-

Data Structures (CS 201) CS Core

Grading:
Terminal Exams Assignments Quizzes + Labs Project Final 10%+10% 15% 5% 10% 50%

Projects:
Semester project is requirement of this course. Project will be done in group of 3 members. Key requirement of project is to develop an application containing extensive use of data structures and algorithms.

Labs:
Labs are regularly conducted in this course to give students a practical coverage of contents covered in class lectures. Implementation of all the data structures discussed in theory would help students in enhancing their vision and simulation of complex data structures for their projects.

-2-

You might also like