"For every success of a man there will be a countless pain in his heart and that pain makes him a successful person in life"

When You are at the Peak of Concentration, You don't feel whether u r programming in C/C#/JAVA or any other, You just type the keys on keyboard and your sub-conscious mind does the rest...!

Myspace GlittersMyspace GlittersMyspace GlittersMyspace GlittersMyspace GlittersMyspace GlittersMyspace GlittersMyspace Glitters




 
   

Java Test 2

   
 


 

 

Home

Guestbook

GALLERY

MySQL

C/C++ Interview Questions

C/C++ Test Paper 1

C/C++ Test Paper 2

C Tricky Snippets

C - Pointers

C - Functions

C - Iterations, Operators

Java Interview Questions

Java Fundamentals

Java FAQs

J2EE - FAQs

Java - Best Collection Ever

Java/J2EE Test 1

Java Test 2

Java Servlets - FAQs

SCJP 5.0 Syllabus

SCJP Exam 1

SCJP Exam 2

SCJP Exam 3

SCJP Exam 4

SCJP Exam 5

Relational Database Management Systems(RDBMS) Imp. Concepts

SQL Server - Interview Questions

SQL Server 2

Data Structures

OOPS - FAQs

Object Oriented Programming (OOP) Concepts

Operating Systems - FAQs

Operating System Concepts

Networking Concepts

UML - Quick Reference

VB - FAQs

Secrets About Windows Operating Systems

 


     
 

JAVA TEST PAPER 2

Technical questions

1.output of the following code:
   #define M 5+5
   void main()
  { printf(“%d”, M*M);
   }
2.*p+ + increment p or what it points to? 
3.Find error with a given code:
   {scanf("&",a)}
4.syntax of free func. 
5.give output:
   void main()
  { 
   int x=0, y=1;
  (x || printf(“printing xn”));
  (y|| printf(“printing yn”));
   }

6 write one major advantage & disadvantage of recursion.
7.what is hashing?
8. give output:
    main()
   {
   int j=5;
   printf(“%d %d %d”, + +j, j, j+ +);
   }
9.give output:

  main()
  {
  int static i=5, j=10;
  for(i=1;i<=3;i++)
  {
  int j=10; j=j+1;
  printf(“%d %d %d” j, j, j);
  }
  printf(“%d”, i);
  }

10. why printf(“%d”, ‘A’); will not return the value 1?

11. preorder and postorder traversal of a binary tree is given, construct the binary tree.

12. a binary tree is given, draw postorder traversal.

13. what is the difference between char const* , char *const ?

14. correction of a given code

15. write a macro function to return the maximum of two numbers.

16. how a pointer to a function is called & declared?

17 write a program for double linked list & delete the last node.

18. write a program for binary search of N numbers.

19. program related to string.

 

 
 

 

 

Thank You.. Visit Again

This website was created for free with Own-Free-Website.com. Would you also like to have your own website?
Sign up for free