Department of Computer Science & Engineering

DATA STRUCTURES AND PROGRAM DESIGN IN ‘C’

(44CS2)

II B E – IV Semester [Branch: CSE]

Ms. Sana Sheikh

Lecturer

Guru Nanak Institute of Engineering & Technology

Dahegaon , Kalmeshwar Road, NAGPUR– 441501 ( M.S.)
Results Target

Total Strength of the Class: 66

S. No Class / Division No. of Students

a. First Class with Distinction 20
b. First Class 40
c. Pass Class 06

Course Plan

S. No Plan Brief Description

a. Class Lectures 53 Lectures

b. Tutorials
10 class
c. Presentations 10 class
d. Demonstration 10 class
e. Models / Mini Projects Nil

Method of Evaluation

a. Internal Examination
b. Unit Wise Assignments
c. Descriptive Exam
d. Final Examination

Page: 2
Course Objective

– To learn the concepts of program design.

– To understand the principle of working of Data Structure.

– To understand the behaviour and properties of programming logic.

– To understand the characteristic and properties of different algorithms.

Page: 3
 RTMNU Syllabus II Year B.E. IV- Semister
DATA STRUCTURES & PROGRAM DESIGN IN C (44CS2)

DATA STRUCTURES & PROGRAM DESIGN IN C – SYLLABUS

General concept and linear data structure: Abstract data structure as an organization of data with
specified properties and operations, Time and space analysis of algorithms, Big oh and theta
notations and omega notations. Average, best and worst case analysis, Representation of Arrays
UNIT-1 – single and Multi dimensional – Address calculation using column and row major ordering.
Representation of stacks and queues using arrays- Circular queues, Dequeue, Application of
stacks, Conversion from infix to post fix and pre-fix expression, Evaluation of postfix expression
using stacks, Multiple stacks.

Linked list : Linked lists, Simply linked list Implementation of linked list using and dynamic
memory allocation-dynamic memory allocation, operation on list linked stacks and queues,
UNIT-2 polynomial representation and manipulation are using linked list, circular linked list, doubly
linked list, Generalized list.

Trees: General and binary trees, Representations and traversals, General tress as binary trees,
UNIT-3 Binary search trees, Application, the concept of balancing and its advantages, B-trees, B+ Trees,
AVL Trees, Threaded Binary Trees.

UNIT-4 Hashing : Hash functions, Collision resolution, Expected behavior, Application

Graphs and digraphs : Representations, Breadth and depth first searches, Connectivity
UNIT-5 algorithms, shortest path, Minimal spanning tree, the union find problem, Hamilton path

Sorting : Elementary sorts : selection , insertion, bubble sort, Radix sort, Quick sort, merge sort,
UNIT-6 heap sort, Bucket sorting, External sorting, Worst case and average behavior, Lower bound for
sorting using comparisons

Page: 4
Guidelines to Students

• Read the syllabus and other online class material.

• HOWEVER, few more text-books will be used for everything that will be covered in
the class.

• Lecture attendance is important.

• Timely submission of assignments is essential.

Page: 5
 Books / Material

Text Books (to be acquired by the Students)

Book 1 Data structure using C by Tenebaum, Pearson Education
Book 2 Data structure through C by G. S. Baluja

Reference Books
Book 3 Expert Data Structurees using c/c++ by Sagar Abhishek
Book 4 Data structure – Robert Kruse

Web Sites
a
. http://www.academictutorials.com/data-structure/

Page: 6
 Course Schedule

Distribution of Hours Unit – Wise

Subject DATA STRUCUTURES & PROGRAM DESIGN IN C
Faculty Ms. Sana Sheikh

Chapters No of
Unit Topic
Book 1 Book 2 Book 3 Classes
Stacks Fundamentals,
Chapter
I Queues Fundamentals, 14
1,2,12
Asymptotic Notations
Linked Lists , Polynomial Chapter
II 11
Operation Generalized list. 3,4
Trees, Binary Tree, B-
Chapter
III Trees, B+ Trees, AVL 09
5,7
Trees
Hashing Techniques, Chapter
IV 04
Collision handling 8,10
Graphs, Breadth first Chapter
search, Depth first search, 12
V 07
Minimum cost spanning
tree.
Selection , Bubble sort, Chapter
Insertion, Quick sort, 13
VI Chapter12 08
Merge, Radix sort,Heap,
Bucket sort, External sort
53
Total

Contact classes for Syllabus coverage:53 : Tutorial Classes : 10 :

Online Exams : 00 ; Descriptive Tests : 02 ;
Revision classes :02 ; Subjective Tests 02 ;
Classes for Subject coverage above curriculum :01
Total Classes

Page: 7
Lecture Plan (Topic wise Coverage)

UNIT - 1
Lecture Reference
Date Topic
No. [Book – 1]
1. 29/11/10 Introduction C programming Chapter 1

2. . 30/11/10 Basic Programming of Structures Chapter 1

Introduction to algorithms: Analysis of
3. 01/12/10 Chapter 1
algorithms
The asymptotic notations, Features of
4. . 02/12/10 Chapter 1
structured program
Arrays – Address calculation using column
5. 03/12/10 Chapter 2
and row
6. 04/12/10 Stacks Fundamentals Chapter 2

7. 05/12/10 Evaluation of expression using stacks Chapter 2

Conversion from infix to post fix and pre-
8. 06/12/10 Chapter 2
fix expression
9. 07/12/10 Application of stack Chapter 2

10. 08/12/10 Queues Fundamentals Chapter 2

11. 09/12/10 Circular queues Chapter 2

12. 10/12/10 Priority Queues Chapter 2

13. 11/12/10 Dequeue Chapter 2

14. 12/12/10 Programming Examples(more) Chapter 2

UNIT -2
Lecture Reference
Date Topic
No. [Book – 1]
15. 13/12/10 Linked list: single linked list Chapter 2

16. 14/12/10 Concept of single linked list Chapter 2

17. 15/12/10 Programming based on single linked list Chapter 2

18. 16/12/10 Linked stacks and queues Chapter 3

19. 17/12/10 The polynomial addition Chapter 3

20. 18/12/10 Examples on linked list Chapter 3

21. 19/12/10 Circular linked list Chapter 3

Page: 8
 22. 20/12/10 Doubly linked list Chapter 3

23. 21/12/10 Generalized list Chapter 3

24. 22/12/10 Programming Examples(more) Chapter 3

25. 23/12/10 Programming Examples(more) Chapter 3

UNIT - 3
Lecture Reference
Date Topic
No. [Book – 1,2]
26. 24/12/10 Trees: Definition and Terminology Chapter 4

27. 25/12/10 Representation Chapter 4

28. 26/12/10 Tree Traversal examples on trees Chapter 4

29. 27/12/10 Binary Tree Chapter 4

30. 28/12/10 Threaded Trees, Chapter 4

31. 29/12/10 B-Trees and B+ trees Chapter 4

32. 30/12/10 AVL Trees Chapter 4, 6

33. 31/12/10 Threaded Binary Trees. Hamilton path Chapter 4, 6

34. 01/01/11 Programming Examples(more) Chapter 4, 6

UNIT - 4
Lecture Reference
Date Topic
No. [Book –1,2]
35. 02/01/11 Hash functions Chapter5
Hashing techniques and collision handling
36. 03/01/11 Chapter 5
mechanism
37. 04/01/11 Application Chapter 5

38. 05/01/11 Programming Examples(more) Chapter 8

UNIT - 5
Lecture Reference
Date Topic
No. [Book – 2]
39. 06/01/11 Graphs and their applications Chapter 8

40. 07/01/11 Computer representation of graphs Chapter 8

41. 08/01/11 Traversal techniques like Breadth first search Chapter 8

Page: 9
 42. 09/01/11 Depth first search. Chapter 8
Greedy algorithms-study with respect to
43. 10/01/11 Chapter 9
shortest path
44. 11/01/11 Minimum cost spanning tree. Chapter9

45. 12/01/11 Programming Examples(more) Chapter 9

UNIT - 6
Lecture Reference
Date Topic
No. [Book – 1,2]
46. 13/01/11 Sorting methods Chapter 10

47. 14/01/11 Selection , Bubble sort Chapter 10

48. 15/01/11 Insertion, Quick sort Chapter 10

49. 16/01/11 Merge, Radix sort Chapter 10

50. 17/01/11 Heap, Bucket sort Chapter 10

51. 18/01/11 External Sorting Chapter 10

Worst case and average behavior Different
52. 19/01/11 Chapter 11
Sort
53. 20/01/11 Programming Examples(more) Chapter 11

Page: 10
Actual Date of Unit Completion & Remarks

Unit – 1

Date : __ / __ / ____
Remarks:

Unit – 2

Date : __ / __ / ____
Remarks:

Unit – 3

Date : __ / __ / ____
Remarks:

Unit – 4

Date : __ / __ / ____
Remarks:

Unit – 5

Date : __ / __ / ____
Remarks:

Unit – 6

Date : __ / __ / ____
Remarks:

Page: 11
Assignments

(44CS2) DATA STRUCTURES & PROGRAM DESIGN IN C

Week – 1 Define : Algorithm and Flowchart.
Write down application of Linked list
Write a program to create linked list
2
Week – 3 Write a program to insert element in created linked list
Write a program to delete element in created linked list
Write a program to search element in created linked list
3
Week – 4 Write programs to illustrate the concept of evaluation of expression
(postfix,prefix,infix)
Week –5 Write algorithm and functions for following options:
1. Selection sort
2. Bubble sort
3. Quick sort
4. Merge sort
5. Heap sort
6
Week – 6 Explain different Hashing methods

Week – 7 What do you mean by searching(Explain any 2 methods)

8.
9.
Week – 8 programs based on trees
10.
Week – 9 Write a program to implement DFS

Week – 10 Write a program to implement BFS

12

Page: 12
Assignments [minimum of one per unit]

Unit – 1

Date of Submission : __ / __ / ____

Date of Valuation of Assignments : __ / __ / ____

Unit – 2

Date of Submission : __ / __ / ____

Date of Valuation of Assignments : __ / __ / ____

Unit – 3

Date of Submission : __ / __ / ____

Date of Valuation of Assignments : __ / __ / ____

Unit – 4

Page: 13
 Date of Submission : __ / __ / ____

Date of Valuation of Assignments : __ / __ / ____

Unit – 5

Date of Submission : __ / __ / ____

Date of Valuation of Assignments : __ / __ / ____

Unit – 6

Date of Submission : __ / __ / ____

Date of Valuation of Assignments : __ / __ / ____

Page: 14
Tutorial [as many planned per unit]

DATA STRUCTURES AND PROGRAM DESIGN IN ‘C’

1 Stacks Fundamentals.
2 Queues Fundamentals
3 Linked List: Single linked list, Circular linked list, Doubly linked list
4 Tree Traversal examples on trees
5 Binary Tree
6 Threaded Binary Trees
7 Hash Functions
8 Depth First search.
9 Breadth First search
10 Sorting Methods

Question Bank for university Exam

Section A

Que1.Write a procedure PUSH to add an element in a stack and procedure POP to delete an
element from the stack.
Que2. Define Algorithm. Also specify various characteristic that every algorithm must satisfy to
accomplish a particular task.
Que3. Write a procedure to insert and delete node into circular linked list.
Que4. Discuss the methods of dynamic memory allocation. State their advantage and
disadvantage.
Que5.Write a procedure to check weather two linked list are equal or not.
Que6. Draw the tree, represented for the following prefix expression:
1 )*a + b * c – d e
2 )* a + b – c d e

