Admin Welcomes U ANNA UNIVERSITY QUESTION BANKS PAPERS WITH SOLUTIONS: LECTURE NOTES

ANNA UNIVERSITY QUESTION BANKS PAPERS WITH SOLUTIONS

projectsCIVILEnvironmentalGeoinformaticsAeroAutomobileMarineProductionMaterial Science and ManufacturingMechatronicsIndustrialIndustrial and ManagementMech and AutomationiandControlBiomedicalMedical ElectronicsBioPolymerPlasticTextileFashion TechnologyPetroleumTextile ChemistryChemical and ElectrochemicalPetrochemical TechnologyFoodPharmaceuticalPetrochemicalB.Arch ExamTimetable


JOIN WITH US :)
  • Home
  • Business
    • Internet
    • Market
    • ICET MBA MCA Andhra Pradesh
  • ENTRANCE EXAMS
    • GATE
    • Entrance Exams
      • Engineering Entrance Exams
      • Medical Entrance Exams
      • MBA Entrance Exams
      • MCA Entrance Exams
      • UPSC
      • SSC
      • Law Entrance Exams
      • LIC Exams
      • Hotel Management Entrance Exams
      • Fashion Technology Entrance Exams
      • CA Entrance Exams
      • RRB (Railway Recruitment Board)
      • Bank Exams
      • Defence Services Exams
      • Foreign Education Exams
      • SPSC
      • Educational Exams
      • Other Exams
    • Common Entrance Tests
      • Maharashtra MAH MBA CET
      • Maharashtra MHT-CET
      • Karnataka CET
      • TANCET Tamilnadu
      • Karnataka CET
      • ICET MBA MCA Andhra Pradesh
      • EAMCET Andhra Pradesh
      • Punjab PTU CET
      • Punjab IP University IPUCET
      • Common Entrance Test (CET) - All
    • ALL INDIA ENTRANCE EXAMS
      • CAT - Common Admission Test (IIMs)
      • IIT JEE Joint Entrance Examination
      • MAT 2012 Management Aptitude Test (AIMA)
      • XAT - Xavier Admission Test
      • AIEEE All India Engineering Entrance Exam
      • AIPMT - All India Pre Medical Test
      • BITSAT - BITS Admission Test
      • All India Entrance Test - Complete List
    • State Entrance Tests
      • Delhi Engineering CEE
      • Kerala Common Entrance Exams (KEAM)
      • UPTU SEE Uttat Pradesh
      • Punjab PMET
      • Cochin University CUSAT
      • West Bengal JEE
      • Orissa Joint Entrance Exam JEE
      • Gujarat CET
      • State Entrance Test - All
    • Institute Entrance
      • IIT JEE - Indian Institute of technology
      • CAT for IIMs
      • JIPMER MBBS Entrance Test
      • AIIMS Entrance Exams
      • BITS Admission Test BITSAT
      • Vellore University VITEEE
      • Manipal University Online Entrance Test
      • Symbiosis SNAP Test
      • NIMCET NITs MCA Entrance Test
  • UNIVERSITY
    • Courses
      • Arts Courses
      • Architecture Courses
      • Engineering Courses
      • Medical Courses
      • Science Courses
      • Management Courses
      • Mass Communications Courses
      • Commerce Courses
      • Professional Courses
      • Information Technology Courses
      • Law Courses
      • Vocational Courses
      • Fashion and Interior Designing Courses
      • Civil Aviation Courses
      • Multimedia, Animation and Gaming Courses
    • Polytechnics or Diploma
    • UNDER CONSTRUTION
    • UNDER CONSTRUTION
  • QUESTION BANKS
  • Alerts
    • Admission Notices
    • Exams Results
    • Exam Notices
    • Recruitments
    • Scholarships
    • Announcements
  • Career Options
    • Career in Agriculture, Horticulture and Allied Services
    • Career in Animation, Multimedia and Web designing
    • Career in Arts, Entertainment and Media
    • Career in Banking, Insurance and Investment
    • Career in Basic & Applied Sciences
    • Career in Beauty Care & other Lifestyle
    • Career in Civil Aviation
    • Career in Computer Science and Information Technology
    • Career in Consultants and Counceling Services
    • Career in Defence and Paramilitary Services
    • Career in Designing
    • Career in Economics, Accounts and Finance Services
    • Career in Education and Library Science
    • Career in Engineering and Architectural Services
    • Career in Fashion and Modeling
    • Career in Forestry, Wild life and Animal Husbandry
    • Career in Hospitality and Tourism
    • Career in Journalism and Mass Communication
    • Career in Judicial, Law and Legal Services
    • Career in Management Services
    • Career in Medicine
    • Career in Merchant Navy
    • Career in Police, Law Enforcement and Investigative Services
    • Career in Secretarial & other Government Services
    • Career in Skilled and Semi-Skilled Labour Services
    • Career in Sports, Athletics and Physical fitness
    • Career in Surface Transport
  • TIME TABLE
  • RESULTS
  • TNEA
  • TANCET
  • PROJECTS
  • JOBS
  • HACKING
  • OTHERS
    • HOW TO
    • OTHERS

WELCOME TO GEEKERS UNIVERSITY OF STUDENT AND PROFESSORS OFFCIAL WEBSITE

THIS WEBSITE BELONGS TO STUDENTS AND PROFESSORS OF GEEKERS UNIVERSITY

GEEKERS UNIVERSITY DEPT

RESEARCH,MBBS,NURSING,ENGINEERING,ARTS AND SCIENCE,TECHNOLGY,DIPLOMA,PLUSTWO,TENTH STANDARD AND SCHOOLS :)

RESULTS

ALL RESULTS,EXAM DATES ,TIME TABLE,ETC

GEEKERS UNIVERSITY

PROJECTS,PAPER PRESENTATION SEMINARS,TUTORIALS,HOW TO,OTHERS,HACKING,MINI PROJECTS

GEEKERS UNIVERSITY---- GAMES

PUZZ,QUIZ,MEDIA,SPORTS,EBOOKS,TUTORIALS,FUN EXAMS,LEARNING,ONLINE TESTING YOUR MIND SPEED,CHATTING AND MUCH MORE


If any add appear like this please click skip add

Category

INFO

CLICK HERE
FOR LATEST RESULTS
LATEST NEW TIME TABLE/EXAM DATES FOR ALL LINK1 LINK2
ANNA UNIVERSITY COLLEGES RANK LIST 2012 CHECK SOON
LATEST FREE PLACEMENT PAPERS FOR ALL COMPANIES CHECK SOON
GET FREE MINI PROJECTS AND FINAL YEAR PROJECTS CLICK HERE
LATEST HOT HACKING TRICKS CLICK HERE

LATEST QUESTION BANKS /PAPERS/entrance FOR ALL EXAMS CLICK HERE link1 link2


RESUME TEMPLATES+RESUME DOWNLOAD FOR ALL COMPANIESCHECK SOON
LATEST CGPA CALCULATOR AND ENGINEERING CUTT OFF CALCULATOR CLICK HERE

Free Publishing of valuable information(s) in our website-


our sites
www.tricksnew.blogspot.com www.questionbank.tk
www.freeminiproject.blogspot.com and
www.onlineinfocity.
blogspot.com


NOTE:

FEEL FREE TO CONTACT US click on me
DONT FORGET TO SUBSCRIBE YOUR MAIL ID ----->>>TO GET DAILY question banks IN YOUR INBOX::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: SEE RIGHT SIDE CORNER
Showing posts with label LECTURE NOTES. Show all posts
Showing posts with label LECTURE NOTES. Show all posts

Sunday, October 14, 2012

Latest Data Structure Question Banks Lecture notes and Question papers huge collections free download IT 2201

7:39 AM  anna university question bank for CSE, CSE FIFTH, CSE THIRD, DATA STRUCTURES, ECE THIRD, IT, IT FIFTH SEM, IT THIRD, LECTURE NOTES, QUESTION BANKS, QUESTION PAPERS  No comments


 DATA STRUCTURES

Latest Data Structure Question Banks Lecture notes
 and Question papers huge collections free download IT 2201

anna university question bank for CSE, CSE THIRD,

 IT THIRD, IT, IT FIFTH SEM, CSE FIFTH, ECE THIRD, 

QUESTION BANKS, LECTURE NOTES, QUESTION PAPERS, 

DEPARTMENT OF INFORMATION TECHNOLOGY

ACADEMIC YEAR 2011- 2012 / ODD SEMESTER

QUESTION BANK

SUBJECT NAME : CS1201-DATA STRUCTURES

YEAR / SEM : II / III

UNIT- I

FUNDAMENTALS OF ALGORITHMS



Click here to Download more details contact us

PART – A

1. Define Data structure.

2. Give few examples for data structures.

3. Define Algorithm.

4. What are the features of an efficient algorithm?

5. List down any four applications of data structures.

6. What is Divide and Conquer?

7. State the importance of dynamic programming.

8. Define storage structure.

9. Define file structure.

10. What are the four major parts in an iterative process?

11. Write down the algorithm for solving Towers of Hanoi problem.

12. What are the different types of data structures?

13. What do you mean by primitive data structure?

14. What are the three stages of problem solving aspect?

15. Define depth of recursion.

16. What is searching?

17. What is linear search?

18. Define Space Complexity

19. Define Time Complexity

20. What are asymptotic notations?

21. What is information?

22. Define Recursion?

23. What is a Fibonacci sequence?

PART – B

1. Explain in detail the steps involved in Top down Design. (16)

2. Write the verification condition of a program segments with

a. Straight line statements (04)

b. Branches (06)

c. Loops (06)

3. Write short notes on efficiency of an algorithm (16)

4. Write short notes on analysis of an algorithm (16)

5. (a) Develop an algorithm to compute the sums for the first n terms

S=1+ (1/2) + (1/3) +…. (08)

(b) Discuss in detail about the implementation of the algorithm. (08)

6. (a) Write an algorithm to reverse the digits of a decimal number. (08)

(b) Write an algorithm to compute the Fibonacci series for ‘n’ terms. (08)

7. Explain Asymptotic Notation in detail. (16)



Click here to Download more details contact us

UNIT-II

FUNDAMENTALS OF DATA STRUCTURES

PART – A

1. What is an Abstract Data type (ADT)? Explain.

2. What is a Stack?

3. What are the two operations of Stack?

4. Write postfix form of the expression –A+B-C+D?

5. What is a Queue?

6. What is a Priority Queue?

7. What are the different ways to implement list?

8. What are the advantages in the array implementation of list?

9. What is a linked list?

10. Name the two fields of Linked list?

11. What is a doubly linked list?

12. Name the three fields of Doubly Linked list.

13. Define double circularly linked list.

14. What is the need for the header?

15. List three examples that uses linked list.

16. Give some examples for linear data structures.

17. Write postfix from of the expression –A+B-C+D.

18. How do you test for an empty queue?

19. What are the postfix and prefix forms of the expression?

20. Explain the usage of stack in recursive algorithm implementation.

