READ THIS PAGE COMPULSORY DONT SKIP

Dear Prof/Stud/Friend

                                  Thanks for all your valuable feedback.Really We are  working on your queries and requests.But currently second year to final year exam is going to commence as well as entrance exam is going on various states in India.So that we are working and preparing materials for them.All first year viewers please be patience for one week.We surely update the question banks as soon as possible.Sorry for the inconvenience.Please watch for portal and subscribe your mail id with us.

                                   Dont forget to mention your university name,regulation,state and country.   

                                  Upload your question banks if you have any materials and please contact us via contact form or live chat .Dont reply direct with direct mail because sometime there is few probability to consider your mail as SPAM....  

Here We are going to share some Engineering projects for your reference.

Once again thanks all visitors and contributors from various countries.

Note:Use our search Engine option in our web page to get your details

Uploaded by
Graham Watson

LATEST ENGINEERING PROJECTS AND TECHNOLOGY FOR ECE,EEE,CSE,IT,MECH,CIVIL,BIOMEDICAL

Contact us to get this file

We are not responsible for missing file its fully copyrighted graham watson from malasyia 

Read More

LATEST SOFTWARE ENGINEERING QUESTION BANKS/PAPERS CSE

Anna University Chennai Question Bank, anna university question bank for CSE, CSE, CSE FIFTH, QUESTION BANKS, QUESTION PAPERS, Software Engineering,

Today Dr Archana Raju Birth day

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

IIT NOTES

Software Engineering	Syllabus  click here to watch the  contents	Prof. N.L. Sarda Prof. Umesh Bellur Prof. Rushikesh K Joshi	IIT Bombay	Syllabus Course contents
Software Engineering	Web Syllabus Courseclcik here to watch the  contents	Prof. Rajib Mall	IIT Kharagpur	Syllabus Course contents

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

Read More

LATEST SOFTWARE ENGINEERING QUESTION BANKS/PAPERS CSE

Software Engineering, anna university question bank for CSE, CSE, CSE FIFTH, Anna University Chennai Question Bank, QUESTION BANKS, QUESTION PAPERS, 

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

UNIT 1-SOFTWARE PROCESS

Part A (2 marks)

1. What is software engineering?

2. What is Software?

3. Write out the reasons for the Failure of Water Fall Model.

4. What are the characteristics of the software?

5. Define the terms :

i. Agility

ii. Agile Team

6. What are the various categories of software?

7. What are the challenges in software?

8. Define software process

9. What are the fundamental activities of a software process?

10.What are the umbrella activities of a software process?

11.What are the merits of incremental model?

12.List the task regions in the Spiral model.

13.What are the drawbacks of spiral model?

14.What is System Engineering?

15.List the process maturity levels in SEIs CMM.

16.What is an effectors process?

17.Define the computer based system.

18.What does Verification represent?

19.What does Validation represent?

20.What is the difference between the “Known Risks” and Predictable

Risks”?

21.What are the steps followed in testing?

PART B

1. Explain iterative waterfall and spiral model for software life cycle and

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

CS1301 SOFTWARE ENGINEERING

2

various activities in each phase. (16)

2. Explain about the incremental model. (16)

3. Explain in detail about the software process. (16)

4. Explain in detail about the life cycle process. (16)

5. Explain Spiral model and win-win spiral model in detail? (16)

UNIT II-SOFTWARE REQUIREMENTS

PART A (2 marks)

1. What is the use of CMM?

2. Name the Evolutionary process Models.

3. What are the Objectives of Requirement Analysis?

4. What is requirement engineering?

5. What are the various types of traceability in software engineering?

6. Define software prototyping.

7. What are the Requirements Engineering Process Functions?

8. What are the benefits of prototyping?

9. What are the prototyping approaches in software process?

10.What are the Difficulties in Elicitation?

11.What are the advantages of evolutionary prototyping?

12.What are the various Rapid prototyping techniques?

13.What is the use of User Interface prototyping?

14.What is System Modeling?

15.What are the characteristics of SRS?

16.What are the objectives of Analysis modeling?

17.What is data modeling?

18.What is a data object?

19.What are attributes?

20.What is cardinality in data modeling?

21.What does modality in data modeling indicates?

22.What is ERD?

23.What is DFD?

24.What does Level0 DFD represent?

25.What is a state transition diagram?

26.Define Data Dictionary.

PART B

1. Explain in detail about Functional Modeling. (16)

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

CS1301 SOFTWARE ENGINEERING

3

2. Explain in detail about Structural Modeling. (16)

3. Explain in detail about data modeling. (16)

4. Explain about rapid prototyping techniques. (16)

5. Explain the prototyping approaches in software process. (16)

UNIT III-DESIGN CONCEPTS AND PRINCIPLES

PART A (2 marks)

1. What are the elements of Analysis model?

2. What are the elements of design model?

3. How the Architecture Design can be represented?

4. Define design process.

5. List the principles of a software design.

6. What is the benefit of modular design?

7. What is a cohesive module?

8. What are the different types of Cohesion?

9. What is coupling?

10.What are the various types of coupling?

11.What are the common activities in design process?

12.What are the benefits of horizontal partitioning?

13.What is vertical partitioning?

14.What are the advantages of vertical partitioning?

15.What are the various elements of data design?

16.List the guidelines for data design.

17.Name the commonly used architectural styles.

18.What is Transform mapping?

PART B

1. Explain in detail the design concepts. (16)

2. Explain the design principles. (16)

3. Explain the design steps of the transform mapping. (16)

4. Explain in detail about the real time systems. (16)

5. Explain in detail about SCM. (16)

UNIT IV-TESTING

PART A (2 marks)

1. What is a Real time system?

2. What is SCM?

3. What is SCI?

CS1301 SOFTWARE ENGINEERING

4

4. Define software testing?

5. Define Smoke Testing ?

6. What are the objectives of testing?

7. What are the testing principles the software engineer must apply while

performing the software testing?

8. Define White Box Testing?

9. What are the two levels of testing?

10.What are the various testing activities?

11.Write short note on black box testing.

12.What is equivalence partitioning?

13.What is Regression Testing?

14.What is a boundary value analysis?

15.What are the reasons behind to perform white box testing?

16.What is cyclomatic complexity?

17.How to compute the cyclomatic complexity?

18.Distinguish between verification and validation.

19.What are the various testing strategies for conventional software?

20.Write about drivers and stubs.

21.What are the approaches of integration testing?

22.What are the advantages and disadvantages of big-bang?

23.What are the benefits of smoke testing?

24.What are the conditions exists after performing validation testing?

25.Distinguish between alpha and beta testing.

26.What are the various types of system testing?

PART B

1. Explain the types of software testing. (16)

2. Explain in detail about Black box testing. (16)

3. Explain about the software testing strategies. (16)

4. Explain in detail about Integration testing. (16)

5. Explain in detail about system testing. (16)

UNIT V-SOFTWARE PROJECT MANAGEMENT

PART A (2 marks)

1. Define debugging.

2. What are the common approaches in debugging?

3. Write about the types of project plan.

4. Define measure.

5. Define metrics.

6. What are the types of metrics?

CS1301 SOFTWARE ENGINEERING

5

7. What are the advantages and disadvantages of size measure?

8. Write short note on the various estimation techniques.

9. What is the Objective of Formal Technical Reviews?

10.What is COCOMO model?

11.Give the procedure of the Delphi method.

12.What is the purpose of timeline chart?

13.What is EVA?

14.What are the metrics computed during error tracking activity?

15.Why software change occurs?

16.Write about software change strategies.

17.Define CASE Tools.

18.What is software maintenance?

19.Define maintenance.

20.What are the types of software maintenance?

21.What is architectural evolution?

22.How the CASE tools are classified?

23.What are the types of static testing tools?

Part B

1. Explain about software cost estimation. (16)

2. Explain in detail about COCOMO model. (16)

3. Explain in detail about Delphi Method. (16)

4. Explain in detail about software Maintenance. (16)

5. Explain about CASE tools. (16)

****************

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

Uploaded by Dr ARCHANA  RAJU

Read More

cse fifth semester question papers ans banks with solution free donload

ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE,Chennai

B E – COMPUTER SCIENCE AND ENGINEERING
Semester – V

Theory
080230017
Discrete Mathematics 3 1 0 4
080230018
PC Hardware and Trouble Shooting 3 0 0 3
080230019
Software Engineering 3 0 0 3
080230020
Formal Languages and Automata Theory 3 1 0 4
080230021
Java Programming 3 0 0 3
080230022
Computer Networks 3 0 0 3
Practical
080230023
Software Engineering Lab 0 0 3 2
080230024
Java Programming Lab 0 0 3 2
080230025
Computer Networks Lab 0 0 3 2

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

CS2301Software Engineering Question Bank :

• Software Engineering - Kings Question Ba nk - 2nd Edition
• Software Engineering - Rec College Question Bank - 1st Edition
• Software Engineering - 2011 Question Bank - 2nd Edition
• Software Engineering - 2011 Question Bank - 1st Edition
• Software Engineering - Question Bank 2011 Edition

MA2265 DiscreteMathematics Question Bank :

• Discrete Mathematics - Rec - Question Bank - 1st Edition
• Discrete Mathematics - Kings - Question Bank - 1st Edition

CS2302 ComputerNetworks Question Bank :

• COMPUTER NETWORKS - Question Bank - 2011 Edition
• Computer Networks REC - 16marks Question Bank - 1st Edition
• Computer Networks - Kings Question Bank - 1st Edition

CS2303 Theory of Computation Question Bank :

• Theory of Computation–Question Bank - Kings - 1st Edition comming soon
• Theory of Computation Question Bank 2011 Edition

CS2304 SystemSoftware Question Bank :

• System Software - Kings Question Bank - 1st Edition
• System Software - REC Question Bank - 1st Edition

CS2305 Programming Paradigms Question Bank :

• Programming Paradigms - REC Question Bank - 1st Edition

CSE FIFTH, anna university question bank for CSE, CSE, IT, IT FIFTH SEM, QUESTION BANKS, Software Engineering, MATHS, COMPUTER NETWORKS, computer science, Theory of communication, System Software, CS 2305 - PROGRAMMING PARADIGMS question Banks, PROGRAMS, LAB MANUALS, 

080230017 DISCRETE MATHEMATICS 

UNIT I PROPOSITIONAL CALCULUS 10 + 3
Propositions – Logical connectives – Compound propositions – Conditional and biconditional
propositions – Truth tables – Tautologies and contradictions – Contrapositive – Logical
equivalences and implications – DeMorgan’s Laws – Normal forms – Principal conjunctive and
disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.
UNIT II PREDICATE CALCULUS 9 + 3
Predicates – Statement function – Variables – Free and bound variables – Quantifiers –
Universe of discourse – Logical equivalences and implications for quantified statements
– Theory of inference – The rules of universal specification and generalization – Validity of
arguments.
UNIT III SET THEORY 10 + 3
Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and
Cartesian product – Relations on sets –Types of relations and their properties – Relational
matrix and the graph of relation – Partitions – Equivalence relations – Partial ordering – Poset –
Hasse diagram – Lattices and their properties – Sublattices – Boolean algebra –
Homomorphism.
UNIT IV FUNCTIONS 7 + 3
Definitions of functions – Classification of functions –Type of functions - Examples –
Composition of functions – Inverse functions – Binary and n-ary operations – Characteristic
function of a set – Hashing functions – Recursive functions – Permutation functions.
UNIT V GROUPS 9 + 3
Algebraic systems – Definitions – Examples – Properties – Semigroups – Monoids –
Homomorphism – Sub semigroups and Submonoids - Cosets and Lagrange’s theorem –
Normal subgroups – Normal algebraic system with two binary operations - Codes and group
codes – Basic notions of error correction - Error recovery in group codes.
TUTORIAL 15
TOTAL : 60
Text Book:
1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.
2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”,
Fourth Edition, Pearson Education Asia, Delhi, 2002.
References:
1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical
Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.
2. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Sixth Edition, Tata
McGraw – Hill Pub. Co. Ltd., New Delhi, 2006

Download Question banks 2m + 16 marks ppt seminar doc pdf 

click this Link 1 to download

Download Ebooks

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

080230018 PC HARDWARE AND TROUBLE SHOOTING

L T P M C

3 0 0 100 3

