1. If x x x1 2 3 1 3 1 2 1 6, , , , , , where x denotes

the vector product, then x x x1 2 3, , is givenbyA. (0, 1, 1)B. (-1, 2, -7)C. (m, o, l-m) for all real mD. there does not exist any such

x x x1 2 3, , in R3.

2. The value of the expression

474

523

1

5

C Cj

j

is equal to

A. 47 52! ! B. 46! 52!

C. 524C D. 52

47C

3. The range of the function of 21/2 xxxf

isA. B. ,0

C. 0, D. (0, 1)

4. Two square matrices A and B represent thesame linear transformation if and only if thereis a matrix F such thatA. AP = BP B. det A= det (P-1 BP)C. B = AP D. B = P-1 AP

5. Consider the following logic circuit whoseinputs are functions f1, f2, f3 and output is f.

f(x,y,z)

f (x,y,z)1

f (x,y,z)2

f (x,y,z) =?

3

Given that

isfzyxf

andzyxf

zyxf

3

2

1

5,4,1,,

,7,6,,

,5,3,1,0,,

A. 1 4 5, , B. 6 7,C. 0 1 3 5, , ,D. None of these

6. Which of the following descriptions relatesto a floppy diskette ?A. 9 - track 1600 BPIB. double-sized double densityC. 33 MHz-zero-wait timeD. 40 MB capacity

7. Contents of A register after the executionof the following 8085 microprocessor pro-gram isMVI A, 55 HMVI C, 25 HADDC DAAA. 7AH B. 80HC. 50 H D. 22H

8. Consider the following Assembly Languageprogram :MVI A, 30 HACI, 30HXRA, APOP, HAfter the execution of the above programthe contents of the Accumulator will beA. 30 H B. 60 HC. 00H D. contents of stack

BRILLIANCE COLLEGEMODEL EXAMINATION - SET -1

9. The function represented by the Karnaughmap given below is :

A

1 0 0 1

0 1 0 1

0

01 10 1100

1

BC

A. BA B. AB BC CA

C. B C D. A BC

10. For a MOD-12 counter, the FF has atpd = 60 ns. The NAND gate has a tpd of 25ns. The clock frequency isA. 3.774 MHzB. >3.774 MHzC. < 3.774 MHzD. 4.167 MHz

11. Which of the following boolean expressionsis not logically equivalent to all of the rest ?A. ab + (cd)’ + cd + bd’B. a (b+c) + c F128M%d

C. ab + ac + c d 'D. bd’ + c’d’ + ab + cd

12. Which is a permanent database in the gen-eral model of compiler ?A. literal tableB. identifier tableC. source codeD. terminal table

13. Which of the following tool is used to specifylexical analysers for a variety of languagesA. Lex B. YaacC. EQN D. TeX

14. Peephole optimization is a form ofA. loop optimizationB. constant foldingC. data flow analysisD. local optimization

15. The graph depicting the inter-dependencies

of the attribute of different nodes in a parsetree is calledA. Flow graphB. Steffi graphC. Dependency graphD. Karnaugh’s graph

16. The action of parsing the source program into the proper syntactic classes is known asA. Syntax analysisB. Lexical analysisC. Interpretation analysisD. General syntax analysis

17. The segment base is specified using the reg-ister named inA. ORG instructionsB. TITLE instructionC. ASSUME instructionD. SEGMENT instruction

18. Consider that n elements are to be sorted,what is the worst case time complexity ofshell sort ?A. 0 (n) B. 0 (n2)C. 0 (n1.2) D. 0 (n log2n)

19. Let A x x is an eger and S int 2 16

A. A B. 0 1 2 3, , , A

C. 4 1 2 3, , , A D. 3 2 1, , A

20. What value would the following functionreturn for the input x = 95 ?Function fun (x = integer) : integer ;begin

If x > 100 then fun : = x - 10 else fun : = fun (fun (x + 11))end;

A. 89 B. 90C. 92 D. 91

21. The tree shown in figure given below repre-

sents the post fix expression

*

*

5 63 41

++ +

2

A. 1 + 2 * 3 + 4 * 5 + 6B. 12 + 34 + 56 + **C. 655321 ++ ** +D. * + 12 * + 34 + 56

22. Some group (G, O) is known to be abelian.Then, which one of the following is true forG?A. g = g-1 for every g GB. g = g2 for every g GC. (g o h)2 = g2 oh2 for every g, h GD. G is of finite order

23. For X = 4.0, the value of I in the FORTRAN77 statements