21. Write down the operations that can be done with queue data structure.

22. What is a circular queue?

PART – B

1. Write a program in C to return the position of an element X in a List L. (16)

2. (a) State and explain the algorithm to perform Radix Sort. (08)

(b) Write a Program in C to create an empty stack and to push an element into it. (08)

3. Explain how queues can be implemented using Arrays (16)

4. (a) Write a ‘c’ program to multiply two polynomials. (08)

(b) Write a ‘c’ program to add two polynomials. (08)

5. (a) Write an algorithm to convert infix to postfix expression and explain it with

example. (08)

(b) Write an algorithm to evaluate a postfix expression and explain it with example.

(08)

6. (a) Write an algorithm to check given expression contains balanced parenthesis or

not. (08)

(b) Write an algorithm for insertion and deletion operation in a circular queue. (08)

7. Define Queue and briefly explain its various operations. (16)

8. Explain doubly linked list in detail. (16)

9. Compare and contrast the different features of various linked lists. (16)

10. Explain stack in detail. (16)

UNIT III

TREES

PART – A

1. Define non-linear data structure.

2. Define tree.

3. Define leaf.

4. What is meant by directed tree?

5. What is an ordered tree?

6. What is a Binary tree?

7. What are the applications of binary tree?

8. What is meant by traversing?

9. What are the different types of traversing?

10. What are the two methods of binary tree implementation?

11. Define pre-order traversal.

12. Define post-order traversal.

13. Define in-order traversal.

14. What is the length of the path in a tree?

15. Define expression trees.

16. Define strictly binary tree.

17. Define complete binary tree.

18. What is an almost complete binary tree?

19. Define AVL Tree.

20. Define collision resolution.

PART – B

1. (a) Construct an expression tree for the expression A+(B-C)*D+(E*F). (08)

(b) Write a function to delete the minimum element from a binary heap. (08)

2. Write a program in C to create an empty binary search tree & search for an element

X in it. (16)

3. Explain in detail about Open Addressing. (16)

4. Explain in detail insertion into AVL Trees. (16)

5. Write a recursive algorithm for binary tree traversal with an example. (16)

6. Write an algorithm for initializing the hash table and insertion in a separate

Chaining (16)

7. State & explain the algorithm to perform Heap sort. Also analyze the time complexity

of the algorithm (16)

8. Write a C program to perform Merge sort and analyze time complexity of the

algorithm. (16)

9. State & explain the algorithm to perform Quick sort. Also analyze the time complexity

of the algorithm. (16)

10. State & explain the algorithm to perform Shell sort. Also analyze the time complexity

of the algorithm. (16)

11. Explain Huffman Algorithm with an example. (16)

12. Discuss about Hashing in detail. (16)


Click here to Download more details contact us

UNIT-IV

GRAPHS AND THEIR APPLICATIONS

PART – A

1. Define Graph.

2. Define adjacent nodes.

3. What is a directed graph?

4. What is an undirected graph?

5. What is a loop?

6. What is a simple graph?

7. What is a weighted graph?

8. Define out degree of a graph.

9. Define in degree of a graph.

10. Define path in a graph.

11. What is a simple path?

12. What is a cycle or a circuit?

13. What is an acyclic graph?

14. What is meant by strongly connected in a graph?

15. When is a graph said to be weakly connected?

16. What is meant by sorting?

17. What are the two main classifications of sorting based on the source of data?

18. What is meant by external sorting?

19. What is meant by internal sorting?

20. What are the various factors to be considered in deciding a sorting algorithm?

21. What is the main idea behind insertion sort?

22. What is the main idea behind selection sort?

23. What is the basic idea of shell sort?

24. What is the other name for shell sort?

25. What is the purpose of quick sort?

PART – B

1. Formulate an algorithm to find the shortest path using Dijkstra’s algorithm and explain

with example. (16)

2. Explain the minimum spanning tree algorithms with an example. (16)

3. (a) Write short notes on Biconnectivity. (08)

(b) Write an algorithm for Topological Sort of a graph. (08)

4. Write and explain weighted and unweighted shortest path algorithm. (16)

5. Explain the various applications of Depth First Search. (16)

6. Explain warshall’s algorithm in detail. (16)

7. Explain kruskal’s algorithm in detail. (16)

8. Explain prim’s algorithm in detail. (16)

UNIT-V

STOARAGE MANAGEMENT

PART-A

1. Mention the types of automatic list management?

2. What do you meant by reference count method?

3. What is Garbage collection?

4. What is compaction?

5. Give the purpose of list management.

6. What are the disadvantages of reference count method?

7. What are the phases of garbage collection?

8. What do you mean by thrashing?

9. What are the types of pointers?

10. What are methods of implementing add on and tail operations in linked list?

11. Define first fit.

12. Define best fit.

13. Define worst fit.

14. What is internal and external fragmentation?

15. What are the types of buddy system?

PART – B

1. Explain the linked list representation of a list with an example. (16)

2. Explain reference count method with an example. (16)

3. Explain garbage collection with their variations. (16)

4. Explain the dynamic memory management with necessary methods. (16)

5. Write about operations in linked linear lists. (16)

6. Explain collection and compaction in detail. (16)


Click here to Download more details contact us



Read More

Tuesday, October 2, 2012

CS 2204 ANALOG AND DIGITAL COMMUNICATION/Principle

1:19 AM  ANALOG AND DIGITAL COMMUNICATION, Anna University Chennai Question Bank, anna university question bank for CSE, CSE, CSE THIRD, IT, IT THIRD, LECTURE NOTES, QUESTION BANKS  1 comment


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.doc2010 CS2204 subject notes.doc
3306K   View   Download  
141304 ADC.doc141304 ADC.doc
2289K   View   Download  
Analog and Digital Communicaitons PPT.pptAnalog and Digital Communicaitons PPT.ppt
455K   View   Download  

ADC EC.pdfADC 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

Monday, October 1, 2012

New ECE Third Semester Question Banks with solutions updated

6:41 AM  ANNA UNIVERSITY QUESTION BANKS FOR ECE, ECE, ECE THIRD, LECTURE NOTES, QUESTION BANKS  No comments


Anna University
Department of Electronic and Communication Engineering
EC 2201 — ELECTRICAL ENGINEERING. ... PART A — (10 × 2 = 20marks)
Semester : 3
Year : 2
Department : B.E ECE

EC 2201 Electrical Engineering Question Bank by A.R Engineering College - 1st Edition.






EC 2201
 — ELECTRICAL ENGINEERING

EC2201 Electrical Engineering - Question Bank

ECE Electrical Engineering Two Marks Question & Answers

EC 2201-ELECTRICAL ENGINEERING QUESTION BANK 




Sample questions


Click here to download



Uploaded By Alexander







s


Search Results

Read More

Saturday, September 29, 2012

ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING Lecture Notes free download

5:52 AM  anna university question bank for CSE, CSE SEVENTH, ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING, IT, IT FIFTH SEM, LECTURE NOTES, QUESTION BANKS  No comments

MG2452 ENGINEERING

 ECONOMICS AND 

FINANCIAL 

ACCOUNTING Lecture Notes for IT - Fifth (5th) 

semester

MG2452 Lecture Notes two marks and 16 marks free download


Syllabus :


UNIT I INTRODUCTION
Managerial Economics - Relationship with other disciplines - Firms: Types, objectives
and goals - Managerial decisions - Decision analysis.


UNIT II DEMAND & SUPPLY ANALYSIS


Demand - Types of demand - Determinants of demand - Demand function - Demand
elasticity - Demand forecasting - Supply - Determinants of supply - Supply function -
Supply elasticity.


UNIT III PRODUCTION AND COST ANALYSIS


Production function - Returns to scale - Production optimization - Least cost input -
Isoquants - Managerial uses of production function.
Cost Concepts - Cost function - Determinants of cost - Short run and Long run cost
curves - Cost Output Decision - Estimation of Cost.


UNIT IV PRICING


Determinants of Price - Pricing under different objectives and different market structures
- Price discrimination - Pricing methods in practice.


UNIT V FINANCIAL ACCOUNTING (ELEMENTARY TREATMENT)


Balance sheet and related concepts - Profit & Loss Statement and related concepts - -
Financial Ratio Analysis - Cash flow analysis - Funds flow analysis - Comparative
financial statements - Analysis & Interpretation of financial statements.


UNIT VI CAPITAL BUDGETING. (ELEMENTARY TREATMENT)


Investments - Risks and return evaluation of investment decision - Average rate of return
- Payback Period - Net Present Value - Internal rate of return.


UNIT –I

ECONOMICS
Economics is the study of how societies use scarce resources to produce valuable commodities and
distribute them among different people.
SCOPE OF ECONOMICS
1. Consumption: Satisfaction of human wants is called consumption which forms one of the
important branches of economics. This tells how people behave in consumption of goods and
services in order to maximize their satisfaction.
2. Production: Goods and services have to be produced with the help of factors of production. So,
production is another branch of economics. It concerned with how maximum goods are produced
with minimum cost or how the scarce factors could be utilized economically for better results.
3. Exchange: Goods and services cannot be produced at one place or at one point of time. Goods
produced by one are exchanged for the goods produced by the others. So, exchange forms another
branch of study in economics.
4. Distribution: Goods and services are produced with efforts, i.e., by combining the factors of
production. These efforts have to be paid for or rewarded. The land gets rent, the labor get wages,
the capital gets interest and the organizer gets profit. This branch of study is called distribution in
economics.
5. Public Finance: This branch of study in economics studies about the sources of revenue to the
government and the principles governing the expenditure for the benefit of the people. It also studies
about public debt and financial administration.
ECONOMICS IS A SCIENCE OR AN ART
Economics as a Science: A science is a systematized body of knowledge ascertainable by
observation experimentation. It is a body of generalizations, principles, theories or laws which traces
out a casual relationship between cause and effect.
Economics is a systematized body of knowledge in which economic facts are studied and analyzed in
a systematic manner. For instance, economics is divided into consumption, production, exchange,
distribution and public finance which have their laws are theories on whose basis these departments
are studied and analyzed in a systematic manner.
Hence economics is a science like any other science which has its own theories and laws which
establish a relation between cause and effect. Economics is also a science because its laws possess
universal validity such as the law of diminishing returns, the law of diminishing marginal utility the
law of demand, Gresham’s law, etc.
Again, economics is a science because of its self corrective nature. It goes on revising its conclusions
in the light of new facts based on observations. Economic theories or principles are being revised in
the fields of macro economics, monetary economics, international economics, public finance and
economic development.
Economics as an Art: Unlike natural science, there is no scope for experimentation in economics
because economics is related to man, his problems and activities. Economic phenomena are very
Click here to download full notes

Read More

Tuesday, July 24, 2012

anna university fifth semester ece question banks updated download

9:04 AM  Anna University Chennai Question Bank, ANNA UNIVERSITY QUESTION BANKS FOR ECE, ECE FIFTH, LAB MANUALS, LECTURE NOTES, QUESTION BANKS  No comments


