Dspd Cse-4 Course File 09-10

Department of Computer Science & Engineering

DATA STRUCTURES AND PROGRAM DESIGN IN ‘C’ (44CS2)

II B E – IV Semester [Branch: CSE]

Ms. Sana SheikhLecturer

Guru Nanak Institute of Engineering & TechnologyDahegaon , 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. Tutorials10 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

UNIT-1

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 – 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.

UNIT-2

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, polynomial representation and manipulation are using linked list, circular linked list, doubly linked list, Generalized list.

UNIT-3

Trees: General and binary trees, Representations and traversals, General tress as binary trees, 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

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

UNIT-6

Sorting : Elementary sorts : selection , insertion, bubble sort, Radix sort, Quick sort, merge sort, 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

Unit TopicChapters No of

ClassesBook 1 Book 2 Book 3

IStacks Fundamentals, Queues Fundamentals, Asymptotic Notations

Chapter 1,2,12

14

IILinked Lists , Polynomial Operation Generalized list.

Chapter 3,4

11

IIITrees, Binary Tree, B-Trees, B+ Trees, AVL Trees

Chapter 5,7

09

IVHashing Techniques, Collision handling

Chapter 8,10

04

V

Graphs, Breadth first search, Depth first search, Minimum cost spanning tree.

Chapter 12

07

VI

Selection , Bubble sort, Insertion, Quick sort, Merge, Radix sort,Heap, Bucket sort, External sort

Chapter 13 Chapter1

208

Total

53

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 - 1Lecture

No.Date Topic Reference

[Book – 1]

1. 29/11/10 Introduction C programming Chapter 1

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

3. 01/12/10Introduction to algorithms: Analysis of algorithms

Chapter 1

4. . 02/12/10The asymptotic notations, Features of structured program

Chapter 1

5. 03/12/10Arrays – Address calculation using column and row

Chapter 2

6. 04/12/10 Stacks Fundamentals Chapter 2

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

8. 06/12/10Conversion from infix to post fix and pre-fix expression

Chapter 2

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 -2Lecture No.

Date Topic Reference[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

22. 20/12/10 Doubly linked list Chapter 3

Page: 8

23. 21/12/10 Generalized list Chapter 3



UNIT - 3Lecture


[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 - 4Lecture No.

Date Topic Reference[Book –1,2]

35. 02/01/11 Hash functions Chapter5

36. 03/01/11Hashing techniques and collision handling mechanism

Chapter 5

37. 04/01/11 Application Chapter 5


UNIT - 5Lecture No.

Date Topic Reference[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

42. 09/01/11 Depth first search. Chapter 8

43. 10/01/11Greedy algorithms-study with respect to shortest path

Chapter 9

Page: 9

44. 11/01/11 Minimum cost spanning tree. Chapter9


UNIT - 6Lecture


[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

52. 19/01/11Worst case and average behavior Different Sort

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

2Week – 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

3Week – 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 sort2. Bubble sort3. Quick sort4. Merge sort5. 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 trees10.

Week – 9 Write a program to implement DFS

Week – 10 Write a program to implement BFS12

Page: 12

Assignments [minimum of one per unit]

Unit – 1

Date of Submission : __ / __ / ____

Date of Valuation of Assignments : __ / __ / ____

Unit – 2



Unit – 3



Unit – 4



Page: 13

Unit – 5



Unit – 6



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.

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

2

1

3

4

5

6

7

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 61.

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.

31.

32.

Page: 17

33.

34.

35.

36.

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.

Page: 18

29.

30.

SL NO Student ID No. NAME OF THE STUDENT 1 2 3 4 5

SL NO ROLL NO NAME OF THE STUDENT 1 2 3 4 5 6

61.

62.

63.

64.

65.

66.

Page: 19

Attendance as per Internal

SR.NO.

STUDENT ID NO.

NAME OF STUDENT1 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.

Page: 20

30.


31.

32.

33.

34.

35.

36.

37.

38.

39.

40.

41.

42.

43.

44.

45.

46.

47.

48.

49.

50.

51.

52.

53.

54.

55.

56.

57.

58.

Page: 21

59.

60.

SL NO ROLL NO NAME OF THE STUDENT

67.

68.

69.

70.

71.

72.

Page: 22

Marks for Internal Theory Examination

SR.NO.

STUDENT ID NO.

NAME OF STUDENT1 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: 23


31.

32.

33.

34.

35.

36.

37.

38.

39.

40.

41.

42.

43.

44.

45.

46.

47.

48.

49.

50.

51.

52.

53.

54.

55.

56.

57.

Page: 24

58.

59.

60.

SL NO ROLL NO NAME OF THE STUDENT

61.

62.

63.

64.

65.

66.

Page: 25

Revision Topics

Guest Lectures

Weak Students As per Descriptive Exam

Roll No Name %

Page: 26

Attendance Defaulters

Time Table

GURUNANAK INSTITUTE OF ENGINEERING & TECHNOLOGY, NAGPUR

DEPARTMENT OF COMPUTER SCIENCE & INFORMATION TECHNOLOGY

INDIVIDUAL TIME TABLESession 2009-10 (EVEN)

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

Class Hour Time

1 2

11:3

0 –

12:0

0S

por

ts/ L

ib/ B

reak

/In

tern

et

3 4

2:00

-2:1

5S

hor

t B

reak

5 6

09:30-10:30 10:30-11:30 12:00-1:00 1:00-2:00 2:15-3:15 3:15-4:15

MON

TUE

WED

THU

FRI

SAT

Theory Load: 09 Practical Load: 08 Total Load: 17

Page: 27

Advanced Topics

Page: 28

CONTENTS OF COURSE FILE

SNO

ITEM DESCRIPTION

DATE OF VERIFICATION BY HOD

1. Result Target 2. Course Plan 3. Method Of Evaluation 4. Course Objective 5. JNTU Syllabus 6. Guidelines to students 7. Books/Materials 8. Course Schedule 9. Lecture Plan 10. Actual date of unit

completion

11. Assignment Problem 12. Tutorials 13. Question Bank for

university exam

14. Assignment valuation sheet

15. Descriptive Examinations Valuation sheet

16. Attendance as per internal 17. Marks for internal theory

Examinations

18. Revision topics 19. Guest lecture 20. Weak Student List(as per

descriptive exam)

21. Weak student list (as per university exam)

22. Attendance Defaulters 23. Time Table 24. Advance Topics

Page: 29

Dspd Cse-4 Course File 09-10

Documents

Transcript of Dspd Cse-4 Course File 09-10