It's Placement
Time
All the following questions are memory based and have been
submitted by candidates who appeared for the tests/interviews in the
past.
Model Paper :
In written test in each section you have to get minimum marks i.e
you have to pass in each section. There will be questions from C,
C++, JAVA. About 10 questions in C++ in the written test.
Section I:
Computer Awareness (general info. about computer) 15 questions
-ve marks: 1/4
Section II:
Simple C- language Q.-- 15 & -ve marks: -1/4
Section III:
On pointers & structures and C++,JAVA( only 1 on this) Q.10
each question ->2 marks -ve marks: -1
Section IV: Analytical Q.--20 each question -> 2 marks. -ve
marks: -1/4
Questions from systems:
Section 1:
Q. Piggy backing refers to....
Ans:
acknowledgement
Q. OSI emulation layer ?
Ans: application
layer
Q. Parity error checking is used for...?
Ans: odd numbers of
errors
Q. In a 20Mhz computer, the time taken for a 3clock cycle
instruction is... Ans: 120 ns (check)
Q. convert 0xFFE into radix 7
Q. Internet IP address is unique for Ans: domain of the node
(check)
Section 2:
Q. Comparison of java and C
The feature present in C but not in java (a) recursion (b)
Passing variable arguments (c).... (d)...
Programs
1.main() { int y = 10; if(y++ == 10 && y++ != 10
&& y++ > 11) printf("%d",y); else printf("2y =
%d",2*y); }
2.void funca(p) int *p; { *p += 20; } void
funcb(m) int *m; { int n; m = &n; *m +=
10; } main() { int var = 25; int *varp; varp =
&var; funca(varp); *varp +=
10; funcb(varp); printf("%d...%d",var,*varp); }
3.main() { static int *p = 100; char *q =
p; p++; q++; printf("%d...%d",p,q); } /* don't run
it. Its a Java program */ /* find the error if any */
class A { static final int var = 10; private : int
obj1; public : char obj2[]="some
string"; func() { var =
15; system.out.obj1; system.out.obj2; } } choices:
1) There is no semicolon at the end of the class 2) The
variable var cann't be changed after declaration 3) Class A has
not been declared as of public type 4) string can not be printed
directly
Q. Declare static int i; globally 1) the variable is available
for all the functions after its declaration 2) the variable
is not available for other than the current program 3)
..... 4) .....
static int i; main() { void
fun1(); printf("%d\n",i); fun1(); } void
fun1() { printf("%d\n",i); }
Model Paper:
Section I: computer awareness(i.e general things about computer)
Q.15 -ve marks: 1/4
Section II: Simple C- language Q. 15 & -ve marks: -1/4
Section III: On pointers & structures and C++,JAVA( only 1 on
this) Q.10 each question ->2 marks -ve marks: -1
Section IV: Analytical Q.20 each question -> 2 marks. -ve
marks: -1/4
Section-I
1). Piggy backing is a technique for a) Flow control b)
sequence c) Acknowledgement d) retransmition ans: c
piggy backing
2). The layer in the OST model handles terminal emulation a)
session b) application c) presentation d)
transport ans: b application
3) ans: a odd numbers of errors
4)Q. In signed magnitude notation what is the minimum value that
can be represented with 8 bits a) -128 b) -255 c) -127 d)
0 ans: a)
5) c 20
6) a 120
7) b synchronise the access
8) a system call
9) b the operating system
10) a 177333
11) d used as a network layer protocol in network and windows
system
12) b has to be unique in the sub network
13) there is an employer table with key fields as employer no.
data in every n'th row are needed for a simple following queries
will get required results. a) select A employee no. from employee
A , where exists from employee B where A employee no. >= B
employee having (count(*) mod n)=0 b) select employee no. from
employee A, employee B where A employee no. >= B employee no.
group employee no. having (count(*) mod n=0 ) c) both a&
b d)none of the above
14) type duplicates of a row in a table customer with non uniform
key field customer no. you can see a) delete from customer where
customer no. exists (
select distinct customer no. from customer having count ) b)
delete customer a where customer no. in (select customer b where customer no.
equal to b customer no. ) and a rowid > b rowid c) delete customer a where
customer no. in ( select
customer no. from customer a, customer b ) d) none of the
above
15) c Volatile modifier
---------- Section I over with 15 questions
-------------------
SECTION-II
Section II is not covered completely But it is very very easy.
You can do it very easily.
1) Question on Recursion
2) long int size a) 4 bytes b) 2 bytes c) compiler dependent d) 8
bytes ans: compiler dependent note: order of
a,b,c,d are doubt but answer is correct.
3) x=2,y=4,z=6 x=y==z; printf(%d",x) ? ans: 0
4) if(x>2)?3:4
SECTION-III
1) ans: b It does not work when rp is the last element in the
linked list
2) ans: a always
3) ans: b 13
4) ans: b 16
5) ans: d 55,55
6) ans: c 5,10,10,3
7) ---
8) ans:d 4
9) ans: c 5
10)ans: c semicolon missing
SECTION-IV
following are not in order:
2. M > D > Y ans: (a)
6. 10 in 4 seconds,
? in 6 minutes = 10x6x60/4 = 900
7. a=2, b=4, c=5
(a+b)/c - c/(a+b) = 11/30 (ans).
8. 100(100000000+100000000)/10000 = 2x1000000 (ans).
9. what does the hexanumber E78 in radix 7.
(a) 12455 (b) 14153 (c) 14256 (d) 13541 (e) 131112 ans: (d)
10. Q is not equal to zero and k = (Q x n - s)/2 find n?
(a) (2 x k + s)/Q (b) (2 x s x k)/Q (c) (2 x k - s)/Q
(d) (2 x k + s x Q)/Q (e) (k + s)/Q
data:
A causes B or C, but not both F occurs only if B
occurs D occurs if B or C occurs E occurs only if C
occurs J occurs only if E or F occurs D causes G,H or
both H occurs if E occurs G occurs if F occurs
NOTE: check following answers.
11. If A occurs which of the following must occurs I. F &
G II. E and H III. D (a) I only (b) II only (c) III only
(d) I,II, & III (e) I
& II (or) II & III but not both ans: (e)
12. If B occurs which must occur (a) D (b) D and G (c) G
and H (d) F and G (e) J ans: (a)
13. If J occurs which must have occurred (a) E (b) either B or
C (c) both E & F (d) B (e) both B & C ans: (b)
14. which may occurs as a result of cause not
mentioned (1) D (2) A (3) F (a) 1 only (b) 2 only (c) 1
& 2 (d) 2 & 3 (e) 1,2,3 ans: (c)
15. E occurs which one cannot occurs (a) A (b) F (c) D
(d) C (e) J ans: (b)
11 to 15:- ----------- e , a , b , c , b ---------------
|