Scribd
Upload
45 views2 pages

Department of Computer Science University of Karachi

This document outlines the course contents, lecture topics, and lab schedule for a Data Structures course. The course will cover fundamental data structures like arrays, linked lists, stacks, queues, trees, graphs and their applications. Fifteen lectures are scheduled to cover these topics along with algorithms, complexity analysis, sorting, and searching. The accompanying lab sessions will provide hands-on practice implementing and analyzing various data structures.

Uploaded by

wardha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
45 views2 pages

Department of Computer Science University of Karachi

This document outlines the course contents, lecture topics, and lab schedule for a Data Structures course. The course will cover fundamental data structures like arrays, linked lists, stacks, queues, trees, graphs and their applications. Fifteen lectures are scheduled to cover these topics along with algorithms, complexity analysis, sorting, and searching. The accompanying lab sessions will provide hands-on practice implementing and analyzing various data structures.

Uploaded by

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

Department of Computer Science

University of Karachi

Teacher Name: Muhammad Saeed Room # _____


Course No: BSCS-402 Course Title: Data Structures

1. Course Contents (From Syllabus)


Introduction, Basic Terminology, Elementary Data Organization, Data Structure, Data Structure
Operations, Algorithms, Preliminaries, String Processing, Arrays, Records and Pointers, Linked
Lists, Stacks, Queues, Recursion, Trees, Graphs and their Applications, Sorting and Searching.

2. Lecture wise breakup

Lecture # Topic Details


Why data structures?, link with the other fields,
1 Introduction
overview of the course, etc
Why and when arrays are used? Memory
2 Arrays management of single and multi dimensional (row
and column major arrangements) arrays.
Why and when linked lists. Link list operations
3 Linked lists
(append, insert, delete)
Linked list and array implementation of Stacks,
4 Stacks
Applications (expression parser)
Linked list and array implementation of Queues,
5 Queues
Applications (tree traversals)

6 Complexity Analysis Time calculations, upper and lower bounds, big O

7 Trees Basic concepts, Tree Traversals, n-ary trees

8 Trees Binary Search Trees and their applications

9 Trees AVL Trees

10 Hashing Hash functions, open and closed hashing


Insertion, shell, quick sorts with complexity
11 Sorting
analysis
Linear and binary searching with complexity
12 Searching
analysis
13 Graphs Basic concepts, Topological Sort

14 Graphs Shortest path algorithms (Dijkstra’s)

15 Graphs Minimum Spanning Trees (Prim’s, kruskal’s)

Books:
1. Data Structures and Algorithm Analysis in C/C++ “Mark Allen Weiss”
2. E-Book “Data Structures and Algorithms with Object-Oriented Design Patterns in C#”
Lab schedule

Lab # Topic Details


1 Overview of C/C++ Revision of C/C++ Programming, Pointers
2 Arrays Implementation of multidimensional arrays
(row/column major) using a single dimensional
array. Changing size of array at runtime
3 Linked lists Implementation of Link list operations append,
insert, delete etc
4 Stacks Implementing stacks using linked list and array
5 Queues Implementing queues using Linked list and array
6 Stack Applications Expression Tress
7 Trees n-ary Tree manipulation
8 Trees Implementing Binary Search Trees (remaining
portion as assignment)
9 Trees Implementing AVL Trees (remaining portion as
assignment)
10 Hashing Hash functions, open and closed hashing
11 Sorting Insertion, shell, quick sorts with complexity
analysis
12 Searching Linear and binary searching with complexity
analysis
13 Graphs Graph manipulation
14 Final Lab Assignment submission + Lab Group 1
15 Final Lab Assignment submission + Lab Group 2

You might also like