GOVERNMENT POLYTECHNIC, AMRAVATI

(AN AUTONOMOUS INSTITUTE OF GOVERNMENT OF MAHARASHTRA)

CURRICULUM DEVELOPMENT CELL
----------------------------------------------------------------------------------------------------------------
PROGRAMME TITLE: DIPLOMA IN COMPUTER ENGINEERING /
INFORMATION TECHNOLOGY
COURSE CODE: FC3407
COURSE TITLE: DATA STRUCTURE USING C

TEACHING SCHEME:
TOTAL CONTACT
LEVEL OF PRERE- WEEKLY TOTAL TOTAL HOURS
COURSE QUISITE CONTACT HRS. CREDITS WEEKS
L T P L T P
III FC3401 03 - 04 07 16 48 - 64

EXAMINATION SCHEME:
THEORY(Marks) PRACTICAL(Marks)
ESE ESE PA TOTAL ESE PA TOTAL
PAPER (Marks)
HRS.
3Hrs MAX. 70 30* 100 50# 25^ 175
MIN. 28 --- 40 10 10
@: Internal Assessment #: External & Internal Assessment $: Online Examination
(*) Under the Theory PA, Out Of 30 Marks, 20 Marks is the Average of Two Tests and 10 Marks are for Micro project-
(^) Under practical PA Continuous Assessment of Practical Work is to be done by Course Teacher as per CDC norms.
For the courses having only practical examination, PA has two parts (i) Continuous Assessment of Practical
work - 60% and (ii) microproject-40%.

1. RATIONALE:
Data structure is an important aspect for Computer Engineering and Information Technology
Diploma graduates. Data structure is a logical & mathematical model of storing &
organizing data in a particular way in a computer. The methods and techniques of Data
Structures are widely used in industries. After learning this subject student will be able to
identify the problem and the fundamental data structures, analyze different algorithms to
solve the problem & choose most appropriate data structure to represent the data.

2. COURSE OUTCOMES (COs)

At the end of this course, student will be able to: -
1) Perform basic operations on arrays.
2) Apply different searching and sorting techniques.
3) Implement basic operations on stack and queue using array representation.
4) Implement basic operations on Linked List.
5) Implement program to create and traverse tree to solve problems.
6) Implement basic behavior of various data structures by developing programs.

[1]
 3. DETAILED CONTENTS: THEORY

Unit Unit Outcomes (UOs) Topic and Sub-topics CO Hr Marks

(In cognitive domain) No.
1 1a. Classify the given type 1.1 Concept and need of DS, 1, 6 04 10
Introduction of Data Structures based Abstract Data Type
To Data on their characteristics.1.2 Types of Data Structures:
Structures 1b. Explain complexity of (i) Linear Data Structures
the given algorithm in (ii) Non-Linear Data
terms of time and space. Structures
1c. Explain the given 1.3 Algorithm Complexity:
operations to be (i)Time (ii)Space
performed on the given 1.4 Operations on Data
type of data structures. Structures:
(i) Traversing,
(ii)Searching,
(iii)Insertion,
(iv)Deletion,
(v) Sorting
2 2a. Explain working of the 2.1 Searching: searching an 2, 6 12 16
Searching given search method item in a data set using
And Sorting with an example. following methods:
2b. Write an algorithm to (i) Linear Search
search the given key (ii) Binary Search
using binary Search 2.2 Sorting: sorting of data set
method. in an order using following
2c. Write an Algorithm to methods:
sort data using a (i) Bubble Sort
specified sorting (ii) Selection Sort
method. (iii) Insertion Sort
2d. Explain the working of (iv) Quick Sort
given sorting method (v) Radix Sort.
step-by-step with an 2.3 Decision and Analysis
example and small data Fundamentals
set. - Performance Analysis
2e. Explain the - Growth of Function
mathematical Big O, Omega and
background for Theta notations
algorithm analysis using - Mathematical
Selection sort and Background for
insertion sort methods. Analysis
- Analysis of Selection
Sort & Insertion Sort
3 3a. Develop an algorithm to 3.1 Introduction to Stack 3, 6 12 16
Stacks And perform PUSH and POP - Stack representation in
Queues operations for the given memory using array
item in a Stack. - Stack as an ADT
3b. Convert the given - Stack Operations – PUSH,
expression from Infix to POP
Prefix/Postfix using - Stack Operations

