Jaywant Shikshan Prasarak Mandal’s

RAJARSHI SHAHU COLLEGE OF ENGINEERING’s

POLYTECHNIC
S.No.80, Pune-Mumbai Bypass Highway, Tathawade Campus, Pune.

Approved By AICTE & Govt. of Maharashtra, Affilated to MSBTE

NBA ACCREDITED

DTE Code – 6141 MSBTE Inst. Code - 1620

“MASTER SOLUTIONs”

(MSBTE Question Paper with Solution as per K Scheme)

Class – Second Year Computer Engineering

Semester – CO3K

Subject: Data Structure using ‘C’

Subject Code – 313301

Department of Computer Engineering

RSCOEP COMPUTERENGINEERING DEPARTMENT Prof.M.S.Patil

JSPM’s
RAJARSHI SHAHU COLLEGE OF ENGINEERING,
POLYTECHNIC, TATHAWADE, PUNE-33
DEPARTMENT OF COMPUTER ENGINEERING
JSPM’s RSCOE Polytechnic JSPM’s RSCOE Polytechnic
Institute Vision Institute Mission
“To satisfy the aspirations of youth force, who “To provide, nurture and maintain an environment of high
want to lead the nation towards prosperity academic excellence, research and entrepreneurship for all
throughtechno-economic development.” aspiring students, which will prepare them to face global
challenges maintaining high ethical and moral standards.”
JSPM’s RSCOE Polytechnic JSPM’s RSCOE Polytechnic
Department of Computer Department of Computer
Engineering Engineering
Vision Mission
M1-To provide sound theoretical education, practical
To impart value based technical education for knowledge and to train the students in association with
developing competent computer engineers industry.
M2-To improve self awareness and ethical values among
fulfilling expectations of industry and society.
students along with technical proficiency.
M3-To promote awareness about life-long learning and
problem solving among students.

Program Specific Outcomes (PSOs) Program Outcomes (POs)

PSO1.Computer Software and Hardware 1. Basic and Discipline specific knowledge: Apply knowledge
Usage; Use state of-the-art technologies for of basic mathematics, science and Engineering fundamentals and
operation and application of computer software engineering specialization to solve the engineering problems.
2. Problem analysis: Identify and analyse well-defined
and hardware.
engineering problems using codified standard methods.
3. Design/ development of solutions: Design solutions for well-
PSO2.Computer engineering Maintenance; defined technical problems and assist with the design of systems
Maintain computer engineering related software components or processes to meet specified needs.
and hardware system. 4. Engineering Tools, Experimentation and Testing: Apply
modern engineering tools and appropriate technique to conduct
standard tests and measurements.
5. Engineering practices for society, sustainability and
environment: Apply appropriate technology in context of
society, sustainability, environment and ethical practices.
6. Project Management: Use engineering management
principles individually, as a team member or a leader to manage
projects and effectively communicate about well-defined
engineering activities.
7. Life-long learning: Ability to analyse individual needs and
engage in updating in the context of technological changes.
Program Educational Objectives (PEOs)
PEO1: Provide socially responsible, environment friendly solutions to Computer
Engineering related broad-based problems adapting professional ethics.
PEO2: Adapt state-of-the-art Computer engineering broad-based technologies to work in multi-disciplinary work
environments.
PEO3: Solve broad-based problems individually and as a team member communicating effectively in the world of
work.
7/22/24, 1:59 PM services.msbte.ac.in/scheme_digi/fetch_scheme_api_print

Maharashtra State Board Of Technical Education, Mumbai

Learning and Assessment Scheme for Post S.S.C Diploma Courses
Programme Name : Diploma In Computer Technology / Computer Engineering / Computer Science & Engineering / Computer Hardware & Maintenance
Programme Code : CM / CO / CW / HA With Effect From Academic Year : 2023-24
Duration Of Programme : 6 Semester Duration : 16 WEEKS
Semester : Third NCrF Entry Level : 3.5 Scheme :K
Learning Scheme Assessment Scheme
Actual Contact
Based on LL & TL Based on Self
Total IKS Hrs./Week Theory
Sr Course Course Self Learning (Activity/ Notional Paper Learning
Course Title Abbrevation Hrs for Credits Practical Total
No Type Code Assignment /Micro Learning Hrs Duration
Sem. FA- SA- Marks
CL TL LL Project) /Week (hrs.) Total FA-PR SA-PR SLA
TH TH
Max Max Max Min Max Min Max Min Max Min
(All Compulsory)
DATA STRUCTURE USING
1 DSU DSC 313301 - 3 1 4 - 8 4 3 30 70 100 40 50 20 25# 10 - - 175
C
DATABASE
2 DMS DSC 313302 - 3 1 4 2 10 5 3 30 70 100 40 50 20 25# 10 25 10 200
MANAGEMENT SYSTEM
3 DIGITAL TECHNIQUES DTE DSC 313303 - 3 - 2 1 6 3 3 30 70 100 40 25 10 25# 10 25 10 175
OBJECT ORIENTED
4 PROGRAMMING USING OOP SEC 313304 - 3 2 4 1 10 5 3 30 70 100 40 50 20 25@ 10 25 10 200
C++
5 COMPUTER GRAPHICS CGR DSC 313001 - 1 - 2 1 4 2 - - - - - 25 10 - - 25 10 50
ESSENCE OF INDIAN
6 EIC VEC 313002 - 1 - - 1 2 1 - - - - - - - - - 50 20 50
CONSTITUTION
Total 0 14 4 16 6 20 120 280 400 200 100 150 850
Abbreviations : CL- Classroom Learning , TL- Tutorial Learning, LL-Laboratory Learning, FA - Formative Assessment,SA -Summative Assessment, IKS - Indian Knowledge System, SLA - Self Learning Assessment
Legends : @ Internal Assessment, # External Assessment, *# On Line Examination , @$ Internal Online Examination
Note :
1. FA-TH represents average of two class tests of 30 marks each conducted during the semester.
2. If candidate is not securing minimum passing marks in FA-PR of any course then the candidate shall be declared as "Detained" in that semester.
3. If candidate is not securing minimum passing marks in SLA of any course then the candidate shall be declared as fail and will have to repeat and resubmit SLA work.
4. Notional Learning hours for the semester are (CL+LL+TL+SL)hrs.* 15 Weeks
5. 1 credit is equivalent to 30 Notional hrs.
6. * Self learning hours shall not be reflected in the Time Table.
7. * Self learning includes micro project / assignment / other activities.
Course Category : Discipline Specific Course Core (DSC) , Discipline Specific Elective (DSE) , Value Education Course (VEC) , Intern./Apprenti./Project./Community (INP) , AbilityEnhancement Course (AEC) , Skill
Enhancement Course (SEC) , GenericElective (GE)

https://services.msbte.ac.in/scheme_digi/fetch_scheme_api_print 1/1
7/22/24, 2:00 PM 313301-DATA STRUCTURE USING C

DATA STRUCTURE USING C Course Code : 313301

: Cloud Computing and Big Data/ Computer Technology/ Computer Engineering/
Computer Science & Engineering/
Programme Name/s
Computer Hardware & Maintenance/ Information Technology/ Computer Science &
Information Technology
Programme Code : BD/ CM/ CO/ CW/ HA/ IF/ IH
Semester : Third
Course Title : DATA STRUCTURE USING C
Course Code : 313301

I. RATIONALE
One of the most important courses in information and communication technology is data structures. Data
organization or structuring is essential for developing effective algorithms and programs. Students will get the
ability to develop logic to solve problem using principles of data structure with the aid of this course.

II. INDUSTRY / EMPLOYER EXPECTED OUTCOME

Implement algorithm using relevant Data Structures.

III. COURSE LEVEL LEARNING OUTCOMES (COS)

Students will be able to achieve & demonstrate the following COs on completion of course based learning

CO1 - Perform basic operations on Arrays.

CO2 - Apply different Searching and Sorting methods.
CO3 - Implement basic operations on Linked List.
CO4 - Perform operations on Stack using Array and Linked List Implementations.
CO5 - Perform operations on Queue using Array and Linked List Implementations.
CO6 - Create and Traverse Tree to solve problems.

IV. TEACHING-LEARNING & ASSESSMENT SCHEME

