FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE
📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download Anna University B-Tech ECE 3rd Sem EC8381 Fundamentals of Data Structures in C FDSC Lab Manual Question Paper

Download Anna University B.Tech (Bachelor of Technology) ECE (Electronics And Communications Engineering) 3rd Sem EC8381 Fundamentals of Data Structures in C FDSC Lab Manual Question Paper.

This post was last modified on 13 December 2019

Tags: Anna University B.Tech ECE 3rd Sem EC8381 Fundamentals of Data Structures in C FDSC Lab Manual Question Paper PDF Download
Download Document
Download Document




?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES


FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---





?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.


--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---


DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


--- Content provided by FirstRanker.com ---

To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


--- Content provided by FirstRanker.com ---

? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,

--- Content provided by FirstRanker.com ---

innovation and ethical practices

VISION
MISSION
VISION

--- Content provided by FirstRanker.com ---

MISSION



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of

--- Content provided by FirstRanker.com ---

Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will

--- Content provided by FirstRanker.com ---

build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and

--- Content provided by FirstRanker.com ---

pursuing advanced degrees




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications

--- Content provided by FirstRanker.com ---

d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable

--- Content provided by FirstRanker.com ---

h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS




--- Content provided by FirstRanker.com ---


? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms

--- Content provided by FirstRanker.com ---

LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---


4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


12. Implementation Hash functions, collision resolution technique



--- Content provided by FirstRanker.com ---



COURSE OBJECTIVES


--- Content provided by FirstRanker.com ---


5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized

--- Content provided by FirstRanker.com ---

way.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





COURSE OUTCOMES

--- Content provided by FirstRanker.com ---




6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---


Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---


7

2
Programs using strings ? string function implementation 13

--- Content provided by FirstRanker.com ---

3

Programs using structures and pointers

15

--- Content provided by FirstRanker.com ---

4
Programs involving dynamic memory allocations

20
5

--- Content provided by FirstRanker.com ---

Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues
29

--- Content provided by FirstRanker.com ---

7
Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

39
9
Implementation of Binary Search trees
41
10

--- Content provided by FirstRanker.com ---

Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

50
12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.

--- Content provided by FirstRanker.com ---

5. This process repeats until the test expression is false.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---

Thus the program to find the sum of n natural numbers was executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---



Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---



Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---

To write a c program using structures.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---


4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---

XYZ & Co. Payroll

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---


********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---


********************************************************************************


Result :

--- Content provided by FirstRanker.com ---


Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---


1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?

--- Content provided by FirstRanker.com ---

VIVA - VOCE


FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---


To write a c program using structures.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---


6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---


XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00

--- Content provided by FirstRanker.com ---

463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************


--- Content provided by FirstRanker.com ---

Result :

Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---



1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?

--- Content provided by FirstRanker.com ---

4. What is meant by address operator?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?
6. Why you need pointers in C?

--- Content provided by FirstRanker.com ---

7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.

--- Content provided by FirstRanker.com ---

5. Display the result.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---



Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---

To write a c program using structures.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---


4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---

XYZ & Co. Payroll

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---


********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---


********************************************************************************


Result :

--- Content provided by FirstRanker.com ---


Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---


1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?

--- Content provided by FirstRanker.com ---

8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY

--- Content provided by FirstRanker.com ---

ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorthim:

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter integer value: 100

--- Content provided by FirstRanker.com ---

Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:

--- Content provided by FirstRanker.com ---

Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded

--- Content provided by FirstRanker.com ---

software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?

--- Content provided by FirstRanker.com ---

4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?

--- Content provided by FirstRanker.com ---

9.What is the significance of calloc()?
10.What is syntax for calloc()?
.


--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION


FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---



Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---

To write a c program using structures.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---


4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---

XYZ & Co. Payroll

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---


********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---


********************************************************************************


Result :

--- Content provided by FirstRanker.com ---


Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---


1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?

--- Content provided by FirstRanker.com ---

8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY

--- Content provided by FirstRanker.com ---

ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorthim:

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter integer value: 100

--- Content provided by FirstRanker.com ---

Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:

--- Content provided by FirstRanker.com ---

Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded

--- Content provided by FirstRanker.com ---

software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?

--- Content provided by FirstRanker.com ---

4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?

--- Content provided by FirstRanker.com ---

9.What is the significance of calloc()?
10.What is syntax for calloc()?
.


--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)

--- Content provided by FirstRanker.com ---

6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate

--- Content provided by FirstRanker.com ---

the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY

--- Content provided by FirstRanker.com ---

1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 23

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2

--- Content provided by FirstRanker.com ---

Popped element is 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---


Thus the program for array implementation of stack is executed successfully.



--- Content provided by FirstRanker.com ---



25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of queue.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)

--- Content provided by FirstRanker.com ---

6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---


1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---




26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---


26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set

--- Content provided by FirstRanker.com ---

both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.

--- Content provided by FirstRanker.com ---

4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 45

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---


To write a c program using structures.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---


6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---


XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00

--- Content provided by FirstRanker.com ---

463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************


--- Content provided by FirstRanker.com ---

Result :

Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---



1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?

--- Content provided by FirstRanker.com ---

4. What is meant by address operator?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?
6. Why you need pointers in C?

--- Content provided by FirstRanker.com ---

7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.

--- Content provided by FirstRanker.com ---

5. Display the result.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:

--- Content provided by FirstRanker.com ---

The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?

--- Content provided by FirstRanker.com ---

3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?

--- Content provided by FirstRanker.com ---

8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])

--- Content provided by FirstRanker.com ---

5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---




23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)

--- Content provided by FirstRanker.com ---

DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).

--- Content provided by FirstRanker.com ---

4. Repeat above step until i value becomes '0'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 12

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 45 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 4


--- Content provided by FirstRanker.com ---

Result :

Thus the program for array implementation of stack is executed successfully.


--- Content provided by FirstRanker.com ---




25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])

--- Content provided by FirstRanker.com ---

5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


--- Content provided by FirstRanker.com ---

ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 12

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Queue Full

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---


Front--> 12 23 34 45 56 <--Rear



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---



1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?

--- Content provided by FirstRanker.com ---

4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?

--- Content provided by FirstRanker.com ---

9. Give some application of stack and queue?
10. What is stack overflow?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF

--- Content provided by FirstRanker.com ---

STACK

Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function

--- Content provided by FirstRanker.com ---

calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---





?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.


--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---


DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


--- Content provided by FirstRanker.com ---

To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


--- Content provided by FirstRanker.com ---

? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,

--- Content provided by FirstRanker.com ---

innovation and ethical practices

VISION
MISSION
VISION

--- Content provided by FirstRanker.com ---

MISSION



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of

--- Content provided by FirstRanker.com ---

Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will

--- Content provided by FirstRanker.com ---

build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and

--- Content provided by FirstRanker.com ---

pursuing advanced degrees




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications

--- Content provided by FirstRanker.com ---

d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable

--- Content provided by FirstRanker.com ---

h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS




--- Content provided by FirstRanker.com ---


? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms

--- Content provided by FirstRanker.com ---

LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---


4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


12. Implementation Hash functions, collision resolution technique



--- Content provided by FirstRanker.com ---



COURSE OBJECTIVES


--- Content provided by FirstRanker.com ---


5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized

--- Content provided by FirstRanker.com ---

way.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





COURSE OUTCOMES

--- Content provided by FirstRanker.com ---




6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---


Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---


7

2
Programs using strings ? string function implementation 13

--- Content provided by FirstRanker.com ---

3

Programs using structures and pointers

15

--- Content provided by FirstRanker.com ---

4
Programs involving dynamic memory allocations

20
5

--- Content provided by FirstRanker.com ---

Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues
29

--- Content provided by FirstRanker.com ---

7
Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

39
9
Implementation of Binary Search trees
41
10

--- Content provided by FirstRanker.com ---

Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

50
12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.

--- Content provided by FirstRanker.com ---

5. This process repeats until the test expression is false.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---

Thus the program to find the sum of n natural numbers was executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---



Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise AND operator & = 8

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise OR operator | = 29

A= 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12
complement = -36

--- Content provided by FirstRanker.com ---

Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106

--- Content provided by FirstRanker.com ---

Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848

--- Content provided by FirstRanker.com ---

Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---



Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.

--- Content provided by FirstRanker.com ---

5. Display the output.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35

--- Content provided by FirstRanker.com ---

Enter number3: 38
Enter number4: 31
Enter number5: 49

Average = 39

--- Content provided by FirstRanker.com ---

Result :

Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller

--- Content provided by FirstRanker.com ---

? Developing verifications of software code ,simulator.



1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---


2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---


7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---

9. What is multi dimensional array ?

10. How to access the elements in the array.


--- Content provided by FirstRanker.com ---

VIVA - VOCE



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


--- Content provided by FirstRanker.com ---

AIM:

To write a c program to perform string manipulation function.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Get the string by using gets() function.

4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---



1. What is a function ?
2. Mention the types of function.
3. What is a character ?

--- Content provided by FirstRanker.com ---

4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---


To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---


4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---


Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---



Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---

4. Call the required functions inside the main function.

5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter No. of Employees : 2

Enter Employee Details

Enter Employee Id : 436

--- Content provided by FirstRanker.com ---

Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---


********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---

********************************************************************************


Result :

--- Content provided by FirstRanker.com ---

Thus the program using structure is executed successfully.

Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---


Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


--- Content provided by FirstRanker.com ---

1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?

--- Content provided by FirstRanker.com ---

9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---


Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorthim:
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter integer value: 100
Enter character value: x

--- Content provided by FirstRanker.com ---

Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---


1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?

--- Content provided by FirstRanker.com ---

5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?

--- Content provided by FirstRanker.com ---

10.What is syntax for calloc()?
.



--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a

--- Content provided by FirstRanker.com ---

constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to

--- Content provided by FirstRanker.com ---

perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION


--- Content provided by FirstRanker.com ---


23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---


STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack is executed successfully.




--- Content provided by FirstRanker.com ---


25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific

--- Content provided by FirstRanker.com ---

value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls

--- Content provided by FirstRanker.com ---

to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as

--- Content provided by FirstRanker.com ---

deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 34

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the program for array implementation of stack and queue is attained.



--- Content provided by FirstRanker.com ---

1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?

--- Content provided by FirstRanker.com ---

6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---




30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---





?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.


--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---


DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


--- Content provided by FirstRanker.com ---

To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


--- Content provided by FirstRanker.com ---

? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,

--- Content provided by FirstRanker.com ---

innovation and ethical practices

VISION
MISSION
VISION

--- Content provided by FirstRanker.com ---

MISSION



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of

--- Content provided by FirstRanker.com ---

Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will

--- Content provided by FirstRanker.com ---

build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and

--- Content provided by FirstRanker.com ---

pursuing advanced degrees




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications

--- Content provided by FirstRanker.com ---

d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable

--- Content provided by FirstRanker.com ---

h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS




--- Content provided by FirstRanker.com ---


? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms

--- Content provided by FirstRanker.com ---

LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---


4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


12. Implementation Hash functions, collision resolution technique



--- Content provided by FirstRanker.com ---



COURSE OBJECTIVES


--- Content provided by FirstRanker.com ---


5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized

--- Content provided by FirstRanker.com ---

way.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





COURSE OUTCOMES

--- Content provided by FirstRanker.com ---




6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---


Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---


7

2
Programs using strings ? string function implementation 13

--- Content provided by FirstRanker.com ---

3

Programs using structures and pointers

15

--- Content provided by FirstRanker.com ---

4
Programs involving dynamic memory allocations

20
5

--- Content provided by FirstRanker.com ---

Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues
29

--- Content provided by FirstRanker.com ---

7
Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

39
9
Implementation of Binary Search trees
41
10

--- Content provided by FirstRanker.com ---

Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

50
12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.

--- Content provided by FirstRanker.com ---

5. This process repeats until the test expression is false.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---

Thus the program to find the sum of n natural numbers was executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---



Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise AND operator & = 8

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise OR operator | = 29

A= 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12
complement = -36

--- Content provided by FirstRanker.com ---

Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106

--- Content provided by FirstRanker.com ---

Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848

--- Content provided by FirstRanker.com ---

Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---



Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.

--- Content provided by FirstRanker.com ---

5. Display the output.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35

--- Content provided by FirstRanker.com ---

Enter number3: 38
Enter number4: 31
Enter number5: 49

Average = 39

--- Content provided by FirstRanker.com ---

Result :

Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller

--- Content provided by FirstRanker.com ---

? Developing verifications of software code ,simulator.



1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---


2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---


7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---

9. What is multi dimensional array ?

10. How to access the elements in the array.


--- Content provided by FirstRanker.com ---

VIVA - VOCE



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


--- Content provided by FirstRanker.com ---

AIM:

To write a c program to perform string manipulation function.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Get the string by using gets() function.

4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---



1. What is a function ?
2. Mention the types of function.
3. What is a character ?

--- Content provided by FirstRanker.com ---

4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---


To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---


4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---


Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---



Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---

4. Call the required functions inside the main function.

5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter No. of Employees : 2

Enter Employee Details

Enter Employee Id : 436

--- Content provided by FirstRanker.com ---

Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---


********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---

********************************************************************************


Result :

--- Content provided by FirstRanker.com ---

Thus the program using structure is executed successfully.

Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---


Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


--- Content provided by FirstRanker.com ---

1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?

--- Content provided by FirstRanker.com ---

9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---


Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorthim:
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter integer value: 100
Enter character value: x

--- Content provided by FirstRanker.com ---

Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---


1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?

--- Content provided by FirstRanker.com ---

5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?

--- Content provided by FirstRanker.com ---

10.What is syntax for calloc()?
.



--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a

--- Content provided by FirstRanker.com ---

constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to

--- Content provided by FirstRanker.com ---

perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION


--- Content provided by FirstRanker.com ---


23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---


STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack is executed successfully.




--- Content provided by FirstRanker.com ---


25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific

--- Content provided by FirstRanker.com ---

value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls

--- Content provided by FirstRanker.com ---

to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as

--- Content provided by FirstRanker.com ---

deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 34

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the program for array implementation of stack and queue is attained.



--- Content provided by FirstRanker.com ---

1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?

--- Content provided by FirstRanker.com ---

6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---




30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---



Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---

To write a c program using structures.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---


4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---

XYZ & Co. Payroll

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---


********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---


********************************************************************************


Result :

--- Content provided by FirstRanker.com ---


Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---


1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?

--- Content provided by FirstRanker.com ---

8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY

--- Content provided by FirstRanker.com ---

ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorthim:

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter integer value: 100

--- Content provided by FirstRanker.com ---

Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:

--- Content provided by FirstRanker.com ---

Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded

--- Content provided by FirstRanker.com ---

software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?

--- Content provided by FirstRanker.com ---

4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?

--- Content provided by FirstRanker.com ---

9.What is the significance of calloc()?
10.What is syntax for calloc()?
.


--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)

--- Content provided by FirstRanker.com ---

6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate

--- Content provided by FirstRanker.com ---

the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY

--- Content provided by FirstRanker.com ---

1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 23

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2

--- Content provided by FirstRanker.com ---

Popped element is 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---


Thus the program for array implementation of stack is executed successfully.



--- Content provided by FirstRanker.com ---



25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of queue.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)

--- Content provided by FirstRanker.com ---

6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---


1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---




26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 23

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---

Front--> 12 23 34 45 56 <--Rear




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome:
Thus the program for array implementation of stack and queue is attained.


--- Content provided by FirstRanker.com ---


1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?

--- Content provided by FirstRanker.com ---

5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?

--- Content provided by FirstRanker.com ---

10. What is stack overflow?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined

--- Content provided by FirstRanker.com ---

functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.

--- Content provided by FirstRanker.com ---

5. Finally, set top = newNode.



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls

--- Content provided by FirstRanker.com ---

in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.




--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---



Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---

To write a c program using structures.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---


4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---

XYZ & Co. Payroll

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---


********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---


********************************************************************************


Result :

--- Content provided by FirstRanker.com ---


Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---


1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?

--- Content provided by FirstRanker.com ---

8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY

--- Content provided by FirstRanker.com ---

ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorthim:

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter integer value: 100

--- Content provided by FirstRanker.com ---

Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:

--- Content provided by FirstRanker.com ---

Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded

--- Content provided by FirstRanker.com ---

software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?

--- Content provided by FirstRanker.com ---

4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?

--- Content provided by FirstRanker.com ---

9.What is the significance of calloc()?
10.What is syntax for calloc()?
.


--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)

--- Content provided by FirstRanker.com ---

6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate

--- Content provided by FirstRanker.com ---

the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY

--- Content provided by FirstRanker.com ---

1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 23

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2

--- Content provided by FirstRanker.com ---

Popped element is 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---


Thus the program for array implementation of stack is executed successfully.



--- Content provided by FirstRanker.com ---



25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of queue.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)

--- Content provided by FirstRanker.com ---

6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---


1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---




26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 23

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---

Front--> 12 23 34 45 56 <--Rear




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome:
Thus the program for array implementation of stack and queue is attained.


--- Content provided by FirstRanker.com ---


1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?

--- Content provided by FirstRanker.com ---

5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?

--- Content provided by FirstRanker.com ---

10. What is stack overflow?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined

--- Content provided by FirstRanker.com ---

functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.

--- Content provided by FirstRanker.com ---

5. Finally, set top = newNode.



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls

--- Content provided by FirstRanker.com ---

in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.




--- Content provided by FirstRanker.com ---


33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---


DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform infix to postfix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---


4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---


6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---





?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.


--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---


DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


--- Content provided by FirstRanker.com ---

To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


--- Content provided by FirstRanker.com ---

? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,

--- Content provided by FirstRanker.com ---

innovation and ethical practices

VISION
MISSION
VISION

--- Content provided by FirstRanker.com ---

MISSION



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of

--- Content provided by FirstRanker.com ---

Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will

--- Content provided by FirstRanker.com ---

build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and

--- Content provided by FirstRanker.com ---

pursuing advanced degrees




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications

--- Content provided by FirstRanker.com ---

d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable

--- Content provided by FirstRanker.com ---

h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS




--- Content provided by FirstRanker.com ---


? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms

--- Content provided by FirstRanker.com ---

LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---


4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


12. Implementation Hash functions, collision resolution technique



--- Content provided by FirstRanker.com ---



COURSE OBJECTIVES


--- Content provided by FirstRanker.com ---


5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized

--- Content provided by FirstRanker.com ---

way.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





COURSE OUTCOMES

--- Content provided by FirstRanker.com ---




6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---


Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---


7

2
Programs using strings ? string function implementation 13

--- Content provided by FirstRanker.com ---

3

Programs using structures and pointers

15

--- Content provided by FirstRanker.com ---

4
Programs involving dynamic memory allocations

20
5

--- Content provided by FirstRanker.com ---

Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues
29

--- Content provided by FirstRanker.com ---

7
Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

39
9
Implementation of Binary Search trees
41
10

--- Content provided by FirstRanker.com ---

Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

50
12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.

--- Content provided by FirstRanker.com ---

5. This process repeats until the test expression is false.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---

Thus the program to find the sum of n natural numbers was executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---



Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise AND operator & = 8

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise OR operator | = 29

A= 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12
complement = -36

--- Content provided by FirstRanker.com ---

Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106

--- Content provided by FirstRanker.com ---

Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848

--- Content provided by FirstRanker.com ---

Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---



Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.

--- Content provided by FirstRanker.com ---

5. Display the output.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35

--- Content provided by FirstRanker.com ---

Enter number3: 38
Enter number4: 31
Enter number5: 49

Average = 39

--- Content provided by FirstRanker.com ---

Result :

Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller

--- Content provided by FirstRanker.com ---

? Developing verifications of software code ,simulator.



1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---


2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---


7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---

9. What is multi dimensional array ?

10. How to access the elements in the array.


--- Content provided by FirstRanker.com ---

VIVA - VOCE



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


--- Content provided by FirstRanker.com ---

AIM:

To write a c program to perform string manipulation function.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Get the string by using gets() function.

4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---



1. What is a function ?
2. Mention the types of function.
3. What is a character ?

--- Content provided by FirstRanker.com ---

4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---


To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---


4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---


Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---



Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---

4. Call the required functions inside the main function.

5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter No. of Employees : 2

Enter Employee Details

Enter Employee Id : 436

--- Content provided by FirstRanker.com ---

Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---


********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---

********************************************************************************


Result :

--- Content provided by FirstRanker.com ---

Thus the program using structure is executed successfully.

Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---


Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


--- Content provided by FirstRanker.com ---

1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?

--- Content provided by FirstRanker.com ---

9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---


Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorthim:
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter integer value: 100
Enter character value: x

--- Content provided by FirstRanker.com ---

Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---


1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?

--- Content provided by FirstRanker.com ---

5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?

--- Content provided by FirstRanker.com ---

10.What is syntax for calloc()?
.



--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a

--- Content provided by FirstRanker.com ---

constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to

--- Content provided by FirstRanker.com ---

perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION


--- Content provided by FirstRanker.com ---


23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---


STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack is executed successfully.




--- Content provided by FirstRanker.com ---


25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific

--- Content provided by FirstRanker.com ---

value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls

--- Content provided by FirstRanker.com ---

to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as

--- Content provided by FirstRanker.com ---

deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 34

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the program for array implementation of stack and queue is attained.



--- Content provided by FirstRanker.com ---

1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?

--- Content provided by FirstRanker.com ---

6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---




30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.

--- Content provided by FirstRanker.com ---

enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to

--- Content provided by FirstRanker.com ---

'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---



Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.


--- Content provided by FirstRanker.com ---


1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?

--- Content provided by FirstRanker.com ---

5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?

--- Content provided by FirstRanker.com ---

10. What is meant by singly linked list?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform infix to postfix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

--- Content provided by FirstRanker.com ---

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator

--- Content provided by FirstRanker.com ---

and print them to the result.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : A B + C D - *

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---



Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---

To write a c program using structures.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---


4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---

XYZ & Co. Payroll

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---


********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---


********************************************************************************


Result :

--- Content provided by FirstRanker.com ---


Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---


1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?

--- Content provided by FirstRanker.com ---

8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY

--- Content provided by FirstRanker.com ---

ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorthim:

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter integer value: 100

--- Content provided by FirstRanker.com ---

Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:

--- Content provided by FirstRanker.com ---

Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded

--- Content provided by FirstRanker.com ---

software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?

--- Content provided by FirstRanker.com ---

4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?

--- Content provided by FirstRanker.com ---

9.What is the significance of calloc()?
10.What is syntax for calloc()?
.


--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)

--- Content provided by FirstRanker.com ---

6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate

--- Content provided by FirstRanker.com ---

the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY

--- Content provided by FirstRanker.com ---

1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 23

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2

--- Content provided by FirstRanker.com ---

Popped element is 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---


Thus the program for array implementation of stack is executed successfully.



--- Content provided by FirstRanker.com ---



25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of queue.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)

--- Content provided by FirstRanker.com ---

6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---


1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---




26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 23

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---

Front--> 12 23 34 45 56 <--Rear




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome:
Thus the program for array implementation of stack and queue is attained.


--- Content provided by FirstRanker.com ---


1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?

--- Content provided by FirstRanker.com ---

5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?

--- Content provided by FirstRanker.com ---

10. What is stack overflow?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined

--- Content provided by FirstRanker.com ---

functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.

--- Content provided by FirstRanker.com ---

5. Finally, set top = newNode.



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls

--- Content provided by FirstRanker.com ---

in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.




--- Content provided by FirstRanker.com ---


33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---


DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---




Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---


Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---



1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?

--- Content provided by FirstRanker.com ---

4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?

--- Content provided by FirstRanker.com ---

9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 7 a APPLICATION OF STACKS

Aim:

To write a C program to perform infix to postfix expression

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

--- Content provided by FirstRanker.com ---


5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the

--- Content provided by FirstRanker.com ---

operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing infix expression to postfix expression is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform postfix to infix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

--- Content provided by FirstRanker.com ---


4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---

5. Finally! perform a pop operation and display the popped value as final result.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform infix to postfix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---


4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---


6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform postfix to infix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading

--- Content provided by FirstRanker.com ---

symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for application of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.



--- Content provided by FirstRanker.com ---





1. What are the applications of stack?

--- Content provided by FirstRanker.com ---

2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?

--- Content provided by FirstRanker.com ---

7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform infix to postfix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---


4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---


6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform postfix to infix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading

--- Content provided by FirstRanker.com ---

symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for application of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.



--- Content provided by FirstRanker.com ---





1. What are the applications of stack?

--- Content provided by FirstRanker.com ---

2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?

--- Content provided by FirstRanker.com ---

7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program for performing Binary Tree Traversal.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

PREORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).


--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---


26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set

--- Content provided by FirstRanker.com ---

both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.

--- Content provided by FirstRanker.com ---

4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 45

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack and queue is attained.



1. What is meant by data structure?

--- Content provided by FirstRanker.com ---

2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?

--- Content provided by FirstRanker.com ---

7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.

--- Content provided by FirstRanker.com ---

2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.

--- Content provided by FirstRanker.com ---

4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of Queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---





33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---


Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL


--- Content provided by FirstRanker.com ---


Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.



--- Content provided by FirstRanker.com ---

1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?

--- Content provided by FirstRanker.com ---

6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform infix to postfix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left

--- Content provided by FirstRanker.com ---

parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the

--- Content provided by FirstRanker.com ---

two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : 53+82-*

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?

--- Content provided by FirstRanker.com ---

6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---



In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---


Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---





?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.


--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---


DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


--- Content provided by FirstRanker.com ---

To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


--- Content provided by FirstRanker.com ---

? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,

--- Content provided by FirstRanker.com ---

innovation and ethical practices

VISION
MISSION
VISION

--- Content provided by FirstRanker.com ---

MISSION



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of

--- Content provided by FirstRanker.com ---

Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will

--- Content provided by FirstRanker.com ---

build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and

--- Content provided by FirstRanker.com ---

pursuing advanced degrees




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications

--- Content provided by FirstRanker.com ---

d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable

--- Content provided by FirstRanker.com ---

h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS




--- Content provided by FirstRanker.com ---


? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms

--- Content provided by FirstRanker.com ---

LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---


4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


12. Implementation Hash functions, collision resolution technique



--- Content provided by FirstRanker.com ---



COURSE OBJECTIVES


--- Content provided by FirstRanker.com ---


5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized

--- Content provided by FirstRanker.com ---

way.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





COURSE OUTCOMES

--- Content provided by FirstRanker.com ---




6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---


Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---


7

2
Programs using strings ? string function implementation 13

--- Content provided by FirstRanker.com ---

3

Programs using structures and pointers

15

--- Content provided by FirstRanker.com ---

4
Programs involving dynamic memory allocations

20
5

--- Content provided by FirstRanker.com ---

Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues
29

--- Content provided by FirstRanker.com ---

7
Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

39
9
Implementation of Binary Search trees
41
10

--- Content provided by FirstRanker.com ---

Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

50
12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.

--- Content provided by FirstRanker.com ---

5. This process repeats until the test expression is false.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---

Thus the program to find the sum of n natural numbers was executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---



Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise AND operator & = 8

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise OR operator | = 29

A= 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12
complement = -36

--- Content provided by FirstRanker.com ---

Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106

--- Content provided by FirstRanker.com ---

Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848

--- Content provided by FirstRanker.com ---

Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---



Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.

--- Content provided by FirstRanker.com ---

5. Display the output.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35

--- Content provided by FirstRanker.com ---

Enter number3: 38
Enter number4: 31
Enter number5: 49

Average = 39

--- Content provided by FirstRanker.com ---

Result :

Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller

--- Content provided by FirstRanker.com ---

? Developing verifications of software code ,simulator.



1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---


2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---


7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---

9. What is multi dimensional array ?

10. How to access the elements in the array.


--- Content provided by FirstRanker.com ---

VIVA - VOCE



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


--- Content provided by FirstRanker.com ---

AIM:

To write a c program to perform string manipulation function.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Get the string by using gets() function.

4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---



1. What is a function ?
2. Mention the types of function.
3. What is a character ?

--- Content provided by FirstRanker.com ---

4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---


To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---


4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---


Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---



Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---

4. Call the required functions inside the main function.

5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter No. of Employees : 2

Enter Employee Details

Enter Employee Id : 436

--- Content provided by FirstRanker.com ---

Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---


********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---

********************************************************************************


Result :

--- Content provided by FirstRanker.com ---

Thus the program using structure is executed successfully.

Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---


Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


--- Content provided by FirstRanker.com ---

1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?

--- Content provided by FirstRanker.com ---

9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---


Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorthim:
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter integer value: 100
Enter character value: x

--- Content provided by FirstRanker.com ---

Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---


1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?

--- Content provided by FirstRanker.com ---

5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?

--- Content provided by FirstRanker.com ---

10.What is syntax for calloc()?
.



--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a

--- Content provided by FirstRanker.com ---

constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to

--- Content provided by FirstRanker.com ---

perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION


--- Content provided by FirstRanker.com ---


23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---


STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack is executed successfully.




--- Content provided by FirstRanker.com ---


25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific

--- Content provided by FirstRanker.com ---

value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls

--- Content provided by FirstRanker.com ---

to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as

--- Content provided by FirstRanker.com ---

deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 34

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the program for array implementation of stack and queue is attained.



--- Content provided by FirstRanker.com ---

1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?

--- Content provided by FirstRanker.com ---

6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---




30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.

--- Content provided by FirstRanker.com ---

enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to

--- Content provided by FirstRanker.com ---

'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---



Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.


--- Content provided by FirstRanker.com ---


1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?

--- Content provided by FirstRanker.com ---

5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?

--- Content provided by FirstRanker.com ---

10. What is meant by singly linked list?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform infix to postfix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

--- Content provided by FirstRanker.com ---

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator

--- Content provided by FirstRanker.com ---

and print them to the result.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : A B + C D - *

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 7 b APPLICATION OF STACKS

Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

--- Content provided by FirstRanker.com ---

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---


Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?

--- Content provided by FirstRanker.com ---

5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.

--- Content provided by FirstRanker.com ---

10. What is circular linked list?




--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 8 IMPLEMENTATION OF TREES, TREE

--- Content provided by FirstRanker.com ---

TRAVERSALS

Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---


INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---


POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

--- Content provided by FirstRanker.com ---

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing binary tree traversal is executed successfully.

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to performing Binary Search Tree Operations.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node

--- Content provided by FirstRanker.com ---

9. If we reach to the node with search value, then display "Element is found" and terminate
the function.


FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---





?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.


--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---


DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


--- Content provided by FirstRanker.com ---

To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


--- Content provided by FirstRanker.com ---

? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,

--- Content provided by FirstRanker.com ---

innovation and ethical practices

VISION
MISSION
VISION

--- Content provided by FirstRanker.com ---

MISSION



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of

--- Content provided by FirstRanker.com ---

Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will

--- Content provided by FirstRanker.com ---

build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and

--- Content provided by FirstRanker.com ---

pursuing advanced degrees




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications

--- Content provided by FirstRanker.com ---

d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable

--- Content provided by FirstRanker.com ---

h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS




--- Content provided by FirstRanker.com ---


? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms

--- Content provided by FirstRanker.com ---

LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---


4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


12. Implementation Hash functions, collision resolution technique



--- Content provided by FirstRanker.com ---



COURSE OBJECTIVES


--- Content provided by FirstRanker.com ---


5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized

--- Content provided by FirstRanker.com ---

way.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





COURSE OUTCOMES

--- Content provided by FirstRanker.com ---




6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---


Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---


7

2
Programs using strings ? string function implementation 13

--- Content provided by FirstRanker.com ---

3

Programs using structures and pointers

15

--- Content provided by FirstRanker.com ---

4
Programs involving dynamic memory allocations

20
5

--- Content provided by FirstRanker.com ---

Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues
29

--- Content provided by FirstRanker.com ---

7
Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

39
9
Implementation of Binary Search trees
41
10

--- Content provided by FirstRanker.com ---

Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

50
12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.

--- Content provided by FirstRanker.com ---

5. This process repeats until the test expression is false.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---

Thus the program to find the sum of n natural numbers was executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---



Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise AND operator & = 8

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise OR operator | = 29

A= 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12
complement = -36

--- Content provided by FirstRanker.com ---

Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106

--- Content provided by FirstRanker.com ---

Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848

--- Content provided by FirstRanker.com ---

Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---



Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.

--- Content provided by FirstRanker.com ---

5. Display the output.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35

--- Content provided by FirstRanker.com ---

Enter number3: 38
Enter number4: 31
Enter number5: 49

Average = 39

--- Content provided by FirstRanker.com ---

Result :

Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller

--- Content provided by FirstRanker.com ---

? Developing verifications of software code ,simulator.



1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---


2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---


7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---

9. What is multi dimensional array ?

10. How to access the elements in the array.


--- Content provided by FirstRanker.com ---

VIVA - VOCE



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


--- Content provided by FirstRanker.com ---

AIM:

To write a c program to perform string manipulation function.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Get the string by using gets() function.

4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---



1. What is a function ?
2. Mention the types of function.
3. What is a character ?

--- Content provided by FirstRanker.com ---

4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---


To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---


4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---


Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---



Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---

4. Call the required functions inside the main function.

5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter No. of Employees : 2

Enter Employee Details

Enter Employee Id : 436

--- Content provided by FirstRanker.com ---

Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---


********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---

********************************************************************************


Result :

--- Content provided by FirstRanker.com ---

Thus the program using structure is executed successfully.

Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---


Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


--- Content provided by FirstRanker.com ---

1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?

--- Content provided by FirstRanker.com ---

9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---


Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorthim:
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter integer value: 100
Enter character value: x

--- Content provided by FirstRanker.com ---

Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---


1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?

--- Content provided by FirstRanker.com ---

5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?

--- Content provided by FirstRanker.com ---

10.What is syntax for calloc()?
.



--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a

--- Content provided by FirstRanker.com ---

constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to

--- Content provided by FirstRanker.com ---

perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION


--- Content provided by FirstRanker.com ---


23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---


STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack is executed successfully.




--- Content provided by FirstRanker.com ---


25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific

--- Content provided by FirstRanker.com ---

value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls

--- Content provided by FirstRanker.com ---

to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as

--- Content provided by FirstRanker.com ---

deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 34

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the program for array implementation of stack and queue is attained.



--- Content provided by FirstRanker.com ---

1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?

--- Content provided by FirstRanker.com ---

6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---




30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.

--- Content provided by FirstRanker.com ---

enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to

--- Content provided by FirstRanker.com ---

'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---



Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.


--- Content provided by FirstRanker.com ---


1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?

--- Content provided by FirstRanker.com ---

5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?

--- Content provided by FirstRanker.com ---

10. What is meant by singly linked list?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform infix to postfix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

--- Content provided by FirstRanker.com ---

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator

--- Content provided by FirstRanker.com ---

and print them to the result.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : A B + C D - *

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 7 b APPLICATION OF STACKS

Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

--- Content provided by FirstRanker.com ---

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---


Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?

--- Content provided by FirstRanker.com ---

5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.

--- Content provided by FirstRanker.com ---

10. What is circular linked list?




--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 8 IMPLEMENTATION OF TREES, TREE

--- Content provided by FirstRanker.com ---

TRAVERSALS

Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---


INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---


POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

--- Content provided by FirstRanker.com ---

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing binary tree traversal is executed successfully.

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to performing Binary Search Tree Operations.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node

--- Content provided by FirstRanker.com ---

9. If we reach to the node with search value, then display "Element is found" and terminate
the function.



--- Content provided by FirstRanker.com ---

42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.

--- Content provided by FirstRanker.com ---

Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than

--- Content provided by FirstRanker.com ---

the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or

--- Content provided by FirstRanker.com ---

equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---


Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.

--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---


To write a c program using structures.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---


6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---


XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00

--- Content provided by FirstRanker.com ---

463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************


--- Content provided by FirstRanker.com ---

Result :

Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---



1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?

--- Content provided by FirstRanker.com ---

4. What is meant by address operator?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?
6. Why you need pointers in C?

--- Content provided by FirstRanker.com ---

7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.

--- Content provided by FirstRanker.com ---

5. Display the result.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:

--- Content provided by FirstRanker.com ---

The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?

--- Content provided by FirstRanker.com ---

3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?

--- Content provided by FirstRanker.com ---

8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])

--- Content provided by FirstRanker.com ---

5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---




23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)

--- Content provided by FirstRanker.com ---

DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).

--- Content provided by FirstRanker.com ---

4. Repeat above step until i value becomes '0'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 12

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 45 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 4


--- Content provided by FirstRanker.com ---

Result :

Thus the program for array implementation of stack is executed successfully.


--- Content provided by FirstRanker.com ---




25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])

--- Content provided by FirstRanker.com ---

5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


--- Content provided by FirstRanker.com ---

ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 12

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Queue Full

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---


Front--> 12 23 34 45 56 <--Rear



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---



1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?

--- Content provided by FirstRanker.com ---

4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?

--- Content provided by FirstRanker.com ---

9. Give some application of stack and queue?
10. What is stack overflow?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF

--- Content provided by FirstRanker.com ---

STACK

Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function

--- Content provided by FirstRanker.com ---

calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.



--- Content provided by FirstRanker.com ---

30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the

--- Content provided by FirstRanker.com ---

first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Stack is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.



--- Content provided by FirstRanker.com ---



33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.

--- Content provided by FirstRanker.com ---

4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL



Result :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---




1. What is the meant by linear data structure?
2. What is meant by linked list?

--- Content provided by FirstRanker.com ---

3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?

--- Content provided by FirstRanker.com ---

8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform infix to postfix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing infix expression to postfix expression is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform postfix to infix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---


5. Finally! perform a pop operation and display the popped value as final result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for application of stack and queue is attained.

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are

--- Content provided by FirstRanker.com ---

used to convert the expression which is understood by the computer.




--- Content provided by FirstRanker.com ---




1. What are the applications of stack?
2. What is meant by infix expression, Give example?

--- Content provided by FirstRanker.com ---

3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?

--- Content provided by FirstRanker.com ---

8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?


--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program for performing Binary Tree Traversal.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

PREORDER TRAVERSAL
2. Process the root node (N).

--- Content provided by FirstRanker.com ---

3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

9. Traverse the right subtree of N (R).
10. Process the root node (N).



--- Content provided by FirstRanker.com ---




40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :


--- Content provided by FirstRanker.com ---

In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

--- Content provided by FirstRanker.com ---


Result :
Thus the program for performing binary tree traversal is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data

--- Content provided by FirstRanker.com ---

? As a workflow for computing digital image for visual effects




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to performing Binary Search Tree Operations.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
Search Operation in BST
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.

--- Content provided by FirstRanker.com ---

7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.

--- Content provided by FirstRanker.com ---

3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.

--- Content provided by FirstRanker.com ---

6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)

--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. Delete the node using free function (If it is a leaf) and terminate the function.



43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)

--- Content provided by FirstRanker.com ---

the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.

--- Content provided by FirstRanker.com ---

7. Repeat the same process until node is deleted from the tree.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform infix to postfix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---


4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---


6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform postfix to infix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading

--- Content provided by FirstRanker.com ---

symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for application of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.



--- Content provided by FirstRanker.com ---





1. What are the applications of stack?

--- Content provided by FirstRanker.com ---

2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?

--- Content provided by FirstRanker.com ---

7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program for performing Binary Tree Traversal.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

PREORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).


--- Content provided by FirstRanker.com ---





40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data

--- Content provided by FirstRanker.com ---

? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
Search Operation in BST

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.

--- Content provided by FirstRanker.com ---

6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---




42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode

--- Content provided by FirstRanker.com ---

is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST

--- Content provided by FirstRanker.com ---

Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.



--- Content provided by FirstRanker.com ---

43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Case 2: Deleting a node with one child

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.

--- Content provided by FirstRanker.com ---

6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Sample Output :

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 5

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 3

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 4
1
2
3
4

--- Content provided by FirstRanker.com ---

5
6



--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---


26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set

--- Content provided by FirstRanker.com ---

both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.

--- Content provided by FirstRanker.com ---

4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 45

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack and queue is attained.



1. What is meant by data structure?

--- Content provided by FirstRanker.com ---

2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?

--- Content provided by FirstRanker.com ---

7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.

--- Content provided by FirstRanker.com ---

2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.

--- Content provided by FirstRanker.com ---

4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of Queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---





33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---


Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL


--- Content provided by FirstRanker.com ---


Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.



--- Content provided by FirstRanker.com ---

1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?

--- Content provided by FirstRanker.com ---

6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform infix to postfix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left

--- Content provided by FirstRanker.com ---

parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the

--- Content provided by FirstRanker.com ---

two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : 53+82-*

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?

--- Content provided by FirstRanker.com ---

6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---



In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---


Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---

TREES

Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that

--- Content provided by FirstRanker.com ---

node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate

--- Content provided by FirstRanker.com ---

the function.



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).

--- Content provided by FirstRanker.com ---

5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.

--- Content provided by FirstRanker.com ---

Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.


--- Content provided by FirstRanker.com ---


43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2

--- Content provided by FirstRanker.com ---

5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---



Sample Output :

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 6

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 1

Enter your choice : 1
Enter the node value : 5

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 3

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 4
1
2
3

--- Content provided by FirstRanker.com ---

4
5
6


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for implementation of Binary Search Trees is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---


26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set

--- Content provided by FirstRanker.com ---

both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.

--- Content provided by FirstRanker.com ---

4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 45

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack and queue is attained.



1. What is meant by data structure?

--- Content provided by FirstRanker.com ---

2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?

--- Content provided by FirstRanker.com ---

7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.

--- Content provided by FirstRanker.com ---

2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.

--- Content provided by FirstRanker.com ---

4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of Queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---





33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---


Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL


--- Content provided by FirstRanker.com ---


Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.



--- Content provided by FirstRanker.com ---

1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?

--- Content provided by FirstRanker.com ---

6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform infix to postfix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left

--- Content provided by FirstRanker.com ---

parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the

--- Content provided by FirstRanker.com ---

two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : 53+82-*

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?

--- Content provided by FirstRanker.com ---

6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---



In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---


Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---

TREES

Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that

--- Content provided by FirstRanker.com ---

node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate

--- Content provided by FirstRanker.com ---

the function.



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).

--- Content provided by FirstRanker.com ---

5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.

--- Content provided by FirstRanker.com ---

Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.


--- Content provided by FirstRanker.com ---


43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2

--- Content provided by FirstRanker.com ---

5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---



Sample Output :

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 6

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 1

Enter your choice : 1
Enter the node value : 5

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 3

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 4
1
2
3

--- Content provided by FirstRanker.com ---

4
5
6


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for implementation of Binary Search Trees is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linear Search Operation.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.

--- Content provided by FirstRanker.com ---

4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---


To write a c program using structures.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---


6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---


XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00

--- Content provided by FirstRanker.com ---

463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************


--- Content provided by FirstRanker.com ---

Result :

Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---



1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?

--- Content provided by FirstRanker.com ---

4. What is meant by address operator?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?
6. Why you need pointers in C?

--- Content provided by FirstRanker.com ---

7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.

--- Content provided by FirstRanker.com ---

5. Display the result.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:

--- Content provided by FirstRanker.com ---

The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?

--- Content provided by FirstRanker.com ---

3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?

--- Content provided by FirstRanker.com ---

8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])

--- Content provided by FirstRanker.com ---

5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---




23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)

--- Content provided by FirstRanker.com ---

DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).

--- Content provided by FirstRanker.com ---

4. Repeat above step until i value becomes '0'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 12

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 45 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 4


--- Content provided by FirstRanker.com ---

Result :

Thus the program for array implementation of stack is executed successfully.


--- Content provided by FirstRanker.com ---




25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])

--- Content provided by FirstRanker.com ---

5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


--- Content provided by FirstRanker.com ---

ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 12

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Queue Full

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---


Front--> 12 23 34 45 56 <--Rear



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---



1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?

--- Content provided by FirstRanker.com ---

4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?

--- Content provided by FirstRanker.com ---

9. Give some application of stack and queue?
10. What is stack overflow?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF

--- Content provided by FirstRanker.com ---

STACK

Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function

--- Content provided by FirstRanker.com ---

calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.



--- Content provided by FirstRanker.com ---

30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the

--- Content provided by FirstRanker.com ---

first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Stack is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.



--- Content provided by FirstRanker.com ---



33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.

--- Content provided by FirstRanker.com ---

4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL



Result :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---




1. What is the meant by linear data structure?
2. What is meant by linked list?

--- Content provided by FirstRanker.com ---

3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?

--- Content provided by FirstRanker.com ---

8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform infix to postfix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing infix expression to postfix expression is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform postfix to infix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---


5. Finally! perform a pop operation and display the popped value as final result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for application of stack and queue is attained.

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are

--- Content provided by FirstRanker.com ---

used to convert the expression which is understood by the computer.




--- Content provided by FirstRanker.com ---




1. What are the applications of stack?
2. What is meant by infix expression, Give example?

--- Content provided by FirstRanker.com ---

3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?

--- Content provided by FirstRanker.com ---

8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?


--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program for performing Binary Tree Traversal.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

PREORDER TRAVERSAL
2. Process the root node (N).

--- Content provided by FirstRanker.com ---

3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

9. Traverse the right subtree of N (R).
10. Process the root node (N).



--- Content provided by FirstRanker.com ---




40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :


--- Content provided by FirstRanker.com ---

In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

--- Content provided by FirstRanker.com ---


Result :
Thus the program for performing binary tree traversal is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data

--- Content provided by FirstRanker.com ---

? As a workflow for computing digital image for visual effects




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to performing Binary Search Tree Operations.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
Search Operation in BST
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.

--- Content provided by FirstRanker.com ---

7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.

--- Content provided by FirstRanker.com ---

3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.

--- Content provided by FirstRanker.com ---

6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)

--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. Delete the node using free function (If it is a leaf) and terminate the function.



43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)

--- Content provided by FirstRanker.com ---

the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.

--- Content provided by FirstRanker.com ---

7. Repeat the same process until node is deleted from the tree.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 5

Enter your choice : 1
Enter the node value : 2

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 4

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 3

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 4

--- Content provided by FirstRanker.com ---

1
2
3
4
5

--- Content provided by FirstRanker.com ---

6




--- Content provided by FirstRanker.com ---




45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.

--- Content provided by FirstRanker.com ---

? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linear Search Operation.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.

--- Content provided by FirstRanker.com ---

6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10
Enter element to locate : 5

--- Content provided by FirstRanker.com ---

Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---


To write a c program using structures.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---


6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---


XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00

--- Content provided by FirstRanker.com ---

463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************


--- Content provided by FirstRanker.com ---

Result :

Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---



1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?

--- Content provided by FirstRanker.com ---

4. What is meant by address operator?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?
6. Why you need pointers in C?

--- Content provided by FirstRanker.com ---

7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.

--- Content provided by FirstRanker.com ---

5. Display the result.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:

--- Content provided by FirstRanker.com ---

The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?

--- Content provided by FirstRanker.com ---

3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?

--- Content provided by FirstRanker.com ---

8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])

--- Content provided by FirstRanker.com ---

5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---




23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)

--- Content provided by FirstRanker.com ---

DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).

--- Content provided by FirstRanker.com ---

4. Repeat above step until i value becomes '0'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 12

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 45 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 4


--- Content provided by FirstRanker.com ---

Result :

Thus the program for array implementation of stack is executed successfully.


--- Content provided by FirstRanker.com ---




25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])

--- Content provided by FirstRanker.com ---

5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


--- Content provided by FirstRanker.com ---

ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 12

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Queue Full

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---


Front--> 12 23 34 45 56 <--Rear



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---



1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?

--- Content provided by FirstRanker.com ---

4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?

--- Content provided by FirstRanker.com ---

9. Give some application of stack and queue?
10. What is stack overflow?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF

--- Content provided by FirstRanker.com ---

STACK

Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function

--- Content provided by FirstRanker.com ---

calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.



--- Content provided by FirstRanker.com ---

30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the

--- Content provided by FirstRanker.com ---

first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Stack is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.



--- Content provided by FirstRanker.com ---



33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.

--- Content provided by FirstRanker.com ---

4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL



Result :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---




1. What is the meant by linear data structure?
2. What is meant by linked list?

--- Content provided by FirstRanker.com ---

3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?

--- Content provided by FirstRanker.com ---

8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform infix to postfix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing infix expression to postfix expression is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform postfix to infix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---


5. Finally! perform a pop operation and display the popped value as final result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for application of stack and queue is attained.

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are

--- Content provided by FirstRanker.com ---

used to convert the expression which is understood by the computer.




--- Content provided by FirstRanker.com ---




1. What are the applications of stack?
2. What is meant by infix expression, Give example?

--- Content provided by FirstRanker.com ---