Page: 15
Section B
Que 1. Using Division method of hashing for a table of size 11 ,store the following numbers in
hash table:
22, 45, 96, 101, 162, 197 ,201
Use suitable method for handling collisions.
Que2. Write a short note on threaded binary trees.
Que3. Explain with suitable example implementation of open hash table and close hash table.
Que4. For the following diagraph obtain
I) The indegree and outdegree of each vertex.
II) Its adjacency matrix.
III) Its adjacency list representation.
IV) Its adjacency multi list representation.
V) Its strongly connected component.

2 5

1
4 7

6
3

Que 5. Define the following :-

I) Complete graph.
II) Degree of the graph.
III) Path of the graph.
IV) Strongly connected component.
Explain each term with suitable example.
Que6.Write a function to implement heap sort .
Specify its complexity. Explain with suitable example.

Page: 16
Assignment Valuation Sheet
Sr.No Student ID.No. Name of Student 1 2 3 4 5 6

Sr.No Student ID.No. Name of Student 1 2 3 4 5 6

1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

15.

16.

17.

18.

19.

20.

21.

Page: 17
22.

23.

24.

25.

26.

27.

28.

29.

30.

31.

32.

33.

34.

35.

36.

Page: 18
 Descriptive Exam Valuation Sheet
SR. NO Student ID No. NAME OF THE STUDENT 1 2 3 4 5 6
1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

15.

16.

17.

18.

19.

20.

21.

22.

23.

24.

25.

26.

27.

28.

29.

30.

Page: 19
SL NOSL NOStudent
ROLL
ID No.
NO NAME OF THE
NAME STUDENT
OF THE STUDENT 1 2 3 1 42 35 4 6 5
61.

62.

63.

64.

65.

66.

Page: 20
Attendance as per Internal

SR.NO STUDENT ID 1 2 3 4 5 6
NAME OF STUDENT
. NO.
1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

15.

16.

17.

18.

19.

20.

21.

Page: 21
22.

23.

24.

25.

26.

27.

28.

29.

30.

Page: 22
Page: 23
SL NO Student ID No. NAME OF THE STUDENT 1 2 3 4 5

1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

15.

16.

17.

18.

19.

20.

21.

22.

23.

24.

25.

26.

27.

28.

29.

30.

Page: 24
SL NO ROLL NO NAME OF THE STUDENT
67.

68.

69.

70.

71.

72.

Page: 25
Marks for Internal Theory Examination

SR.NO STUDENT ID 1 2 3 4 5 6
NAME OF STUDENT
. NO.
1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

15.

16.

17.

18.

19.

20.

21.

22.

Page: 26
23.

24.

25.

26.

27.

28.

29.

30.

Page: 27
Page: 28
SL NO Student ID No. NAME OF THE STUDENT 1 2 3 4 5

1.

2.

3.

4.

5.

6.

7.

8.

9.

10.

11.

12.

13.

14.

15.

16.

17.

18.

19.

20.

21.

22.

23.

24.

25.

26.

27.

28.

29.

30.

Page: 29
SL NO ROLL NO NAME OF THE STUDENT

31.

32.

33.

34.

35.

36.

Page: 30
Revision Topics

Guest Lectures

Weak Students As per Descriptive Exam

Roll No Name %

Page: 31
 Attendance Defaulters

Time Table

GURUNANAK INSTITUTE OF ENGINEERING & TECHNOLOGY,

NAGPUR

DEPARTMENT OF COMPUTER SCIENCE & INFORMATION TECHNOLOGY

INDIVIDUAL TIME TABLE
Session 2009-10 (EVEN)

Lecturer Name:- Prof. R. Asati W.E.F. – 27/11/2009

Sports/ Lib/ Break/Internet11:30 – 12:00

Class 1 2 3 4 5 6
H
o 09:30-10:30 10:30-11:30 12:00-1:00 1:00-2:00 2:15-3:15 3:15-4:15
Short Break2:00-2:15

MON u

TUE

WED
THU
FRI

SAT

Theory Load: 09 Practical Load: 08 Total

Load: 17

Page: 32
Advanced Topics

Page: 33
SNO
Page: 34