isXXI 4/33*/*0.52**2 ––––––––A. 9 B. 10C. 11 D. 7

24. An unrestricted use of the “goto” statementis harmful becauseA. it makes it more difficult to verify pro-

gramsB. it increases the running time of the pro-

gramsC. it increases the memory required for the

programsD. it results in the compiler generating longer

machine code

25. The running time T(n), where ‘n’ is the in-put size of a recursive algorithm is given asfollows.

T(n) = C + T (n - 1), if n > 1d, if n 1 The order of the algorithm isA. n2 B. nC. nn D. n3

26. Let 321 ,, xxx and let,

313232121 ,, bxaxxbxaxxebxaxx

define the language L, where a b, ande is the empty string. Which of the followingset of regular expressions for x1, x2, x3, pro-vide a solution for the set of expression equa-tions ?A. a*(b* (ab* (a + b)* b) + a*)B. (ab* a(ab* ab* a+b)* ab* + e)C. (ab* ab* a + b)* ab*+aD. both A and B

27. A language L is accepted by a finite auto-mation if and only if it isA. context freeB. context - sensitiveC. recursive D. right-linear

28. The preprocessor directive # include is re-quired ifA. console output is usedB. console input is usedC. both (A) and (B)D. None of these

29. The two statements that can be used tochange the flow of control areA. if and switchB. if and whileC. switch and do-whileD. break and continue

30. A string is like an array becauseA. an array is a kind of arrayB. they are both character arraysC. a string is a kind of arrayD. None of the above

31. DML commands are embedded in a gen-eral purpose programming language calledA. host programming languageB. hard programming languageC. hand pilot languageD. None of the above

32. The exists function is SQL is used to checkwhetherA. the result of a correlated nested query is

empty (no tuples) or notB. the result of a inter boundary query is

based on selected valuesC. the result of a correlated nested query is

based on selected valves.D. None of these

33. Many application involving queue priorityqueues rather than the simpleA. End-strategy B. LIFO-strategyC. FIFO-strategy D. None of the above

34. In Hashing technique a Division method canbe defined asA. H (K) = K (MOD h) if indices starts

from 0B. H(K) = K (MOD h) +1 if indices starts

from 1C. H is a prime number and equal to the size

of the hash tableD. all the above

35. Tree indexing is suitable for maintainingA. Variable sized key valuesB. Actual key value is never stored but key

valves are implied through links.C. It allows multiway branching based on

the part of key value, not the entire keyvalue and the branching on its level isdetermind by the i-th component of keyvalve.

D. All the above

36. The main difficulty with closed hashing isA. it is very difficult to handle the situationof table to over flow in a satisfactory

manner.B. due to far off majority of keys from their

hash locations the number of probes in-creases and overall performance de-grades

C. key values are haphazardly intermixed,on the average majority of keys are farfrom their hash locations.

D. All the above

37. In sequential file, continuous areas may notbe possible becauseA. both the primary datafile and the trans-

action data file must be looked duringmerging

B. both the primary and transaction file mustnot be looked during merging

C. (A) or (B)D. none of these

38. In B-tree normal nodes have betweenA. M/2 and M childrenB. M and M/3 childrenC. M and M/5 childrenD. None of the above

39. Depth-First search immediately solves someA. last lines of the programmeB. basic graph-processing problemsC. first-five lines of the programmeD. none of the above

40. To reduce disk accesses, several conditionsof the tree must be trueA. the height of the tree must be kept to a

minimumB. there must be no empty sub tree above

the leaves of the treeC. the leaves of tree must all be on same

level, all nodes except the leaves musthave at some minimum number of chil-dren

D. All the above

41. At the telephone company end office thedata are converted to digital form forA. transmission over the long-haul trunksB. disconnecting the long-haul trunksC. traversing the analog wave formD. None of the above

42. In Datagram subnet each packet isA. Routed independentlyB. route chosen when VC is set upC. routing is not requiredD. None of the above

43. By making IP sec algorithm independent, theframework can survive even if some par-ticular algorithm isA. later rewritten B. broken laterC. encapsulated D. None of the above

44. The basic idea of MIME is to continue touse the RFC 822 format, butA. it adds structure to the message bodyB. defines encoding rules for non-ASCII

messagesC. both (A) and (B) D. none of the above

45. In hypertextA. one page point to anotherB. only ASCII characters can be storedC. only ASCII characters can be seenD. None of the above

46. E-mail is widely used with in industry forA. Inter personal communicationB. Providing medical servicesC. Intra company communicationD. None of the above

47. The URL consists of three partsA. The protocol (http), DNS name of the

host, file name with certain punctuationseparately the pieces

B. DNS, file name, extensionC. Protocol, DNS, server nameD. None of the above

48. When the number of stations is large andvariable or the traffic is faily burstyA. FM is a poor choiceB. IDM and TDM are poor choicesC. Only TDM is a good choiceD. None of these

49. Like a hub, a modern bridge hasA. Line cards, usually for four or eight input

lines of a certain typeB. Line cards, with no LinesC. Line cards with output LinesD. None of these

50. The LinkerA. produces a link file which contains binary

codes for all compound modulesB. produces a link map which contains the

address information about linked filesC. does not assign absolute address to your

programme but only assigns continousrelative addresses to all the moduleslinked starting from zero.

D. all the above

51. HEX N indicates the assembler toA. hexadecimal number N to be converted

to binaryB. hexadecimal number N to be converted

to octalC. hexadecimal number N to be converted

to ASCIID. None of the above

52. The service routine may use the contents ofprocessor registerA. it is necessary to save their contents at

the beginning of the routine and restorethem at the end

B. it is not necessary to save their contentsat the beginning of the routine and re-store them at the end.

C. (A) or (B)D. None of these

53. Macro instructions also called macros areA. single line abbreviations for group of in-

structionsB. two line abbreviations for group of in-

structionsC. three line abbreviations for group of in-

structionsD. None of these

54. In a YACC semantic action the symbol $ $,$;A. $$ refers to the attribute value associ-

ated with non terminal on the leftB. $; refers to value associated with i th

grammar symbol (terminal or not termi-nal on the right)

C. (A) and (B) D. None of these55. The syntax of programming language con-

structs can be described byA. Backens Naur Form (BNF) notations

and these notations also called contextfree grammar

B. DNF C. LNFD. None of these

56. The two most popular operating systems for8 and 16-bit personal computers areA. MS-DOS and UNIXB. CP/M and CP/M-80C. CP/80 and MS - DOSD. None of these

57. If digital data rate of 9600 pbs is encodedusing 8-level phase shift keying (PSK)method, the modulation rate isA. 4800 bauds B. 1200 baudsC. 9600 bauds D. 3200 bauds

58. The correct matching for the following pairsisa. DMA I/O (1) High speed RAMb. Cache (2) Diskc. Interrupt I/O (3) Printerd. Condition code Register (4) ALUA. a-4, b-3, c-1, d-2 B. a-2, b-1, c-3, d-4C. a-4, b-3, c-2, d-1 D. a-2, b-3, c-4, d-1

59. A certain moving arm disk storage, with one,head, has the following specifications.Number of tracks/recording surface = 200,Disk rotation speed = 2400 rpm,Track storage capacity = 62,500 bitsThe average latency of this device is P msecand the data transfer rate is Q bits/sec. Writethe value of P and QA. P =12.5, Q=2.5×106

B. P=2.5×106, Q=12.5C. P=12, Q=24.5D.None of the above

60. A concept which creates an illusion of a realmachine is called

A. virtual machine as that makes a singlereal

B. machine appear to be several no real ma-chines

C. machine appear to be several real ma-chines

D. None of the above

61. The mapping table may be stored in a sepa-rate memory or in main memory and mayuseA. an associative memoryB. an additional memory unit is required and

one extra memory access timeC. the table takes space from main memory

and two accesses, to memory are re-quired with the programme running at halfspeed

D. all the above

62. The shell in UNIXA. is entity that serves us in various waysB. started up automatically every time you

login to the systemC. sets up your environment when you start

off on the machineD. All the above

63. Strategies used for dealing with dead locksA. detection and recovery and dynamic

avoidance by careful resource allocationB. just ignore the problem altogetherC. prevention by negating one of four nec-

essary conditionD. All the above

64. UML include main componentsA. use case diagrams, interaction diagramsB. state diagrams and implementation dia-

gramsC. class diagrams that follows the notation

used in OMT but also incorporate tech-nique from Booch and other modelingmethods to describe the object structures.

D. all the above65. The x .25 standard specifies a

A. technique for start stop dataB. technique for dial accessC. DTE/DCE interfaceD. data bit rate

66. In Active X, List boxA. Creates a drop-down list boxB. Lets users delete listC. (A) and (B) D. None of these

67. Java Beans providesA. an ability to developers to use a variety

of development tools to assemble cus-tom applications

B. event handling and persistence that makeJava Beans fully portable

C. an architecture and platform neutral APIfor creating and using dynamic Java com-ponents

D. all the above68. The Win 32 API philosophy is

A. completely different from the UNIX phi-losophy

B. partially different from the UNIX philoso-phy

C. (A) or (B) D. None of these

69. The accident file is commonly updated in theA. payroll systemB. personnel activity reporting systemC. accident and claim data systemD. all the above

70. The commonly used UNIX commands likedate, Is, Cat etc. are stored in ---A. /tmp directoryB. /bin and / usr/bin directoriesC. /dev directory D. /unix directory

71. The practice of ‘bundling’ refers toA. selling software to run on computersB. selling computers aloneC. giving away software with a computer

purchaseD. None of these

72. Diameter of a graph denoted by diam (G) isdefined byA. max {e(v) : v V}

(where e (v) is eccentricity of vertex, vis a vertex and V is the vertex set)

B. max { d (u, v) : u, v V}where d (u, v) is the distance betweentwo vertices U and V)

C. both (A) and (B) D.None of these73. Match the following

List I(i) State Table(ii) Locality of Reference(iii) Asynchronous Data Transfer(iv) 2 S complement Multiplication

List IIa. Strobe Control Methodb. Booth Algorithmc. Flip-Flopd. CacheCodes :

badcDbdacCabcdBdcbaAiviiiiii

.

.

.

.

74. What will be the output of the following pro-grams ?main ( ){

static char A [ ] = “BOMBAY”;char * B = “BOMBAY”;Print f (“\n% d %d”, size of (A), size of

(B));}A. A = 7, B = 7 B. A = 7, B = 2C. A = 2, B = 7 D. A = 7, B = 0

75. _________ is a pointer to the current ob-ject. It is passed implicitty to an overloadedoperator ?A. This B. NewC. Scope D. Private

76. Which of the following is not a type of JOINin SQL ?A. EQUIJOIN B. NONEQUIJOINC. INNERJOIN D. OUTER JOIN

77. A heap allows a very efficient implementa-tion of aA. double ended queueB. priority queueC. StackD. trees

78. The firewall has two components; (1) Tworouters and (2) An application gateway.Router’s work is to do ––––––A. sending dataB. packet filteringC. makes decisionD. installation packets

79. In UNIX systems the user can change theaccess rights of the file to different users byusing –––A. PID B. ChmodC. Head D. tail

80. Mobile IP change with the adoption of IP

version 6 (IPV 6). What are the followingfeatures of IPV6 are different fromIPV 4?A. Stateless Address Auto configurationB. Neighbour discoverysC. Nodes are expected to implement strong

authentication and encryption features toimprove Internet security

D. all the above

81. When a cracker attempts to misuse or stealdata from a system, it is called -------A. virus B. stealingC. intrusion D. none of these

82. On what platform is multi threading sup-ported ?A. IDL 5.5B. IDL 5.6C. Support of all platformD. None of these

83. The FSM pictured in given figure recognizes

b

b

b

b

aa a a

A. any string of odd number of a’sB. any string of odd number of a’s and even

number of b’sC. any string of even number of a’s and even

number of b’sD. any string of even number of a’s and odd

number of b’s

84. The language L = (0n1n2n) where n > 0) is aA. context - sensitive languageB. regular languageD. recursively enumerable languageD. all the above

85. Let *L where a b, whichof the following is true ?

A. L has an equal number of a' x x/

of a' s and b's is regular

B. L = a is regularnb n In /

C. L = has more a's and b' s is regularx x/

D. L = a is regularmb m nn / , 1

86. A programme which converts ‘sourceprogramme’ into ‘object programme’ forsome other machine is calledA. Interpreter B. CompilerC. Linker D. Cross-compiler

87. C includes two types of modifiers that af-fect the way variables are accessed by bothuser’s programme and the compiler. Thesemodifiers areA. auto, externB. const, volatileC. extern, staticD. auto, register

88. B - tree is an extension ofA. m-way search treeB. in order to improve the search efficiency,

the tree should be balancedC. if m-way search tree is height balanced

then it is called B-treeD. all the above

89. In OSI model, transport layer is a trueA. cabel operatorB. routerC. gatewayD. end-to-end layer, all the way from source

to destination

90. The ORG pseudoinstruction initialises theA. Location counter to the value of the first

location

B. Location counter to the value of the sec-ond location

C. Location counter to the value of the thirdlocation

D. None of these

91. The difference between the preemptive ornon-preemptive SJF Scheduler lies in the con-dition that lead toA. Invocation of the scheduler and conse-

quently the frequency of its executionB. future execution of processes are not

knownC. (A) or (B)D. None of these

92. Grady Booch-design methodA. more open than OOSE and does not pro-

pose prescriptive stepsB. defines number of notations and models

and relationships between them but ismore open in how these are applied

C. proposed various models class diagram,object diagram, interaction diagram statetransition diagrams, module diagram.

D. All the above

93. The mobile computing platform can be ef-fectively described underA. B-treeB. C++C. the client-server paradigmD. None of these

94. In ATM reference model, the ATM layerA. is not split into sublayersB. is a mixture of the OSI data link and net-

work layersC. manages cells, including their generation

and transportD. All the above

95. Active X documentsA. allow to view HTML pagesB. presenting you with a common interface

for several tasksC. which allow you to view active documentsD. All the above

96. Approaches to Data Mining ProblemsA. Discovery of sequential patterns, Generic

Algorithms - Clustering and Segmenta-tion

B. Discovery of patterns in Time SeriesC. Discovery of classification rules, Neural

NetworksD. All the above

97. The header file ‘ctype.h’ can be used forA. providing character type identification

(boolean) and translationB. providing support for string handling func-

tions.C. providing links to assembly language for

callsD. All the above

98. Determine the truth value Z PN Z S: #A. T B. FC. T or F D. None of the above

99. The expression (a * b) * c op ...............where ‘op’ is one of ‘+’, ‘*’ and ‘ ’ (expo-nentiation) can be evaluated on a CPU witha single register without storing the value of(a * b) ifA. ‘op’ is ‘+’ or ‘*’B. ‘op’ is ‘ ’ or ‘*’

C. ‘op’ is ‘ ’ or ‘+’D. not possible to evaluate without storing

100. Specifying that an attribute is a key of anentity type means that the preceding unique-ness property must hold forA. any complex entitiesB. any two entitiesC. every extension of the entity typeD. All the above

1. Which one of the following is NOT neces-sarily a property of a Group ?A. Existence of identityB. CommutativityC. AssociativityD. All the above

2.

1

1

0

0

0

The above DFA accepts the set of all strings

over 0 1, that

A. end with 0B. end with 00C. contain the substring 00D. begin either with 0 or 1

3. If P, Q, R are subsets of the universal set U,

then P Q R P Q R Q RC C C

is

A. Q RC C

B. P Q RC C

C. P Q RC C C D. U

4. Consider the following functionsf (n) = 2n

g (n) = n!h (n) = nlog n

Which of the following statements about the

asymptotic behaviour of f(n), g(n), and h(n)is true?A. nhngngnf 0;

B. nfngnfnh ;0

C. nhngngnf 0;0

D. nfnhnfng 0;0

5. Consider the languages

0,\0,/ 21 mncbaLandmncbaL mmnmnn

Which one of the following statements isFALSE?A. L1 and L2 are context-free languages

B. 21 LL is a context sensitive language

C. 21 LL is a context free languageD. None of these

6. The recurrence equation T 1 1

T n T n n n 2 1 2, evaluates to

A. 2 21n n B. 2n nC. 2 2 21n n D. 2n n

7. A graph G = (V, E) satisfies E V 6 .The min-degree of G is defined as

VreeV degmin

. Therefore, min-degree of

G cannot beA. 3 B. 4C. 5 D. 6

BRILLIANCE COLLEGEMODEL EXAMINATION - SET -2

8. Which of the following scheduling algorithmsgive minimum average waiting time?A. Round-robin B. SJFC. Priority D. FCFS

9. The process of transferring data intendedfor a peripheral device into a disk (or inter-mediate store). So that it can be transferredto peripheral at a more convenient time or inbulk, is known asA. spoolingB. cachingC. virtual programmingD. None of these

10. In MS-DOS, relocatable object files and loadmodules have extensionsA. COM and OBJ, respectivelyB. DAS and EXE, respectivelyC. OBJ and COM or EXE respectivelyD. All the above

11. Given the digraph whose edges are labelledby flow capacities, compute the maximumflow for this system from source A to sourceK. All flows are left to right or vertical (asshown)

4B E H

K

JD

A

3

2

3

3

4

3

5

5

33

1 1 5

1 36 6

4

G

IFC

7

A. max flow < 9 B. 9C. 10 D. max flow > 11

12. Match the followinga. Heap construction

nnp 10log.

b. Constructing Hashtable with linear probing nq 0.

c. AVL tree construction 20. nr

d. Digital tree construction nns 2log0.A. a-p, b - q,c-s, d-rB. a-q, b-r, c-s, d-pC. a-p, b-q, c-r, d-sD. None of these

13. A directed graph with n vertices and e edgesare represented by Adjacency matrix. Whatis the time required to determine the in de-gree of a vertex ?A. 0 (n) B. 0 (n2)C. 0 (e + n) D. 0 (e)

14. Consider the following two functions

000,10000,100

2

3

1 nfornnforn

ng

1001000

32 nfornnforn

ng

Which of the following is true

A. 31 0 nisng

B. nisng 02

C. ngisng 21 0

D. ngisng 12 015. Which of the following features of Pascal

can not be captured by context - free gram-mars?A. variable names of arbitrary lengthB. syntax of recursive proceduresC. syntax of if - then-else statementsD. whether a variable has been declared be-

fore its use16. In an entity relationship, y is the dominant

entity and x is a subordinate entity. Thenwhich of the following is/are incorrect ?A. operationally, x is deleted, so is y

B. x is existence dependent on yC. operationally, if y is deleted, so is xD. None of the above

17. Given two union compatible relations R1 (A,B) and R2 (C, D), what is the result of theoperation R1A = CAB = DR2 ?A. R1 - R2 B. R1 × R2

C. 21 RR D. R R1 2

18. Fragmentation of the file systemA. can always be preventedB. can be temporarily removed by compac-

tionC. is a characteristic of all file systemsD. None of these

19. A condition that led to the development ofdatabase wasA. a demand for more data to support infor-

mation needsB. the proliferation of data filesC. an increase in the amount of data handled

by organizationsD. all the above

20. Choose the RDBMS which supports fullfledged client-server application develop-mentA. Oracle 7.1 B. Foxpro 2.1C. d BASE V D. Ingress

21. Let f x y f x f y , for all x, y. If f(5)

= 2 and f ' 0 3 . Then 5'f is equal toA. 1 B. 5C. 6 D. -1

22. The simultaneous equations on the Booleanvariables x, y, z and wx + y + z = 1x y = 0xx + w = 1xy zw 0

have the following solutions for x, y, z andw, respectivelyA. 0100 B. 1101C. 1011 D. 1000

23. The value of the double integral xy

x

1 20

1

0

1

dxdy is ......

A. 4 1 B. 4 1

C. 1 4 D. 1 4

24. SQL is a comprehensive database languageand it is bothA. LLL and HLLB. a DLL and a HLLC. LLL and a DMLD. DML only

25. The task(s) of the lexial analysis phase is(are)A. to parse the source program into the ba-

sic elements or tokens of the languageB. to build a uniform symbol tableC. to build a literal table and an identifier

tableD. all the above

26. Local and Loop optimization in turn providemotivation forA. Data flow analysisB. Constant foldingC. Peephole optimizationD. DFA and constant folding

27. System programs such as compilers are de-signed so that they areA. serially usable B. recursiveC. non reusable D. re enterable

28. RST 3 instruction will cause the processorto branch to the locationA. 0024 H B. 0018 HC. 0000 H D. 8018 H

29. Serial access memories are useful in appli-cations whereA. data consists of numbersB. short access time is requiredC. each stored word is processed differentlyD. data naturally need to flow in and out in

serial form

30. What are x and y in the following macrodefinition ?macro Add x, yLoad yMul xstore yend macroA. Variables B. IdentifiersC. Actual parametersD. Formal parameters

31. Convert the following numbers in the givenbases into their equivalent in the desiredbases i x ii y H110101 11182 10 10.

A. x = 6.625, y = 45EB. x = 4, y = 6C. x = 3, y = 5D. None of these

32. The initial contents of the 4-bit serial - in -parallel out, right shift. Shift Register shownin figure below is 0110. After three clockpulses are applied, the contents of the ShiftRegister will be

0 1 1 0SERIAL IN

CLOCK

A. 1111 B. 0101C. 1010 D. 0000

33. A switch-tail ring counter is made by usinga single D flip-flop. The resulting circuit is aA. D flip-flop B. SR flip-flopC. T flip-flop D. J K flip-flop

34. A carry look ahead adder is frequency usedfor addition because, itA. costs less B. used fewer gatesC. is faster D. is more accurate

35.J Q

CLOCK

K Q

J Q

K Q K Q

J Q

A. Shift Register B. Mod-6 CounterC. Mod-2 Counter D. Mod-3 Counter

36. The number of full and half-adders requiredto add 16-bit numbers is :A. 1 half-adder, 15 full-addersB. 4 half-adders, 12 full-addersC. 8 half adders, 8 full-addersD. None of the above

37. This will provide end-to-end digital connec-tion for all voice (digitized), data, telemery,facsimile and video applications.A. ISDN B. SNAD. CCITT D. DST

38. A hub in network is aA. the central power supplyB. the server which serves every nodeC. a multi port signal repeater or concentratorD. None of these

39. In a synchronous modem, the receive equal-izer is known asA. statistical equaliserB. compromise equaliserC. impairment equaliserD. adaptive equaliser

40. Simple network management protocol(SNMP) is implemented with a daughter-board isA. the nodesB. the serverC. the hubsD. a separate PC that manages the network

server41. In communication software can be called the

“traffic cop” of a micro-communication sys-tem, then what should the modem be calledA. park B. bridgeC. interface D. link

42. The string 1101 does not belong to the setrepresented byA. (10)*(01)*(00+11)*B. 110*(0+1)C. 1(0+1)*101D. (00+(11)*0)*

43. Let L be a language recognizable by a finiteautomation. The language Front (L) = {Wsuch that W is the prefix of V where V L }is aA. regular languageB. context-free languageC. context sensitive languageD. None of these

44. Choose the function that are periodicA. f x x x cos B. xxxf cos

C. f x x if x sin , ;1 0 0 other wise

D. f x x x ; where x stands for thegreatest integer x

45. Consider the following recurrence relationT (1) = 1

T n T n n for all n 1 1 1 the value

of T m for m2 1 is

A. m m m2 3 2.5 11 20 5

B. m m6 21 39 4

C. m m m6 4 2 3 5

D. None of the above

46. If the following program fragment (assumenegative numbers are stored in 2’s comple-ment form) unsigned i = 1;int j = -4 ;print f (“%4”, i + j);Print X, then print f (“%d”, 8*size of (int);output S (log in the answers are to the basetwo)A. log (x + 3) B. log 8 (x + 3)C. 8* log (x+3)D. an unpredictable value

47. The values of x and y, if x yx yx567 2 5 718 8 8 isA. 4, 3 B. 4, 4C. 4, 5 D. 3, 3

48. The TRAP is one of the interrupts availablein INTEL 8085. Which one of the followingstatements is true of TRAP ?A. it is negative edge triggeredB. it is level triggeredC. it is the +ve edge triggeredD. None of these

49. In some programming language an identi-fier is permitted to be a latter followed byany numbers of letter or digits. If L and Ddenote the set of letters and digits respec-tively, which of the following expressionsdefines an identifier ?A. L D * B. *. DLL

C. L L D. * D. L D

50. Let R = (A, B, C, D, E, F) be a relationscheme with the following dependenciesC F, E A, ECD, AAB. Which ofthe following is a key for R ?A. CD B. ECC. AE D. AC

51. The most appropriate command to removeall records from the current database file isA. ZAP B. PACKC. DELETE FILE D. DELETE ALL

52. An owner-member set in the CODASYLspecifications may haveA. only one member but many member oc-

currenceB. more than one member but only one oc-

currence per memberC. only one owner but many owner occur-

renceD. None of the above

53. The post fix form of A - B(C* D$E) isA. ABCDE$-/* B. ABCDE/-*$C. ABCDE$*/- D. AB/C*DE$