3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?

--- Content provided by FirstRanker.com ---

8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?


--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program for performing Binary Tree Traversal.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

PREORDER TRAVERSAL
2. Process the root node (N).

--- Content provided by FirstRanker.com ---

3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

9. Traverse the right subtree of N (R).
10. Process the root node (N).



--- Content provided by FirstRanker.com ---




40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :


--- Content provided by FirstRanker.com ---

In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

--- Content provided by FirstRanker.com ---


Result :
Thus the program for performing binary tree traversal is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data

--- Content provided by FirstRanker.com ---

? As a workflow for computing digital image for visual effects




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to performing Binary Search Tree Operations.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
Search Operation in BST
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.

--- Content provided by FirstRanker.com ---

7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.

--- Content provided by FirstRanker.com ---

3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.

--- Content provided by FirstRanker.com ---

6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)

--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. Delete the node using free function (If it is a leaf) and terminate the function.



43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)

--- Content provided by FirstRanker.com ---

the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.

--- Content provided by FirstRanker.com ---

7. Repeat the same process until node is deleted from the tree.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 5

Enter your choice : 1
Enter the node value : 2

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 4

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 3

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 4

--- Content provided by FirstRanker.com ---

1
2
3
4
5

--- Content provided by FirstRanker.com ---

6




--- Content provided by FirstRanker.com ---




45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.

--- Content provided by FirstRanker.com ---

? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linear Search Operation.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.

--- Content provided by FirstRanker.com ---

6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10
Enter element to locate : 5

--- Content provided by FirstRanker.com ---

Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Binary Search Operation.

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Find the middle element in the sorted list

--- Content provided by FirstRanker.com ---

4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left

--- Content provided by FirstRanker.com ---

sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.

--- Content provided by FirstRanker.com ---

10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.



--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---


To write a c program using structures.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---


6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---


XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00

--- Content provided by FirstRanker.com ---

463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************


--- Content provided by FirstRanker.com ---

Result :

Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---



1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?

--- Content provided by FirstRanker.com ---

4. What is meant by address operator?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?
6. Why you need pointers in C?

--- Content provided by FirstRanker.com ---

7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.

--- Content provided by FirstRanker.com ---

5. Display the result.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:

--- Content provided by FirstRanker.com ---

The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?

--- Content provided by FirstRanker.com ---

3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?

--- Content provided by FirstRanker.com ---

8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])

--- Content provided by FirstRanker.com ---

5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---




23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)

--- Content provided by FirstRanker.com ---

DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).

--- Content provided by FirstRanker.com ---

4. Repeat above step until i value becomes '0'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 12

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 45 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 4


--- Content provided by FirstRanker.com ---

Result :

Thus the program for array implementation of stack is executed successfully.


--- Content provided by FirstRanker.com ---




25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])

--- Content provided by FirstRanker.com ---

5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


--- Content provided by FirstRanker.com ---

ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 12

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Queue Full

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---


Front--> 12 23 34 45 56 <--Rear



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---



1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?

--- Content provided by FirstRanker.com ---

4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?

--- Content provided by FirstRanker.com ---

9. Give some application of stack and queue?
10. What is stack overflow?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF

--- Content provided by FirstRanker.com ---

STACK

Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function

--- Content provided by FirstRanker.com ---

calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.



--- Content provided by FirstRanker.com ---

30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the

--- Content provided by FirstRanker.com ---

first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Stack is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.



--- Content provided by FirstRanker.com ---



33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.

--- Content provided by FirstRanker.com ---

4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL



Result :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---




1. What is the meant by linear data structure?
2. What is meant by linked list?

--- Content provided by FirstRanker.com ---

3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?

--- Content provided by FirstRanker.com ---

8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform infix to postfix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing infix expression to postfix expression is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform postfix to infix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---


5. Finally! perform a pop operation and display the popped value as final result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for application of stack and queue is attained.

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are

--- Content provided by FirstRanker.com ---

used to convert the expression which is understood by the computer.




--- Content provided by FirstRanker.com ---




1. What are the applications of stack?
2. What is meant by infix expression, Give example?

--- Content provided by FirstRanker.com ---

3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?

--- Content provided by FirstRanker.com ---

8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?


--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program for performing Binary Tree Traversal.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

PREORDER TRAVERSAL
2. Process the root node (N).

--- Content provided by FirstRanker.com ---

3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

9. Traverse the right subtree of N (R).
10. Process the root node (N).



--- Content provided by FirstRanker.com ---




40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :


--- Content provided by FirstRanker.com ---

In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

--- Content provided by FirstRanker.com ---


Result :
Thus the program for performing binary tree traversal is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data

--- Content provided by FirstRanker.com ---

? As a workflow for computing digital image for visual effects




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to performing Binary Search Tree Operations.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
Search Operation in BST
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.

--- Content provided by FirstRanker.com ---

7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.

--- Content provided by FirstRanker.com ---

3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.

--- Content provided by FirstRanker.com ---

6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)

--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. Delete the node using free function (If it is a leaf) and terminate the function.



43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)

--- Content provided by FirstRanker.com ---

the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.

--- Content provided by FirstRanker.com ---

7. Repeat the same process until node is deleted from the tree.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 5

Enter your choice : 1
Enter the node value : 2

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 4

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 3

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 4

--- Content provided by FirstRanker.com ---

1
2
3
4
5

--- Content provided by FirstRanker.com ---

6




--- Content provided by FirstRanker.com ---




45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.

--- Content provided by FirstRanker.com ---

? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linear Search Operation.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.

--- Content provided by FirstRanker.com ---

6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10
Enter element to locate : 5

--- Content provided by FirstRanker.com ---

Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Binary Search Operation.

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Find the middle element in the sorted list

--- Content provided by FirstRanker.com ---

4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left

--- Content provided by FirstRanker.com ---

sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.

--- Content provided by FirstRanker.com ---

10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.



--- Content provided by FirstRanker.com ---



49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :
Enter array size : 10
Elements in Sorted Order

--- Content provided by FirstRanker.com ---


0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

Found at index 8 in 2 attempts

--- Content provided by FirstRanker.com ---


Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :
Thus the implementation of Linear search and Binary search is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Searching used in information retrieval.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform infix to postfix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---


4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---


6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform postfix to infix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading

--- Content provided by FirstRanker.com ---

symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for application of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.



--- Content provided by FirstRanker.com ---





1. What are the applications of stack?

--- Content provided by FirstRanker.com ---

2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?

--- Content provided by FirstRanker.com ---

7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program for performing Binary Tree Traversal.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

PREORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).


--- Content provided by FirstRanker.com ---





40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data

--- Content provided by FirstRanker.com ---

? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
Search Operation in BST

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.

--- Content provided by FirstRanker.com ---

6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---




42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode

--- Content provided by FirstRanker.com ---

is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST

--- Content provided by FirstRanker.com ---

Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.



--- Content provided by FirstRanker.com ---

43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Case 2: Deleting a node with one child

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.

--- Content provided by FirstRanker.com ---

6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Sample Output :

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 5

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 3

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 4
1
2
3
4

--- Content provided by FirstRanker.com ---

5
6



--- Content provided by FirstRanker.com ---





45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored

--- Content provided by FirstRanker.com ---

? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linear Search Operation.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10

--- Content provided by FirstRanker.com ---

Enter element to locate : 5
Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to perform Binary Search Operation.

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.

--- Content provided by FirstRanker.com ---

7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one

--- Content provided by FirstRanker.com ---

element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.


--- Content provided by FirstRanker.com ---




49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter array size : 10

--- Content provided by FirstRanker.com ---

Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

--- Content provided by FirstRanker.com ---

Found at index 8 in 2 attempts

Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Insertion Sorting.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.

--- Content provided by FirstRanker.com ---

3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---


To write a c program using structures.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---


6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---


XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00

--- Content provided by FirstRanker.com ---

463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************


--- Content provided by FirstRanker.com ---

Result :

Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---



1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?

--- Content provided by FirstRanker.com ---

4. What is meant by address operator?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?
6. Why you need pointers in C?

--- Content provided by FirstRanker.com ---

7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.

--- Content provided by FirstRanker.com ---

5. Display the result.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:

--- Content provided by FirstRanker.com ---

The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?

--- Content provided by FirstRanker.com ---

3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?

--- Content provided by FirstRanker.com ---

8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])

--- Content provided by FirstRanker.com ---

5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---




23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)

--- Content provided by FirstRanker.com ---

DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).

--- Content provided by FirstRanker.com ---

4. Repeat above step until i value becomes '0'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 12

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 45 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 4


--- Content provided by FirstRanker.com ---

Result :

Thus the program for array implementation of stack is executed successfully.


--- Content provided by FirstRanker.com ---




25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])

--- Content provided by FirstRanker.com ---

5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


--- Content provided by FirstRanker.com ---

ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 12

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Queue Full

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---


Front--> 12 23 34 45 56 <--Rear



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---



1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?

--- Content provided by FirstRanker.com ---

4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?

--- Content provided by FirstRanker.com ---

9. Give some application of stack and queue?
10. What is stack overflow?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF

--- Content provided by FirstRanker.com ---

STACK

Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function

--- Content provided by FirstRanker.com ---

calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.



--- Content provided by FirstRanker.com ---

30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the

--- Content provided by FirstRanker.com ---

first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Stack is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.



--- Content provided by FirstRanker.com ---



33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.

--- Content provided by FirstRanker.com ---

4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL



Result :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---




1. What is the meant by linear data structure?
2. What is meant by linked list?

--- Content provided by FirstRanker.com ---

3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?

--- Content provided by FirstRanker.com ---

8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform infix to postfix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing infix expression to postfix expression is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform postfix to infix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---


5. Finally! perform a pop operation and display the popped value as final result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for application of stack and queue is attained.

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are

--- Content provided by FirstRanker.com ---

used to convert the expression which is understood by the computer.




--- Content provided by FirstRanker.com ---




1. What are the applications of stack?
2. What is meant by infix expression, Give example?

--- Content provided by FirstRanker.com ---

3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?

--- Content provided by FirstRanker.com ---

8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?


--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program for performing Binary Tree Traversal.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

PREORDER TRAVERSAL
2. Process the root node (N).

--- Content provided by FirstRanker.com ---

3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

9. Traverse the right subtree of N (R).
10. Process the root node (N).



--- Content provided by FirstRanker.com ---




40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :


--- Content provided by FirstRanker.com ---

In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

--- Content provided by FirstRanker.com ---


Result :
Thus the program for performing binary tree traversal is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data

--- Content provided by FirstRanker.com ---

? As a workflow for computing digital image for visual effects




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to performing Binary Search Tree Operations.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
Search Operation in BST
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.

--- Content provided by FirstRanker.com ---

7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.

--- Content provided by FirstRanker.com ---

3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.

--- Content provided by FirstRanker.com ---

6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)

--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. Delete the node using free function (If it is a leaf) and terminate the function.



43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)

--- Content provided by FirstRanker.com ---

the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.

--- Content provided by FirstRanker.com ---

7. Repeat the same process until node is deleted from the tree.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 5

Enter your choice : 1
Enter the node value : 2

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 4

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 3

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 4

--- Content provided by FirstRanker.com ---

1
2
3
4
5

--- Content provided by FirstRanker.com ---

6




--- Content provided by FirstRanker.com ---




45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.

--- Content provided by FirstRanker.com ---

? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linear Search Operation.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.

--- Content provided by FirstRanker.com ---

6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10
Enter element to locate : 5

--- Content provided by FirstRanker.com ---

Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Binary Search Operation.

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Find the middle element in the sorted list

--- Content provided by FirstRanker.com ---

4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left

--- Content provided by FirstRanker.com ---

sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.

--- Content provided by FirstRanker.com ---

10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.



--- Content provided by FirstRanker.com ---



49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :
Enter array size : 10
Elements in Sorted Order

--- Content provided by FirstRanker.com ---


0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

Found at index 8 in 2 attempts

--- Content provided by FirstRanker.com ---


Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :
Thus the implementation of Linear search and Binary search is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Searching used in information retrieval.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Insertion Sorting.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order

--- Content provided by FirstRanker.com ---

specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :
Enter total elements: 6

Enter array elements: 34 8 64 51 32 21

--- Content provided by FirstRanker.com ---


After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21

--- Content provided by FirstRanker.com ---

After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :
Thus the program to perform insertion sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


FirstRanker.com - FirstRanker's Choice



--- Content provided by FirstRanker.com ---


?



--- Content provided by FirstRanker.com ---

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---



? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---



To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---



? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on

--- Content provided by FirstRanker.com ---

advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION

--- Content provided by FirstRanker.com ---

MISSION
VISION
MISSION


--- Content provided by FirstRanker.com ---


2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify

--- Content provided by FirstRanker.com ---

complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills

--- Content provided by FirstRanker.com ---

4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning

--- Content provided by FirstRanker.com ---

To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in

--- Content provided by FirstRanker.com ---

the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety

--- Content provided by FirstRanker.com ---

g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills

--- Content provided by FirstRanker.com ---

j) To develop and manage projects in multidisciplinary environments




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS


--- Content provided by FirstRanker.com ---




? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.

--- Content provided by FirstRanker.com ---

? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---


3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---





COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---




5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.

--- Content provided by FirstRanker.com ---

? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


COURSE OUTCOMES



--- Content provided by FirstRanker.com ---

6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---


CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---


Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---

2
Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---


15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---

20
5
Array implementation of stacks and queues
22
6

--- Content provided by FirstRanker.com ---

Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues
35

--- Content provided by FirstRanker.com ---

8
Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees

--- Content provided by FirstRanker.com ---

41
10
Implementation of Linear search and binary search
46
11

--- Content provided by FirstRanker.com ---

Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---


58



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.

--- Content provided by FirstRanker.com ---

4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Output
Enter a positive integer: 10
Sum = 55

--- Content provided by FirstRanker.com ---

Result:

Thus the program to find the sum of n natural numbers was executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.

--- Content provided by FirstRanker.com ---

4. Display the result.
5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35

--- Content provided by FirstRanker.com ---

complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212

--- Content provided by FirstRanker.com ---

Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212

--- Content provided by FirstRanker.com ---

Left Shift by 1: 424
Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---


To write a C program using Arrays

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.

--- Content provided by FirstRanker.com ---

3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter n: 5

--- Content provided by FirstRanker.com ---

Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---


Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application

--- Content provided by FirstRanker.com ---

? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.


--- Content provided by FirstRanker.com ---


1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---


6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---

8 What is the use of array ?

9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---



AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.

3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---


5. Display the results by using the puts() function.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter string: String
Length of string = 6

--- Content provided by FirstRanker.com ---

Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---

Applications:
? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?

--- Content provided by FirstRanker.com ---

2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.

--- Content provided by FirstRanker.com ---

7. Which header file is to be included while using the string functions.
8. How to declare a string and character.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---


Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---


3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---

After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---

Thus the program to swap two numbers using pointers is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---


To write a c program using structures.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---


6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---


XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00

--- Content provided by FirstRanker.com ---

463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************


--- Content provided by FirstRanker.com ---

Result :

Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---



1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?

--- Content provided by FirstRanker.com ---

4. What is meant by address operator?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?
6. Why you need pointers in C?

--- Content provided by FirstRanker.com ---

7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.

--- Content provided by FirstRanker.com ---

5. Display the result.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:

--- Content provided by FirstRanker.com ---

The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?

--- Content provided by FirstRanker.com ---

3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?

--- Content provided by FirstRanker.com ---

8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])

--- Content provided by FirstRanker.com ---

5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---




23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)

--- Content provided by FirstRanker.com ---

DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).

--- Content provided by FirstRanker.com ---

4. Repeat above step until i value becomes '0'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 12

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 45 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 4


--- Content provided by FirstRanker.com ---

Result :

Thus the program for array implementation of stack is executed successfully.


--- Content provided by FirstRanker.com ---




25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform array implementation of queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])

--- Content provided by FirstRanker.com ---

5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


--- Content provided by FirstRanker.com ---

ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 12

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Queue Full

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---


Front--> 12 23 34 45 56 <--Rear



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---



1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?

--- Content provided by FirstRanker.com ---

4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?

--- Content provided by FirstRanker.com ---

9. Give some application of stack and queue?
10. What is stack overflow?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF

--- Content provided by FirstRanker.com ---

STACK

Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function

--- Content provided by FirstRanker.com ---

calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.



--- Content provided by FirstRanker.com ---

30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the

--- Content provided by FirstRanker.com ---

first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Stack is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.



--- Content provided by FirstRanker.com ---



33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.

--- Content provided by FirstRanker.com ---

4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL



Result :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---




1. What is the meant by linear data structure?
2. What is meant by linked list?

--- Content provided by FirstRanker.com ---

3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?

--- Content provided by FirstRanker.com ---

8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform infix to postfix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing infix expression to postfix expression is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform postfix to infix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---


5. Finally! perform a pop operation and display the popped value as final result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for application of stack and queue is attained.

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are

--- Content provided by FirstRanker.com ---

used to convert the expression which is understood by the computer.




--- Content provided by FirstRanker.com ---




1. What are the applications of stack?
2. What is meant by infix expression, Give example?

--- Content provided by FirstRanker.com ---

3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?

--- Content provided by FirstRanker.com ---

8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?


--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program for performing Binary Tree Traversal.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

PREORDER TRAVERSAL
2. Process the root node (N).

--- Content provided by FirstRanker.com ---

3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

9. Traverse the right subtree of N (R).
10. Process the root node (N).



--- Content provided by FirstRanker.com ---




40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :


--- Content provided by FirstRanker.com ---

In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

--- Content provided by FirstRanker.com ---


Result :
Thus the program for performing binary tree traversal is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data

--- Content provided by FirstRanker.com ---

? As a workflow for computing digital image for visual effects




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to performing Binary Search Tree Operations.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
Search Operation in BST
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.

--- Content provided by FirstRanker.com ---

7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.

--- Content provided by FirstRanker.com ---

3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.

--- Content provided by FirstRanker.com ---

6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)

--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. Delete the node using free function (If it is a leaf) and terminate the function.



43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)

--- Content provided by FirstRanker.com ---

the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.

--- Content provided by FirstRanker.com ---

7. Repeat the same process until node is deleted from the tree.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 5

Enter your choice : 1
Enter the node value : 2

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 4

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 3

Select an option
1- insert.
2- Search.

--- Content provided by FirstRanker.com ---

3- Delete.
4 ? Display.
5 - Exit

Enter your choice : 4

--- Content provided by FirstRanker.com ---

1
2
3
4
5

--- Content provided by FirstRanker.com ---

6




--- Content provided by FirstRanker.com ---




45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.

--- Content provided by FirstRanker.com ---

? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linear Search Operation.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.

--- Content provided by FirstRanker.com ---

6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10
Enter element to locate : 5

--- Content provided by FirstRanker.com ---

Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Binary Search Operation.

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Find the middle element in the sorted list

--- Content provided by FirstRanker.com ---

4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left

--- Content provided by FirstRanker.com ---

sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.

--- Content provided by FirstRanker.com ---

10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.



--- Content provided by FirstRanker.com ---



49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :
Enter array size : 10
Elements in Sorted Order

--- Content provided by FirstRanker.com ---


0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

Found at index 8 in 2 attempts

--- Content provided by FirstRanker.com ---


Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :
Thus the implementation of Linear search and Binary search is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Searching used in information retrieval.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Insertion Sorting.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order

--- Content provided by FirstRanker.com ---

specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :
Enter total elements: 6

Enter array elements: 34 8 64 51 32 21

--- Content provided by FirstRanker.com ---


After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21

--- Content provided by FirstRanker.com ---

After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :
Thus the program to perform insertion sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Bubble Sorting.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Set the size of the array and declare the variables.

3. Repeat the steps 4 ? 9 while i > 1

--- Content provided by FirstRanker.com ---

4. set j=0.

5. Repeat steps 6 ? 8 while j < i-1.

6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

--- Content provided by FirstRanker.com ---


7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

8. set j=j + 1.

--- Content provided by FirstRanker.com ---

9. set i= i -1.

10. stop.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---


26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set

--- Content provided by FirstRanker.com ---

both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.

--- Content provided by FirstRanker.com ---

4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 45

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack and queue is attained.



1. What is meant by data structure?

--- Content provided by FirstRanker.com ---

2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?

--- Content provided by FirstRanker.com ---

7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.

--- Content provided by FirstRanker.com ---

2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.

--- Content provided by FirstRanker.com ---

4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of Queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---





33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---


Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL


--- Content provided by FirstRanker.com ---


Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.



--- Content provided by FirstRanker.com ---

1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?

--- Content provided by FirstRanker.com ---

6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform infix to postfix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left

--- Content provided by FirstRanker.com ---

parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the

--- Content provided by FirstRanker.com ---

two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : 53+82-*

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?

--- Content provided by FirstRanker.com ---

6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---



In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---


Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---

TREES

Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that

--- Content provided by FirstRanker.com ---

node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate

--- Content provided by FirstRanker.com ---

the function.



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).

--- Content provided by FirstRanker.com ---

5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.

--- Content provided by FirstRanker.com ---

Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.


--- Content provided by FirstRanker.com ---


43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2

--- Content provided by FirstRanker.com ---

5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---



Sample Output :

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 6

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 1

Enter your choice : 1
Enter the node value : 5

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 3

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 4
1
2
3

--- Content provided by FirstRanker.com ---

4
5
6


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for implementation of Binary Search Trees is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linear Search Operation.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.

--- Content provided by FirstRanker.com ---

4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Enter number of elements : 7
Enter Array Elements :

--- Content provided by FirstRanker.com ---

23 6 12 5 0 32 10
Enter element to locate : 5
Element found at position 3

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform Linear search operation is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Binary Search Operation.

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle

--- Content provided by FirstRanker.com ---

element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.

--- Content provided by FirstRanker.com ---

9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.

--- Content provided by FirstRanker.com ---





49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---

Enter array size : 10
Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

--- Content provided by FirstRanker.com ---


Found at index 8 in 2 attempts

Result :
Thus the program to perform binary search operation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Insertion Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in

--- Content provided by FirstRanker.com ---

unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter total elements: 6

--- Content provided by FirstRanker.com ---


Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21

--- Content provided by FirstRanker.com ---

After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform insertion sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Bubble Sorting.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Set the size of the array and declare the variables.

--- Content provided by FirstRanker.com ---

3. Repeat the steps 4 ? 9 while i > 1

4. set j=0.

5. Repeat steps 6 ? 8 while j < i-1.

--- Content provided by FirstRanker.com ---


6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

--- Content provided by FirstRanker.com ---

8. set j=j + 1.

9. set i= i -1.

10. stop.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter the number of elements in the array :
5

--- Content provided by FirstRanker.com ---


Enter the 5 elements to sort :
18
3
2

--- Content provided by FirstRanker.com ---

33
21

The sorted elements are :

--- Content provided by FirstRanker.com ---

2
3
18
21
33

--- Content provided by FirstRanker.com ---


Result :

Thus the program to perform bubble sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---



Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---

To write a c program using structures.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---


4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---

XYZ & Co. Payroll

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---


********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---


********************************************************************************


Result :

--- Content provided by FirstRanker.com ---


Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---


1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?

--- Content provided by FirstRanker.com ---

8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY

--- Content provided by FirstRanker.com ---

ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorthim:

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter integer value: 100

--- Content provided by FirstRanker.com ---

Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:

--- Content provided by FirstRanker.com ---

Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded

--- Content provided by FirstRanker.com ---

software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?

--- Content provided by FirstRanker.com ---

4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?

--- Content provided by FirstRanker.com ---

9.What is the significance of calloc()?
10.What is syntax for calloc()?
.


--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)

--- Content provided by FirstRanker.com ---

6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate

--- Content provided by FirstRanker.com ---

the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY

--- Content provided by FirstRanker.com ---

1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 23

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2

--- Content provided by FirstRanker.com ---

Popped element is 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---


Thus the program for array implementation of stack is executed successfully.



--- Content provided by FirstRanker.com ---



25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of queue.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)

--- Content provided by FirstRanker.com ---

6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---


1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---




26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 23

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---

Front--> 12 23 34 45 56 <--Rear




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome:
Thus the program for array implementation of stack and queue is attained.


--- Content provided by FirstRanker.com ---


1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?

--- Content provided by FirstRanker.com ---

5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?

--- Content provided by FirstRanker.com ---

10. What is stack overflow?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined

--- Content provided by FirstRanker.com ---

functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.

--- Content provided by FirstRanker.com ---

5. Finally, set top = newNode.



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls

--- Content provided by FirstRanker.com ---

in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.




--- Content provided by FirstRanker.com ---


33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---


DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---




Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---


Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---



1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?

--- Content provided by FirstRanker.com ---

4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?

--- Content provided by FirstRanker.com ---

9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 7 a APPLICATION OF STACKS

Aim:

To write a C program to perform infix to postfix expression

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

--- Content provided by FirstRanker.com ---


5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the

--- Content provided by FirstRanker.com ---

operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing infix expression to postfix expression is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform postfix to infix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

--- Content provided by FirstRanker.com ---


4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---

5. Finally! perform a pop operation and display the popped value as final result.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for application of stack and queue is attained.

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?

--- Content provided by FirstRanker.com ---

4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?

--- Content provided by FirstRanker.com ---

9. List out the types of linked list.
10. What is circular linked list?



--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program for performing Binary Tree Traversal.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

4. Traverse the right subtree of N (R).

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).

--- Content provided by FirstRanker.com ---

7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

10. Process the root node (N).




--- Content provided by FirstRanker.com ---



40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

--- Content provided by FirstRanker.com ---


Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

--- Content provided by FirstRanker.com ---

Result :
Thus the program for performing binary tree traversal is executed successfully.

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

--- Content provided by FirstRanker.com ---


Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to performing Binary Search Tree Operations.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.

--- Content provided by FirstRanker.com ---

4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.

--- Content provided by FirstRanker.com ---

8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.


--- Content provided by FirstRanker.com ---


42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


10. If we reach to a leaf node and it is also not matching, then display "Element not found"

--- Content provided by FirstRanker.com ---

and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.

--- Content provided by FirstRanker.com ---

4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).

--- Content provided by FirstRanker.com ---

7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child

--- Content provided by FirstRanker.com ---

Case 3: Deleting a node with two children

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.

--- Content provided by FirstRanker.com ---




43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.

--- Content provided by FirstRanker.com ---

3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.

--- Content provided by FirstRanker.com ---

3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Select an option
1- insert.
2- Search.
3- Delete.

--- Content provided by FirstRanker.com ---

4 ? Display.
5 - Exit

Enter your choice : 1
Enter the node value : 6

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 1

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 5

Enter your choice : 1
Enter the node value : 2

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 4

Enter your choice : 1
Enter the node value : 3

--- Content provided by FirstRanker.com ---


Select an option
1- insert.
2- Search.
3- Delete.

--- Content provided by FirstRanker.com ---

4 ? Display.
5 - Exit

Enter your choice : 4
1

--- Content provided by FirstRanker.com ---

2
3
4
5
6

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

Thus the program for implementation of Binary Search Trees is attained.

--- Content provided by FirstRanker.com ---


Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.

--- Content provided by FirstRanker.com ---

? Syntax tree- Used for construction of compiler and calculator to parse expression




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linear Search Operation.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.

--- Content provided by FirstRanker.com ---

7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.



--- Content provided by FirstRanker.com ---





47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter number of elements : 7

--- Content provided by FirstRanker.com ---

Enter Array Elements :

23 6 12 5 0 32 10
Enter element to locate : 5
Element found at position 3

--- Content provided by FirstRanker.com ---


Result :
Thus the program to perform Linear search operation is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Binary Search Operation.

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Read the search element from the user
3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.

--- Content provided by FirstRanker.com ---

5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.

--- Content provided by FirstRanker.com ---

8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.
10. If that element also doesn't match with the search element, then display "Element not found in the

--- Content provided by FirstRanker.com ---

list!!!" and terminate the function.




--- Content provided by FirstRanker.com ---


49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :
Enter array size : 10
Elements in Sorted Order

--- Content provided by FirstRanker.com ---

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

Found at index 8 in 2 attempts

--- Content provided by FirstRanker.com ---

Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :
Thus the implementation of Linear search and Binary search is attained.
Applications:

--- Content provided by FirstRanker.com ---

? Searching used in information retrieval.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Insertion Sorting.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.

--- Content provided by FirstRanker.com ---

4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :
Enter total elements: 6

Enter array elements: 34 8 64 51 32 21

--- Content provided by FirstRanker.com ---

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64

--- Content provided by FirstRanker.com ---

Sorted List : 8 21 32 34 51 64
Result :
Thus the program to perform insertion sort is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

Aim:

To write a C program to perform Bubble Sorting.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Set the size of the array and declare the variables.

3. Repeat the steps 4 ? 9 while i > 1

4. set j=0.

--- Content provided by FirstRanker.com ---


5. Repeat steps 6 ? 8 while j < i-1.

6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

--- Content provided by FirstRanker.com ---

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

8. set j=j + 1.

9. set i= i -1.

--- Content provided by FirstRanker.com ---


10. stop.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter the number of elements in the array :
5

Enter the 5 elements to sort :
18

--- Content provided by FirstRanker.com ---

3
2
33
21

--- Content provided by FirstRanker.com ---

The sorted elements are :

2
3
18

--- Content provided by FirstRanker.com ---

21
33

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform bubble sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Quick Sorting.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. 1. If n < = 1, then return.

--- Content provided by FirstRanker.com ---

2. Pick any element V in a[]. This is called the pivot.

3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V
left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---


4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform infix to postfix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---


4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---


6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform postfix to infix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading

--- Content provided by FirstRanker.com ---

symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for application of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.



--- Content provided by FirstRanker.com ---





1. What are the applications of stack?

--- Content provided by FirstRanker.com ---

2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?

--- Content provided by FirstRanker.com ---

7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program for performing Binary Tree Traversal.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

PREORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).


--- Content provided by FirstRanker.com ---





40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data

--- Content provided by FirstRanker.com ---

? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
Search Operation in BST

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.

--- Content provided by FirstRanker.com ---

6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---




42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode

--- Content provided by FirstRanker.com ---

is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST

--- Content provided by FirstRanker.com ---

Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.



--- Content provided by FirstRanker.com ---

43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Case 2: Deleting a node with one child

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.

--- Content provided by FirstRanker.com ---

6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Sample Output :

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 5

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 3

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 4
1
2
3
4

--- Content provided by FirstRanker.com ---

5
6



--- Content provided by FirstRanker.com ---





45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored

--- Content provided by FirstRanker.com ---

? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linear Search Operation.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10

--- Content provided by FirstRanker.com ---

Enter element to locate : 5
Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to perform Binary Search Operation.

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.

--- Content provided by FirstRanker.com ---

7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one

--- Content provided by FirstRanker.com ---

element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.


--- Content provided by FirstRanker.com ---




49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter array size : 10

--- Content provided by FirstRanker.com ---

Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

--- Content provided by FirstRanker.com ---

Found at index 8 in 2 attempts

Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Insertion Sorting.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.

--- Content provided by FirstRanker.com ---

3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :
Enter total elements: 6

--- Content provided by FirstRanker.com ---

Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21

--- Content provided by FirstRanker.com ---

After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :
Thus the program to perform insertion sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Bubble Sorting.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Set the size of the array and declare the variables.

3. Repeat the steps 4 ? 9 while i > 1

--- Content provided by FirstRanker.com ---


4. set j=0.

5. Repeat steps 6 ? 8 while j < i-1.

--- Content provided by FirstRanker.com ---

6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

8. set j=j + 1.

--- Content provided by FirstRanker.com ---


9. set i= i -1.

10. stop.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter the number of elements in the array :
5

--- Content provided by FirstRanker.com ---

Enter the 5 elements to sort :
18
3
2
33

--- Content provided by FirstRanker.com ---

21

The sorted elements are :

2

--- Content provided by FirstRanker.com ---

3
18
21
33

--- Content provided by FirstRanker.com ---

Result :

Thus the program to perform bubble sort is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Quick Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. 1. If n < = 1, then return.

2. Pick any element V in a[]. This is called the pivot.

3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V

--- Content provided by FirstRanker.com ---

left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

Enter the number of elements in the array :
6

--- Content provided by FirstRanker.com ---


Enter the 6 elements to sort :
34
99
5

--- Content provided by FirstRanker.com ---

2
57
40

The sorted elements are :

--- Content provided by FirstRanker.com ---


2
5
34
40

--- Content provided by FirstRanker.com ---

57
99

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform Quick sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---





?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.


--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---


DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


--- Content provided by FirstRanker.com ---

To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


--- Content provided by FirstRanker.com ---

? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,

--- Content provided by FirstRanker.com ---

innovation and ethical practices

VISION
MISSION
VISION

--- Content provided by FirstRanker.com ---

MISSION



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of

--- Content provided by FirstRanker.com ---

Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will

--- Content provided by FirstRanker.com ---

build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and

--- Content provided by FirstRanker.com ---

pursuing advanced degrees




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications

--- Content provided by FirstRanker.com ---

d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable

--- Content provided by FirstRanker.com ---

h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS




--- Content provided by FirstRanker.com ---


? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms

--- Content provided by FirstRanker.com ---

LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---


4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


12. Implementation Hash functions, collision resolution technique



--- Content provided by FirstRanker.com ---



COURSE OBJECTIVES


--- Content provided by FirstRanker.com ---


5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized

--- Content provided by FirstRanker.com ---

way.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





COURSE OUTCOMES

--- Content provided by FirstRanker.com ---




6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---


Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---


7

2
Programs using strings ? string function implementation 13

--- Content provided by FirstRanker.com ---

3

Programs using structures and pointers

15

--- Content provided by FirstRanker.com ---

4
Programs involving dynamic memory allocations

20
5

--- Content provided by FirstRanker.com ---

Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues
29

--- Content provided by FirstRanker.com ---

7
Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

39
9
Implementation of Binary Search trees
41
10

--- Content provided by FirstRanker.com ---

Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

50
12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.

--- Content provided by FirstRanker.com ---

5. This process repeats until the test expression is false.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---

Thus the program to find the sum of n natural numbers was executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---



Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise AND operator & = 8

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise OR operator | = 29

A= 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12
complement = -36

--- Content provided by FirstRanker.com ---

Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106

--- Content provided by FirstRanker.com ---

Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848

--- Content provided by FirstRanker.com ---

Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---



Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.

--- Content provided by FirstRanker.com ---

5. Display the output.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35

--- Content provided by FirstRanker.com ---

Enter number3: 38
Enter number4: 31
Enter number5: 49

Average = 39

--- Content provided by FirstRanker.com ---

Result :

Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller

--- Content provided by FirstRanker.com ---

? Developing verifications of software code ,simulator.



1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---


2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---


7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---

9. What is multi dimensional array ?

10. How to access the elements in the array.


--- Content provided by FirstRanker.com ---

VIVA - VOCE



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


--- Content provided by FirstRanker.com ---

AIM:

To write a c program to perform string manipulation function.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Get the string by using gets() function.

4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---



1. What is a function ?
2. Mention the types of function.
3. What is a character ?

--- Content provided by FirstRanker.com ---

4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---


To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---


4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---


Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---



Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---

4. Call the required functions inside the main function.

5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter No. of Employees : 2

Enter Employee Details

Enter Employee Id : 436

--- Content provided by FirstRanker.com ---

Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---


********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---

********************************************************************************


Result :

--- Content provided by FirstRanker.com ---

Thus the program using structure is executed successfully.

Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---


Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


--- Content provided by FirstRanker.com ---

1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?

--- Content provided by FirstRanker.com ---

9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---


Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorthim:
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter integer value: 100
Enter character value: x

--- Content provided by FirstRanker.com ---

Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---


1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?

--- Content provided by FirstRanker.com ---

5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?

--- Content provided by FirstRanker.com ---

10.What is syntax for calloc()?
.



--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a

--- Content provided by FirstRanker.com ---

constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to

--- Content provided by FirstRanker.com ---

perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION


--- Content provided by FirstRanker.com ---


23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---


STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack is executed successfully.




--- Content provided by FirstRanker.com ---


25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific

--- Content provided by FirstRanker.com ---

value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls

--- Content provided by FirstRanker.com ---

to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as

--- Content provided by FirstRanker.com ---

deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 34

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the program for array implementation of stack and queue is attained.



--- Content provided by FirstRanker.com ---

1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?

--- Content provided by FirstRanker.com ---

6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---




30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.

--- Content provided by FirstRanker.com ---

enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to

--- Content provided by FirstRanker.com ---

'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---



Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.


--- Content provided by FirstRanker.com ---


1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?

--- Content provided by FirstRanker.com ---

5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?

--- Content provided by FirstRanker.com ---

10. What is meant by singly linked list?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform infix to postfix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

--- Content provided by FirstRanker.com ---

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator

--- Content provided by FirstRanker.com ---

and print them to the result.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : A B + C D - *

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 7 b APPLICATION OF STACKS

Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

--- Content provided by FirstRanker.com ---

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---


Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?

--- Content provided by FirstRanker.com ---

5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.

--- Content provided by FirstRanker.com ---

10. What is circular linked list?




--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 8 IMPLEMENTATION OF TREES, TREE

--- Content provided by FirstRanker.com ---

TRAVERSALS

Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---


INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---


POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

--- Content provided by FirstRanker.com ---

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing binary tree traversal is executed successfully.

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to performing Binary Search Tree Operations.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node

--- Content provided by FirstRanker.com ---

9. If we reach to the node with search value, then display "Element is found" and terminate
the function.



--- Content provided by FirstRanker.com ---

42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.

--- Content provided by FirstRanker.com ---

Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than

--- Content provided by FirstRanker.com ---

the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or

--- Content provided by FirstRanker.com ---

equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---


Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.

--- Content provided by FirstRanker.com ---



43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.

--- Content provided by FirstRanker.com ---

Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.

--- Content provided by FirstRanker.com ---

4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Select an option
1- insert.
2- Search.
3- Delete.
4 ? Display.

--- Content provided by FirstRanker.com ---

5 - Exit

Enter your choice : 1
Enter the node value : 6

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 1

Enter your choice : 1
Enter the node value : 5

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 2

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 4

Enter your choice : 1
Enter the node value : 3

--- Content provided by FirstRanker.com ---

Select an option
1- insert.
2- Search.
3- Delete.
4 ? Display.

--- Content provided by FirstRanker.com ---

5 - Exit

Enter your choice : 4
1
2

--- Content provided by FirstRanker.com ---

3
4
5
6

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for implementation of Binary Search Trees is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

To write a C program to perform Linear Search Operation.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate

--- Content provided by FirstRanker.com ---

the function.




--- Content provided by FirstRanker.com ---




47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter number of elements : 7
Enter Array Elements :

--- Content provided by FirstRanker.com ---


23 6 12 5 0 32 10
Enter element to locate : 5
Element found at position 3

--- Content provided by FirstRanker.com ---

Result :
Thus the program to perform Linear search operation is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Binary Search Operation.

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the search element from the user
3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

6. If both are not matching, then check whether the search element is smaller or larger than middle
element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right

--- Content provided by FirstRanker.com ---

sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :
Enter array size : 10
Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18

--- Content provided by FirstRanker.com ---

Enter element to locate : 16

Found at index 8 in 2 attempts

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform binary search operation is executed successfully.
Outcome :
Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

Aim:

To write a C program to perform Insertion Sorting.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---

Enter total elements: 6

Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21

--- Content provided by FirstRanker.com ---

After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64

--- Content provided by FirstRanker.com ---

Result :
Thus the program to perform insertion sort is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Bubble Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Set the size of the array and declare the variables.

--- Content provided by FirstRanker.com ---


3. Repeat the steps 4 ? 9 while i > 1

4. set j=0.

--- Content provided by FirstRanker.com ---

5. Repeat steps 6 ? 8 while j < i-1.

6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

--- Content provided by FirstRanker.com ---


8. set j=j + 1.

9. set i= i -1.

--- Content provided by FirstRanker.com ---

10. stop.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter the number of elements in the array :

--- Content provided by FirstRanker.com ---

5

Enter the 5 elements to sort :
18
3

--- Content provided by FirstRanker.com ---

2
33
21

The sorted elements are :

--- Content provided by FirstRanker.com ---


2
3
18
21

--- Content provided by FirstRanker.com ---

33

Result :

Thus the program to perform bubble sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Quick Sorting.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. 1. If n < = 1, then return.

2. Pick any element V in a[]. This is called the pivot.

--- Content provided by FirstRanker.com ---


3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V
left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---

4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter the number of elements in the array :
6

Enter the 6 elements to sort :
34

--- Content provided by FirstRanker.com ---

99
5
2
57
40

--- Content provided by FirstRanker.com ---


The sorted elements are :

2
5

--- Content provided by FirstRanker.com ---

34
40
57
99

--- Content provided by FirstRanker.com ---

Result :

Thus the program to perform Quick sort is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



56 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 11 d IMPLEMENTATION OF MERGE SORT

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Merge Sorting.

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Divide the unsorted list into N sublists, each containing 1 element.
3. Take adjacent pairs of two singleton lists and merge them to form a list of 2 elements. N will
now convert into N/2 lists of size 2.
4. Repeat the process till a single sorted list of obtained.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform infix to postfix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---


4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---


6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform postfix to infix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading

--- Content provided by FirstRanker.com ---

symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for application of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.



--- Content provided by FirstRanker.com ---





1. What are the applications of stack?

--- Content provided by FirstRanker.com ---

2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?

--- Content provided by FirstRanker.com ---

7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program for performing Binary Tree Traversal.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

PREORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).


--- Content provided by FirstRanker.com ---





40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data

--- Content provided by FirstRanker.com ---

? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
Search Operation in BST

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.

--- Content provided by FirstRanker.com ---

6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---




42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode

--- Content provided by FirstRanker.com ---

is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST

--- Content provided by FirstRanker.com ---

Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.



--- Content provided by FirstRanker.com ---

43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Case 2: Deleting a node with one child

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.

--- Content provided by FirstRanker.com ---

6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Sample Output :

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 5

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 3

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 4
1
2
3
4

--- Content provided by FirstRanker.com ---

5
6



--- Content provided by FirstRanker.com ---





45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored

--- Content provided by FirstRanker.com ---

? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linear Search Operation.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10

--- Content provided by FirstRanker.com ---

Enter element to locate : 5
Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to perform Binary Search Operation.

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.

--- Content provided by FirstRanker.com ---

7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one

--- Content provided by FirstRanker.com ---

element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.


--- Content provided by FirstRanker.com ---




49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter array size : 10

--- Content provided by FirstRanker.com ---

Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

--- Content provided by FirstRanker.com ---

Found at index 8 in 2 attempts

Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Insertion Sorting.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.

--- Content provided by FirstRanker.com ---

3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :
Enter total elements: 6

--- Content provided by FirstRanker.com ---

Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21

--- Content provided by FirstRanker.com ---

After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :
Thus the program to perform insertion sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Bubble Sorting.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Set the size of the array and declare the variables.

3. Repeat the steps 4 ? 9 while i > 1

--- Content provided by FirstRanker.com ---


4. set j=0.

5. Repeat steps 6 ? 8 while j < i-1.

--- Content provided by FirstRanker.com ---

6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

8. set j=j + 1.

--- Content provided by FirstRanker.com ---


9. set i= i -1.

10. stop.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter the number of elements in the array :
5

--- Content provided by FirstRanker.com ---

Enter the 5 elements to sort :
18
3
2
33

--- Content provided by FirstRanker.com ---

21

The sorted elements are :

2

--- Content provided by FirstRanker.com ---

3
18
21
33

--- Content provided by FirstRanker.com ---

Result :

Thus the program to perform bubble sort is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Quick Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. 1. If n < = 1, then return.

2. Pick any element V in a[]. This is called the pivot.

3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V

--- Content provided by FirstRanker.com ---

left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

Enter the number of elements in the array :
6

--- Content provided by FirstRanker.com ---


Enter the 6 elements to sort :
34
99
5

--- Content provided by FirstRanker.com ---

2
57
40

The sorted elements are :

--- Content provided by FirstRanker.com ---


2
5
34
40

--- Content provided by FirstRanker.com ---

57
99

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform Quick sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

56 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 d IMPLEMENTATION OF MERGE SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Merge Sorting.

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Divide the unsorted list into N sublists, each containing 1 element.
3. Take adjacent pairs of two singleton lists and merge them to form a list of 2 elements. N will

--- Content provided by FirstRanker.com ---

now convert into N/2 lists of size 2.
4. Repeat the process till a single sorted list of obtained.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


57 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Enter the number of elements in the array :
8

Enter the 6 elements to sort :

--- Content provided by FirstRanker.com ---

34
99
5
2
57

--- Content provided by FirstRanker.com ---

40
8
29

The sorted elements are :

--- Content provided by FirstRanker.com ---


2
5
8
29

--- Content provided by FirstRanker.com ---

34
40
57
99

--- Content provided by FirstRanker.com ---

Result :

Thus the program to perform Merge sort is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the implementation of Insertion sort, Bubble sort, Quick sort, Merge sort is attained.


Applications:

--- Content provided by FirstRanker.com ---

? Merge sort ? Merge sort are used in external database.
? Bubble Sort-Used in programming for TV remote application
? Heap sort ?Used in reading bar codes in plastic cards
? Quick Sort ?Sports scores are organized by quick sort.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---





?

--- Content provided by FirstRanker.com ---




DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________


--- Content provided by FirstRanker.com ---




LABORATORY MANUAL

--- Content provided by FirstRanker.com ---



1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.


--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---


DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


--- Content provided by FirstRanker.com ---

To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


--- Content provided by FirstRanker.com ---

? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,

--- Content provided by FirstRanker.com ---

innovation and ethical practices

VISION
MISSION
VISION

--- Content provided by FirstRanker.com ---

MISSION



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of

--- Content provided by FirstRanker.com ---

Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will

--- Content provided by FirstRanker.com ---

build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and

--- Content provided by FirstRanker.com ---

pursuing advanced degrees




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications

--- Content provided by FirstRanker.com ---

d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable

--- Content provided by FirstRanker.com ---

h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS




--- Content provided by FirstRanker.com ---


? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms

--- Content provided by FirstRanker.com ---

LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---


4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


12. Implementation Hash functions, collision resolution technique



--- Content provided by FirstRanker.com ---



COURSE OBJECTIVES


--- Content provided by FirstRanker.com ---


5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized

--- Content provided by FirstRanker.com ---

way.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





COURSE OUTCOMES

--- Content provided by FirstRanker.com ---




6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---


Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---


7

2
Programs using strings ? string function implementation 13

--- Content provided by FirstRanker.com ---

3

Programs using structures and pointers

15

--- Content provided by FirstRanker.com ---

4
Programs involving dynamic memory allocations

20
5

--- Content provided by FirstRanker.com ---

Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues
29

--- Content provided by FirstRanker.com ---

7
Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

39
9
Implementation of Binary Search trees
41
10

--- Content provided by FirstRanker.com ---

Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

50
12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.

--- Content provided by FirstRanker.com ---

5. This process repeats until the test expression is false.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---

Thus the program to find the sum of n natural numbers was executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---



Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise AND operator & = 8

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise OR operator | = 29

A= 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12
complement = -36

--- Content provided by FirstRanker.com ---

Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106

--- Content provided by FirstRanker.com ---

Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848

--- Content provided by FirstRanker.com ---

Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---



Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.

--- Content provided by FirstRanker.com ---

5. Display the output.
6. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35

--- Content provided by FirstRanker.com ---

Enter number3: 38
Enter number4: 31
Enter number5: 49

Average = 39

--- Content provided by FirstRanker.com ---

Result :

Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller

--- Content provided by FirstRanker.com ---

? Developing verifications of software code ,simulator.



1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---


2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---

4. What is the difference between while and do while loop statement ?

5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---


7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---

9. What is multi dimensional array ?

10. How to access the elements in the array.


--- Content provided by FirstRanker.com ---

VIVA - VOCE



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


--- Content provided by FirstRanker.com ---

AIM:

To write a c program to perform string manipulation function.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Get the string by using gets() function.

4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---



1. What is a function ?
2. Mention the types of function.
3. What is a character ?

--- Content provided by FirstRanker.com ---

4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---


To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---


4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---


Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---



Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---

4. Call the required functions inside the main function.

5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter No. of Employees : 2

Enter Employee Details

Enter Employee Id : 436

--- Content provided by FirstRanker.com ---

Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---


********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---

********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---

********************************************************************************


Result :

--- Content provided by FirstRanker.com ---

Thus the program using structure is executed successfully.

Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---


Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


--- Content provided by FirstRanker.com ---

1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?

--- Content provided by FirstRanker.com ---

9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---


Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorthim:
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter integer value: 100
Enter character value: x

--- Content provided by FirstRanker.com ---

Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---


1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?

--- Content provided by FirstRanker.com ---

5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?

--- Content provided by FirstRanker.com ---

10.What is syntax for calloc()?
.



--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a

--- Content provided by FirstRanker.com ---

constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to

--- Content provided by FirstRanker.com ---

perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION


--- Content provided by FirstRanker.com ---


23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---


STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3

--- Content provided by FirstRanker.com ---

Top--> 34 23 12
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack is executed successfully.




--- Content provided by FirstRanker.com ---


25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific

--- Content provided by FirstRanker.com ---

value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls

--- Content provided by FirstRanker.com ---

to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---



26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as

--- Content provided by FirstRanker.com ---

deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 34

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome:
Thus the program for array implementation of stack and queue is attained.



--- Content provided by FirstRanker.com ---

1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?

--- Content provided by FirstRanker.com ---

6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---




30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.

--- Content provided by FirstRanker.com ---

enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to

--- Content provided by FirstRanker.com ---

'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---



Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.


--- Content provided by FirstRanker.com ---


1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?

--- Content provided by FirstRanker.com ---

5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?

--- Content provided by FirstRanker.com ---

10. What is meant by singly linked list?
VIVA - VOCE



--- Content provided by FirstRanker.com ---

35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform infix to postfix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

--- Content provided by FirstRanker.com ---

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator

--- Content provided by FirstRanker.com ---

and print them to the result.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : A B + C D - *

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 7 b APPLICATION OF STACKS

Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

--- Content provided by FirstRanker.com ---

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---


Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?

--- Content provided by FirstRanker.com ---

5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.

--- Content provided by FirstRanker.com ---

10. What is circular linked list?




--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 8 IMPLEMENTATION OF TREES, TREE

--- Content provided by FirstRanker.com ---

TRAVERSALS

Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---


INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---


POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

--- Content provided by FirstRanker.com ---

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing binary tree traversal is executed successfully.

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to performing Binary Search Tree Operations.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node

--- Content provided by FirstRanker.com ---

9. If we reach to the node with search value, then display "Element is found" and terminate
the function.



--- Content provided by FirstRanker.com ---

42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.

--- Content provided by FirstRanker.com ---

Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than

--- Content provided by FirstRanker.com ---

the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or

--- Content provided by FirstRanker.com ---

equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---


Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.

--- Content provided by FirstRanker.com ---



43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.

--- Content provided by FirstRanker.com ---

Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.

--- Content provided by FirstRanker.com ---

4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Select an option
1- insert.
2- Search.
3- Delete.
4 ? Display.

--- Content provided by FirstRanker.com ---

5 - Exit

Enter your choice : 1
Enter the node value : 6

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 1

Enter your choice : 1
Enter the node value : 5

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 2

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 4

Enter your choice : 1
Enter the node value : 3

--- Content provided by FirstRanker.com ---

Select an option
1- insert.
2- Search.
3- Delete.
4 ? Display.

--- Content provided by FirstRanker.com ---

5 - Exit

Enter your choice : 4
1
2

--- Content provided by FirstRanker.com ---

3
4
5
6

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for implementation of Binary Search Trees is attained.

--- Content provided by FirstRanker.com ---

Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

To write a C program to perform Linear Search Operation.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate

--- Content provided by FirstRanker.com ---

the function.




--- Content provided by FirstRanker.com ---




47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter number of elements : 7
Enter Array Elements :

--- Content provided by FirstRanker.com ---


23 6 12 5 0 32 10
Enter element to locate : 5
Element found at position 3

--- Content provided by FirstRanker.com ---

Result :
Thus the program to perform Linear search operation is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Binary Search Operation.

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Read the search element from the user
3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

6. If both are not matching, then check whether the search element is smaller or larger than middle
element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right

--- Content provided by FirstRanker.com ---

sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :
Enter array size : 10
Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18

--- Content provided by FirstRanker.com ---

Enter element to locate : 16

Found at index 8 in 2 attempts

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform binary search operation is executed successfully.
Outcome :
Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

Aim:

To write a C program to perform Insertion Sorting.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---

Enter total elements: 6

Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21

--- Content provided by FirstRanker.com ---

After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64

--- Content provided by FirstRanker.com ---

Result :
Thus the program to perform insertion sort is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Bubble Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Set the size of the array and declare the variables.

--- Content provided by FirstRanker.com ---


3. Repeat the steps 4 ? 9 while i > 1

4. set j=0.

--- Content provided by FirstRanker.com ---

5. Repeat steps 6 ? 8 while j < i-1.

6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

--- Content provided by FirstRanker.com ---


8. set j=j + 1.

9. set i= i -1.

--- Content provided by FirstRanker.com ---

10. stop.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter the number of elements in the array :

--- Content provided by FirstRanker.com ---

5

Enter the 5 elements to sort :
18
3

--- Content provided by FirstRanker.com ---

2
33
21

The sorted elements are :

--- Content provided by FirstRanker.com ---


2
3
18
21

--- Content provided by FirstRanker.com ---

33

Result :

Thus the program to perform bubble sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Quick Sorting.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. 1. If n < = 1, then return.

2. Pick any element V in a[]. This is called the pivot.

--- Content provided by FirstRanker.com ---


3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V
left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---

4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter the number of elements in the array :
6

Enter the 6 elements to sort :
34

--- Content provided by FirstRanker.com ---

99
5
2
57
40

--- Content provided by FirstRanker.com ---


The sorted elements are :

2
5

--- Content provided by FirstRanker.com ---

34
40
57
99

--- Content provided by FirstRanker.com ---

Result :

Thus the program to perform Quick sort is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



56 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 11 d IMPLEMENTATION OF MERGE SORT

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Merge Sorting.

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Divide the unsorted list into N sublists, each containing 1 element.
3. Take adjacent pairs of two singleton lists and merge them to form a list of 2 elements. N will
now convert into N/2 lists of size 2.
4. Repeat the process till a single sorted list of obtained.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




57 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

Enter the number of elements in the array :
8

--- Content provided by FirstRanker.com ---


Enter the 6 elements to sort :
34
99
5

--- Content provided by FirstRanker.com ---

2
57
40
8
29

--- Content provided by FirstRanker.com ---


The sorted elements are :

2
5

--- Content provided by FirstRanker.com ---

8
29
34
40
57

--- Content provided by FirstRanker.com ---

99

Result :

Thus the program to perform Merge sort is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the implementation of Insertion sort, Bubble sort, Quick sort, Merge sort is attained.

--- Content provided by FirstRanker.com ---


Applications:
? Merge sort ? Merge sort are used in external database.
? Bubble Sort-Used in programming for TV remote application
? Heap sort ?Used in reading bar codes in plastic cards

--- Content provided by FirstRanker.com ---

? Quick Sort ?Sports scores are organized by quick sort.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



58 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 12 a IMPLEMENTATION OF HASH FUNCTION

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Hash Functions.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.
3. An element is converted into an integer by using a hash function. This element can be used as an
index to store the original element, which falls into the hash table.
4. The element is stored in the hash table where it can be quickly retrieved using hashed key.

--- Content provided by FirstRanker.com ---

hash = hashfunc(key)
index = hash % array_size



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---


26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set

--- Content provided by FirstRanker.com ---

both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.

--- Content provided by FirstRanker.com ---

4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 45

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack and queue is attained.



1. What is meant by data structure?

--- Content provided by FirstRanker.com ---

2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?

--- Content provided by FirstRanker.com ---

7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.

--- Content provided by FirstRanker.com ---

2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.

--- Content provided by FirstRanker.com ---

4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of Queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---





33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---


Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL


--- Content provided by FirstRanker.com ---


Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.



--- Content provided by FirstRanker.com ---

1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?

--- Content provided by FirstRanker.com ---

6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform infix to postfix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left

--- Content provided by FirstRanker.com ---

parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the

--- Content provided by FirstRanker.com ---

two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : 53+82-*

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?

--- Content provided by FirstRanker.com ---

6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---



In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---


Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---

TREES

Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that

--- Content provided by FirstRanker.com ---

node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate

--- Content provided by FirstRanker.com ---

the function.



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).

--- Content provided by FirstRanker.com ---

5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.

--- Content provided by FirstRanker.com ---

Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.


--- Content provided by FirstRanker.com ---


43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2

--- Content provided by FirstRanker.com ---

5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---



Sample Output :

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 6

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 1

Enter your choice : 1
Enter the node value : 5

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 3

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 4
1
2
3

--- Content provided by FirstRanker.com ---

4
5
6


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for implementation of Binary Search Trees is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linear Search Operation.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.

--- Content provided by FirstRanker.com ---

4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Enter number of elements : 7
Enter Array Elements :

--- Content provided by FirstRanker.com ---

23 6 12 5 0 32 10
Enter element to locate : 5
Element found at position 3

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform Linear search operation is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Binary Search Operation.

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle

--- Content provided by FirstRanker.com ---

element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.

--- Content provided by FirstRanker.com ---

9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.

--- Content provided by FirstRanker.com ---





49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---

Enter array size : 10
Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

--- Content provided by FirstRanker.com ---


Found at index 8 in 2 attempts

Result :
Thus the program to perform binary search operation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Insertion Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in

--- Content provided by FirstRanker.com ---

unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter total elements: 6

--- Content provided by FirstRanker.com ---


Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21

--- Content provided by FirstRanker.com ---

After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform insertion sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Bubble Sorting.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Set the size of the array and declare the variables.

--- Content provided by FirstRanker.com ---

3. Repeat the steps 4 ? 9 while i > 1

4. set j=0.

5. Repeat steps 6 ? 8 while j < i-1.

--- Content provided by FirstRanker.com ---


6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

--- Content provided by FirstRanker.com ---

8. set j=j + 1.

9. set i= i -1.

10. stop.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter the number of elements in the array :
5

--- Content provided by FirstRanker.com ---


Enter the 5 elements to sort :
18
3
2

--- Content provided by FirstRanker.com ---

33
21

The sorted elements are :

--- Content provided by FirstRanker.com ---

2
3
18
21
33

--- Content provided by FirstRanker.com ---


Result :

Thus the program to perform bubble sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

Aim:

To write a C program to perform Quick Sorting.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. 1. If n < = 1, then return.

2. Pick any element V in a[]. This is called the pivot.

--- Content provided by FirstRanker.com ---

3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V
left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

Enter the number of elements in the array :

--- Content provided by FirstRanker.com ---

6

Enter the 6 elements to sort :
34
99

--- Content provided by FirstRanker.com ---

5
2
57
40

--- Content provided by FirstRanker.com ---

The sorted elements are :

2
5
34

--- Content provided by FirstRanker.com ---

40
57
99

Result :

--- Content provided by FirstRanker.com ---


Thus the program to perform Quick sort is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


56 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 d IMPLEMENTATION OF MERGE SORT

Aim:

To write a C program to perform Merge Sorting.

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Divide the unsorted list into N sublists, each containing 1 element.

--- Content provided by FirstRanker.com ---

3. Take adjacent pairs of two singleton lists and merge them to form a list of 2 elements. N will
now convert into N/2 lists of size 2.
4. Repeat the process till a single sorted list of obtained.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



57 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Enter the number of elements in the array :
8

--- Content provided by FirstRanker.com ---

Enter the 6 elements to sort :
34
99
5
2

--- Content provided by FirstRanker.com ---

57
40
8
29

--- Content provided by FirstRanker.com ---

The sorted elements are :

2
5
8

--- Content provided by FirstRanker.com ---

29
34
40
57
99

--- Content provided by FirstRanker.com ---


Result :

Thus the program to perform Merge sort is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the implementation of Insertion sort, Bubble sort, Quick sort, Merge sort is attained.


--- Content provided by FirstRanker.com ---

Applications:
? Merge sort ? Merge sort are used in external database.
? Bubble Sort-Used in programming for TV remote application
? Heap sort ?Used in reading bar codes in plastic cards
? Quick Sort ?Sports scores are organized by quick sort.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


58 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 12 a IMPLEMENTATION OF HASH FUNCTION

Aim:

To write a C program to perform Hash Functions.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. An element is converted into an integer by using a hash function. This element can be used as an
index to store the original element, which falls into the hash table.
4. The element is stored in the hash table where it can be quickly retrieved using hashed key.
hash = hashfunc(key)

--- Content provided by FirstRanker.com ---

index = hash % array_size




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




59 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

Enter the next key : 10765

The hash key generarted for the key 10765 is 765.

--- Content provided by FirstRanker.com ---


Result :
Thus the program to perform hash function is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



FirstRanker.com - FirstRanker's Choice


--- Content provided by FirstRanker.com ---



?


--- Content provided by FirstRanker.com ---


DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017




--- Content provided by FirstRanker.com ---




Name : ______________________________________
Register No. : ______________________________________

--- Content provided by FirstRanker.com ---

Section : ______________________________________




--- Content provided by FirstRanker.com ---


LABORATORY MANUAL



--- Content provided by FirstRanker.com ---

1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---




is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education

--- Content provided by FirstRanker.com ---

and training.


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at

--- Content provided by FirstRanker.com ---

different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

--- Content provided by FirstRanker.com ---

ENGINEERING


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions

--- Content provided by FirstRanker.com ---

to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry

--- Content provided by FirstRanker.com ---

? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---

VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---



2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence

--- Content provided by FirstRanker.com ---

To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products

--- Content provided by FirstRanker.com ---

requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies

--- Content provided by FirstRanker.com ---

5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field

--- Content provided by FirstRanker.com ---

b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools

--- Content provided by FirstRanker.com ---

f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms

--- Content provided by FirstRanker.com ---

i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---





? To understand and implement basic data structures using C

--- Content provided by FirstRanker.com ---

? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

2. Programs using strings ? string function implementation

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals

--- Content provided by FirstRanker.com ---

9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OBJECTIVES



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





? To Write basic and advanced programs in c.

--- Content provided by FirstRanker.com ---

? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



COURSE OUTCOMES


--- Content provided by FirstRanker.com ---


6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C

--- Content provided by FirstRanker.com ---

SYLLABUS

CONTENTS

Sl. No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1

Basic C Programs ? looping, data manipulations, arrays

7

--- Content provided by FirstRanker.com ---


2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---

Programs using structures and pointers

15
4
Programs involving dynamic memory allocations

--- Content provided by FirstRanker.com ---


20
5
Array implementation of stacks and queues
22

--- Content provided by FirstRanker.com ---

6
Linked list implementation of stacks and queues
29
7
Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

35
8
Implementation of Trees, Tree Traversals
39
9

--- Content provided by FirstRanker.com ---

Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search
46

--- Content provided by FirstRanker.com ---

11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50
12

--- Content provided by FirstRanker.com ---

Implementation Hash functions, collision resolution technique

58


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


Aim:

--- Content provided by FirstRanker.com ---


To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Read the variables.

--- Content provided by FirstRanker.com ---

3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output
Enter a positive integer: 10

--- Content provided by FirstRanker.com ---

Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


--- Content provided by FirstRanker.com ---

Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise AND operator & = 8

A = 10
B = 25
Bitwise OR operator | = 29

--- Content provided by FirstRanker.com ---


A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---

complement = ~35
complement = ~-12
complement = -36
Output = 11
Shift Operator ( >> and <<)

--- Content provided by FirstRanker.com ---

Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---

Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---

Thus the program for data manipulations using the bitwise operators is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP 1 c BASIC C PROGRAM ? ARRAYS


--- Content provided by FirstRanker.com ---

Aim:

To write a C program using Arrays

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38
Enter number4: 31

--- Content provided by FirstRanker.com ---

Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---

Thus the program using arrays is executed successfully.

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.

--- Content provided by FirstRanker.com ---

? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---



1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

--- Content provided by FirstRanker.com ---


3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---

5. What is an operator ?

6. Mention the bitwise operators.

7. What is an array ?

--- Content provided by FirstRanker.com ---


8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---

10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---



13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---

To write a c program to perform string manipulation function.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---

4. Call the required string manipulation function.

5. Display the results by using the puts() function.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter string: String

--- Content provided by FirstRanker.com ---

Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

--- Content provided by FirstRanker.com ---


Applications:
? String are used in spell checker, spam filter, intrusion detection


--- Content provided by FirstRanker.com ---

1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?
5. Difference between character and string.

--- Content provided by FirstRanker.com ---

6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 a : PROGRAMS USING POINTERS

--- Content provided by FirstRanker.com ---



Aim:

To write a c program to perform swapping operation using pointers.

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to

--- Content provided by FirstRanker.com ---

obtain the value.

5. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Before Swapping : A = 10 B = 20

--- Content provided by FirstRanker.com ---


After Swapping : A = 20 B = 10


Result :

--- Content provided by FirstRanker.com ---


Thus the program to swap two numbers using pointers is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 b : PROGRAMS USING STRUCTURES


--- Content provided by FirstRanker.com ---

Aim:

To write a c program using structures.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

--- Content provided by FirstRanker.com ---


3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---

5. Display the output.

6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---

Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 463
Enter Employee Name :Rajesh

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 22000

XYZ & Co. Payroll

********************************************************************************

--- Content provided by FirstRanker.com ---


EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---


Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the programs using structures and pointers is attained.

Applications:

--- Content provided by FirstRanker.com ---

? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?
2. What is meant by structure?

--- Content provided by FirstRanker.com ---

3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


5. What are the usages of pointers?

--- Content provided by FirstRanker.com ---

6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.

--- Content provided by FirstRanker.com ---

4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

--- Content provided by FirstRanker.com ---


Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.

--- Content provided by FirstRanker.com ---

Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

1. What is memory allocation?

--- Content provided by FirstRanker.com ---

2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?

--- Content provided by FirstRanker.com ---

7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?
.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of stack.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).

--- Content provided by FirstRanker.com ---

POP OPERATION



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value

--- Content provided by FirstRanker.com ---

and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

STACK OPERATION

--- Content provided by FirstRanker.com ---


.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---


Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---





25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform array implementation of queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.

--- Content provided by FirstRanker.com ---

4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---


ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.



--- Content provided by FirstRanker.com ---

26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).

--- Content provided by FirstRanker.com ---

DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal

--- Content provided by FirstRanker.com ---

to rear (i <= rear)




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 56

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:
Thus the program for array implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---




1. What is meant by data structure?
2. What are the types of data structure?

--- Content provided by FirstRanker.com ---

3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?

--- Content provided by FirstRanker.com ---

8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.

--- Content provided by FirstRanker.com ---

5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)

--- Content provided by FirstRanker.com ---

3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.


--- Content provided by FirstRanker.com ---


30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


POP OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.

--- Content provided by FirstRanker.com ---

5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---

Result :
Thus the program for Linked List implementation of Stack is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of Queue.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.


--- Content provided by FirstRanker.com ---




33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function

--- Content provided by FirstRanker.com ---

3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).

--- Content provided by FirstRanker.com ---

2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---

Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 34

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---


HEAD -> 34 -> 23 -> NULL



--- Content provided by FirstRanker.com ---

Result :

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for Linked List implementation of stack and queue is attained.

Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used

--- Content provided by FirstRanker.com ---

move running process in queue which is used thread scheduler.



1. What is the meant by linear data structure?

--- Content provided by FirstRanker.com ---

2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?

--- Content provided by FirstRanker.com ---

7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE

--- Content provided by FirstRanker.com ---




35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 7 a APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform infix to postfix expression

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

--- Content provided by FirstRanker.com ---


4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

--- Content provided by FirstRanker.com ---


6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing infix expression to postfix expression is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform postfix to infix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

--- Content provided by FirstRanker.com ---


3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading

--- Content provided by FirstRanker.com ---

symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for application of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.



--- Content provided by FirstRanker.com ---





1. What are the applications of stack?

--- Content provided by FirstRanker.com ---

2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?

--- Content provided by FirstRanker.com ---

7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program for performing Binary Tree Traversal.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

PREORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

INORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL

--- Content provided by FirstRanker.com ---

8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).


--- Content provided by FirstRanker.com ---





40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:
? Manipulate hierarchical data

--- Content provided by FirstRanker.com ---

? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
Search Operation in BST

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.

--- Content provided by FirstRanker.com ---

6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.

--- Content provided by FirstRanker.com ---




42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.

--- Content provided by FirstRanker.com ---

2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode

--- Content provided by FirstRanker.com ---

is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST

--- Content provided by FirstRanker.com ---

Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

Case 1: Deleting a leaf node

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.



--- Content provided by FirstRanker.com ---

43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Case 2: Deleting a node with one child

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation

--- Content provided by FirstRanker.com ---

2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.

--- Content provided by FirstRanker.com ---

6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Sample Output :

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 6

Enter your choice : 1
Enter the node value : 1

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 5

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 3

Select an option
1- insert.

--- Content provided by FirstRanker.com ---

2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---

Enter your choice : 4
1
2
3
4

--- Content provided by FirstRanker.com ---

5
6



--- Content provided by FirstRanker.com ---





45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the program for implementation of Binary Search Trees is attained.

Applications:
? Used in search application where data is constantly entered and stored

--- Content provided by FirstRanker.com ---

? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linear Search Operation.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function

--- Content provided by FirstRanker.com ---

5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Enter number of elements : 7
Enter Array Elements :

23 6 12 5 0 32 10

--- Content provided by FirstRanker.com ---

Enter element to locate : 5
Element found at position 3

Result :
Thus the program to perform Linear search operation is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to perform Binary Search Operation.

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Read the search element from the user

--- Content provided by FirstRanker.com ---

3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.

--- Content provided by FirstRanker.com ---

7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one

--- Content provided by FirstRanker.com ---

element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.


--- Content provided by FirstRanker.com ---




49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter array size : 10

--- Content provided by FirstRanker.com ---

Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

--- Content provided by FirstRanker.com ---

Found at index 8 in 2 attempts

Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Insertion Sorting.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.

--- Content provided by FirstRanker.com ---

3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :
Enter total elements: 6

--- Content provided by FirstRanker.com ---

Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21

--- Content provided by FirstRanker.com ---

After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :
Thus the program to perform insertion sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Bubble Sorting.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Set the size of the array and declare the variables.

3. Repeat the steps 4 ? 9 while i > 1

--- Content provided by FirstRanker.com ---


4. set j=0.

5. Repeat steps 6 ? 8 while j < i-1.

--- Content provided by FirstRanker.com ---

6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

8. set j=j + 1.

--- Content provided by FirstRanker.com ---


9. set i= i -1.

10. stop.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :

Enter the number of elements in the array :
5

--- Content provided by FirstRanker.com ---

Enter the 5 elements to sort :
18
3
2
33

--- Content provided by FirstRanker.com ---

21

The sorted elements are :

2

--- Content provided by FirstRanker.com ---

3
18
21
33

--- Content provided by FirstRanker.com ---

Result :

Thus the program to perform bubble sort is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Quick Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. 1. If n < = 1, then return.

2. Pick any element V in a[]. This is called the pivot.

3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V

--- Content provided by FirstRanker.com ---

left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Sample Output :

Enter the number of elements in the array :
6

--- Content provided by FirstRanker.com ---


Enter the 6 elements to sort :
34
99
5

--- Content provided by FirstRanker.com ---

2
57
40

The sorted elements are :

--- Content provided by FirstRanker.com ---


2
5
34
40

--- Content provided by FirstRanker.com ---

57
99

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform Quick sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

56 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 d IMPLEMENTATION OF MERGE SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Merge Sorting.

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Divide the unsorted list into N sublists, each containing 1 element.
3. Take adjacent pairs of two singleton lists and merge them to form a list of 2 elements. N will

--- Content provided by FirstRanker.com ---

now convert into N/2 lists of size 2.
4. Repeat the process till a single sorted list of obtained.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


57 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---


Enter the number of elements in the array :
8

Enter the 6 elements to sort :

--- Content provided by FirstRanker.com ---

34
99
5
2
57

--- Content provided by FirstRanker.com ---

40
8
29

The sorted elements are :

--- Content provided by FirstRanker.com ---


2
5
8
29

--- Content provided by FirstRanker.com ---

34
40
57
99

--- Content provided by FirstRanker.com ---

Result :

Thus the program to perform Merge sort is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---


Thus the implementation of Insertion sort, Bubble sort, Quick sort, Merge sort is attained.


Applications:

--- Content provided by FirstRanker.com ---

? Merge sort ? Merge sort are used in external database.
? Bubble Sort-Used in programming for TV remote application
? Heap sort ?Used in reading bar codes in plastic cards
? Quick Sort ?Sports scores are organized by quick sort.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

