A Project Based Lab Report On AMUZING JOKE

1 | P a g e
Koneru Lakshmaiah Education Foundation
(Deemed to be University)
FRESHMAN ENGINEERING DEPARTMENT
A Project Based Lab Report
On AMAZING JOKE
SUBMITTED BY:
I.D NUMBER NAME
180060024 A.LAVANYA
180060025 M.SAI VAMSI MANOJ
180060020 SK.ASLAM
180060022 D.TIRUMALA TARUN
UNDER THE ESTEEMED GUIDANCE OF
A.SRINIVAS RAO
Assistant professor
KL UNIVERSITY
Green fields, Vaddeswaram – 522 502
Guntur Dt., AP, India.

2 | P a g e
DEPARTMENT OF BASIC ENGINEERING SCIENCES
CERTIFICATE
This is to certify that the project based laboratory report entitled
“AMUSING JOKE” submitted by Mr. D.TIRUMALA TARUN bearing
Regd. No. 180060022 to the PROBLEM SOLVING AND COMPUTER
PROGRAMMING , KL University in partial fulfillment of the requirements for the
completion of a project based Laboratory in “C PROGRAMMING & DATA
STRUCTURES LAB” course in I B Tech I Semester, is a bonafied record of the work
carried out by him under my supervision during the academic year 2018– 2019.
PROJECT SUPERVISOR HEAD OF THE DEPARTMENT
Dr.SOUMAYA RANJAN NAYAK Dr. L. SRIDHARA RAO

3 | P a g e
ACKNOWLEDGEMENTS
It is great pleasure for me to express my gratitude to our honorable President Sri.
Koneru Satyanarayana, for giving the opportunity and platform with facilities in
accomplishing the project based laboratory report.
I express the sincere gratitude to our principal Prof Dr. N.Venkataram for his
administration towards our academic growth. I express sincere gratitude to HOD-BES-1
Dr. L. SridharaRao for his leadership and constant motivation provided in successful
completion of our academic semester. I record it as my privilege to deeply thank for
providing us the efficient faculty and facilities to make our ideas into reality. I express my
sincere thanks to our project supervisor Dr.SOUMYA RANJAN NAYAK for his novel
association of ideas, encouragement, appreciation and intellectual zeal which motivated us
to venture this project successfully. Finally, it is pleased to acknowledge the indebtedness
to all those who devoted themselves directly or indirectly to make this project report
success
Names :D . TIRUMALA TARUN
Regd.No : 180060022

4 | P a g e
ABSTRACT
IN this program we understand that it was a hashing program So, the New Year holidays
are over. Santa Claus and his colleagues can take a rest and have guests at last. When two
"New Year and Christmas Men" meet, their assistants cut out of cardboard the letters from
the guest's name and the host's name in honour of this event. Then the hung the letters
above the main entrance. One night, when everyone went to bed, someone took all the
letters of our characters' names. Then he may have shuffled the letters and put them in one
pile in front of the door. The next morning it was impossible to find the culprit who had
made the disorder. But everybody wondered whether it is possible to restore the names of
the host and his guests from the letters lying at the door? That is, we need to verify that
there are no extra letters, and that nobody will need to cut more letters.Help the "New
Year and Christmas Men" and their friends to cope with this problem. You are given both
inscriptions that hung over the front door the previous night, and a pile of letters that were
found at the front door next

5 | P a g e
INDEX
S.NO TITLE PAGE NO
1 Introduction 6
2 Aim of the Project 11
2.1 Advantages & Disadvantages
2.2 Future Implementation
3 Software & Hardware Details 12
4 Data Flow Diagram 10
5 Algorithm for each module 11
6 Implementation 14
7 Integration and System Testing 16
8 Conclusion 17

6 | P a g e
INTRODUCTION
1. Unix was created in 1969 at Bell Laboratories which was, at the time, a research
and development division of AT&T.
2. Since that time, Unix has branched into many different commercial and open
source implementations.
3. Modern Unix-based systems are typically classified into one of the following
groups:
Unix Commercial implementations derived
from the original AT&T code base
BSD Open source operating system derived
from the original Unix code base
Linux Open source Unix compatible clone
written from scratch
4. In the 1970s, researchers at the University of California, Berkeley began
developing BSD (short for Berkeley Software Distribution).
5. BSD was originally based on the AT&T Unix codebase, but has been rewritten
over time to remove AT&T copyrighted code from the system (This allows BSD to
be distributed with minimal restrictions)
6. BSD code can also be found in proprietary operating systems created by
Microsoft, Apple, and Sun Microsystems.
7. Commercial Unix systems began to appear in the early 1980s. These systems
combined various amounts of Unix and BSD code along with vendor-specific
enhancements to create new platforms such as AIX, HP-UX, and Sun Solaris
(commercial Unix systems can be found in data centres at many large companies
running mission critical applications).
8. In 1991, a computer science student at the University of Helsinki in Finland
named Linus Torvalds created the Linux operating system.
9. While Linux shares much of the core concepts of Unix, it contains no Unix code.
This means it can be freely distributed in the same manner as BSD (although under
a different license).