latest anna university fifth semester  question banks with solution and prevevious year question papers(full collection) ebooks for ece fifth semester free download,syllabus,lecture notes,maths,  Notes, 2&16marks Answers, Question Banks, Important Questions searchengine,ppt,doc.pdf,mini projects,pre final year projects downalod titles, lab manual

EC2301  DigitalCommunication (DC) Download below

Notes 1 Download

notes 2

notes 3

notes 4

notes 5


EC2302  Digital SignalProcessing(DSP) Download below

notes 1 Huge collection

notes 2

notes 3

notes 4

notes 5



EC2303  ComputerArchitecture and Organization(CA) Download below

Notes 1

Notes 2

Notes 3

Notes 4

Notes 5


EC2305  TransmissionLines and Wave guides Download below

Notes 1

Notes 2

Notes 3

Notes 4

Notes 5


GE2021 EnvironmentalScience and Engineering(EVS) Download below

Notes 1

Notes 2

Notes 3

Notes 4

Notes 5


EC2304  Microprocessorsand Microcontrollers Download below

Notes 1

Notes 2

Notes 3

Notes 4

Notes 5


 ebook fifth semster download

This is the example text for title one.

Title ebook fifth semster for ece download

This is the example text for title two.

ece fifth semester ebooks and question banks full download

This is the example text for title three.

tags: press ctl + plus buttton to zoom

Anna University ECE 5th Semester Syllabus Download

Anna University Question Papers For ECE

ECE FIFTH SEMESTER | anna university question banks

Anna University Question Papers

B.E.ece- Fifth (5th) Semester Question Banks (huge collections)

ECE Fifth(5th) Semester Syllabus - Anna University Regulation 2008 

2009 2010 2011 2012

ANNA UNIVERSITY BE ECE SYLLABUS REGULATION 2008

Read More

Wednesday, June 27, 2012

Simple Way to learn Java Programing in two Days

5:32 AM  ALL DEPT, CSE, EBOOKS, HOW TO, IT, LECTURE NOTES, OTHERS, PROGRAMS, QUESTION BANKS, SOURCE CODES, VIVA-QUESTIONS  1 comment

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
Older Posts Home
Subscribe to: Posts (Atom)

chitika

Social Profiles

TwitterFacebookGoogle PlusLinkedInRSS FeedEmail
  • CATEGORIES
  • POPULAR
  • RECENT

EMAIL SUBSCRIBE

Enter your address:

Delivered by www.questionbanks.tk

ads

Blog Archive1

  • ▼  2016 (2)
    • ▼  November (2)
      • Anna University Latest News and results - announced
      • Anna University Latest News
  • ►  2015 (3)
    • ►  September (1)
    • ►  June (1)
    • ►  March (1)
  • ►  2014 (8)
    • ►  October (1)
    • ►  June (3)
    • ►  May (1)
    • ►  April (1)
    • ►  February (2)
  • ►  2013 (7)
    • ►  August (4)
    • ►  July (1)
    • ►  June (1)
    • ►  May (1)
  • ►  2012 (197)
    • ►  December (2)
    • ►  November (10)
    • ►  October (12)
    • ►  September (26)
    • ►  August (9)
    • ►  July (14)
    • ►  June (7)
    • ►  May (47)
    • ►  April (49)
    • ►  March (10)
    • ►  February (7)
    • ►  January (4)
  • ►  2011 (69)
    • ►  December (1)
    • ►  November (4)
    • ►  October (8)
    • ►  September (7)
    • ►  August (5)
    • ►  July (3)
    • ►  June (36)
    • ►  May (3)
    • ►  February (2)

MENU SCROLL DOWN HERE

