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
14.
left recursion
15.
find output: for(l=1;a<=l;a++)
cout<<++a; cout << P>
16.
DEBUG trigger (oracle)
17.
In unrestricted session which system privilege mode is used (oracle)
18.
NEXTVAL and CURRENTVAL in sequence (Oracle)
19.
Unix system call ……like Var( )
20.
OS 384 support which memory management
21.
Complexity to access name from the given double link list
22.
Which WAN network is suitable for the 100Km or m. distance network
23.
If duplicate segments , file are there in hardisk which is best for management
a) FAT
b) SAT
24.
stop n wait protocol is associated with which layer
25.
find errors from the c and c++ codes.
26.
3 qns on operating systems. I qn on dijkestra algorithm
27.
Using which pin it's possible to address 16 bit addresses even though there re only 8 address bits in 8085? Ans: ALE
28.
Voltage gain for an amplifier is 100 while it is operating at 10 volts. What is the O/P voltage wen i/p is 1 volt
29.
Quality factor indicates a) Quality of inductor b) quality of capacitor c) both
30.
Qns related to bridges, routers and generators, which OSI layer they corresspond to. (Refer to stevens 4th chapter)
31.
OPAmp's I/P ciurrent, O/p current and CMRR is given, what is the voltage gain
32.
2-3 qns on scope of static variables in C. Qn to view o/p odf a C static var
33.
Qn to print a value of a pointer
34.
OPAmp's I/P ciurrent, O/p current and CMRR is given, what is the voltage gain
35.
A qn to find the physical address from a given virtual address, virtual to physical address table was provided
36.
6 bit mantissa and 8 bit exponent can present what maximum value?
37.
4 bit window size in sliding window protocol, how many acknowledements can be held?
38.
Security functionality is provided by which layer of OSI
39.
Frequency spectrums for AM, FM and PM (figure given, u'veto tell which Kind of modulation it belongs to)
40.
Among AM and FM which is better and why?
41.
LASt stage of TTL NAND gate is called: Ans: Totem Pole Amplifie
42.
SR to JK flip flop conversion. Ans: S=JQ', R=KQ
43.
LSB of a shift register is connected to its MSB, what is formed: Ans: RING Counter
44.
2-3 Qns based on Demorgan's laws (identiies: (A+b)' = A'b', etc)
45.
2 qns on Logic gates (O/p of logic gates)
46.
Diff in IRET and RET statements of 8086
47.
How many address bytes are required to address an array of memory chips (4 * 6), each chip having 4 memory bits and 8k registers.
48.
Diff. in memory mapped and I/P O/P mapped Input/Output (Refer a book on Microprocessor)
49.
Qn on pipeline architecture
50.
QN on LAPB protocol
Showing posts with label FLEXTRONICS Placement Paper. Show all posts
Showing posts with label FLEXTRONICS Placement Paper. Show all posts
Tuesday, August 26, 2008
FLEXTRONICS PLACEMENT PAPER-28th JULY 2006,BANGALORE
The paper contains the two sections
Section 1 (20 ques) contains all the questions related to quant's, simple mathematics, and
simple logical question. so asfar as theis section is concern u don't need any extra book
only R.S Aggarwal is sufficient. Section 2(30 ques) coice b/t CS paper and Electronics paper.
1.
nice('val')? unix command
2.
for(l=1;a<=l;a++)
cout<<++a;cout<
a.21
b.22
c.23
d.none
3.
nt a[4]={1,2,3,4};
array to the pointer?
a.int *a[4]
b.int (*a)[4]
4.
valid system prievlage in restricted seesion?
a. create user
b. create session
c. restricted session
5.
emaphore?
a. shared memory
b.......
6.
Semaphore?
a. shared memory
b.......
7.
which is used to store hard disk sector info
a. eerom
b. rom
c . ram
d. cmos
8.
If duplicate segments , file are there in hardisk which is best for management
a. fat
b. san
c. raid(may be)
d...........
9.
If a lan with 100mbps is there which wan can give same features?
a. atm
b. isdn
c. x.25
d. ....
10.
IPv6 has how many bytes for its address?
a. 8
b. 12
c. 16
11.
Sliding window in which layer?
a. session layer
b. transport layer
c. application layer
d. presentation layer
12.
when interupt occurs to cpu what happen?
13.
DEBUG trigger (oracle)
14.
order of insertion sort and Heap sort?
a. O(n**2),O(nlogn)
b.........
15.
NEXTVAL and CURRENTVAL in sequence (Oracle)?
16.
Which one is called family tree?
a. B+
b. Binary
c. AVL
17.
Intel 386 support which memory management?
a. paged
b. segmented
c. paged segmented
d........
18.
Complexity to access name from the given double link list?
|A|-->|B|
| |<--| |
a. O(n)
b. O(n**2)
c. O(nlogn)
19.
question on virtual function and overloading?
20.
question to find error in this C++ code.
21.
used for parse trees?
a. linked lists
b.....
22.
The question on RS232?
Section 1 (20 ques) contains all the questions related to quant's, simple mathematics, and
simple logical question. so asfar as theis section is concern u don't need any extra book
only R.S Aggarwal is sufficient. Section 2(30 ques) coice b/t CS paper and Electronics paper.
1.
nice('val')? unix command
2.
for(l=1;a<=l;a++)
cout<<++a;cout<
a.21
b.22
c.23
d.none
3.
nt a[4]={1,2,3,4};
array to the pointer?
a.int *a[4]
b.int (*a)[4]
4.
valid system prievlage in restricted seesion?
a. create user
b. create session
c. restricted session
5.
emaphore?
a. shared memory
b.......
6.
Semaphore?
a. shared memory
b.......
7.
which is used to store hard disk sector info
a. eerom
b. rom
c . ram
d. cmos
8.
If duplicate segments , file are there in hardisk which is best for management
a. fat
b. san
c. raid(may be)
d...........
9.
If a lan with 100mbps is there which wan can give same features?
a. atm
b. isdn
c. x.25
d. ....
10.
IPv6 has how many bytes for its address?
a. 8
b. 12
c. 16
11.
Sliding window in which layer?
a. session layer
b. transport layer
c. application layer
d. presentation layer
12.
when interupt occurs to cpu what happen?
13.
DEBUG trigger (oracle)
14.
order of insertion sort and Heap sort?
a. O(n**2),O(nlogn)
b.........
15.
NEXTVAL and CURRENTVAL in sequence (Oracle)?
16.
Which one is called family tree?
a. B+
b. Binary
c. AVL
17.
Intel 386 support which memory management?
a. paged
b. segmented
c. paged segmented
d........
18.
Complexity to access name from the given double link list?
|A|-->|B|
| |<--| |
a. O(n)
b. O(n**2)
c. O(nlogn)
19.
question on virtual function and overloading?
20.
question to find error in this C++ code.
21.
used for parse trees?
a. linked lists
b.....
22.
The question on RS232?
FLEXTRONICS PLACEMENT PAPER-6th JULY 2006,KANPURA
Section A
1.
Which of the folowing is not correct
a. (x+y)'=x'.y' b. (x'+y')'=x.y
c. (x'.y')'=x+y d. (x'+y')'=x'.y' [d]
2.
Question on logic ckt. U have to find the output ans. AB'+CD'+EF'
3.
Output of MUX
_________
c-----| |
c'----| |-------Y
c'----| | ans. A xor B xor C
c-----| |---------
| |
A B (select lines)
4.
If X and Y are two sets. |X| and |Y| are corresponding coordinates and exact no.of functions from X to Y is
97 then
a. |X|=97 |Y|=1 b. |X|=1 |Y|=97
c. |X|=97 |Y|=97 d. .....
5.
If two dies are thrown simultaneously what is the prob. of one of the dice getting face 6 ?
a. 11/36 b. 1/3 c. 12/35 d. 1/36 [a]
6.
The relation ,<,on reals is a. a partial order because of symmetric and reflexive
b. ... antisymmetric and ....
c. not ...... .. asymmetric and non reflexive
d. ... .... not anti-symm and non reflexive
7.
In C language the parameters are passsed by a. values b. name c.referrence d....
8.
Advantage of SRAM over DRAM ans. faster
9.
Diasy chaining related question (refer Z80)
a. uniform interrupt priority
b.non .... ....
c.interfacing slower peripherals
d.....
10.
RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines reqd. to access
each byte
a. 12 b. 16 c.15 d. 17
11.
Question related to AVL trees regarding how many no.of nodes to be changed to become balanced after
addition of a leaf node to a particular node. ans . 3
12.
When following sequence is insertedin the binary search tree no.of nodes in left and right subtrees 52 86 64 20
3 25 14 9 85
13.
Method used for Disk searching.. a.l inked list b. AVL c. B-tree d. binary tree
14.
Which of the following is correct statement.
a. 1's complement can have two zero re[resentations
b. 2's ... ... represent an extra neg. number
c. 2's & 1's have no difference in representing 16-bit no.
d.......
15.
AX=B where A is mXn ,b&X are column matrices of order m a. if m
b.if m=n, rank of A
16.
The option avialable in C++, not C:
a. dynamic scoping
b. declaration in the middle of code block
c. seperate compiled and linked units
d. ....
17.
int a[4]={1,2,3,4};
int *ptr;
ptr=a;
*(a+3)=*(++ptr)+(*ptr++);
A part of code is shown. The elements in A after the execution of this code.
a.1 2 3 4 b. 1 2 3 6
c. compilation error d.1 2 2 4 [a]
18.
Critical section program segment is
a. enclosed by semaphores with P & V operations
b. deadlock avoidance
c. where shared resources are accessed
d. ...
19.
when head is moving back and forth, the disk scheduling algorithm is _____
a) scan b) sstf c) fcfs d)....
20.
how many times the loop will execute
LOOP LXI B,1526H
DCX B
JNZ LOOP
a) 1526H times b) 31 c) 21 d) 38
21.
the addressing mode in which the address of the operand is expressed explicitly within the instruction
a) index addressing b) absolute c) indirect d) immediate
22.
(A - B) U (B - A) U (A ^ C) = ? where A,B are two sets A' , B' are compliments of A and B
a) A U B b) A ^ B c).... d)....
23.
The network that does not use virtual circuit
a) IP b) X.25 c).... d)..
24.
source routing bridge
a) source will route the frame
b) frame will routed with info in header
c).... d)..
25.
cache access time 100 msec. main memory access time 800 msec if the hit ratio is 95% , what is mean access
time ...
26.
The module that should be always reside in main memory is
a) loader b) link module c)... d)....
.... and some questions related to
1. addressing mode 2.assembler passes 3.linking and loading
4. file directory search 5. turning machine
6. finite state machine 7. daisy wheel
27.
The order of algorithm to merge the two sorted lists of lengths m and n is
a. O(m) b. O(n) c. O(m+n) d. O(log(m)+log(n))
28.
A chocolate block is of 4 X 4 size.How many cuts are needed to make 1 X 1 size blocks. No simultaneous
vert. & horz. cuts.
29.
Which among the following is not correct
a. O(n) > O(log n) .. likewise
Section C
1.
One question of Set Theory Like there Are two sets A and B and (A-B)union(B-A)union(A intersection B)
is equivalent to Ans. A union B
2.
Union and intersection are in there sign conventions.
3.
One question of probability Like between 100 and 999 how many no have the prob that they does not contain 7
Ans. 16/25 (not sure u can check by own)
4.
Of Newton Rapson method...
5.
Of power set A set contains {(fi),a,{a,b}} what is the powerset of it Ans. 8
6.
A question of logic gates Ans. U can got the answer very easily
7.
A question on the Booths algo Ans. The sequence is 1010101010101010
8.
Relative addressing mode is used for Ans. Dont know.
9.
For how many numbers there is no difference between little endian and big endian
Ans. 256
10.
For the multiplication of two 8 bit numbers how much ROM will be used
Ans. 64k*16 ROM(Check it)
11.
Why direct mapping is not good for the mapping of Cache Memory.
Ans. Dont know
12.
What is the main property of Desiy I/O Sytem Ans.
13.
A question on the nyquist theorem
Ans. 18000 bps
14.
What is the shannon theorem...
Ans. Refer to data communication(Stalling) book
15.
CSMA/CD protocol is used in
Ans. Ethernet
16.
What is the limitation of the Pulse Code Modulation
Ans. Refer to data communication book
17.
In CSMA/CD
Ans. The Access to the channnel is probabilistic.
18.
For an IP Router how many IP addresses
Ans. Check it i think Answer is Only One.
19.
Which protocol u used when you want to know the IP address corresponding to a MAC Address
Ans. RARP
20.
Which part of the IP header is used for the time limit of the packet.
Ans. TTL
21.
Which PageReplacement algo will give the best result
Ans. By replacing that page which has the next reference after a long time.(optimal algo)
22.
What the code will be said when it is called by another part and it is not completed yet
Ans. Reentrant Code.
23.
three questions on the simple programs
24.
There is a sequence of no and prepare a binary tree and tell how many nodes are in the left and right sub tree.
Ans. Check it Ans (4,7)
25.
hat is the rank of the graph
Ans. e-n+k
26.
One question on the multithreading
27.
Which traversal of the tree gives the node in the ascending order.
Ans. Inorder
28.
Which traversal of the tree gives the node in the ascending order.
Ans. Inorder
29.
What is garbage collector.
1.
Which of the folowing is not correct
a. (x+y)'=x'.y' b. (x'+y')'=x.y
c. (x'.y')'=x+y d. (x'+y')'=x'.y' [d]
2.
Question on logic ckt. U have to find the output ans. AB'+CD'+EF'
3.
Output of MUX
_________
c-----| |
c'----| |-------Y
c'----| | ans. A xor B xor C
c-----| |---------
| |
A B (select lines)
4.
If X and Y are two sets. |X| and |Y| are corresponding coordinates and exact no.of functions from X to Y is
97 then
a. |X|=97 |Y|=1 b. |X|=1 |Y|=97
c. |X|=97 |Y|=97 d. .....
5.
If two dies are thrown simultaneously what is the prob. of one of the dice getting face 6 ?
a. 11/36 b. 1/3 c. 12/35 d. 1/36 [a]
6.
The relation ,<,on reals is a. a partial order because of symmetric and reflexive
b. ... antisymmetric and ....
c. not ...... .. asymmetric and non reflexive
d. ... .... not anti-symm and non reflexive
7.
In C language the parameters are passsed by a. values b. name c.referrence d....
8.
Advantage of SRAM over DRAM ans. faster
9.
Diasy chaining related question (refer Z80)
a. uniform interrupt priority
b.non .... ....
c.interfacing slower peripherals
d.....
10.
RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines reqd. to access
each byte
a. 12 b. 16 c.15 d. 17
11.
Question related to AVL trees regarding how many no.of nodes to be changed to become balanced after
addition of a leaf node to a particular node. ans . 3
12.
When following sequence is insertedin the binary search tree no.of nodes in left and right subtrees 52 86 64 20
3 25 14 9 85
13.
Method used for Disk searching.. a.l inked list b. AVL c. B-tree d. binary tree
14.
Which of the following is correct statement.
a. 1's complement can have two zero re[resentations
b. 2's ... ... represent an extra neg. number
c. 2's & 1's have no difference in representing 16-bit no.
d.......
15.
AX=B where A is mXn ,b&X are column matrices of order m a. if m
b.if m=n, rank of A
16.
The option avialable in C++, not C:
a. dynamic scoping
b. declaration in the middle of code block
c. seperate compiled and linked units
d. ....
17.
int a[4]={1,2,3,4};
int *ptr;
ptr=a;
*(a+3)=*(++ptr)+(*ptr++);
A part of code is shown. The elements in A after the execution of this code.
a.1 2 3 4 b. 1 2 3 6
c. compilation error d.1 2 2 4 [a]
18.
Critical section program segment is
a. enclosed by semaphores with P & V operations
b. deadlock avoidance
c. where shared resources are accessed
d. ...
19.
when head is moving back and forth, the disk scheduling algorithm is _____
a) scan b) sstf c) fcfs d)....
20.
how many times the loop will execute
LOOP LXI B,1526H
DCX B
JNZ LOOP
a) 1526H times b) 31 c) 21 d) 38
21.
the addressing mode in which the address of the operand is expressed explicitly within the instruction
a) index addressing b) absolute c) indirect d) immediate
22.
(A - B) U (B - A) U (A ^ C) = ? where A,B are two sets A' , B' are compliments of A and B
a) A U B b) A ^ B c).... d)....
23.
The network that does not use virtual circuit
a) IP b) X.25 c).... d)..
24.
source routing bridge
a) source will route the frame
b) frame will routed with info in header
c).... d)..
25.
cache access time 100 msec. main memory access time 800 msec if the hit ratio is 95% , what is mean access
time ...
26.
The module that should be always reside in main memory is
a) loader b) link module c)... d)....
.... and some questions related to
1. addressing mode 2.assembler passes 3.linking and loading
4. file directory search 5. turning machine
6. finite state machine 7. daisy wheel
27.
The order of algorithm to merge the two sorted lists of lengths m and n is
a. O(m) b. O(n) c. O(m+n) d. O(log(m)+log(n))
28.
A chocolate block is of 4 X 4 size.How many cuts are needed to make 1 X 1 size blocks. No simultaneous
vert. & horz. cuts.
29.
Which among the following is not correct
a. O(n) > O(log n) .. likewise
Section C
1.
One question of Set Theory Like there Are two sets A and B and (A-B)union(B-A)union(A intersection B)
is equivalent to Ans. A union B
2.
Union and intersection are in there sign conventions.
3.
One question of probability Like between 100 and 999 how many no have the prob that they does not contain 7
Ans. 16/25 (not sure u can check by own)
4.
Of Newton Rapson method...
5.
Of power set A set contains {(fi),a,{a,b}} what is the powerset of it Ans. 8
6.
A question of logic gates Ans. U can got the answer very easily
7.
A question on the Booths algo Ans. The sequence is 1010101010101010
8.
Relative addressing mode is used for Ans. Dont know.
9.
For how many numbers there is no difference between little endian and big endian
Ans. 256
10.
For the multiplication of two 8 bit numbers how much ROM will be used
Ans. 64k*16 ROM(Check it)
11.
Why direct mapping is not good for the mapping of Cache Memory.
Ans. Dont know
12.
What is the main property of Desiy I/O Sytem Ans.
13.
A question on the nyquist theorem
Ans. 18000 bps
14.
What is the shannon theorem...
Ans. Refer to data communication(Stalling) book
15.
CSMA/CD protocol is used in
Ans. Ethernet
16.
What is the limitation of the Pulse Code Modulation
Ans. Refer to data communication book
17.
In CSMA/CD
Ans. The Access to the channnel is probabilistic.
18.
For an IP Router how many IP addresses
Ans. Check it i think Answer is Only One.
19.
Which protocol u used when you want to know the IP address corresponding to a MAC Address
Ans. RARP
20.
Which part of the IP header is used for the time limit of the packet.
Ans. TTL
21.
Which PageReplacement algo will give the best result
Ans. By replacing that page which has the next reference after a long time.(optimal algo)
22.
What the code will be said when it is called by another part and it is not completed yet
Ans. Reentrant Code.
23.
three questions on the simple programs
24.
There is a sequence of no and prepare a binary tree and tell how many nodes are in the left and right sub tree.
Ans. Check it Ans (4,7)
25.
hat is the rank of the graph
Ans. e-n+k
26.
One question on the multithreading
27.
Which traversal of the tree gives the node in the ascending order.
Ans. Inorder
28.
Which traversal of the tree gives the node in the ascending order.
Ans. Inorder
29.
What is garbage collector.
FLEXTRONICS Placement Paper-6th AUG 2006,BANGALORE
1.
What is max. no. of hops in hypercube n/w with n (=2 ^ p) to go from one node to another ?
a. p
b. log p
c. n ^ 2
2.
What is Kerberos ? ans. Authentication Protocol.
3.
In completely connected multiprocessor system with n processors , links will be of the order of
a. O(n ^ 2)
b. O(2 ^ n)
c. O(n/2)
4.
When quick sort gives worst performance ? ans. When elements are in order
5.
o/p of each sorting step of 8 elements was given and had to recognise which sorting algo.?
Ans. Bubble sort (Not Sure , Check it out )
6.
In worst case ,which sort is best out of following sorts?
a. heap
b. selection
c. quick (ans.)
d. insertion
7.
hree very simple gate circuits each having inputs A,B,C,D were given and had to tell ,which two give same result ? (DeMorgan's Law was used in solving ) Ans was (a) &(c) (o/p of a & c was coming to be AB +CD)
8.
K-map given,had to tell simplified function Ans was perhaps AB+AD +AC+BCD
K-Map was CD`
AB 0 0 0 0
0 0 1 0
1 1 1 1
0 1 1 1
9.
What is Function Point ? Ans. S/W estimation technique
10.
p points to an integer. We don't want p to change value. In C, what declarations will we use?
A const int *p
b. int *p
c. int const *p
e. int* const p (perhaps ans.)
11.
Diff between 2NF &3NF ? Ans. D (last option)
12.
Which does not use client server model ?
a. Email
b. Web access
c. C. Telephone call
d. N/w file system
13.
In a pipeline having 3 stages, each having reliability of 0.9 ,what is overall reliability of pipeline?
a. 0.9
b. 0.729
c. 0.81
14.
2level cacheis there first level cache's access time is 100ns,second level cache's access time is 33ns & memory access time is 1000 ns . What is total memory access time ? ans. 140 ns
15.
In public key cryptography,Awillsend message to B ans. Using B's public key
16.
What does projection of a relation give? Ans.gives vertical partition of relation corresponding to specified columns.
17.
For disk or direct access storage, which is best ?
a. AVL
b. B-tree
c. Red tape .
18.
There is a tree with inorder threading Node B is inserted as left child of nade A. Node A already has right child . Where will the null ptr of B point ? ans. Parent of A (perhaps)
19.
There is a diskless workstation. Which will be the first protocol it will use ?
a FTP
b. ARP
c. HTTP
d. RARP
20.
Compiler keeps which of following ? ans. Symbol table
21.
ping' command uses which protocol ? ans. ICMP
22.
Merge sort uses which technique? Ans. Divide and Conquer
23.
Program counter is incremented in
a. fetch (ans)
b. decode
c. execute
24.
what does the following program do ?
f(int n)
{
int c;
while(n)
{
n&=n-1;
c++;
}
print c;
}
ans. Program prints the no. of set bits in no.
25.
-What is this called (char *) (*(*(*A[X]) ( ) )) ( )
ans. Array of X pointers to a function returning pointer to functions that are returning pointer to char (not sure )
26.
For synchronisation in distributed computing, what should not be there ?
a. all machines are synchronised by a global clock
b. all systems should have their own clock (perhaps ans)
27.
Java applet of a moving /waving file is running on one machine then it means
a. Java's executable code is downloaded and running on the m/c
b. A virtual X server is running on that m/c while the actual program is running on the web server.
28.
What is in RSA algo. ?
a. First the session key is encrypted & then whole message is encrypted using RSA Algo.
b. Message is encrypted using RsA algo.
c. First Rsa algo is used &then encrypted with the session key.
29.
-What is dirty read?
a. Transaction reexecutes and gives diff. Results from the original execution
b. Read is done when the transaction is not yet committed
30.
-What is coupling ?
a. It tells the strength of interconnection between two program units.
b. It tells the strength of interconnection between twtrength of interconnection between two program units.
31.
Any n/w on the computer can have only
a. one domain &one IP
b. more than one domain & more than one Ip
c. one domain and more than one IP
d. more than one domain & one IP
32.
Which one does not have file descriptor ?
a. process
b. keyboard
c. pipe
d. socket
33.
What does CONNECT BY means
a. connect to a different databaser for retreival
b. arrange in tree ordered structure
34.
n two phase commit protocol, why log is used during transmission &reception ?
a. To retrieve the status in case of crash
35.
n which algo. Waiting time is minimun?
Ans, SJF
36.
How many address bits are there in Ipv6
ans. 128 bits
37.
During run time heap is managed by
a. a user process in kernel mode
b. A system process manages heap for all the processes
c. A system process for each process
d. A user process in user mode
38.
In which of following search is efficient?
a. height balanced tree
b. Weight balanced tree
c. Binary tree
39.
A ques. on resource relocation, sharing ( I don't remember more than this regarding this ques.)
40.
some ques. options were sth like
a. transparency control
b. Migration control
c. Concurrency control
41.
X:In DFD, input is converted into output by passing through various functional units Y:DFD cannot be used in object oriented design
a. both X& y are correct
b. both X & Y are incorrect
c. X correct, Y incorrect
d. Xincorrect, Y correct
42.
Where regression testing is used ?
a. Dynamic analysers
b. Loaders
43.
For Java interfaces , what is true ?
a. Functions declarations are not given'
b. Variables are not declared
c. Instance variables are not used
44.
n a linked list, we can delete a node in order of
a. 1
b. n
c. n ^ 2
45.
f there are N people and we have to do symmetric & asymmetric cryptography, how many keys would
be used in these cases respectively?
a. N & N ^ 2 (probably ans)
b. N ^ 2 & N
c. N & N
d. N ^ 2 & N ^2
46.
The protected element of a class can't be accessed by
a. member functions of the same class
b. member functions of the derived class
c. member functions of any other class in the same program (Ans.)
47.
NFS uses same file structure as unix
48.
To solve an expression which of following trees will you use ?
a. postfix
b. infix
Technical
1.
void x(char* a)
{
(a[0])?x(a+1):1;
printf("%c",*(a+0));
return 1;
........;
}
Input string 'a' is assigned as AaBbCc , what is the output?
Ans.-cCbBaA
2.
A question on digital gates ANS is OR gate.
3.
What is the binary representation of 41.6785
4.
If the precondition for a subroutine does not hold then
1. postcondition does not hold
2. postcondition may or may not hold
3 . ?
4. ?
5.
In java
1. java strings are mutable. And some other options on java strings
6.
Void f(char *p)
{
p = (char*)malloc(6);
strcpy(p,"hello");
}
void main( )
{
char *p = "BYE";
f(p);
printf("%s",p);
}
ANS BYE
7.
A question on write through and write back algo.
8.
What is concerned with transport layer. Ans PORT.
9.
A server can work with ip and ipx protocol.how the server will determine to which protocol the incoming packet coresponds .
10.
For which purpose dhcp is used ANS ip address
11.
global vaariable defined as ststic will serve the purpose of ---
12.
Question on NFS ANS It uses the same semantics as unix for file system
13.
Program counter is incremented typically in which uses ANS fetch
14.
NO of NULL pointers in a tree with n leaf nodes ANS N+1
15.
thread take less time than process context Why? Ans. Address space is same.
16.
Which algo is best for sorting 10 elements? Ans. 1> binary tree 2> selection 3> bubble 4> none
17.
question on ICV(networking)
a) When A sends an ICV and message, B computes ICV , checks It with given ICV,and decodes Message
b) Similar other
18.
8 When server A sends a time request to server B, (time synchronization), and response becomes past, What does A do?
a) resets its own clock
b) resends time request again
19.
9 in public key encryption what does A do such that It is not visible to others?
a) A uses public key part of A
b) A uses private key part of A
c) A uses public key part of B
d) A uses private key part of B
20.
function dependency can be described as:
21.
on findind cyclometric complexity of the given program 1> 7 2>5 3> 4 4> 0
22.
Codd's rule related to database
23.
path testing comes under
A) white box
B) black box
24.
when an ip address is not in the computer adresss resolution file what does It do with that packet
a) Ignores It
c) sends It to default gateway
d) sends It to ethernet server
25.
Execution divided in different stages then this is called ANS. Pipelining
26.
In C the macros are ANS. converted in to inline code during preprocessing
27.
X: verification means doing the right things
Y: validation means doing things right
a. both true
b. both false
c. one true one correct
28.
void insert (key, r) Keytype key, data
{
if (n>=max)
ERROR
Else
R[n++].key=k;
Which is best? 1. sequential search
29.
which is best for associative list searching?
1) single linked list
2) doubly linked list
3) hash table
30.
A question based on SQL ?
31.
which is not necessary condition for deadlock?
1. mutual exclusion
2. no preemption
3. is ANS.
4. Circular wait
What is max. no. of hops in hypercube n/w with n (=2 ^ p) to go from one node to another ?
a. p
b. log p
c. n ^ 2
2.
What is Kerberos ? ans. Authentication Protocol.
3.
In completely connected multiprocessor system with n processors , links will be of the order of
a. O(n ^ 2)
b. O(2 ^ n)
c. O(n/2)
4.
When quick sort gives worst performance ? ans. When elements are in order
5.
o/p of each sorting step of 8 elements was given and had to recognise which sorting algo.?
Ans. Bubble sort (Not Sure , Check it out )
6.
In worst case ,which sort is best out of following sorts?
a. heap
b. selection
c. quick (ans.)
d. insertion
7.
hree very simple gate circuits each having inputs A,B,C,D were given and had to tell ,which two give same result ? (DeMorgan's Law was used in solving ) Ans was (a) &(c) (o/p of a & c was coming to be AB +CD)
8.
K-map given,had to tell simplified function Ans was perhaps AB+AD +AC+BCD
K-Map was CD`
AB 0 0 0 0
0 0 1 0
1 1 1 1
0 1 1 1
9.
What is Function Point ? Ans. S/W estimation technique
10.
p points to an integer. We don't want p to change value. In C, what declarations will we use?
A const int *p
b. int *p
c. int const *p
e. int* const p (perhaps ans.)
11.
Diff between 2NF &3NF ? Ans. D (last option)
12.
Which does not use client server model ?
a. Email
b. Web access
c. C. Telephone call
d. N/w file system
13.
In a pipeline having 3 stages, each having reliability of 0.9 ,what is overall reliability of pipeline?
a. 0.9
b. 0.729
c. 0.81
14.
2level cacheis there first level cache's access time is 100ns,second level cache's access time is 33ns & memory access time is 1000 ns . What is total memory access time ? ans. 140 ns
15.
In public key cryptography,Awillsend message to B ans. Using B's public key
16.
What does projection of a relation give? Ans.gives vertical partition of relation corresponding to specified columns.
17.
For disk or direct access storage, which is best ?
a. AVL
b. B-tree
c. Red tape .
18.
There is a tree with inorder threading Node B is inserted as left child of nade A. Node A already has right child . Where will the null ptr of B point ? ans. Parent of A (perhaps)
19.
There is a diskless workstation. Which will be the first protocol it will use ?
a FTP
b. ARP
c. HTTP
d. RARP
20.
Compiler keeps which of following ? ans. Symbol table
21.
ping' command uses which protocol ? ans. ICMP
22.
Merge sort uses which technique? Ans. Divide and Conquer
23.
Program counter is incremented in
a. fetch (ans)
b. decode
c. execute
24.
what does the following program do ?
f(int n)
{
int c;
while(n)
{
n&=n-1;
c++;
}
print c;
}
ans. Program prints the no. of set bits in no.
25.
-What is this called (char *) (*(*(*A[X]) ( ) )) ( )
ans. Array of X pointers to a function returning pointer to functions that are returning pointer to char (not sure )
26.
For synchronisation in distributed computing, what should not be there ?
a. all machines are synchronised by a global clock
b. all systems should have their own clock (perhaps ans)
27.
Java applet of a moving /waving file is running on one machine then it means
a. Java's executable code is downloaded and running on the m/c
b. A virtual X server is running on that m/c while the actual program is running on the web server.
28.
What is in RSA algo. ?
a. First the session key is encrypted & then whole message is encrypted using RSA Algo.
b. Message is encrypted using RsA algo.
c. First Rsa algo is used &then encrypted with the session key.
29.
-What is dirty read?
a. Transaction reexecutes and gives diff. Results from the original execution
b. Read is done when the transaction is not yet committed
30.
-What is coupling ?
a. It tells the strength of interconnection between two program units.
b. It tells the strength of interconnection between twtrength of interconnection between two program units.
31.
Any n/w on the computer can have only
a. one domain &one IP
b. more than one domain & more than one Ip
c. one domain and more than one IP
d. more than one domain & one IP
32.
Which one does not have file descriptor ?
a. process
b. keyboard
c. pipe
d. socket
33.
What does CONNECT BY means
a. connect to a different databaser for retreival
b. arrange in tree ordered structure
34.
n two phase commit protocol, why log is used during transmission &reception ?
a. To retrieve the status in case of crash
35.
n which algo. Waiting time is minimun?
Ans, SJF
36.
How many address bits are there in Ipv6
ans. 128 bits
37.
During run time heap is managed by
a. a user process in kernel mode
b. A system process manages heap for all the processes
c. A system process for each process
d. A user process in user mode
38.
In which of following search is efficient?
a. height balanced tree
b. Weight balanced tree
c. Binary tree
39.
A ques. on resource relocation, sharing ( I don't remember more than this regarding this ques.)
40.
some ques. options were sth like
a. transparency control
b. Migration control
c. Concurrency control
41.
X:In DFD, input is converted into output by passing through various functional units Y:DFD cannot be used in object oriented design
a. both X& y are correct
b. both X & Y are incorrect
c. X correct, Y incorrect
d. Xincorrect, Y correct
42.
Where regression testing is used ?
a. Dynamic analysers
b. Loaders
43.
For Java interfaces , what is true ?
a. Functions declarations are not given'
b. Variables are not declared
c. Instance variables are not used
44.
n a linked list, we can delete a node in order of
a. 1
b. n
c. n ^ 2
45.
f there are N people and we have to do symmetric & asymmetric cryptography, how many keys would
be used in these cases respectively?
a. N & N ^ 2 (probably ans)
b. N ^ 2 & N
c. N & N
d. N ^ 2 & N ^2
46.
The protected element of a class can't be accessed by
a. member functions of the same class
b. member functions of the derived class
c. member functions of any other class in the same program (Ans.)
47.
NFS uses same file structure as unix
48.
To solve an expression which of following trees will you use ?
a. postfix
b. infix
Technical
1.
void x(char* a)
{
(a[0])?x(a+1):1;
printf("%c",*(a+0));
return 1;
........;
}
Input string 'a' is assigned as AaBbCc , what is the output?
Ans.-cCbBaA
2.
A question on digital gates ANS is OR gate.
3.
What is the binary representation of 41.6785
4.
If the precondition for a subroutine does not hold then
1. postcondition does not hold
2. postcondition may or may not hold
3 . ?
4. ?
5.
In java
1. java strings are mutable. And some other options on java strings
6.
Void f(char *p)
{
p = (char*)malloc(6);
strcpy(p,"hello");
}
void main( )
{
char *p = "BYE";
f(p);
printf("%s",p);
}
ANS BYE
7.
A question on write through and write back algo.
8.
What is concerned with transport layer. Ans PORT.
9.
A server can work with ip and ipx protocol.how the server will determine to which protocol the incoming packet coresponds .
10.
For which purpose dhcp is used ANS ip address
11.
global vaariable defined as ststic will serve the purpose of ---
12.
Question on NFS ANS It uses the same semantics as unix for file system
13.
Program counter is incremented typically in which uses ANS fetch
14.
NO of NULL pointers in a tree with n leaf nodes ANS N+1
15.
thread take less time than process context Why? Ans. Address space is same.
16.
Which algo is best for sorting 10 elements? Ans. 1> binary tree 2> selection 3> bubble 4> none
17.
question on ICV(networking)
a) When A sends an ICV and message, B computes ICV , checks It with given ICV,and decodes Message
b) Similar other
18.
8 When server A sends a time request to server B, (time synchronization), and response becomes past, What does A do?
a) resets its own clock
b) resends time request again
19.
9 in public key encryption what does A do such that It is not visible to others?
a) A uses public key part of A
b) A uses private key part of A
c) A uses public key part of B
d) A uses private key part of B
20.
function dependency can be described as:
21.
on findind cyclometric complexity of the given program 1> 7 2>5 3> 4 4> 0
22.
Codd's rule related to database
23.
path testing comes under
A) white box
B) black box
24.
when an ip address is not in the computer adresss resolution file what does It do with that packet
a) Ignores It
c) sends It to default gateway
d) sends It to ethernet server
25.
Execution divided in different stages then this is called ANS. Pipelining
26.
In C the macros are ANS. converted in to inline code during preprocessing
27.
X: verification means doing the right things
Y: validation means doing things right
a. both true
b. both false
c. one true one correct
28.
void insert (key, r) Keytype key, data
{
if (n>=max)
ERROR
Else
R[n++].key=k;
Which is best? 1. sequential search
29.
which is best for associative list searching?
1) single linked list
2) doubly linked list
3) hash table
30.
A question based on SQL ?
31.
which is not necessary condition for deadlock?
1. mutual exclusion
2. no preemption
3. is ANS.
4. Circular wait
Subscribe to:
Posts (Atom)