CSC Placement-Paper

Aptitude Interview IT Company Practice Paper Quantitative

Hi frnds…I’ve attenaded the CSC recruitment which held in BITS,warangal through JKC..i am shiva  from CSE.The recruitment process is as follows:

  1. Presentation
  2. Technical test and Aptitude Test.
  3. JAM(JUST A MINUTE)
  4. TECHNICAL INTERVIEW
  5. HR INTERVIEW

PRESENTATION

In the presentation,the company had made a brief introduction of their firm , with selection process details and job profile and so on..It lasted for about half an hour or so…

1.  TECHNICAL & APTITUDE TEST:

First,they gave the technical paper to solve..It consistd of 75 qstns to be solved in 40 minutes.It was like a piece of cake for me to solve the paper.plss read the qstns and answers which i give and all are right answers…prepare previous papers ,its enough..and aptitude paper consists of 40 questions in 40 mins.tech paper is very easy….but  aptitude is tuff……prepare aptitude……… the tech paper is asa follows

1.WSDL is associated with webservices.

2.BLOB is any large single block of data stored in a database, such as a picture or sound file, which does not include record fields, and cannot be directly searched by the database’s search engine.

3. cache memory is a reserved area of the immediate access memeory used to increase the running speed of the computer program.

4. DMZ  is a small subnet that sit between atrusted internal network and an untruster external network, such as the public internet.

5.RFID technologies that use radio waves to automatically identify people or objects,which is very similar to the barcode identification systems,seen in retail stores everyday.

6.main(){

float fl = 10.5;

double dbl = 10.5

if(fl ==dbl)

printf(“UNITED WE STAND”);

else

printf(“DIVIDE AND RULE”)

}

what is the output? UNITED WE STAND

7.main(){

static int ivar = 5;

printf(“%d”,ivar–);

if(ivar)

main();

}

what is the output? 5 4 3 2 1

8.main()

{

extern int iExtern;

iExtern = 20;

printf(“%d”,iExtern);

}

what is the output? linker error

9..#define clrscr() 100

main(){

clrscr();

printf(“%d\n\t”, clrscr());

}

what is the output? 100

10.main()

{

void vpointer;

char cHar = ‘g’, *cHarpointer = “GOOGLE”;

int j = 40;

vpointer = &cHar;

printf(“%c”,*(char*)vpointer);

vpointer = &j;

printf(“%d”,*(int *)vpointer);

vpointer = cHarpointer;

printf(“%s”,(char*)vpointer +3);

}

what is the output? g40GLE

11.#define FALSE -1

#define TRUE 1

#define NULL 0

main() {

if (NULL)

puts (“NULL”);

else if(FALSE)

puts (“TRUE”);

else

puts (“FALSE”);

}

what is the output? TRUE 

12.main() {

int i =5,j= 6, z;

printf(“%d”,i+++j);

}

what is the output? 11 

13.main() {

int i ;

i = accumulator();

printf(“%d”,i);

}

accumulator(){

_AX =1000;

}

what is output? 1000

14.main() {

int i =0;

while(+(+i–)!= 0)

i- = i++;

printf(“%d”,i);

}

what is the output? -1 