54. Let T(n) be the function defined by T(1) =1, 222 nfornnTnT

A. T(n) = 0 (log n) B. T n n 0

C. T(n) = 0 (n) D. None of the above

55. A complete binary tree with the property thatthe value at each node is at least as large asthe values at its children is known asA. AVL tree B. HeapC. Binary search treeD. Completely balanced tree

56. Consider second equation AB = AC clearly(B) and (C) cannot be answer. Since CD =1 and AC = 1 in (A), (A) satisfies all thethree conditions.The sequence..... is an optimal non preemptive scheduling sequence for the follow-ing jobs which leaves the CPU idle for .....

units of time :Job Arrival time Burst Time

1 0.0 92 0.6 53 1.0 1

A. {2, 1, 3}, 0 B. {1, 2, 3}, 5C. {3, 2, 1}, 0 D. {3, 2, 1}, 1

57. What scheduling algorithm allows processesthat are logical runnable to be temporarilysuspended?A. executes first the job with the leastB. preemptive schedulingC. non-preemptive schedulingD. none of these

58. Locality of reference implies that the pagereference being made by a processA. will always lead to a page faultB. will always to be one of the pages exist-

ing in memoryC. is likely to be to one of the pages used in

the last few page referencesD. none of these

59. function X (M : integer) : integer;var i; integer ;

