CS-201 Data Structures and Algorithms
Projects List (CS-2015)
1. Banking Management System:
Banking Record System is a simple database project. It will use file handling mechanism. The
record of the customer can be added, updated, searched and deleted. It

National University of
Computer & Emerging
Sciences
Shortest Paths
Shortest Path Problems
How can we find the shortest route between two
points on a road map?
Model the problem as a graph problem:
Road map is a weighted graph:
vertices = cities
edges =

#include<string>
#include <iostream>
using namespace std;
int main()
cfw_
int day,month,year=0;
string Month;
cout<"Enter the day ";
cin>day;
cout<"Enter the month ";
cin>month;
cout<"Enterthe year ";
cin>year;
switch (month)
cfw_
case 1:
Mon

Quiz Data Warehousing
Name:_ Roll#:_ Section:_
Runners Magazine
Runners Magazine wants to develop a data warehouse to keep track of runners and their records.
When runners compete in a race event in a meet (a meet is like a tournament), the magazine
calcu

FAST- National University of Computer and
Emerging Sciences
CFD Campus
Data Structures
List ADT & Linked Lists
Maria Maqsood
[email protected]
Lecture No. 3b
Inefficiency of Array-Implemented List
Insert(), erase() functions inefficient for dynamic

FAST- National University of Computer
and Emerging Sciences
CFD Campus
Data Structures
Linked Lists, Doubly Linked List
Maria Maqsood
[email protected]
Lecture No. 5
Linked Lists - Advantages
Access any item as long as external link to first
item m

Data Structures
Program Efficiency
&
Complexity Analysis
Maria Maqsood
[email protected]
Lecture No. 2
Algorithm Review
An algorithm is a definite procedure for solving a problem in
finite number of steps
Algorithm is a well defined computational

FAST- National University of
Computer and Emerging
Sciences
CFD Campus
Data Structures
Queues
Adnan Waheed
[email protected]
Lecture No. 8
Quiz#3
Stack Data structures in array implementations for each step in the
following sequence: push(T), push(G)

FAST- National University of Computer
and Emerging Sciences
CFD Campus
Data Structures
Tree
Maria Maqsood
[email protected]
Lecture No. 11
Trees
Hierarchical data structure
Examples:
Indexes in a book have a shallow tree structure
A family tree

FAST- National University of Computer
and Emerging Sciences
CFD Campus
Data Structures
List ADT & Linked Lists
Maria Maqsood
[email protected]
Lecture No. 4
Inefficiency of Array-Implemented List
Insert(), erase() functions inefficient for dynamic

FAST- National University of Computer and
Emerging Sciences
CFD Campus
Data Structures
Recursion
Maria Maqsood
[email protected]
Lecture No. 9
Introduction to Recursion
Introduction to Recursion
So far, we have seen methods that call other
functions

Queues
National University of
Computer & Emerging
Sciences
Queues
FAST, National University of Computer and Emerging Sciences, Islamabad
Queues
Queues
A Queue is a special kind of list, where items are
inserted at one end (the rear) And deleted at the
oth

Graphs
National University of
Computer & Emerging
Sciences
Graphs
FAST, National University of Computer and Emerging Sciences, Islamabad
Graphs
Graphs - Introduction
The Graph Data Structure
set V of vertices
collection E of edges
(pairs of vertices in V)

Roll No:
Time Allowed: 30mins
Data Warehousing CS 2016-03 ISB
Important Note: Students will be marked on the basis of their understanding. For
example, if we look at question 6, if the student is able to word their answer such that it
fits into the proper

National University of
Computer & Emerging
Sciences
Minimum Spanning Trees
Spanning Trees
A spanning tree of a graph is just a subgraph that
contains all the vertices and is a tree.
A graph may have many spanning trees.
Graph A
Some Spanning Trees from Gr

Lecture 2: Abstract Data Types
Abstract Data Types
1
FAST, National University of Computer and Emerging Sciences, Islamabad
Lecture 2: Abstract Data Types
Some basic questions
What is an integer?
What are the operations that can be performed
on Integers

Data Structures (CS-201) Spring 2017
National University of Computer and Emerging Sciences, Lahore
Section A, B
Assignment # 2
Arrays Mapping and Stacks
Submission Dead Line: Thursday 16/2/2016
(Rat in a Maze)
Points: 50
1. You have to implement a Stack u

Experiment # 11
Binary Heap & Heap Sorting
Objective:The objective of this session is to understand the concepts of heap Trees and heap sort .
Software Tools:1. DevC+11
Theory:A heap is a certain kind of complete binary tree.
Heap is a special case of bal

Divide and Conquer
(Merge Sort)
By:
Anam Rafique
Divide and Conquer
Recursive in structure
Divide the problem into sub-problems that are
similar to the original but smaller in size
Conquer the sub-problems by solving them
recursively. If they are small

Circular Linked
Lists
By:
Anam Rafique
Circular Linked List
Single linked list: Every node points to its next
node in the sequence and the last node points
NULL.
Circular linked list: Every node points to its
next node in the sequence but the last node

Doubly Linked List
Doubly-Linked Lists
It is a way of going both directions in a
linked list, forward and reverse.
Many applications require a quick access
to the predecessor node of some node in
list.
Advantages over Singly-linked Lists
Quick update o

Doubly Linked List
Doubly-Linked Lists
It is a way of going both directions in a
linked list, forward and reverse.
Many applications require a quick access
to the predecessor node of some node in
list.
Advantages over Singly-linked Lists
Quick update o

Program Efficiency
&
Complexity Analysis
Lecture-3
Algorithm Review
An algorithm is a definite procedure for solving
a problem in finite number of steps
Algorithm is a well defined computational
procedure that takes some value (s) as input,
and produces

Stacks
By
Anam Rafique
Stack
A stack is a data structure that stores data in such
a way that the last piece of data stored, is the first
one retrieved
also called last-in, first-out
Only access to the stack is the top element
consider trays in a cafet

List ADT & Linked Lists
List
AFlexiblestructure,becausecangrowandshrinkondemand.
Elementscanbe:
Inserted
Accessed
Deleted
Atanyposition
List
Listscanbe:
Concatenatedtogether.
Splitintosublists.
List
AListisasequenceofzeroormore
elementsofagiventype(s

Array Problems
1. Read in 10 ints from the keyboard, and store them in an array. Find the maximum and
minimum values in the array, and display them on the screen.
2. Read in 10 ints from the keyboard, and store them in an array. Find the position (or
inde

Lecture 6 - Linked List and Variations
L
I
S
T
A
D
T
List ADT & Linked Lists
FAST, National University of Computer and Emerging Sciences, Islamabad
Lecture 6 - Linked List and Variations
Roadmap
List as an ADT
An Array-Based Implementation of Lists
Introd

Data Structures (CS-201) Spring 2017
National University of Computer and Emerging Sciences, Lahore
Section A, B
Assignment # 5
2-3 Trees
Submission Dead Line: 11/4/2017
Question 1:
Write a C+ class to implement 2-3 tree. The class shall provide the follow