15.main(){

int i =3;

for(; i++=0;)

printf((“%d”,i);

}

what is the output? compiler error:L value required.

16.main(){

int i = 10, j =20;

j = i ,j?(i,j)?i :j:j;

printf(“%d%d”,i,j);

}what is the output? 10 10

17.main(){

extern i;

printf(“%d\t”,i);{

int i =20;

printf(“%d\t”,i);

}

}

what is output? linker Error:unresolved external symbol i

18.int DIMension(int array[]){

return sizeof(array/sizeof(int);}

main(){

int arr[10];

printf(“Array dimension is %d”,DIMension(arr));

}

what is output? array dimension is 1

19.main()

{

void swap();

int x = 45, y = 15;

swap(&x,&y);

printf(“x = %d y=%d”x,y);

}

void swap(int *a, int *b){

*a^=*b, *b^=*a, *a^ = *b;

what is the output?  x = 15, y =45 

20.main(){

int i =257;

int *iptr =&i;

printf (“%d%d”,*((char*)iptr),* ((char *)iptr+1));

}

what is output? 1   1

21.main(){

int i =300;

char *ptr = &i;

*++ptr=2;

printf(“%d”,i);

}

what is output? 556

22. #include

main(){

char *str =”yahoo”;

char *ptr =str;

char least =127;

while(*ptr++)

least = (*ptr

printf (“%d”,least);

}

what is the output?

23.Declare an array of M pointers to functions returing pointers to functions returing pointers to characters.

 (char*(*)())(*ptr[M])()

24.void main(){

int I =10, j=2;

int *ip = &I ,*jp =&j;

int k = *ip/*jp;

printf(“%d”,k);

}

what is the output?compile error:unexpected end of file in comment started in line 4

25.main()
{

char a[4] =”GOOGLE”;

printf(“%s”,a);

}

what is the output?  compile error: too many initializers

26.For 1MB memory, the number of address lines required 20 

27.There is a circuit using 3 nand gates with 2 inputes and 1 output,f ind the output. OR

28.what is done for push operation

  SP is decremented and then the value is stored.

29.Memory allocation of variables declared in a program is Allocated in stack

30.What action is taken when the processer under execution is interrupted by TRAP in 8085MPU?

 Processor serves the interrupt request after completing the execution of the current instruction.

 

31.purpose of PC (program counter)in a microprocessor is

   To store address of next instructions to be executed

 

 32.conditional results after execution of an instruction in a microprocess is stored in

   flag register part of PSW (program status word)

33.The OR gate can be converted to the NAND function by adding  NOT gate(s)to the input of the OR gate.

34.In 8051microcontroller port 2 has a dual function.

   

35.An 8085 based microprocessor with 2MHz clock frequency,will execute the following chunk of code with how much delay?

MVI B,38H

HAPPY: MVI C, FFH

SADDY: DCR C

JNZ SADDY

DCR B

JNC HAPPY
 114.5 (not sure)

36.In 8085 MPU what will be the status of the flag after the execution of the following chunk of code.

MVI B,FFH

MOV A,B

CMA

HLT

S = 0, Z = 1, CY = 0

37.A positive going pulse which is always generated when 8085 MPU begins the machine cycle.

    ALE

38.when a  CALL   instruction of 8085 MPU is fetched , its second and third bytes are placed in the W and Z registers.

39.what is defined as one subdivision of the operation performed in one clock period.

a) T- State b) Instruction Cycle c) Machine Cycle d) All of the above

40.At the end of the following code, what is the status of the flags.

LXI B, AEC4H

MOV A,C

ADD B

HLT          S = 0, CY = 1, P = 1 , AC = 1

46.The repeated execution of a loop of code while waiting for an event to occur is called  busy waiting The cpu is not engaged in any real productive activity during this period,and the process doesn’t progress towards completion.

47. Transparent DBMS is defined as
A DBMS which keeps its physical structure hidden from user 

48.Either all actions are carried out or none are.users should not have to worry about the effect of incomplete transctions.DBMS ensures this by undoing the actions of incomplete transctions.this property is known as atomicity 

49. placement  algorithms determines where in available to load a program. common methods are first fit,next fit,best fit. replacement algorithm are used when memory is full , and one process (or part of a process) needs to be swaped out to accommodate a new program.The replacement  algorithm determines which are the partions to be swaped out.

50.Trap door is a secret undocumented entry point into a program used to grant access without normal methods of access authentication.A trap is a software interrupt,usually the result of an error condition. false.

55.in recursive implementations which of the following is true for saving the state of the steps

a) as full state on the stack

b) as reversible action on the stack

c) both a and b

56.which of the following involves context switch

a) previliged instruction

b) floating point exception

c) system calls

d) all

e) none

57.piggy backing is a technique for

a) acknowledge

b) sequence

c) flow control

d) retransmission

58. a functional dependency XY is ___________dependency if removal of any attribute A from X means that the dependency does not hold any more

a) full functional

b) multi valued

c) single valued

d) none

59)a relation schema R is in BCNF if it is in ___________and satisfies an additional constraints that for every functional dependency XY,X must be a candidate key
a)1 NF

b)2 NF

c)3 NF

d)5 NF

60) a _________sub query can be easily identified if it contains any references to the parent sub query columns in the _________ clause

A) correlated ,WHERE

b) nested ,SELECT

c) correlated, SELECT

d) none

 

 

 

 

61) hybrid devise that combines the features of both bridge and router is known as

a)router b)bridge c)hub d)brouter

 

 

62) which of the following is the most crucial phase of SDLC

a) testing b) code generation c) analysys and design d) implementation

 

 

63)to send a data packet using datagram ,connection will be established

 

 

a) no connection is required

b) connection is not established before data transmission

c) before data transmission

d) none

 

 

64)a software that allows a personal computer to pretend as as computer terminal is

 

 

a) terminal adapter

b) terminal emulation

 

 

c) modem

d) none

 

 

65) super key is

 

 

a) same as primary key

b) primary key and attribute

c) same as foreign key

d) foreign key and attribute

 

 

66.In binary search tree which traversal is used for ascending order values

a) Inorder b)preorder c)post order d)none

 

 

67.You are creating an index on ROLLNO colume in the STUDENT table.which statement will you use?

a) CREATE INDEX roll_idx ON student, rollno;

 

 

b) CREATE INDEX roll_idx FOR student, rollno;

c) CREATE INDEX roll_idx ON student( rollno);

d) CREATE INDEX roll_idx INDEX ON student (rollno);

 

 

68.A________class is a class that represents a data structure that stores a number of data objects

a. container b.component c.base d.derived

 

 

69.Which one of the following phases belongs to the compiler Back-end.

a. Lexical Analysis b.Syntax Analysis c. Optimization d.Intermediate Representation.

 

 

70.Every context _sensitive language is context_free

a. true b.false

 

 

71.Input:A is non-empty list of numbers L

Xß-infinity

For each item in the list L,do

If the item>x,then

Xßthe item

Return X

X represents:-

a)largest number

b)smallest number

c)smallest negative number

d) none

 

 

72.Let A and B be nodes of a heap,such that B is a child of A. the heap must then satisfy the following conditions

a) key(A)>=key(B)

b) key(A)

c) key(A)=key(B)

d) none

 

 

73.String ,List,Stack,queue are examples of___________

a) primitive data type

b) simple data type

c) Abstract data type

d) none

 

 

74.which of the following is not true for LinkedLists?

a) The simplest kind of linked list is a single linked list ,which has one link per node .this link points to the next node in the list,or to a null value or emptylist if it is the last node.
b)a more sophisticated kind of linked list is a double linkedlist or two way linkedlist .Each node has two links ,one to the previous node and one to the next node.

c) in a circleLinkedList ,the first and last nodes are linked together.this can be done only for double linked list.

d) to traverse a circular linkedlist ,u begin at any node and follow the list in either direction until u return to the original node.

 

 

75.sentinel node at the beginning and /or at the end of the linkedlist is not used to store the data

a) true

b) false

 

. APTITUDE TEST:

   This paper consists of 40 qstns to be solved in 40 minutes.This section was moderate(not so difficult).

–>One qstsn was on propabiltity like there are 3 piles of books.Each containing 6,5,4 books.What is the propability that first book will be arranged and so on.. ans: 12!

—>One qstn on profit and loss..

—>one qstns on speed and distance.

—>there were 3 fill ups with suitable words. (easy)

—>there were 5-6 passages (all easy)

—>there were 3-4 analogies.

—>one qstns on permutation.

—>one qstn was on ages..

—->two qstns were from ratios.

—->Then one one problem from geometry containing 3 sub-qstns.(See BARRONS GRE.it would be helpful)

—->One function like f(0,x)=x+1
f(0,y)=y
f(0,0)=1
f(x,y)=f(x+2,f(y-1))(not the exact qstns but similar like that) then find f(1,1),f(3,0).f(1,2),then derive f(3,0) in terms of f(0.0),f(1,0),f(1,2).Totally 5 sub qstns ..all were easy..

—->One Sudoku problem..A 3*3 block in which only 2 blocks were filled.The remaining bloxks had to be filled such that diagonally,vertically, horizontally it should sum up to 15..based on this 5 easy qstns were given..

The results were out.total 951 students attented the test  in that 370 selected for next round. I was shortlistd for the second round (JAM)..

3. JAM (COMMUNICATION TEST)

Here ,we were given a topic and to speak on that for about a  minute. My batch had “TECHNOLOGY vs AGRICULTURE”. Other batches had  “ROLE MODEL”, “WOMEN IN SOCIETY”,”3 IMPORTANT PROBLEMS OF INDIA”, “TELL ME ABOUT UR SELF”. my batch consists of 20 members.3 cleared the JAM round..luckly i am one among them…….MAXIMUM elimination is here……bcarefull guys……………..

4. TECHNICAL INTERVIEW

Be confident with ur basic skills (C,C++).If you are of ECE be confident with your core knowledge.It helps you a lot.Be cool as much as you can.i am from CSE…the questions asked is

1. tell me ur project?
2.primary key?
3.normailsation?
4.double linked list?
5.IP adress?
6.diff between TCP and UDP?
7.bubble sort?
8.different types of databases?
9.basics on .net(i used .net technology in my project)
10.unix?

i done extremely good  in this round………i got 4/5 rating………and i qualified for HR round
5. HR INTERVIEW

It is a normal round checking your communication skills and your personal skills.Be bold and confident.You would definitely go through this round. no questions for me in this round……….because of my percentage and tech round score….directly HR said that “U R SELECTED FOR CSC” ………….PREPARE WELL .May GOD bless you..

Leave a Reply

Your email address will not be published. Required fields are marked *