Scribd
Upload
198 views

Course Name: Data Structure and Algorithms Course Code: CS224 Credit HRS: 04 Pre-Requisite: CS214 Course Introduction and Objective

This document summarizes a course on data structures and algorithms. The 4 credit hour course has CS214 as a pre-requisite and introduces students to basic data structures like arrays, stacks, queues, linked lists, trees, and graphs. Assessment includes assignments, seminars, quizzes, a midterm exam worth 25% and a final exam worth 50%. The course covers various topics related to data structures and algorithms over 16 weeks including data types, linear and non-linear data structures, basic operations, arrays, searching, sorting, stacks, queues, linked lists, trees, traversing trees, and graphs. Reference books are also provided.

Uploaded by

asad
Copyright
© © All Rights Reserved
198 views

Course Name: Data Structure and Algorithms Course Code: CS224 Credit HRS: 04 Pre-Requisite: CS214 Course Introduction and Objective

This document summarizes a course on data structures and algorithms. The 4 credit hour course has CS214 as a pre-requisite and introduces students to basic data structures like arrays, stacks, queues, linked lists, trees, and graphs. Assessment includes assignments, seminars, quizzes, a midterm exam worth 25% and a final exam worth 50%. The course covers various topics related to data structures and algorithms over 16 weeks including data types, linear and non-linear data structures, basic operations, arrays, searching, sorting, stacks, queues, linked lists, trees, traversing trees, and graphs. Reference books are also provided.

Uploaded by

asad
Copyright
© © All Rights Reserved
You are on page 1/ 5

Course Name: Data Structure and Algorithms

Course Code: CS224

Credit Hrs: 04

Pre-requisite: CS214

Course introduction and objective

Welcome to the course of data structure. Data structure is very important


subject as the topics covered in it will be encountered by you again and again in
the future courses. By completing this course you will be able to understand the
basics of Data Structures. You will also know the elementary Data Structures. At
the end of this course you will be able to implements these data structure
techniques using any programming language like C++ etc.

Method of Instruction
The method of instruction will be lecture, class discussion, project/assignments
and online activities.

Examination

The scheme of examination shall be divided into three parts

Internal assessments, Includes assignments, seminars, case studies, quizzes, viva


etc

Midterm examination and Final Examination

Internal assessments 25 marks

Midterm exam 25 marks

Final exam 50 marks


______________________________
Total 100 marks
Week Wise Contents

Week -1
Introduction to Data
Field, Data item, Records
Data Vs Information
Definition of Data Structure
Linear Data Structure
Non Linear Data Structure
Logical & Physical Data Structure
Week-2
Introduction to Algorithms
Algorithmic Notations
Control Structure of Algorithms
Sequential Flow
Conditional Flow
Iterative/Repetitive Flow
Week-3
Introduction to the Basic Operations of Data Structure
Insertion
Deletion
Traversing
Searching
Sorting
Merging
Week-4
Introduction to Arrays
Types of Arrays
One Dimensional Array
Two Dimensional Arrays
Algorithm for traversing one Dimensional Array
Algorithms for insertion & deletion in one Dimensional Array
Accessing One Dimensional array by Dope Vector method
Representation of One Dimensional array in computer memory
Week-5
Introduction to Two Dimensional Arrays
Accessing two Dimensional array by Dope Vector method
Representation of One Dimensional array in computer memory
Row-by row method
Column-by-column method
Week-6
Introduction to Searching
Types of Searching
Linear Search
Binary Search
Algorithm for Linear Search
Algorithm for Binary Search
Week-7
Introduction to Sorting
Bubble Sort
Selection Sort
Insertion Sort
Week-8
Algorithms for Bubble, Selection & Insertion Sort
Week-9
Introduction to Stack
Operations on Stack
Push Algorithm
Pop Algorithm
Week-10
Introduction to Queue
Operations on Queue
Push Algorithm
Pop Algorithm
Introduction to De-queue
Week-11-12
Introduction to Linked List
Operations on Linked List
Insertion Algorithm
Deletion Algorithm
Week-13
Introduction to Trees
Terminologies used in tree
Similar and Copies trees
Binary Trees
Binary Tree Vs General Tree
Week-14
Types of Binary trees
Strictly binary tree
Complete binary tree
Operations on Binary Tree
Making of Binary Tree
Insertion in Binary Tree
Deletion from Binary Tree
Week-15
Traversing of General Tree
Level by Level
Pre Order
Post Order
Traversing of Binary Tree
Pre Order
In Order
Post Order
Notations and Expressions and it’s inter conversion
Week-16
Introduction to Graphs
Graph Terminologies
Graph Types
Link representation of graph

Reference Book:

1. Data Structure By Seymour Lipschutz, Schaum’s Outline Series

2. Data Structure and Algorithms by Alfred V. Aho, John E. Hofcroft, Jeffery


D. Ullman
3. Data Structures (A Practical Approach) By G.S BALUJA

You might also like