Learning Scheme Assessment Scheme
Actual
Based on LL &
Contact Based on
Theory TL
Course Course Hrs./Week SL
Course Title Abbr Credits Paper Total
Code Category/s SLH NLH Practical
Duration Marks
FA- SA-
CL TL LL Total FA-PR SA-PR SLA
TH TH
Max Max Max Min Max Min Max Min Max Min
DATA
313301 STRUCTURE DSU DSC 3 1 4 - 8 4 3 30 70 100 40 50 20 25# 10 - - 175
USING C
Total IKS Hrs for Sem. : 0 Hrs
Abbreviations: CL- ClassRoom Learning , TL- Tutorial Learning, LL-Laboratory Learning, SLH-Self Learning
Hours, NLH-Notional Learning Hours, FA - Formative Assessment, SA -Summative assessment, IKS - Indian
Knowledge System, SLA - Self Learning Assessment
Legends: @ Internal Assessment, # External Assessment, *# On Line Examination , @$ Internal Online
Examination
Note :

1. FA-TH represents average of two class tests of 30 marks each conducted during the semester.
2. If candidate is not securing minimum passing marks in FA-PR of any course then the candidate shall be
declared as "Detained" in that semester.
3. If candidate is not securing minimum passing marks in SLA of any course then the candidate shall be
declared as fail and will have to repeat and resubmit SLA work.
4. Notional Learning hours for the semester are (CL+LL+TL+SL)hrs.* 15 Weeks
5. 1 credit is equivalent to 30 Notional hrs.
6. * Self learning hours shall not be reflected in the Time Table.
7. * Self learning includes micro project / assignment / other activities.

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

https://services.msbte.ac.in/scheme_digi/pdfdownload/download/ 1/6
7/22/24, 2:00 PM 313301-DATA STRUCTURE USING C

DATA STRUCTURE USING C Course Code : 313301

V. THEORY LEARNING OUTCOMES AND ALIGNED COURSE CONTENT