+2 (PLUS TWO) 2012 EXAMS 5TH AND 7TH SEM RESULTS NOV/DEC 2011 6TH 8TH SEMESTER Admit Card Affiliated Colleges Nov/Dec 2011 UG University exam Time Table AIEEE ALL DEPT ALL RESULTS ANALOG AND DIGITAL COMMUNICATION ANNA UNIV 3RD ANNA UNIV 4TH SEM RESULTS JUNE 2011 ANNA UNIV 4TH SEMESTER RESULTS 2011 Anna University ANNA UNIVERSITY 2ND 4TH 6TH AND 8TH SEMESTER RESULTS ANNA UNIVERSITY 4TH SEM RESULTS JUNE 2011 CHENNAI Anna University C.S. 5th Semester Question Papers Anna University Chennai 2nd Semester June time table Anna University Chennai Question Bank anna university madurai be results anna university madurai results 2011 anna university of tech 2011 results ANNA UNIVERSITY OF TECHNOLOGY TIRUNELVELI MBA /MCA /ME/MTECH/MARCH/MSC/BSC/BCA APRIL/MAY/JUNE 2012 Anna University Question Bank Engineering Mathematics -1 Anna University Question Bank Engineering Mathematics -II Anna University Question Bank Engineering Mathematics -III anna university question bank for CSE anna university question bank for eee ANNA UNIVERSITY QUESTION BANKS FOR ECE anna university question banks for second semester Anna University Questions Banks anna university second semester notes and question banks ANSWER KEYS ANTENNAE WAVE PROPAGATIONS APPLIED ELECTRONICS B.PHARM B.SC CAT EXAMS CE340 – FOUNDATION ENGINEERING Chennai B.E/B.TECH/B.ARCH APRIL/MAY 2012 EXAMINATION FOR 4TH CIRCUIT THEORY QUESTION BANKS CIVIL CIVIL MINI PROJECTS COLLEGE REOPENING DATE COMPUTER NETWORKS computer science CONTROL SYSTEM CRACKING EXAMS CS 2255-Database Management Systems CS 2305 - PROGRAMMING PARADIGMS question Banks CS2055 CS2203 OBJECT ORIENTED PROGRAMMING QUESTION BANKS CS2251 CS2252 CS2253 CS2253 CS2254 CS2255 CSE cse 7 SUBJECTS CSE 7 SUBJECTS CG CSE 7 SUBJECTS EEFA cse 7 syllabus CSE EIGTH CSE FIFTH CSE FIRST CSE FOURTH CSE MINI PROJECTS CSE SECOND CSE SEVENTH CSE SIXTH CSE THIRD CUTT OFF DATA STRUCTURES DATA WAREHOUSING AND MINING DESIGN OF ELECTRICAL MACHINES(DEM) Digital Communication DIGITAL LOGIC CIRCUITS Digital Signal Processing(dsp) DOWNLOADS E-Learning EBOOKS EC2151 EDC EC2252 Communication Theory ECE ECE EIGHTH ECE FIFTH ECE FIRST ECE FOURTH ECE MINIPROJECTS ECE SECOND ECE SEVENTH ECE SIXTH ECE THIRD EEE EEE EIGHTH EEE FIFTH EEE FIRST EEE FOURTH EEE MINI PROJECTS EEE SECOND EEE SEVENTH EEE SIXTH EEE THIRD ELECTRIC CIRCUITS AND ELECTRON DEVICES Electrical and Instrumentation ELECTROMAGNETIC FIELDS ELECTRONIC CIRCUITS II - EC2251 ENGINEERING CHEMISTRY – I ENGINEERING CHEMISTRY – II ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING Engineering Mechanics – Question Bank ENGINEERING PHYSICS.-I ENGINEERING PHYSICS.-II English ENTRANCE EXAM QUESTION PAPERS EXAM DATES exam time table for anna university of technolgy tirunelveli FIRST SEMESTER GATE EXAM GE2025 – PROFESSIONAL ETHICS IN ENGINEERING GE2152 BASIC CIVIL and MECHANICAL ENGINEERING GE2152 BASIC CIVIL AND MECHANICAL ENGINEERING QUESTION BANKS HACKING HIGH VOLTAGE ENGINEERING(HVE) HOW TO how to apply revaluation for anna university B.E/B.Tech HOW TO CALCULATE CGPA PERCENTAGE HOW TO CRACK AIEEE EXAMS SIMPLE TIPS IEEE PROJECTS Information Security INTERVIEW IT IT 2352 IT FIFTH SEM IT FIRST IT INTERVIEW IT MINIPROJECTS IT SECOND SEM IT SIXTH IT SYLLABUS IT THIRD JOBS LAB MANUALS LECTURE NOTES LINEAR INTEGRATED CIRCUITS LINEAR INTEGRATED CIRCUITS -EE2254 M.B.B.S M.PLAN M.TECH MA 2161 MA2262 MATHS MBA MC9226 OBJECT ORIENTED PROGRAMMING LAB MCA MCA MINIPROJECTS MCA QUESTION BANKS ME MEASUREMENTS AND INSTRUMENTATION MECH Mechanical -index Mechanical -Syllabus MEDICAL MICROPROCESSORS AND MICROCONTROLLER MINI PROJECTS NURSING QUESTION BANKS ODD SEMESTER ONLINE EXAMS OOPS OPERATING SYSTEMS OS OTHERS PG PLACEMENT PAPER POWER PLANT ENGINEERING POWER SYSTEM ANALYSIS Principles of compiler design PRINCIPLES OF MANAGEMENT PROGRAMS QUESTION BANKS QUESTION PAPERS Radio Diagnosis Technology Radiotherapy Technology RECENT UPDATES RESULT RESULTS RESUME TEMPLATES SAMPLE RESUME SELF FINANCING COLLEGES Seminar topics Software Engineering SOFTWARE PROJECT MANAGEMENT QUESTION BANK SOLID STATE DRIVES SOURCE CODES SUBJECTS syllabus Syllabus Anna University System Software TAMIL NADU MBA/MCA COUNSELLING RANK LIST TANCET MBA RANK LIST 2011 TANCET MCA RANK LIST 2011 TAMIL NADU MBA/MCA COUNSELLING RANK LIST TANCET MBA RANK LIST 2012 TANCET MCA RANK LIST 2012 TANCA TRICKS Tancet 2012 Answer Key with Solutions - Anna University TANCET TRICKS TET EXAMS Theory of communication TIME TABLE Time Table for November/December 2011 - Examination (Regulation 2001) Time Table for November/December 2011 - Examination (Regulation 2004) Time Table for November/December 2011 - Examination (Regulation 2008) Time Table for November/December 2011 B.E(Part Time)- Examination TNEA RANK LISTS/APPLICATION COLLEGE LISTS TNEA TRICKS TNPSC EXAMS NOTES TOP COLLEGES IN TAMILNADU RANKING LIST UPDATED TRANSMISSION LINES AND WAVEGUIDES TRB USEFUL LINKS VIVA-QUESTIONS VLSI DESIGN Web Technology www.tnhealth.org updates

Categories

