GeekInterview.com
  I am new, Sign me up!
 

Oracle Technical


Oracle Technical

Questions: 126
Comments: 221
 Oracle Technical Tags
 Showing Questions 21-30 of 126 Questions
<< Previous 1 2 [3] 4 5 6 7 8 9 10 Next >>
 Sponsored Links

 
 Oracle Technical
Sorting Options :  

What is the output of the following code?char str[20] = "ENIGMA";char *p, *q, *r;q=p++;r=p+3 - (p-q);printf("%3s%5s", (++p)+3, r);A. ENIGMAB. GMAC. No outputD. Error.

Int x[] = { 1, 4, 8, 5, 1, 4 };int *ptr, y;ptr = x + 4;y = ptr - x;What does y in the sample code above equal?A. -3B. 0C. 4D. 4 + sizeof( int )

F = fopen( filename, "r" );if(????){fprintf(stderr, "Could not open file!");exit(-1);}What should replace the ???? in the code above to determine if the file could not be opened?A. f == NULLB. f == EOFC. f != 0;D. f == -1

Int z;int x = 5;int y = -10;int a = 4;int b = 2;z = x++ - --y * b /a;What number will z in the sample code above containsA. 5B. 6C. 10D. 11

Assuming today is Monday, 10 July 2000, what is returned by this statement:SELECT to_char(NEXT_DAY(sysdate, 'MONDAY'), 'DD-MON-RR') FROM dual;A. 10-JUL-00B. 12-JUL-00C. 11-JUL-00D. 17-JUL-00

There are six steps that lead from the first to the second floor. No two people can be on the same step. Mr. A is two steps below Mr. C. Mr. B is a step next to Mr. D. Only one step is vacant (No one standing on that step) Denote the first step by step 1 and second step by step 2 etc. If Mr. B was on step 1, which step could A be on?A. 2&3 onlyB. 3&5 onlyC. 3&4 onlyD. 4&5 only

There are six steps that lead from the first to the second floor. No two people can be on the same step. Mr. A is two steps below Mr. C. Mr. B is a step next to Mr. D. Only one step is vacant (No one standing on that step) Denote the first step by step 1 and second step by step 2 etc. If Mr. E was on the third step & Mr. B was on a higher step than Mr. E which step must be vacant?A. step 1B. step 2C. step 4D. step 5

There are six steps that lead from the first to the second floor. No two people can be on the same step. Mr. A is two steps below Mr. C. Mr. B is a step next to Mr. D. Only one step is vacant (No one standing on that step) Denote the first step by step 1 and second step by step 2 etc. If Mr. A is on the first step. Which of the following is true?A. Mr. B is on the second stepB. Mr. C is on the fourth step.C. A person Mr. E, could be on the third stepD. Mr. D is on higher step than Mr. C.

Latest Answer: 4,6,9,13 4+2=6 6+3=9 9+4=13 13+5=18 ...

Susan can type 10 pages in 5 minutes. Mary can type 5 pages in 10 minutes. Working together, how many pages can they type in 30 minutes?A. 15B. 20C. 65D. 75

View page << Previous 1 2 [3] 4 5 6 7 8 9 10 Next >>

Ask A Question
Go Top
 Sponsored Links

 
Sponsored Links

 
Ask Question
You must login to Ask Question or Register your free account

Category:

 
Question Title:


Question in Detail:

Add this to my Subscribed Questions (?)
Send me email when new answer is posted (?)

 
Subscribe
Get Latest Updates Via RSS Reader or by Email
 Forum Discussion Subscribe to Forum Discussions Via E-Mail Latest Forum Discussions Subscribers
 Knowledge Base Subscribe to Knowledge Base Series Via E-Mail Knowledge Base Subscribers
 Learning Series Subscribe to GeekInterview Learning Series Via EMail Learning Series Subscribers
 Freelance Jobs Subscribe to GeekInterview Freelance Jobs Via EMail Latest Freelance Jobs Subscribers
 GeekInterview Blog Subscribe to GeekInterview Blog Via EMail GeekInterview Blog Subscribers
 Testing Interview Questions Subscribe to Testing Interview Questions Via EMail Testing Interview Questions Subscribers
 Oracle Interview Questions Subscribe to Oracle Interview Questions Via EMail Oracle Interview Questions Subscribers
 Java Interview Questions Subscribe to Java Interview Questions Via EMail Java Interview Questions Subscribers
 Latest Placement Papers Subscribe to Latest Placement Papers Placement Papers Subscribers
 Free Training Subscribe to Free Training Via EMail Free Training Subscribers
 Learn AJAX Subscribe to AJAXwith.com Via EMail AJAXwith Subscribers
About Us -  Privacy Policy -  Terms and Conditions -  Contact -  Ask Question -  Propose Category -  Site Updates 

Copyright © 2005 - 2009 GeekInterview.com. All Rights Reserved

Page copy protected against web site content infringement by Copyscape