7 | P a g e
10. The first commercial Linux distributions hit the market in the mid 1990s. Since
then hundreds of Linux variants have been developed.
for Loop:
The for loop is often the tool you will use when you want to create a loop.
The for loop has the following syntax:
for (statement 1; statement 2; statement 3) {
code block to be executed
}
Statement 1 is executed before the loop (the code block) starts.
Statement 2 defines the condition for running the loop (the code block).
Statement 3 is executed each time after the loop (the code block) has been
executed
Statement 1
Normally you will use statement 1 to initialize the variable used in the loop (i = 0).
This is not always the case, JavaScript doesn't care. Statement 1 is optional.
You can initiate many values in statement 1 (separated by comma):
Statement 2
Often statement 2 is used to evaluate the condition of the initial variable.
This is not always the case, JavaScript doesn't care. Statement 2 is also optional.
If statement 2 returns true, the loop will start over again, if it returns false, the loop
will end.
Statement 3
Often statement 3 increments the value of the initial variable.

8 | P a g e
This is not always the case, JavaScript doesn't care, and statement 3 is optional.
Statement 3 can do anything like negative increment (i--), positive increment (i = i
+ 15), or anything else.
Statement 3 can also be omitted (like when you increment your values inside the
loop):
If statement:
An if statement consists of a Boolean expression followed by one or more
statements.
Syntax
The syntax of an 'if' statement in C programming language is −
if(Boolean expression) {
/* statement(s) will execute if the Boolean expression is true */
}
If else
An if statement can be followed by an optional else statement, which executes when
the Boolean expression is false.
Syntax
The syntax of an if...else statement in C programming language is
if (Boolean expression)
/* statement(s) will execute if the Boolean expression is true */
}
else {
/* statement(s) will execute if the Boolean expression is false */
}

9 | P a g e
Printf
This function displays output with specified format.
It requires format conversion symbol or format string and variables names to the
print the data.
The list of variables are specified in the printf() statement.
The values of the variables are printed as the sequence mentioned in printf().
The format string symbol and variable name should be the same in number and
type.
syntax
printf(“control string”,variable1,variable2,.....,variableN);
The control string specifies the field format such as %d,%s,%g,%f and variables as
taken by the programmer.

10 | P a g e
AIM
To check the alphabets are in order wise are not it will take the help of a to z by using
arrays .so, we know that to print the given inputs of the project is combining the given
word it will print yes if it as not the given words are giving in input it will print no.
Advantages: -1.The main advantage of hash tables over other table data structures is
speed.
2. Hash tables are particularly efficient when the maximum number of entries can
be predicted in advance
Disadvantages:-1.Hash tables can be more difficult to implement than self-balancing binary
search trees.
2. In open-addressed hash tables it is fairly easy to create a poor hash function.
3. Hash tables become quite inefficient when there are many collisions.
Future enhancements: - 1.In universities, each student is assigned a unique roll number that can be
used to retrieve information about them.
2. In libraries, each book is assigned a unique number that can be used to
determine information about the book, such as its exact position in the library or the users it has been issued
to etc.
3. Easy to compute: It should be easy to compute and must not become an
algorithm in itself.
DATA FLOW DIAGRAM

12 | P a g e
SYSTEM REQUIREMENTS
 SOFTWARE REQUIREMENTS:
The major software requirements of the project are as follows:
Language : C LANGUAGE
Operating system: WINDOWSXP (OR )LATER
 HARDWARE REQUIREMENTS:
The hardware requirements that map towards the software are as follows:
RAM : 4 GB
Processor : intel Corei3

13 | P a g e
ALGORITHM
STEP 1 : Start
STEP 2 : Read arr
STEP 3 : store string length of arr into n
STEP 4 : hash the all arr elements into h array based the on key elements ascii value
subtracted by A
STEP 5 : read 2nd
string into arr
STEP 6 : store string length of arr into n1
STEP 7 : hash the all arr elements into h array based the on key elements ascii value
subtracted by A
STEP 8 : read 2nd
string into str
STEP 9 : store string length of into n2
STEP 10: hash the all arr elements into h1 array based the on key elements ascii value
subtracted by A
STEP 11: iterate both h and h1 arrays
STEP 12 : if corresponding index values not equal print “no”and exit program
if(h[j]==h1[j])
flag=1;
else
flag=0;
break;
end if
STEP13: if all indexes are having same values print “yes”
STEP 14: STOP.

14 | P a g e
IMPLEMENTATION
#include<stdio.h>
#include<string.h>
int main()
{
char arr[1000],str[1000];
int h[26]={0},i,j,n,h1[26]={0},n1,n2,flag;
scanf("%s",arr);
n=strlen(arr);
for(i=0;i<n;i++)
{
h[arr[i]-'A']++;
}
scanf("%s",arr);
n1=strlen(arr);
for(i=0;i<n1;i++)
{
h[arr[i]-'A']++;
}
scanf("%s",str);
n2=strlen(str);
for(j=0;j<n2;j++)
{
h1[str[j]-'A']++;
}
for(j=0;j<26;j++)
{

15 | P a g e
if(h[j]>=h1[j])
flag=1;
else
{
flag=0;
break;
}
}
if(flag==1)
printf("YES");
else
printf("NO");
return 0;
}

16 | P a g e
INTEGRATION AND SYSTEM
OUTPUTS
Screen Shots:
0

17 | P a g e
CONCLUSION
The amusing joke project is a hashing concept based program. Hash Table is a data
structure which stores data in an associative manner. In hash table, the data is stored in an array
format where each data value has its own unique index value. Access of data becomes very fast, if we
know the index of the desired data

A Project Based Lab Report On AMUZING JOKE

More Related Content

Similar to A Project Based Lab Report On AMUZING JOKE (20)

More from Daniel Wachtel (20)

Recently uploaded (20)

A Project Based Lab Report On AMUZING JOKE