QUESTION BANKS ALL DEPT OTHERS HOW TO Anna University Chennai Question Bank anna university question bank for CSE Anna University Questions Banks ANNA UNIVERSITY QUESTION BANKS FOR ECE ECE EEE IT ALL RESULTS Anna University CSE anna university question bank for eee 2012 EXAMS QUESTION PAPERS TIME TABLE MINI PROJECTS ECE FOURTH CSE FIFTH TANCET TRICKS EEE FOURTH CRACKING EXAMS CSE MINI PROJECTS ECE THIRD EXAM DATES anna university question banks for second semester anna university second semester notes and question banks LECTURE NOTES MATHS MCA MINIPROJECTS MECH RESULTS CSE FOURTH CSE SEVENTH ECE FIFTH ECE SIXTH EEE SIXTH LAB MANUALS CIVIL IEEE PROJECTS VIVA-QUESTIONS DOWNLOADS EEE THIRD ENTRANCE EXAM QUESTION PAPERS IT FIFTH SEM IT MINIPROJECTS MCA TAMIL NADU MBA/MCA COUNSELLING RANK LIST TANCET MBA RANK LIST 2012 TANCET MCA RANK LIST 2012 TNEA TRICKS CSE SIXTH CSE THIRD ECE FIRST EEE FIRST GE2152 BASIC CIVIL AND MECHANICAL ENGINEERING QUESTION BANKS IT FIRST cse 7 SUBJECTS Anna University Chennai 2nd Semester June time table COMPUTER NETWORKS CSE EIGTH CSE FIRST CSE SECOND DATA WAREHOUSING AND MINING Electrical and Instrumentation FIRST SEMESTER MBA ME RECENT UPDATES TNEA RANK LISTS/APPLICATION COLLEGE LISTS ECE MINIPROJECTS ECE SECOND GATE EXAM OOPS PG RESULT Software Engineering TET EXAMS TNPSC EXAMS NOTES TOP COLLEGES IN TAMILNADU RANKING LIST UPDATED how to apply revaluation for anna university B.E/B.Tech 6TH ANNA UNIV 3RD Anna University Question Bank Engineering Mathematics -1 Anna University Question Bank Engineering Mathematics -III B.SC CIVIL MINI PROJECTS EBOOKS EEE EIGHTH EEE FIFTH EEE MINI PROJECTS EEE SECOND ENGINEERING CHEMISTRY – II ENGINEERING PHYSICS.-II IT THIRD JOBS M.TECH MCA QUESTION BANKS MICROPROCESSORS AND MICROCONTROLLER NURSING QUESTION BANKS ONLINE EXAMS RESUME TEMPLATES Tancet 2012 Answer Key with Solutions - Anna University anna university madurai be results computer science +2 (PLUS TWO) 8TH SEMESTER AIEEE ANNA UNIVERSITY 4TH SEM RESULTS JUNE 2011 CHENNAI ANTENNAE WAVE PROPAGATIONS Anna University C.S. 5th Semester Question Papers B.PHARM CAT EXAMS COLLEGE REOPENING DATE CS2251 Chennai B.E/B.TECH/B.ARCH APRIL/MAY 2012 EXAMINATION FOR 4TH DATA STRUCTURES Digital Communication Digital Signal Processing(dsp) EC2252 Communication Theory ECE EIGHTH ECE SEVENTH EEE SEVENTH ELECTRIC CIRCUITS AND ELECTRON DEVICES ENGINEERING PHYSICS.-I English GE2025 – PROFESSIONAL ETHICS IN ENGINEERING GE2152 BASIC CIVIL and MECHANICAL ENGINEERING HACKING HOW TO CALCULATE CGPA PERCENTAGE IT SECOND SEM IT SIXTH LINEAR INTEGRATED CIRCUITS LINEAR INTEGRATED CIRCUITS -EE2254 M.B.B.S MEDICAL PRINCIPLES OF MANAGEMENT Radio Diagnosis Technology Radiotherapy Technology SAMPLE RESUME SOURCE CODES Syllabus Anna University TRANSMISSION LINES AND WAVEGUIDES USEFUL LINKS VLSI DESIGN anna university madurai results 2011 anna university of tech 2011 results syllabus www.tnhealth.org updates 5TH AND 7TH SEM RESULTS NOV/DEC 2011 ANALOG AND DIGITAL COMMUNICATION ANNA UNIV 4TH SEM RESULTS JUNE 2011 ANNA UNIV 4TH SEMESTER RESULTS 2011 ANNA UNIVERSITY 2ND 4TH 6TH AND 8TH SEMESTER RESULTS ANNA UNIVERSITY OF TECHNOLOGY TIRUNELVELI MBA /MCA /ME/MTECH/MARCH/MSC/BSC/BCA APRIL/MAY/JUNE 2012 ANSWER KEYS APPLIED ELECTRONICS Admit Card Affiliated Colleges Nov/Dec 2011 UG University exam Time Table Anna University Question Bank Engineering Mathematics -II CE340 – FOUNDATION ENGINEERING CIRCUIT THEORY QUESTION BANKS CONTROL SYSTEM CS 2255-Database Management Systems CS 2305 - PROGRAMMING PARADIGMS question Banks CS2055 CS2203 OBJECT ORIENTED PROGRAMMING QUESTION BANKS CS2252 CS2253 CS2253 CS2254 CS2255 CSE 7 SUBJECTS CG CSE 7 SUBJECTS EEFA CUTT OFF DESIGN OF ELECTRICAL MACHINES(DEM) DIGITAL LOGIC CIRCUITS E-Learning EC2151 EDC ELECTROMAGNETIC FIELDS ELECTRONIC CIRCUITS II - EC2251 ENGINEERING CHEMISTRY – I ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING Engineering Mechanics – Question Bank HIGH VOLTAGE ENGINEERING(HVE) HOW TO CRACK AIEEE EXAMS SIMPLE TIPS INTERVIEW IT 2352 IT INTERVIEW IT SYLLABUS Information Security M.PLAN MA 2161 MA2262 MC9226 OBJECT ORIENTED PROGRAMMING LAB MEASUREMENTS AND INSTRUMENTATION Mechanical -Syllabus Mechanical -index ODD SEMESTER OPERATING SYSTEMS OS PLACEMENT PAPER POWER PLANT ENGINEERING POWER SYSTEM ANALYSIS PROGRAMS Principles of compiler design SELF FINANCING COLLEGES SOFTWARE PROJECT MANAGEMENT QUESTION BANK SOLID STATE DRIVES SUBJECTS Seminar topics System Software TAMIL NADU MBA/MCA COUNSELLING RANK LIST TANCET MBA RANK LIST 2011 TANCET MCA RANK LIST 2011 TANCA TRICKS TRB Theory of communication Time Table for November/December 2011 - Examination (Regulation 2001) Time Table for November/December 2011 - Examination (Regulation 2004) Time Table for November/December 2011 - Examination (Regulation 2008) Time Table for November/December 2011 B.E(Part Time)- Examination Web Technology cse 7 syllabus exam time table for anna university of technolgy tirunelveli
  • Tancet cut-off based collges list 2012-2013 TOP LISTED NEW AND UPDATED
  • Anna University Chennai - 2nd Semester June 2012 Time Table and notes
  • EXAM TIME TABLE FOR ANNA UNIVERSITY CHENNAI | Anna University,Chennai B.E/B.TECH/B.ARCH UG & PG APRIL/MAY 2012 EXAMINATION FOR 4TH,6TH&8TH SEMESTER|AREAR EXAM TIME TABLE FOR REGULATION 2004,2008,2009,2010
  • New Update : Tancet 2012 Counselling Dates for MBA MCA & ME - TANCET Rank Card - TANET Cut Off marks HURAY
  • NEW MBBS BDS Rank List 2012 TN | LIST OF SELF FINANCING MEDICAL COLLEGES FOR MBBS COURSE 2012 – 2013 SESSION
  • TNEA RANK LISTS 2012|TNEA 2012 - 2013 RANDOM NUMBER
  • Anna University Questions Bank for cse -oops
  • CHANGE IN ANNA UNIVERSITY TIME TABLE | ANNA UNIVERSITY MAY/JUNE 2012 TIME TABLE| EXAM TIME TABLE FOR ANNA UNIVERSITY CHENNAI | Anna University,Chennai B.E/B.TECH/B.ARCH UG & PG APRIL/MAY 2012 EXAMINATION FOR 4TH,6TH&8TH SEMESTER|AREAR EXAM TIME TABLE FOR REGULATION 2004,2008,2009,2010
  • TANCET Results 2012 for M.E , M.B.A , M.C.A April last week
  • ANNA UNIVERSITY RESULTS 2012|ANNA UNIVERSITY 4TH 6TH 8TH SEMESTER APRIL/MAY 2012 RESULTS | ANNA UNIVERSITY APRIL/MAY 2012 EXAM RESULTS FOR 4TH 6TH 8TH SEMESTER |WHEN THE REUSLTS WILL ANNOUNCED

 
  • Page Number

    Share This

    JOIN WITH US

    .

    Related Posts Plugin for WordPress, Blogger...
  • Today Pageviews

    Search Engine Ping your blog, website, or RSS feed for Free E.r
    Protected by Copyscape Duplicate Content Checker
    MyFreeCopyright.com Registered & ProtectedDMCA.com
  • Recent Posts

    upload ur question banks for other college professor helps click here


Copyright © 2011 ANNA UNIVERSITY QUESTION BANKS PAPERS WITH SOLUTIONS | Powered by Blogger
Design by NewWpThemes | Blogger Theme by Lasantha - Premium Blogger Themes | discussion board in sharepoint

State Entrance Exams ,Common Entrance Tests (CET), Maharashtra, Gujarat, Andhra Pradesh, Tamilnadu, Karnataka, Kerala, MBBS, Engineering, MBA, MCA, Law Entrance, Hotel Management , CET 2012,2013,2014,2015 Maharashtra, Karnataka, Kerala, Tamilnadu, Delhi, Punjab, Haryana, Rajasthan, MP, Pudduchery, Jammu and Kashmir, Himachal, Bihar, Orissa and West Bengal,anna university question banks for ece,eee,mca,cse,IT,mechanical,civil,E and I,mbbs,nursing,B.Tech,B.arch,B.sc,ebooks,download,seminar,softcopy,final year projects,ANNA UNIVERSITY, CHENNAI,II TO VIII SEMESTERS CURRICULUM AND SYLLABUS,DEPARTMENTS,CIVIL,Environmental,Geoinformatics,MECHANICAL,Aeronautical,Automobile,Marine,Production,Material Science and Manufacturing,Mechatronics,Industrial,Industrial and Management,Mechanical and Automation,ELECTRICAL,Electrical and Electronics,Electronics and Instrumentation,Instrumentation and Control,INFORMATION AND COMMUNICATION,Electronics and Communication,Computer Science,Information Technology,Biomedical,Medical Electronics,Biotechnology,Polymer,Plastic Technology,Textile Technology,Textile Technology (Fashion Technology) / Fashion Technology,Petroleum,Textile Chemistry,Chemical and Electrochemical,Petrochemical Technology,Food,Pharmaceutical,Petrochemical,ARCHITECTURE (R 2009),B.Arch Interior Design,Anna University - Affiliated colleges April / May /nov/dec 2013 2014 2015 2016 Examination Timetable for Chennai , Trichy , Combaitore , Madurai , Tirunelveli