Join Our Email Alerts-Subscribe
Important Note:Login & Check Your Email Inbox and Activate Confirmation Link



Enter Your Email :

Copyright Disclaimer:
Section 107 of the Copyright Act Fair Use Contents .
We are forwarding content link(s) from our website to content website & We are not serving any contents.
Main Source:Google.com.All the Content PDF link(s) is/are obtained from GoogleSearch
for the purpose of Education & Teaching Intention. Not for commercial purpose.
Technicalsymposium.com is not liable/responsible for any copyright issues.

Placement Materials & Answers-Free Download


ORACLE Placement Papers-Free Download

1. How many times the program will print “India

include

int main()

{

printf(“India”);

main();

return 0;

}

A.Infinite times B.32767 times C.65535 times D.Till stack doesn’t overflow

Answer: D

Solution: A call stack or function stack is used for several related purposes, but the main reason for having one is to keep track of the point to which each active subroutine should return control when it finishes executing. A stack overflow occurs when too much memory is used on the call stack. Here function main() is called repeatedly and its return address is stored in the stack. After stack memory is full. It shows stack overflow error.

2. Specify the 2 library functions to dynamically allocate memory?

A.malloc() and memalloc() B.alloc() and memalloc() C.malloc() and calloc() D.memalloc() and faralloc()

Answer: C

3. You need to store elements in a collection that guarantees that no duplicates are stored. Which two interfaces provide that capability?

A.Java.util.Map B.Java.util.List C.Java.util.Collection D.None of the above

Answer: A

Solution:

Option A is correct. A Map cannot contain duplicate keys. Option B is wrong. Lists typically allow duplicate elements. Option C is wrong. Collection allows duplicate elements.

4. Which three are methods of the Object class? 1. notify(); 2. notifyAll(); 3. isInterrupted(); 4. synchronized(); 5. interrupt(); 6. wait(long msecs); 7. sleep(long msecs); 8. yield();

A.1, 2, 4 B.2, 4, 5 C.1, 2, 6 D.2, 3, 4

Answer: C

Solution: (1), (2), and (6) are correct. They are all related to the list of threads waiting on the specified object. (3), (5), (7), and (8) are incorrect answers. The methods isInterrupted() andinterrupt() are instance methods of Thread. The methods sleep() and yield() are static methods of Thread. D is incorrect because synchronized is a keyword and the synchronized()construct is part of the Java language.

5. Which class or interface defines the wait(), notify(),and notifyAll() methods?

A.Object B.Thread C.Runnable D.Class

Answer: A

Solution: The Object class defines these thread-specific methods. Option B, C, and D are incorrect because they do not define these methods. And yes, the Java API does define a class called Class, though you do not need to know it for the exam

6. The SQL WHERE clause:

A.limits the column data that are returned. B.limits the row data are returned. C.Both A and B are correct. D.Neither A nor B are correct.

Answer: B

7. To define what columns should be displayed in an SQL SELECT statement:

A.use FROM to name the source table(s) and list the columns to be shown after SELECT. B.use USING to name the source table(s) and list the columns to be shown after SELECT. C.use SELECT to name the source table(s) and list the columns to be shown after USING. D.use USING to name the source table(s) and list the columns to be shown after WHERE.

Answer: A

8. The ODBC core API consists of which of the following functions

A.Commit or rollback transactions only B.Connect to data sources with driver-specific information only C.Connect to data sources only D.Both 1 and 3 above are in the OBDC core API.

Answer: D

9. The memory address of fifth element of an array can be calculated by the formula

A.LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array B.LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array C.LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array D.None of above

Answer: A

10. Which of the following is not a limitation of binary search algorithm?

A.must use a sorted array B.requirement of sorted array is expensive when a lot of insertion and deletions are needed C.there must be a mechanism to access middle element directly D.binary search algorithm is not efficient when the data elements are more than 1000.

Answer: D

11. SNAPSHOT is used for [DBA]

A.Synonym B.Table space C.System server D.Dynamic data replication

Answer: D

12. What is difference between a DIALOG WINDOW and a DOCUMENT WINDOW regarding moving the window with respect to the application window?

A.Both windows behave the same way as far as moving the window is concerned. B.A document window can be moved outside the application window while a dialog window cannot be moved C.A dialog window can be moved outside the application window while a document window cannot be moved D.None

Answer: C

13. What does DLL stands for?

A.Dynamic Language Library B.Dynamic Link Library C.Dynamic Load Library D.None of the above

Answer: B

14. Which Oracle access method is the fastest way for Oracle to retrieve a single row?

A.Primary key access B.Access via unique index C.Table access by ROWID D.Full table scan

Answer: A

15. void start()

{

A a = new A();

B b = new B();

a.s(b);

b = null; /* Line 5 */

a = null; /* Line 6 */

System.out.println(“start completed”); /* Line 7 */

}

When is the B object, created in line 3, eligible for garbage collection

A.after line 5

B.after line 6

C.after line 7

D.There is no way to be absolutely certain.

Answer: D

Solution: Option D is correct. I think there are too many unknowns about the method s and the classes A and B to be able to answer this question with any certainty.

16.int i,j;

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

{

j+=5;

assert(i<5);

}

A.Runtime error B.5 C.6 D.10

Answer: A

Solution: Runtime error: Abnormal program termination. assert failed (i<5), NOTE asserts are used during debugging to make sure that certain conditions are satisfied. If assertion fails, the program will terminate reporting the same. After debugging use, #undef NDEBUG and this will disable all the assertions from the source code. Assertion is a good debugging tool to make use of.

17. main()

{

int c[ ]={2.8,3.4,4,6.7,5};

int j,*p=c,*q=c;

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

{

printf(” %d “,*c);

++q;

}

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

{

printf(” %d “,*p);

++p;

}

}

A.2 2 2 2 2 2 3 4 6 5

B.2.8,3.4,4,6.7,5

C.Compiler error

D.None

Answer: A

Solution:

Initially pointer c is assigned to both p and q. In the first loop, since only q is incremented and not c , the value 2 will be printed 5 times. In second loop p itself is incremented. So the values 2 3 4 6 5 will be printed

18. main(int argc, char **argv)

{

printf(“enter the character”);

getchar();

sum(argv[1],argv[2]);

}

sum(num1,num2) int num1,num2;

{

return num1+num2

; }

A.2 B.3 C.Compile error D.None

Answer: C

Solution: argv[1] & argv[2] are strings. They are passed to the function sum without converting it to integer values.

19. #include

main()

{

char s[]={‘a’,’b’,’c’,’n’,’c’,’’};

char *p,*str,*str1;

p=&s[3];

str=p;

str1=s;

printf(“%d”,++*p + ++*str1-32);

}

A.77 B.Compiler error C.32 D.None

Answer: A

Solution: p is pointing to character ‘n’. str1 is pointing to character ‘a’ ++*p. “p is pointing to ‘n’ and that is incremented by one.” the ASCII value of ‘n’ is 10, which is then incremented to 11. The value of ++*p is 11. ++*str1, str1 is pointing to ‘a’ that is incremented by 1 and it becomes ‘b’. ASCII value of ‘b’ is 98. Now performing (11 + 98 – 32), we get 77(“M”); So we get the output 77 :: “M” (Ascii is 77).

20. #include

int main()

{

int j=1;

while(j <= 255)

{

printf(“%c %dn”, j, j);

j++;

}

return 0;

}

A.Infinite times

B.255 times

C.256 times

D.254 times

Answer: B

Solution: The while(j <= 255) loop will get executed 255 times. The size short int(2 byte wide) does not affect the while() loop.

Source: Contents are provided by Technicalsymposium Google Group Members.
Disclaimer: All the above contents are provided by technicalsymposium.com Google Group members.
Further, this content is not intended to be used for commercial purpose. Technicalsymposium.com is not liable/responsible for any copyright issues.

Placement Papers & Answers PDF-Download



Aptitude & Placement Papers & Answers PDF



Technicalsymposium.com-All Study Materials PDF-Free Download







Technicalsymposium.com-Free Live Support-Chat with Our Experts

Official Contact: +91-9245556793 (Whatsapp Message / SMS / Voice Call)


Our Expert team is ready to answer all your questions immediately-Feel free to speak in Tamil/English.

(Example:Events info/Lecture Notes/Off-Campus & All Jobs/Projects & All education information)

Working hrs (IST): (Morning: 10:00AM-3:00 PM) and (Evening:5:00 PM to 10:00 PM)

All Latest Question & Answer Page (FAQ)-Click here