[2]
 Stack. Conditions – Stack Full /
3c. Write steps to evaluate Stack Overflow, Stack
the given expression Empty / Stack Underflow.
using the stack. - Applications of Stack
3d. Develop a program to  Reversing a list
perform the given  Polish notations
operation on a linear 3.2 Conversion of infix to postfix
Queue. expression, Evaluation of
3e. Write Algorithm to postfix expression,
perform the given Converting an infix into
operations on circular prefix expression, Evaluation
queue. of prefix expression,
Recursion, Tower of Hanoi
3.3 Introduction to Queue:
- Queue representation in
memory using array
- Queue as an ADT
- Types of Queues :- Linear
Queue, Circular Queue,
Concept of Priority Queue
- Queue Operations – INSERT,
DELETE
- Queue Operations Conditions
– Queue Full, Queue Empty
- Applications of Queue
4 4a. Create relevant structure 4.1 Introduction to Linked List 4, 6 10 14
Linked List to represent the given Terminologies: node,
node using linked list. Address, Pointer,
4b. Develop algorithm to Information field / Data
insert the given item in field, Next pointer, Null
linear linked list. Pointer, Empty list.
4c. Develop algorithm to 4.2 Type of lists: Linear list,
delete the given item Circular list
from linear linked list 4.3 Operations on a singly
4d. Develop algorithm to linked list:
traverse a circular linked Traversing a singly linked list,
list. Searching a key in linked list,
Inserting a new node in a
linked list, Deleting a node
from a linked list
5 5a. Draw Binary Search 5.1 Introduction to Trees, 5, 6 10 14
Trees And Tree for the given data Terminologies: tree, degree
Graphs set. of a node, degree of a tree,
5b. Write algorithms to level of a node, leaf node,
traverse the tree using Depth / Height of a tree,
the given method. In‐degree & Out‐Degree,
5c. Construct Expression Path, Ancestor &
tree for the given data. descendant nodes
5d. Represent the given 5.2 Tree Types and Traversal
Graph using adjacency methods

[3]
 matrix and adjacency Types of Trees: General
list. tree, Binary tree, Binary
search tree (BST).
Binary tree traversal : In
order traversal, Preorder
traversal, Post order
traversal
5.3 Expression tree.
5.4 Introduction to Graph
terminologies: graph, node
(Vertices), arcs (edge),
directed graph, undirected
graph, in‐degree,
out‐degree, adjacent,
successor, predecessor,
relation, path, sink,
articulation point.
5.5 Adjacency List, Adjacency
Matrix of directed /
undirected graph.

4. LIST OF PRACTICALS:

Sr PRACTICAL OUTCOMES (PrOs) CO