begini = 0;

while i * i < M do i ; = i + 1x; = i

endThe function call × (N), if N is positive, willreturnA. N B. 1N

C. N 1 D. None of these

60. Every symbolic reference to a memory op-erand has to be assembled asA. (index base, offset)B. off setC. (offset, index base)D. (segment base, offset)

61. The black box in the following figure con-sists of a minimum complexity circuit thatuses only AND, OR and NO gates :

blackbox

XYZ

f (x, y, z)

The function f (x, y, z) = 1 wherever x, y aredifferent and 0 otherwise. In addition the 3inputs x, y, z are never all the same value.Which of the following equation lead to thecorrect design for the minimum complexitycircuit ?A. w’y + xy B. xy + y’z + z’C. x + y’z D. x’y’z’ + yx’z

62. TLB stands forA. Translation Look aside BufferB. Translation Look into BufferC. Translation Look after BufferD. None of these

63. A single instruction to clear the lower fourbits of the accumulator in 8085 assemblylanguage isA. ANI FOH B. ANI OFHC. XRI OFH D. XRI FOH

64. Four systems of mobile phones are in usenow :A. D-AMPS, GSM, CDMA, and PDCB. D-BBMPS, GSM, CDMA and PDCC. D-AMPS, AGSM, CDMA and PDCD. None of the above.

