DNIA

Subscribe DNIA...

Enter your email address:

Delivered by FeedBurner

For More Search Here...

Custom Search

Click More...

Click Here....

Thursday, December 4, 2008

Aptitude..

Verbal

1) STAR : CLUSTER:: ? :?

a) Orange : rind b) ???????? c) trees : clump d) mirror : reflection

2) GIBBLE : SENSE

3) GAUFFAW : LAUG

a) Sneeze : cough b) Whimper : cry …… c) ???????????????

4) PISTON : CYLINDER::?:?

a) SHAFT: ELEVATOR b) BULLET: REVOLVER c)???? d)???

Aptitude

1) abcD+abcd+aBCd+aBCD then the simplified function is ( Capital letters are copliments of corresponding

letters A=compliment of a)

[a] a [b] ab [c] abc [d] a(bc)* [e] none (bc)*=compliment of bc

2) A 12 address lines maps to the memory of

[a] 1k bytes [b] 0.5k bytes [c] 2k bytes [d] none

3) In a processor these are 120 instructions. Bits needed to implement this instructions

[a] 6 [b] 7 [c] 10 [d] none

4) In 8085 microprocessor READY signal does.which of the following is incorrect statements

[a]It is input to the microprocessor

[b] It sequences the instructions

5) Return address will be returned by function to

[a] Pushes to the stack by call

6) n=7623

{

temp=n/10;

result=temp*10+ result;

n=n/10

}

7) If A>B then

F=F(G);

else B>C then

F=G(G);

In this , for 75% times A>B and 25% times B>C then, is 10000 instructions are there ,then the ratio of F to G

[a] 7500:2500 [b] 7500:625 [c] 7500:625 if a=b=c else

8) In a compiler there is 36 bit for a word and to store a character 8bits are needed. IN this to store a

character two words are appended. Then for storing a K characters string, How many words are needed

[a] 2k/9 [b] (2k+8)/9 [c] (k+8)/9 [d] 2*(k+8)/9 [e] none

Technical

1) C program cod

int zap(int n)

{

if(n<=1)then zap=1;

else zap=zap(n-3)+zap(n-1);

}

then the call zap(6) gives the values of zap

[a] 8 [b] 9 [c] 6 [d] 12 [e] 15

2) Virtual memory size depends on

[a] address lines [b] data bus [c] disc space [d] a & c [e] none

3) Critical section is

[a]

[b] statements which are accessing shared resourses

4) Load a, mul a, store t1, load b, mul b, store t2, mul t2, add t1, then the content in accumulator is

5) question (3) in old paper

6) q(4) in old paper

7) The little indian representetion of 84 will be

a) 00001000 00000100 b) 00010000 00000100 c) 00001000 00000010

8) The standard for HTML is

a) HTML b) STML c) CGI d) DHTML

9) The standard for exchanging mails and communicat in files is

a) SMTP b) FTP c) HTTP d) ISP

10 The equivalent of NAND gate is

NAD with NOT b) OR with NOT c)NOT with OR

11) The operation to be performed on a stack using a linked list can be realised using the function

(A) delete front , instert rear (B) insert front , delete rear

(C) delete front , insert front (D) delete rear , insert rear

12) The binary equivalent of 188 is

13) what world wide network connects the largest number of servers and
computers

(A) WWW (B) HTTP (C) ARPANET (D) INTERNET

14. The network connecting all the networks are called : (A) INTERNET
15. The layer not present in TCP/IP model is:
(a) security layer (b)presentation layer (c)
16. Making use of objects with diferent ............. -polymorphism
17. Tree is a type of data structure

a) Primitive b) non- primitive
20. Unix is a _______ type of OS tree is a type of data structure
(a) multi user (b)multi tasking time sharing (c)single user
21. The protocol used to transfer web pages
(a)HTTP (b)FTP (c)TCP/IP .........
22. The data transfer ............memory ...............
(a)DMA
23. Mode of operation of stack............
(a)LIFO (b)FIFO (c)FCFS.......
24. What is ROM
(a) read only memory
25. address on the net is .......
(a)URL
26. Language for queries used in RDBMS
a)SQL ............

No comments: