Oracle




Oracle

Filed under:

Oracle Placement Question Paper

1. How compiler treats variables of recursive functions

2. What is orthogonal matrix?

3. Given two tables and asked 2 qns on those table ,

4. One is on join and another is on NOT IN

5. Given some qns on pointers( pretty easy)

6. Given five qns on data structures like , lifo, fifo

7. Qtn on primary key

8. How NULL in sql is treated?

9. Given a doubly linked list and asked r->left->right->data ans: r->data

10. Explain const char *ptr and char *const ptr

11. Remaining i didn`t remember

Technical

12. What is the output of the following program?< ?xml:namespace prefix = o ns urn:schemas -microsoft-com office:office" "
#include
#include
void main( )
{
int a=5,b=7;
printf(“%dn”,ba);
}
A. 1.4
B. 1.0
C. 1
D. 0

13. What is the output of the following program listing?
#include
void main ( )
{
int x,y:
y=5;
x=func(y++);
printf(“%sn”,
(x==5)?”true”;”false”);
}
int func(int z)
{
if (z== 6)
return 5;
else
return 6;
}
A True
B false
C either a or b
D neither a nor b

14. What is the output of the following progarm?
#include
main( )
{
int x,y=10;
x=4;
y=fact(x);
printf(“%dn”,y);
}
unsigned int fact(int x)
{
return(x*fact(x-1));
}
A. 24
B. 10
C. 4
D. none

15. Consider the following C program and chose collect answer
#include
void main( )
{
inta[10],k;
for(k=0;k<10;k++)
{ a[k]=k;}
printf (“%dn”,k);
}
A. value of k is undefined ; unpredictable answer
B. 10
C. program terminates with run time error
D. 0

16. Consider the prog and select answer
#include
void main ( )
{
int k=4,j=0:
switch (k)
{
case 3: j=300;
case 4: j=400:
case 5: j=500;
}
printf (“%dn”,j);
}
A. 300
B. 400
C. 500
D. 0

17. Consider the following statements:
Statement 1 A union is an object consisting of a sequence of named members of various types
Statement 2 A structure is a object that contains at different times, any one of the several members of various types
Statement 3: C is a compiled as well as an interpretted language
Statement 4: It is impossible to declare a structure or union containing an instance of itself
A. all the statements are correct
B. except 4 all are correct
C. statemnt 3 is only correct
D. statement 1,3 are incorrect either 2 or 4 is correct

18. consider the following program listing and select the output
#include
main ( )
{
int a=010,sum=0,tracker:
for(tracker=0;tracker< =a;tracker++)
sum+=tracker;
printf(“ %dn”,sum);}
A. 55
B. 36
C. 28
D. n

19. Spot the line numbers , that are valid according to the ANSI C standards?
Line 1: #include
Line 2: void main()
Line 3: {
4 : int *pia,ia;
5 :float *pafa,fa;
6 :ia=100;
7 :fa=12.05;
8 :*pfa=&ia;
9 :pfa=&ia;
10 :pia=pfa;
11 :fa=(float)*pia;
12 :fa=ia;
13 :}
a. 8 and 9
b. 9 and 10
c. 8 and 10
d. 10 and 11

20. What is the o/p of the follow pgm?
#include
main()
{
char char_arr[5]=”ORACL”;
char c=’E’;
prinf(“%sn”,strcat(char_arr,c));
}
a: oracle
b. oracl
c. e
d. none

21. consider the following pgm listing
#include
main()
{
int a[3];
int *I;
a[0]=100;a[1]=200;a[2]=300;
I=a;
printf(“%dn”, ++*I);
printf(“%dn”, *++I);
printf(“%dn”, (*I)–);
printf(“%dn”, *I);
}
what is the o/p
a. 101,200,200,199
b. 200,201,201,100
c. 101,200,199,199
d. 200,300,200,100

22. which of the following correctly declares “My_var” as a pointer to a function that returns an integer
a. int*My_Var();
b. int*(My_Var());
c. int(*)My_Var();
d. int(*My_Var)();

23. what is the memory structure employed by recursive functions in a C pgm?
a. B tree
b. Hash table
c. Circular list
d. Stack

24. Consider the follow pgm listing?
Line 1: #include
2: void main()
3: {
4: int a=1;
5: const int c=2;
6: const int *p1=&c;
7: const int*p2=&a;
8: int *p3=&c;
9: int*p4=&a;

25. what are the lines that cause compilation errors?
a. 7
b. 8
c. 6 and 7
d. no errors

26. what will be the o/p
#include
main()
{
inta[3];
int *x;
int*y;
a[0]=0;a[1]=1;a[2]=2;
x=a++;
y=a;
printf(“%d %dn”, x,(++y));
}
a. 0,1
b. 1,1
c. error
d. 1,2
what is the procedure for swapping a,b(assume that a,b and tmp are of the same type?
a. tmp=a; a=b;b=temp;
b. a=a+b;b=a-b;a=a-b;
c. a=a-b;b=a+b;a=b-a;
d. all of the above

Related Plament Papers and Companies

Covansys Placement Question Papers

Covansys Placement Question Papers covansys is recruiting heavily many people have been asking abt covansys first round pattern; You will be given a question booklet that contains many papers on different topics. Some are compulsorywhile some are optional (i.e. you can take this or that). All the papers are objective type. Aptitude will be your first section-aptitude will be quite easy (simple distance, time, numbers etc.) problems. You’ll probably also have one question like the GRE analytical section (i.e. you will be given a paragraph followed by a set of 4/5 questions based on that paragraph). This section is easy but

Flextronics(Hughes) Placement Question Papers

Flextronics(Hughes) Placement Question Papers 1. nice('val')? unix command 2. for(l=1;a< =l;a++) cout

DSRC Placement Question Papers

DSRC Placement Question Papers Information About test It is an online test..so u'l know results 10 mins aftr finishing t test..b4 u tak t test,they'l give a presntation abt DSRC...watch it carefully bcoz u've to write somthing abt t company at t end of t test..presntation goes on for 1/2 hour..test consists of 5 sections: Section 1: Complete the number sequence.. 25

Oracle

Oracle Placement Question Paper Technical Papers 1. const int MAX=10; main() { enum a {a,b,MAX}; print MAX; } ans. 2 2. enum variable is a const variable which can only be assigned a value at initialization or a non const variable which can be assigned any value in the middle of the program? ans. const variable 3. void *p; what operation cannot be performed on p? ans : arithmetic operation

Flextronics(Hughes) Placement Question Papers

Flextronics(Hughes) Placement Question Papers Aptitude Questions 1. Age problem 2. Time and distance 3. Coin 4. direction problem 5. (2n + 2 n-1/2 n+1 – 2n) what is gives if n = something 6. ( 10n –1) n>1 when is divisible by 11.no divisible by 8 7. find the missing no. when it is divisible by some no 8. Boat problem 9. Average Technical Questions 10. Which one is called family tree 11. virtual function and overloading 12. DHCP protocol 13. order of insertion and Heap sort

  • Resources













  • Placement Papers Archives