Suggested
Theory Learning Outcomes Learning content mapped with Theory Learning
Sr.No Learning
(TLO's)aligned to CO's. Outcomes (TLO's) and CO's.
Pedagogies.
TLO 1.1 Classify the given Unit - I Introduction to Data Structures
type of Data Structures based 1.1 Introduction: Concept and Need of Data Structure,
on their characteristics and Definition, Abstract Data Type Lecture Using
1 space. 1.2 Types of Data Structures: (i) Linear Data Structures Chalk-Board
TLO 1.2 Perform operations (ii) Non-Linear Data Structures Presentations
on the given type of Data 1.3 Operations on Data Structures: (i) Traversing (ii)
Structure. Insertion (iii) Deletion
Unit - II Searching and Sorting
TLO 2.1 Develop algorithm to
2.1 Searching: Searching for an item in a data set using Lecture Using
search the given key using
the following methods: (i) Linear Search (ii) Binary Chalk-Board
different Searching
2 Search Demonstration
Techniques.
2.2 Sorting: Sorting of data set in an order using the Presentations
TLO 2.2 Create algorithm to
following methods: (i) Bubble Sort (ii) Selection Sort Hands-on
sort data using a given method.
(iii) Insertion Sort (iv) Quick Sort (v) Merge Sort
Unit - III Linked List
3.1 Difference between Static and Dynamic Memory
TLO 3.1 Differentiate between Allocation.
Static and Dynamic Memory 3.2 Introduction to Linked List, Terminologies: Node,
Allocation. Address, Pointer, Information field / Data field, Next Lecture Using
TLO 3.2 Create a suitable pointer, Null Pointer, Empty List. Chalk-Board
3 structure using a Linked List 3.3 Type of Lists: Linear List, Circular List, Demonstration
to represent a Node. Representation of Doubly Linked List. Presentations
TLO 3.3 Create Algorithm to 3.4 Operations on a Singly Linked List: Creating a Hands-on
add or remove a specified item Linked List, Inserting a new node in a Linked List,
from a Linear Linked List. Deleting a node from a Linked List, Searching a key in
Linked List, Traversing a Singly Linked List.
3.5 Applications of Linked List.
Unit - IV Stack
TLO 4.1 Represent Stack
4.1 Introduction to Stack: Definition, Stack as an ADT,
using Array and Linked List.
Operations on Stack-(Push, Pop), Stack Operation
TLO 4.2 Create Algorithm to
Conditions – Stack Full / Stack Overflow, Stack Empty Lecture Using
carry out the PUSH and POP
/Stack Underflow. Chalk-Board
operations in a Stack.
4 4.2 Stack Implementation using Array and Demonstration
TLO 4.3 Use Stack to
representation using Linked List. Presentations
transform the given expression
4.3 Applications of Stack: Reversing a List, Polish Hands-on
from Infix to Postfix.
Notations, Conversion of Infix to Postfix Expression,
TLO 4.4 Evaluate Postfix
Evaluation of Postfix Expression.
Expression.
4.4 Recursion: Definition and Applications.
TLO 5.1 Represent Queue Unit - V Queue
using Array and Linked List. 5.1 Introduction to Queue: Queue as an ADT, Queue
TLO 5.2 Explain the representation in memory using Array and Lecture Using
characteristics of different representation using a Linked List. Chalk-Board
5 types of Queue. 5.2 Types of Queues: Linear Queue, Circular Queue, Demonstration
TLO 5.3 Create Algorithm to Concept of Priority Queue, Double-Ended Queue. Presentations
carry out the INSERT and 5.3 Queue Operations: INSERT, DELETE, Queue Hands-on
DELETE Operations on a Operation Conditions: Queue Full, Queue Empty.
Queue. 5.4 Applications of Queue.

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

https://services.msbte.ac.in/scheme_digi/pdfdownload/download/ 2/6
7/22/24, 2:00 PM 313301-DATA STRUCTURE USING C

DATA STRUCTURE USING C Course Code : 313301

Suggested
Theory Learning Outcomes Learning content mapped with Theory Learning
Sr.No Learning
(TLO's)aligned to CO's. Outcomes (TLO's) and CO's.
Pedagogies.
TLO 6.1 Describe the given
Unit - VI Tree
Tree Terminology.
6.1 Introduction to Trees Terminologies: Tree, Degree
TLO 6.2 Create a Binary
of a Node, Degree of a Tree, Level of a node, Leaf
Search Tree based on the Lecture Using
Node, Depth / Height of a Tree, In-Degree and Out-
provided data. Chalk-Board
Degree, Path, Ancestor and Descendant Nodes.
6 TLO 6.3 Create Algorithms to Demonstration
6.2 Tree Types and Traversal methods, Types of Trees:
Traverse the Tree using the Presentations
General Tree, Binary Tree, Binary Search Tree (BST).
given method. Hands-on
Binary Tree Traversal: In-Order Traversal, Preorder
TLO 6.4 Create an Expression
Traversal, Post-Order Traversal.
Tree.
6.3 Expression Tree, Heap
TLO 6.5 Create Heap.

VI. LABORATORY LEARNING OUTCOME AND ALIGNED PRACTICAL / TUTORIAL EXPERIENCES.

Practical / Tutorial /
Sr Laboratory Experiment / Practical Titles / Tutorial Number Relevant
Laboratory Learning Outcome
No Titles of hrs. COs
(LLO)
LLO 1.1 Implement Array * Write a ‘C’ program to perform following
1 4 CO1
Operations. Operations on Array: Create, Insert, Delete, Display.
Write a ‘C’ Program to Search a particular data from
LLO 2.1 Implement Linear
2 the given Array of numbers using: Linear Search 2 CO2
Search Method on Numbers.
Method.
* Write a ‘C’ Program to Search a particular data
LLO 3.1 Implement Linear
3 from the given Array of Strings using Linear Search 2 CO2
Search Method on Strings.
Method.
* Write a ‘C’ program to Search a particular data
LLO 4.1 Implement Binary
4 from the given Array of numbers using Binary 2 CO2
Search Method on Numbers.
Search Method.
Write a ‘C’ Program to Search a particular data from
LLO 5.1 Implement Binary
5 the given Array of Strings using Binary Search 2 CO2
Search Method on Strings.
Method.
LLO 6.1 Apply Bubble Sort * Write a ‘C’ Program to Sort an Array of numbers
6 2 CO2
method for Sorting Numbers. using Bubble Sort Method.
LLO 7.1 Apply Bubble Sort Write a ‘C’ Program to Sort an Array of Strings
7 2 CO2
method for Sorting Strings. using Bubble Sort Method.
LLO 8.1 Apply Selection Sort * Write a ‘C’ Program to Sort an Array of numbers
8 2 CO2
for Sorting Numbers. using Selection Sort Method.
LLO 9.1 Apply Selection Sort Write a ‘C’ Program to Sort an Array of Strings
9 2 CO2
for Sorting Strings. using Selection Sort Method.
LLO 10.1 Apply Insertion Sort * Write a ‘C’ Program to Sort an Array of numbers
10 2 CO2
for Sorting Numbers. using Insertion Sort Method.
LLO 11.1 Apply Insertion Sort Write a ‘C’ Program to Sort an Array of Strings
11 2 CO2
for Sorting Strings. using Insertion Sort Method.
* Write a 'C' Program to Implement Singly Linked
LLO 12.1 Create Singly Linked
12 List with Operations: (i) Insert at beginning, (ii) 2 CO3
List.
Search, (iii) Display
LLO 13.1 Perform given * Write a C Program to Implement Singly Linked
Operations on Singly Linked 13 List with Operations: (i) Insert at end, (ii) Insert 2 CO3
List. After, (iii) Delete (iv) Display
LLO 14.1 Create Polynomials Write a C Program to Create Two Polynomials using
14 2 CO3
using Linked List. a Linked List.

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

https://services.msbte.ac.in/scheme_digi/pdfdownload/download/ 3/6
7/22/24, 2:00 PM 313301-DATA STRUCTURE USING C

DATA STRUCTURE USING C Course Code : 313301

Practical / Tutorial /
Sr Laboratory Experiment / Practical Titles / Tutorial Number Relevant
Laboratory Learning Outcome
No Titles of hrs. COs
(LLO)
LLO 15.1 Perform the Addition
* Write a 'C' Program to add Two Polynomials using
of Two Polynomials using a 15 2 CO3
a Linked List.
Linked List.
LLO 16.1 Perform Operations * Write a 'C' Program to perform PUSH and POP
16 2 CO4
on the Stack using the Array. Operations on Stack using an Array.
LLO 17.1 Perform Operations
* Write a 'C' Program to perform PUSH and POP
on the Stack using a Linked 17 2 CO4
Operations on a Stack using a Linked List.
List.
LLO 18.1 Apply recursive
* Write a 'C' program to perform multiplication of
procedure to multiply two 18 2 CO4
two numbers using recursion.
numbers.
LLO 19.1 Apply recursive Write a 'C' program to print given string in reverse
19 2 CO4
procedure to reverse the string. using recursion.
LLO 20.1 Apply recursive
Write a 'C' program to create a Singly Linked List CO3
procedure to display linked list 20 4
and traverse in reverse order using recursion. CO4
in reverse.
* Write a 'C' Program to perform INSERT and
LLO 21.1 Perform Operations
21 DELETE Operations on Linear Queue using an 2 CO5
on Linear Queue using Array.
Array.
LLO 22.1 Perform Operations * Write a 'C' Program to perform INSERT and
on Linear Queue using Linked 22 DELETE operations on Linear Queue using a 2 CO5
List. Linked List.
* Write a 'C' Program to perform INSERT and
LLO 23.1 Perform Operations
23 DELETE operations on Circular Queue using an 2 CO5
on Circular Queue using Array.
Array.
LLO 24.1 Perform Operations Write a 'C' Program to perform INSERT and
on Circular Queue using a 24 DELETE operations on Circular Queue using a 2 CO5
Linked List. Linked List.
LLO 25.1 Implement Priority Write a 'C' Program to Create a Priority Queue using
25 4 CO5
Queue using Linked List. a Linked List.
LLO 26.1 Implement Binary
* Write a 'C' Program to Implement BST (Binary
Search Tree and perform In- 26 2 CO6
Search Tree) and Traverse in In-Order.
Order Traversal.
LLO 27.1 Implement Tree Write a 'C' Program to Traverse BST in Preorder,
27 2 CO6
Traversal Operations. and Post-Order.
Note : Out of above suggestive LLOs -
'*' Marked Practicals (LLOs) Are mandatory.
Minimum 80% of above list of lab experiment are to be performed.
Judicial mix of LLOs are to be performed to achieve desired outcomes.

VII. SUGGESTED MICRO PROJECT / ASSIGNMENT/ ACTIVITIES FOR SPECIFIC LEARNING /

SKILLS DEVELOPMENT (SELF LEARNING) : NOT APPLICABLE

VIII. LABORATORY EQUIPMENT / INSTRUMENTS / TOOLS / SOFTWARE REQUIRED

Sr.No Equipment Name with Broad Specifications Relevant LLO Number
Computer System with all necessary Peripherals and Internet Connectivity.
1 All
‘C’ Compiler / GCC Compiler/ Online ‘C’ Compiler

IX. SUGGESTED WEIGHTAGE TO LEARNING EFFORTS & ASSESSMENT PURPOSE (Specification

Table)

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

https://services.msbte.ac.in/scheme_digi/pdfdownload/download/ 4/6
7/22/24, 2:00 PM 313301-DATA STRUCTURE USING C

DATA STRUCTURE USING C Course Code : 313301

Sr.No Unit Unit Title Aligned COs Learning Hours R-Level U-Level A-Level Total Marks
1 I Introduction to Data Structures CO1 2 2 2 0 4
2 II Searching and Sorting CO2 8 2 2 8 12
3 III Linked List CO3 12 2 4 10 16
4 IV Stack CO4 8 2 4 6 12
5 V Queue CO5 6 2 2 6 10
6 VI Tree CO6 9 2 4 10 16
Grand Total 45 12 18 40 70

X. ASSESSMENT METHODOLOGIES/TOOLS

Formative assessment (Assessment for Learning)

Continuous Assessment based on Process and Product related Performance Indicators. Each practical will be
assessed considering 60% weightage to Process and 40% weightage to Product

Summative Assessment (Assessment of Learning)

End semester Examination, Lab performance, Viva-Voce

XI. SUGGESTED COS - POS MATRIX FORM

Programme
Specific
Programme Outcomes (POs)
Outcomes*
(PSOs)
Course PO-5
Outcomes PO-1 Basic Engineering
(COs) PO-3 PO-7
and PO-2 PO-4 Practices for
Design/ PO-6 Project Life PSO- PSO- PSO-
Discipline Problem Engineering Society,
Development Management Long 1 2 3
Specific Analysis Tools Sustainability
of Solutions Learning
Knowledge and
Environment
CO1 2 - - 1 - - 1
CO2 2 2 2 1 - - 1
CO3 2 2 2 1 1 1 1
CO4 2 2 2 1 - 1 1
CO5 2 2 2 1 - 1 1
CO6 2 2 2 1 - 1 1
Legends :- High:03, Medium:02,Low:01, No Mapping: -
*PSOs are to be formulated at institute level

XII. SUGGESTED LEARNING MATERIALS / BOOKS

Sr.No Author Title Publisher with ISBN Number
Data Structures with ‘C’ (SIE) McGraw Hill Education, New Delhi ISBN:
1 Lipschutz
(Schaum’s Outline Series) 978-0070701984
McGraw Hill Education, New Delhi 2013,
2 Balgurusamy, E. Data Structures using ‘C’
ISBN: 978-1259029547
McGraw Hill Education, New Delhi 2013,
3 ISRD Group Data Structures using ‘C’
ISBN: 978-12590006401
Yashwant
4 Understanding Pointers in C BPB ISBN 8170298911
Kanetkar

XIII . LEARNING WEBSITES & PORTALS

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

https://services.msbte.ac.in/scheme_digi/pdfdownload/download/ 5/6
7/22/24, 2:00 PM 313301-DATA STRUCTURE USING C

DATA STRUCTURE USING C Course Code : 313301

Sr.No Link / Portal Description
1 https://www.javatpoint.com/data-structure-introduction For All Content
https://www.geeksforgeeks.org/introduction-to-data-structure
2 For All Content
s/
3 https://studytonight.com/data-structures/ For All Content
4 https://www.tutorialspoint.com/data_structures_algorithms/ For All Content
5 https://www.w3schools.in/data-structures/ For All Content
https://www.mygreatlearning.com/blog/data-structure-tutorial
6 For All Content
-for-beginners/
7 https://byjus.com/gate/introduction-to-data-structure-notes/ For All Content
Note :

Teachers are requested to check the creative common license status/financial implications of the suggested
online educational resources before use by the students

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

https://services.msbte.ac.in/scheme_digi/pdfdownload/download/ 6/6
JSPM's
Rajarshi Shahu College of Engineering,
Polytechnic, Tathawade, Pune-33
Academic Year 2024-25

MSBTE QUESTION PAPER ANALYSIS

Course: Data Structure using ‘C’

Course Code: 313301

Marks
Marks Marks Marks Marks Marks Marks Marks Marks
as per
weight weight weight weight weight weight weight weight
Unit Teachi
No.
age in age in age in age in age in age in age in age in
ng
S-24 W-23 S-23 W-22 S-22 W -19 S-19 W-18
Schem
QP QP QP QP QP QP QP QP
e
Unit 8
No. 1
4 4 8 6 4 4 8 8
Unit 14
No. 2
12 20 16 20 14 14 18 18
Unit 24
No. 3
16 30 18 18 18 24 24 24
Unit 20
No. 4
12 16 22 20 22 18 24 18
Unit 10
No. 5
10 8 8 12 8 12 06 12
Unit 18
No. 6
16 10 16 14 12 10 12 16

Total
Marks
70 94 88 88 90 78 82 92 96

Out of syllabus 8 14 10 12 18 20 10 06
1

Jaywant Shikshan Prasarak Mandal’s

RAJARSHI SHAHU COLLEGE OF ENGINEERING,
POLYTECHNIC
Department of Computer Engineering
Academic year: 2024-25
Course- Data Structure using C Course Code- 313301
Semester- ODD (CO3K) Name of Faculty- Mrs. M. S. Patil
QUESTION BANK WITH SOLUTION

UNIT 1: Introduction on to Data Structure Marks:04

CO.1: Perform basic operations on Arrays.

Sr.
Questions Year Marks
No.
Summer-24,
1 Define Abstract Data Type (ADT) winter-22, 2
Summer 22

Summer-24,
Winter 23,
2 List the operation that can be performed on data structure. summer 23, 2
Winter 19,
Summer 19
Data structure operations:
• Insertion: Adding a new data.
• Deletion: Removing a data.
• Sorting: Arranging the data in some logical order.
• Searching: Finding the location of data.
• Traversal: Accessing each data exactly once.
Merging: Combining the data.

3 Explain linear data structure with any three types. Summer-24 4

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

2

Winter 23,
Define the terms: Linear data structure and non-linear data
Summer 23,
4 structure 2
Summer 22,
Explain linear and non-linear data structures
Winter 18
Linear Data Structure
A data structure in which all data elements are stored in a particular sequence is
known as linear data structure.
Non-Linear data structure
A data structure in which all data elements are not stored in any particular
sequence is known as nonlinear data structure.
5 Implement a C program to insert an element in an array Summer 23 4

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

3

Differentiate between linear and non-linear data structure. (any four Winter- 22
6 4
points) Summer 19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

4

7 Give classification of data structure. Winter 19 2

Write C program for performing following operations on array :

8 Summer-19 4
insertion, display.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

5

9 Define the term algorithm. Winter-18 2

Algorithm is a stepwise set of instructions written to perform a specific task.

10 Write ‘c’ program for deletion of an element from an array. Winter-18 4

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

6

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

7

Jaywant Shikshan Prasarak Mandal’s

RAJARSHI SHAHU COLLEGE OF ENGINEERING,
POLYTECHNIC
Department of Computer Engineering
Academic year: 2024-25
Course- Data Structure using C Course Code-313301
Semester- ODD (CO3K) Name of Faculty- Mrs. M. S. Patil
QUESTION BANK

UNIT 2: Searching and Sorting Marks: 12

CO.2 Apply different searching and sorting methods.

Sr.
Questions Year Marks
No
Winter 23,
Summer
1 State any two differences between linear search and binary search 2,4
23,
Summer19

2 Describe working of selection sort method with suitable example Winter 23 4

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

8

Explain complexity of following algorithms in terms of time and space: i)

3 Winter 23 4
Binary Search ii) Bubble Sort

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

9

Winter 23,
4 Describe working of bubble sort with example Summer 22 4
,Winter 18
In bubble sort, sorting begins with comparison of 0th index element with 1st index
element in the list. If 0th index element is greater than 1st index element then numbers
are interchanged. In this way, all elements are compared with its next element &
interchanged if required. At the end of 1st pass, the largest element from the list is placed
at the last position in an array. In pass 2, again comparison starts with 0th index element
and 1st index element. If required then elements are interchanged. At the end of pass2,
2nd largest element is placed at its final position. This process of comparison and
interchange continue in all passes.
In every pass numbers of comparisons are reduced by one, as an element placed at its
final position from bottom is not compared in next pass. This process continues till all
elements are placed in sorted order.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

10

Sort the following number in ascending order using bubble sort. Given
5 Winter 23 6
numbers as follows: 475, 15, 513, 6753, 45, 118.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

11

Summer
6 Define Searching. What are its types? 2
23

Sort the following in ascending order using Insertion sort: Summer

7 4
{25, 15,4,103,62,9} and write the output after each iteration. 23

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

12

Find the position of element 29 using Binary search method in an array Summer
8 6
given as: {11,5,21,3,29,17,2,43} 23

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

13

9 State the following terms : 1.searching 2.sorting Winter- 22 2

Searching is the process of finding a specific item or value within a collection
of data.
Sorting is the process of arranging items in a specific order based on a defined
criteria. This order can be ascending & descending
10 Write a program to implement bubble sort. Winter 22 4
#include <stdio.h>

void bubbleSort(int arr[], int n) {

int i, j, temp;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
// Swap elements
temp = arr[j];

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

14

arr[j] = arr[j + 1];

arr[j + 1] = temp;
}
}
}
}