58 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 12 a IMPLEMENTATION OF HASH FUNCTION

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Hash Functions.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---

3. An element is converted into an integer by using a hash function. This element can be used as an
index to store the original element, which falls into the hash table.
4. The element is stored in the hash table where it can be quickly retrieved using hashed key.
hash = hashfunc(key)
index = hash % array_size

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



59 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter the next key : 10765

The hash key generarted for the key 10765 is 765.

--- Content provided by FirstRanker.com ---

Result :
Thus the program to perform hash function is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



60 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 12 a COLLISION RESOLUTION TECHNIQUES

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linear probing.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Create an array of structure (i.e a hash table).

3. Take a key and a value to be stored in hash table as input.

--- Content provided by FirstRanker.com ---

4. Corresponding to the key, an index will be generated i.e every key is stored in a particular array
index.

5. Using the generated index, access the data located in that array index.

--- Content provided by FirstRanker.com ---

6. In case of absence of data, create one and insert the data item (key and value) into it and increment
the size of hash table.

7. In case the data exists, probe through the subsequent elements (looping back if necessary) for free
space to insert new data item.

--- Content provided by FirstRanker.com ---

Note: This probing will continue until we reach the same element again (from where we began probing)

8. To display all the elements of hash table, element at each index is accessed (via for loop).

9. To remove a key from hash table, we will first calculate its index and delete it if key matches, else

--- Content provided by FirstRanker.com ---

probe through elements until we find key or an empty space where not a single data has been entered
(means data does not exist in the hash table).

10. Exit

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---


26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set

--- Content provided by FirstRanker.com ---

both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.

--- Content provided by FirstRanker.com ---

4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 45

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack and queue is attained.



1. What is meant by data structure?

--- Content provided by FirstRanker.com ---

2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?

--- Content provided by FirstRanker.com ---

7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.

--- Content provided by FirstRanker.com ---

2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.

--- Content provided by FirstRanker.com ---

4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of Queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---





33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---


Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL


--- Content provided by FirstRanker.com ---


Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.



--- Content provided by FirstRanker.com ---

1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?

--- Content provided by FirstRanker.com ---

6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform infix to postfix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left

--- Content provided by FirstRanker.com ---

parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the

--- Content provided by FirstRanker.com ---

two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : 53+82-*

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?

--- Content provided by FirstRanker.com ---

6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---



In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---


Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---

TREES

Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that

--- Content provided by FirstRanker.com ---

node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate

--- Content provided by FirstRanker.com ---

the function.



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).

--- Content provided by FirstRanker.com ---

5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.

--- Content provided by FirstRanker.com ---

Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.


--- Content provided by FirstRanker.com ---


43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2

--- Content provided by FirstRanker.com ---

5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---



Sample Output :

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 6

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 1

Enter your choice : 1
Enter the node value : 5

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 3

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 4
1
2
3

--- Content provided by FirstRanker.com ---

4
5
6


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for implementation of Binary Search Trees is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linear Search Operation.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.

--- Content provided by FirstRanker.com ---

4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Enter number of elements : 7
Enter Array Elements :

--- Content provided by FirstRanker.com ---

23 6 12 5 0 32 10
Enter element to locate : 5
Element found at position 3

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform Linear search operation is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Binary Search Operation.

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle

--- Content provided by FirstRanker.com ---

element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.

--- Content provided by FirstRanker.com ---

9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.

--- Content provided by FirstRanker.com ---





49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---

Enter array size : 10
Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

--- Content provided by FirstRanker.com ---


Found at index 8 in 2 attempts

Result :
Thus the program to perform binary search operation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Insertion Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in

--- Content provided by FirstRanker.com ---

unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter total elements: 6

--- Content provided by FirstRanker.com ---


Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21

--- Content provided by FirstRanker.com ---

After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform insertion sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Bubble Sorting.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Set the size of the array and declare the variables.

--- Content provided by FirstRanker.com ---

3. Repeat the steps 4 ? 9 while i > 1

4. set j=0.

5. Repeat steps 6 ? 8 while j < i-1.

--- Content provided by FirstRanker.com ---


6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

--- Content provided by FirstRanker.com ---

8. set j=j + 1.

9. set i= i -1.

10. stop.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter the number of elements in the array :
5

--- Content provided by FirstRanker.com ---


Enter the 5 elements to sort :
18
3
2

--- Content provided by FirstRanker.com ---

33
21

The sorted elements are :

--- Content provided by FirstRanker.com ---

2
3
18
21
33

--- Content provided by FirstRanker.com ---


Result :

Thus the program to perform bubble sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

Aim:

To write a C program to perform Quick Sorting.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. 1. If n < = 1, then return.

2. Pick any element V in a[]. This is called the pivot.

--- Content provided by FirstRanker.com ---

3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V
left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

Enter the number of elements in the array :

--- Content provided by FirstRanker.com ---

6

Enter the 6 elements to sort :
34
99

--- Content provided by FirstRanker.com ---

5
2
57
40

--- Content provided by FirstRanker.com ---

The sorted elements are :

2
5
34

--- Content provided by FirstRanker.com ---

40
57
99

Result :

--- Content provided by FirstRanker.com ---


Thus the program to perform Quick sort is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


56 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 d IMPLEMENTATION OF MERGE SORT

Aim:

To write a C program to perform Merge Sorting.

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Divide the unsorted list into N sublists, each containing 1 element.

--- Content provided by FirstRanker.com ---

3. Take adjacent pairs of two singleton lists and merge them to form a list of 2 elements. N will
now convert into N/2 lists of size 2.
4. Repeat the process till a single sorted list of obtained.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



57 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Enter the number of elements in the array :
8

--- Content provided by FirstRanker.com ---

Enter the 6 elements to sort :
34
99
5
2

--- Content provided by FirstRanker.com ---

57
40
8
29

--- Content provided by FirstRanker.com ---

The sorted elements are :

2
5
8

--- Content provided by FirstRanker.com ---

29
34
40
57
99

--- Content provided by FirstRanker.com ---


Result :

Thus the program to perform Merge sort is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the implementation of Insertion sort, Bubble sort, Quick sort, Merge sort is attained.


--- Content provided by FirstRanker.com ---

Applications:
? Merge sort ? Merge sort are used in external database.
? Bubble Sort-Used in programming for TV remote application
? Heap sort ?Used in reading bar codes in plastic cards
? Quick Sort ?Sports scores are organized by quick sort.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


58 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 12 a IMPLEMENTATION OF HASH FUNCTION

Aim:

To write a C program to perform Hash Functions.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. An element is converted into an integer by using a hash function. This element can be used as an
index to store the original element, which falls into the hash table.
4. The element is stored in the hash table where it can be quickly retrieved using hashed key.
hash = hashfunc(key)

--- Content provided by FirstRanker.com ---

index = hash % array_size




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




59 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

Enter the next key : 10765

The hash key generarted for the key 10765 is 765.

--- Content provided by FirstRanker.com ---


Result :
Thus the program to perform hash function is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




60 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 12 a COLLISION RESOLUTION TECHNIQUES

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linear probing.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Create an array of structure (i.e a hash table).

3. Take a key and a value to be stored in hash table as input.

--- Content provided by FirstRanker.com ---


4. Corresponding to the key, an index will be generated i.e every key is stored in a particular array
index.

5. Using the generated index, access the data located in that array index.

--- Content provided by FirstRanker.com ---


6. In case of absence of data, create one and insert the data item (key and value) into it and increment
the size of hash table.

7. In case the data exists, probe through the subsequent elements (looping back if necessary) for free

--- Content provided by FirstRanker.com ---

space to insert new data item.
Note: This probing will continue until we reach the same element again (from where we began probing)

8. To display all the elements of hash table, element at each index is accessed (via for loop).

--- Content provided by FirstRanker.com ---

9. To remove a key from hash table, we will first calculate its index and delete it if key matches, else
probe through elements until we find key or an empty space where not a single data has been entered
(means data does not exist in the hash table).

10. Exit

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

61 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

--- Content provided by FirstRanker.com ---


Please enter your choice-: 3
Size of Hashtable is-: 0

Do you want to continue-:(press 1 for yes) 1

--- Content provided by FirstRanker.com ---

Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable

--- Content provided by FirstRanker.com ---

4. Display Hashtable

Please enter your choice-: 1
Inserting element in Hashtable
Enter key and value-: 12 10

--- Content provided by FirstRanker.com ---


Key (12) has been inserted

Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing

--- Content provided by FirstRanker.com ---

MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

--- Content provided by FirstRanker.com ---


Please enter your choice-: 1
Inserting element in Hash table
Enter key and value-: 122 4

--- Content provided by FirstRanker.com ---

Key (122) has been inserted

Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing
MENU-:

--- Content provided by FirstRanker.com ---

1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

--- Content provided by FirstRanker.com ---

Please enter your choice-: 3
Size of Hashtable is-: 2



--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice




--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

ELECTRONICS AND COMMUNICATION ENGINEERING

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


Name : ______________________________________
Register No. : ______________________________________
Section : ______________________________________

--- Content provided by FirstRanker.com ---





LABORATORY MANUAL

--- Content provided by FirstRanker.com ---




1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


is committed to provide highly disciplined, conscientious
and enterprising professionals conforming to global standards through value based quality education
and training.

--- Content provided by FirstRanker.com ---


? To provide competent technical manpower capable of meeting requirements of the industry
? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price

--- Content provided by FirstRanker.com ---

tag on heart and soul

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING

--- Content provided by FirstRanker.com ---


To impart professional education integrated with human values to the younger generation, so
as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity

--- Content provided by FirstRanker.com ---


? To educate the students with the state-of-art technologies to meet the growing challenges of
the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems

--- Content provided by FirstRanker.com ---

? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

VISION
MISSION

--- Content provided by FirstRanker.com ---

VISION
MISSION



--- Content provided by FirstRanker.com ---

2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals

--- Content provided by FirstRanker.com ---

To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals
2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this
enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills

--- Content provided by FirstRanker.com ---

To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop
them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer
Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career

--- Content provided by FirstRanker.com ---

c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions
e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,

--- Content provided by FirstRanker.com ---

environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey
in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS



--- Content provided by FirstRanker.com ---



? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures

--- Content provided by FirstRanker.com ---

? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:
1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

--- Content provided by FirstRanker.com ---

3. Programs using structures and pointers

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues
8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

12. Implementation Hash functions, collision resolution technique


--- Content provided by FirstRanker.com ---




COURSE OBJECTIVES

--- Content provided by FirstRanker.com ---



5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.

--- Content provided by FirstRanker.com ---

? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

COURSE OUTCOMES



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---

CONTENTS

Sl. No. Name of the Experiment Page No.
1

--- Content provided by FirstRanker.com ---

Basic C Programs ? looping, data manipulations, arrays

7

2

--- Content provided by FirstRanker.com ---

Programs using strings ? string function implementation 13
3

Programs using structures and pointers

--- Content provided by FirstRanker.com ---

15
4
Programs involving dynamic memory allocations

20

--- Content provided by FirstRanker.com ---

5
Array implementation of stacks and queues
22
6
Linked list implementation of stacks and queues

--- Content provided by FirstRanker.com ---

29
7
Application of Stacks and Queues
35
8

--- Content provided by FirstRanker.com ---

Implementation of Trees, Tree Traversals
39
9
Implementation of Binary Search trees
41

--- Content provided by FirstRanker.com ---

10
Implementation of Linear search and binary search
46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---


50
12
Implementation Hash functions, collision resolution technique

--- Content provided by FirstRanker.com ---

58




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXPT. NO. 1a BASIC C PROGRAM ? LOOPING

--- Content provided by FirstRanker.com ---



Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),

--- Content provided by FirstRanker.com ---

codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Output
Enter a positive integer: 10
Sum = 55
Result:

--- Content provided by FirstRanker.com ---


Thus the program to find the sum of n natural numbers was executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS


Aim:
To write a C program for data manipulations using the bitwise operators

--- Content provided by FirstRanker.com ---


Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :
1. Start the program.
2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---


A = 10
B = 25
Bitwise AND operator & = 8

--- Content provided by FirstRanker.com ---

A = 10
B = 25
Bitwise OR operator | = 29

A= 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

complement = ~35
complement = ~-12

--- Content provided by FirstRanker.com ---

complement = -36
Output = 11
Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212

--- Content provided by FirstRanker.com ---

Right Shift by 1: 106
Right Shift by 2: 53

Left Shift by 0: 212
Left Shift by 1: 424

--- Content provided by FirstRanker.com ---

Left Shift by 2: 848
Result :

Thus the program for data manipulations using the bitwise operators is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

EXP 1 c BASIC C PROGRAM ? ARRAYS


Aim:

--- Content provided by FirstRanker.com ---

To write a C program using Arrays

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals
Algorithm :
1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .

--- Content provided by FirstRanker.com ---

4. Perform the operation based on the program inputs.
5. Display the output.
6. Stop the program.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :
Enter n: 5
Enter number1: 45

--- Content provided by FirstRanker.com ---

Enter number2: 35
Enter number3: 38
Enter number4: 31
Enter number5: 49

--- Content provided by FirstRanker.com ---

Average = 39
Result :

Thus the program using arrays is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software

--- Content provided by FirstRanker.com ---

? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.



--- Content provided by FirstRanker.com ---

1. What is Decision making and Branching ?

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

--- Content provided by FirstRanker.com ---


4. What is the difference between while and do while loop statement ?

5. What is an operator ?

--- Content provided by FirstRanker.com ---

6. Mention the bitwise operators.

7. What is an array ?

8 What is the use of array ?

--- Content provided by FirstRanker.com ---


9. What is multi dimensional array ?

10. How to access the elements in the array.

--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION

--- Content provided by FirstRanker.com ---


AIM:

To write a c program to perform string manipulation function.

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Declare the variables.

--- Content provided by FirstRanker.com ---


3. Get the string by using gets() function.

4. Call the required string manipulation function.

--- Content provided by FirstRanker.com ---

5. Display the results by using the puts() function.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter string: String
Length of string = 6
Result :

--- Content provided by FirstRanker.com ---

Thus the program for string manipulation is executed successfully.
Outcome :
Thus the programs using strings- string function implementation is attained.

Applications:

--- Content provided by FirstRanker.com ---

? String are used in spell checker, spam filter, intrusion detection


1. What is a function ?
2. Mention the types of function.

--- Content provided by FirstRanker.com ---

3. What is a character ?
4. What is a string ?
5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.

--- Content provided by FirstRanker.com ---

8. How to declare a string and character.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXP NO 3 a : PROGRAMS USING POINTERS


--- Content provided by FirstRanker.com ---

Aim:

To write a c program to perform swapping operation using pointers.

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Declare the pointer variables.

--- Content provided by FirstRanker.com ---

3. Initialise the pointer variable with an appropriate address.

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

--- Content provided by FirstRanker.com ---

5. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10

--- Content provided by FirstRanker.com ---



Result :

Thus the program to swap two numbers using pointers is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 b : PROGRAMS USING STRUCTURES


Aim:

--- Content provided by FirstRanker.com ---

To write a c program using structures.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

--- Content provided by FirstRanker.com ---


4. Call the required functions inside the main function.

5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter No. of Employees : 2

Enter Employee Details

--- Content provided by FirstRanker.com ---

Enter Employee Id : 436
Enter Employee Name :Gopal
Enter Basic Salary : 10000

Enter Employee Details

--- Content provided by FirstRanker.com ---


Enter Employee Id : 463
Enter Employee Name :Rajesh
Enter Basic Salary : 22000

--- Content provided by FirstRanker.com ---

XYZ & Co. Payroll

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

--- Content provided by FirstRanker.com ---


********************************************************************************

436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

--- Content provided by FirstRanker.com ---


********************************************************************************


Result :

--- Content provided by FirstRanker.com ---


Thus the program using structure is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using structures and pointers is attained.

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.

--- Content provided by FirstRanker.com ---


1. What is meant by pointers?
2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?

--- Content provided by FirstRanker.com ---

8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?
10.How to pass function to pointers?


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY

--- Content provided by FirstRanker.com ---

ALLOCATION

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals

Algorthim:

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Include the required header file for using the memory allocation function.
3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :
Enter integer value: 100

--- Content provided by FirstRanker.com ---

Enter character value: x
Enter float value: 123.45
Inputted value are: 100, x, 123.45

Result:

--- Content provided by FirstRanker.com ---

Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:
Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded

--- Content provided by FirstRanker.com ---

software .

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?

--- Content provided by FirstRanker.com ---

4. Give some examples for memory allocation?
5. What is the syntax for malloc()?
6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?

--- Content provided by FirstRanker.com ---

9.What is the significance of calloc()?
10.What is syntax for calloc()?
.


--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of stack.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.
3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)

--- Content provided by FirstRanker.com ---

6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.
PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate

--- Content provided by FirstRanker.com ---

the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value
(stack[top] = value).
POP OPERATION

--- Content provided by FirstRanker.com ---



23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and
terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY

--- Content provided by FirstRanker.com ---

1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

--- Content provided by FirstRanker.com ---


STACK OPERATION

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter Stack element : 23

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter Stack element : 34

STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 1
Enter Stack element : 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 2

--- Content provided by FirstRanker.com ---

Popped element is 45
STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 3
Top--> 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 4


Result :

--- Content provided by FirstRanker.com ---


Thus the program for array implementation of stack is executed successfully.



--- Content provided by FirstRanker.com ---



25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform array implementation of queue.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.
3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)

--- Content provided by FirstRanker.com ---

6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.


ENQUEUE OPERATION

--- Content provided by FirstRanker.com ---


1. Check whether queue is FULL. (rear == SIZE-1)
2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.

--- Content provided by FirstRanker.com ---




26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


DEQUEUE OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set
both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)

--- Content provided by FirstRanker.com ---

2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.
4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 23

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 34

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 45

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 56

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

--- Content provided by FirstRanker.com ---

Front--> 12 23 34 45 56 <--Rear




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Result :
Thus the program for array implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome:
Thus the program for array implementation of stack and queue is attained.


--- Content provided by FirstRanker.com ---


1. What is meant by data structure?
2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?

--- Content provided by FirstRanker.com ---

5. State the working principle of stack and queue?
6. What is difference between stack and queue?
7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?

--- Content provided by FirstRanker.com ---

10. What is stack overflow?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


VIVA - VOCE



--- Content provided by FirstRanker.com ---

29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linked List implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined

--- Content provided by FirstRanker.com ---

functions.
3. Define a 'Node' structure with two members data and next.
4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Create a newNode with given value.
2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.

--- Content provided by FirstRanker.com ---

5. Finally, set top = newNode.



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.
4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.
3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Sample Output :
Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

Aim:

To write a C program to perform Linked List implementation of Queue.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Include all the header files which are used in the program. And declare all the user defined functions.
3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls

--- Content provided by FirstRanker.com ---

in the main method to perform user selected operation.
enQueue OPERATION
1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---

4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.




--- Content provided by FirstRanker.com ---


33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


dEQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the
function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

--- Content provided by FirstRanker.com ---


DISPLAY OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.

--- Content provided by FirstRanker.com ---

4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output

Queue using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL

--- Content provided by FirstRanker.com ---




Result :

--- Content provided by FirstRanker.com ---

Thus the program for Linked List implementation of Queue is executed successfully.

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

--- Content provided by FirstRanker.com ---


Applications:
? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.

--- Content provided by FirstRanker.com ---



1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?

--- Content provided by FirstRanker.com ---

4. What is meant by node?
5. What are the operations of stack in the linked list?
6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?

--- Content provided by FirstRanker.com ---

9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?
VIVA - VOCE


--- Content provided by FirstRanker.com ---


35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 7 a APPLICATION OF STACKS

Aim:

To write a C program to perform infix to postfix expression

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Infix Expression.

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

--- Content provided by FirstRanker.com ---


5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left
parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the

--- Content provided by FirstRanker.com ---

operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing infix expression to postfix expression is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 7 b APPLICATION OF STACKS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform postfix to infix expression

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

--- Content provided by FirstRanker.com ---


4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the
two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

--- Content provided by FirstRanker.com ---

5. Finally! perform a pop operation and display the popped value as final result.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


POSTFIX EXPRESSION : (5+3)*(8-2)
INFIX EXPRESSION : 53+82-*

Result :

--- Content provided by FirstRanker.com ---


Thus the program for performing postfix expression to infix expression is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the program for application of stack and queue is attained.

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?

--- Content provided by FirstRanker.com ---

4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?
6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?

--- Content provided by FirstRanker.com ---

9. List out the types of linked list.
10. What is circular linked list?



--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

Aim:

--- Content provided by FirstRanker.com ---

To write a C program for performing Binary Tree Traversal.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).

--- Content provided by FirstRanker.com ---

4. Traverse the right subtree of N (R).

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).

--- Content provided by FirstRanker.com ---

7. Traverse the right subtree of N (R).

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

10. Process the root node (N).




--- Content provided by FirstRanker.com ---



40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :


In order traversal sequence : I - D - J - B - F - A - G - K - C - H

--- Content provided by FirstRanker.com ---


Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

--- Content provided by FirstRanker.com ---

Result :
Thus the program for performing binary tree traversal is executed successfully.

Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

--- Content provided by FirstRanker.com ---


Applications:
? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH
TREES

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to performing Binary Search Tree Operations.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.

--- Content provided by FirstRanker.com ---

4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that
node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.

--- Content provided by FirstRanker.com ---

8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate
the function.


--- Content provided by FirstRanker.com ---


42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


10. If we reach to a leaf node and it is also not matching, then display "Element not found"

--- Content provided by FirstRanker.com ---

and terminate the function.
Insertion Operation in BST
1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.

--- Content provided by FirstRanker.com ---

4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).
5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).

--- Content provided by FirstRanker.com ---

7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.
Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child

--- Content provided by FirstRanker.com ---

Case 3: Deleting a node with two children

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.

--- Content provided by FirstRanker.com ---




43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.

--- Content provided by FirstRanker.com ---

3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children
1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.

--- Content provided by FirstRanker.com ---

3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2
5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Select an option
1- insert.
2- Search.
3- Delete.

--- Content provided by FirstRanker.com ---

4 ? Display.
5 - Exit

Enter your choice : 1
Enter the node value : 6

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 1

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 5

Enter your choice : 1
Enter the node value : 2

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 4

Enter your choice : 1
Enter the node value : 3

--- Content provided by FirstRanker.com ---


Select an option
1- insert.
2- Search.
3- Delete.

--- Content provided by FirstRanker.com ---

4 ? Display.
5 - Exit

Enter your choice : 4
1

--- Content provided by FirstRanker.com ---

2
3
4
5
6

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---




Result :

--- Content provided by FirstRanker.com ---

Thus the program for performing Binary Search Tree Operations is executed successfully.

Outcome :

Thus the program for implementation of Binary Search Trees is attained.

--- Content provided by FirstRanker.com ---


Applications:
? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.

--- Content provided by FirstRanker.com ---

? Syntax tree- Used for construction of compiler and calculator to parse expression




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Linear Search Operation.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Compare, the search element with the first element in the list.
4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.

--- Content provided by FirstRanker.com ---

7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.



--- Content provided by FirstRanker.com ---





47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter number of elements : 7

--- Content provided by FirstRanker.com ---

Enter Array Elements :

23 6 12 5 0 32 10
Enter element to locate : 5
Element found at position 3

--- Content provided by FirstRanker.com ---


Result :
Thus the program to perform Linear search operation is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Binary Search Operation.

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Read the search element from the user
3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.

--- Content provided by FirstRanker.com ---

5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle
element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.

--- Content provided by FirstRanker.com ---

8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.
9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.
10. If that element also doesn't match with the search element, then display "Element not found in the

--- Content provided by FirstRanker.com ---

list!!!" and terminate the function.




--- Content provided by FirstRanker.com ---


49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :
Enter array size : 10
Elements in Sorted Order

--- Content provided by FirstRanker.com ---

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

Found at index 8 in 2 attempts

--- Content provided by FirstRanker.com ---

Result :
Thus the program to perform binary search operation is executed successfully.
Outcome :
Thus the implementation of Linear search and Binary search is attained.
Applications:

--- Content provided by FirstRanker.com ---

? Searching used in information retrieval.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Insertion Sorting.

Software Requirements:
C compiler
Hardware Requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in
unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.

--- Content provided by FirstRanker.com ---

4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

Sample Output :
Enter total elements: 6

Enter array elements: 34 8 64 51 32 21

