=============================================================================================================
www.sanonline.com

Paper Model:
  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 quetion ->2 marks
													   -ve marks: -1
  Section IV:   Analytical                   Q.20     each quetion -> 2 marks. 
													   -ve marks: -1/4


Murthy from each section I am giving one are to quetions also because for
checking whether the same paper or not.
    And for doubtful answers also I am writing quetions but not writing answers
for these quetions.


								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

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 protocall in network and windows system

12) b		has to be unique in the sub network 

13)Q. there is an employer table with key feilds as employer no. data in every
 n'th row are needed for a simple following queries will get required results.

  a) select A employe no. from employe A , where exists from employe B
where A employe no. >= B employe having (count(*) mod n)=0 
  b) select employe no. from employe A, employe B where
A employe no. >= B employ no.   grouply employe no. having (count(*) mod n=0 )
  c) both a& b
  d)none of the above

14)Q. type duplicates of a row in a table customer with non uniform key feild
customer no. you can see

a) delete from costomer where customer no. exists 
( select distinct customer no. from customer having count )
b) delete customer a  where customer no. in
(select customer  b where custermer no. equal to b custemor no. ) and a rowid >
b rowid
c) delete customer a where custermor no. in 
( select customer no. from customer a, customer b )
d) none of the above

15)  c		Volatile modifier


----------   Section I over with 15 quetions   -------------------



 						SECTION-II

Section II is not covered completly But it is very very easy. You can do it 
 very easely.


1)   ans: 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=6,z=6
x=y==z;
printf(%d",x)    ?

4) if(x>2)?3:4  

5)

6) 

7)  ans: c  6  ( quetion on enum )

8) ----
---
---
--
14)  c : class A,B and C can have member  functions with same

=============================================================================================================
www.sanonline.com