65. The output F of the above multiplexer cir-cuit can be represented by

CCCC

MUX

SELECT

F

AB

A. AB BC CA BC B. A B C C. ABC ABC ABC D. A B

66. Which of the following devices should gethigher priority in assigning interrupts :A. Printer B. Key boardC. Floppy disk D. Hard disk

67. A packet-switching networkA. is freeB. can reduce the cost of using an informa-

tion utilityC. allows communications channels to be

shared among more than one userD. both (B) and (C)

68. An example of a medium-speed, switchedcommunications services isA. data phone 50 B. DDDC. series 1000 D. all the above

69. The number of records contained within ablock of data on magnetic tape is defined bytheA. block definitionB. record per block factorC. blocking factorD. record contain clause

70. Which of the following is a feature of com-puter virus ?A. damage B. propagationC. triggering D. all the above

71. The relative position of the file marker canbe changed via the -A. Fence Register B. Marker callC. EXEC command D. LSEEK call

72. A –––– is an ordered collection of itemsfrom which items may be deleted at one endand into which items may be inserted at theother end.A. Stack B. QueueC. Array D. Graph

73. Which of the following operators can beoverloaded in C++ ?A. size of operatorB. arithmetic operatorC. conditional operatorD. scope resolution operator

74. Consider the following program :main ( ){int i, j, r;i = 100; j = 5; r = 20;Print f (“value of i + j - r is % o \ n”, i + j - r);}What is the output ?A. 85 B. 125C. 55 D. None of these

75. In C a pointer variable to an integer can becreated by the declarationA. int*p; B. int p*;C. int-p; D. int $p;

76. A complete n-ary tree is one in which everynode has 0 or n sons. If x is the number ofinternal nodes of a complete n-ary tree, thenumber of leves in it is given byA. x (n-1) +1 B. xn-1C. x (n+1) D. xn + 1

77. How many value can be held by an array A(-1....m, 1.....m)?A. m B. m2

C. m (m + 1) D. m (m + 2)

78. An N-bit carry look a head adder, where Nis a multiple of 4, employs ICs 74181 (4 bitALU) and 74182 (4 bit carry look head gen-erator). The minimum addition time using thebest architecture for this adder isA. a constantB. proportional to NC. proportional to log ND. None of the above

79. Transaction processing was made possibleby the development ofA. cash register input B. magnetic tapeC. direct access storage D. minicomputer

80. The solution of the differential equationy”+3y’+2y = 0 is of the form

A. c e c ex x1 2

2 B. c e c ex x1 2

3

C. c e c ex x1 2

2 D. c e c ex x1

22

81. If A and B are non-zero square matrices ofthe same order such that AB = 0, thenA. adj A = 0 and adjB = 0B. adjA= 0 or adj B = 0C. |A|= 0 and |B|= 0D. |A|= 0 or |B|= 0

82. Matrix,

ababab

A2

2

is ..........................

A. idempotent B. nilpotentC. orthogonal D. involutory

83. Object modules generated by assemblersthat contain unresolved external referencesare resolved for two or more object mod-ules by a/anA. linker B. loaderC. compiler D. operating system

84. Replacement of an expensive operation bya cheaper one is termed asA.code motionB. reduction in strengthC. loop invariant computationD. none of the above

85. A “link editor” is a program thatA. acts as a link between compiler and user

programB. matches the parameters of the macro

definition with locations of the parametersof the macro call

C. matches the parameters of subroutine defi-nition with the location of parameters ofsubroutine call

D. none of these

86. The fastest type of memory from the fol-lowing list isA. bubble memory B. tapeC. distD. semiconductor memory