void printArray(int arr[], int size) {

int i;
for (i = 0; i < size; i++)
printf("%d ", arr[i]);
}

int main() {
int arr[]
= {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr) / sizeof(arr[0]);

bubbleSort(arr, n);

printf("Sorted array: \n");

printArray(arr, n);
return 0;
}
Find location of element 20 by using binary search algorithm in the list
11 Winter 22 4
given below: 10, 20, 30, 40, 50, 60, 70, 80

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

15

12 Describe working of linear search with example. Winter 22 4

Linear search, also known as sequential search, is a simple algorithm used to find a
specific element within a list. It involves examining each element of the list
sequentially until a match is found or the end of the list is reached.
How it works:
1. Start at the beginning of the list.
2. Compare the current element with the target value.
3. If the current element matches the target value, return the index of the element.
4. If the current element does not match the target value, move to the next element
and repeat steps 2 and 3.
5. If the end of the list is reached without finding a match, return -1 (or any other
indicator of not found).
Example:
Consider the following list of numbers:
numbers = [3, 7, 2, 8, 1, 9]
We want to search for the number 8.
1. Start at the beginning of the list (3).
2. Compare 3 with 8. They are not equal, so move to the next element.
3. Compare 7 with 8. They are not equal, so move to the next element.
4. Compare 2 with 8. They are not equal, so move to the next element.
5. Compare 8 with 8. They are equal, so the index of 8 is found (index 3).
6. Return the index 3.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

16

Write a ‘C’ program for insertion sort. Sort the following array using
13 Winter 22 6
insertion sort : 30, 10, 40, 50, 20, 45

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

17

Find the position of element 30 using Binary search method in array Summer
14 4
A = {10, 5, 20, 25, 8, 30, 40} 22

Describe the working of Selection Sort Method. Also sort given input list in Summer
15 6
ascending order using selection sort. Input list: 50, 24, 5, 12, 30 22
Selection sort is a simple sorting algorithm that works by repeatedly finding the
minimum element from unsorted part and putting it at the beginning.
How it works:
1. Find the minimum element in the unsorted array.
2. Swap the found minimum element with the first element.
3. Repeat the above steps for the remaining unsorted array.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

18

Implement a ‘C’ program to search a particular data from the given array
16 Winter-19 4
using Linear Search.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

19

Find the position of element 21 using Binary Search method in Array ‘A’
17 Winter-19 4
given below : A = {11, 5, 21, 3, 29, 17, 2, 45}

Elaborate the steps for performing selection sort for given elements of
18 Winter-19 6
array. A = {37, 12, 4, 90, 49, 23, –19}

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

20

Summer-
19 Explain the working of Binary search with an example. 4
19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

21

Sort the following numbers in ascending order using quick sort. Given Summer-
20 4
numbers 50, 2, 6, 22, 3, 39, 49, 25, 18, 5. 19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

22

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

23

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

24

Sort the following numbers in ascending order using Bubble sort. Given
Summer-
21 numbers : 29, 35, 3, 8, 11, 15, 56, 12, 1, 4, 85, 5 & write the output after 6
19
each interaction.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

25

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

26

22 Describe working of linear search with example. Winter-18 4

Find the position of element 29 using binary search method in an array ‘A’
23 Winter-18 4
given below. Show each step. A = {11, 5, 21, 3, 29, 17, 2, 43}

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

27

Describe working of selection sort method. Also sort given input list in
24 Winter-18 6
ascending order using selection sort input list – 55, 25, 5, 15, 35.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

28

Jaywant Shikshan Prasarak Mandal’s

RAJARSHI SHAHU COLLEGE OF ENGINEERING,
POLYTECHNIC
Department of Computer Engineering
Academic year: 2024-25
Course- Data Structure using C Course Code-313301
Semester- ODD (CO3K) Name of Faculty- Mrs. M. S. Patil

QUESTION BANK