Unit – I Introduction 9
Introduction - Computer Organization – Number Systems and Codes – Memory – ALU – CU –
Instruction prefetch – Interrupts – I/O Techniques – Device Controllers - Error Detection
Techniques – Microprocessor – Personal Computer Concepts – Advanced System Concepts –
Microcomputer Concepts – OS – Multitasking and Multiprogramming – Virtual Memory – Cache
Memory – Modern PC and User.
Unit – II Peripheral Devices 9
Introduction – Keyboard – CRT Display Monitor – Printer – Magnetic Storage Devices – FDD –
HDD – Special Types of Disk Drives – Mouse and Trackball – Modem – Fax Modem – CD ROM
Drive – Scanner – Digital Camera – DVD – Special Peripherals.
Unit – III PC Hardware Overview 9
Introduction – Hardware BIOS DOS Interaction – The PC family – PC hardware – Inside the
System Box – Motherboard Logic – Memory Space – Peripheral Interfaces and Controllers –
Keyboard Interface – CRT Display interface – FDC – HDC.
Unit – IV Installation and Preventive Maintenance 9
Introduction – system configuration – pre installation planning – Installation practice – routine
checks – PC Assembling and integration – BIOS setup – Engineering versions and compatibility
– preventive maintenance – DOS – Virus – Data Recovery.
Unit – V Troubleshooting 9
Introduction – computer faults – Nature of faults – Types of faults – Diagnostic programs and
tools – Microprocessor and Firmware – Programmable LSI’s – Bus Faults – Faults Elimination
process – Systematic Troubleshooting – Symptoms observation and analysis – fault diagnosis –
fault rectification – Troubleshooting levels – FDD, HDD, CD ROM Problems.
Total : 45
Text Book:
1. B. Govindarajalu, “IBM PC Clones Hardware, Troubleshooting and Maintenance”, 2/E,
TMH, 2002. [
References:
1. Peter Abel, Niyaz Nizamuddin, “IMB PC Assembly Language and Programming”,
Pearson Education, 2007
2. Scott Mueller, “Repairing PC's”, PHI,1992

Download Question banks 2m + 16 marks ppt seminar doc pdf 

Download Ebooks

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

080230019 SOFTWARE ENGINEERING

L T P M C

3 0 0 100 3

UNIT I Introduction to Software Engineering 9

Introduction to Software Engineering - A systems Approach- An Engineering Approach-
Members of the Development Team- How Has Software Engineering changed?- Information
Systems Example- Real- Time Example
Modeling the process and Life cycle
The meaning of process –Software process Models- Tools and Techniques for Process
Modeling- Practical process modeling- Information system Example- Real- Time Example
Unit II 9
Planning and Managing the project
Tracking progress-project personnel-Effort Estimation-Risk Management-The project Plan-
Process Models and Project Management-Information System Example- Real Time Example
Capturing the Requirements
The Requirements Process- Requirements Elicitation-Types of Requirements-Characteristic of
Requirements- Modeling Notations- Requirements and Specification Languages-Prototyping
Requirements-requirements Documentation-Validation and Verification- Measuring
Requirements –choosing a specification Technique.
Unit III 9
Designing the System
Introduction to Design- decomposition and Modularity-Architectural styles and Strategies-
Issues in Design Creation-Characteristics of Good Design-Techniques of Improving Design-
Design Evaluation and Validation-Documenting the Design-Information system Example-Real-
Time Example
Considering objects
What is OO-the OO Development process –use cases- Representing OO:An Example using
UML-OO System Desing-OO Program Desingn-OO Measurement-Information systems
Example-Real-Time Example
Unit IV 9
Writing the programs
Programming standards and procedures-Programming Guidelines-Documentation-The
Programming process-Information systems Example-Real-Time Example
Testing the programs
Software faults and failures-Testing Issues-unit Testing Integration Testing-Testing Object-
Oriented Systems-Test Planning-Automated Testing Tools-When to stop Testing-Information’s
Systems Example-Real-Time Example
Unit V 9
Testing the Systems
Principles of system testing -function testing-performance Testing-Reliability, Availability and
Maintainability-Acceptance Testing-Installation Testing-Automated system Testing-Test
Documentation-Testing safety-Critical systems-Information systems Example.
Maintaining the system
The changing system-The nature of maintenance-Maintenance Problems-Measuring
Maintenance characteristics-Maintenance Techniques and Tools-Software Rejuvention-
Information Systems Example-Real-Time Example.
Total : 45
Text Book:
1. Software Engineering Theory and Practice, Shari Lwarence Pfleeger, Joanne
M.Atlee, Third Edition, Pearson Education, 2006
2. Object-Oriented Software Engineering Using UML, Patterns, and Java,Bernd
Bruegge,Allen H.Dutoit, Second Editon, Pearson Edition, 2006
3. Roger S. Pressman, Software Engineering- A Practitioners Approach, McGraw-Hill
International Edition, Seventh Edition, 2009

Download Question banks 2m + 16 marks ppt seminar doc pdf 

click this Link 1 for software engineering notes

Download Ebooks

080230020 FORMAL LANGUAGES AND AUTOMATA THEORY

L T P M C

3 1 0 100 4

UNIT I 9

Mathematical preliminaries and notations – Central concepts of automata theory – Finite
automata - Deterministic Finite Automata - Nondeterministic Finite Automata – Equivalence of
DFA and NFA – Finite Automata with Epsilon transitions - Application of FA.
UNIT II 9
Regular languages: Regular Expressions – Finite Automata and Regular Expressions –
Applications of Regular Expressions - Regular Grammars.
UNIT III 9
Properties of regular languages: Pumping lemma for regular languages – Closure properties of
regular languages – Decision properties of Regular languages - Equivalence and Minimization
of Finite Automata.
UNIT IV 9
Context Free languages: Context Free Grammars – Parse Trees - Ambiguity in Grammars and
languages – Applications of Context Free Grammars - Pushdown automata (PDA) – Languages
of a PDA - Equivalence of PDA’s and CFG’s
UNIT V 9
Properties of Context Free Languages: Normal Forms(CNF,GNF) for Context Free Grammars -
Pumping lemma for CFL’s - Closure properties of CFL – Decision properties of CFL’s.
Total : 45
Text Book:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, 3/E, Pearson Education, 2009.
2. Peter Linz, “An Introduction to formal Languages and Automata”, 4/ E, Jones &
Bartlett Pub, 2006.
References:
1. Kamala Krithivasan, Rama R, “Introduction to Formal Languages, Automata
Theory and Computation”, Pearson, 2009
2. Dr. B. N. Srinivasa Murthy, “Formal Languages and Automata Theory”, Sanguine
Publishers, 2006.

Download Question banks 2m + 16 marks ppt seminar doc pdf 

Download Ebooks

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

080230021 JAVA PROGRAMMING

L T P M C

3 0 0 100 3

UNIT I 8
A look at procedure oriented programming – Object oriented programming paradigm – Basic
concepts of object oriented programming – Benefits of OOP –What is java? - Simple java
program- Java vs. C++-Tokens – Keywords – Identifiers and constants –Data types – Type
Conversions and Casting - Arrays-Operators - Control statements in java. Class fundamentals –
Declaring Objects- Assigning Object Reference Variables – introducing methods- constructors –
this keyword- garbage Collection – finalize () method – overloading methods- objects as
parameters- returning objects- access control – static- final keyword- Nested classes – Inner
classes- classes with command line arguments
UNIT II 8
Basics- Super keyword- Multilevel Hierarchy- Invoking Constructors- Method overriding Abstract
Classes – Using Final with Inheritance- Packages- Access Protection – Importing a Packages-
Interfaces-Special String Operations – Character Extraction – String Comparison – Modifying a
String –String Buffer.
UNIT III 9
Exception Types – Uncaught Exceptions – Using Try Catch – Multiple Catch – Nested Try –
throw- throws- finally – Built in Exceptions- Using Exceptions- Thread Model – Character
Streams- Stream I/O- Serialization- Files
UNIT IV 10
Applet Architecture – Skeleton- Simple Applet Display Methods- HTML APPLET tag – Passing
Parameters to the Applet- AudioClip and AppletStub Interface - Delegation Event Model – Event
Classes. Collection Interfaces – Collection Classes – Using Iterator – Maps- Comparators-
Legacy Classes and Interfaces
UNIT V 10
String Tokenizer – BitSet – Calendar – Gregorian – TimeZone – Locale – Random- Currency-
Case studies – Real time application development- Debugging the application – Testing the
application.
TOTAL = 45
Text Book:
1. D.Norton and H. Schildt, “Java 2 the complete Reference Fifth edition”, TMH, 2002 (Re
print 2009)
References:
1. By Kathy Sierra, Bert Bates, “Head First Java”, Second Edition, O'Reilly Media,
2005
2. M.Deitel and Deitel, “Java How To Program” 7/e, Prentice Hall Publications.
3. Paul Deitel , Harvey M Deitel, Java for Programmers, Pearson, 2010.
4. Elliote Rusty Harold, “Java Network Programming” Third Edition, O’Reilly
Publishers.
5. “Java Cook Book”, Second Edition O’Reily Media 2002.

Download Question banks 2m + 16 marks ppt seminar doc pdf 

Download Ebooks

080230022 COMPUTER NETWORKS

L T P M C

3 0 0 100 3

Unit I 8
Uses of Computer Networks, Components, and Direction of Data flow, Networks Components
and Categories, types of Connections, Topologies, and Reference models: OSI and TCP/IP.
Multiple Access: Random Access, Controlled Access. LAN: Token Ring, FDDI, Ethernet- Fast
Ethernet, Gigabit Ethernet, Wireless LANs: IEEE 802.11 a/b/g/n
Unit II 8
Data Link Layer: Error Detection and Correction (Parity – LRC – CRC – Hamming code), Flow
Control and Error control protocols (stop and wait – go back-N ARQ – selective repeat ARQsliding
window), HDLC, Bridges: Spanning tree .
Unit III 9
Network Layer: IP addressing methods – Subnetting, Routing Algorithms: Shortest path
Algorithm, Flooding, Flow based routing, Distance vector routing, Link state routing, Hierarchical
routing.
Unit IV 10
Transport Layer: Duties of transport layer, Multiplexing and Demultiplexing, Sockets, UDP,
TCP. Congestion Control Techniques: Leaky bucket algorithm, Token bucket algorithm.
Congestion prevention Policies: Traffic shaping, Choke packets, Load Shedding, Jitter Control.
Application Layer: DNS, SMTP, FTP, HTTP.
Unit V 10
Introduction: Storage Area Network, Peer to Peer network, Overlay network, Wireless network:
Adhoc, Sensor network, optical Network.
Total: 45
Text Book:
1. Behrouz A. Forouzan, “Data Communications and Networks”, 4/E, Tata McGraw Hill
Publication, 2006.
2.
References:
1. William Stallings ,”Data & Computer Communications”, Sixth Edition,
Pearson Education Asia, 2002.
2. Andrew. S. Tanenbaum, “Computer Networks”, Forth edition,
Pearson Education, 2002.
3. Larry L. Peterson and Bruce S. Davie ,” Computer Networks: A systems
approach” , Third Edition, Morgan Kaufmann Publishers, 2003.

Download Question banks 2m + 16 marks ppt seminar doc pdf 

Click here to download

Download Ebooks

080230023 SOFTWARE ENGINEERING LAB

L T P M C

0 0 3 100 2

Solving Simple problems using CASE tools for Planning, cost estimation, Modeling the
requirements and configuration management
1. Payroll system (pay slip generation, detection and pay master report generation)
2. On line shopping ( Web based)
3. Banking system (with debit and credit ledger report creation)
4. Text editor
5. Online voting system
6. Library automation system (Flash message generation of new arrivals for all the users
via sms / mail alerts)

080230024 JAVA PROGRAMMING LAB

L T P M C

0 0 3 100 2

Solving Simple problems using,
1. Abstract classes
2. Inheritance
3. Interfaces
4. Event handling using applets
5. Threads(single and multiple)
6. Swings
7. File handling and I/O handling
8. Database applications (JDBC)

Contact us for Ebook  lab manual and question banks  subscribe your mail id to get more info

080230025 COMPUTER NETWORKS LAB

L T P M C

0 0 3 100 2

Implementing the following programs
1. Network topology configuration with hubs/ switches
2. Socket programming
3. Data grams
4. TCP
5. SMTP
6. FTP
7. Implementation of any two congestion control algorithms
8. Study of various IP Address classes practically(IPv4 , IPv6 dual stack configuration)

Read More

CS 2204 ANALOG AND DIGITAL COMMUNICATION/Principle

CS 2204 ANALOG AND DIGITAL COMMUNICATION /Principle

Third Semester Question banks two marks and 16 marks

CSE THIRD, anna university question bank for CSE, CSE,IT THIRD, IT,ANALOG AND DIGITAL COMMUNICATION , Anna University Chennai Question Bank, QUESTION BANKS, CSE THIRD, anna university question bank for CSE, CSE,IT THIRD, IT,ANALOG AND DIGITAL COMMUNICATION , Anna University Chennai Question Bank, QUESTION BANKS, CSE THIRD, anna university question bank for CSE, CSE,IT THIRD, IT,ANALOG AND DIGITAL COMMUNICATION , Anna University Chennai Question Bank, QUESTION BANKS, CSE THIRD, anna university question bank for CSE, CSE,IT THIRD, IT,ANALOG AND DIGITAL COMMUNICATION , Anna University Chennai Question Bank, QUESTION BANKS, 

click here to download 

2010 CS2204 subject notes.doc 3306K   View   Download

141304 ADC.doc 2289K   View   Download

Analog and Digital Communicaitons PPT.ppt 455K   View   Download

ADC EC.pdf 152K   View   Download

Contacts our team for more question papers

UPLOADED BY  www.keerthiworld.tk

Credit To :
Author Dr. Ganesan N Ph.D

Read More

GATE 2013 APPLICATION FORM AND QUESTION PAPERS FREE DOWNLOAD GATE 2013, Exam date, Syllabus, Preparation Tips for GATE 2013 Cracking

Dear All 

            This year Gate exam will  conduct with various new methodology and which might favor for students  especially for rural area people.Graduate Aptitude Test in Engineering (GATE) is an all India examination that primarily tests the comprehensive understanding of various undergraduate.

Cracking GATE 2013 - Preparation Tips for GATE 2013

GATE Exam Books for all Branches

GATE 2013|EXAM DATE|NOTIFICATION|APPLICATION FORM|

 

GATE 2013, Exam date, Syllabus, Coaching Center, study materials

 

 

 

TO DOWNLOAD GATE SYLLABUS : CLICK HERE

GATE Exam 2013 Syllabus for all Branches

GATE 2013 Important Dates:

Application Deadlines:

Commencement of online application:1st September 2012 (Saturday)

Last date for submission of online application: 30th September 2012 (Sunday)

Receipt of application with supporting documents at GATE office: 8th October 2012 (Monday)

Official Notification Poster: Click Here

GATE 2013 Information Brochure: Click Here

Dates of Examination :

Online: 20th January 2013 (Sunday)

Offline: 10th February 2013 (Sunday)

APPLICATION FEES:

General/OBC-NC (Male Applicants) -Rs. 1200/-

SC / ST / PD- (Male Applicants)-Rs.600/-

Female Applicants -Rs. 0 (Exempted)

PREVIOUS YEAR GATE QUESTION PAPERS: Click Here

To Apply Online : Click Here

Read More

Simple Way to learn Java Programing in two Days

Simple Way to learn Java Programing in two Days JAVA PROGRAMING SIMPLE STEPS TO DEVELOP APLLICATIONS ND CODING

What is a CLASS & OBJECT? 

How do you differentiate these two ? Explain with examples.

                   A class is a template, blueprint, plan,design or protype from wichObjects can be derived
               If you create an object from a class , it means you created an instance of a class.
 

 A SMALL EXAMPLE IN MY VIEW.....

                               Suppose if you are planning to construct a house first step what you will do ?  you will go for design or plan of it, Once plan is ready you will start actual construction.    By keeping this plan with you,   construct  one more house ,like wise you can construct any number of houses.   Now here this plan is a class ,and actual construction is object. this class doesn't occupy any memory only object occupies memory.  From one class we can create ‘N’ number of objects.

Few points on Structured programming and Object oriented programming?

                   DESIGNER OF PASCAL LANGUAGE NIKLAUS WIRTH ONCE SAID

     "ALGORITHMS+DATASTRUCTURES=PROGRAMS".

HERE ALGORITHM COMES FIRST AND DATA STRUCTURES COMES SECOND.THIS IS HOW PROGRAMMERS  WERE  THINKING AT THAT TIME .FIRST THEY DECIDED THE PROCEDURES FOR MANIPULATIONS  OF DATA, THEN THEY DECIDED WHAT STRUCTURE TO IMPOSE ON DATA TO MAKE MANIPULATIONS EASIER.OOP  REVERSES THE ORDER AND PUTS DATA FIRST, THEN LOOKS AT THE ALGORITHM THAT OPERATE ON THE DATA. FOR SMALL PROGRAMS PROCEDURES WORKS WELL, BUT OBJECTS ARE BETTER FOR LARGER PROGRAMS. DEBUGGING ALSO EASIER  WITH  OOP.

Goals of JAVA!

When Java was invented it has few goals in mind,

1.       It should be simple

2.       It should be Object-Oriented

3.       It should be “robust and secure”

4.       It should be “platform independent and portable”

5.       It should execute with high performance

6.       It should be “interpreted, threaded and Dynamic”

What is JAVA ?

JAVA IS A PROGRAMMING LANGUAGE.

AS A WHOLE  JAVA IS A PLATFORM, WITH LARGE LIBRARY, CONTAINING LOTS OF REUSABLE CODE, AND AN EXECUTION ENVIRONMENT THAT PROVIDE SERVICES SUCH AS SECURITY, PORTABILITY ACROSS SYSTEMS AND AUTOMATIC GARBAGE COLLECTION.

JAVA IS A HIGH QUALITY ENVIRONMENT AND LIBRARY.

History of JAVA

                       Actually Java was originally designed for programming consumer devices, but it was first succeful ly used to with internet applets.In the year 1991, when a group of SUN  engineers (which is now subsidiary  of oracle corporation) led by James Gosling,  Patrick Nauton, Mile Sheridon  wanted to design a small computer language that could be used for    consumer devices like, cable TV switch boxes, remote controller, Microwave oven. Because these devices do not have lot of memory the language had to be small and generate very tight code. Also, because different manufacturers may choose different CPUs, it was important that the language not be tied to as single architecture, the project was code-named “Green”.

Later it renamed as “OAK” after an oak tree that stood outside gosling’s office. Then it renamed as JAVA.

Versions history you can find in the wiki:-

http://en.wikipedia.org/wiki/Java_version_history

When API was growing it because difficult for SUN to Maintain. 


They divided it in to 3 parts

1. J2SE            2.J2EE               3.J2ME
and now it is called
 1.JSE             2.JEE                 3.JME

What is Programming?

                                   NOW A DAY COMPUTERS BECAME PART OF HUMAN LIFE .MANY PEOPLE USES IT FOR DIFFERENT PURPOSES LIKE PLAYING GAMES, BANKING TRANSACTIONS, AND FOR ONLINE PURCHASES. THESE COMPUTERS HAS NO INTELLIGENCE BY ITSELF, IT SIMPLY EXECUTES INSTRUCTIONS THAT HAVE BEEN PREPARED IN ADVANCE. IN ORDER TO ACHIEVE THIS FLEXIBILITY THE COMPUTERS MUST BE PROGRAMMED TO PERFORM EACH TASK, DIFFERENT TASKS REQUIRE DIFFERENT PROGRAMS. THESE PROGRAMS ARE SEQUENCE OF INSTRUCTIONS AND DECISION THAT COMPUTERS CARRYOUT TO ACHIEVE A TASK.  THE ART OF WRITING THESE KINDS OF PROGRAMS IS NOTHING BUT PROGRAMMING.   

  Simple Way to learn Java Programing in two Days


















STRINGS BASIC PROGRAM SERIES-1
































PROGRAM TO WRITE A REVERSE OF A STRING:-


 package com.javainchennai;

 import java.util.Scanner;

public class StringReverse {

    public static void main(String[] args) {



        Scanner sc=new Scanner(System.in);

        System.out.println("Enter a String");

        String str=sc.nextLine();

        int strLen=str.length();

        char c[]=new char[20];

        

        for(int i=0,j=strLen-1;i<strLen;i++,j--)

        {

            c[i]=str.charAt(j);

            System.out.print(c[i]);

        }    

    }

}





OUTPUT:-



Enter a String



madam123



321madam






STRING PALINDROME PROGRAM

package com.javainchennai;

import java.util.Scanner;

public class Stringpolindrome {

    public static void main(String[] args) {



    

    int i,j=0;

    Scanner sc=new Scanner(System.in);

    System.out.println("Enter your String:-");

    String str=sc.next();

    char c[]=new char[20];

    c=str.toCharArray();

    i=str.length();

    --i;

    while(j<=i)

    {

        if(c[i]!=c[j])

        {

            System.out.println("The given string "+ str +" is not polindrome");

            System.exit(0);    

        }

        ++j;

        --i;

        

    }

    System.out.println("The given string" + str +"is polindrome");

    }

}


OUTPUT-1 :








Enter your String:-



javainchennai



The given string javainchennai is not polindrome








OUTPUT-2 :








Enter your String:-



malayalam



The given string  malayalam is polindrome




































FINDING THE LENGTH OF A STRING




package com.javainchennai;

import java.util.Scanner;

public class StringLength {

    public static void main(String[] args) {

     Scanner sc=new Scanner(System.in);

     System.out.println("Please Enter your String:-");

     String str=sc.nextLine();

     char c[]=new char[10];

     

      c= str.toCharArray();

    int count=0;

    try{

     for( count=0;c[count] !='\0'; count++);

    }

     catch (ArrayIndexOutOfBoundsException e) {

       System.out.println(count);

     } 

      

    }


}





Please Enter your String:-



questionabanks



The Length of the Given String is: 13






































FINDING THE NUMBER OF WORDS IN A STRING






package com.javainchennai;

import java.util.Scanner;

public class NoOfWordsInAString {

    public static void main(String[] args) {

        Scanner sc=new Scanner(System.in);

        System.out.println("Enter your string:-");

        String str=sc.nextLine();

        int strLen=str.length();

        int word=1;

        for(int i=0;i<strLen-1;i++)

        {

            if((str.charAt(i))==' ')

            {

                word++;

            }    

        }

        System.out.print("The Number of words in the Given String are :" +word);

    }



}








OUTPUT:-








Enter your string:-



question banks



The Number of words in the Given String are :2




















--------------------------------------------------------------------------------------------------------------
























Before going into programs a small introduction on Strings




If there is any mistakes in this article please write me  blog4helping@gmail.com




======================

               -:STRINGS:-

======================

1.String is a class in Java

2.String means collection of characters

3.String is a sequence of characters enclosed in double Quotes.

4.Java Strings are sequence of Unicode characters 

5.String class produces Immutable objects.

6.String class does not have a methods that let you change a characters in an existing String.

7.It is like number 5 , the String "HELLO" we cannot change it.

    



Sting Objects can be created in 2 ways

       

           1. without using new operator

                         String str1="javainchennai";

       

           2. with using new operator 

                         String str2=new String("javainchennai");

                

  

The memory space is divided in to 2 parts 




                      1.constant area

                      2.non-constant area        

   

If you create object without using new operator this will be saved in constant area




                       String str1="javainchennai";

                  




If you create object with using new operator this will be saved in non-constant area

                        

                      String str2=new String("javainchennai");







Here Constant area will not allow duplicates

 where as non-constant area will allow duplicates. 










Do Remember inside a String class the toString() method is  overided 

   

    Here if you try to print reference variable

         

         String s1="javainchennai";




         System.out.println(s1);




         The output is javainchennai   instead of String@ff2201(classname @ hexadecimal value)







equals() method also overrided to check 2 objects based on the value(content) it contains




   

observe the program carefully and read the explanation:-










1.package com.qb;

2.public class StringTest {

3.    public static void main(String[] args) {




4.        String str1="javainchennai";

5.        String str2="javainchennai";

6.        String str3=new String("javainchennai");

7.        String str4=new String("javainchennai");




8.        System.out.println(str1==str2);

9.        System.out.println(str1==str3);

10.        System.out.println(str2==str3);

11.        System.out.println(str3==str4);




12.        System.out.println(str1.equals(str2));

13.        System.out.println(str1.equals(str3));

14.        System.out.println(str2.equals(str3));

15.        System.out.println(str3.equals(str4));

16.    }




17.   }




output:-

true

false

false

false

true

true

true

true




explanation:-




If you say 5==5 is true, here two are primitive literals so == operator(checks content) prints true.




If you use == operator to compare two object references it will see whether both references are pointing to same object or different.







If both references are pointing to same object it(== operator) returns true otherwise false.




observe line4 and line5 ,here actually I created String object without using new operator so, str1 and str2 both references are pointing to same object (javainchennai). (constant area will not allow duplicates)

so, str1==str2 returns true.







observe line4 and line5 ,here actually I created String object by using new operator so, str3 and str4 both references are pointing to different objects (javainchennai).(non constant area allows duplicates). 

So, str3==str4 returns false.







Observe the same effect with equals() method it returns true all time .(because it is overrided to compare based on content inside object)







PROGRAMS:-




program:-




1.public class StringTest {




2.    public static void main(String[] args) {




3.                            System.out.println(3+5);




4.                            System.out.println("3"+5);




5.                            System.out.println(3+"555");




6.                            System.out.println(3+2+5+"4444");




7.                            System.out.println("35"+111+"99");




8.                            System.out.println("42"+11+32+"77");




9.                            System.out.println("100"+"222");




   }




}




OUTPUT:-

8

35

3555

104444

3511199

42113277

100222







Explanation:-

-------------

In Java there is no operator overloading concept.




+ is the only one operator overloaded to add 2 integers as well as 2 strings




In the above example we added 2 primitives that is common ,




when we added String with any primitives only String object is produced.




observe the output of lines 6,7,8,9.














DIFFERENCES BETWEEN STRING , STRINGBUFFER AND STRINGBUILDER






String:-



------------------


1.String class introduced in jdk1.0

2.String class is a final class and implements Serializable,Comparable and CharSequence interfaces
3.String Objects can be created in two ways
    a.Using new operator

constructors to create String ob
    b.Without using new operator
4.-----
5. String class has several
 jects(both using new or without using new operator)
     a.String s1="";
     

that it represents an empty char
     b.String s2=new String("");
               Initializes a  String object so
 acter sequence.

     c.String s1="javainchenna";





resents the same sequence of characters as the argument    


    
5.String class has no append method.






6.There
        Initializes a  String object so that it re
p is no delete method to delete a characters from .

7.StringBuilder objects are Non-Synchronized.


------------------

StringBuffer:-    

------------------

StringBuffer and StringBuilder has the same methods:-
1.String class introduced in jdk1.0






lements Serializable and CharSequence interfaces









.StringBuffer Objects cannot  be cre



3
2.String class is a final class and im
pated without using  new operator
     StringBuffer s2="javainchennai";(wrong way)   
    





ffer("");








         Constructs a StringBuffer with no




4.use new operator to create objects of StringBuffer
         StringBuffer sb1=new StringB
u characters in it and an initial capacity of 16 characters.







g representation of the any type(primitive or derived) argument to the sequence.









.There is a delete method  to delete a characters from this 



6
5.StringBuffer class has append() method , It appends the stri
nobject.

7.StringBuffer objects are Synchronized.StringBuffer was being used by a single thread.

------------------

StringBuilder:-

------------------

.String class introduced in jdk1.5

1,





tring class is a final class and implements Serializable and CharSequence interfaces








3
2.
S.StringBuffer Objects cannot  be created without using  new operator





or to create objects of StringBuilder








         Strin




        StringBuilder s3="javainchennai";(wrong way)

4.use new opera
tgBuilder sb1=new StringBuilder();   





th no characters in it and an initial capacity of 16 characters.


    







ngBuilder class has appen



5.Str
i
         Constructs a StringBuilder w
id() method,It appends the string representation of the any type(primitive or derived) argument to the sequence.


d.
6. There is a delete method  to delete a characters from this object.

7.StringBuilder objects are Non-Synchroniz

e






















--------------------------------------------------------------------------------------------------------------


























FIND BIGGEST OF 3 NUMBERS:





import java.util.Scanner;



public class biggest



 {



            public static void main(String[] args)



{



                        System.out.println("Enter 3 numbers");



                        Scanner sc=new Scanner(System.in);



                        int a=sc.nextInt();



                        int b=sc.nextInt();



                        int c=sc.nextInt();



                        int max=a;



                        if(b>max)



                                    max=b;



                        if(c>max)



                                    max=c;



                        System.out.println("The biggest of 3 numbers:"+max);



                        }



}







Output:





Enter 3 numbers



65



98



43



The biggest of 3 numbers:98


















FIND GIVEN NUMBER IS ODD OR  EVEN:







import java.util.Scanner;



public class evenodd



{



            public static void main(String[] args)



{



                        System.out.println("Enter the number");



                        Scanner sc=new Scanner(System.in);



                        int num=sc.nextInt();



                        if(num/2==1)



                                                System.out.println("Number is ODD");



                        else



                                    System.out.println("Number is EVEN");



                                    }



}











Output:





Enter the number



88


Number is EVEN

















FIND GIVEN NUMBER IN PERFECT SQUARE OR NOT:







import java.util.Scanner;



public class perfectsquare



{



            public static void main(String[] args)



{



                        System.out.println("Enter a number");



                        Scanner sc=new Scanner(System.in);



                        int num=sc.nextInt();



                        double num1=Math.sqrt(num);



                        double num2=num1;



                        if(num1==num2)



                                    System.out.println(num + "is a perfect square");



                        else



                                    System.out.println(num + "is not a perfect square");



            }



}











Output:





Enter a number





100



100is a perfect square




















WRITE A PROGRAM TO FIND GIVEN NUMBER IS PALINDROME OR NOT





import java.util.Scanner;



public class PalindromeOfNumber



{



            public static void main (String[] args)



 {



                         int mod=0;



                         int c=0;



                         int d=0;



                         int num1=0;



                         System.out.println("Enter a number:");



                                    Scanner sc=new Scanner(System.in);



                                     int num=sc.nextInt();



                                    num1=num;



           while(num>0)



           {



               mod=num%10;



               c=c+mod;



               num=num/10;



               d=mod+d*10;



                          }



           if(num1==d)



           {   System.out.println("The given number "+num1+" is palindrome");



           }



           else



           {



               System.out.println("The given number "+num1+" is not palindrome");



           }



            }



}



OUTPUT:



RUN 1:





Enter a number:



1523



The given number 1523 is not palindrome






















WRITE A PROGRAM TO FIND GIVEN NUMBER IS PRIME OR NOT





import java.util.Scanner;



public class PrimeOrNot



{



            public static void main(String[] args)



{



    System.out.println("Enter the number:");



     Scanner sc=new Scanner(System.in);



     int i;



     int flag=0;



     long num=sc.nextLong();



     if(num<=3)



             System.out.println("The given number is prime:");



     else



              for(i=2;i<=num/2;i++)



                          if(num%i==0)



                          {



                                      flag=1;



                                      break;



                          }



                          else



                                      flag=0;



     if(flag==1)



             System.out.println("The given number "+num+"  is not prime");



     else



             System.out.println("The given number "+num+" is prime");



                        }



}





Output1:





Enter the number:



5



The given number 5 is prime





Output2:





Enter the number:



55



The given number 55  is not prime


















WRITE A PROGRAM TO DISPLAY MULTIPLICATION TABLE





import java.util.Scanner;



public class multiplicationtable



{



            public static void main(String[] args)



{



                        System.out.println("Enter the table number and the count value:");



                        Scanner sc=new Scanner(System.in);



                        int tnum=sc.nextInt();



                        int count=sc.nextInt();



                        System.out.println("The table is ...");



                        for(int i=1;i<=count;i++){



                        System.out.println(tnum+"*"+i+"=" + i*tnum);



                        }



            }



}







Output:



Enter the table number and the count value:



8



10



The table is ...



8*1=8



8*2=16



8*3=24



8*4=32



8*5=40



8*6=48



8*7=56



8*8=64



8*9=72



8*10=80




















WRITE A PROGRAM TO FIND COMMAND LINE NUMBER COUNT





public class CommandLineNumbersCount



 {



            public static void main(String[] args)



{



                  int l=args.length;



         System.out.println(l);



            }



 }





OUT PUT:



Java CommandLineNumbersCount 10 5 23 4 2



                5



            java CommandLineNumbersCount 21 3 36 4



               4






















WRITE A PROGRAM TO SORT THE DIGITS OF A NUMBER IN ASCENDING ORDER





import java.util.Scanner;



public class SortDigitsInInteger



{



            public static void main(String[] args)



{



                        Scanner sc=new Scanner(System.in);



                        System.out.println("Enter a number:-");



                        int num=sc.nextInt();



                        int a,i=0;



                        int sort[]=new int[10];



                while(num>0)



                {



                 a=num%10;



                 sort[i]=a;



                 i++;



                 num=num/10;



                }



                for(int j=0;j<i-1;j++)



                 for(int k=j+1;k<i;k++)



                 if(sort[j]>sort[k])



                 {



                         int temp=sort[j];



                         sort[j]=sort[k];



                         sort[k]=temp;



                 }



                System.out.println("The digits in number ascending order:");



                for(int j=0;j<i;j++)



                        System.out.print(sort[j]+" ");



            }



}







OUTPUT:



Enter a number:-



4261



The digits in number ascending order:



1 2 4 6
















WRITE A PROGRAM TO SORT A NUMBER IN ASCENDING ORDER





import java.util.Scanner;



public class SortNumbersInAscendingOrder



{



            public static void main(String[] args)



{



                        Scanner sc=new Scanner(System.in);



                        System.out.println("Enter Number of elements:-");



                            int limit=sc.nextInt();



                            System.out.println(" Enter Elements:- ");



                            int a[]=new int[10];



                            for(int  i=1;i<=limit;i++)



                            {  



                               a[i]=sc.nextInt();



                            }



                             for(int  i=0;i<limit-1;i++)



                                    for(int j=i;j<limit;j++)



                                                            if(a[i]>a[j])



                                                            {



                                                int        temp=a[i];



                                                            a[i]=a[j];



                                                            a[j]=temp;



                                  }



       System.out.println("The sorted list is:-");



        for( int i=0;i<limit;i++)



                      System.out.print("   "+a[i]);



            }



}





OUTPUT:



Enter Number of elements:-



5



 Enter Elements:-



15 25 16 12 4



The sorted list is:- 



  0   12   15   16   25




















-------------------------------------------------------------------------------------------------



























PROGRAMMING WITH RECURSION  






























 Fibonacci series



import java.util.Scanner;



public class FibonacciSeries



{



            public static void main(String[] args)



            {



                        int x=0,y=1;



                        Scanner sc=new Scanner(System.in);            



                        System.out.println("Enter a Number:-");    



                int z=sc.nextInt();



                System.out.println("The fibo series is:- ");



                fiboSeries(z,x,y);



            }



            private static void fiboSeries(int x,int f,int f1)



            {



                        if(x==0)



                            System.exit(0);



                        System.out.print("  " + (f+f1));



                        fiboSeries(--x,f1,f+f1);



            }



}









OUTPUT



Enter a Number:-



8





The fibo series is:-


  1  2  3  5  8  13  21  34








Enter a Number:-



10





The fibo series is:-



  1  2  3  5  8  13  21  34  55  89






  




















Tribonacci series 
















mport java.util.Scanner; 




i
















ublic class TribonacciSeries




p



{



            public static void main(String[] args)



            {



                        int x=-1,y=1,z=0;



                        Scanner sc=new Scanner(System.in);            



                        System.out.println("Enter a Number:-");    



                int n=sc.nextInt();



                System.out.println("The tribo series is:- ");



                triboSeries(n,z,x,y);



            }



            private static void triboSeries(int x,int f,int f1,int f2)



            {



                        if(x==0)



                            System.exit(0);



                        System.out.print("  " + (f+f1+f2));



                        triboSeries(--x,f1,f2,f+f1+f2);



            }



}









OUTPUT



Enter a Number:-



10





The tribo series is:-



  0  0  1  1  2  4  7  13  24  44







Enter a Number:-



8





The tribo series is:-



  0  0  1  1  2  4  7  13











 WRITE A PROGRAM TO FIND THE POWER OF THE NUMBER





import java.util.Scanner;



public class XpowN



{



            public static void main(String[] args)



{



                       



            Scanner sc=new Scanner(System.in);



            System.out.println("Enter the values of X and N:-");



            double x=sc.nextDouble();



            int n=sc.nextInt();



            System.out.println(power(x,n));         



            }



            private static double power(double x,int n)



            {



                        double pow=0;



                         pow= ((n==0)?1:x*power(x,n-1));



                       



                        return pow;



            }



}











OUTPUT







Enter the values of X and N:-



10



5





100000.0





Enter the values of X and N:-



5 2



25.0























--------------------------------------------------------------------------------------------------------------






















PROGRAM TO READ AN INTEGER AND REDUCE IT TO A SINGLE DIGIT



import java.util.Scanner;



public class DigitReduce



 {



            public static void main(String[] args)



{



                        Scanner sc=new Scanner(System.in);



                        System.out.println("Enter a Number:-");    



                long num=sc.nextLong();



                System.out.println(" " + calculateDigit(num));



            }



            private static long calculateDigit(long num)



{



                       



                        return (num/10 == 0 ? num : calculateDigit(num/10 + num % 10));



            }



}









OUTPUT



Enter a Number:-



4789



 1





Enter a Number:-



3348



 9
















WRITE A PROGRAM TO DISPLAY AMOUNT INTO 500’S,100’S,50’S,20’S,10’S,5’S,2’S,1’S IN A GIVEN NUMBER





import java.util.Scanner;



public class AmountCount



{



      public static void main(String[] args)



{



              System.out.println("Enter the amount in rupees:-");



              Scanner sc=new Scanner(System.in);



              int num=sc.nextInt();



              while(num>=500)



              {



                        int a=num/500;



                        System.out.print("\n The no .of five hundreds are:- "+ a);



                        break;



              }



              while(num>=100){



                          int a=num/100;



                        System.out.print("\n The no .of hundreds are :-"+ a);



                        break;



              }



              while(num>=50){



                          int a=num/50;



                        System.out.print("\n The no .of fiftie's are "+ a);



                        break; 



              }



              while(num>=20)



              {



                           int a=num/20;



                           System.out.print("\n The no .of twenty's are "+ a);



                           break;



              }



              while(num>=10){



                          int a=num/10;



                        System.out.print("\n The no .of ten's are "+ a);



                        break;



              }



              while(num>=5){



                          int a=num/5;



                        System.out.print("\n The no .of five's are "+ a);



                        break; 



              }



              while(num>=2){



                          int a=num/2;



                        System.out.print("\n The no .of two's are "+ a);



                        break;



           





  }



              while(num>=1)



              {



                          int a=num/1;



                        System.out.print("\n The no.of one's are"+ a);



                        break;



              }



              }



            }





OUTPUT:





Enter the amount in rupees:-



1854





 The no .of five hundreds are 3



 The no .of hundreds are 18



 The no .of fiftie's are 37



 The no .of twenty's are 92



 The no .of ten's are 185



 The no .of five's are 370



 The no .of two's are 927



 The no.of one's are1854


















WRITE A PROGRAM TO SORT A NUMBER IN ASCENDING ORDER












import java.util.Scanner;



public class SortNumbersInAscendingOrder



{



            public static void main(String[] args)



{



                        Scanner sc=new Scanner(System.in);



                        System.out.println("Enter Number of elements:-");



                            int limit=sc.nextInt();



                            System.out.println(" Enter Elements:- ");



                            int a[]=new int[10];



                            for(int  i=1;i<=limit;i++)



                            {  



                               a[i]=sc.nextInt();



                            }



                             for(int  i=0;i<limit-1;i++)



                                    for(int j=i;j<limit;j++)



                                                            if(a[i]>a[j])



                                                            {



                                                int        temp=a[i];



                                                            a[i]=a[j];



                                                            a[j]=temp;



                                  }



       System.out.println("The sorted list is:-");



        for( int i=0;i<limit;i++)



                      System.out.print("   "+a[i]);



            }



}





OUTPUT:



Enter Number of elements:-



5



 Enter Elements:-



15 25 16 12 4



The sorted list is:-



   0   12   15   16   25





















--------------------------------------------------------------------------------------------------------------

















WRITE A PROGRAM TO CONVERT INTEGER INTO IT’S EQUIVALENT NAME









import java.util.Scanner;



public class IntegerToItsEqualentName



{



            public static void main(String[] args)



{



                        Scanner sc=new Scanner(System.in);



                        System.out.println("Enter Number");



                 int num=sc.nextInt();



                 int m=0,c=0;



                 int a[]=new int[10];



                 while(num>0)



{



                         m=num%10;



                         a[c]=m;



                         num=num/10;



                         c++;



                 }



                for(int k=c-1;k>=0;k--)



{



                switch (a[k])



{



                case 0:System.out.print("ZERO ");



        break;



                        case 1:System.out.print("ONE ");



                                       break;



                case 2:System.out.print("TWO ");



                        break;



                case 3:System.out.print("THREE ");



                        break;



                case 4:System.out.print("FOUR ");



                        break;



                case 5:System.out.print("FIVE ");



                        break;



                case 6:System.out.print("SIX ");



                          break;



                case 7:System.out.print("SEVEN ");



                        break;



                case 8:System.out.print("EIGHT ");



                         break;



                case 9:System.out.print("NINE ");



                    









    break;



                        default:



                                    break;



                        }



}



                



            }



}





OUTPUT:








Enter Number



12069



ONE TWO ZERO SIX NINE




















PROGRAM FOR SWAPPING TWO NUMBERS USING THREE VARIABLES





import java.util.Scanner;



public class Output



{



            public static void main(String[] args)



{



                        System.out.println ("enter 2 numbers");



                        Scanner sc=new Scanner(System. in);



                        int num1 =sc.nextInt();



                        int num2 =sc.nextInt();



                        System.out.println("Before swapping");



                        System.out.println("num1:"+num1+"\n"+"num2:"+num2);



                        int temp=num1;



                           num1=num2;



                           num2=temp;



        System.out.println("After swapping");



        System.out.println("num1:"+num1+"\n"+"num2:"+num2);



            }



}





Output:





enter 2 numbers



55



65



Before swapping



num1:55



num2:65



After swapping



num1:65



num2:55
















PROGRAM FOR SWAPPING TWO NUMBERS WITHOUT USING THIRD VARIABLE





import java.util.Scanner;



public class swapping2



 {



public static void main(String args[])



            {                                                                                  



              System.out.println("Enter 2 numbers");



              Scanner sc=new Scanner(System.in);



              int num1=sc.nextInt();



              int num2=sc.nextInt();



              System.out.println("Before swapping");



              System.out.println("num1:"+num1+"\n"+"num2:"+num2);



                 num1=num1+num2;



                 num2=num1-num2;



                 num1=num1-num2;



              System.out.println("After swapping");



              System.out.println("num1:"+num1+"\n"+"num2:"+num2);



                          }



}





Output:





Enter 2 numbers



23



32



Before swapping



num1:23



num2:32



After swapping



num1:32



num2:23



   
















SWAPPING 2 NUMBERS WITHOUT USING ARITHMETIC OPERATORS





import java.util.Scanner;



public class arithmatic



 {



            public static void main(String[] args)



{



            System.out.println("Enter 2 numbers");



            Scanner sc=new Scanner(System.in);



              int num1=sc.nextInt();



              int num2=sc.nextInt();



              System.out.println("Before swapping");



              System.out.println("num1:"+num1+"\n"+"num2:"+num2);



                 num1=num1^num2;



                 num2=num1^num2;



                 num1=num1^num2;



              System.out.println("After swapping");



              System.out.println("num1:"+num1+"\n"+"num2:"+num2);



            }



}





Output:







Enter 2 numbers



19



91



Before swapping



num1:19



num2:91



After swapping



num1:91



num2:19
























--------------------------------------------------------------------------------------------------------------





















        WHETHER IT IS C , C++, C# OR JAVA , WORKING WITH THESE KIND OF PROGRAMS GIVES YOU LOT OF  FUN :-
 
 

















Write a program to display the following output


  


1 



2  2 



3  3  3 



4  4  4  4 



5  5  5  5  5 





import java.util.Scanner;



public class ForLoop1



{



            public static void main(String[] args)



               {



                           System.out.println("Enter the limit:-");



                           Scanner sc=new Scanner(System.in);



                           int limit=sc.nextInt();



                            for(int i=1;i<=limit;i++)



                                {



                                     for(int j=1;j<=i;j++)



                                        {



                                          System.out.print( i +"  ");



                                          }



                                         System.out.println();



                               }



                  }



}








Enter the limit:-



5





1 



2  2 



3  3  3 



4  4  4  4 



5  5  5  5  5 






















Write a program to display the following output 



1 



1  2 



1  2  3 



1  2  3  4 



1  2  3  4  5 





package com.vel.nestedforloop;



import java.util.Scanner;



public class ForLoop2



{



            public static void main(String[] args)



              {



                             System.out.println("Enter the limit:-");



                            Scanner sc=new Scanner(System.in);



                               int limit=sc.nextInt();



                              for(int i=1;i<=limit;i++)



                               {



                                 for(int j=1;j<=i;j++)



                                    {



                                      System.out.print( j +"  ");



                                     }



                                 System.out.println();



                               }



        }


}




Enter the limit:-



5







                                                                        1  



                                                                        1  2  



                                                                            1  2  3 



                                                                                     1  2  3  4  



                                                                                      1  2  3  4  5




























Write a program to display the following output








1 



2  3 



4  5  6 



7  8  9  10 



11  12  13  14  15 



16  17  18  19  20  21 







package com.vel.nestedforloop;



import java.util.Scanner;



public class ForLoop3



{



            public static void main(String[] args)



{



                           System.out.println("Enter the limit:-");



                           Scanner sc=new Scanner(System.in);



           int limit=sc.nextInt();



           int k=1;



           for(int i=1;i<=limit+1;i++)



{



               for(int j=1;j<=i;j++)



{



                           System.out.print( k++ +"  ");



               }



               System.out.println();



           }



            }



}







Enter the limit:-



5





1 



2  3 



4  5  6 



7  8  9  10 



11  12  13  14  15 



16  17  18  19  20  21 
















WRITE A PROGRAM TO DISPLAY THE FOLLOWING OUTPUT
 







3 2 1 0 1 2 3 






import java.util.Scanner;



public class LineFormat



{



            public static void main(String[] args)



{



                        int i,j,k;



                        System.out.println("Enter Limit:-");



                        Scanner sc= new Scanner(System.in);



                        int n=sc.nextInt();



                        k=n;



                        for(i=0;n>=i;i++,k--)



                                    System.out.print(" "+k);



                        k=1;



                        for(j=0;j<n;j++,k++)



                                    System.out.print(" "+k);



            }



}








OUTPUT



Enter Limit:-



3





 3 2 1 0 1 2 3




















Write a program to display the following output









  



  




 1



 1    1



 1    1    1









import java.util.Scanner;



public class NumberGenerator



{



public static void main(String[] args)



{



            int i,j;



            System.out.println("ENTER THE NUMBER TO BE DISPLAYED :-");



            Scanner sc=new Scanner(System.in);



            int a=sc.nextInt();



            System.out.println("ENTER THE SIZE :-");



            int n=sc.nextInt();



            for(i=0;i<n;i++)



            {



                        for(j=0;j<=i;j++)



                        System.out.print(" "+a);



                        System.out.println();



            }         



}





}





ENTER THE NUMBER TO BE DISPLAYED :-



1



ENTER THE SIZE :-



3





 1



 1    1



 1    1    1






  











WRITE A PROGRAM TO DISPLAY THE FOLLOWING OUTPUT





ENTER THE LIMIT:-



6





1



2 1



3 2 1



4 3 2 1



5 4 3 2 1





import java.util.Scanner;



public class GenerateNumber1



{



            public static void main(String[] args)



{



                        int i,j;



                        System.out.println( "ENTER THE LIMIT:-");



                        Scanner sc=new Scanner(System.in);



                        int n=sc.nextInt();



                        for(i=1;i<n;i++)



                        {



                                    for(j=i;j>0;j--)



                                    {



                                                System.out.print(j+" ");



                                    }



                                    System.out.println();



                        }



            }



}





OUTPUT







ENTER THE LIMIT:-



6





1



2 1



3 2 1



4 3 2 1



5 4 3 2 1





















Write a program to print the following output





1  0  0  0



0  2  0  0



0  0  3  0



0  0  0  4







import java.util.Scanner;



public class GenerateNumber1



{



            public static void main(String[] args)



{



                        int i,j,x=0;



                        System.out.println( "ENTER THE LIMIT:-");



                        Scanner sc=new Scanner(System.in);



                        int n=sc.nextInt();



                        for(i=1;i<=n;i++)



                        {



                                    for(j=1;j<=n;j++)



                                    {



                                                if(i==j)



                                                   System.out.print(i+" ");



                                                else



                                                            System.out.print(x +" ");



                                    }



                                    System.out.println();



                        }



            }



}




















Write a program to print the following output with the given character





ENTER THE CHARACTER TO BE DISPLAYED:-



7



ENTER THE LIMIT:-



4





7 7 7 7



7 7 7 7



7 7 7 7



7 7 7 7





import java.util.Scanner;



public class GenerateNumber1



{



            public static void main(String[] args)



{



                        int i,j,x=0;



                        Scanner sc=new Scanner(System.in);



                        System.out.println("ENTER THE CHARACTER TO BE DISPLAYED:-");



                   int  c=sc.nextInt();



                        System.out.println( "ENTER THE LIMIT:-");



                        int n=sc.nextInt();



                       



                        for(i=1;i<=n;i++)



                        {



                                    for(j=1;j<=n;j++)



                                    {



                                                   System.out.print(c+" ");



                                    }



                                    System.out.println();



                        }



            }


}















.Write a program to print the following output with the given character





ENTER THE CHARACTER TO BE DISPLAYED:-



8





ENTER THE LIMIT:-



4





8 8 8 8



8       8



8       8



8 8 8 8





import java.util.Scanner;



public class GenerateNumber1



{



            public static void main(String[] args)



{



                        int i,j,x=0;



                        Scanner sc=new Scanner(System.in);



                        System.out.println("ENTER THE CHARACTER TO BE DISPLAYED:-");



                   int  c=sc.nextInt();



                        System.out.println( "ENTER THE LIMIT:-");



                        int n=sc.nextInt();



                       



                        for(i=1;i<=n;i++)



                        {



                                    for(j=1;j<=n;j++)



                                    {   



                                          if(i==1||j==1||j==n||i==n)  



                                                   System.out.print(c+" ");



                                          else



                                                  System.out.print("  ");



                                    }



                                    System.out.println();



                        }



            }



}
















Program to read an integer and reduce it to a single digit





import java.util.Scanner;



public class DigitReduce



 {



            public static void main(String[] args)



{



                        Scanner sc=new Scanner(System.in);



                        System.out.println("Enter a Number:-");    



                long num=sc.nextLong();



                System.out.println(" " + calculateDigit(num));



            }



            private static long calculateDigit(long num)



{



                       



                        return (num/10 == 0 ? num : calculateDigit(num/10 + num % 10));



            }



}









OUTPUT



Enter a Number:-



4789



 1





Enter a Number:-



3348



 9

Read More