Upload 3 files

test.csv

@@ -1,94 +1,94 @@
-Question,Tag,label,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Zero,has,two,representations,in,Sign,magnitude,2,s,complement,1,s,complement,None,of,the,above,,Number,Representation,118,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Your,are,given,the,following,four,bytes,,10100011,,110111,,11101001,,10101011,Which,of,the,following,are,substrings,of,the,base,64,encoding,of,the,above,four,bytes,zdp,fpq,qwA,oze,,Network,Security,113,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-You,are,given,three,coins,one,has,heads,on,both,faces,the,second,has,tails,on,both,faces,and,the,third,has,a,head,on,one,face,and,a,tail,on,the,other,You,choose,a,coin,at,random,and,toss,it,and,it,comes,up,heads,The,probability,that,the,other,face,is,tails,is,dfrac,1,4,,dfrac,1,3,,dfrac,1,2,,dfrac,2,3,,,Bayes,Theorem,7,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-You,are,given,the,postorder,traversal,P,,of,a,binary,search,tree,on,the,n,elements,1,2,dots,,n,You,have,to,determine,the,unique,binary,search,tree,that,has,P,as,its,postorder,traversal,What,is,the,time,complexity,of,the,most,efficient,algorithm,for,doing,this,Theta,log,n,Theta,n,Theta,n,log,n,None,of,the,above,as,the,tree,cannot,be,uniquely,determined,,Binary,Search,Tree,9,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Write,a,constant,time,algorithm,to,insert,a,node,with,data,D,just,before,the,node,with,address,p,of,a,singly,linked,list,,Linked,Lists,93,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Write,a,concurrent,program,using,ext,parbegin,parend,and,semaphores,to,represent,the,precedence,constraints,of,the,statements,S_1,to,S_6,as,shown,in,figure,below,,Process,Synchronization,140,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-With,regards,to,the,expressive,power,of,the,formal,relational,query,languages,which,of,the,following,statements,is,true,Relational,algebra,is,more,powerful,than,relational,calculus,Relational,algebra,has,the,same,power,as,relational,calculus,Relational,algebra,has,the,same,power,as,safe,relational,calculus,None,of,the,above,,Relational,Calculus,159,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-While,opening,a,TCP,connection,the,initial,sequence,number,is,to,be,derived,using,a,time,of,day,ToD,clock,that,keeps,running,even,when,the,host,is,down,The,low,order,32,bits,of,the,counter,of,the,ToD,clock,is,to,be,used,for,the,initial,sequence,numbers,The,clock,counter,increments,once,per,milliseconds,The,maximum,packet,lifetime,is,given,to,be,64,s,Which,one,of,the,choices,given,below,is,closest,to,the,minimum,permissible,rate,at,which,sequence,numbers,used,for,packets,of,a,connection,can,increase,,0,15,s,0,64,s,0,135,s,0,327,s,,,Tcp,186,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,the,following,is,FALSE,Complement,of,a,recursive,language,is,recursive,A,language,recognized,by,a,non,deterministic,Turing,machine,can,also,be,recognized,by,a,deterministic,,Turing,machine,Complement,of,a,context,free,language,can,be,recognized,by,a,Turing,machine,If,a,language,and,its,complement,are,both,recursively,enumerable,then,it,is,recursive,Complement,of,a,non,recursive,language,can,never,be,recognized,by,any,Turing,machine,,Closure,Property,22,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,scheduling,policy,is,most,suitable,for,a,time,shared,operating,system,Shortest,Job,First,Round,Robin,First,Come,First,Serve,Elevator,,Process,Schedule,139,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,these,first,order,logic,formulae,is,valid,forall,x,left,P,left,x,right,implies,Q,left,x,right,right,implies,left,u2200xP,left,x,right,implies,forall,xQ,left,x,right,right,exists,x,left,P,left,x,right,vee,Q,left,x,right,right,implies,left,exists,xP,left,x,right,implies,exists,xQ,left,x,right,right,exists,x,left,P,left,x,right,wedge,,Q,left,x,right,right,iff,left,exists,xP,left,x,right,wedge,exists,xQ,left,x,right,right,forall,x,exists,y,P,left,x,y,right,implies,exists,y,forall,x,P,left,x,y,right,,First,Order,Logic,60,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,statements,is,TRUE,about,every,n,imes,n,matrix,with,only,real,eigenvalues,If,the,trace,of,the,matrix,is,positive,and,the,determinant,of,the,matrix,is,negative,at,least,one,of,its,eigenvalues,is,negative,If,the,trace,of,the,matrix,is,positive,all,its,eigenvalues,are,positive,If,the,determinant,of,the,matrix,is,positive,all,its,eigenvalues,are,positive,If,the,product,of,the,trace,and,determinant,of,the,matrix,is,positive,all,its,eigenvalues,are,positive,,Eigen,Value,50,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,statements,is,FALSE,There,exist,context,free,languages,such,that,all,the,context,free,grammars,generating,them,are,ambiguous,An,unambiguous,context,free,grammar,always,has,a,unique,parse,tree,for,each,string,of,the,language,generated,by,it,Both,deterministic,and,non,deterministic,pushdown,automata,always,accept,the,same,set,of,languages,A,finite,set,of,string,from,some,alphabet,is,always,a,regular,language,,Non,Determinism,116,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,statements,is,FALSE,TCP,guarantees,a,minimum,communication,rate,TCP,ensures,in,order,delivery,TCP,reacts,to,congestion,by,reducing,sender,window,size,TCP,employs,retransmission,to,compensate,for,packet,loss,,Tcp,186,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,statements,is,FALSE,Packet,switching,leads,to,better,utilization,of,bandwidth,resources,than,circuit,switching,Packet,switching,results,in,less,variation,in,delay,than,circuit,switching,Packet,switching,requires,more,per,packet,processing,than,circuit,switching,Packet,switching,can,lead,to,reordering,unlike,in,circuit,switching,,Network,Switching,114,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,regular,expressions,over,0,1,denotes,the,set,of,all,strings,not,containing,ext,100,as,substring,a,0,1,0,b,0,1010,c,0,1,1,d,0,10,1,,Regular,Expressions,154,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,regular,expressions,is,NOT,equivalent,to,the,regular,expression,a,b,c,a,b,c,a,b,c,ab,c,a,b,c,,Regular,Expressions,154,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,problems,is,undecidable,Deciding,if,a,given,context,free,grammar,is,ambiguous,Deciding,if,a,given,string,is,generated,by,a,given,context,free,grammar,Deciding,if,the,language,generated,by,a,given,context,free,grammar,is,empty,Deciding,if,the,language,generated,by,a,given,context,free,grammar,is,finite,,Decidability,38,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,is,TRUE,for,any,simple,connected,undirected,graph,,with,more,than,2,vertices,,,No,two,vertices,have,the,same,degree,,,At,least,two,vertices,have,the,same,degree,,,At,least,three,vertices,have,the,same,degree,,,All,vertices,have,the,same,degree,,Degree,Of,Graph,40,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,is,NOT,shared,by,the,threads,of,the,same,process,Stack,Address,Space,File,Descriptor,Table,Message,Queue,,Threads,188,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,is,FALSE,There,is,a,unique,minimal,DFA,for,every,regular,language,Every,NFA,can,be,converted,to,an,equivalent,PDA,Complement,of,every,context,free,language,is,recursive,Every,nondeterministic,PDA,can,be,converted,to,an,equivalent,deterministic,PDA,,Non,Determinism,116,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,is,false,The,set,of,all,bijective,functions,on,a,finite,set,forms,a,group,under,function,composition,The,set,1,2,dots,p,1,forms,a,group,under,multiplication,mod,p,where,p,is,a,prime,number,The,set,of,all,strings,over,a,finite,alphabet,forms,a,group,under,concatenation,A,subset,S,eq,emptyset,of,G,is,a,subgroup,of,the,group,langle,G,rangle,if,and,only,if,for,any,pair,of,elements,a,b,in,S,a,b,1,,in,,S,,Sets,169,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,is,,FALSE,User,level,threads,are,not,scheduled,by,the,kernel,When,a,user,level,thread,is,blocked,all,other,threads,of,its,process,are,blocked,Context,switching,between,user,level,threads,is,faster,than,context,switching,between,kernel,level,threads,Kernel,level,threads,cannot,share,the,code,segment,,Threads,188,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,following,does,NOT,equal,begin,vmatrix,1,amp,x,amp,x,2,1,amp,y,amp,y,2,1,amp,z,amp,z,2,end,vmatrix,A,begin,vmatrix,1,amp,x,x,1,amp,x,1,1,amp,y,y,1,amp,y,1,1,amp,z,z,1,amp,z,1,end,vmatrix,B,begin,vmatrix,1,amp,x,1,amp,x,2,1,1,amp,y,1,amp,y,2,1,1,amp,z,1,amp,z,2,1,end,vmatrix,C,begin,vmatrix,0,amp,x,y,amp,x,2,y,2,0,amp,y,z,amp,y,2,z,2,1,amp,z,amp,z,2,end,vmatrix,D,begin,vmatrix,2,amp,x,y,amp,x,2,y,2,2,amp,y,z,amp,y,2,z,2,1,amp,z,amp,z,2,end,vmatrix,,Determinant,41
-Which,one,of,the,following,circuits,is,,NOT,,equivalent,to,a,2,input,XNOR,exclusive,NOR,gate,,,Logic,Gates,94,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,one,of,the,first,order,predicate,calculus,statements,given,below,correctly,expresses,the,following,English,statement,,Tigers,and,lions,attack,if,they,are,hungry,or,threatened,u2200x,tiger,x,u2227,lion,x,u2192,hungry,x,u2228,threatened,x,u2192,attacks,x,u2200x,tiger,x,u2228,lion,x,u2192,hungry,x,u2228,threatened,x,u2227,attacks,x,u2200x,tiger,x,u2228,lion,x,u2192,attacks,x,u2192,hungry,x,u2228,threatened,x,u2200x,tiger,x,u2228,lion,x,u2192,hungry,x,u2228,threatened,x,u2192,attacks,x,,First,Order,Logic,60,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,rational,calculus,expression,is,not,safe,left,t,mid,exists,u,in,R_1,left,t,A,u,A,right,land,eg,exists,s,in,R_2,left,t,A,s,A,right,right,left,t,mid,forall,u,in,R_1,left,u,A,x,Rightarrow,exists,s,in,R_2,left,t,A,s,A,land,s,A,u,A,right,right,right,left,t,mid,eg,t,in,R_1,right,left,t,mid,exists,u,in,R_1,left,t,A,u,A,right,land,exists,s,in,R_2,left,t,A,s,A,right,right,,,Relational,Calculus,159,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,tuple,relational,calculus,expression,s,is,are,equivalent,to,forall,t,in,r,left,P,left,t,right,right,eg,exists,t,in,r,left,P,left,t,right,right,exists,t,otin,r,left,P,left,t,right,right,eg,exists,t,in,r,left,eg,P,left,t,right,right,exists,t,otin,r,left,eg,P,left,t,right,right,I,only,II,only,III,only,III,and,IV,only,,Relational,Calculus,159,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,transport,layer,protocols,is,used,to,support,electronic,mail,A,SMTP,B,IP,C,TCP,D,UDP,Tcp,186,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,three,statements,are,true,Prove,your,answer,The,union,of,two,recursive,languages,is,recursive,The,language,O,n,mid,n,ext,is,a,prime,is,not,regular,Regular,languages,are,closed,under,infinite,union,,Closure,Property,22,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,system,calls,results,in,the,sending,of,SYN,packets,socket,bind,listen,connect,,Sockets,172,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,true,If,a,language,is,context,free,it,can,always,be,accepted,by,a,deterministic,push,down,automaton,The,union,of,two,context,free,languages,is,context,free,The,intersection,of,two,contest,free,languages,is,a,context,free,The,complement,of,a,context,free,language,is,a,context,free,,Context,Free,Language,27,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,true,for,every,planar,graph,on,n,vertices,The,graph,is,connected,The,graph,is,Eulerian,The,graph,has,a,vertex,cover,of,size,at,most,frac,3n,4,The,graph,has,an,independent,set,of,size,at,least,frac,n,3,,Graph,Planarity,75,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,TRUE,Every,turning,machine,recognizable,language,is,recursive,The,complement,of,every,recursively,enumerable,language,is,recursively,enumerable,The,complement,of,a,recursive,language,is,recursively,enumerable,The,complement,of,a,context,free,language,is,context,free,The,set,of,turning,machines,which,do,not,halt,on,empty,input,forms,a,recursively,enumerable,set,,Recursive,And,Recursively,Enumerable,Languages,152,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,true,As,the,number,of,entries,in,a,hash,table,increases,the,number,of,collisions,increases,Recursive,programs,are,efficient,The,worst,case,complexity,for,Quicksort,is,O,n,2,Binary,search,using,a,linear,linked,list,is,efficient,I,and,II,II,and,III,I,and,IV,I,and,III,,Linked,Lists,93,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,false,The,Halting,Problem,of,Turing,machines,is,undecidable,Determining,whether,a,context,free,grammar,is,ambiguous,is,undecidable,Given,two,arbitrary,context,free,grammars,G_1,and,G_2,it,is,undecidable,whether,L,G_1,L,G_2,Given,two,regular,grammars,G_1,and,G_2,it,is,undecidable,whether,L,G_1,L,G_2,,,Decidability,38,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,false,Every,NFA,can,be,converted,to,an,equivalent,DFA,Every,non,deterministic,Turing,machine,can,be,converted,to,an,equivalent,deterministic,Turing,machine,Every,regular,language,is,also,a,context,free,language,Every,subset,of,a,recursively,enumerable,set,is,recursive,,Recursive,And,Recursively,Enumerable,Languages,152,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,false,a,Every,finite,subset,of,a,non,regular,set,is,regular,b,Every,subset,of,a,regular,set,is,regular,c,Every,finite,subset,of,a,regular,set,is,regular,d,The,intersection,of,two,regular,sets,is,regular,Regular,Languages,157,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,false,,A,tree,with,a,n,nodes,has,n,u2013,1,edges,,A,labeled,rooted,binary,tree,can,be,uniquely,constructed,given,its,postorder,and,preorder,traversal,results,,A,complete,binary,tree,with,n,internal,nodes,has,n,1,leaves,,The,maximum,number,of,nodes,in,a,binary,tree,of,height,h,is,2,h,1,1,,Trees,194,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,are,TRUE,for,undirected,graphs,P,Number,of,odd,degree,vertices,is,even,Q,Sum,of,degrees,of,all,vertices,is,even,,P,only,,Q,only,,Both,P,and,Q,,Neither,P,nor,Q,,Degree,Of,Graph,40,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,is,are,FALSE,For,every,non,deterministic,Turing,machine,there,exists,an,equivalent,deterministic,Turing,machine,Turing,recognizable,languages,are,closed,under,union,and,complementation,Turing,decidable,languages,are,closed,under,intersection,and,complementation,Turing,recognizable,languages,are,closed,under,union,and,intersection,,,1,and,4,only,,,1,and,3,only,,,2,only,,,3,only,,Closure,Property,22,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,are,TRUE,S1,,TCP,handles,both,congestion,and,flow,control,S2,,UDP,handles,congestion,but,not,flow,control,S3,,Fast,retransmit,deals,with,congestion,but,not,flow,control,S4,,Slow,start,mechanism,deals,with,both,congestion,and,flow,control,S1,S2,and,S3,only,S1,and,S3,only,S3,and,S4,only,S1,S3,and,S4,only,,Network,Protocols,112,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statements,about,regular,languages,is,NOT,true,Every,language,has,a,regular,superset,Every,language,has,a,regular,subset,Every,subset,of,a,regular,language,is,regular,Every,subset,of,a,finite,language,is,regular,,Regular,Languages,157,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statement,s,is,TRUE,A,hash,function,takes,a,message,of,arbitrary,length,and,generates,a,fixed,length,code,A,hash,function,takes,a,message,of,fixed,length,and,generates,a,code,of,variable,length,A,hash,function,may,give,the,same,hash,value,for,distinct,messages,I,only,II,and,III,,only,I,and,III,,only,II,,only,,Hashing,80,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,statement,is,FALSE,All,recursive,sets,are,recursively,enumerable,The,complement,of,every,recursively,enumerable,sets,is,recursively,enumerable,Every,Non,empty,recursively,enumerable,set,is,the,range,of,some,totally,recursive,function,All,finite,sets,are,recursive,The,complement,of,every,recursive,set,is,recursive,,Recursive,And,Recursively,Enumerable,Languages,152,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,socket,API,functions,converts,an,unconnected,active,TCP,socket,into,a,passive,socket,connect,bind,listen,accept,,Sockets,172,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,sets,of,component,s,is,are,sufficient,to,implement,any,arbitrary,Boolean,function,XOR,gates,NOT,gates,2,to,1,multiplexers,AND,gates,XOR,gates,Three,input,gates,that,output,A,B,C,for,the,inputs,A,B,and,C,,,Functional,Completeness,65,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,set,can,be,recognized,by,a,Deterministic,Finite,state,Automaton,The,numbers,1,2,4,8,dots,2,n,dots,written,in,binary,The,numbers,1,2,4,8,dots,2,n,dots,,written,in,unary,The,set,of,binary,string,in,which,the,number,of,zeros,is,the,same,as,the,number,of,ones,The,set,1,101,11011,1110111,dots,,,Finite,Automata,59,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,sequences,of,array,elements,forms,a,heap,23,17,14,6,13,10,1,12,7,5,23,17,14,6,13,10,1,5,7,12,23,17,14,7,13,10,1,5,6,12,23,17,14,7,13,10,1,12,5,7,,Heap,81,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,scheduling,algorithms,is,non,preemptive,Round,Robin,First,In,First,Out,Multilevel,Queue,Scheduling,Multilevel,Queue,Scheduling,with,Feedback,,Process,Schedule,139,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,relational,query,languages,have,the,same,expressive,power,Relational,algebra,Tuple,relational,calculus,restricted,to,safe,expressions,Domain,relational,calculus,restricted,to,safe,expressions,,II,and,III,only,I,and,II,only,I,and,III,only,I,II,and,III,,Relational,Calculus,159,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,regular,expression,identities,are,true,A,r,r,B,r,S,r,s,C,r,s,r,s,D,r,s,r,s,,Regular,Expressions,154,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,query,transformations,i,e,replacing,the,l,h,s,expression,by,the,r,h,s,expression,is,incorrect,R1,,and,R2,,are,relations,C1,,and,C2,,are,selection,conditions,and,A1,,and,A2,,are,attributes,of,R1,A,sigma_,C_1,left,sigma_,C_2,left,R_1,right,right,o,,sigma_,C_2,left,sigma_,C_1,left,R_1,right,right,B,sigma_,C_1,left,pi_,A_1,left,R_1,right,right,o,,pi_,A_1,left,sigma_,C_1,left,R_1,right,right,C,sigma_,C_1,left,R_1,cup,R_2,right,o,,sigma_,C_1,left,R_1,right,cup,sigma_,C_1,left,R_2,right,D,pi_,A_1,left,sigma_,C_1,left,R_1,right,right,o,,sigma_,C_1,left,pi_,A_1,left,R_1,right,right,,Relational,Calculus,159,,,,,,,,,,,,,,
-Which,of,the,following,propositions,is,a,tautology,p,vee,q,rightarrow,p,p,vee,q,rightarrow,p,p,vee,p,rightarrow,q,p,rightarrow,p,rightarrow,q,,Propositional,Logic,144,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,problems,is,undecidable,Membership,problem,for,CFGs,Ambiguity,problem,for,CFGs,Finiteness,problem,for,FSAs,Equivalence,problem,for,FSAs,,,Decidability,38,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,problems,are,decidable,Does,a,given,program,ever,produce,an,output,If,L,is,a,context,free,language,then,is,bar,L,also,context,free,If,L,is,a,regular,language,then,bar,L,is,also,regular,If,L,is,a,recursive,language,then,is,bar,L,also,recursive,,1,2,3,4,1,2,2,3,4,3,4,,Decidability,38,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,predicate,calculus,statements,is,are,valid,1,forall,x,P,x,vee,forall,x,Q,x,implies,forall,x,P,x,vee,Q,x,2,exists,x,P,x,wedge,exists,x,Q,x,implies,exists,x,P,x,wedge,Q,x,3,forall,x,P,x,vee,Q,x,implies,forall,x,P,x,vee,forall,x,Q,x,4,exists,x,P,x,vee,Q,x,implies,sim,forall,x,P,x,vee,exists,x,Q,x,,First,Order,Logic,60,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,permutations,can,be,obtained,in,the,output,in,the,same,order,using,a,stack,assuming,that,the,input,is,the,sequence,ext,1,2,3,4,5,in,that,order,ext,3,4,5,1,2,ext,3,4,5,2,1,ext,1,5,2,3,4,ext,5,4,3,1,2,,Stack,174,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,pairs,have,,DIFFERENT,,expressive,power,Deterministic,finite,automata,DFA,and,Non,deterministic,finite,automata,NFA,Deterministic,push,down,automata,DPDA,and,Non,deterministic,push,down,automata,NPDA,Deterministic,single,tape,Turing,machine,and,Non,deterministic,single,tape,Turing,machine,Single,tape,Turing,machine,and,multi,tape,Turing,machine,,Non,Determinism,116,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,page,replacement,algorithms,suffers,from,Belady,u2019s,anamoly,Optimal,replacement,LRU,FIFO,Both,A,and,C,,Page,Replacement,125,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,operations,is,commutative,but,not,associative,AND,OR,NAND,EXOR,,,Boolean,Operations,14,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,need,not,necessarily,be,saved,on,a,context,switch,between,processes,General,purpose,registers,Translation,look,aside,buffer,Program,counter,All,of,the,above,,,Context,Switch,28,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,languages,over,left,a,b,c,right,is,accepted,by,a,deterministic,pushdown,automata,left,wcw,R,mid,w,in,left,a,b,right,right,left,ww,R,mid,w,in,a,b,c,right,left,a,nb,nc,n,mid,n,geq,0,right,left,w,mid,w,ext,is,a,palindrome,over,left,a,b,c,right,right,Note,w,R,is,the,string,obtained,by,reversing,w,,Pushdown,Automata,147,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,languages,is,regular,left,ww,R,mid,,w,in,0,1,right,left,ww,Rx,mid,,x,w,,in,0,1,right,left,wxw,R,mid,,x,w,in,0,1,right,left,xww,R,mid,,x,w,in,0,1,right,,Regular,Languages,157,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,languages,is,accepted,by,a,non,deterministic,pushdown,automaton,PDA,but,NOT,by,a,deterministic,PDA,a,nb,nc,n,,mid,n,u2265,0,a,lb,mc,n,,mid,l,u2260,m,ext,or,m,u2260,n,a,nb,n,,mid,n,u2265,0,a,mb,n,mid,,m,n,u2265,0,,Pushdown,Automata,147,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,true,The,set,of,all,rational,negative,numbers,forms,a,group,under,multiplication,The,set,of,all,non,singular,matrices,forms,a,group,under,multiplication,The,set,of,all,matrices,forms,a,group,under,multiplication,Both,B,and,C,are,true,,Groups,78,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,TRUE,The,cost,of,searching,an,AVL,tree,is,Theta,,log,n,but,that,of,a,binary,search,tree,is,O,n,The,cost,of,searching,an,AVL,tree,is,Theta,log,n,but,that,of,a,complete,binary,tree,is,,Theta,n,log,n,The,cost,of,searching,a,binary,search,tree,is,O,log,n,but,that,of,an,AVL,tree,is,Theta,n,The,cost,of,searching,an,AVL,tree,is,Theta,,n,log,n,,but,that,of,a,binary,search,tree,is,O,n,,Binary,Search,Tree,9,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,true,The,complement,of,a,recursive,language,is,recursive,The,complement,of,a,recursively,enumerable,language,is,recursively,enumerable,The,complement,of,a,recursive,language,is,either,recursive,or,recursively,enumerable,The,complement,of,a,context,free,language,is,context,free,,Closure,Property,22,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,true,for,the,language,left,a,p,mid,p,ext,is,a,prime,right,It,is,not,accepted,by,a,Turing,Machine,It,is,regular,but,not,context,free,It,is,context,free,but,not,regular,It,is,neither,regular,nor,context,free,but,accepted,by,a,Turing,machine,,Identify,Class,Language,82,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,TRUE,Every,subset,of,a,regular,set,is,regular,Every,finite,subset,of,a,non,regular,set,is,regular,The,union,of,two,non,regular,sets,is,not,regular,Infinite,union,of,finite,sets,is,regular,,Regular,Languages,157,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,TRUE,about,the,interior,gateway,routing,protocols,Routing,Information,Protocol,RIP,and,Open,Shortest,Path,First,OSPF,RIP,uses,distance,vector,routing,and,OSPF,uses,link,state,routing,OSPF,uses,distance,vector,routing,and,RIP,uses,link,state,routing,Both,RIP,and,OSPF,use,link,state,routing,Both,RIP,and,OSPF,use,distance,vector,routing,,Routing,163,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,the,negation,of,u2200,x,u03b1,u2192,u2203y,u03b2,u2192,u2200,,u,u2203v,y,u2203,x,u03b1,u2192,u2200y,u03b2,u2192,u2203u,u2200,v,y,u2203,x,u03b1,u2192,u2200y,u03b2,u2192,u2203u,u2200,v,u00acy,u2200,x,u00ac,u03b1,u2192,u2203y,u00ac,u03b2,u2192,u2200u,u2203,v,u00acy,u2203,x,u03b1,u028c,,u2200y,u03b2,u028c,,u2203u,u2200,v,u00acy,,First,Order,Logic,60,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,not,a,valid,deadlock,prevention,scheme,Release,all,resources,before,requesting,a,new,resource,Number,the,resources,uniquely,and,never,request,a,lower,numbered,resource,than,the,last,one,requested,Never,request,a,resource,after,releasing,any,resource,Request,and,all,required,resources,be,allocated,before,execution,,,Resource,Allocation,161,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,NOT,a,sufficient,and,necessary,condition,for,an,undirected,graph,G,to,be,a,tree,G,is,connected,and,has,n,1,edges,G,is,acyclic,and,connected,G,is,acyclic,and,has,n,1,edges,G,is,acyclic,connected,and,has,n,1,edges,G,has,n,1,edges,,Trees,194,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,false,Read,wedge,as,AND,vee,as,OR,sim,as,NOT,,rightarrow,as,one,way,implication,and,leftrightarrow,as,two,way,implication,x,rightarrow,y,wedge,x,rightarrow,y,sim,x,rightarrow,y,wedge,sim,x,rightarrow,sim,y,rightarrow,x,x,rightarrow,x,vee,y,x,vee,y,leftrightarrow,sim,x,rightarrow,sim,y,,,Propositional,Logic,144,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,are,undecidable,G,is,a,CFG,Is,L,G,phi,G,is,a,CFG,Is,L,G,Sigma,M,is,a,Turing,machine,Is,L,M,regular,A,is,a,DFA,and,N,is,an,NFA,Is,L,A,L,N,,3,only,,,,3,and,4,only,,,,1,2,and,3,only,,,,2,and,3,only,,Decidability,38,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,are,shared,by,all,the,threads,in,a,process,Program,counter,Stack,Address,space,Registers,I,and,II,only,III,only,IV,only,III,and,IV,only,,Threads,188,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,are,correct,An,SQL,query,automatically,eliminates,duplicates,An,SQL,query,will,not,work,if,there,are,no,indexes,on,the,relations,SQL,permits,attribute,names,to,be,repeated,in,the,same,relation,None,of,the,above,,Sql,173,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,a,valid,first,order,formula,Here,alpha,and,beta,are,first,order,formulae,with,x,as,their,only,free,variable,u2200x,u03b1,u21d2,u2200x,u03b2,u21d2,u2200x,u03b1,u21d2,u03b2,u2200x,u03b1,u21d2,u2203x,u03b1,u2227,u03b2,u2200x,u03b1,u2228,u03b2,u21d2,u2203x,u03b1,u21d2,u2200x,u03b1,u2200x,u03b1,u21d2,u03b2,u21d2,u2200x,u03b1,u21d2,u2200x,u03b2,,First,Order,Logic,60,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,is,a,key,factor,for,preferring,B,trees,to,binary,search,trees,for,indexing,database,relations,Database,relations,have,a,large,number,of,records,Database,relations,are,sorted,on,the,primary,key,B,trees,require,less,memory,than,binary,search,trees,Data,transfer,form,disks,is,in,blocks,,B,Tree,6,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,functions,implements,the,Karnaugh,map,shown,below,CD,0,1,11,10,AB,0,0,0,1,0,1,X,X,1,X,11,0,1,1,0,10,0,1,1,0,,bar,A,B,CD,D,C,A,AD,bar,A,B,C,D,bar,C,D,A,B,,,K,Map,89,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,functionality,,must,,be,implemented,by,a,transport,protocol,over,and,above,the,network,protocol,Recovery,from,packet,losses,Detection,of,duplicate,packets,Packet,delivery,in,the,correct,order,End,to,end,connectivity,,Network,Layering,111,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,first,order,formulae,is,logically,valid,Here,alpha,x,is,a,first,order,formula,with,x,as,a,free,variable,and,beta,is,a,first,order,formula,with,no,free,variable,beta,rightarrow,exists,x,alpha,x,rightarrow,forall,x,beta,rightarrow,alpha,x,exists,x,beta,rightarrow,alpha,x,rightarrow,beta,rightarrow,forall,x,alpha,x,exists,x,alpha,x,rightarrow,beta,rightarrow,forall,x,alpha,x,rightarrow,beta,forall,x,alpha,x,rightarrow,beta,rightarrow,forall,x,alpha,x,rightarrow,beta,,First,Order,Logic,60,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,expressions,is,not,equivalent,to,bar,x,x,ext,NAND,x,x,ext,NOR,x,x,ext,NAND,1,x,ext,NOR,1,,,Boolean,Operations,14,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,expressions,is,equivalent,to,A,oplus,,B,oplus,,C,A,B,C,bar,A,bar,B,bar,C,A,B,C,bar,A,bar,B,C,ABC,bar,A,B,oplus,,C,bar,B,A,oplus,,C,None,of,these,,Boolean,Expressions,13,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,does,not,interrupt,a,running,process,A,device,Timer,Scheduler,process,Power,failure,,Process,138,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,disk,scheduling,strategies,is,likely,to,give,the,best,throughput,Farthest,cylinder,next,Nearest,cylinder,next,First,come,first,served,Elevator,algorithm,,Disk,Scheduling,47,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,definitions,below,generate,the,same,language,as,L,where,L,x,ny,n,ext,such,that,n,geq,1,E,rightarrow,xEy,mid,xy,x,y,mid,x,xyy,x,y,,I,only,I,and,II,II,and,III,II,only,,,Context,Free,Language,27,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,decision,problems,are,undecidable,Given,NFAs,N_1,and,N_2,is,L,N_1,cap,L,N_2,Phi,Given,a,CFG,G,N,Sigma,P,S,and,a,string,,x,in,Sigma,does,,x,in,L,G,Given,CFGs,,G_1,and,G_2,is,L,G_1,L,G_2,Given,a,TM,M,is,L,M,Phi,,I,and,IV,only,II,and,III,only,,III,and,IV,only,II,and,IV,only,,Decidability,38,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,conversions,is,not,possible,algorithmically,Regular,grammar,to,context,free,grammar,Non,deterministic,FSA,to,deterministic,FSA,Non,deterministic,PDA,to,deterministic,PDA,Non,deterministic,Turing,machine,to,deterministic,Turing,machine,,,Non,Determinism,116,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,concurrency,control,protocols,ensure,both,conflict,serializability,and,freedom,from,deadlock,2,phase,locking,Time,stamp,ordering,I,only,II,only,Both,I,and,II,Neither,I,nor,II,,Transactions,192,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,are,used,to,generate,a,message,digest,by,the,network,security,protocols,RSA,SHA,1,DES,MD5,I,and,III,only,II,and,III,only,II,and,IV,only,III,and,IV,,only,,Network,Security,113,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
-Which,of,the,following,are,decidable,Whether,the,intersection,of,two,regular,languages,is,infinite,Whether,a,given,context,free,language,is,regular,Whether,two,push,down,automata,accept,the,same,language,Whether,a,given,grammar,is,context,free,I,and,II,I,and,IV,II,and,III,II,and,IV,,Decidability,38,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
+Question,Tag,label
+Zero has two representations in Sign magnitude 2 s complement 1 s complement None of the above ,Number Representation,118
+Your are given the following four bytes  10100011  00110111  11101001  10101011 Which of the following are substrings of the base 64 encoding of the above four bytes zdp fpq qwA oze ,Network Security,113
+You are given three coins one has heads on both faces the second has tails on both faces and the third has a head on one face and a tail on the other You choose a coin at random and toss it and it comes up heads The probability that the other face is tails is dfrac 1 4  dfrac 1 3  dfrac 1 2  dfrac 2 3  ,Bayes Theorem,7
+You are given the postorder traversal P  of a binary search tree on the n elements 1 2 dots  n You have to determine the unique binary search tree that has P as its postorder traversal What is the time complexity of the most efficient algorithm for doing this Theta log n Theta n Theta n log n None of the above as the tree cannot be uniquely determined ,Binary Search Tree,9
+Write a constant time algorithm to insert a node with data D just before the node with address p of a singly linked list ,Linked Lists,93
+Write a concurrent program using ext parbegin parend and semaphores to represent the precedence constraints of the statements S_1 to S_6 as shown in figure below ,Process Synchronization,140
+With regards to the expressive power of the formal relational query languages which of the following statements is true Relational algebra is more powerful than relational calculus Relational algebra has the same power as relational calculus Relational algebra has the same power as safe relational calculus None of the above ,Relational Calculus,159
+While opening a TCP connection the initial sequence number is to be derived using a time of day ToD clock that keeps running even when the host is down The low order 32 bits of the counter of the ToD clock is to be used for the initial sequence numbers The clock counter increments once per milliseconds The maximum packet lifetime is given to be 64 s Which one of the choices given below is closest to the minimum permissible rate at which sequence numbers used for packets of a connection can increase  0 015 s 0 064 s 0 135 s 0 327 s  ,Tcp,186
+Which the following is FALSE Complement of a recursive language is recursive A language recognized by a non deterministic Turing machine can also be recognized by a deterministic  Turing machine Complement of a context free language can be recognized by a Turing machine If a language and its complement are both recursively enumerable then it is recursive Complement of a non recursive language can never be recognized by any Turing machine ,Closure Property,22
+Which scheduling policy is most suitable for a time shared operating system Shortest Job First Round Robin First Come First Serve Elevator ,Process Schedule,139
+Which one of these first order logic formulae is valid forall x left P left x right implies Q left x right right implies left u2200xP left x right implies forall xQ left x right right exists x left P left x right vee Q left x right right implies left exists xP left x right implies exists xQ left x right right exists x left P left x right wedge  Q left x right right iff left exists xP left x right wedge exists xQ left x right right forall x exists y P left x y right implies exists y forall x P left x y right ,First Order Logic,60
+Which one of the following statements is TRUE about every n imes n matrix with only real eigenvalues If the trace of the matrix is positive and the determinant of the matrix is negative at least one of its eigenvalues is negative If the trace of the matrix is positive all its eigenvalues are positive If the determinant of the matrix is positive all its eigenvalues are positive If the product of the trace and determinant of the matrix is positive all its eigenvalues are positive ,Eigen Value,50
+Which one of the following statements is FALSE There exist context free languages such that all the context free grammars generating them are ambiguous An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it Both deterministic and non deterministic pushdown automata always accept the same set of languages A finite set of string from some alphabet is always a regular language ,Non Determinism,116
+Which one of the following statements is FALSE TCP guarantees a minimum communication rate TCP ensures in order delivery TCP reacts to congestion by reducing sender window size TCP employs retransmission to compensate for packet loss ,Tcp,186
+Which one of the following statements is FALSE Packet switching leads to better utilization of bandwidth resources than circuit switching Packet switching results in less variation in delay than circuit switching Packet switching requires more per packet processing than circuit switching Packet switching can lead to reordering unlike in circuit switching ,Network Switching,114
+Which one of the following regular expressions over 0 1 denotes the set of all strings not containing ext 100 as substring a 0 1 0 b 0 1010 c 0 1 01 d 0 10 1 ,Regular Expressions,154
+Which one of the following regular expressions is NOT equivalent to the regular expression a b c a b c a b c ab c a b c ,Regular Expressions,154
+Which one of the following problems is undecidable Deciding if a given context free grammar is ambiguous Deciding if a given string is generated by a given context free grammar Deciding if the language generated by a given context free grammar is empty Deciding if the language generated by a given context free grammar is finite ,Decidability,38
+Which one of the following is TRUE for any simple connected undirected graph  with more than 2 vertices   No two vertices have the same degree   At least two vertices have the same degree   At least three vertices have the same degree   All vertices have the same degree ,Degree Of Graph,40
+Which one of the following is NOT shared by the threads of the same process Stack Address Space File Descriptor Table Message Queue ,Threads,188
+Which one of the following is FALSE There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA Complement of every context free language is recursive Every nondeterministic PDA can be converted to an equivalent deterministic PDA ,Non Determinism,116
+Which one of the following is false The set of all bijective functions on a finite set forms a group under function composition The set 1 2 dots p 1 forms a group under multiplication mod p where p is a prime number The set of all strings over a finite alphabet forms a group under concatenation A subset S eq emptyset of G is a subgroup of the group langle G rangle if and only if for any pair of elements a b in S a b 1  in  S ,Sets,169
+Which one of the following is  FALSE User level threads are not scheduled by the kernel When a user level thread is blocked all other threads of its process are blocked Context switching between user level threads is faster than context switching between kernel level threads Kernel level threads cannot share the code segment ,Threads,188
+Which one of the following does NOT equal begin vmatrix 1 amp x amp x 2 1 amp y amp y 2 1 amp z amp z 2 end vmatrix A begin vmatrix 1 amp x x 1 amp x 1 1 amp y y 1 amp y 1 1 amp z z 1 amp z 1 end vmatrix B begin vmatrix 1 amp x 1 amp x 2 1 1 amp y 1 amp y 2 1 1 amp z 1 amp z 2 1 end vmatrix C begin vmatrix 0 amp x y amp x 2 y 2 0 amp y z amp y 2 z 2 1 amp z amp z 2 end vmatrix D begin vmatrix 2 amp x y amp x 2 y 2 2 amp y z amp y 2 z 2 1 amp z amp z 2 end vmatrix ,Determinant,41
+Which one of the following circuits is  NOT  equivalent to a 2 input XNOR exclusive NOR gate  ,Logic Gates,94
+Which one of the first order predicate calculus statements given below correctly expresses the following English statement  Tigers and lions attack if they are hungry or threatened u2200x tiger x u2227 lion x u2192 hungry x u2228 threatened x u2192 attacks x u2200x tiger x u2228 lion x u2192 hungry x u2228 threatened x u2227 attacks x u2200x tiger x u2228 lion x u2192 attacks x u2192 hungry x u2228 threatened x u2200x tiger x u2228 lion x u2192 hungry x u2228 threatened x u2192 attacks x ,First Order Logic,60
+Which of the rational calculus expression is not safe left t mid exists u in R_1 left t A u A right land eg exists s in R_2 left t A s A right right left t mid forall u in R_1 left u A x Rightarrow exists s in R_2 left t A s A land s A u A right right right left t mid eg t in R_1 right left t mid exists u in R_1 left t A u A right land exists s in R_2 left t A s A right right  ,Relational Calculus,159
+Which of the following tuple relational calculus expression s is are equivalent to forall t in r left P left t right right eg exists t in r left P left t right right exists t otin r left P left t right right eg exists t in r left eg P left t right right exists t otin r left eg P left t right right I only II only III only III and IV only ,Relational Calculus,159
+Which of the following transport layer protocols is used to support electronic mail A SMTP B IP C TCP D UDP,Tcp,186
+Which of the following three statements are true Prove your answer The union of two recursive languages is recursive The language O n mid n ext is a prime is not regular Regular languages are closed under infinite union ,Closure Property,22
+Which of the following system calls results in the sending of SYN packets socket bind listen connect ,Sockets,172
+Which of the following statements is true If a language is context free it can always be accepted by a deterministic push down automaton The union of two context free languages is context free The intersection of two contest free languages is a context free The complement of a context free language is a context free ,Context Free Language,27
+Which of the following statements is true for every planar graph on n vertices The graph is connected The graph is Eulerian The graph has a vertex cover of size at most frac 3n 4 The graph has an independent set of size at least frac n 3 ,Graph Planarity,75
+Which of the following statements is TRUE Every turning machine recognizable language is recursive The complement of every recursively enumerable language is recursively enumerable The complement of a recursive language is recursively enumerable The complement of a context free language is context free The set of turning machines which do not halt on empty input forms a recursively enumerable set ,Recursive And Recursively Enumerable Languages,152
+Which of the following statements is true As the number of entries in a hash table increases the number of collisions increases Recursive programs are efficient The worst case complexity for Quicksort is O n 2 Binary search using a linear linked list is efficient I and II II and III I and IV I and III ,Linked Lists,93
+Which of the following statements is false The Halting Problem of Turing machines is undecidable Determining whether a context free grammar is ambiguous is undecidable Given two arbitrary context free grammars G_1 and G_2 it is undecidable whether L G_1 L G_2 Given two regular grammars G_1 and G_2 it is undecidable whether L G_1 L G_2  ,Decidability,38
+Which of the following statements is false Every NFA can be converted to an equivalent DFA Every non deterministic Turing machine can be converted to an equivalent deterministic Turing machine Every regular language is also a context free language Every subset of a recursively enumerable set is recursive ,Recursive And Recursively Enumerable Languages,152
+Which of the following statements is false a Every finite subset of a non regular set is regular b Every subset of a regular set is regular c Every finite subset of a regular set is regular d The intersection of two regular sets is regular,Regular Languages,157
+Which of the following statements is false  A tree with a n nodes has n u2013 1 edges  A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results  A complete binary tree with n internal nodes has n 1 leaves  The maximum number of nodes in a binary tree of height h is 2 h 1 1 ,Trees,194
+Which of the following statements is are TRUE for undirected graphs P Number of odd degree vertices is even Q Sum of degrees of all vertices is even  P only  Q only  Both P and Q  Neither P nor Q ,Degree Of Graph,40
+Which of the following statements is are FALSE For every non deterministic Turing machine there exists an equivalent deterministic Turing machine Turing recognizable languages are closed under union and complementation Turing decidable languages are closed under intersection and complementation Turing recognizable languages are closed under union and intersection   1 and 4 only   1 and 3 only   2 only   3 only ,Closure Property,22
+Which of the following statements are TRUE S1  TCP handles both congestion and flow control S2  UDP handles congestion but not flow control S3  Fast retransmit deals with congestion but not flow control S4  Slow start mechanism deals with both congestion and flow control S1 S2 and S3 only S1 and S3 only S3 and S4 only S1 S3 and S4 only ,Network Protocols,112
+Which of the following statements about regular languages is NOT true Every language has a regular superset Every language has a regular subset Every subset of a regular language is regular Every subset of a finite language is regular ,Regular Languages,157
+Which of the following statement s is TRUE A hash function takes a message of arbitrary length and generates a fixed length code A hash function takes a message of fixed length and generates a code of variable length A hash function may give the same hash value for distinct messages I only II and III  only I and III  only II  only ,Hashing,80
+Which of the following statement is FALSE All recursive sets are recursively enumerable The complement of every recursively enumerable sets is recursively enumerable Every Non empty recursively enumerable set is the range of some totally recursive function All finite sets are recursive The complement of every recursive set is recursive ,Recursive And Recursively Enumerable Languages,152
+Which of the following socket API functions converts an unconnected active TCP socket into a passive socket connect bind listen accept ,Sockets,172
+Which of the following sets of component s is are sufficient to implement any arbitrary Boolean function XOR gates NOT gates 2 to 1 multiplexers AND gates XOR gates Three input gates that output A B C for the inputs A B and C  ,Functional Completeness,65
+Which of the following set can be recognized by a Deterministic Finite state Automaton The numbers 1 2 4 8 dots 2 n dots written in binary The numbers 1 2 4 8 dots 2 n dots  written in unary The set of binary string in which the number of zeros is the same as the number of ones The set 1 101 11011 1110111 dots  ,Finite Automata,59
+Which of the following sequences of array elements forms a heap 23 17 14 6 13 10 1 12 7 5 23 17 14 6 13 10 1 5 7 12 23 17 14 7 13 10 1 5 6 12 23 17 14 7 13 10 1 12 5 7 ,Heap,81
+Which of the following scheduling algorithms is non preemptive Round Robin First In First Out Multilevel Queue Scheduling Multilevel Queue Scheduling with Feedback ,Process Schedule,139
+Which of the following relational query languages have the same expressive power Relational algebra Tuple relational calculus restricted to safe expressions Domain relational calculus restricted to safe expressions  II and III only I and II only I and III only I II and III ,Relational Calculus,159
+Which of the following regular expression identities are true A r r B r S r s C r s r s D r s r s ,Regular Expressions,154
+Which of the following query transformations i e replacing the l h s expression by the r h s expression is incorrect R1  and R2  are relations C1  and C2  are selection conditions and A1  and A2  are attributes of R1 A sigma_ C_1 left sigma_ C_2 left R_1 right right o  sigma_ C_2 left sigma_ C_1 left R_1 right right B sigma_ C_1 left pi_ A_1 left R_1 right right o  pi_ A_1 left sigma_ C_1 left R_1 right right C sigma_ C_1 left R_1 cup R_2 right o  sigma_ C_1 left R_1 right cup sigma_ C_1 left R_2 right D pi_ A_1 left sigma_ C_1 left R_1 right right o  sigma_ C_1 left pi_ A_1 left R_1 right right ,Relational Calculus,159
+Which of the following propositions is a tautology p vee q rightarrow p p vee q rightarrow p p vee p rightarrow q p rightarrow p rightarrow q ,Propositional Logic,144
+Which of the following problems is undecidable Membership problem for CFGs Ambiguity problem for CFGs Finiteness problem for FSAs Equivalence problem for FSAs  ,Decidability,38
+Which of the following problems are decidable Does a given program ever produce an output If L is a context free language then is bar L also context free If L is a regular language then bar L is also regular If L is a recursive language then is bar L also recursive  1 2 3 4 1 2 2 3 4 3 4 ,Decidability,38
+Which of the following predicate calculus statements is are valid 1 forall x P x vee forall x Q x implies forall x P x vee Q x 2 exists x P x wedge exists x Q x implies exists x P x wedge Q x 3 forall x P x vee Q x implies forall x P x vee forall x Q x 4 exists x P x vee Q x implies sim forall x P x vee exists x Q x ,First Order Logic,60
+Which of the following permutations can be obtained in the output in the same order using a stack assuming that the input is the sequence ext 1 2 3 4 5 in that order ext 3 4 5 1 2 ext 3 4 5 2 1 ext 1 5 2 3 4 ext 5 4 3 1 2 ,Stack,174
+Which of the following pairs have  DIFFERENT  expressive power Deterministic finite automata DFA and Non deterministic finite automata NFA Deterministic push down automata DPDA and Non deterministic push down automata NPDA Deterministic single tape Turing machine and Non deterministic single tape Turing machine Single tape Turing machine and multi tape Turing machine ,Non Determinism,116
+Which of the following page replacement algorithms suffers from Belady u2019s anamoly Optimal replacement LRU FIFO Both A and C ,Page Replacement,125
+Which of the following operations is commutative but not associative AND OR NAND EXOR  ,Boolean Operations,14
+Which of the following need not necessarily be saved on a context switch between processes General purpose registers Translation look aside buffer Program counter All of the above  ,Context Switch,28
+Which of the following languages over left a b c right is accepted by a deterministic pushdown automata left wcw R mid w in left a b right right left ww R mid w in a b c right left a nb nc n mid n geq 0 right left w mid w ext is a palindrome over left a b c right right Note w R is the string obtained by reversing w ,Pushdown Automata,147
+Which of the following languages is regular left ww R mid  w in 0 1 right left ww Rx mid  x w  in 0 1 right left wxw R mid  x w in 0 1 right left xww R mid  x w in 0 1 right ,Regular Languages,157
+Which of the following languages is accepted by a non deterministic pushdown automaton PDA but NOT by a deterministic PDA a nb nc n  mid n u2265 0 a lb mc n  mid l u2260 m ext or m u2260 n a nb n  mid n u2265 0 a mb n mid  m n u2265 0 ,Pushdown Automata,147
+Which of the following is true The set of all rational negative numbers forms a group under multiplication The set of all non singular matrices forms a group under multiplication The set of all matrices forms a group under multiplication Both B and C are true ,Groups,78
+Which of the following is TRUE The cost of searching an AVL tree is Theta  log n but that of a binary search tree is O n The cost of searching an AVL tree is Theta log n but that of a complete binary tree is  Theta n log n The cost of searching a binary search tree is O log n but that of an AVL tree is Theta n The cost of searching an AVL tree is Theta  n log n  but that of a binary search tree is O n ,Binary Search Tree,9
+Which of the following is true The complement of a recursive language is recursive The complement of a recursively enumerable language is recursively enumerable The complement of a recursive language is either recursive or recursively enumerable The complement of a context free language is context free ,Closure Property,22
+Which of the following is true for the language left a p mid p ext is a prime right It is not accepted by a Turing Machine It is regular but not context free It is context free but not regular It is neither regular nor context free but accepted by a Turing machine ,Identify Class Language,82
+Which of the following is TRUE Every subset of a regular set is regular Every finite subset of a non regular set is regular The union of two non regular sets is not regular Infinite union of finite sets is regular ,Regular Languages,157
+Which of the following is TRUE about the interior gateway routing protocols Routing Information Protocol RIP and Open Shortest Path First OSPF RIP uses distance vector routing and OSPF uses link state routing OSPF uses distance vector routing and RIP uses link state routing Both RIP and OSPF use link state routing Both RIP and OSPF use distance vector routing ,Routing,163
+Which of the following is the negation of u2200 x u03b1 u2192 u2203y u03b2 u2192 u2200  u u2203v y u2203 x u03b1 u2192 u2200y u03b2 u2192 u2203u u2200 v y u2203 x u03b1 u2192 u2200y u03b2 u2192 u2203u u2200 v u00acy u2200 x u00ac u03b1 u2192 u2203y u00ac u03b2 u2192 u2200u u2203 v u00acy u2203 x u03b1 u028c  u2200y u03b2 u028c  u2203u u2200 v u00acy ,First Order Logic,60
+Which of the following is not a valid deadlock prevention scheme Release all resources before requesting a new resource Number the resources uniquely and never request a lower numbered resource than the last one requested Never request a resource after releasing any resource Request and all required resources be allocated before execution  ,Resource Allocation,161
+Which of the following is NOT a sufficient and necessary condition for an undirected graph G to be a tree G is connected and has n 1 edges G is acyclic and connected G is acyclic and has n 1 edges G is acyclic connected and has n 1 edges G has n 1 edges ,Trees,194
+Which of the following is false Read wedge as AND vee as OR sim as NOT  rightarrow as one way implication and leftrightarrow as two way implication x rightarrow y wedge x rightarrow y sim x rightarrow y wedge sim x rightarrow sim y rightarrow x x rightarrow x vee y x vee y leftrightarrow sim x rightarrow sim y  ,Propositional Logic,144
+Which of the following is are undecidable G is a CFG Is L G phi G is a CFG Is L G Sigma M is a Turing machine Is L M regular A is a DFA and N is an NFA Is L A L N  3 only    3 and 4 only    1 2 and 3 only    2 and 3 only ,Decidability,38
+Which of the following is are shared by all the threads in a process Program counter Stack Address space Registers I and II only III only IV only III and IV only ,Threads,188
+Which of the following is are correct An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above ,Sql,173
+Which of the following is a valid first order formula Here alpha and beta are first order formulae with x as their only free variable u2200x u03b1 u21d2 u2200x u03b2 u21d2 u2200x u03b1 u21d2 u03b2 u2200x u03b1 u21d2 u2203x u03b1 u2227 u03b2 u2200x u03b1 u2228 u03b2 u21d2 u2203x u03b1 u21d2 u2200x u03b1 u2200x u03b1 u21d2 u03b2 u21d2 u2200x u03b1 u21d2 u2200x u03b2 ,First Order Logic,60
+Which of the following is a key factor for preferring B trees to binary search trees for indexing database relations Database relations have a large number of records Database relations are sorted on the primary key B trees require less memory than binary search trees Data transfer form disks is in blocks ,B Tree,6
+Which of the following functions implements the Karnaugh map shown below CD 00 01 11 10 AB 00 0 0 1 0 01 X X 1 X 11 0 1 1 0 10 0 1 1 0  bar A B CD D C A AD bar A B C D bar C D A B  ,K Map,89
+Which of the following functionality  must  be implemented by a transport protocol over and above the network protocol Recovery from packet losses Detection of duplicate packets Packet delivery in the correct order End to end connectivity ,Network Layering,111
+Which of the following first order formulae is logically valid Here alpha x is a first order formula with x as a free variable and beta is a first order formula with no free variable beta rightarrow exists x alpha x rightarrow forall x beta rightarrow alpha x exists x beta rightarrow alpha x rightarrow beta rightarrow forall x alpha x exists x alpha x rightarrow beta rightarrow forall x alpha x rightarrow beta forall x alpha x rightarrow beta rightarrow forall x alpha x rightarrow beta ,First Order Logic,60
+Which of the following expressions is not equivalent to bar x x ext NAND x x ext NOR x x ext NAND 1 x ext NOR 1  ,Boolean Operations,14
+Which of the following expressions is equivalent to A oplus  B oplus  C A B C bar A bar B bar C A B C bar A bar B C ABC bar A B oplus  C bar B A oplus  C None of these ,Boolean Expressions,13
+Which of the following does not interrupt a running process A device Timer Scheduler process Power failure ,Process,138
+Which of the following disk scheduling strategies is likely to give the best throughput Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm ,Disk Scheduling,47
+Which of the following definitions below generate the same language as L where L x ny n ext such that n geq 1 E rightarrow xEy mid xy x y mid x xyy x y  I only I and II II and III II only  ,Context Free Language,27
+Which of the following decision problems are undecidable Given NFAs N_1 and N_2 is L N_1 cap L N_2 Phi Given a CFG G N Sigma P S and a string  x in Sigma does  x in L G Given CFGs  G_1 and G_2 is L G_1 L G_2 Given a TM M is L M Phi  I and IV only II and III only  III and IV only II and IV only ,Decidability,38
+Which of the following conversions is not possible algorithmically Regular grammar to context free grammar Non deterministic FSA to deterministic FSA Non deterministic PDA to deterministic PDA Non deterministic Turing machine to deterministic Turing machine  ,Non Determinism,116
+Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock 2 phase locking Time stamp ordering I only II only Both I and II Neither I nor II ,Transactions,192
+Which of the following are used to generate a message digest by the network security protocols RSA SHA 1 DES MD5 I and III only II and III only II and IV only III and IV  only ,Network Security,113
+Which of the following are decidable Whether the intersection of two regular languages is infinite Whether a given context free language is regular Whether two push down automata accept the same language Whether a given grammar is context free I and II I and IV II and III II and IV ,Decidability,38