UNIT 3: Linked List Marks: 16

CO. 3: Implement basic operations on linked list.

Sr.
Questions Year Marks
No.
Summer
1 Define linked list with example 2
24

Explain the concept of information, next, null pointer and empty list with respect Summer
2 4
to linked list 24
Describe the concept of linked list with the terminologies: node, next pointer, null
pointer and empty list.

Winter-
3 18
4

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

29

Summer
4 Write an algorithm to insert a new node at the beginning in linear list 24, 4
Winter 22

Summer
5 Explain the operation on a singly linked list 24, 4
Winter 23

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

30

Summer
6 Compare linear list with circular list (Any four points) 24
4

Create a singly linked list using data fields 15,20,22,58,60. Search a node 22 from the
Summer
7 singly linked list and show procedure step-by-step with the help of diagram from start 6
24
to end

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

31

8 Define term pointer and null pointer Winter 23 2

Winter
23,
9 Write algorithm to delete an intermediate node from a singly linked list. Summer
4
23

Create singly linked list using data fields 10, 20, 30, 40, 50 and show step by step
10 Winter 23 4
procedure with the help of diagram from start to end.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

32

11 Describe advantages of circular link list over linear link list with example Winter 23 4

Describe circular linked list with suitable diagram. State advantages of circular linked Summer
12 22
6
list over linear linked list
Describe circular linked list with suitable diagram. Also state advantage of circular Winter-
13 18
4
linked list over linear linked list.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

33

14 Write an algorithm to count no. of nodes in singly linked list. Winter 23 4

Summer-
15 Write an algorithm to delete a node at the beginning from a singly linked list. 4
23

Create a singly Linked list using data fields 10,20,30,40,50 and show procedure step by Summer-
16 23
4
step with help of diagram from start to end

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

34

Create a singly Linked list using data fields 10,20,30,40,50. Search a node 40 from the
Summer-
17 singly linked list and show procedure step by step with help of diagram from start to 6
23
end

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

35

Explain node structure for single linked list. Also write advantages of singly list over Winter-
18 4
array. (any Two) 22

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

36

Winter-
19 Compare linear list with circular list. 4
22

Write the ‘C’ function for :i) searching a node in single linked list. ii) counting number Winter-
20 22
6
of nodes in single linked list.
Summer
21 Write an algorithm to search an element in linked list. 6
22
Winter-
22 Write an algorithm to search a particular node in the given linked list. 6
19
Summer-
23 Write an algorithm to count number of nodes in singly linked list. 6
19
Winter-
24 Write an algorithm to count number of nodes in singly linked list. 4
18

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

37

Summer
25 Write an algorithm to traverse a linked list. 4
22

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

38

Write an algorithm to insert a new node at the beginning of a Singly linked list. Give Summer
26 22
4
example.

Write an algorithm to insert a new node at the beginning and end of the singly linked Winter-
27 19
4
list.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

39

Construct a singly linked list using data fields 21, 25, 96, 58, 74 and show procedure Winter-
28 19
4
step-by-step with the help of diagram start to end.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

40

Winter-
29 Compare Linked List and Array. (any 4 points) 19
4

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

41

Show with suitable diagrams how to delete a node from singly linked list at the Winter-
30 6
beginning, in between and at the end of the list. 19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

42

Summer-
31 Write a program to traverse a linked list. 4
19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

43

Create a singly linked list using data fields 15, 20, 22, 58, 60. Search a node 22 from Summer-
32 4
the SLL and show procedure step-by-step with the help of diagram from start to end. 19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

44

Summer-
33 Write an algorithm to delete a node from the beginning of a circular linked list. 19
4

Create a singly linked list using data fields 90, 25, 46, 39, 56. Search a node 40 from Summer-
34 19
6
the SLL and show procedure step-by-step with the help of diagram from start to end.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

45

Winter-
35 Write an algorithm to insert an element at the beginning and at end of linked list. 6
18

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

46

Winter-
36 Describe procedure to delete an element from singly linked list using diagram. 6
18

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

47

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

48

Jaywant Shikshan Prasarak Mandal’s

RAJARSHI SHAHU COLLEGE OF ENGINEERING,
POLYTECHNIC
Department of Computer Engineering
Academic year: 2024-25
Course- Data Structure using C Course Code-313301
Semester- ODD (CO3K) Name of Faculty- Mrs. M. S. Patil

QUESTION BANK

UNIT 4: Stacks Marks: 12

CO.4: Perform operation on Stack using Array and Linked List Implementation

Sr.
Questions Year Marks
No.
Summer
1 Define stack with suitable example. 2
24

Summer
2 Explain PUSH and POP operation on stack with suitable example 4
24

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

49

Summer
3 Write a program to print a string in reverse order 4
24

Summer
24,
Convert the following infix expression to postfix expression using stack and show the Summer
4 4
details of stack in each step : ((A+B)*C)^(D-E) 23,
Winter
19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

50

Evaluate the given infix expression to the postfix expression using stack: Summer
5 6
((a/(b- c+d))*(e-a)*c) 24

Convert the following infix expression to its postfix form using stack: A + B – C * D / Winter
6 2
E+F 23

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

51

Convert the given infix expression to postfix expression using stack and the details of Winter
7 4
stack at each step of conversion Expression: A * B  C – D / E +[F / G] 23

Show the effect of PUSH and POP operation on the stack of size 10. The stack contains
10, 20, 25, 15, 30 and 40 with 40 being at top of stack. Show diagrammatically the Winter
8 4
effect of 23
i) PUSH (45) ii) PUSH (50) iii) POP iv) PUSH (55)

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

52

Find out prefix equivalent of the expression,

Winter
9 I. [(A+B)+C]*D 6
23
II. A[(B * C) + D]

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

53

Summer
10 Write any two-operation performed on the stack 2
23
Summer
20 Enlist operations on stack. 2
22
1. PUSH ()
2. POP ()
Summer
11 Explain stack overflow and underflow condition with example. 4
23

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

54

Show the effect of PUSH and POP operation on to the stack of size 10. The stack
contains 10, 20,30,40,50, and 60, with 60 being at top of the stack. Show
diagrammatically the effect of-
i) PUSH 55 Summer
12 4
ii) PUSH 70 23
iii) POP
iv) POP
Sketch the final structure of stack after performing the above said operation

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

55

Summer
14 Evaluate the following postfix expression: 4 6 24 + * 6 3 / - 6
23

Winter-
15 List any four applications of stack 2
22
1. Reversing a string
2. Polish notation
3. Conversion of infix to postfix
4. Recursion
5. Backtracking
6. Evaluation of postfix expression
Convert following expression into postfix form with illustration of all steps using stack Winter-
16 4
:(A + B – C + D*E/F^G) 22

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

56

Winter-
22,
17 Differentiate between Stack and Queue (any four points). 4
Winter
18

Winter-
22,
18 Explain stack overflow and stack underflow with example. 4
Summer
19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

57

Write a menu driven ‘C’ program to implement stack using array with the following Winter-
19 6
menu: i) push ii) pop iii) display iv) exit 22
Summer
22 Write a program to implement a stack with push, pop and display operations. 6
22

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

58

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

59

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

60

Evaluate the following postfix expression: 10, 2, *, 15, 3, /, +, 12, 3, +, + Show Summer
21 4
diagrammatically each step of evaluation using stack. 22

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

61

Convert the following Infix expression to its prefix form using stack. Show the details Summer
23 6
of stack at each step of conversion. Expression: P * Q R – S / T + (U/V) 22

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

62

Winter-
24 Define the terms ‘overflow’ and ‘underflow’ with respect to stack. 2
19

Evaluate the following arithmetic expression P written in postfix notation :P : 4, 2, ^, 3, Winter-

25 2
*, 3, -, 8, 4, /, + 19

Convert the following infix expression to postfix expression using stack and show the Winter-
26 4
details of stack in each step. ((A+B)*D)^(E-F) ((A+B)*D)^(E-F) 19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

63

Show the effect of PUSH and POP operations on the stack of size 10. PUSH(10) , Winter-
27 4
PUSH(20), POP, PUSH(30) 19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

64

Winter -
28 Explain the concept of recursion using stack. 6
19

Summer-
29 Show the memory representation of stack using array with the help of a diagram. 2
19

Convert the following infix expression to its prefix form using stack A + B – C * D / Summer-
30 2
E+F 19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

65

Evaluate the following postfix expression: 5, 6, 2, +, *, 12, 4, /, – Show Summer-

31 4
diagrammatically each step of evolution using stack. 19

Evaluate the following prefix expression: – * + 4 3 2 5 Show diagrammatically each Summer-

32 4
step of evaluation using stack. 19

Show the effect of PUSH and POP operation on to the stack of size 10. The stack
Summer-
33 contains 40, 30, 52, 86, 39, 45, 50 with 50 being at top of the stack. Show 6
19
diagrammatically the effect of :

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

66

(i)PUSH 59 (ii) PUSH 85 (iii) POP (iv) POP (v) PUSH 59 (vi) POP .Sketch the final
structure of stack after performing the above said operations.

Summer-
34 Evaluate the following postfix expression: 57 + 62 – * 6
19

Convert infix expression into prefix expression: Winter

36 2
(A + B)*(C / G) + F 18

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

67

Convert following expression into postfix form. Give stepwise procedure. A + B ↑ C * Winter
37 4
(D / E) – F / G 18

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

68

Winter
38 Write algorithm for performing push and pop operations on stack. 6
18

Define the term recursion. Write a program in C to display factorial of an entered Winter
39 6
number using recursion. 18

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

69

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

70

Jaywant Shikshan Prasarak Mandal’s

RAJARSHI SHAHU COLLEGE OF ENGINEERING,
POLYTECHNIC
Department of Computer Engineering
Academic year: 2024-25
Course- Data Structure using C Course Code-313301
Semester- ODD (CO3I) Name of Faculty- Mrs. M. S. Patil

QUESTION BANK

UNIT 5: Queue Marks: 10

CO.5: Perform operation on Queue using Array and Linked List Implementation

Sr.
Questions Year Marks
No.
Summer 24,
Implement a ‘C ’ program to insert element into the queue and delete the Winter 23,
1 Winter 22,
4
element from the queue
Winter 19

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

71

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

72

Summer 24,
2 With a neat sketch explain working of priority queue winter 22
6

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

73

Winter 23,
3 List any four applications of queue Winter 22, 2
Winter 18

4 Draw the diagram of Linear Queue to represent front and rear pointers. Summer 23 2

Show the effect of INSERT and DELETE operation onto the linear queue of
size 10. The linear queue sequentially contains 10,20,30,40, and 50 where 10 is
front of the queue. Show diagrammatically the effect of –
I. INSERT(75)
5 II. INSERT(85) Summer 23 6
III. DELETE
IV. INSERT(60)
V. DELETE
VI. INSERT(90)

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

74

List any four types of queues. Winter- 22 2

6
1. Linear Queue
2. Circular Queue
3. Duble Ended Queue
4. Priority Queue

7 Draw the diagram of circular queue with front and rear pointers. Summer 22 2

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

75

8 Explain Queue overflow and underflow conditions with examples. Summer 22 4

9 Define queue. State any two applications where queue is used. Winter-19 2

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

76

10 Explain the concept of circular Queue along with its need. Winter-19 4

11 Enlist queue operations condition. Summer-19 2

1. Queue Full
2. Queue Empty

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

77

12 Draw and explain construction of circular queue. Summer-19 4

Describe queue full and queue empty operation conditions on linear queue with
13 Winter 18 4
suitable diagrams.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

78

14 Write a program in ‘C’ to insert an element in a linear queue. Winter 18 4

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

79

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

80

Jaywant Shikshan Prasarak Mandal’s

RAJARSHI SHAHU COLLEGE OF ENGINEERING,
POLYTECHNIC
Department of Computer Engineering
Academic year: 2024-25
Course- Data Structure using C Course Code-313301
Semester- ODD (CO3K) Name of Faculty- Mrs. M. S. Patil

QUESTION BANK
UNIT 6: Tree Marks:16
CO.6: Create and traverse Tree to solve problem

Sr. Questions Year Marks

No.

1 Define the following terms with respect to tree: Summer 24 2

(i) In-degree (ii) Out-degree

In- degree: Number of edges coming towords node is in degree of node.

Out- degree: Number of edges going out from node is out degree of node

2 Draw a binary search tree for the given numbers: Summer 24 4

50, 33, 44, 22, 77, 35, 60, 40

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

81

3 From the given tree, complete six answer: Summer 24 6

(i) Degree of tree

(ii) Degree of node 3
(iii) Level of node 5
(iv) In- degree of node 3
(v) Out- degree of node 3
(vi) Hight of tree

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

82

4 Draw the tree for given expression: Summer 24 6

(a – 2b + 5c)2 * (4d – 6e)5

5 Draw an expression tree for the following expression: Winter 23 4

(a+3b – 7c)3 * (6d – 8c)7

6 Define the term tree traversal. Construct the Binary Search Tree (BST) of Winter 23 6
following: 85, 90, 45, 60, 25, 35, 10, 20, 75, 95 and traverse the above BST in
inorder, preorder & postorder.

7 State the following terms: Summer 23 2

i) Leaf node of tree ii) Degree of a tree

Leaf node of tree: In a tree data structure, the node which does not have a child is
called leaf node.
Degree of node: The degree of a tree is the maximum degree of the node in the tree.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

83

8 Differentiate between tree and graph with respect to any four parameters Summer 23, 4
Winter 19

9 Construct the binary Search tree using following elements : Summer 23 4

{35,15,40,7,10,100,28,82,53,25,3}. Show diagrammatically each step of
construction of BST

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

84

10 Summer 23 6

From the given tree, complete the following answer:

I) Degree of tree: _____________
II) Degree of node B: ___________
III) Level of node H: _____________
IV) Indegree of node C: ___________
V) Outdegree of node B: __________
VI) Height of the tree: ____________

11 Winter- 22 2
Write algorithm for preorder traversal of binary tree.

Pre order: Step 1: visit the root

Step 2: traverse the left subtree
Step 3: traverse the right subtree

12 Explain Binary Search Tree (BST) with example. Winter- 22 4

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

85

13 Winter- 22 4
Draw tree for given expression : (a-2b+5c)2 * (4d-6e)

14 Define : (i) General tree (ii) Binary tree Summer 22 2

General tree: is a tree where each node may have zero or more children.
Binary tree: is a tree where every node can have maximum of two children is called
as binary tree.

15 Construct a binary search tree for following elements: Summer 22 4

22, 27,14,31,40,43,44,10,20,35

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

86

16 Draw tree for given expression and find pre-order and post-order traversal. Summer 22 6

(2b + 5c)2 (4d – 6e)5

17 Draw a binary search tree for the given numbers : 50, 33, 44, 22, 77, 35, 60, 40. Winter 19 4

18 Draw an expression tree for the following expression : (a – 2b + 5c)2 * (4d = 6e)5 Winter 19 4

19 Define : (i) Binary tree (ii) Binary search tree Summer-19 2

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

87

20 Draw the tree structure of the following expressions: Summer-19 4

(i) (2a + 5b)3  (x – 7y)4

(ii) (a – 3b)  (2x – y)3

21 Traverse the following tree by the in-order, pre-order and post-order methods : Summer-19 6

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

88

22 Describe following terms w.r.to tree : (i) leaf node (ii) level of node Winter 18 2

23 Differentiate between general tree and binary tree. (any four points) Winter 18 4

24 Construct a binary search tree for following elements : Winter 18 4

30, 100, 90, 15, 2, 25, 36, 72, 78, 10 show each step of construction of BST.

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

89

25 For given binary tree write in-order, pre-order and post-order traversal. Winter 18 6

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

90

RSCOEP Department of Computer Engineering Mrs. M. S. Patil

Jaywant Shikshan Prasarak Mandal’s
RAJARSHI SHAHU COLLEGE OF ENGINEERING’s
POLYTECHNIC
S.No.80, Pune-Mumbai Bypass Highway, Tathawade Campus, Pune.

Approved By AICTE & Govt. of Maharashtra, Affilated to MSBTE

NBA ACCREDITED

DTE Code – 6141 MSBTE Inst. Code - 1620

“MASTER SOLUTIONs”

(MSBTE Question Papers of ‘I’ scheme)

Sequence No. Year

Question Paper
1 Winter 18
2 Summer 19
3 Winter 19
4 Winter 22
5 Summer 22
6 Winter 23
7 Summer 23
8 Summer 24

Department of Computer Engineering

RSCOEP COMPUTERENGINEERING DEPARTMENT Prof.M.S.Patil

11819
22317
3 Hours / 70 Marks Seat No.

Instructions : (1) All Questions are compulsory.

(2) Illustrate your answers with neat sketches wherever necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.

Marks
1. Attempt any FIVE of the following : 10
(a) Define the term algorithm.
(b) List any 4 applications of queue.
(c) Describe following terms w.r.to tree :
(i) leaf node
(ii) level of node
(d) Differentiate between stack and queue. (any two points)
(e) Describe undirected graph with suitable example.
(f) Define the terms : linear data structure and non-linear data structure.
(g) Convert infix expression into prefix expression : (A + B)*(C / G) + F