No. NO.
1 Implement a ‘C’ program for performing following operations on Array: 1
Creation, Insertion, Deletion, Display
2 Implement a ‘C’ program to search a particular data from the given Array 2
using: ( i )Linear Search,
3 Implement a ‘C’ program to search a particular data from the given Array 2
using Binary Search
4 Implement a ‘C’ program to sort an array using following methods: ( i )Bubble 2
Sort, ( ii ) Selection Sort ( iii ) Insertion Sort
5 Write C program to Implement Merge Sort. 2
6 Write C program to perform PUSH and POP operations on stack using array. 3
7 Write C program to perform INSERT and DELETE operations on queue using 3
array.
8 Write C program to perform the operations (Insert, Delete, Traverse, and 4
Search) on Singly Linked List. Part - I
9 Write C program to perform the operations (Insert, Delete, Traverse, and 4
Search) on Circular Singly Linked List. Part - I
10 Write a C Program to design a stack using Linked List. 4
11 Write C program to Implement BST (Binary Search Tree) and traverse the tree 5
(Inorder, Preorder, Post order).
12 Write C program to calculate height of the given Binary Tree. 5
Note
i) The entire above listed practical’s need to be performed compulsorily, so that the
students reach the `Precision level of Dave’s Psychomotor Domain’.

[4]
 ii) The Process and Product related skills associated with each practical outcome
shall be assessed on basis of following performance indicators.

S. No. Performance Indicators Weightage in %

a. Preparation of experimental set up 20
b. Setting and operation 20
c. Safety measures 10
d. Observations and Recording 10
e. Interpretation of result and Conclusion 20
f. Answer to sample questions 10
g. Submission of report in time 10
Total 100%

The above PrOs also comprise of the following social skills/attitudes which are Affective
Domain Outcomes (ADOs) that are best developed through the laboratory/field based
experiences:
a. Follow safety practices.
b. Practice good housekeeping.
c. Demonstrate working as a leader/a team member.
d. Follow ethical practices.

The ADOs are not specific to any one PrO, but are embedded in many PrOs. Hence, the
acquisition of the ADOs takes place gradually in the student when s/he undertakes a series of
practical experiences over a period of time. Moreover, the level of achievement of the ADOs
according to Krathwohl’s ‘Affective Domain Taxonomy’ should gradually increase as planned
below:
 ‘Valuing Level’ in 1st year
 ‘Organising Level’ in 2nd year and
 ‘Characterising Level’ in 3rd year.

5. SUGGESTED STUDENT ACTIVITIES

Other than the classroom and laboratory learning, following are the suggested student-related
co-curricular activities which can be undertaken to accelerate the attainment of the various
outcomes in this course: Students should conduct following activities in group and prepare
reports of about 5 pages for each activity, also collect/record physical evidences for their
(student’s) portfolio which will be useful for their placement interviews:
a. Prepare journal of practical.
b. Undertake micro-projects.
c. Prepare a chart to classify Data Structures.
d. Prepare charts for logical representation of Data Structures.

6. SUGGESTED INSTRUCTIONAL STRATEGIES

These are sample strategies, which the teacher can use to accelerate the attainment of the
various learning outcomes in this course:
a. Massive open online courses (MOOCs) may be used to teach various topics/sub
topics.
b. ‘L’ in item No. 4 does not mean only the traditional lecture method, but different
types of teaching methods and media that are to be employed to develop the
outcomes.

[5]
 c. About 10-15% of the topics/sub-topics which is relatively simpler or descriptive in
nature is to be given to the students for self-directed learning and assess the
development of the COs through classroom presentations (see implementation
guideline for details).
d. With respect to item No.10, teachers need to ensure to create opportunities and
provisions for co-curricular activities.
e. Guide student(s) in undertaking micro-projects.
f. Demonstrate students thoroughly before they start doing the practice.
g. Encourage students to refer different websites to have deeper understanding of the
subject.
h. Observe continuously and monitor the performance of students in Lab.

7. SUGGESTED MICRO-PROJECTS.
Only one micro-project is planned to be undertaken by a student that needs to be assigned to
him/her in the beginning of the semester. In the first four semesters, the micro-project are
group-based. However, in the fifth and sixth semesters, it should be preferably be
individually undertaken to build up the skill and confidence in every student to become
problem solver so that s/he contributes to the projects of the industry. In special situations
where groups have to be formed for micro-projects, the number of students in the group
should not exceed three.
The micro-project could be industry application based, internet-based, workshop-
based, laboratory-based or field-based. Each micro-project should encompass two or more
COs which are in fact, an integration of PrOs, UOs and ADOs. Each student will have to
maintain dated work diary consisting of individual contribution in the project work and give a
seminar presentation of it before submission. The total duration of the micro-project should
not be less than 16 (sixteen) student engagement hours during the course. The student ought
to submit micro-project by the end of the semester to develop the industry oriented COs.
A suggestive list of micro-projects is given here. Similar micro-projects could be
added by the concerned faculty:
a. Develop a program in ‘C’ to evaluate an arithmetic expression using Stack with linked
list representation.
b. Develop a program in ‘C’ that creates Queue of given persons. Shift the original position
of person to a new position based on its changed priority or remove a person from the
Queue using Linked List implementation.
c. Develop a program in ‘C’ that creates tree to store given data set using linked list
representation. Locate and display a specific data from the data set.
d. Develop a ‘C’ program for performing following banking operations: Deposit, Withdraw
and Balance enquiry. Select appropriate data structure for the same.

8. MAJOR EQUIPMENTS/INSTRUMENTS REQUIRED

The major equipment with broad specification mentioned here will usher in uniformity in
conduct of experiments, as well as aid to procure equipment by authorities concerned.
S. PrO
Equipment Name with Broad Specifications
No. S. No.
1 Computer system All
(Any computer system which is available in laboratory)
2 ‘C’ Compiler / GCC Compiler

[6]
9. SUGGESTED SPECIFICATION TABLE FOR QUESTION PAPER DESIGN

Unit Unit Title Marks Distribution of Theory Marks Total

No. per R U A Marks
Unit Level Level Level

1 Introduction to Data 04 02 02 02 06
Structures
2 Searching and Sorting 08 02 02 08 12
3 Stacks and Queues 16 02 04 14 20
4 Linked Lists 10 02 04 10 16
5 Trees and Graphs 10 02 04 10 16
Total 70 20-30% 40-55% 30-45% 70

R=Remember, U=Understand, A=Apply and above (Bloom’s Revised taxonomy)

Note: This specification table provides general guidelines to assist student for their learning
and to teachers to teach and assess students with respect to attainment of UOs. The actual
distribution of marks at different taxonomy levels (of R, U and A) in the question paper may
vary from above table.

10. SUGGESTED LEARNING RESOURCES:

S.
Title of Book Author Publication
No.
1 Data Structures using Balgurusamy, E. McGraw Hill Education, New Delhi
‘C’ 2013, ISBN: 978-1259029547
2 Data Structures using ISRD Group McGraw Hill Education, New Delhi
‘C’ 2013, ISBN: 978-12590006401
3 Data Structures with ‘C’ Lipschutz McGraw Hill Education, New Delhi
(SIE) (Schaum’s Outline 2013, ISBN: 978-0070701984
Series)

11. SOFTWARE/LEARNING WEBSITES.

a. http://nptel.ac.in/courses/106102064/1
b. www.oopweb.com/algorithms
c. www.studytonight.com/data-structures/
d. www.cs.utexas.edu/users
e. Iiscs.wssu.edu
f. http://www.academictutorials.com/data-structures
g. http://www.sitebay.com/data-structure/c-data-structure

12. COURSE CURRICULUM DEVELOPMENT COMMITTEE:

SR. NO. NAME DESIGNATION INDUSTRY/INSTITUTE

1 S. A. KALE Lecturer in Information Govt. Polytechnic
Technology. Amravati
2 S. S. CHAVHAN Lecturer in Computer Govt. Polytechnic

[7]
 Engineering. Amravati
3 R.R. BHOGE Lecturer in Information Govt. Polytechnic
Technology. Amravati

Govt. Polytechnic, Programme Board of Studies (Information Technology) has approved the
above course curriculum on ……….and is adopted for Information Technology Programme.

CHAIRMAN
PROGRAMME BOARD OF STUDIES,
INFORMATION TECHNOLOGY,
GOVERNMENT POLYTECHNIC,
AMRAVATI.

The General Board of Studies has approved the above course curriculum on …………
The Governing Body has approved the above course curriculum on ………………….

[8]