87. Each instruction in an assembly program hasthe following fields1. Label field 2. Mnemonic field3. Operand field D. Comment fieldThe correct sequence of these fields isA. 1, 2, 3, 4 B. 1, 2, 4, 3C. 2, 1, 3, 4 D. 2, 1, 4, 3

88. Spooling is most beneficial in a multi pro-gramming environment whereA. most jobs are I/O - boundB. there is limited primary memory and need

for secondary memoryC. most jobs are CPU-boundD. none of these

89. Devices on one network can communicatewith devices on another network via aA. printer server B. utility serverC. gateway D. file server

90. FDDI is aA. star network B. ring networkC. mesh network D. bus based network

91. Consider two regular languages L1 = (a + b)* a and L2 = b (a + b)*. The intersection ofL1 and L2 is given byA. ab (a + b)* B. a (a + b)*bC. b (a + b)*a D. (a + b)* ab

92. The logic of pumping lemma is a good ex-ample ofA. recursion B. iterationC. the pigeon -hole principleD. all the above

93. Consider the languages *

1 1,0/ WWWL R

*2 1,0/# WWNL R , where # is a special

symbol

*1,0/3 WWWL which of the follow-ing is True ?A. L1 is a deterministic CFLB. L2 is a deterministic CFLC. L3 is a deterministic CFLD. None of these

94. Let T(n) be the number of different binarysearch trees on n distinct elements. Then

T n T k T xK

n

1

1 where x is

A. n - k B. n - k - 2C. n - k - 1 D. n - k + 1

95. The dynamic allocation of storage areas withVSAM files is accomplished byA. control splits B. hashingC. relative recording D. overflow areas

96. Which of the following is a type of systemssoftware used on microcomputers ?A. MS - DOS B. PC - DOSC. UNIX D. All of the above

97. Which of the following is not one of the pro-cesses that a high-level language programmust go through before it is ready to be ex-ecuted ?A. linking B. loadingC. controlling D. translation

98. Let A = { 1, 2, 5, 8, 11} which of thefollowing is false ?A. A B. A2

C. A1,8 D. A1,5

99. Picard’s method in numerical methods usesA. forward interpolationB. converging differencesC. successive integrationD. successive differenciation

100. Bug meansA. a logical error in programB. a difficult syntax error in a programC. documenting programs using a efficient

documentation toolD. all the above

1. Which of the following is obtained when theoutput of OR gate is made as input of NOTgate?A. NAND gate B. NOR gateC. AND gate D. NOD gate

2. In 8085 p, memory space in bytes isA. 1M B. 2 MC. 64 K D. 32 K

3. In 8085 p, the instruction time in second is

A. 6102 B. 6105.1

C. 6101 D. 6105.0

4. In a digital computer compiler isA. Electronic deviceB. A mechanical deviceC. A program which translates a high level

program into machine-language programD. An optical device

5. In microprocessor (p), the accumulatorA. Is the principal register which accumu-

lates the result of all arithmetic and logicoperations.

B. Is a register which stores the next in-structions to be executed

C. In a register which holds the current levelof the stack

D. Is a register which contains words usedto modify an instruction address

6. Inp, a flag isA. A two bit flip flopB. A one bit flip flop

C. Either one bit or two bit flip flopD. Neither one bit nor two flip flop

7. In 8085 p, the process technology em-ployed in its manufacture isA. NMOS B. PMOSC. CMOS D. HMOS (nchannel)

8. The input signal in the interrupt system of8085 A microprocessor, which has the high-est priority isA. TRAP B. RST 7.5C. RSTN 6.5 D. RSt 5.5

9. Consider the following segment of C-codeint J, n;

J 1 ;

while J n

*J J 2The number of comparisons made in the ex-ecution of the loop for any n > 0 isA. log2 1n

B. n

C. log2 n

D. log2 1n

10. Consider the following C functionVoid swap (int a, int b){int temp;

temp = a;a = b;b = temp;

}

BRILLIANCE COLLEGEMODEL EXAMINATION - SET -3

In order to exchange the value of two vari-ables x and yA. call swap (x, y)B. call swap (&x, &y)C. swap (x, y) cannot be used as it does not

return any valueD. swap (x, y) cannot be used as the pa-

rameters are passed by value11. Consider the partial implementation of a 2 -

bit counter using T-flip flops following thesequence 0 - 2 - 3 - 1 - 0, as shown below

CLK

MSB

T2 Q2 T1x

LSB

Q1

To complete the circuit, the input x shouldbeA. Q2

1 B. Q Q2 1

C. Q Q1 21 D. Q Q1 2

12. The elements 32, 15, 20, 30, 12, 25, 16 areinserted one by one in the given order in to ama X Heap. The resultant max Heap is

A.

32

25

20 16

30

15 12

B.

32

30

20 16

25

12 15

C.

32

25

16 20

30

15 12

D.

32

30

16 20

25

12 15

13. The language a b c m nm n m n , ,1 is

A. regularB. context-free but not regularC. context sensitive but not context freeD. type-0 but not context sensitive

14. What will this programme display ?# include < stdio.h)>main ( ){float = f ;

f = 10/3;print f (“% f”, f);}A. 3.3 B. 3.0C. 3.1 D. 3

15. Let P (E) denote the probability of the event

E. Given P A P B 1 12, , the value of

P A B/ and P B A/ respectively are

A. 14

12, B. 1

21

4,

C. 12 1, D. 1 1

2,

16. Consider the following three claims mnmknI , where k and m are con-stant

nnII 2012

nnIII 20122 which of these claims arecorrect ?

A. I and II B. I and IIIC. II and III D. I, II and III

17. Let G s a b R S , , , be a context freegrammar where the rule set R is

|| SSbSaS which of the following state-ment is true ?A. G is not ambiguous

B. There exist x, y L G such that xy L G

C. There is a deterministic push down auto-mation that accepts L (G)

D. We can find a deterministic finite stateautomation that accepts L (G)

18. Which of the following types of softwareshould you use if you often need to create,edit and print documents ?A. word processing B. spread sheetC. UNIX D. Desktop Publishing

19. What is the operating system used byMacintosh computers ?A. System 7.0 B. AU/XC. UNIX D. Either (A) or (B)

20. Consider the following pascal declarationstypebyte = 0..7;word = 0..15;num = real ;Var

a : byte ;b, c : word :d : integer ;e : real ;f : char ;

Which of the following pairs of variables arecompatible but are not identical ?A. a and e B. b and cC. d and e D. c and f

21. Which programming language is associatedwith Admiral Grace Hopper ?A. LISP B. CC. BASIC D. COBOL

22. The highest level in the hierarchy of dataorganization is calledA. data bank B. data baseC. data file D. data record

23. Data management systems may be imple-mented asA. System softwareB. Application SoftwareC. Computer programD. All of the above

24. A unit vector perpendicular to both the vec-tors a i j k 2 3 and b i j k 2 is

A. 5

3i j k B. 1

3i j k

C. 1

3i j k D. 1

3i j k

25. If A and B are two events such that P (A) >0 and P (B) 1, then P A B equals

A. 1 P A B P B/

B. 1 P A B P B/

C. 1 P A B P B/

D. 1 P A B P B/ /

26. A binary tree T has n leaf nodes. The num-ber of nodes of degree 2 in T is