2. Attempt any THREE of the following : 12

(a) Describe working of linear search with example.
(b) Describe the concept of linked list with the terminologies : node, next pointer,
null pointer and empty list.
(c) Describe queue full and queue empty operation conditions on linear queue
with suitable diagrams.
(d) Differentiate between general tree and binary tree. (any four points)

[1 of 4] P.T.O.
22317 [2 of 4]
3. Attempt any THREE of the following : 12

(a) Write ‘c’ program for deletion of an element from an array.

(b) Convert following expression into postfix form. Give stepwise procedure.

A + B ↑ C * (D / E) – F / G

(c) Find the position of element 29 using binary search method in an array ‘A’
given below. Show each step.

A = {11, 5, 21, 3, 29, 17, 2, 43}

(d) Give adjacency list and adjacency matrix for given graph :

4. Attempt any THREE of the following : 12

(a) Describe working of bubble sort with example.

(b) Construct a binary search tree for following elements :

30, 100, 90, 15, 2, 25, 36, 72, 78, 10 show each step of construction of BST.

(c) Write an algorithm to count number of nodes in singly linked list.

(d) Write a program in ‘C’ to insert an element in a linear queue.

(e) Describe circular linked list with suitable diagram. Also state advantage of
circular linked list over linear linked list.
22317 [3 of 4]
5. Attempt any TWO of following : 12

(a) Write algorithm for performing push and pop operations on stack.

(b) For given binary tree write in-order, pre-order and post-order traversal.

(c) Write an algorithm to insert an element at the beginning and at end of linked
list.

6. Attempt any TWO of the following : 12

(a) Describe working of selection sort method. Also sort given input list in
ascending order using selection sort input list – 55, 25, 5, 15, 35.

(b) Define the term recursion. Write a program in C to display factorial of a

entered number using recursion.

(c) Describe procedure to delete an element from singly linked list using diagram.

_______________

P.T.O.
22317 [4 of 4]
21819
22317
3 Hours / 70 Marks Seat No.

Instructions : (1) All Questions are compulsory.

(2) Illustrate your answers with neat sketches wherever necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.
(5) Mobile Phone, Pager and any other Electronic Communication
devices are not permissible in Examination Hall.

Marks

1. Attempt any FIVE of the following : 10

(a) List any four operations on data structure.

(b) Enlist queue operations condition.

(c) Define :

(i) Binary tree (ii) Binary search tree

(d) Show the memory representation of stack using array with the help of a
diagram.

(e) Define given two types of graph and give example.

(i) Direct graph (ii) Undirected graph

(f) Differentiate between linear and non-linear data structures on any two
parameters.

(g) Convert the following infix expression to its prefix form using stack

A+B–CD/E+F
[1 of 4] P.T.O.
22317 [2 of 4]
2. Attempt any THREE of the following : 12

(a) Explain the working of Binary search with an example.

(b) Write a program to traverse a linked list.

(c) Draw and explain construction of circular queue.

(d) Explain indegree and outdegree of a graph with example.

3. Attempt any THREE of the following : 12

(a) Write C program for performing following operations on array : insertion,

display.

(b) Evaluate the following postfix expression :

5, 6, 2, +, , 12, 4, /, – Show diagrammatically each step of evolution using

stack.

(c) Sort the following numbers in ascending order using quick sort. Given
numbers 50, 2, 6, 22, 3, 39, 49, 25, 18, 5.

(d) From the following graph, complete the answers :

(i) Indegree of node 21

(ii) Adjacent node of 19

(iii) Path of 31

(iv) Successor of node 67

22317 [3 of 4]
4. Attempt any THREE of the following : 12
(a) Differentiate between binary search and sequential search (linear search).
(b) Draw the tree structure of the following expressions :
(i) (2a + 5b)3  (x – 7y)4 (ii) (a – 3b)  (2x – y)3
(c) Create a singly linked list using data fields 15, 20, 22, 58, 60. Search a node
22 from the SLL and show procedure step-by-step with the help of diagram
from start to end.
(d) Evaluate the following prefix expression :
–  + 4 3 2 5 show diagrammatically each step of evaluation using stack.
(e) Write an algorithm to delete a node from the beginning of a circular linked list.

5. Attempt any TWO of the following : 12

(a) Show the effect of PUSH and POP operation on to the stack of size 10. The
stack contains 40, 30, 52, 86, 39, 45, 50 with 50 being at top of the stack.
Show diagrammatically the effect of :
(i) PUSH 59 (ii) PUSH 85
(iii) POP (iv) POP
(v) PUSH 59 (vi) POP
Sketch the final structure of stack after performing the above said operations.
(b) Traverse the following tree by the in-order, pre-order and post-order methods :

(c) Write an algorithm to count number of nodes in singly linked list.

P.T.O.
22317 [4 of 4]
6. Attempt any TWO of the following : 12

(a) Sort the following numbers in ascending order using Bubble sort. Given
numbers : 29, 35, 3, 8, 11, 15, 56, 12, 1, 4, 85, 5 & write the output after each
interaction.

(b) Evaluate the following postfix expression :

57 + 62 – 

(c) Create a singly linked list using data fields 90, 25, 46, 39, 56. Search a node
40 from the SLL and show procedure step-by-step with the help of diagram
from start to end.

_______________
11920
22317
3 Hours / 70 Marks Seat No.

Instructions : (1) All Questions are compulsory.

(2) Answer each next main Question on a new page.
(3) Illustrate your answers with neat sketches wherever necessary.
(4) Figures to the right indicate full marks.
(5) Assume suitable data, if necessary.
(6) Mobile Phone, Pager and any other Electronic Communication
devices are not permissible in Examination Hall.

Marks

1. Attempt any FIVE of the following : 10

(a) Write any four operations that can be performed on data structure.

(b) Define the terms ‘overflow’ and ‘underflow’ with respect to stack.

(c) Define the following terms w.r.t. tree : (i) In-degree, (2) Out-degree

(d) Evaluate the following arithmetic expression P written in postfix notation :

P : 4, 2, ^, 3, *, 3, -, 8, 4, /, +

(e) Describe directed and undirected graph.

(f) Give classification of data structure.

(g) Define queue. State any two applications where queue is used.

2. Attempt any THREE of the following : 12

(a) Sort the given numbers in ascending order using Radix sort :

348, 14, 641, 3851, 74

[1 of 4] P.T.O.
22317 [2 of 4]
(b) Write an algorithm to insert a new node at the beginning and end of the singly
linked list.
(c) Explain the concept of circular Queue along with its need.
(d) Draw a binary search tree for the given numbers :
50, 33, 44, 22, 77, 35, 60, 40.

3. Attempt any THREE of the following : 12

(a) Explain time and space complexity with an example.
(b) Convert the following infix expression to postfix expression using stack and
show the details of stack in each step.
((A+B)*D)^(E-F)
(c) Implement a ‘C’ program to search a particular data from the given array
using Linear Search.
(d) Draw an expression tree for the following expression :
(a – 2b + 5c)2 * (4d = 6e)5

4. Attempt any THREE of the following : 12

(a) Find the position of element 21 using Binary Search method in Array ‘A’
given below :
A = {11, 5, 21, 3, 29, 17, 2, 45}
(b) Differentiate between tree and graph. (Any 4 points)
(c) Construct a singly linked list using data fields 21, 25, 96, 58, 74 and show
procedure step-by-step with the help of diagram start to end.
(d) Show the effect of PUSH and POP operations on the stack of size 10.
PUSH(10)
PUSH(20)
POP
PUSH(30)
(e) Compare Linked List and Array. (any 4 points)
22317 [3 of 4]
5. Attempt the following any TWO of the following : 12
(a) Implement a ‘C’ program to insert element into the queue and delete the
element from the queue.
(b) Consider the graph given in following figure and answer given questions.

(1) All simple path from 1 to 5

(2) In-degree of and out-degree of 4
(3) Give adjacency matrix for the given graph.
(4) Give adjacency list representation of the given graph.
(c) Write an algorithm to search a particular node in the given linked list.

6. Attempt any TWO of the following : 12

(a) Elaborate the steps for performing selection sort for given elements of array.
A = {37, 12, 4, 90, 49, 23, –19}
(b) Explain the concept of recursion using stack.
(c) Show with suitable diagrams how to delete a node from singly linked list at
the beginning, in between and at the end of the list.
_______________

P.T.O.
22317 [4 of 4]
12223
22317
3 Hours / 70 Marks Seat No.

Instructions : (1) All Questions are compulsory.

(2) Illustrate your answers with neat sketches wherever necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.
(5) Mobile Phone, Pager and any other Electronic Communication
devices are not permissible in Examination Hall.

Marks

1. Attempt any FIVE of the following : 10

(a) Define complexity and classify it.

(b) State the following terms :

(i) searching

(ii) sorting
(c) List any four applications of stack.
(d) List any four types of queue.
(e) Define Abstract data type.
(f) Define the following terms :
(i) Sibling
(ii) Depth of tree
(g) Write algorithm for preorder traversal of binary tree.

[1 of 4] P.T.O.
22317 [2 of 4]
2. Attempt any THREE of the following : 12
(a) Write a program to implement bubble sort.
(b) Convert following expression into postfix form with illustration of all steps
using stack :
(A + B – C + D*E/F^G)
(c) Differentiate between Stack and Queue (any four points).
(d) Explain node structure for single linked list. Also write advantages of singly
list over array. (any Two)

3. Attempt any THREE of the following : 12

(a) Explain stack overflow and stack underflow with example.
(b) With a neat sketch explain working of priority queue.
(c) Find location of element 20 by using binary search algorithm in the list given
below :
10, 20, 30, 40, 50, 60, 70, 80
(d) Explain Binary Search Tree (BST) with example.

4. Attempt any THREE of the following : 12

(a) Differentiate between linear and non-linear data structure. (any four points)
(b) Consider the graph given below :

(i) Find indegree(x)

(ii) Find outdegree(z)
(iii) Find sink node
(iv) Successor of node y
22317 [3 of 4]
(c) Describe working of linear search with example.
(d) Compare linear list with circular list.
(e) Write an algorithm to insert a new node at the beginning in linear list.

5. Attempt any TWO of the following : 12

(a) Draw tree for given expression :
(a – 2b + 5c)2 * (4d – 6e)5.
(b) Write a ‘C’ program for insert and delete operation to be performed on queue.
(c) Write a ‘C’ program for insertion sort. Sort the following array using insertion
sort :
30 10 40 50 20 45

6. Attempt any TWO of the following : 12

(a) Consider the graph G given below :

(i) Write Adjacency matrix representation.

(ii) Write Adjacency list.
(b) Write a menu driven ‘C’ program to implement stack using array with the
following menu :
(i) push
(ii) pop
(iii) display
(iv) exit
(c) Write the ‘C’ function for :
(i) searching a node in single linked list.
(ii) counting number of nodes in single linked list.
___________

P.T.O.
22317 [4 of 4]
21222
22317
3 Hours / 70 Marks Seat No.
15 minutes extra for each hour

Instructions : (1) All Questions are compulsory.

(2) Illustrate your answers with neat sketches wherever necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.

Marks
1. Attempt any FIVE of the following : 10
(a) Define linear data structure and non-linear data structure.
(b) Enlist operations on stack.
(c) Define : (i) General tree (ii) Binary tree
(d) Draw the diagram of circular queue with front and rear pointers.
(e) Describe given two types of graphs : Directed and Undirected graph.
(f) Define Abstract Data Type.
(g) State any four applications of queue.

2. Attempt any THREE of the following : 12

(a) Describe the working of Bubble sort method with an example.
(b) Write an algorithm to traverse a linked list.
(c) Explain Queue overflow and underflow conditions with examples.
(d) Explain the following terminologies with respect to graph :
(i) In degree (ii) Out degree
(iii) Successor (iv) Predecessor

[1 of 4] P.T.O.
22317 [2 of 4]
3. Attempt any THREE of the following : 12

(a) Describe time and space complexity with example of each.

(b) Evaluate the following postfix expression :

10, 2, *, 15, 3, /, +, 12, 3, +, +

Show diagrammatically each step of evaluation using stack.

(c) Find the position of element 30 using Binary search method in array

A = {10, 5, 20, 25, 8, 30, 40}

(d) For the following graph :

(i) Give adjacency matrix representation

(ii) Give adjacency list representation

4. Attempt any THREE of the following : 12

(a) Describe the working of radix sort with example.

(b) Construct a binary search tree for following elements :

22, 27, 14, 31, 40, 43, 44, 10, 20, 35

Show each step of construction of BST.

(c) Write an algorithm to insert a new node at the beginning of a Singly linked
list. Give example.

(d) Write a ‘C’ program to calculate the factorial of number using recursion.

(e) Describe circular linked list with suitable diagram. Also state advantage of
circular linked list over linear linked list.
22317 [3 of 4]
5. Attempt any TWO of the following : 12

(a) Write a program to implement a stack with push, pop and display operations.

(b) Draw tree for given expression and find pre-order and post-order traversal.

(2b + 5c)2 (4d – 6e)5

(c) Write an algorithm to search an element in linked list.

6. Attempt any TWO of the following : 12

(a) Describe the working of Selection Sort Method. Also sort given input list in
ascending order using selection sort.

Input list : 50, 24, 5, 12, 30

(b) Convert the following Infix expression to its prefix form using stack. Show
the details of stack at each step of conversion.

Expression : P * Q  R – S / T + (U/V)

(c) Create a Singly linked list using data fields 70, 50, 30, 40, 90. Search a node
40 from the singly linked list & show procedure step-by-step with the help of
diagram from start to end.

_______________

P.T.O.
22317 [4 of 4]
21819
22317
3 Hours / 70 Marks Seat No.

Instructions : (1) All Questions are compulsory.

(2) Illustrate your answers with neat sketches wherever necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data, if necessary.
(5) Mobile Phone, Pager and any other Electronic Communication
devices are not permissible in Examination Hall.

Marks

1. Attempt any FIVE of the following : 10

a) State any two differences between linear search and binary search

b)Define term pointer and null pointer

c) Define the terms: Linear data structure and non-linear data structure

d)List any four applications of queue

e) Write any four operations that can be performed on data structure

f) Convert the following infix expression to its postfix form using stack: A + B – C *
D/E+F

g) Describe given two types of graphs: Directed graph and Undirected graph

2. Attempt any THREE of the following : 12

a) Describe working of selection sort method with suitable example
b) Write algorithm to delete an intermediate node from a singly linked list.
c) Differentiate between tree and graph w.r.t any four parameters
d) Convert the given infix expression to postfix expression using stack and the details
of stack at each step of conversion Expression: A * B  C – D / E +[F / G]
3. Attempt any THREE of the following : 12

a) Explain complexity of following algorithms in terms of time and space:

i) Binary Search ii) Bubble Sort

b) Draw an expression tree for the following expression: (a+3b – 7c)3 * (6d – 8c)7
c) Describe working of bubble sort with example
d) Show the effect of PUSH and POP operation on the stack of size 10. The stack
contains 10, 20, 25, 15, 30 and 40 with 40 being at top of stack. Show
diagrammatically the effect of
i) PUSH (45) ii) PUSH (50) iii) POP iv) PUSH (55)

4. Attempt any THREE of the following : 12

a) Create singly linked list using data fields 10, 20, 30, 40, 50 and show step by step
procedure with the help of diagram from start to end.

b) Describe advantages of circular link list over linear link list with example

c) Explain the working of Radix sort method with an example

d) Write an algorithm to count no. of nodes in singly linked list.

e) Consider the graph ‘ G’ in the following figure:

I. Find all simple path from X & Z

II. Find indegree and outdegree of node Y and Z

III. Find adjacency matrix A for the above graph

IV. Give adjacency list representation of above graph

5. Attempt any TWO of the following:

12

a) Define the term tree traversal. Construct the Binary Search Tree (BST) of following:
85, 90, 45, 60, 25, 35, 10, 20, 75, 95 and traverse the above BST in inorder, preorder
& postorder.

b) Explain operation on singly linked list.

c) Implement a 'C' program to insert element into the queue and delete the element
from the queue.
6. Attempt any TWO of the following: 12

a) Find out prefix equivalent of the expression ,

I. [(A+B)+C]*D

II. A[(B * C) + D]

b) Sort the following number in ascending order using bubble sort. Given numbers as
follows : 475, 15, 513, 6753, 45, 118.

c) Describe circular linked list with suitable diagram. State advantages of circular
linked list over linear linked list.
1
2
3
4
1
2
3
4
Jaywant Shikshan Prasarak Mandal’s
RAJARSHI SHAHU COLLEGE OF ENGINEERING’s
POLYTECHNIC
S.No.80, Pune-Mumbai Bypass Highway, Tathawade Campus, Pune.

Approved By AICTE & Govt. of Maharashtra, Affilated to MSBTE

NBA ACCREDITED

DTE Code – 6141 MSBTE Inst. Code - 1620

ALL THE BEST!!!

Department of Computer Engineering

RSCOEP COMPUTERENGINEERING DEPARTMENT Prof.M.S.Patil