--- Content provided by FirstRanker.com ---

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21
After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64

--- Content provided by FirstRanker.com ---

Sorted List : 8 21 32 34 51 64
Result :
Thus the program to perform insertion sort is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

Aim:

To write a C program to perform Bubble Sorting.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Set the size of the array and declare the variables.

3. Repeat the steps 4 ? 9 while i > 1

4. set j=0.

--- Content provided by FirstRanker.com ---


5. Repeat steps 6 ? 8 while j < i-1.

6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

--- Content provided by FirstRanker.com ---

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

8. set j=j + 1.

9. set i= i -1.

--- Content provided by FirstRanker.com ---


10. stop.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :

--- Content provided by FirstRanker.com ---

Enter the number of elements in the array :
5

Enter the 5 elements to sort :
18

--- Content provided by FirstRanker.com ---

3
2
33
21

--- Content provided by FirstRanker.com ---

The sorted elements are :

2
3
18

--- Content provided by FirstRanker.com ---

21
33

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform bubble sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Quick Sorting.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. 1. If n < = 1, then return.

--- Content provided by FirstRanker.com ---

2. Pick any element V in a[]. This is called the pivot.

3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V
left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---


4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---


Enter the number of elements in the array :
6

Enter the 6 elements to sort :

--- Content provided by FirstRanker.com ---

34
99
5
2
57

--- Content provided by FirstRanker.com ---

40

The sorted elements are :

2

--- Content provided by FirstRanker.com ---

5
34
40
57
99

--- Content provided by FirstRanker.com ---


Result :

Thus the program to perform Quick sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




56 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 11 d IMPLEMENTATION OF MERGE SORT

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Merge Sorting.

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Divide the unsorted list into N sublists, each containing 1 element.
3. Take adjacent pairs of two singleton lists and merge them to form a list of 2 elements. N will
now convert into N/2 lists of size 2.
4. Repeat the process till a single sorted list of obtained.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





57 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

Enter the number of elements in the array :

--- Content provided by FirstRanker.com ---

8

Enter the 6 elements to sort :
34
99

--- Content provided by FirstRanker.com ---

5
2
57
40
8

--- Content provided by FirstRanker.com ---

29

The sorted elements are :

2

--- Content provided by FirstRanker.com ---

5
8
29
34
40

--- Content provided by FirstRanker.com ---

57
99

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform Merge sort is executed successfully.

Outcome :

Thus the implementation of Insertion sort, Bubble sort, Quick sort, Merge sort is attained.

--- Content provided by FirstRanker.com ---



Applications:
? Merge sort ? Merge sort are used in external database.
? Bubble Sort-Used in programming for TV remote application

--- Content provided by FirstRanker.com ---

? Heap sort ?Used in reading bar codes in plastic cards
? Quick Sort ?Sports scores are organized by quick sort.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




58 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 12 a IMPLEMENTATION OF HASH FUNCTION

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Hash Functions.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.
3. An element is converted into an integer by using a hash function. This element can be used as an
index to store the original element, which falls into the hash table.

--- Content provided by FirstRanker.com ---

4. The element is stored in the hash table where it can be quickly retrieved using hashed key.
hash = hashfunc(key)
index = hash % array_size


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

59 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---



Sample Output :

Enter the next key : 10765

--- Content provided by FirstRanker.com ---


The hash key generarted for the key 10765 is 765.

Result :
Thus the program to perform hash function is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

60 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 12 a COLLISION RESOLUTION TECHNIQUES

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linear probing.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Create an array of structure (i.e a hash table).

--- Content provided by FirstRanker.com ---


3. Take a key and a value to be stored in hash table as input.

4. Corresponding to the key, an index will be generated i.e every key is stored in a particular array
index.

--- Content provided by FirstRanker.com ---


5. Using the generated index, access the data located in that array index.

6. In case of absence of data, create one and insert the data item (key and value) into it and increment
the size of hash table.

--- Content provided by FirstRanker.com ---


7. In case the data exists, probe through the subsequent elements (looping back if necessary) for free
space to insert new data item.
Note: This probing will continue until we reach the same element again (from where we began probing)

--- Content provided by FirstRanker.com ---

8. To display all the elements of hash table, element at each index is accessed (via for loop).

9. To remove a key from hash table, we will first calculate its index and delete it if key matches, else
probe through elements until we find key or an empty space where not a single data has been entered
(means data does not exist in the hash table).

--- Content provided by FirstRanker.com ---


10. Exit



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



61 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable

--- Content provided by FirstRanker.com ---

3. Check the size of Hashtable
4. Display Hashtable

Please enter your choice-: 3
Size of Hashtable is-: 0

--- Content provided by FirstRanker.com ---


Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable

--- Content provided by FirstRanker.com ---

2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

Please enter your choice-: 1

--- Content provided by FirstRanker.com ---

Inserting element in Hashtable
Enter key and value-: 12 10

Key (12) has been inserted

--- Content provided by FirstRanker.com ---

Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable

--- Content provided by FirstRanker.com ---

3. Check the size of Hashtable
4. Display Hashtable

Please enter your choice-: 1
Inserting element in Hash table

--- Content provided by FirstRanker.com ---

Enter key and value-: 122 4

Key (122) has been inserted

Do you want to continue-:(press 1 for yes) 1

--- Content provided by FirstRanker.com ---

Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable

--- Content provided by FirstRanker.com ---

4. Display Hashtable

Please enter your choice-: 3
Size of Hashtable is-: 2

--- Content provided by FirstRanker.com ---




62 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable

--- Content provided by FirstRanker.com ---

2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

Please enter your choice-: 4

--- Content provided by FirstRanker.com ---

Array[0] has no elements

Array[1] has no elements

Array[2] has elements-:

--- Content provided by FirstRanker.com ---

12 (key) and 10 (value)

Array[3] has elements-:
122(key) and 5(value)

--- Content provided by FirstRanker.com ---

Array[4] has no elements

Array[5] has no elements

Array[6] has no elements

--- Content provided by FirstRanker.com ---


Array[7] has no elements

Array[8] has no elements

--- Content provided by FirstRanker.com ---

Array[9] has no elements


Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing

--- Content provided by FirstRanker.com ---

MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

--- Content provided by FirstRanker.com ---


Please enter your choice-: 2
Deleting in Hashtable
Enter the key to delete-: 122

--- Content provided by FirstRanker.com ---

Key (122) has been removed

Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing
MENU-:

--- Content provided by FirstRanker.com ---

1. Inserting item in the Hashtable


FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---




?

--- Content provided by FirstRanker.com ---



DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
III SEMESTER - R 2017



--- Content provided by FirstRanker.com ---





Name : ______________________________________

--- Content provided by FirstRanker.com ---

Register No. : ______________________________________
Section : ______________________________________



--- Content provided by FirstRanker.com ---



LABORATORY MANUAL


--- Content provided by FirstRanker.com ---


1 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---





is committed to provide highly disciplined, conscientious

--- Content provided by FirstRanker.com ---

and enterprising professionals conforming to global standards through value based quality education
and training.


? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at
different levels
? To train the students to sell his brawn and brain to the highest bidder but to never put a price
tag on heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING


To impart professional education integrated with human values to the younger generation, so

--- Content provided by FirstRanker.com ---

as to shape them as proficient and dedicated engineers, capable of providing comprehensive solutions
to the challenges in deploying technology for the service of humanity


? To educate the students with the state-of-art technologies to meet the growing challenges of

--- Content provided by FirstRanker.com ---

the electronics industry
? To carry out research through continuous interaction with research institutes and industry, on
advances in communication systems
? To provide the students with strong ground rules to facilitate them for systematic learning,
innovation and ethical practices

--- Content provided by FirstRanker.com ---


VISION
MISSION
VISION
MISSION

--- Content provided by FirstRanker.com ---




2 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)
1. Fundamentals
To impart students with fundamental knowledge in Mathematics, Science and fundamentals of
Engineering that will would them to be successful professionals

--- Content provided by FirstRanker.com ---

2. Core Competence
To provide students with sound knowledge in engineering and experimental skills to identify
complex software problems in industry and to develop practical solution for them
3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice this

--- Content provided by FirstRanker.com ---

enables to find solutions for real time problem in industry and organization and to design products
requiring interdisciplinary skills
4. Professionalism skills
To bestow students with adequate training and provide opportunities to work as team that will
build up their communication skills, individual leadership and supportive qualities and to develop

--- Content provided by FirstRanker.com ---

them to adapt and work in ever changing technologies
5. Lifelong Learning
To develop the ability of students to establish themselves as professionals in Computer
Science and Engineering and to create awareness about the need for lifelong learning and
pursuing advanced degrees

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

3 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


PROGRAMME OUTCOMES (POs)
a) To apply basic knowledge of Mathematics, Science and engineering fundamentals in Computer

--- Content provided by FirstRanker.com ---

Science and Engineering field
b) To design and conduct experiments as well as to analyze and interpret and apply the same in
the career
c) To design and develop innovative and creative software applications
d) To understand a complex real world problems and develop an efficient practical solutions

--- Content provided by FirstRanker.com ---

e) To create, select and apply appropriate technique, resources, modern engineering and IT tools
f) To understand their roles as professionals and give the best to the soicety
g) To develop a system that will meet expected need with realistic constraints such as economical,
environmental, social, political, ethical, safe and sustainable
h) To communicate effectively and make others understand exactly what they are trying to convey

--- Content provided by FirstRanker.com ---

in both verbal and written forms
i) To engage lifelong learning and exhibit their technical skills
j) To develop and manage projects in multidisciplinary environments


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

4 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

? To understand and implement basic data structures using C
? To apply linear and non-linear data structures in problem solving.
? To learn to implement functions and recursive functions by means of data structures
? To implement searching and sorting algorithms
LIST OF EXPERIMENTS:

--- Content provided by FirstRanker.com ---

1. Basic C Programs ? looping, data manipulations, arrays
2. Programs using strings ? string function implementation

3. Programs using structures and pointers

--- Content provided by FirstRanker.com ---

4. Programs involving dynamic memory allocations

5. Array implementation of stacks and queues
6. Linked list implementation of stacks and queues
7. Application of Stacks and Queues

--- Content provided by FirstRanker.com ---

8. Implementation of Trees, Tree Traversals
9. Implementation of Binary Search trees
10. Implementation of Linear search and binary search
11. Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

--- Content provided by FirstRanker.com ---

12. Implementation Hash functions, collision resolution technique




--- Content provided by FirstRanker.com ---


COURSE OBJECTIVES



--- Content provided by FirstRanker.com ---

5 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---

? To Write basic and advanced programs in c.
? To Implement functions and recursive functions in c.
? To Implement data structures using c.
? To choose appropriate sorting algorithm for an application and implement it in a modularized
way.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




COURSE OUTCOMES

--- Content provided by FirstRanker.com ---



6 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EC8381 - FUNDAMENTALS OF DATA STRUCTURES IN C
SYLLABUS

CONTENTS

--- Content provided by FirstRanker.com ---

Sl. No. Name of the Experiment Page No.
1

Basic C Programs ? looping, data manipulations, arrays

--- Content provided by FirstRanker.com ---

7

2
Programs using strings ? string function implementation 13
3

--- Content provided by FirstRanker.com ---


Programs using structures and pointers

15
4

--- Content provided by FirstRanker.com ---

Programs involving dynamic memory allocations

20
5
Array implementation of stacks and queues

--- Content provided by FirstRanker.com ---

22
6
Linked list implementation of stacks and queues
29
7

--- Content provided by FirstRanker.com ---

Application of Stacks and Queues
35
8
Implementation of Trees, Tree Traversals
39

--- Content provided by FirstRanker.com ---

9
Implementation of Binary Search trees
41
10
Implementation of Linear search and binary search

--- Content provided by FirstRanker.com ---

46
11
Implementation Insertion sort, Bubble sort, Quick sort and Merge Sort

50

--- Content provided by FirstRanker.com ---

12
Implementation Hash functions, collision resolution technique

58

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





7 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



EXPT. NO. 1a BASIC C PROGRAM ? LOOPING


--- Content provided by FirstRanker.com ---

Aim:

To write a C program to calculate the sum of first n natural numbers using for loop statements

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the variables.
3. The initialization statement is executed.
4. The test expression is evaluated, if it is false for loop is terminated, test expression is true (nonzero),
codes inside the body of loop is executed and the update expression is updated.
5. This process repeats until the test expression is false.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


8 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Output

--- Content provided by FirstRanker.com ---

Enter a positive integer: 10
Sum = 55
Result:

Thus the program to find the sum of n natural numbers was executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

9 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP 1 b. BASIC C PROGRAM ? DATA MANIPULATIONS

--- Content provided by FirstRanker.com ---


Aim:
To write a C program for data manipulations using the bitwise operators

Software requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :
1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. Use the required bitwise operators for the given input.
4. Display the result.
5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




10 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Sample Output :

A = 10

--- Content provided by FirstRanker.com ---

B = 25
Bitwise AND operator & = 8

A = 10
B = 25

--- Content provided by FirstRanker.com ---

Bitwise OR operator | = 29

A= 10
B = 25
Bitwise XOR (exclusive OR) operator ^ = 21

--- Content provided by FirstRanker.com ---


complement = ~35
complement = ~-12
complement = -36
Output = 11

--- Content provided by FirstRanker.com ---

Shift Operator ( >> and <<)
Num = 212
Right Shift by 0: 212
Right Shift by 1: 106
Right Shift by 2: 53

--- Content provided by FirstRanker.com ---


Left Shift by 0: 212
Left Shift by 1: 424
Left Shift by 2: 848
Result :

--- Content provided by FirstRanker.com ---


Thus the program for data manipulations using the bitwise operators is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





11 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




EXP 1 c BASIC C PROGRAM ? ARRAYS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program using Arrays

--- Content provided by FirstRanker.com ---

Software requirements:
C compiler
Hardware requirements:
Server with supporting 30 terminals
Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.
2. Declare the array and the variables required for the program.
3. Get the values .
4. Perform the operation based on the program inputs.
5. Display the output.

--- Content provided by FirstRanker.com ---

6. Stop the program.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



12 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :
Enter n: 5
Enter number1: 45
Enter number2: 35
Enter number3: 38

--- Content provided by FirstRanker.com ---

Enter number4: 31
Enter number5: 49

Average = 39
Result :

--- Content provided by FirstRanker.com ---


Thus the program using arrays is executed successfully.

Outcome :

--- Content provided by FirstRanker.com ---

Thus the basic c programs for looping, Data manipulations and arrays is attained.
? C language is used to creating computer application
? Used in writing embedded software
? Firmware for various electronics ,industrial product which uses micro controller
? Developing verifications of software code ,simulator.

--- Content provided by FirstRanker.com ---




1. What is Decision making and Branching ?

--- Content provided by FirstRanker.com ---

2. What are all the different types of control flow statements ?

3. Mention the different types of looping statements.

4. What is the difference between while and do while loop statement ?

--- Content provided by FirstRanker.com ---


5. What is an operator ?

6. Mention the bitwise operators.

--- Content provided by FirstRanker.com ---

7. What is an array ?

8 What is the use of array ?

9. What is multi dimensional array ?

--- Content provided by FirstRanker.com ---


10. How to access the elements in the array.


VIVA - VOCE

--- Content provided by FirstRanker.com ---




13 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


EXP NO 2 : PROGRAMS USING STRINGS FUNCTION


AIM:

--- Content provided by FirstRanker.com ---


To write a c program to perform string manipulation function.

Software requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Declare the variables.

3. Get the string by using gets() function.

--- Content provided by FirstRanker.com ---


4. Call the required string manipulation function.

5. Display the results by using the puts() function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


14 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Enter string: String
Length of string = 6
Result :
Thus the program for string manipulation is executed successfully.
Outcome :

--- Content provided by FirstRanker.com ---

Thus the programs using strings- string function implementation is attained.

Applications:
? String are used in spell checker, spam filter, intrusion detection

--- Content provided by FirstRanker.com ---


1. What is a function ?
2. Mention the types of function.
3. What is a character ?
4. What is a string ?

--- Content provided by FirstRanker.com ---

5. Difference between character and string.
6. What are the different types of string handling functions are available.
7. Which header file is to be included while using the string functions.
8. How to declare a string and character.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




VIVA - VOCE

--- Content provided by FirstRanker.com ---



15 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

EXP NO 3 a : PROGRAMS USING POINTERS


Aim:

--- Content provided by FirstRanker.com ---

To write a c program to perform swapping operation using pointers.

Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. Declare the pointer variables.

3. Initialise the pointer variable with an appropriate address.

--- Content provided by FirstRanker.com ---

4. If the content of the address stored in the pointer is required, the indirection operator * is used to
obtain the value.

5. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

16 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

Before Swapping : A = 10 B = 20

After Swapping : A = 20 B = 10


--- Content provided by FirstRanker.com ---

Result :

Thus the program to swap two numbers using pointers is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

17 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


EXP NO 3 b : PROGRAMS USING STRUCTURES

--- Content provided by FirstRanker.com ---


Aim:

To write a c program using structures.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the structure and mention the structure variables inside the structure.

3. In the main program access the member of the structure using the dot operator.

4. Call the required functions inside the main function.

--- Content provided by FirstRanker.com ---


5. Display the output.

6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



18 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Sample Output :

Enter No. of Employees : 2

--- Content provided by FirstRanker.com ---


Enter Employee Details

Enter Employee Id : 436
Enter Employee Name :Gopal

--- Content provided by FirstRanker.com ---

Enter Basic Salary : 10000

Enter Employee Details

Enter Employee Id : 463

--- Content provided by FirstRanker.com ---

Enter Employee Name :Rajesh
Enter Basic Salary : 22000

XYZ & Co. Payroll

--- Content provided by FirstRanker.com ---

********************************************************************************

EmpId Name Basic HRA DA IT Gross Net Pay

********************************************************************************

--- Content provided by FirstRanker.com ---


436 Gopal 10000 200.00 100.00 500.00 10300.00 9800.00
463 Rajesh 22000 440.00 220.00 1100.00 22660.00 21560.00

********************************************************************************

--- Content provided by FirstRanker.com ---



Result :

Thus the program using structure is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the programs using structures and pointers is attained.

--- Content provided by FirstRanker.com ---

Applications:
? The C pointer are used to track read /write position in files in Linux/Unix OS.


1. What is meant by pointers?

--- Content provided by FirstRanker.com ---

2. What is meant by structure?
3. What is the advantage of structure?
4. What is meant by address operator?
VIVA - VOCE

--- Content provided by FirstRanker.com ---



19 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

5. What are the usages of pointers?
6. Why you need pointers in C?
7. What is meant by referencing operator?
8. What are the ways to declare the structure?
9. What is meant by structure operator and arrow operator?

--- Content provided by FirstRanker.com ---

10.How to pass function to pointers?




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



20 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---



Expt. No. 4 PROGRAMS INVOLVING DYNAMIC MEMORY
ALLOCATION

--- Content provided by FirstRanker.com ---

Aim:
To write a c program to perform dynamic memory allocation.
Software requirements:
C compiler
Hardware requirements:

--- Content provided by FirstRanker.com ---

Server with supporting 30 terminals

Algorthim:
1. Start the program.
2. Include the required header file for using the memory allocation function.

--- Content provided by FirstRanker.com ---

3. Declare the required variables for the program.
4. Cal the required Dynamic Memory Allocation function depending upon the program.
5. Display the result.
6. Stop the program.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




21 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :
Enter integer value: 100
Enter character value: x
Enter float value: 123.45

--- Content provided by FirstRanker.com ---

Inputted value are: 100, x, 123.45

Result:
Thus the program to perform dynamic memory allocation is executed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

Thus the programs involving dynamic memory allocations are attained.
Applications:
The memory allocation concepts are used in operating systems present in embedded
software .

--- Content provided by FirstRanker.com ---

1. What is memory allocation?
2. What is meant by dyanamic memory allocation?
3. Differentiate static memory allocation from dynamic memory allocation?
4. Give some examples for memory allocation?
5. What is the syntax for malloc()?

--- Content provided by FirstRanker.com ---

6. What is difference between malloc() and realloc()?
7. What is the function of calloc()?
8. What is meant by free() and what is the purpose of using free() fuction?
9.What is the significance of calloc()?
10.What is syntax for calloc()?

--- Content provided by FirstRanker.com ---

.




--- Content provided by FirstRanker.com ---



VIVA - VOCE


--- Content provided by FirstRanker.com ---


22 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 5 a ARRAY IMPLEMENTATION OF STACK

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of stack.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a
constant 'SIZE' with specific value.

--- Content provided by FirstRanker.com ---

3. Declare all the functions used in stack implementation.
4. Create a one dimensional array with fixed size (int stack[SIZE])
5. Define a integer variable 'top' and initialize with '-1'. (int top = -1)
6. In main method display menu with list of operations and make suitable function calls to
perform operation selected by the user on the stack.

--- Content provided by FirstRanker.com ---

PUSH OPERATION
1. Check whether stack is FULL. (top == SIZE-1)
2. If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate
the function.
3. If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value

--- Content provided by FirstRanker.com ---

(stack[top] = value).
POP OPERATION



--- Content provided by FirstRanker.com ---

23 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


1. Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and

--- Content provided by FirstRanker.com ---

terminate the function.
3. If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--)
DISPLAY
1.Check whether stack is EMPTY. (top == -1)
2. If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value
and decrement i value by one (i--).
4. Repeat above step until i value becomes '0'.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




24 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Sample Output :

STACK OPERATION

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 12

STACK OPERATION

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 23

--- Content provided by FirstRanker.com ---

STACK OPERATION

.PUSH 2.POP 3.VIEW 4.QUIT Enter Choice : 1

Enter Stack element : 34

--- Content provided by FirstRanker.com ---


STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW

--- Content provided by FirstRanker.com ---

Enter Choice : 1
Enter Stack element : 45
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 45 34 23 12
STACK OPERATION
4.QUIT

--- Content provided by FirstRanker.com ---


1.PUSH 2.POP 3.VIEW
Enter Choice : 2
Popped element is 45
STACK OPERATION

--- Content provided by FirstRanker.com ---

4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 3
Top--> 34 23 12

--- Content provided by FirstRanker.com ---

STACK OPERATION
4.QUIT

1.PUSH 2.POP 3.VIEW
Enter Choice : 4

--- Content provided by FirstRanker.com ---



Result :

Thus the program for array implementation of stack is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

25 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 5 b ARRAY IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform array implementation of queue.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Include all the header files which are used in the program and define a constant 'SIZE' with specific
value.

--- Content provided by FirstRanker.com ---

3. Declare all the user defined functions which are used in queue implementation.
4. Create a one dimensional array with above defined SIZE (int queue[SIZE])
5. Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1)
6. Then implement main method by displaying menu of operations list and make suitable function calls
to perform operation selected by the user on queue.

--- Content provided by FirstRanker.com ---



ENQUEUE OPERATION

1. Check whether queue is FULL. (rear == SIZE-1)

--- Content provided by FirstRanker.com ---

2. If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the
function.
3. If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value.


--- Content provided by FirstRanker.com ---


26 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


DEQUEUE OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the
function.
3. If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as
deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set

--- Content provided by FirstRanker.com ---

both front and rear to '-1' (front = rear = -1).
DISPLAY OPERATION
1. Check whether queue is EMPTY. (front == rear)
2. If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function.
3. If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'.

--- Content provided by FirstRanker.com ---

4. Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value is equal
to rear (i <= rear)



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



27 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 12

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 23

--- Content provided by FirstRanker.com ---

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Enter element to be inserted : 34

--- Content provided by FirstRanker.com ---


QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---

Enter element to be inserted : 45

QUEUE OPERATION

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

--- Content provided by FirstRanker.com ---


Enter element to be inserted : 56

QUEUE OPERATION

--- Content provided by FirstRanker.com ---

1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 1

Queue Full

QUEUE OPERATION

--- Content provided by FirstRanker.com ---


1.INSERT 2.DELETE 3.VIEW 4.QUIT Enter Choice : 3

Front--> 12 23 34 45 56 <--Rear

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




28 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Result :
Thus the program for array implementation of Queue is executed successfully.

Outcome:

--- Content provided by FirstRanker.com ---

Thus the program for array implementation of stack and queue is attained.



1. What is meant by data structure?

--- Content provided by FirstRanker.com ---

2. What are the types of data structure?
3. What is meant by stack?
4. What is meant by queue?
5. State the working principle of stack and queue?
6. What is difference between stack and queue?

--- Content provided by FirstRanker.com ---

7. What are the function of stack and queue?
8. What is the task of push and pop()?
9. Give some application of stack and queue?
10. What is stack overflow?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





VIVA - VOCE

--- Content provided by FirstRanker.com ---




29 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---


Expt. No. 6 a LINKED LIST IMPLEMENTATION OF
STACK

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linked List implementation of stack.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals


Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.
2. Include all the header files which are used in the program. And declare all the user defined
functions.
3. Define a 'Node' structure with two members data and next.

--- Content provided by FirstRanker.com ---

4. Define a Node pointer 'top' and set it to NULL.
5. Implement the main method by displaying Menu with list of operations and make suitable function
calls in the main method.
PUSH OPERATION
1. Create a newNode with given value.

--- Content provided by FirstRanker.com ---

2. Check whether stack is Empty (top == NULL)
3. If it is Empty, then set newNode ? next = NULL.
4. If it is Not Empty, then set newNode ? next = top.
5. Finally, set top = newNode.

--- Content provided by FirstRanker.com ---



30 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

POP OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the
function
3. If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'.

--- Content provided by FirstRanker.com ---

4. Then set 'top = top ? next'.
5. Finally, delete 'temp' (free(temp)).
DISPLAY OPERATION
1. Check whether stack is Empty (top == NULL).
2. If it is Empty, then display 'Stack is Empty!!!' and terminate the function.

--- Content provided by FirstRanker.com ---

3. If it is Not Empty, then define a Node pointer 'temp' and initialize with top.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the
first node in the stack (temp ? next != NULL).
5. Finally! Display 'temp ? data ---> NULL'.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





31 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Stack using Linked List

--- Content provided by FirstRanker.com ---


1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 23 New node added

--- Content provided by FirstRanker.com ---

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

Enter label for new node : 34

--- Content provided by FirstRanker.com ---


Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

--- Content provided by FirstRanker.com ---

HEAD -> 34 -> 23 -> NULL
Result :
Thus the program for Linked List implementation of Stack is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

32 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Expt. No. 6 b LINKED LIST IMPLEMENTATION OF QUEUE

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Linked List implementation of Queue.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware requirements:
Server with supporting 30 terminals


--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.

2. Include all the header files which are used in the program. And declare all the user defined functions.

--- Content provided by FirstRanker.com ---

3. Define a 'Node' structure with two members data and next.
4. Define two Node pointers 'front' and 'rear' and set both to NULL.
5. Implement the main method by displaying Menu of list of operations and make suitable function calls
in the main method to perform user selected operation.
enQueue OPERATION

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set 'newNode ? next' to NULL.
2. Check whether queue is Empty (rear == NULL)
3. If it is Empty then, set front = newNode and rear = newNode.
4. If it is Not Empty then, set rear ? next = newNode and rear = newNode.

--- Content provided by FirstRanker.com ---





33 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



dEQueue OPERATION
1. Check whether queue is Empty (front == NULL).
2. If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the

--- Content provided by FirstRanker.com ---

function
3. If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'.
4. Then set 'front = front ? next' and delete 'temp' (free(temp)).

DISPLAY OPERATION

--- Content provided by FirstRanker.com ---

1. Check whether queue is Empty (front == NULL).
2. If it is Empty then, display 'Queue is Empty!!!' and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with front.
4. Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to
'rear' (temp ? next != NULL).

--- Content provided by FirstRanker.com ---

5. Finally! Display 'temp ? data ---> NULL'.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


34 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output

--- Content provided by FirstRanker.com ---


Queue using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter label for new node : 23 New node added

Stack using Linked List

1->Push 2->Pop 3->View 4->Exit Enter your choice : 1

--- Content provided by FirstRanker.com ---


Enter label for new node : 34

Stack using Linked List

--- Content provided by FirstRanker.com ---

1->Push 2->Pop 3->View 4->Exit Enter your choice : 3

HEAD -> 34 -> 23 -> NULL


--- Content provided by FirstRanker.com ---


Result :

Thus the program for Linked List implementation of Queue is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for Linked List implementation of stack and queue is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Thread scheduler which maintains process in the memory .Linked list implementation is used
move running process in queue which is used thread scheduler.



--- Content provided by FirstRanker.com ---

1. What is the meant by linear data structure?
2. What is meant by linked list?
3. What is stack implementation of linked list?
4. What is meant by node?
5. What are the operations of stack in the linked list?

--- Content provided by FirstRanker.com ---

6. How to add the node and delete the node in the linked list using stack?
7. How to access the element from the stack in linked list?
8. What are the operations of queue using linked list?
9. How to allocate and deallocate the memory for linked list?
10. What is meant by singly linked list?

--- Content provided by FirstRanker.com ---

VIVA - VOCE



35 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 7 a APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform infix to postfix expression

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Read all the symbols one by one from left to right in the given Infix Expression.

--- Content provided by FirstRanker.com ---

3. If the reading symbol is operand, then directly print it to the result (Output).

4. If the reading symbol is left parenthesis '(', then Push it on to the Stack.

5. If the reading symbol is right parenthesis ')', then Pop all the contents of stack until respective left

--- Content provided by FirstRanker.com ---

parenthesis is poped and print each poped symbol to the result.

6. If the reading symbol is operator (+ , - , * , / etc.,), then Push it on to the Stack. However, first pop the
operators which are already on the stack that have higher or equal precedence than current operator
and print them to the result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


36 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

INFIX EXPRESSION : ( A + B ) * ( C - D )
POSTFIX EXPRESSION : A B + C D - *

--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing infix expression to postfix expression is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

37 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 7 b APPLICATION OF STACKS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform postfix to infix expression

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read all the symbols one by one from left to right in the given Postfix Expression

3. If the reading symbol is operand, then push it on to the Stack.

4. If the reading symbol is operator (+ , - , * , / etc.,), then perform TWO pop operations and store the

--- Content provided by FirstRanker.com ---

two popped oparands in two different variables (operand1 and operand2). Then perform reading
symbol operation using operand1 and operand2 and push result back on to the Stack.

5. Finally! perform a pop operation and display the popped value as final result.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


38 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

POSTFIX EXPRESSION : (5+3)*(8-2)

--- Content provided by FirstRanker.com ---

INFIX EXPRESSION : 53+82-*

Result :

Thus the program for performing postfix expression to infix expression is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the program for application of stack and queue is attained.

--- Content provided by FirstRanker.com ---

Applications:
? In high level programming language, the arithmetic expressions are calculated. The stacks are
used to convert the expression which is understood by the computer.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

1. What are the applications of stack?
2. What is meant by infix expression, Give example?
3. Give some real application of stack?
4. What is the procedure to evaluate the infix to postfix using stack?
5. Which data structure is needed to convert infix notation to postfix notation?

--- Content provided by FirstRanker.com ---

6. What is the result of Top (Push (S, X))?
7. Whether Linked List is linear or Non-linear data structure?
8. What is linked list?
9. List out the types of linked list.
10. What is circular linked list?

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

VIVA - VOCE



39 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 8 IMPLEMENTATION OF TREES, TREE
TRAVERSALS

--- Content provided by FirstRanker.com ---


Aim:

To write a C program for performing Binary Tree Traversal.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

PREORDER TRAVERSAL
2. Process the root node (N).
3. Traverse the left subtree of N (L).
4. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

INORDER TRAVERSAL
5. Traverse the left subtree of N (L).
6. Process the root node (N).
7. Traverse the right subtree of N (R).

--- Content provided by FirstRanker.com ---

POSTORDER TRAVERSAL
8. Traverse the left subtree of N (L).
9. Traverse the right subtree of N (R).
10. Process the root node (N).

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

40 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Sample Output :

--- Content provided by FirstRanker.com ---



In order traversal sequence : I - D - J - B - F - A - G - K - C - H

Post order traversal sequence : I - J - D - F - B - K - G - H - C - A

--- Content provided by FirstRanker.com ---


Pre order traversal sequence : A - B - D - I - J - F - C - G - K - H

Result :
Thus the program for performing binary tree traversal is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :
Thus the program for implementation of Trees, Tree Traversals is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Manipulate hierarchical data
? Manipulate sorted list of data
? As a workflow for computing digital image for visual effects


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

41 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 9 IMPLEMENTATION OF BINARY SEARCH

--- Content provided by FirstRanker.com ---

TREES

Aim:

To write a C program to performing Binary Search Tree Operations.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

Search Operation in BST
2. Read the search element from the user
3. Compare, the search element with the value of root node in the tree.
4. If both are matching, then display "Given node found!!!" and terminate the function
5. If both are not matching, then check whether search element is smaller or larger than that

--- Content provided by FirstRanker.com ---

node value.
6. If search element is smaller, then continue the search process in left subtree.
7. If search element is larger, then continue the search process in right subtree.
8. Repeat the same until we found exact element or we completed with a leaf node
9. If we reach to the node with search value, then display "Element is found" and terminate

--- Content provided by FirstRanker.com ---

the function.



42 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



10. If we reach to a leaf node and it is also not matching, then display "Element not found"
and terminate the function.
Insertion Operation in BST

--- Content provided by FirstRanker.com ---

1. Create a newNode with given value and set its left and right to NULL.
2. Check whether tree is Empty.
3. If the tree is Empty, then set set root to newNode.
4. If the tree is Not Empty, then check whether value of newNode is smaller or larger than
the node (here it is root node).

--- Content provided by FirstRanker.com ---

5. If newNode is smaller than or equal to the node, then move to its left child. If newNode
is larger than the node, then move to its right child.
6. Repeat the above step until we reach to a leaf node (e.i., reach to NULL).
7. After reaching a leaf node, then isert the newNode as left child if newNode is smaller or
equal to that leaf else insert it as right child.

--- Content provided by FirstRanker.com ---

Deletion Operation in BST
Case 1: Deleting a Leaf node (A node with no children)
Case 2: Deleting a node with one child
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

Case 1: Deleting a leaf node
1. Find the node to be deleted using search operation
2. Delete the node using free function (If it is a leaf) and terminate the function.


--- Content provided by FirstRanker.com ---


43 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Case 2: Deleting a node with one child
1. Find the node to be deleted using search operation
2. If it has only one child, then create a link between its parent and child nodes.
3. Delete the node using free function and terminate the function.
Case 3: Deleting a node with two children

--- Content provided by FirstRanker.com ---

1. Find the node to be deleted using search operation
2. If it has two children, then find the largest node in its left subtree (OR)
the smallest node in its right subtree.
3. Swap both deleting node and node which found in above step.
4. Then, check whether deleting node came to case 1 or case 2 else goto steps 2

--- Content provided by FirstRanker.com ---

5. If it comes to case 1, then delete using case 1 logic.
6. If it comes to case 2, then delete using case 2 logic.
7. Repeat the same process until node is deleted from the tree.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

44 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---



Sample Output :

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 6

Enter your choice : 1

--- Content provided by FirstRanker.com ---

Enter the node value : 1

Enter your choice : 1
Enter the node value : 5

--- Content provided by FirstRanker.com ---

Enter your choice : 1
Enter the node value : 2

Enter your choice : 1
Enter the node value : 4

--- Content provided by FirstRanker.com ---


Enter your choice : 1
Enter the node value : 3

Select an option

--- Content provided by FirstRanker.com ---

1- insert.
2- Search.
3- Delete.
4 ? Display.
5 - Exit

--- Content provided by FirstRanker.com ---


Enter your choice : 4
1
2
3

--- Content provided by FirstRanker.com ---

4
5
6


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

45 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00




--- Content provided by FirstRanker.com ---


Result :

Thus the program for performing Binary Search Tree Operations is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the program for implementation of Binary Search Trees is attained.

Applications:

--- Content provided by FirstRanker.com ---

? Used in search application where data is constantly entered and stored
? Binary search partition used in 3D video game.
? Binary tries ? Used in high bandwidth router for storing routing data.
? Syntax tree- Used for construction of compiler and calculator to parse expression

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





46 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Expt. No. 10 a IMPLEMENTATION OF LINEAR SEARCH

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Linear Search Operation.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---

Algorithm :

1. Start the program.
2. Read the search element from the user
3. Compare, the search element with the first element in the list.

--- Content provided by FirstRanker.com ---

4. If both are matching, then display "Given element found!!!" and terminate the function
5. If both are not matching, then compare search element with the next element in the list.
6. Repeat steps 3 and 4 until the search element is compared with the last element in the list.
7. If the last element in the list is also doesn't match, then display "Element not found!!!" and terminate
the function.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



47 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---


Sample Output :
Enter number of elements : 7
Enter Array Elements :

--- Content provided by FirstRanker.com ---

23 6 12 5 0 32 10
Enter element to locate : 5
Element found at position 3

Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform Linear search operation is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





48 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Expt. No. 10 b IMPLEMENTATION OF BINARY SEARCH


Aim:

--- Content provided by FirstRanker.com ---

To write a C program to perform Binary Search Operation.

Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Read the search element from the user
3. Find the middle element in the sorted list
4. Compare, the search element with the middle element in the sorted list.
5. If both are matching, then display "Given element found!!!" and terminate the function
6. If both are not matching, then check whether the search element is smaller or larger than middle

--- Content provided by FirstRanker.com ---

element.
7. If the search element is smaller than middle element, then repeat steps 2, 3, 4 and 5 for the left
sublist of the middle element.
8. If the search element is larger than middle element, then repeat steps 2, 3, 4 and 5 for the right
sublist of the middle element.

--- Content provided by FirstRanker.com ---

9. Repeat the same process until we find the search element in the list or until sublist contains only one
element.
10. If that element also doesn't match with the search element, then display "Element not found in the
list!!!" and terminate the function.

--- Content provided by FirstRanker.com ---





49 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---





Sample Output :

--- Content provided by FirstRanker.com ---

Enter array size : 10
Elements in Sorted Order

0 2 4 6 8 10 12 14 16 18
Enter element to locate : 16

--- Content provided by FirstRanker.com ---


Found at index 8 in 2 attempts

Result :
Thus the program to perform binary search operation is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :
Thus the implementation of Linear search and Binary search is attained.
Applications:
? Searching used in information retrieval.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

50 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



Expt. No. 11 a IMPLEMENTATION OF INSERTION SORT

--- Content provided by FirstRanker.com ---


Aim:

To write a C program to perform Insertion Sorting.

--- Content provided by FirstRanker.com ---

Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Asume that first element in the list is in sorted portion of the list and remaining all elements are in

--- Content provided by FirstRanker.com ---

unsorted portion.
3. Consider first element from the unsorted list and insert that element into the sorted list in order
specified.
4. Repeat the above process until all the elements from the unsorted list are moved into the sorted list.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




51 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Sample Output :
Enter total elements: 6

--- Content provided by FirstRanker.com ---


Enter array elements: 34 8 64 51 32 21

After Pass 1: 8 34 64 51 32 21
After Pass 2: 8 34 64 51 32 21

--- Content provided by FirstRanker.com ---

After Pass 3: 8 34 51 64 32 21
After Pass 4: 8 32 34 51 64 21
After Pass 5: 8 21 32 34 51 64
Sorted List : 8 21 32 34 51 64
Result :

--- Content provided by FirstRanker.com ---

Thus the program to perform insertion sort is executed successfully.




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---





52 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---




Expt. No. 11 b IMPLEMENTATION OF BUBBLE SORT

--- Content provided by FirstRanker.com ---

Aim:

To write a C program to perform Bubble Sorting.

Software Requirements:

--- Content provided by FirstRanker.com ---

C compiler
Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---


1. Start the program.

2. Set the size of the array and declare the variables.

--- Content provided by FirstRanker.com ---

3. Repeat the steps 4 ? 9 while i > 1

4. set j=0.

5. Repeat steps 6 ? 8 while j < i-1.

--- Content provided by FirstRanker.com ---


6. if arr[j] is greater than arr[j+1] goto step 7 else goto step 8.

7. Swap the elements stored at arr[j] and arr[j+1] and perform the operations.

--- Content provided by FirstRanker.com ---

8. set j=j + 1.

9. set i= i -1.

10. stop.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


53 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---


Sample Output :

Enter the number of elements in the array :
5

--- Content provided by FirstRanker.com ---


Enter the 5 elements to sort :
18
3
2

--- Content provided by FirstRanker.com ---

33
21

The sorted elements are :

--- Content provided by FirstRanker.com ---

2
3
18
21
33

--- Content provided by FirstRanker.com ---


Result :

Thus the program to perform bubble sort is executed successfully.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


54 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 c IMPLEMENTATION OF QUICK SORT

Aim:

To write a C program to perform Quick Sorting.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---



Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---


2. 1. If n < = 1, then return.

2. Pick any element V in a[]. This is called the pivot.

--- Content provided by FirstRanker.com ---

3. Rearrange elements of the array by moving all elements xi > V right of V and all elements xi < = V
left of V. If the place of the V after re-arrangement is j, all elements with value less than V, appear in
a[0], a[1] . . . . a[j ? 1] and all those with value greater than V appear in a[j + 1] . . . . a[n ? 1].

4. Apply quick sort recursively to a[0] . . . . a[j ? 1] and to a[j + 1] . . . . a[n ? 1].

--- Content provided by FirstRanker.com ---


5. Stop the program.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


55 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---



Sample Output :

Enter the number of elements in the array :

--- Content provided by FirstRanker.com ---

6

Enter the 6 elements to sort :
34
99

--- Content provided by FirstRanker.com ---

5
2
57
40

--- Content provided by FirstRanker.com ---

The sorted elements are :

2
5
34

--- Content provided by FirstRanker.com ---

40
57
99

Result :

--- Content provided by FirstRanker.com ---


Thus the program to perform Quick sort is executed successfully.



--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


56 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 11 d IMPLEMENTATION OF MERGE SORT

Aim:

To write a C program to perform Merge Sorting.

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.
2. Divide the unsorted list into N sublists, each containing 1 element.

--- Content provided by FirstRanker.com ---

3. Take adjacent pairs of two singleton lists and merge them to form a list of 2 elements. N will
now convert into N/2 lists of size 2.
4. Repeat the process till a single sorted list of obtained.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---



57 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

Sample Output :

Enter the number of elements in the array :
8

--- Content provided by FirstRanker.com ---

Enter the 6 elements to sort :
34
99
5
2

--- Content provided by FirstRanker.com ---

57
40
8
29

--- Content provided by FirstRanker.com ---

The sorted elements are :

2
5
8

--- Content provided by FirstRanker.com ---

29
34
40
57
99

--- Content provided by FirstRanker.com ---


Result :

Thus the program to perform Merge sort is executed successfully.

--- Content provided by FirstRanker.com ---

Outcome :

Thus the implementation of Insertion sort, Bubble sort, Quick sort, Merge sort is attained.


--- Content provided by FirstRanker.com ---

Applications:
? Merge sort ? Merge sort are used in external database.
? Bubble Sort-Used in programming for TV remote application
? Heap sort ?Used in reading bar codes in plastic cards
? Quick Sort ?Sports scores are organized by quick sort.

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---


58 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00



--- Content provided by FirstRanker.com ---

Expt. No. 12 a IMPLEMENTATION OF HASH FUNCTION

Aim:

To write a C program to perform Hash Functions.

--- Content provided by FirstRanker.com ---


Software Requirements:
C compiler
Hardware Requirements:
Server with supporting 30 terminals

--- Content provided by FirstRanker.com ---


Algorithm :

1. Start the program.

--- Content provided by FirstRanker.com ---

2. Declare the variables.
3. An element is converted into an integer by using a hash function. This element can be used as an
index to store the original element, which falls into the hash table.
4. The element is stored in the hash table where it can be quickly retrieved using hashed key.
hash = hashfunc(key)

--- Content provided by FirstRanker.com ---

index = hash % array_size




--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




59 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

Sample Output :

Enter the next key : 10765

The hash key generarted for the key 10765 is 765.

--- Content provided by FirstRanker.com ---


Result :
Thus the program to perform hash function is executed successfully.


--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---




60 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00

--- Content provided by FirstRanker.com ---



Expt. No. 12 a COLLISION RESOLUTION TECHNIQUES

Aim:

--- Content provided by FirstRanker.com ---


To write a C program to perform Linear probing.

Software Requirements:
C compiler

--- Content provided by FirstRanker.com ---

Hardware Requirements:
Server with supporting 30 terminals

Algorithm :

--- Content provided by FirstRanker.com ---

1. Start the program.

2. Create an array of structure (i.e a hash table).

3. Take a key and a value to be stored in hash table as input.

--- Content provided by FirstRanker.com ---


4. Corresponding to the key, an index will be generated i.e every key is stored in a particular array
index.

5. Using the generated index, access the data located in that array index.

--- Content provided by FirstRanker.com ---


6. In case of absence of data, create one and insert the data item (key and value) into it and increment
the size of hash table.

7. In case the data exists, probe through the subsequent elements (looping back if necessary) for free

--- Content provided by FirstRanker.com ---

space to insert new data item.
Note: This probing will continue until we reach the same element again (from where we began probing)

8. To display all the elements of hash table, element at each index is accessed (via for loop).

--- Content provided by FirstRanker.com ---

9. To remove a key from hash table, we will first calculate its index and delete it if key matches, else
probe through elements until we find key or an empty space where not a single data has been entered
(means data does not exist in the hash table).

10. Exit

--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---






--- Content provided by FirstRanker.com ---

61 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Sample Output :

--- Content provided by FirstRanker.com ---

MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

--- Content provided by FirstRanker.com ---


Please enter your choice-: 3
Size of Hashtable is-: 0

Do you want to continue-:(press 1 for yes) 1

--- Content provided by FirstRanker.com ---

Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable

--- Content provided by FirstRanker.com ---

4. Display Hashtable

Please enter your choice-: 1
Inserting element in Hashtable
Enter key and value-: 12 10

--- Content provided by FirstRanker.com ---


Key (12) has been inserted

Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing

--- Content provided by FirstRanker.com ---

MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

--- Content provided by FirstRanker.com ---


Please enter your choice-: 1
Inserting element in Hash table
Enter key and value-: 122 4

--- Content provided by FirstRanker.com ---

Key (122) has been inserted

Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing
MENU-:

--- Content provided by FirstRanker.com ---

1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

--- Content provided by FirstRanker.com ---

Please enter your choice-: 3
Size of Hashtable is-: 2



--- Content provided by FirstRanker.com ---


62 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


Do you want to continue-:(press 1 for yes) 1

--- Content provided by FirstRanker.com ---

Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable
2. Removing item from the Hashtable
3. Check the size of Hashtable

--- Content provided by FirstRanker.com ---

4. Display Hashtable

Please enter your choice-: 4
Array[0] has no elements

--- Content provided by FirstRanker.com ---

Array[1] has no elements

Array[2] has elements-:
12 (key) and 10 (value)

--- Content provided by FirstRanker.com ---

Array[3] has elements-:
122(key) and 5(value)

Array[4] has no elements

--- Content provided by FirstRanker.com ---

Array[5] has no elements

Array[6] has no elements

Array[7] has no elements

--- Content provided by FirstRanker.com ---


Array[8] has no elements

Array[9] has no elements

--- Content provided by FirstRanker.com ---


Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable

--- Content provided by FirstRanker.com ---

2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

Please enter your choice-: 2

--- Content provided by FirstRanker.com ---

Deleting in Hashtable
Enter the key to delete-: 122

Key (122) has been removed

--- Content provided by FirstRanker.com ---

Do you want to continue-:(press 1 for yes) 1
Implementation of Hash Table in C with Linear Probing
MENU-:
1. Inserting item in the Hashtable

--- Content provided by FirstRanker.com ---



63 Format No:FirstRanker/Stud/LM/34/Issue:00/Revision:00


--- Content provided by FirstRanker.com ---

2. Removing item from the Hashtable
3. Check the size of Hashtable
4. Display Hashtable

Please enter your choice-: 2

--- Content provided by FirstRanker.com ---

Deleting in Hashtable
Enter the key to delete-: 56

This key does not exist

--- Content provided by FirstRanker.com ---

Do you want to continue-:(press 1 for yes) 2

Result :

Thus the program to perform linear probing is executed successfully.

--- Content provided by FirstRanker.com ---


Outcome :

Thus the implementation of Hash functions, collision resolution techniques is initiated.

--- Content provided by FirstRanker.com ---


Applications:
? Constructs a message Authentication code
? Used to construct digital signature
? Used in message digest as a cryptographic function

--- Content provided by FirstRanker.com ---

? Time stamping



FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

This post was last modified on 13 December 2019