LOGIC GATE

ComputerScienceandEngineering

1992 ComputerScienceandEngineering
Choosethecorrectalternatives(morethanonemaybecorrect)andwritethecorrespondinglettersonly Q.1 Theoperationwhichiscommutativebutnotassociativeis (A)AND Q.2 Q.3 (A)ExORgates Bitslice processors (A)Canbecascadedtogetanydesiredwordlengthprocessor (B)Speedofoperationisindependentofthewordlengthconfigured (C)Dontcontainanythingequivalentofprogramcounterinanormalmicroprocessor (D)ContainonlythedatapathofanormalCPU Q.4 PCHLisaninstructionin8085whichtransfersthecontentsoftheregisterpairHLtoPC.Thisisnotaverycommonly usedinstructionasitchangestheflowofcontrolinratherunstructuredfashion.Thisinstructioncanbeusefulin implementing (A)If........then.........else.......construct (C)Case.........construct Q.5 (A)Errordetection Q.6 (B)While........construct (D)Call..........construct (B)Errorcorrection (B)OR (B)Multiplexers (C)EXOR (C)Halfadders (D)NAND (D)ORgates

Alldigitalcircuitscanberealizedusingonly

Startandstopbitsdonotcontainaninformationbutareusedinserialcommunicationfor (C)Synchronization

WhichofthefollowingproblemsisnotNPhard? (A)Hamiltaniancircuitproblem

(C)Findingbiconnectedcomponentsofagraph Q.7 A23treeisatreesuchthat

(a)Allinternalnodeshaveeither2or3children

(b)Allpathsfromroottotheleaveshavethesamelength.

LOGIC GATE
(B)5 (B)6edges,4vertices (C)6 (C)10edges,5vertices (B)Quicksort (C)Mergesort (B)2 (C)7

(D)Slowingdownthecommunication (B)The0/1Knapsackproblem

(D)Thegraphcolouringproblem

Thenumberofinternalnodesofa23treehaving9leavescouldbe (A)4 Q.8 (A)9edges,6vertices Q.9 (D)7 (D)9edges,5vertices Anonplanergraphwithminimumnumberofverticeshas

3 Followingalgorithm(s)canbeusedtosortnintegersintherange 1.....n in0(n)time

(A)Heapsort Q.10

Ataparticulartimeofcomputationthevalueofacountingsemaphoreis7.Then20Poperationsand15vopera tionswerecompletedonthissempahore.Theresultingvalueofthesemaphoreis (A)42 (D)12

CS1992, PageNo.1of2 LOGICGATEStudies,HeadOffice:Raipur CS ForDetailsContact:09826161828 www.logicgate.co.in email:info@logicgate.co.in

STUDIES

(D)Redixsort

LOGIC GATE
Q.11

ComputerScienceandEngineering

Acomputersystemhas6tapedrives,withnprocesscompletingforthem.Eachprocessmayneed3tapedrives.The maximumvalueofnforwhichthesystemisguaranteedtobedeadlockfreeis (A)2 (B)3 (C)4 (D)1

Q.12

Whichofthefollowingisanexampleofaspooleddevice? (A)Theterminalusedtotheinputdataforaprogrambeingexecuted (B)Thesecondarymemorydeviceinavirtualmemorysystem (C)Alineprinterusedtoprinttheoutputofanumberofjobs (D)Noneoftheabove

Q.13

Foracontextfreegrammar,FOLLOW(A)isthesetofterminalsthatcanappearimmediatelytotherightofnon terminalAissomesentertialform.WedefinetwosetsLFOLLOW(A)andRFOLLOW(A)bereplacingtheword sententialbyleftmostsententialandrightmostsententialrespectivelyinthedefinitionofFOLLOW(A). Whichofthefollowingstatementsis/aretrue? (A)FOLLOW(A)andFOLLOW(A)maybedifferent (C)Allthethreesetsareidentical (B)FOLLOW(A)andRFOLLOW(A)arealwaysthesame (D)Allthethreesetsarediffenrent

Q.14

ConsidertheSLR(1)andLALR(1)parsingtablesforacontextfreegrammar.Whichofthefollowingstatementsis/are (A)Thegotopartofbothtablesmaybedifferent

(C)Thereduceentriesinthetablesmaybedifferent Q.15 (A) ( x ) P ( x ) ( x ) Q ( x ) ( x ){P ( x ) Q ( x )}

Whichofthefollowingpredicatecalculusstatementsis/arevalid?

(C) ( x ){P ( x ) Q ( x )} ( x ) P ( x ) ( x ) Q ( x ) Q.16 Whichofthefollowingis/aretautology? (A) a b b c Q.17

Whichofthefollowingregularexpressionidentitiesaretrue? (A) r

( * ) = r*

Q.18

IfGisacontextfreegrammarandwisastringoflength1inL(G),howlongisaderivationofwinG,ifGischomsky normalform? (A)2l (B)2l+1 (C)2l1 (D)l

LOGIC GATE
(B) a b b c (C) a b ( b c )
* * (B) r s = ( r + s )

(B)Theshiftentriesareidenticalinboththetables (D)Theerrorentriesinthetablesmaybedifferent

(B) ( x ) P ( x ) ( x ) Q ( x ) ( x ){P ( x ) Q ( x )} (D) ( x ){P ( x ) Q ( x )} ( x ) P ( x ) ( x ) Q ( x )

( )

(C) ( r + s )* = r * + s*

Q.19

Contextfreelanguageare (A)Closedunderunion (C)Closedunderintersection (B)Closedundercomplementation (D)ClosedunderKleeneclosure

Q.20

Inwhichofthecasesstatedbelowisthefollowingstatementtrue? ForeverynondeterministricmachineM1thereexistsanequivalentdeterministicmachineM2recognizingthesame language (A)M1isnondeterministicfiniteautomaton (C)M1isanondeterministicTuringmachine (B)M1isanondeterministicPDA (D)FornomachineM1usetheabovestatementTrue

***ENDOFTHEQUESTIONPAPER***
CS1992, PageNo.2of2 LOGICGATEStudies,HeadOffice:Raipur CS ForDetailsContact:09826161828 www.logicgate.co.in email:info@logicgate.co.in

STUDIES

true?

(D) a b ( b c )

(D) r * s* = r * + s*