(Paper) CSC PLACEMENT PAPER PATTERN (III)

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

a) To store address of TOS(top of stack)

b) To store address of next instructions to be executed

c) count the number of instructions

d) to store the base address of the stack.

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

a) register b) accumulator c) flag register d) flag register part of PSW (program status word)

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

a) NOT b) AND c) NOR d) XOR

34.In 8051microcontroller ,------has a dual function.

a) port 3 b) port 2 c) port 1 d) port 0

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

a) 102.3 b)114.5 c)100.5 d)120

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

a)S = 1, Z = 0, CY = 1 b)S = 0, Z = 1, CY = 0

c) S = 1, Z = 0, CY = 0 d)S = 1, Z = 1 ,CY = 1

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

a) RD b) ALE c) WR d) HOLD

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

a) JMP b) STA c) CALL d) XCHG

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

a) S = 1, CY = 0, P = 0 , AC = 1 b) S =0 , CY = 1, P = 0,AC = 1

c) S = 0, CY = 1, P = 0 , AC = 1 d) 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 ---------.The cpu is not engaged in any real productive activity during this period,and the process doesn?t progress towards completion.


a) dead lock b) busy waiting c) trap door d) none.


47. Transparent DBMS is defined as


a) A DBMS in which there are no program or user access languages. b) A DBMS which has no cross file capabilities but is user friendly and provides user interface management. c) A DBMS which keeps its physical structure hidden from user d) none.


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


a) Aggregation b) atomicity c) association d) data integrity.


49.------ 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 swaped out to accommodate a new program.The ------------- algorithm determines which are the partions to be swaped out.


a) placement, placement, replacement


b) replacement, placement, placement


c) replacement, placement, replacement


d) placement, replacement, replacement


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.


a)true b)false.


52.which one of the following is the recursive travel technique.

a)depth first search b)preorder c)breadth first search d)none.

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

d)none

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)

(b)>

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