A. n2

log B. 9 103

C.n D. 18 25

27. The computer program written in a high levellanguage is called aA. Source programB. Object programC. Machine language programD. None of the above

28. Consider the circuit in figure f implements

multiplex f

A

0123

B

A. ABC ABC ABC

B. A B C

C. A B C

D. AB BC CA

29. The ASCII code 56, represents the charac-terA. V B. 8A.C. a D. carriage return

30. The advantage of CMOS technology over aMOS isA. lower power dissipationB. greater speedC. smaller chip sizeD. fewer masks for fabrication

31. In computer network the following applica-tions are becoming very popularA. Hierachical ApplicationsB. Centralized ApplicationsC. Client/server ApplicationsD. Stand-alone Applications

32. Who invented the modem ?A. Wang Laboratories LtdB. At & T information system, USAC. Apple computers IncD. Digital Equipment Corpn

33. In communication satellite, multiple repeat-ers are known asA. detector B. modulatorC. stations D. transponders

34. What does the acronym (ISDN) stands for?A. Indian Standard Digital NetworkB. Integrated Service Digital NetworkC. Intelligent Service Digital NetworkD. Integrated Service Data Network

35. Which are the essential prime implicationsof the following Boolean function ? f a b c a c ac b c, , ' ' '

A. a c and b c' ' B. ac and bc' 'C. a c and ac' ' D. a c only'

36. The following resolution rule is used in logicprogramming :Derive clause (P v Q) from clauses (P v R),(Q v , R). Which of the following state-ments related to this rule is FALSE ?A. QPRQvRP is logically

validB. RQRPQP is logically

validC. P Q is satisfiable if and only if

RQRP is satisfiable

D. P Q FALSE if and only if both P andQ are unsatisfiable

37. Consider the following recurrence relationT(1) = 1

T n T n n 1 1 for all n 1 . Thevalue of T (m2) for 1m is

A. mm

621 39 4 B. m

m m6

4 2 3 5

C. mm m

23 2 5 11 20 5.

D. mm m m

65 3 34 2 137 104

5

6

38. Consider the following deterministic finitestate automaton M.

1

1

1

0 00

0,1

Let S denote the set of seven bit binary stringsin which the first, the fourth and the last bitsare 1. The number of strings in S that areaccepted by M is :A. 1 B. 5C. 7 D. 8

39. Let G1 = (V, E1) and G2 = (V, E2) be con-nected graphs on the same vertex set V withmore than two vertices. If

2121 , EEVGG is not a connected

graph, then the graph 2121 , EEVGG

A. must have a cycleB. must have a cut-edgeC. cannot have a cut vertexD. has chromatic number strictly greater

than those of G1 and G2.

40. Consider the label sequences obtained by thefollowing pairs of traversals on a labeled bi-nary tree. Which of these pairs identify atree uniquely ?i) preorder and post orderii) inorder and post orderiii) preorder and inorderiv) level order and postorderA. (i) only B. (ii), (iii)C. (iii) only D. (iv) only

41. Consider the following grammar

idF

SR

FRS

/*

In the predictive parser table, M of the gram-mar the entries M [S, id] and M [R, $ ]respectivelyA. S FR and R

B. S FR and

C. S FR and R S *

D. F id and R

42. Consider the circuit in the diagram. The operator represents Ex - OR. The D flip-flops are initialized to zeroes (cleared).

clk Q

Q D Q D Q D

CLOCK

data

clkclk

q0q1q2

The following data : 100110000 is suppliedto the “data” terminal in nine clock cycles.After that the values of q2 q1 q0 areA. 000 B. 101C. 010 D. 001

43. Consider the series

5.00,8

9

21 xnx

nxnx

obtained from the Newton-Raphson method.

The series converges toA. 1.6 B. 1.4 C. 1.5 D. 2

44. In the Karnaugh map shown below, X de-notes a don’t care term. What is the mini-mal form of the function represented by theKarnaugh map ?

cd

1 1 1

X

X

00

01 11 1000

01

11

10

ab

1 1 X

A. b d a b d. . . B. b d a d. .

C. a b b d a d. . . D. a b b d a b d. . . .

45. If L and L are recursively enumerable thenL isA. context-freeB. recursiveC. regularD. context-sensitive

46. Which of the following is a valid first orderformula ?(Here and are first order formulae withx as their only free variable)

A. x x x

B. x x ^

C. x x x

D. xxx

47. Which of the following page replacement al-gorithms suffers from Belady’s anomaly?A. FIFOB. optimal replacementC. LRUD. both (A) and (B)

48. A high paging rateA. always creates a slow systemB. may cause a high I/O rateC. keeps the system running wellD. None of the above

49. SemaphoresA. are used for memory managementB. are used to do I/OC. synchronize critical resources to prevent

dead lockD. None of the above

50. Which of the following requires a devicedriver ?A. Cache B. DiskC. Register D. Main memory

51. When the result of a computation dependson the speed of the processes involved thereis said to beA. a time lock B. a dead lockC. cycle stealing D. race condition

52. An algorithm is made up of 2 modules M1and M2. If order of M1 is f(n) and M2 is g(N) then the order of the algorithm isA. f(n) × g(n) B. f(n) + g (n)C. max (f (n), g (n)D. min (f(n), g(n)

53. In the following Pascal program segment,what is the value of x after the execution ofthe program segmentx : = _ 10 ; y : = 20;If x > y then if x < 0 then x : = abs (x) elsex : = 2*x;A. 10 B. _10C. _ 20 D. None of these

54. Data encrypton techniques are particularlyuseful forA. reducing storage space requirementB. improving data integrityC. protecting data in data communication sys-

temsD. all the above

55. The two basic types of record-access meth-ods are :A. sequential and randomB. direct and immediateC. on-line and real timeD. all the above

56. Let I and J be two non-negative integers anddefine Q (m, n) by

Q m nQ m n n

if m nif m n

,,

02

Then for all non-negative integers m,Q (m, 3) isA. 4 B. m - 4C. 2i - 2j D. 2* (m div j)

57. Let * be defined as x*y = *+y. Let Z = x * y.Value of Z* x isA. x B. 1C. x + y D. 0

58. The errors that can be pointed out by thecompiler areA. logical errorsB. internal errorsC. syntax errorsD. none of these

59. A graph that shows the basic blocks and theirsuccessor relationship is calledA. flow graph B. DAGC. control graph D. none of these

60. An instruction in a programming languagethat is replaced by a sequence of instruc-tions prior to assembly or compiling is known asA. label B. macroC. literal D. procedure name

61. In a compiler the module the checks everycharacter of the source text is calledA. the code optimiserB. the lexical analyserC. the code generatorD. the syntax analyser

62. Which is not true about ‘syntax’ and ‘se-mantics’ parts of a computer language ?A. semantics is the responsibility of the pro-

grammerB. syntax is generally checked by the pro-

grammerC. semantics is checked mechanically by a

computerD. both (A) and (C)

63. A signal of power 1000 milliwatts (mw) isinserted into a transmission line, and at somedistance the measured power is 10 milliwatts.The loss in signal power in decibels isA. -2 dB B. -20 dBC. -30 dB D. +30 dB

64. The total size of address space in a virtualmemory system is limited byA. the length of MARB. the available main memoryC. the available secondary storageD. all the above

65. Match the followinga. BGE p ZV N V

b. BMI q N V

c. BGT r ZV N V 1

d. BLE s N 1

A. a - q ; b-s, c-p, d-rB. a-r, b-p, c-q, d-sC. a-p, b-r, c-q, d-sD. a-s, b-r, c-p, d-q

66. In order to complement the lower ordernibble of the accumulator, one can useA. XRI OFh B. CMAC. ORI OFh D. ANI OFh

67. The following arrangement of master-slaveflip-flops

J K

P 0

D

Q 1

Clock

1

It has the initial state OP, Q as 0, 1 (respec-tively). After three clock cycles the outputstate P, Q is (respectively)A. 1, 0 B. 1, 1C. 0, 0 D. 0, 1

68. Two NAND gates having open collector out-puts and tied together as shown in figure.The logic function y, implemented by the cir-cuit is,

A

ABC

DE

DEABCgateNORDEABCY

A. y = ABC + DE B. y = ABC + DE

C. y = ABC DE D. y ABC DE

69. An advantage of memory interlacing is thatA. a larger memory is obtainedB. the cost of the memory is reducedC. a non-volatile memory is obtainedD. effective speed of the memory is in-

creased70. The threshold level for logic 1 in the TTL

family isA. any voltage above 2.5VB. any voltage below 5.0VC. any voltage between 0.8 V and 5.0VD. any voltage below Vce but above 2.8V

71. Which of the following is possible in a tokenpassing bus network ?A. in-service expansionB. unlimited distanceC. unlimited number of stationsD. None of these

72. The device that converts computer outputfor transmission over telephone lines is calleda/anA. modem B. interpreterC. I/O port D. interface

73. Data communication monitors available onthe software marked includeA. BPL B. TOTALC. Telenet D. None of these

74. Any TM with m symbols and n states canbe simulated by another TM with just 2 sym-bols and less thanA. mn statesB. 8 mn statesC. 4 mn + 8 statesD. 8 mn + 4 states

75. Which one of the following regular expres-sions over {0, 1} denotes the set of all stringsnot containing 100 as a substring ?A. 0*1*01 B. 0*1010*C. 0*(1+0)* D. 0*(10+1)*

76. Let a and b be two regular expressions then

a b* * is equivalent to

A. a b B. a b *

C. b a * D. b a* * *

77. The expression (a*b)* C op ...... where ‘op’is one of ‘+’, ‘*’ and ‘ ’ (exponentiation)can be evaluated on a CPU with a singleregister without storing the value of (a*b) ifA. ‘op’ is ‘+’ or ‘*’ B. ‘op’ is ‘ ’ or ‘*’C. ‘op’ is ‘ ’ or ‘+’ D. None of the above

78. Let f R R: be defined by

f xx

xx

xx

x

2

2

11 1

1

2

then the value of f f f 1 75 0 5 1 5. . . isA. 0 B. 2C. 1 D. -1

79. RST 7.5 interrupt in 8083 microprocessorexecutes service routing from interrupt vec-tor locationA. 0000H B. 003CHC. 0034H D. 0075 H

80. The postfix expression for the infix expres-sion A+B*(C+D)/F+D*E isA. AB + CD+*F/D+E*B. ABCD +*F/DE* ++C. A*B+CD/F*DE++D. A+*BCD/F*DE++

81. In what order the elements of a pushdownstack are accessedA. First In First out (FIFO)B. Last In Last Out (LILO)C. Last In First out(LIFO)D. None of the above

82. (G, *) is an abelian group, thenA. x x 1 , for any x belonging to GB. x x 2 , for any x belonging to GC. x y x y* *2 2 2 , for any x, y belong-

ing to GD. G is of finite order

83. If digital data rate of 9600 bps is encodedusing 8 - level phase shift keying (PSK)method, the modulation rate isA. 3200 bandsB. 9600 bandsC. 4800 bandsD. 1200 bands

84. Bubble memories are preferable to floppydisks becauseA. cost needed to store a bit is lessB. of their higher transfer rateC. of their realibilityD. they consume less power

85. A multiplexor with a 4 bit data select input isaA. 16:1 multiplexor B. 8:1 multiplexorC. 4 :1 multiplexor D. 2:1 multiplexor

86. Which of the following are the typical char-acteristics of a RISC machine ?A. multiple register setsB. highly pipelinedC. instruction taking multiple cyclesD. both (A) and (B)

87. A system program that combines the sepa-rately compiled modules of a program into aform suitable for executionA. load and go B. cross compilerC. linking loader D. assembler

88. Consider the left-recursive grammar :S a/bA Ac/Sdwhich of the following grammars is equiva-lent to the grammar given above when theleft-recursion is removed ?A. S Aa|b

A bdA’’A’ cA’|adA’|e

B. S Aa|bA ad|bd|cA

C. S bA’’A c|da

D. S Aa|bA Ac|Aad|bd

89. Type checking is normally done duringA. Lexical analysisB. Syntax analysis

C. Code optimizationD. Syntax directed translation

90. Which two files are used during operationof the RDBMS ?A. query language and utilitiesB. data dictionary and transaction logC. data manipulation language and query lan-

guageD. None of these

91. Consider the scheme R = (STUV) and thedependencies S T, TTU, UV andV S. Let R = (R1 and R2) be a decom-position such that R R1 2 . The decom-position isA. Not in 2 NFB. In 3NF but not in 2 NFC. In 2NF but not in 3NFD. In both 2 NF and 3 NF

92. The correct matching for the following pairsisa. All pairs shortest pathsb. Quick sortc. Minimum weight spanning treed. Connected components1. Greedy2. Detph-First search3. Dynamic Programming4. Divide and ConquerA. a - 2, b - 4, c-1, d-3B. a - 3, b - 4, c -1, d-2C. a - 3, b - 4, c -2, d -1D. a - 4, b-1, c-2, d-3

93. Heap allocation is required for languagesA. that support recursionB. that use dynamic scope rulesC. that support dynamic data structuresD. None of the above

94. Which of the following filename extensionsuggests that the file is a backup copy ofanother file?A. COM B. BAKC. TXT D. BAS

95. The function’s performed by the paging soft-ware isA. sharing and protectionB. management of the physical address

spaceC. implementation of the access environ-

ment for all programs in the systemD. all the above

96. Consider the grammar with the followingtranslation rules and E as the start symbol.

E E T E value E value T value

T E value T value

T T F T value T value f value

F T value F value

F num F value num value

1 1

1

1 1

1

# . * .

. .

& . .

. .

. .

Compute E. value for the root of the parsetree for the expression : 2 # 3 & 5 # 6 & 4.A. 160 B. 40C. 180 D. 200

97. Relocation bits used by relocating loader are

specified (generated) byA. linkerB. micro processorC. relocating loader itselfD. None of these

98. A file organization component of a VSAMfile isA. keyed sequential data setB. entry sequential data setC. relative record data setD. all the above

99. A full binary tree with n non-leaf nodes con-tainsA. n + 1 nodesB. 2n + 1 nodesC. 2n nodesD. n2log nodes

100. The cheapest modems can transmitA. 1200 bits per secondB. 2400 bits per secondC. 300 bits per secondD. None of the above