# CSC Technical Paper

## 50 Questions MCQ Test Placement Papers - Technical & HR Questions | CSC Technical Paper

Description
This mock test of CSC Technical Paper for Quant helps you for every Quant entrance exam. This contains 50 Multiple Choice Questions for Quant CSC Technical Paper (mcq) to study with solutions a complete question bank. The solved questions answers in this CSC Technical Paper quiz give you a good mix of easy questions and tough questions. Quant students definitely take this CSC Technical Paper exercise for a better result in the exam. You can find other CSC Technical Paper extra questions, long questions & short questions for Quant on EduRev as well by searching above.
QUESTION: 1

Solution:
QUESTION: 2

Solution:
QUESTION: 3

### A reserved area of the immediate access memory used to increase the running speed of the computer program.

Solution:
QUESTION: 4

A small subnet that sit between a trusted internal network and an untruster external network, such as the public internet.

Solution:
QUESTION: 5

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.

Solution:
QUESTION: 6

main(){

float fl = 10.5;

double dbl = 10.5

if(fl ==dbl)

printf(“UNITED WE STAND”);

else

printf(“DIVIDE AND RULE”)

}

Q. What is the output?

Solution:
QUESTION: 7

main(){

static int ivar = 5;

printf(“%d”,ivar--);

if(ivar)

main();

}

Q. What is the output?

Solution:
QUESTION: 8

main()

{

extern int iExtern;

iExtern = 20;

printf(“%d”,iExtern);

}

Q. What is the output?

Solution:
QUESTION: 9

#define clrscr() 100

main(){

clrscr();

printf(“%d ”, clrscr());

}

Q. What is the output?

Solution:
QUESTION: 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);

}

Q. What is the output?

Solution:
QUESTION: 11

#define FALSE -1

#define TRUE 1

#define NULL 0

main() {

if(NULL)

puts(“NULL”);

else if(FALSE)

puts(“TRUE”);

else

puts(“FALSE”);

}

Q. What is the output?

Solution:
QUESTION: 12

main() {

int i =5,j= 6, z;

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

}

Q. What is the output?

Solution:
QUESTION: 13

main() {

int i ;

i = accumulator();

printf(“%d”,i);

}

accumulator(){

_AX =1000

}

Q. What is output?

Solution:
QUESTION: 14

main() {

int i =0;

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

i- = i++;

printf(“%d”,i);

}

Q. What is the output?

Solution:
QUESTION: 15

main(){

int i =3;

for(; i++=0;)

printf((“%d”,i);

}

What is the output?

Solution:
QUESTION: 16

main(){

int i = 10, j =20;

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

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

}

Q. What is the output?

Solution:
QUESTION: 17

main(){

extern i;

printf(“%d ”,i);{

int i =20;

printf(“%d ”,i);

}

}

Q. What is the output?

Solution:
QUESTION: 18

int DIMension(int array[]){

return sizeof(array/sizeof(int);}

main(){

int arr;

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

}

Q. What is output?

Solution:
QUESTION: 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;

Q. What is the output?

Solution:
QUESTION: 20

main(){

int i =257;

int *iptr =&i;

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

}

Q. What is output?

Solution:
QUESTION: 21

main(){

int i =300;

char *ptr = &i;

*++ptr=2;

printf(“%d”,i);

}

Q. What is output?

Solution:
QUESTION: 22

#include

main(){

char *str =”yahoo”;

char *ptr =str;

char least =127;

while(*ptr++)

least = (*ptr

printf(" %d”,least);

}

Q. What is the output?

Solution:
QUESTION: 23

void main(){

int I =10, j=2;

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

int k = *ip/*jp;

printf(“%d”,k);

}

Q. What is the output?

Solution:
QUESTION: 24

main(){

printf(“%s”,a);

}

Q. What is the output?

Solution:
QUESTION: 25

For 1MB memory, the number of address lines required

Solution:
QUESTION: 26

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

Solution:
QUESTION: 27

What is done for push operation

Solution:
QUESTION: 28

Memory allocation of variables declared in a program is:

Solution:
QUESTION: 29

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

Solution:
QUESTION: 30

Purpose of PC (program counter)in a microprocessor is:

Solution:
QUESTION: 31

Conditional results after execution of an instruction in a microprocessor is stored in

Solution:
QUESTION: 32

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

Solution:
QUESTION: 33

In 8051 microcontroller , has a dual function.

Solution:
QUESTION: 34

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

Solution:
QUESTION: 35

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

Solution:
QUESTION: 36

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

Solution:
QUESTION: 37

In 8051 micro controller what is the HEX number in the accumulator after the execution of the following code.

MOV A,#0A5H

CLR C

RRC A

RRC A

RL A

RL A

SWAP A

Solution:
QUESTION: 38

The Pentium processor requires ------------ volts.

Solution:
QUESTION: 39

The Pentium processor requires ------------ volts.

Solution:
QUESTION: 40

K6 processor

Solution:
QUESTION: 41

What is the control word for 8255 PPI,in BSR mode to set bit PC3.

Solution:
QUESTION: 42

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

Solution:
QUESTION: 43

Transparent DBMS is defined as

Solution:
QUESTION: 44

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

Solution:
QUESTION: 45

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

Solution:
QUESTION: 46

Given a binary search tree, print out the nodes of the tree according t5o post order traversal.

4

/

2 5

/

1 3

Solution:
QUESTION: 47

Which of the following involves context switch

Solution:
QUESTION: 48

Piggy backing is a technique for

Solution:
QUESTION: 49

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

Solution:
QUESTION: 50

which of the following is the most crucial phase of SDLC

Solution: