ZB3YQkMQ

1Comprehensive Examination CSE - 2019 Batch
2     S.NO.
3  Questions
4    Choices
5   Answers
6    1
7   1. 3 2. 4 3. 5 4. 6
8   1.0
9   2
10   (a+b)(cd)*(a+b) denotes the following set
11      1. {a(cd)^nb|n>=1}
122. {a(cd)^n>=1}U{b(cd)^n|n>=1}
133. {a(cd)^na|n>=0}U{a(cd)^nb|n>=0}U{b(cd)^na|n>=0}U{b(cd)^nb|n>=0}
144. {ac^nd^nb|n>=1}
15     3.0
16   3
17 -24 is 2’s complement form is
18    1.
192.
203.
2111101000
2201111111
2301001000 4. 00111111
24    1.0
25    4
26A 2 bit binary multiplier can be implemented using
27  1.
282.
292 input ANDs only
302 input X-ORs and 4-input AND gates only
313. XOR gates and shift registers 4.
32Two (2) input NORs and one XNOR gate
33   2.0
34   5
35  A _________ registrar stores the intermediate arithmetic and logic results in it.
36     1.
372. Program counter 3.
384.
39Index registrar
40Accumulator
41Address registrar
42    4.0
43
44   S.NO.
45  Questions
46    Choices
47   Answers
48    6
49A class is a
50  1. Structure 2. Memory 3. Template 4. Function
51   3.0
52     7
53  A constructor without any arguments is
54    1. default constructor
552. parameterized constructor 3. none
564. overloading
57     1.0
58   8
59   A default constructor is one that
60     1. that takes all default arguments 2. have to be called explictly
613. gets called automatically
624. does take many parameters
63    1.0
64    9
65A finite automata that will accept only string X of length n will have _________ many states
66  1.
67n
682. n/2
693. n+1
704. infinite
71   3.0
72     10
73  A friend function to a class A cannot access
74    1. the data members of the derived class of A.
752. public data members and member functions.
763. protected data members and member functions. 4. private data members and member functions.
77     1.0
78     11
79  A property which is not true for classes is that they
80    1. Can closely model objects in the real world.
812. bring together all aspects of an entity in one place. 3. permit data to be hidden from other classes.
824. are removed from memory when not in use.
83     2.0
84   12
85   A quadruple is a record structure with ______ fields.
86     1. 3 2. 4 3. 1 4. 2
87    2.0
88    13
89A Stack-organised Computer uses instruction of
90  1.
91Zero addressing
922. Two-addressing
933.
94Indirect addressing
954. Index addressing
96   1.0
97     14
98  Access to private data is
99    1. Restricted to methods of the same class
1002. Restricted to methods of other classes
1013. Available to methods of the same class and other classes 4. Not an issue because the program will not compile
102     1.0
103     15
104  All member functions are _____ to it's class by default
105    1. constant 2. non static 3. dynamic 4. static
106     4.0
107     16
108  An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if
109    1. The LR(1) parser for G has S-R conflicts.
1102. The LR(0) parser for G has S-R conflicts.
1113. The LALR(1) parser for G has reduce-reduce conflicts 4. The SLR(1) parser for G has S-R conflicts.
112     1.0
113   17
114  An optimizing compiler
115    1. Is optimized to occupy less space
1162. Optimized the code
1173. Is optimized to take less time for execution 4. Secured Code
118   2.0
119 
120   S.NO.
121  Questions
122    Choices
123   Answers
124    18
125An unambiguous grammar has
126  1. Exactly one leftmost derivation for a string w
1272. At most one leftmost and one rightmost derivation for a string w 3. At most one rightmost derivation for a string w
1284. Exactly one leftmost and rightmost derivation for a string w
129   1.0
130     19
131  An unambiguous grammar has
132    1. Exactly one leftmost derivation for a string w
1332. At most one leftmost and one rightmost derivation for a string w 3. At most one rightmost derivation for a string w
1344. Exactly one leftmost and rightmost derivation for a string w
135     1.0
136     20
137  ASCII, EBCDIC, and Unicode are examples of -----------------
138    1. integrated circuits
1392. binary coding schemes 3. two-state systems
1404. adapter cards
141     1.0
142     21
143  baa*c denotes the set
144    1. {b^na^mc^p|n,m,p>=1} 2. {ba^nc|n>=0}
1453. {ba^nc|n>=1}
1464. {w|w is a string of a,b,c}
147     3.0
148     22
149  BCD to seven segment is a
150    1. encoder
1512. carry look ahead 3. comparator
1524. decoder
153     1.0
154     23
155  Calculate the person months for a project that was completed in two months with two people working on it.
156    1. 2 2. 4 3. 1 4. 8
157     2.0
158     24
159  class A { int a; static float b; } ; What is the size of class A?
160    1. sizeof( int ) * 2
1612. sizeof( int ) + sizeof( float ) 3. sizeof( int )
1624. sizeof( float )
163     2.0
164     25
165  class n{ int a=0;}obj; what will happen?
166    1. nothing
1672. initializes the data member with 0 3. error
1684. initializes the object with 0
169     3.0
170     26
171  class n{ public: int *a;}o,p; assigning o=p is called?
172    1. deep copy
1732. shallow copy 3. error
1744. constructor
175     2.0
176   27
177  class n{ public: int a;} obj; obj.a=10; cout << a;
178    1. error 2. 10 3. 1
1794. 0
180   1.0
181 
182   S.NO.
183  Questions
184    Choices
185   Answers
186   28
187 class n{ public: int a=7;}p,q; cout<< n.a;
188    1. 0
1892. error
1903. depends on compiler 4. 7
191   2.0
192    29
193Consider the regular language L = (111 + 11111)*. The minimum number of states in any DFA accepting the language is
194  1. 3
1952. 5
1963. 8
1974. 9
198   4.0
199     30
200  Content of the program counter is added to the address part of the instruction in order to obtain the effective address is called.
201    1.
202index addressing mode.
2032.
204register mode.
2053. implied mode.
2064.
207relative address mode.
208     4.0
209   31
210   Data Members of the base class that are marked private:
211     1. are directly accessible in the derived class 2. are visible in the derived class
2123. exist in memory when the object of the derived class is created the derived class
2134. does exist in memory when the object of the derived class is created
214    4.0
215    32
216Decimal number 9 in Gray code is
217  1. 1111 2.
2181101
2193.
2201100
2214.
2221110
223   2.0
224     33
225  During a software development project two similar requirements defects were detected. One was detected in the requirements phase, and the other during the implementation phase. Which of the following statements is mostly likely to be true?
226    1. There is no relationship between the phase in which a defect is discovered and its repair cost. .
2272. The most expensive defect to correct is the one detected during the implementation phase.
2283. The most expensive defect to correct is the one detected during the requirements phase.
2294. The cost of fixing either defect will usually be similar.
230     2.0
231   34
232   Effective software project management focuses on four P's which are
233     1. people, product, process, project
2342. people, product, performance, process 3. people, performance, payoff, product 4. people, process, payoff, product
235    1.0
236    35
237FAT file system is
238  1. Indexed Allocation and used in Windows OS 2. used in Windows OS
2393. about storage in RAM
2404. Indexed Allocation.
241   1.0
242   36
243  Files whose names end in .h are called _____ files
244    1. helper 2. header 3. handy 4. helping
245   2.0
246 
247   S.NO.
248  Questions
249    Choices
250   Answers
251   37
252 Finite automata recognizes --------grammars
253    1. type-1
2542. type-3
2553. type-0
2564. type-2
257    2.0
258    38
259Floating point representation is used to store ______.
260  1.
261Boolean values
2622.
263real integers
2643. integers
2654.
266whole numbers
267   2.0
268     39
269  Function templates can accept
270    1. Only parameters of the basic type 2. Only one parameter
2713. Any type of parameters
2724. Only parameters of the derived type
273     1.0
274   40
275   Functional requirements of a system is modelled using
276     1. Use-case Diagram 2. Sequence Diagram 3. Class Diagram
2774. Package Diagram
278    1.0
279   41
280 Given an arbitrary non-deterministic finite automaton (NFA). with N states, the maximum number of states in an equivalent minimized DFA is at least.
281    1. N^2
2822. 2N
2833. 2^N
2844. N!
285    3.0
286    42
287Given the language L = {ab, aa, baa}, which of the following strings are in L*?
2881) abaabaaabaa 2) aaaabaaaa
2893) baaaaabaaaab 4) baaaaabaa
290  1.
2911, 2 and 3
2922.
2932, 3 and 4
2943.
2951, 2 and 4
2964.
2971, 3 and 4
298   3.0
299   43
300   Having more than one constructor in a class is
301     1. not possible
3022. compile time polymorphism 3. constructor overriding
3034. error
304    3.0
305    44
306How many DFAs exit with two state over the input alphabet (a,b)
307  1. 16
3082. 26
3093. 32
3104. 64
311   4.0
312   45
313  How many possible outputs would a decoder have with a 6-bit binary input?
314    1. 16 2. 64 3. 128 4. 32
315   2.0
316 
317   S.NO.
318  Questions
319    Choices
320   Answers
321    46
322How many select lines would be required for an 8-line-to-1-line multiplexer?
323  1. 2 2. 4 3. 3 4. 8
324   3.0
325   47
326   How many stages are there in process improvement?
327     1. three 2. four 3. five 4. six
328    4.0
329    48
330How many two state FA can be drawn over alphabet{0,1} which accepts(0+1)*
331  1. 12
3322. 14
3333. 20
3344. 15
335   3.0
336     49
337  How will you free the allocated memory ?
338    1. delete(var-name); 2. dalloc(var-name); 3. free(var-name);
3394. remove(var-name);
340     3.0
341   50
342   Identify the invalid statement from the following
343     1. for (; ; )
3442. if (1)
3453. break(0)
3464. while(false)
347    3.0
348    51
349If a register containing binary data (11001100) is subjected to arithmetic shift left operation, then the content of the register after 'ashl' shall be
350  1. (10011000)
3512. (11001100)
3523. (1101100)
3534. (10011001)
354   1.0
355   52
356   If a university sets up web-based information system that faculty could access to record student grades and to advise students, that would be an example of an
357     1. intranet 2. ERP
3583. extranet 4. CRM
359    1.0
360    53
361If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using Thompson construction will have ------------- states.
362  1. n+2
3632. n+1
3643. n
3654. n-1
366   2.0
367     54
368  If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using Thompson construction will have ------------- states.
369    1. n+2
3702. n+1
3713. n
3724. n-1
373     2.0
374   55
375  If there is a complete DFA M1 recognizing a language L1 and has m states out of which two are final states then the machine M recognizing L1 complement will have _____________ final states.
376     1. m+2
3772. m
3783. m-2
3794. 2
380    1.0
381 
382   S.NO.
383  Questions
384    Choices
385   Answers
386   56
387 If X is the name of the class, what is the correct way to declare copy constructor of X?
388    1. X(class X* arg) 2. X(X& arg)
3893. X(X* arg)
3904. X(X arg)
391   2.0
392    57
393If you assign a default value to any variable in a function prototype's parameter list, then _____
394  1. all parameters to the left of that variable must have default values
3952. all parameters to the right of that variable must have default values
3963. all other parameters in the function prototype must have default values 4. no other parameters in that prototype can have default values
397   2.0
398     58
399  If you want to use a class to define objects in many different programs, you should define the class in a C++ _____ file
400    1. text
4012. source 3. header 4. program
402     3.0
403     59
404  In a BCD-to-seven-segment converter, why must a code converter be utilized?
405    1. to convert the 4-bit BCD into Gray code 2. to convert the 4-bit BCD into 7-bit code 3. to convert the 4-bit BCD into 10-bit code 4. No conversion is necessary
406     2.0
407     60
408  In C++, dynamic memory allocation is accomplished with the operator ____
409    1. new
4102. this
4113. malloc 4. delete
412     1.0
413     61
414  In C++, dynamic memory allocation is achieved with the operator _______
415    1. malloc() 2. delete
4163. new
4174. this
418     3.0
419   62
420   In CMM, the life cycle activities of requirements analysis, design, code, and test are described in
421     1. Software Product Engineering
4222. Software Quality Assurance
4233. Software Subcontract Management 4. Software Quality Management
424    1.0
425    63
426In computers, subtraction is generally carried out by ______.
427  1.
4289’s complement
4292. 2’s complement
4303.
43110’s complement
4324.
4331’s complement
434   2.0
435     64
436  In the types of Three-Address statements, copy statements of the form x := y means
437    1. The value of x is assigned to y or the value of y is assigned t o x. 2. The value of x is assigned to y and the value of y is assigned t o x. 3. The value of y is assigned to x.
4384. The value of x is assigned to y.
439     3.0
440   65
441   Many programmers separate a class into two files: _____
442     1. one for the primary functions and one for the auxiliary functions 2. one for the public data and one for the private data
4433. one for the void functions and one for the other functions
4444. one for the declarations and one for the implementations
445    4.0
446   66
447Multiplication of a positive integer by a power of two can be replaced by left shift, which executes faster on most machines. This is an example of
448   1. Useless Code
4492. Strength Reduction 3. Induction Variable 4. Loop unwinding
450  2.0
451 
452   S.NO.
453  Questions
454    Choices
455   Answers
456    67
457One can safely state that the output lines for a demultiplexer are under the direct control of the:
458  1. input data select lines 2. the internal OR gate
4593. the internal AND gates 4. Input data line
460   1.0
461     68
462  Overloading a prefix increment operator by means of a member function takes
463    1. Three arguments 2. Two arguments 3. No argument
4644. One argument
465     3.0
466     69
467  Overloading involves writing two or more functions with ________
468    1. different names and different argument lists 2. different names and the same argument list 3. the same name and the same argument list 4. the same name and different argument lists
469     4.0
470     70
471  Specify the 2 library functions to dynamically allocate memory?
472    1. malloc() and calloc()
4732. malloc() and memalloc() 3. alloc() and memalloc()
4744. memalloc() and faralloc()
475     1.0
476     71
477  State the acronym of POMA in software project management
478    1. Project Organization Monitoring Adopting
4792. Planning Origanizing Monitoring Adjusting
4803. project oriented maintenance and administration 4. Project Orientation Mapping Adjusting
481     2.0
482     72
483  Templates improve
484    1. inheritance 2. reusability 3. class
4854. functions
486     2.0
487   73
488   The Epsilon-Closure of any state q will contain the state ______________ irrespective of q.
489     1. p
4902. Epsilon
4913. q
4924. Final State
493    3.0
494    74
495The binary value for 0.4375 is
496  1. 0.1111
4972. 0.0111
4983. 0.0011
4994. 0.1010
500   2.0
501     75
502  The call to the parameterized constructor of base class in the derived class
503    1. appears inside the definition of the derived class
5042. ppears inside the definition of the derived class constructor
5053. appears at the statement where the derived class object is created
5064. appears in the member initialization list of the derived class constructor
507     2.0
508   76
509  The fundamental notions of software engineering does not account for ?
510    1. Software reuse
5112. Software Security 3. Software Validation 4. Software processes
512   3.0
513 
514   S.NO.
515  Questions
516    Choices
517   Answers
518    77
519The language is L={0p1q0r | p,q,r 3 0 , p 1 r} is
520  1. Context-sensitive but not context-free 2. Recursive but not Context-free
5213. Regular
5224. Context-free
523   4.0
524   78
525   The library function used to find the last occurrence of a character in a string is
526     1. strnstr() 2. strrchr() 3. laststr() 4. strstr()
527    2.0
528    79
529The major source of data for other systems are:
530  1.
531Electronic Switching System
5322. Transaction Processing Systems 3. Decision Support System
5334. Management Information System
534   2.0
535     80
536  The members of a class in c++ by default, are
537    1. private
5382. protected
5393. public
5404. mandatory to specify
541     1.0
542   81
543   The minimum length for strings in the regular expression ( 10* + 001* )* is _________
544     1. Infinite 2. One
5453. Zero
5464. Two
547    3.0
548   82
549 The negative numbers in the binary system can be represented by
550    1. 10's Complement 2. 2's complement
5513.
552Sign magnitude
5534.
554I's complement
555   2.0
556    83
557The number of full and half-adders required to add 16-bit numbers is
558  1.
5592.
5603.
5618 half-adders, 8 full-adders
5621 half-adders, 15 full-adders
56316 half-adders, 0 full-adders 4. 4 half-adders, 12 full-adders
564   2.0
565   84
566  The number of states in a machine M recognizing L1UL2 will be __________________ where n is the number of states in M1 and m is the number of states in M2 .
567     1. m-n
5682. m+n
5693. m+n+1
5704. n-m
571    2.0
572 
573   S.NO.
574  Questions
575    Choices
576   Answers
577    85
578The number of states in a machine M recognizing L1UL2 will be __________________ where n is the number of states in M1 and m is the number of states in M2 .
579  1. m-n
5802. m+n
5813. m+n+1
5824. n-m
583   2.0
584   86
585   The number of states in DFA is -------- the number of states in NFA for the same Language.
586      1.
587Greater then
5882. equal to
5893.
590less then
5914.
592greater then or equal to
593     3.0
594    87
595The processor 80386/80486 and the Pentium processor uses _____ bits address bus:
596  1.
59736
5982.
59932
6003.
60116
6024. 64
603   2.0
604     88
605  The set of all strings over the alphabet {a,b} (including epsilon} is denoted by
606    1. (a+b)^+
6072. a^+b^+
6083. a*b*
6094. (a+b)*
610     4.0
611     89
612  The set of fundamental assumptions about what products the organization should produce, how and where it should produce them, and for whom they should be produced is
613    1. organizational culture. 2. behavioral model.
6143. rational model.
6154. agency theory.
616     1.0
617   90
618   The set of fundamental assumptions about what products the organization should produce, how and where it should produce them, and for whom they should be produced is
619     1. organizational culture. 2. behavioral model.
6203. rational model.
6214. agency theory.
622    1.0
623    91
624The special memory used to store the micro routines of a computer is ________.
625  1.
6262.
6273.
628Control table
629Control store
630Control mart 4. Control shop
631   2.0
632   92
633  The system having memory elements are called.
634    1. sequential circuits
6352. complex circuits
6363. combinational circuits 4. logic circuits
637   1.0
638 
639   S.NO.
640  Questions
641    Choices
642   Answers
643   93
644 The term m45 should be made up of at least _____ literals.
645    1. 6 2. 31 3. 4 4. 5
646   2.0
647    94
648The three key levels at which responsibility can be defined is at the ____,_______,____
649  1. Team, Organization, contractor 2. Project, Strategic, Activity
6503. Project, Activity, WBS
6514. Project, Organization, Team
652   4.0
653     95
654  The while loop is referred to as a(n) _____ loop because the loop condition is tested at the beginning of the loop
655    1. priming 2. pretest
6563. initial
6574. beginning
658     2.0
659     96
660  The word case used in the switch statement represents a
661    1. global variable in the C++ language 2. function in the C++ language
6623. keyword in the C++ language
6634. data type in the C++ language
664     3.0
665     97
666  Two access specifiers in C++ are
667    1. void and free
6682. public and private 3. int and double
6694. formal and informal
670     2.0
671     98
672  Usecase analysis focuses upon
673    1. Actors 2. Objects 3. Data
6744. Entities
675     1.0
676     99
677  Variables inside parenthesis of functions declarations have _______ level access.
678    1. Local
6792. Global
6803. Module 4. Universal
681     1.0
682   100
683   Virtual memory is __________
684     1. A type of memory used in super computers 2. An illusion of extremely large main memory 3. An extremely large main memory
6854. An extremely large secondary memory
686    2.0
687   101
688WE RECEIVED “404 – PAGE NOT FOUND” MESSAGE, WHEN WE BROWSE THE WEB PAGE. WHICH PROTOCOL PROVIDES THIS MESSAGE?
689   1.
690IGP
6912. EGP 3.
692SNMP
6934.
694ICMP
695   4.0
696 
697   S.NO.
698  Questions
699    Choices
700   Answers
701    102
702What are the minimum number of 2-to-1 multiplexers required to generate a 2- input AND gate and a 2-input Ex-OR gate?
703  1.
7042.
7053.
7061 and 3
7071 and 1 4. 2 and 2
7081 and 2
709   1.0
710     103
711  What does the following declaration mean? int (*ptr)[10];
712    1. ptr is array of pointers to 10 integers
7132. ptr is a pointer to an array of 10 integers 3. ptr is an array of 10 integers
7144. ptr is an pointer to array
715     2.0
716     104
717  What is an Accumulator?
718    1. A Flip flop
7192. A counter
7203. A Sequential Logic Circuit
7214. A Combinational Logic Circuit
722     3.0
723     105
724  What is an ALU?
725    1. A Combinational Logic Circuit
7262. A Sequential Logic Circuit
7273. A Combination of Combinational Circuit and Sequential Circuit 4. A flip flop
728     2,3
729     106
730  What is the condition for setting the Overflow flag in status register?
731    1. Last two sum bits are different 2. Last two carrys are same
7323. Last two sum bits are same
7334. Last two carrys are different
734     3.0
735     107
736  What is the maximum number of reduce moves that can be taken by a bottom-up parser for a
737    1. n/2 2. n-1 3. 2n-1 4. 2^n
738     2.0
739   108
740   What is the recommended distribution of effort for a software project?
741     1. 50-20-30 2. 50-30-20 3. 30-40-30 4. 40-20-40
742    4.0
743    109
744What is the return type of the conversion operator function?
745  1. no return type 2. int
7463. void
7474. float
748   1.0
749     110
750  What is the status of the inputs S0, S1, and S2 of the 74151 eight-line multiplexer in order for the output Y to be a copy of input I5?
751    1. S0 = 1, S1 = 0, S2 = 1 2. S0 = 1, S1 = 1, S2 = 0 3. S0 = 0, S1 = 1, S2 = 0 4. S0 = 0, S1 = 0, S2 = 1
752     1.0
753   111
754  What is true about constant member function of a class?
755    1. cannot access any of its class data members
7562. cannot modify values of its class data members
7573. cannot modify values of its class data members which are mutable 4. can modify values of its class data members
758   2.0
759 
760   S.NO.
761  Questions
762    Choices
763   Answers
764   112
765 What will be the output of the following code #include void main() { int i; int a[3]=5; for (i=2;i>=0;i--) { printf(?%d\n?,a[i]); } }
766    1. 0 0 5
7672. 5 0 0
7683. 5 garbage garbage 4. 5 null null
769   3.0
770    113
771When an instruction is read from the memory, it is called
772  1.
773Memory Read cycle
7742.
775Fetch cycle
7763.
777Instruction cycle
7784.
779Memory write cycle
780   3.0
781     114
782  When FA M is given which recognizes language L and reverse of L is found by using M then there can be ___________Final states
783    1. Two
7842. Three
7853.
786Only one
7874. Any number
788     3.0
789     115
790  When there is complete DFA with Five states out of which two are final states if F is modified such that it recognizes complement of the original language then there will be at least _________final states.
791    1. 3
7922. 2
7933. 5
7944. 7
795     3.0
796   116
797   When there is more than one final state in the reduced FA, then its regular expression will contain _________ operator surely
798     1. dot
7992. binary + 3. star
8004. unary +
801    4.0
802    117
803When we concatenate two languages L1 and L2 recognized by machine M1 and M2 we obtain a machine with final state same as that of __________________
804  1. M1 OR M2 2. M1 AND M2 3. M2
8054. M1
806   2.0
807     118
808  Which directory implementation is used in most Operating System?
809    1. Two level directory structure 2. Acyclic directory structure
8103. Single level directory structure 4. Tree directory structure
811     4.0
812   119
813   Which is not a proper prototype?
814     1. double funct(char x)
8152. void funct();
8163. char x();
8174. intfunct(char x, char y);
818    1.0
819   120
820WHICH OF THE BELOW IS CALLED CLASSLESS ADDRESS?
821   1.
8222.
8233.
824191.168.1.1/24
825191.168.1.1/16
826191.168.1.1/8
8274.
828191.168.1.1/4
829   2.0
830 
831   S.NO.
832  Questions
833    Choices
834   Answers
835    121
836WHICH OF THE BELOW IS NOT AN EMAIL PROTOCOL?
837  1. SMTPMP 2. IMAP
8383. POP
8394. SNMP
840   4.0
841   122
842   Which of the following calls a function named displayName, passing it no actual arguments?
843     1. call displayName 2. call displayName () 3. displayName
8444. displayName()
845    4.0
846    123
847Which of the following conversion is not possible (algorithmically)?
848  1. nondeterministic PDA to deterministic PDA 2. nondeterministic FSA to deterministic FSA 3. regular grammar to context-free grammar
8494. nondeterministic TM to deterministic TM
850   1.0
851     124
852  Which of the following derivations does a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order.
853    1. Leftmost derivation
8542. Leftmost derivation traced out in reverse 3. Rightmost derivation
8554. Rightmost derivation traced out in reverse
856     1.0
857     125
858  Which of the following functions compares two strings?
859    1. compare();
8602. cmp();
8613. stringcompare(); 4. strcmp();
862     4.0
863     126
864  Which of the following gives the memory address of a variable pointed to by pointer a?
865    1. a;
8662. *a;
8673. &a;
8684. address(a);
869     3.0
870     127
871  which of the following intermediate language can be used in intermediate code generation?
872    1. Quadraples
8732. Postfix notation and Three address code 3. Triples
8744. Infix notation and two address code
875     1,3,2
876     128
877  Which of the following is a complete function?
878    1. void funct(int) { printf(?Hello"); } 2. int funct();
8793. void funct(x) { printf(?Hello"); } 4. int funct(int x) { return x=x+1; }
880     4.0
881     129
882  Which of the following is a valid destructor of the class name "Country"
883    1. void ~Country()
8842. int ~Country(Country obj) 3. int ~Country()
8854. Country()
886     4.0
887   130
888  which of the following is an incorrect definition inside a class ?
889    1. void * operator new () { }
8902. int operator ++() { }
8913. void operator delete(void * ptr) { } 4. void * operator new(size_t size) { }
892   2.0
893 
894   S.NO.
895  Questions
896    Choices
897   Answers
898    131
899Which of the following is correct for a gated D flip-flop?
900  1.
9012.
9023.
903Only one of the inputs can be HIGH at a time.
904The output toggles if one of the inputs is held HIGH.
905The output complement follows the input when enabled. 4. Q output follows the input D when the enable is HIGH.
906   4.0
907     132
908  Which of the following is not a technology driver for an information system?
909    1. Collaborative technologies
9102. Knowledge asset management 3. Enterprise applications
9114. Object technologies
912     2.0
913     133
914  Which of the following is not a type of constructor?
915    1. Copy Constructor
9162. Friend Constructor
9173. Default Constructor
9184. Parametrized Constructor
919     2.0
920     134
921  Which of the following is the insertion operator?
922    1. /* 2. // 3. << 4. >>
923     4.0
924     135
925  Which of the following is/are main parameters that you should use when computing the costs of a software development project?
926    1. Hardware and software costs
9272. Effort costs (the costs of paying software engineers and managers) 3. Travel and training costs
9284. All the parameters required given in the option.
929     4.0
930   136
931   Which of the following language feature is not an access specifier in C++?
932     1. internal 2. protected 3. public
9334. private
934    1.0
935   137
936 Which of the following regular expression denotes a language comprising of all possible strings over {a,b} of length n where n is a multiple of 3?
937    1. (aaa+ab+a)+(bbb+bb+a)
9382.
939((a+b) (a+b) (a+b))*
9403. (aaa+bbb)*
9414. (a+b+aa+bb+aba+bba)*
942    2.0
943    138
944Which of the following regular expression identities are true?
945  1. r* s* = r* + s*
9462. (r + s)* = (r*s*)*
9473. (r + s)* = r* + s* 4. (r + s)* = r* s*
948   2.0
949   139
950  Which of the following results in a compile-time error?
951    1. int f2() { static int i; i++; return i; } 2. int f3( static int i) { return 300;}
9523. static int f1() { return 100; }
9534. static int a;
954   3.0
955 
956   S.NO.
957  Questions
958    Choices
959   Answers
960    140
961Which of the following scheduling algorithm comes under preemptive scheduling?
962  1. FCFS
9632. Round Robin
9643. Multilevel Queue Scheduling 4. Largest Job First
965   2.0
966   141
967   Which of the following special symbol is allowed in a variable name?
968     1. _ (underscore) 2. - (hyphen)
9693. | (pipeline)
9704. * (asterisk)
971    1.0
972   142
973 Which of the following statement is false?
974    1. For R = R1*, L(R) is empty if and only if L(R1) is empty 2. For R = (R1), L(R) is empty if and only if L(R1) is empty
9753. For R = R1R2 , L(R) is empty if and only if either L(R1) or L(R2) is empty.
9764. If R = R1+ R2 , L(R) is empty if and only if both L(R1) and L(R2) are empty.
977    1.0
978   143
979 Which of the following statement is false?
980    1. If there is a PDA by acceptance state that accept L, then there is also a PDA by empty stack that accept L
9812. If there is a NPDA that accept L, then there is also a DPDA that accept L.
9823. If there is a PDA by empty stack, then there is also a CFG G that accept L.
9834. If there is a CFG G that accepts L, then there is also a PDA that accept L.
984        144
985Which of the following statements is/are FALSE?
986  1. Turing recognizable languages are closed under union and complementation.
9872. Turing decidable languages are closed under intersection and complementation
9883. Turing recognizable languages are closed under union and intersection.
9894. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
990        145
991  Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
992    1. Removing left recursion alone
9932. Factoring the grammar alone
9943. Removing left recursion and factoring the grammar
9954. Removing left recursion, left factoring and ambiguity of the grammar
996     4.0
997     146
998  Which of the following ways are legal to access a class data member using this pointer?
999    1. this.x 2. *this.x 3. this->x 4. *this-x
1000     3.0
1001   147
1002  Which one of the following is a top-down parser?
1003    1. An LR(k) parser.
10042. An LALR(k) parser
10053. Operator precedence parser. 4. Recursive descent parser.
1006   4.0
1007 
1008   S.NO.
1009  Questions
1010    Choices
1011   Answers
1012    148
1013Which one of the following is a valid project Key Performance Indicator (KPI)?
1014  1. Master schedule.
10152. Staff appraisals.
10163. Management buy in.
10174. Milestone achievement.
1018   4.0
1019   149
1020   Which one of the following is the correct way to declare a pure virtual function?
1021     1. virtual void Display(void){0}; 2. void Display(void) = 0;
10223. virtual void Display(void) = 0; 4. virtual void Display = 0;
1023    3.0
1024    150
1025Which one of the following languages over alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
1026  1.
1027The set of all strings containing at least two 0’s
10282. The set of all strings that begin and end with either 0 or 1.
10293.
1030The set of all strings containing at most two 0’s.
10314.
1032The set of all strings containing the substring 00.
1033   1.0
1034   151
1035   Which one of the following models is not suitable for accommodating any change?
1036     1. Build & Fix Model 2. RAD Model
10373. Waterfall Model
10384. Prototyping Model
1039    3.0
1040    152
1041Which one of the following regular expressions over {0,1} denotes the set of all strings not containing 100 as a substring?
1042  1. 0*(11*0)*
10432. 0*1*01
10443. 0*(10+1)*
10454. 0*1010*
1046   1234.0
1047     153
1048  Which one of the following statements best defines the purpose of a Product Breakdown Structure (PBS)?
1049    1. To identify the health and safety strategies and procedures to be used on the project
10502. To establish the extent of work required prior to project commissioning and the handover
10513. To define how the products are produced by identifying derivations and dependencies
10524. To define the hierarchy of deliverables that are required to be produced on the project
1053     4.0
1054     154
1055  Who owns the Project Management Plan (PMP)?
1056    1. The project team.
10572. The chief executive.
10583. The project manager.
10594. The project support office.
1060     3.0
1061   155
1062   Write the regular expression to denote the language L over ? ={ a,b} such that all the string do not contain the substring “ ab”.
1063     1. a*b* 2. b*a* 3. (ab)* 4. (ba)*
1064    24.0
1065   156
1066Zero address instruction format is used for
1067   1.
10682.
10693.
1070Von-Neuman architecture
1071RISC architecture
1072CISC architecture 4. Stack-organized architecture
1073   4.0
1074 
1075   S.NO.
1076  Questions
1077    Choices
1078   Answers
1079   157
1080 In a slab under steady state conduction if the thermal conductivity increases along the thickness, the temperature gradient along the direction will become
1081    1.
1082Steeper
10832.
1084Flatter
10853.
1086Constant
10874.
1088mixed pattern
1089    3.0
1090    158
1091The temperature of a gas stream is to be measured by a thermocouple whose junction can be approximated as 1-mm-dia sphere. The properties of the junction are k = 35 W/m °C, ρ = 8500 kg/m3, and Cp = 320 J/kg °C, and the convection heat transfer coefficient between the junction and the gas is h =
1092210 W/m2 °C. The time taken by the thermocouple to read 99 percent of the initial temperature difference
1093  1.
10942 sec 2.
109510 sec 3.
109628 sec 4.
109763 sec
1098   3.0
1099   159
1100   Assuming flow to be laminar, if the diameter of the pipe is halved, then the pressure drop will
1101      1.
1102increase
11032.
1104decrease
11053.
1106remain same 4.
1107be quadrupled
1108     1.0
1109    160
1110Dimension of absolute viscosity is
1111  1. ML-1T-1
11122. MLT-1
11133. ML-1T
11144. MLT
1115   1.0
1116   161
1117   Which of the following is minimum error code?
1118      1.Octal code 2.Grey code 3.Binary code 4.
1119Excess 3 code
1120     2.0
1121   162
1122When used with an IC, what does the term "QUAD" indicate?
1123   1.
11244 circuits 2.
11252 circuits 3.
11268 circuits 4.
11276 circuits
1128   1.0
1129 
1130   S.NO.
1131  Questions
1132    Choices
1133   Answers
1134    163
1135Adding 1001 and 0010 gives
1136  1. 1011
11372. 1111
11383.
11390
11404. 1010
1141   1.0
1142     164
1143  Radix of binary number system is _____?
1144    1.
11450
11462.
11471
11483.
11492
11504. A&B
1151     3.0
1152   165
1153   SR Flip flop can be converted to T-type flip-flop if ?
1154     1. is connected to Q
11552.R is connected to Q
11563.Both S and R are shortend
11574.S and R are connected to Q and Q' respectively
1158    4.0
1159    166
1160The main difference between JK and RS flip-flop is that?
1161  1.
1162JK flip-flop does not need a clock pulse 2.
1163there is feedback in JK flip-flop
11643.
1165JK flip-flop accepts both inputs as 1
11664.
1167JK flip-flop is acronym of junction cathode multivibrator
1168   3.0
1169   167
1170   Register is a --------------------
1171      1.Set of capacitor used to register input instructions in a digital computer
11722.Set of paper tapes and cards put in a file
11733.
1174Temporary storage unit within the CPU having dedicated or general purpose use
11754.Part of the auxiliary memory
1176     3.0
1177   168
1178Magnitude comparator compares using operation of
1179   1. addition
11802.
1181subtraction
11823. multiplication 4.
1183division
1184   xnor1
1185 
1186   S.NO.
1187  Questions
1188    Choices
1189   Answers
1190    169
1191An SR flip flop cannot accept the following input entry
1192  1.
1193Both input zero
11942.
1195zero at R and one at S
11963.
1197zero at S and one at R 4.
1198Both inputs one
1199   4.0
1200     170
1201  One operation that is not given by magnitude comparator
1202    1. equal
12032.
1204less
12053. greater 4. addition
1206     2.0
1207     171
1208  Automaton accepting the regular expression of any number of a ' s is:
1209    1.
1210a*
12112.
1212a
12133. a*b* 4. abc
1214     1.0
1215   172
1216   Let L be a set accepted by a nondeterministic finite automaton. The number of states in non- deterministic finite automaton is |Q|. The maximum number of states in equivalent finite automaton that accepts L is
1217      1. |Q| 2. 2|Q| 3.
12182 raise to power |Q|*1 4.
12192 raise to power |Q|
1220     4.0
1221   173
1222Number of final state require to accept Φ(phi) in minimal finite automata.
1223   1. 4 2. 3 3. 1 4. 0
1224   4.0
1225 
1226   S.NO.
1227  Questions
1228    Choices
1229   Answers
1230    174
1231The embedded c program is converted by cross compiler to
1232  1.
1233the machine code corresponding to the processor of the PC used for application development
12342.
1235the machine code corresponding to a processor which is different from the processor of the PC used for application development
12363.
1237the machine code for all the microcontrollers
12384.
1239assemble code of the PC used for application development
1240   2.0
1241     175
1242  The regular expression 0*(10*)* denotes the same set as
1243    1.
1244(1*0)*1*
12452.
12460 + (0 + 10)*
12473.
1248(0 + 1)* 10(0 + 1)* 4.
1249(0+1)*
1250     1.0
1251   176
1252   Which of the following statements is/are FALSE?
1253(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
1254(2) Turing recognizable languages are closed under union and complementation.
1255(3) Turing decidable languages are closed under intersection and complementation
1256(4) Turing recognizable languages are closed under union and intersection.
1257      1.
12581 and 4 only 2.
12591 and 3 only 3.
12602 only
12614.
12623 only
1263     3.0
1264   177
1265Two automata are equal when
1266   1.
1267both are under union
12682.
1269both are under same language
12703.
1271both are having equal number of states
12724.
1273both are having same number of final states
1274   2.0
1275 
1276   S.NO.
1277  Questions
1278    Choices
1279   Answers
1280    178
1281What is the minimum number of states needed to a DFA over Σ= (a, b) which accept those words from Σ such that the number of a is even and the number of b is divisible by three.
1282  1.
12832 states 2.
12844 states 3.
12856 states 4.
12865 states
1287   3.0
1288     179
1289  If a language is denoted by a regular expression L = ( x )* (x | y x ) ,
1290then which of the following is not a legal string within L ?
1291    1. yx 2. xyx 3.
1292x
12934. xyxyx
1294     4.0
1295   180
1296   The CFG s--->as|bs| a| b
1297is equivalent to regular expression
1298      1.
1299(a + b)
13002.
1301(a + b) (a + b)*
13023.
1303(a + b) (a + b)
13044.
1305(a + b) (a + b)(a + b) (a + b)
1306     2.0
1307    181
1308----------------------------is used to check whether the language is not regular.
1309  1.
1310Pumping Lemma 2.
1311RE
13123.
1313MN Theorem
13144.
1315Pigeon hole principle
1316   1.0
1317   182
1318  The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
1319     1.
1320the instruction set architecture 2.
1321page size
13223.
1323physical memory size
13244.
1325number of processes in memory
1326    1.0
1327 
1328   S.NO.
1329  Questions
1330    Choices
1331   Answers
1332    183
1333A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit. The size of the cache tag directory is
1334  1. 11
13352. 14 3. 27 4. 16
1336   4.0
1337   184
1338   Pre-emptive scheduling is the strategy of temporarily suspending a running process
1339      1.
1340before the CPU time slice expires
13412.
1342to allow starving processes to run 3.
1343when it requests IO
13444.
1345None of mentioned
1346     1.0
1347    185
1348Multiprogramming systems ______
1349  1.
1350Are easier to develop than single programming systems 2.
1351Execute each job faster
13523.
1353Execute more jobs in the same time
13544.
1355Are used only on large main frame computers
1356   3.0
1357   186
1358   The DMA controller has _______ registers
1359      1. 4 2. 2 3. 3 4. 1
1360     3.0
1361   187
1362The truth table X Y f(X,Y) 000 010 101 111
1363represents the Boolean function
1364   1. X
13652. X+Y
13663. X'Y' 4.
1367Y
1368   1.0
1369 
1370   S.NO.
1371  Questions
1372    Choices
1373   Answers
1374    188
1375Which of the following regular expression denotes a language comprising of all possible strings over ∑= {a,b} of length n where n is a multiple of 3?
1376  1.
1377(a+b+aa+bb+aba+bba)*
13782.
1379(aaa+bbb)*
13803.
1381((a+b) (a+b) (a+b))*
13824.
1383(aaa+ab+a)+(bbb+bb+a)
1384   3.0
1385     189
1386  Which of the following statement is true?
1387    1.NFA is more powerful than DFA 2.DFA is more powerful than NFA 3.
1388NFA and DFA have equal power 4.None
1389     3.0
1390   190
1391   Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?
1392     1.256 2.2048 3.1024 4.512
1393    4.0
1394    191
1395ElGamal encryption system is:
1396  1.
1397symmetric key encryption algorithm 2.
1398asymmetric key encryption algorithm 3.
1399not an encryption algorithm
14004.
1401none of the mentioned
1402   2.0
1403     192
1404  #include < stdio.h > int main()
1405{
1406typedef auto int AI; AI var=100; printf("var=%d",var); return 0;
1407}
1408Find the output
1409    1. var=100 2. var=AI 3.
1410var=0
14114.
1412Error
1413     4.0
1414     193
1415  #include < stdio.h > int main()
1416{
1417typedef char* string;
1418string myName="ABCDEFG";
1419printf("myName=%s (size=%d)",myName,sizeof(myName)); return 0;
1420}
1421Find the output
1422    1. myName=ABCDEFG(size=7) 2.
1423Error
14243. myName=ABCDEFG(size=4) 4. myName=ABCDEFG(size=8)
1425     4.0
1426   194
1427  #include < stdio.h > int main()
1428{
1429typedef int AAA,BBB,CCC,DDD; AAA aaa=10;
1430BBB bbb=20;
1431CCC ccc=30;
1432DDD ddd=40; printf("%d,%d,%d,%d",aaa,bbb,ccc,ddd); return 0;
1433}
1434Find the output
1435     1.
1436Error
14372.
143810,10,10,10
14393.
144010,20,30,40
14414. AAA,BBB,CCC,DDD
1442    3.0
1443 
1444   S.NO.
1445  Questions
1446    Choices
1447   Answers
1448    195
1449#include < stdio.h > int main()
1450{
1451typedef struct {
1452int empid;
1453int bsal; }EMP;
1454EMP E={10012,15100}; printf("%d,%d",E.empid,E.bsal); return 0;
1455}
1456Find the output
1457  1. 10012,12100 2.
14580,0
14593.
1460Error
14614. 10012,10012
1462   1.0
1463   196
1464   #include < stdio.h > void main()
1465{
1466unsigned char var=0; for(var=0;var<=255;var++); {
1467printf("%d ",var); }
1468}
1469Find the output
1470      1.
14710 1 2 ... 255
14722.
1473255
14743.
1475256
14764.
1477blank screen as output
1478     1.0
1479    197
1480#include <stdio.h>
1481#define MOBILE 0x01 #define LAPPY 0x02
1482int main() {
1483unsigned char item=0x00;
1484item |=MOBILE; item |=LAPPY;
1485printf("I have purchased ...:"); if(item & MOBILE){
1486printf("Mobile, "); }
1487if(item & LAPPY){ printf("Lappy");
1488}
1489return 1; }
1490  1.
1491I have purchased ...: 2.
1492I have purchased ...:Mobile, Lappy 3.
1493I have purchased ...:Mobile, 4.
1494I have purchased ...:Lappy
1495     2.0
1496     198
1497  #include <stdio.h>
1498int main() {
1499char flag=0x0f;
1500flag &= ~0x02; printf("%d",flag);
1501return 0; }
1502Predict the Output.
1503    1. 13 2. d 3. 22 4. 10
1504     1.0
1505   199
1506  #include <stdio.h>
1507int main() {
1508int a=10; int b=2; int c;
1509c=(a & b); printf("c= %d",c);
1510return 0; }
1511Find the output.
1512     1.
1513c = 12 2.
1514c = 10 3. c=2 4. c=0
1515    3.0
1516 
1517   S.NO.
1518  Questions
1519    Choices
1520   Answers
1521    200
1522#include <stdio.h>
1523#define FUN(x,y) x##y
1524int main()
1525{
1526int a1=10,a2=20; printf("%d...%d",FUN(a,1),FUN(a,2)); return 0;
1527}
1528Find the output
1529  1. Error 2. 10...10 3. 20...20 4. 10...20
1530   4.0
1531     201
1532  #include <stdio.h>
1533#define LARGEST(x,y) (x>=y)?x:y int main()
1534{
1535int a=10,b=20,l=0; l=LARGEST(a++,b++);
1536printf("a=%d,b=%d,largest=%d",a,b,l);
1537return 0; }
1538Find the output
1539    1. a=10,b=20,largest=20 2. a=11,b=21,largest=20 3. a=11,b=21,largest=21 4. a=11,b=22,largest=21
1540     4.0
1541   202
1542   #include <stdio.h> #define MAX 100 int main()
1543{
1544#define MAX 20 printf("MAX=%d...",MAX); return 0;
1545}
1546Find the output
1547      1.
1548Error
15492. MAx=100... 3. MAx=20... 4. MAX=10020
1550     3.0
1551    203
1552#include <stdio.h>
1553#define MAX 10
1554int main()
1555{ int array[MAX]={1,2,3},tally;
1556for(tally=0;tally< sizeof(array)/sizeof(int);tally+=1) printf("%d ",*(tally+array));
1557return 0; }
1558Find the output
1559  1.
1560Error
15612.
15621 3 4 5 6 7 8 9 10 11 3.
15631230000000
15644.
15650000000000
1566   3.0
1567     204
1568  #include <stdio.h> #define MAX 99 int main()
1569{
1570printf("%d...",MAX); #undef MAX printf("%d",MAX); return 0;
1571}
1572Find the output
1573    1.
157499...0
15752.
157699...99
15773.
1578Error
15794. MAX...MAX
1580     3.0
1581   205
1582  #include <stdio.h>
1583#define TEXT IncludeHelp int main()
1584{
1585printf("%s",TEXT);
1586return 0; }
1587Find the output
1588     1.
1589IncludeHelp
15902.
1591TEXT
15923.
1593Error
15944.
1595TEXT IncludeHelp
1596    3.0
1597 
1598   S.NO.
1599  Questions
1600    Choices
1601   Answers
1602    206
1603#include <stdio.h> #define TRUE 1 int main()
1604{
1605if(TRUE) printf("1"); printf("2");
1606else printf("3"); printf("4");
1607return 0; }
1608Find the output.
1609  1.
16101
16112. Error 3.
16122 4. 12
1613   2.0
1614   207
1615   #include <stdio.h> #define TRUE 1 int main()
1616{
1617int loop=10;
1618while(printf("Hello ") && loop--); }
1619Find the output
1620      1.
1621Hello
16222.
1623Hello Hello Hello Hello ... (infinite times) 3.
1624Hello (10 times)
16254.
1626Hello (11 times)
1627     4.0
1628   208
1629 #include <stdio.h>
1630#define VAR1 VAR2+10 #define VAR2 VAR1+20
1631int main() {
1632printf("%d",V AR1);
1633return 0; }
1634Find the output
1635    1.
1636V AR2+10 2.
1637V AR1+20 3.
1638Error
16394.
164010
1641    3.0
1642    209
1643#include <stdio.h> #include < string.h >
1644struct student {
1645char name[20]; }std;
1646char * fun(struct student *tempStd) {
1647strcpy(tempStd->name,"Thomas");
1648return tempStd->name; }
1649int main() {
1650strcpy(std.name,"Mike "); printf("%s%s",std.name,fun(&std)); return 0;
1651}
1652Find the output
1653  1.
1654Mike Thomas 2.
1655Mike Mike
16563. ThomasThomas 4.
1657ThomasMike
1658   3.0
1659   210
1660  #include <stdio.h> #include <string.h> int main()
1661{
1662char s1[]="IncludeHelp"; char s2[10];
1663strncpy(s2,s1,5); printf("%s",s2); return 0;
1664}
1665Find the output
1666     1.
1667Inclu
16682.
1669IncluGARBAGE_V ALUE 3.
1670Error
16714.
1672IncludeHelp
1673    1.0
1674 
1675   S.NO.
1676  Questions
1677    Choices
1678   Answers
1679    211
1680#include <stdio.h> #include <string.h> int main()
1681{
1682char str1[]="IncludeHelp",str2[]=".Com"; printf("%s",str1+strlen(str2));
1683return 0;
1684}
1685Find the output
1686  1. IncludeHelp.Com 2.
1687udeHelp
16883.
1689Error
16904.
1691IncludeHelp4
1692   2.0
1693     212
1694  #include <stdio.h> #include <string.h> int main()
1695{
1696char str[50]="IncludeHelp"; printf("%d...%d",strlen(str),sizeof(str)); return 0;
1697}
1698Find the output
1699    1. 50...5011...50 2.
170011...50
17013.
170211...11
17034.
170450...11
1705     2.0
1706   213
1707   #include <stdio.h> #include <string.h> int main()
1708{
1709int val=0;
1710char str[]="IncludeHelp.Com";
1711val=strcmp(str,"includehelp.com"); printf("%d",val);
1712return 0;
1713}
1714Find the output
1715      1.
17160
17172.
17181
17193.
1720-1
17214. Error
1722     3.0
1723    214
1724#include <stdio.h>
1725#define OFF 0
1726#if debug == OFF
1727int a=11; #endif
1728int main() {
1729int b=22; printf("%d...%d",a,b); return 0;
1730}
1731Find the output
1732  1. 11...22 2. Error 3. 11...11 4. 22...22
1733   1.0
1734   215
1735   #include <stdio.h>
1736int main() {
1737char *text="Hi Babs."; char x=(char)(text+3); printf("%c\n",x); return 0;
1738}
1739Find the output
1740      1. Garbage 2.
1741B
17423.
1743Error
17444.
1745Null
1746     4.0
1747   216
1748#include <stdio.h>
1749int main() {
1750char *text="Hi Babs."; char x=(char)(text[3]); printf("%c\n",x); return 0;
1751}
1752Find the output
1753   1. Garbage 2.
1754B
17553.
1756Error
17574.
1758Null
1759   2.0
1760 
1761   S.NO.
1762  Questions
1763    Choices
1764   Answers
1765    217
1766#include <stdio.h>
1767int main() {
1768int anyVar=10; printf("%d",10); return 0;
1769}
1770extern int anyVar;
1771Find the output
1772  1.
1773Complie time error 2.
177410
17753.
1776Run Time error
17774.
1778No output
1779   2.0
1780   218
1781   #include <stdio.h>
1782int main() {
1783int x=2.3;
1784const char c1=(float)x; const char c2=(int)x;
1785printf("%d,%d\n",c1,c2);
1786return 0; }
1787Find the output
1788      1.
1789Error
17902.
17912.3,2
17923. 2.3000000,2 4.
17932,2
1794     2.0
1795   219
1796 #include <stdio.h>
1797struct sample {
1798int a; }sample;
1799int main() {
1800sample.a=100; printf("%d",sample.a); return 0;
1801}
1802Find the output
1803    1.
18040
18052.
1806100
18073. ERROR 4. arning
1808    2.0
1809    220
1810#include <stdio.h> char* fun1(void)
1811{
1812char str[]="Hello";
1813return str; }
1814char* fun2(void) {
1815char *str="Hello";
1816return str; }
1817int main() {
1818printf("%s,%s",fun1(),fun2());
1819return 0; }
1820Find the output
1821  1.
1822ERROR
18232.
1824Hello,Hello
18253. Hello,Garbage 4. Garbage,Hello
1826   4.0
1827   221
1828  #include <stdio.h> char* strFun(void) {
1829char *str="IncludeHelp";
1830return str; }
1831int main() {
1832char *x;
1833x=strFun();
1834printf("str value = %s",x); return 0;
1835}
1836Find the output
1837     1.
1838str value= Garbage value 2.
1839str value = IncludeHelp 3.
1840Error
18414.
1842No output
1843    2.0
1844 
1845   S.NO.
1846  Questions
1847    Choices
1848   Answers
1849    222
1850#include <stdio.h> int fooo(void)
1851{
1852static int num=0; num++;
1853return num;
1854}
1855int main() {
1856int val;
1857val=fooo();
1858printf("step1: %d\n",val); val=fooo();
1859printf("step2: %d\n",val); val=fooo();
1860printf("step3: %d\n",val); return 0;
1861}
1862Find the output
1863  1. step1: 1 step2: 1 step3: 1 2. step1: 1 step2: 2 step3: 3 3. step1: 0 step2: 0 step3: 0 4. ERROR
1864   2.0
1865     223
1866  #include <stdio.h> int main()
1867{
1868#ifdef debug
1869printf("Start debugging..."); #endif
1870printf("IncludeHelp");
1871return 0; }
1872Find the output
1873    1.
1874Start debugging...IncludeHelp 2.
1875IncludeHelp
18763.
1877Error
18784.
1879debug
1880     2.0
1881     224
1882  #include <stdio.h> int main()
1883{
1884return 0; }
1885Find the output
1886int a[5]={0x00,0x01,0x02,0x03,0x04},i; i=4;
1887while(a[i])
1888{
1889printf("%02d ",*a+i);
1890--i; }
1891    1.
189200 01 02 03 04 2.
189304 03 02 01 00 3.
189404 03 02 01
18954.
189601 02 03 04
1897     3.0
1898     225
1899  #include <stdio.h> int main()
1900{
1901int a[5]={1,2,3,4,5},b[5]={10,20,30,40,50},tally;
1902for(tally=0;tally< 5;++tally) *(a+tally)=*(tally+a)+ *(b+tally);
1903for(tally=0;tally< 5;tally++) printf("%d ",*(a+tally));
1904return 0; }
1905Find the output
1906    1.
190712345
19082.
190910 20 30 40 50 3.
191011 22 33 44 55 4.
1911Error
1912     3.0
1913   226
1914  #include <stdio.h>
1915int main()
1916{ static int array[]={10,20,30,40,50};
1917printf("%d...%d",*array,*(array+3)* *array);
1918return 0; }
1919Find the output
1920     1.
1921Error
19222. 10...40 3. 10...300 4. 10...400
1923    4.0
1924 
1925   S.NO.
1926  Questions
1927    Choices
1928   Answers
1929    227
1930#include <stdio.h>
1931int main()
1932{ static int x[]={'A','B','C','D','E'},tally;
1933for(tally=0;tally< sizeof(x)/sizeof(int) ; tally+=1) printf("%c,%c,%c\n",*(x+tally)+1,x[tally]+1,*(tally+x)+1);
1934return 0; }
1935Find the output
1936  1. Error 2. A,A,A B,B,B C,C,C D,D,D E,E,E 3. B,B,B C,C,C D,D,D E,E,E F,F,F 4. E,E,E D,D,D C,C,C B,B,B A,A,A
1937   3.0
1938     228
1939  #include <stdio.h> int main()
1940{
1941char result,str[]="\0IncludeHelp"; result=printf("%s",str);
1942if(result)
1943printf("TRUE"); else
1944printf("FALSE"); return 0;
1945}
1946Find the output
1947    1. \0IncludeHelpTRUE 2. \0IncludeHelpFALSE 3.
1948Error
19494.
1950FALSE
1951     4.0
1952   229
1953   #include <stdio.h> int main()
1954{
1955char str[8]="IncludeHelp"; printf("%s",str);
1956return 0;
1957}
1958Find the output
1959      1. IncludeHelp 2.
1960IncludeH
19613.
1962Error
19634.
1964No output
1965     3.0
1966   230
1967#include <stdio.h> int main()
1968{
1969char str[]="Hello%s%dFriends"; printf(str);
1970printf("\n");
1971printf("%s",str);
1972return 0; }
1973Find the output
1974   1.
1975HelloFriends HelloFriends
19762. Hello%s%dFriends Hello%s%dFriends 3. Hello(null)0Friends Hello%s%dFriends 4.
1977Garbage value
1978   3.0
1979 
1980   S.NO.
1981  Questions
1982    Choices
1983   Answers
1984   231
1985 #include <stdio.h> int main()
1986{
1987char str[]="value is =%d"; int a='7';
1988str[11]='c';
1989printf(str,a);
1990return 0; }
1991Find the output
1992    1.
1993value is = %d 2.
1994value is = %c 3.
1995value is = 55 4.
1996value is = 7
1997    4.0
1998    232
1999#include <stdio.h> int main()
2000{
2001char X[10]={'A'},i; for(i=0; i<10; i++)
2002printf("%d ",X[i]); return 0;
2003}
2004Find the output
2005  1.
2006A000000000
20072.
2008A
20093.
2010A 32 32 32 32 32 32 32 32 32 4.
2011Error
2012   4.0
2013   233
2014   #include <stdio.h> int main()
2015{
2016char *str="IncludeHelp"; printf("%c\n",*&*str); return 0;
2017}
2018Find the output
2019      1.
2020Error
20212. IncludeHelp 3.
2022I
20234.
2024*I
2025     3.0
2026    234
2027#include <stdio.h> int main(){
2028float a=125.50; int b=125.50; char c='A';
2029printf("%d,%d,%d\n",sizeof(a),sizeof(b),sizeof(125.50)); printf("%d,%d\n",sizeof(c),sizeof(65));
2030return 0;
2031}
2032What will be the output on a 32 bit compiler.
2033  1.
20344, 4, 4 1, 4
20352.
20364, 4, 8 1, 1
20373.
20384, 4, 4 1, 1
20394.
20404, 4, 8 1, 4
2041   4.0
2042   235
2043  #include <stdio.h> int main()
2044{
2045if( (-100 && 100)||(20 && -20) ) printf("%s","Condition is true.");
2046else
2047printf("%s","Condition is false.");
2048return 0; }
2049Find the output
2050     1.
2051Condition is True 2.
2052Condition is False 3.
2053No output
20544.
2055Error
2056    1.0
2057 
2058   S.NO.
2059  Questions
2060    Choices
2061   Answers
2062    236
2063 #include <stdio.h> int main()
2064{
2065int a=10; if(10L == a)
2066printf("10L"); else if(10==a)
2067printf("10"); else
2068printf("0"); return 0;
2069}
2070Find the output.
2071   1.
207210
20732.
207410L
20753. 10L10 4. Error
2076   2.0
2077     237
2078  #include <stdio.h> int main()
2079{
2080int a=10;
2081if(a==10)
2082{
2083printf("Hello..."); break; printf("Ok");
2084} else
2085{
2086printf("Hii");
2087}
2088return 0; }
2089Find the output.
2090    1.
2091Hello...
20922. Hello...OK 3.
2093OK...
20944.
2095Error
2096     4.0
2097   238
2098   #include <stdio.h> int main()
2099{
2100int a=15;
2101float b=1.234; printf("%*f",a,b); return 0;
2102}
2103Predict the output?
2104      1.
21051.234
21062. 1.234000 3.
21071.234000 4.
2108Error
2109     3.0
2110    239
2111#include <stdio.h> int main()
2112{
2113int i;
2114for(i=0; i< 5; i++) {
2115if(i*i > 30 ) goto lbl;
2116else printf("%d",i);
2117lbl:
2118printf("IHelp ");
2119}
2120return 0; }
2121Find the output
2122  1.
21230IHelp 1IHelp 2IHelp 3IHelp 4IHelp 2.
21240IHelp 1IHelp 2IHelp 4IHelp
21253.
21261IHelp
21274.
2128Error
2129   1.0
2130   240
2131  #include <stdio.h> int main()
2132{
2133int MAX=10;
2134int array[MAX];
2135printf("size of array is = %d",sizeof(array); return 0;
2136}
2137Find the output
2138     1.
2139size of array is = 20 2.
2140size of array is = 40 3.
2141size of array is = 4 4.
2142Error
2143    2.0
2144 
2145   S.NO.
2146  Questions
2147    Choices
2148   Answers
2149    241
2150#include <stdio.h> int main()
2151{
2152int pn=100; if(pn>20)
2153if(pn<20) printf("Heyyyyy");
2154else printf("Hiiiii");
2155return 0; }
2156Find the output.
2157  1.
2158No output
21592.
2160Hiiiii
21613.
2162Heyyyyy
21634. HeyyyyyHiiiii
2164   2.0
2165   242
2166   #include <stdio.h> int main()
2167{
2168int var=100; {
2169int var=200;
2170printf("%d...",var); }
2171printf("%d",var);
2172return 0; }
2173Find the output
2174      1. ERROR 2. 200...200 3. 100...100 4. 200...100
2175     4.0
2176    243
2177#include <stdio.h> int main()
2178{
2179int var=250;
2180printf("value of var = %d\n",var); 200+50;
2181"includehelp.com"; printf("%s\n","includehelp"); return 0;
2182}
2183Find the output
2184  1.
2185value of var = 250 includehelp.com 2.
2186value of var = 250 includehelp
21873.
2188Error
21894.
2190value of var = 250 Garbage
2191   2.0
2192     244
2193  #include <stdio.h> int main()
2194{
2195int iV al;
2196char cV al;
2197void *ptr; // void pointer iVal=50; cVal=65;
2198ptr=&iV al;
2199printf("value =%d,size= %d\n",*(int*)ptr,sizeof(ptr));
2200ptr=&cV al;
2201printf("value =%d,size= %d\n",*(char*)ptr,sizeof(ptr)); return 0;
2202}
2203Find the output
2204    1.
2205Error
22062.
2207value =50,size= 4 value =65,size= 4 3.
2208value =50,size= 4 value =65,size= 1 4.
2209Garbage value
2210     2.0
2211   245
2212  #include <stdio.h> int main()
2213{
2214static int var[5]; int count=0;
2215var[++count]=++count; for(count=0;count<5;count++)
2216printf("%d ",var[count]);
2217return 0; }
2218Find the output
2219     1. 01000 2. 02000 3. 00200 4. 00000
2220    3.0
2221 
2222   S.NO.
2223  Questions
2224    Choices
2225   Answers
2226   246
2227 #include <stdio.h> int main()
2228{
2229struct sample{ int a;
2230int b;
2231sample *s; }t;
2232printf("%d,%d",sizeof(sample),sizeof(t.s));
2233return 0; }
2234Find the output
2235    1.
223612, 12 2.
223712, 0 3. Error 4.
223812, 4
2239    4.0
2240   247
2241 #include <stdio.h> int main()
2242{
2243struct std {
2244char name[30];
2245int age; };
2246struct std s1={"Mike",26}; struct std s2=s1;
2247printf("Name: %s, Age: %d\n",s2.name,s2.age); }
2248Find the output
2249    1.
2250Name: Mike, Age: 26
22512.
2252Name: Garbage, Age: Garbage 3.
2253Name: Null, Age: 26
22544.
2255Error
2256    1.0
2257    248
2258#include <stdio.h> int main()
2259{
2260typedef struct tag{ char str[10];
2261int a;
2262}har;
2263har h1,h2={"IHelp",10}; h1=h2;
2264h1.str[1]='h'; printf("%s,%d",h1.str,h1.a); return 0;
2265}
2266Find the output
2267  1. ERROR 2.
2268IHelp, 10 3.
2269IHelp, 0 4.
2270Ihelp, 10
2271   4.0
2272   249
2273   #include <stdio.h> int main()
2274{
2275union test {
2276int i;
2277int j; };
2278union test var=10;
2279printf("%d,%d\n",var.i,var.j); }
2280Find the output
2281      1. 10,10 2. 10,0 3. 0,10 4. Error
2282     4.0
2283   250
2284#include <stdio.h> int main()
2285{
2286union values {
2287int intVal;
2288char chrVal[2];i };
2289union values val;
2290val.chrVal[0]='A'; val.chrVal[1]='B';
2291printf("\n%c,%c,%d",val.chrV al[0],val.chrV al[1],val.intV al);
2292return 0; }
2293Find the output
2294   1.
2295A,B,0
22962. A,B,16961 3.
2297B,B,66
22984.
2299A,A,65
2300   2.0
2301 
2302   S.NO.
2303  Questions
2304    Choices
2305   Answers
2306    251
2307#include <stdio.h> int main()
2308{
2309union values {
2310unsigned char a; unsigned char b; unsigned int c;
2311};
2312union values val; val.a=1;
2313val.b=2; val.c=300;
2314printf("%d,%d,%d",val.a,val.b,val.c);
2315return 0; }
2316Find the output
2317  1.
231844,44,300
23192.
23201,2,300
23213.
23222,2,300
23234. 256,256,300
2324   1.0
2325   252
2326   #include <stdio.h> int main()
2327{
2328void *ptr; ++ptr; printf("%u",ptr); return 0;
2329}
2330Find the output
2331      1.
23322004
23332.
23342001
23353.
23362000
23374. ERROR
2338     2.0
2339   253
2340 #include <stdio.h> struct employee{
2341int empId; char *name; int age;
2342};
2343int main() {
2344struct employee emp []={ {1,"Mike",24}, {2,"AAA",24}, {3,"BBB",25}, {4,"CCC",30} };
2345printf("Id : %d, Age : %d, Name : %s", emp[2].empId,3[emp].age,(*(emp+1)).name);
2346return 0; }
2347Find the output
2348    1.
2349Id: 3, Age: 24, Name: Mike 2.
2350Id: 3, Age: 23, Name: Mike 3.
2351Id: 3, Age: 30, Name: AAA 4.
2352Error
2353    3.0
2354   254
2355#include <stdio.h> void main()
2356{
2357int a=2; switch(a) {
2358printf("Message\n"); default:
2359printf("Default\n"); case 2:
2360printf("Case-2\n"); case 3:
2361printf("Case-3\n"); }
2362printf("Exit from switch\n"); }
2363Find the output
2364   1.
2365Case-2
23662.
2367Message
23683.
2369Message
2370Case-2
23714.
2372Case-2
2373Case-3
2374Exit from switch
2375   4.0
2376 
2377   S.NO.
2378  Questions
2379    Choices
2380   Answers
2381    255
2382#include <stdio.h> void main(){
2383static int staticVar; int j; for(j=0;j<=5;j+=2) switch(j){
2384case 1:
2385staticV ar++; break;
2386case 2:
2387staticV ar+=2;
2388case 4:
2389staticV ar%=2; j=-1; continue;
2390default: --staticV ar; continue;
2391}
2392printf("%d",staticV ar); }
2393Find the output
2394  1.
23950
23962.
23971
23983.
23992
24004. Error
2401   1.0
2402   256
2403   #include <stdio.h> void main(){
2404int a=0; a=5||2|1; printf("%d",a);
2405}
2406Find the output.
2407      1. 2 2. 1 3. 0 4. 8
2408     2.0
2409   257
2410 #include <stdio.h> void main(){
2411int a=1; switch(a/2) {
2412case NULL:
2413printf("Case NULL\n"); break;
2414case 0:
2415printf("Case ZERO\n"); break;
2416default: printf("DEFAULT\n"); break;
2417} }
2418Find the output
2419    1.
2420Case NULL
24212.
2422Case ZERO
24233.
2424Case DEFAULT 4.
2425Error
2426    4.0
2427   258
2428#include <stdio.h> void main()
2429{
2430int a=2; int b=a;
2431switch(b) {
2432case a: printf("Case-a\n");
2433case 3: printf("Case-3\n");
2434break;
2435break;
2436default:
2437printf("No option\n"); break;
2438}
2439printf("Exit from switch"); }
2440Find the output
2441   1.
2442Case-2
24432.
2444Error: case expression not constant 3.
2445Message
2446Case-2
24474.
2448Case-2
2449Case-3
2450Exit from switch
2451   2.0
2452 
2453   S.NO.
2454  Questions
2455    Choices
2456   Answers
2457   259
2458 #include <stdio.h> void main()
2459{
2460int cnt=1; while(cnt>=10) {
2461printf("%d,",cnt);
2462cnt+=1; }
2463printf("\nAfter loop cnt=%d",cnt);
2464printf("\n"); }
2465Find the output
2466    1.
2467After loop cnt= 1 2.
24681,
2469After loop cnt= 2 3.
2470After loop cnt= 2 4.
247111
2472    1.0
2473    260
2474#include <stdio.h> void main()
2475{
2476int i,j,charVal='A';
2477for(i=5;i>=1;i--) {
2478for(j=0;j< i;j++)
2479printf("%c ",(charVal+j));
2480printf("\n"); }
2481}
2482Identify the output
2483  1. ABCDE ABCDE ABCDE ABCDE ABCDE 2. ABCD ABCD ABCD ABCD 3. ABCD ABC AB
2484A
24854. ABCDE ABCD ABC AB
2486A
2487   3.0
2488     261
2489  #include <stdio.h> void main()
2490{
2491int i=1; while (i<=5) {
2492printf("%d",i); if (i==5)
2493goto print; i++;
2494} }
2495fun() {
2496print: printf("includehelp.com");
2497}
2498Find the output
2499    1.
2500Error
25012. 12345includehelp.com 3. 1234includehelp.com 4.
25021includehelp.com 2includehelp.com 3includehelp.com 4includehelp.com 5includehelp.com
2503     1.0
2504   262
2505  #include <stdio.h> void main(){
2506int intVar=20,x;
2507x= ++intVar,intVar++,++intVar; printf("Value of intVar=%d, x=%d",intVar,x);
2508}
2509Find the output
2510     1.
2511Value of intVar=23, x=21 2.
2512Value of intVar=23, x=23 3.
2513Value of intVar=21, x=21 4.ERROR
2514    1.0
2515 
2516   S.NO.
2517  Questions
2518    Choices
2519   Answers
2520    263
2521#include <stdio.h> void main()
2522{
2523int tally; for(tally=0;tally<10;++tally) {
2524printf("#"); if(tally>6)
2525continue; printf("%d",tally);
2526} }
2527Find the output
2528  1.
2529#0#1#2#3#4#5#6###
25302. #0#1#2#3#4#5#6#7#8#9#10 3. #0#1#2#3#4#5##7#8#9#10 4.
2531#0#1#2#3#4#5#
2532   1.0
2533     264
2534  #include <stdio.h> void main(){
2535unsigned char c=290;
2536printf("%d",c); }
2537Find the output
2538    1.
253934
25402.
2541290
25423.
2543Garbage value 4.
2544Error
2545     1.0
2546     265
2547  #include <stdio.h>
2548void main()
2549{
2550char cnt=0; for(;cnt++;printf("%d",cnt)) ; printf("%d",cnt);
2551}
2552Find the output
2553    1.
25540 1 2 ... infinity 2.
25551 2 2 ... 127
25563.
25570
25584.
25591
2560     4.0
2561   266
2562   #include <stdio.h< #include <string.h>
2563int main() {
2564char str[]; strcpy(str,"Hello"); printf("%s",str); return 0;
2565}
2566Find the output
2567      1.
2568Hello
25692.
2570Error
25713.
2572NULL
25734.
2574NO OUTPUT
2575     2.0
2576    267
2577#include
2578#define SUM(x,y) int main()
2579{
2580SUM(10,20);
2581return 0; }
2582Find the output
2583int s; s=x+y; printf("sum=%d\n",s);
2584  1. sum=30 2. 10,20 3.
2585Error
25864. sum=0
2587   1.0
2588   268
2589  #include int main() {
2590char ch=10;
2591void *ptr=&ch; printf("%d,%d",*(char*)ptr,++(*(char*)ptr)); return 0;
2592}
2593Find the output
2594     1.
259511, 11 2.
259610, 11 3. Error 4.
259710, 10
2598    1.0
2599 
2600   S.NO.
2601  Questions
2602    Choices
2603   Answers
2604    269
2605#include int main() {
2606char *str []={"AAAAA","BBBBB","CCCCC","DDDDD"}; char **sptr []={str+3,str+2,str+1,str};
2607char ***pp;
2608pp=sptr;
2609++pp; printf("%s",**++pp+2); return 0;
2610}
2611Find the output
2612  1. BBBBB 2. CCCCC 3.
2613BBB
26144.
2615Error
2616   3.0
2617   270
2618   #include int main() {
2619int a=10,b=2;
2620int *pa=&a,*pb=&b; printf("value = %d", *pa/*pb); return 0;
2621}
2622Find the output
2623      1.
26245
26252.
26265.0
26273. ERROR 4.
2628No output
2629     1.0
2630    271
2631#include
2632void fun(int *ptr) {
2633*ptr=100; }
2634int main() {
2635int num=50;
2636int *pp=#
2637fun(& *pp); printf("%d,%d",num,*pp); return 0;
2638}
2639Find the output
2640  1.
2641100,100
26422.
264350,50
26443.
264550,100
26464.
2647Error in function calling
2648   3.0
2649   272
2650   #include
2651#define FUN(x) x*x int main()
2652{
2653int val=0; val=128/FUN(8); printf("val=%d",val); return 0;
2654}
2655Find the output
2656      1.
26572
26582. 12864 3.
265940 4. 1
2660     2.0
2661    273
2662#include
2663int main ()
2664{
2665static int a[]={10, 20, 30 40, 50};
2666static int *p[]= {a, a+3, a+4, a+1, a+2}; int **ptr=p;
2667ptr++;
2668printf ("%d%d", ptr p, **ptr);
2669}
2670The output of the program is __________
2671  1. 43 2. 140 3. 89 4. 78
2672   2.0
2673   274
2674  #include <stdio.h> #define TRUE 1 int main()
2675{
2676switch(TRUE) {
2677printf("Hello"); }
2678}
2679Find the output
2680     1.
2681Hello
26822. ERROR 3.
2683No output 4. Garbage
2684    3.0
2685 
2686   S.NO.
2687  Questions
2688    Choices
2689   Answers
2690    275
2691#include <stdio.h> enum numbers
2692{
2693zero, one, two, three , four=3,five,six,seven=0,eight };
2694void main() {
2695printf("%d,%d,%d,%d,%d,%d,%d,%d,%d",zero,one,two,three,four,five,six,seven,eight); }
2696What will be the output.
2697  1.
26980, 1, 2, 3, 3, 4, 5, 0, 1 2.
26990, 1, 2,3,3,1,2,3,4
27003.
27010,1,2,3,3,1,2,3,4
27024.
27030, 1, 2, 3, 3, 4, 5, 0, 9
2704   1.0
2705   276
2706   #include <stdio.h> int main(){
2707char val=250;
2708int ans;
2709ans= val+ !val + ~val + ++val; printf("%d",ans);
2710return 0;
2711}
2712Find the output.
2713      1. -5 2. -6 3. 0 4. 6
2714     2.0
2715    277
2716#include <stdio.h> int main()
2717{
2718float a,b;
2719a=3.0f;
2720b=4.0f; printf("%.0f,%.1f,%.2f",a/b,a/b,a/b); return 0;
2721}
2722Find the output.
2723  1.
27241, 0.8, 0.75
27252.
27260, 0.7, 0.75
27273.
27280, 0.8, 0.75
27294.
2730Error: Invalid format Specifier
2731   3.0
2732     278
2733  #include <stdio.h> int main(){
2734float a;
2735(int)a= 10;
2736printf("value of a=%d",a); return 0;
2737}
2738Find the output
2739    1.
2740value of a=10
27412.
2742value of a=10.000000 3.
2743value of a=0
27444.
2745L-Value required
2746     4.0
2747     279
2748  #include <stdio.h> int main()
2749{
2750int i=-1,j=-1,k=0,l=2,m; m=i++&&j++&&k++||l++; printf("%d %d %d %d %d",i,j,k,l,m); return 0;
2751}
2752Find the output
2753    1. 00121 2. 00132 3. 00131 4. 01131
2754     3.0
2755   280
2756  #include <stdio.h> int main()
2757{
2758int intVar=24;
2759static int x=intVar; printf("%d,%d",intVar,x); return 0;
2760}
2761Find the output of this program, (program name is: static_ec.c)
2762     1.
276324, 24
27642.
276524, 0
27663.
2767Error: Illegal Initialization 4.
2768Run time error
2769    3.0
2770 
2771   S.NO.
2772  Questions
2773    Choices
2774   Answers
2775   281
2776 #include <stdio.h> int main()
2777{
2778int ok=-100; -100; printf("%d",ok); return 0;
2779}
2780Find the output.
2781    1.
27820
27832. -100 3. 100 4. Error
2784    2.0
2785   282
2786 #include <stdio.h> int main()
2787{
2788int var;
2789var=- -10;
2790printf("value of var= %d\n",var); var=+ +10;
2791printf("value of var= %d\n",var); return 0;
2792}
2793Find the output
2794    1.
2795ERROR
27962.
2797value of var= -10 value of var= 10 3.
2798value of var= 10 value of var= 10 4.
2799value of var= 10 value of var= 11
2800    3.0
2801    283
2802#include <stdio.h> int main(){
2803int x;
2804x=100,30,50; printf("x=%d\n",x); x=(100,30,50); printf("x=%d\n",x); return 0;
2805}
2806Find the output
2807  1. x=100 x=100 2. x=100 x=50 3. x=50 x=50 4. x=50 x=100
2808   2.0
2809     284
2810  #include <stdio.h> void main()
2811{
2812int a=10; switch(a){
2813case 5+5: printf("Hello\n");
2814default: printf("OK\n");
2815} }
2816Find the output
2817    1. Hello 2. OK 3. Hello OK 4. Error
2818     3.0
2819   285
2820  #include <stdio.h> void main()
2821{
2822unsigned short var='B';
2823var+=2;
2824var++;
2825printf("var : %c , %d ", var,var);
2826}
2827Find the output
2828     1.
2829var : E, 69 2.
2830var : E, 68 3.
2831var : D, 69 4.
2832var : D, 68
2833    1.0
2834 
2835   S.NO.
2836  Questions
2837    Choices
2838   Answers
2839    286
2840#include <stdio.h> void main()
2841{
2842int a=2; switch(a/2*1.5) {
2843case 1: printf("One..."); break;
2844case 2: printf("Two..."); break;
2845default: printf("Other..."); break;
2846} }
2847Find the output
2848  1. One... 2. Two... 3. Other... 4. Error
2849   4.0
2850     287
2851  #include <stdio.h> void main()
2852{
2853short a=2; switch(a) {
2854case 1L: printf("One\n"); break;
2855case 2L: printf("Two\n"); break;
2856default: printf("Else\n"); break;
2857} }
2858Find the output
2859    1. One 2. Two 3. Else 4. Error
2860     2.0
2861     288
2862  #include <stdio.h> void main()
2863{
2864short day=2; switch(day) {
2865case 2: || case 22: printf("%d nd",day);
2866break; default:
2867printf("%d th",day); break;
2868} }
2869Find the output
2870    1.
28712 nd 2.
287222 nd 3. Error 4.
28732 nd 22 nd
2874     3.0
2875   289
2876   #include <stdio.h> int main(){
2877int a,b,c;
2878a=0x10; b=010;
2879c=a+b;
2880printf("\nAddition is= %d",c); return 0;
2881}
2882Find the output.
2883      1.
2884Addition is = 20
28852.
2886Addition is = 24
28873.
2888Addition is = Garbage 4.
2889Error
2890     2.0
2891   290
2892#include <stdio.h> void main()
2893{
2894int x;
2895x= (printf("AA")||printf("BB")); printf("%d",x);
2896printf("\n");
2897x= (printf("AA")&&printf("BB"));
2898printf("%d",x); }
2899Find the output
2900   1. AABB1 AABB1 2.
29011
29021
29033. AABB1 AA1
29044.
2905AA1 AABB1
2906   4.0
2907 
2908   S.NO.
2909  Questions
2910    Choices
2911   Answers
2912    291
2913$a = array( null => 'a', true => 'b', false => 'c', 0 => 'd', 1 => 'e', '' => 'f' ); echo count($a), "\n"; What will be printed?
2914  1.2 2.3 3.4 4.5
2915   2.0
2916   292
2917   $a = array(); if ($a[1]) null; echo count($a), "\n"; What will be printed?
2918     1.0 2.1 3.2 4.Code wont work
2919    1.0
2920    293
2921What is the most common approach for the development of application system now?
2922  1.
2923Incremental development 2.
2924Agile
29253.
2926Waterfall
29274.
2928None of the options
2929   1.0
2930     294
2931  ........ data type can store unstructured data
2932    1.
2933RAW
29342.
2935CHAR
29363. NUMERIC 4.
2937V ARCHAR
2938     1.0
2939   295
2940   A wireless network interface controller can work in
2941      1.
2942infrastructure mode
29432.
2944ad-hoc mode
29453.
2946both infrastructure and ad-hoc mode 4.
2947none
2948     3.0
2949    296
2950Consider the code snippet given below
2951var count = [1,,3];
2952What is the observation made?
2953  1.
2954The omitted value takes “undefined”
29552.
2956This results in an error
29573.
2958This results in an exception
29594.
2960Can't predict
2961   1.0
2962   297
2963  Consider the following javascript statements
2964x = ~-y;
2965w = x = y = z;
2966q = a?b:c?d:e?f:g;
2967The above code snippet is equivalent to:
2968     1.
2969x = ~(-y); w = (x = (y q = a?b:(c?d:(e?f:g));
29702.
2971x = a?b:(c?d:(e?f:g)); q = ~(-y); w = (x = (y
29723.
2973= z));
2974= z));
2975x = (x = (y = z));w = ~(-y); q = a?b:(c?d:(e?f:g));
29764.
2977x = ~(-y); w = (x = (y = z)); q = (c?d:(e?f:g));
2978    4.0
2979 
2980   S.NO.
2981  Questions
2982    Choices
2983   Answers
2984   298
2985 Consider the following statements
2986var text = "testing: 1, 2, 3"; // Sample text
2987var pattern = /\d+/g // Matches all instances of one or more digits
2988In order to check if the pattern matches with the string “text”, the statement is
2989    1.
2990text==pattern
29912. text.equals(pattern) 3.
2992text.test(pattern)
29934.
2994pattern.test(text)
2995    4.0
2996    299
2997------ is the minimal super key
2998  1.
2999Partial Key
30002.
3001Candidate Key 3.
3002Surrogate Key 4.
3003Unique Key
3004   2.0
3005   300
3006   ----------- is a built - in JavaScript function which can be used to execute another function after a given time interval.
3007     1.Timeout( ) 2.TimeInterval( ) 3.setTimeout ( ) 4.All of the above
3008    3.0
3009    301
3010.......... command can be used to modify a column in a table
3011  1. alter 2. update 3.
3012set
30134. create
3014   1.0
3015     302
3016  ...................... is preferred method for enforcing data integrity
3017    1.
3018Constraints
30192.
3020Stored Procedure 3.
3021Triggers
30224.
3023Cursors
3024     1.0
3025     303
3026  66.6% risk is considered as
3027    1.
3028very low 2.
3029low
30303. moderate 4.
3031high
3032     4.0
3033   304
3034  8086 microprocessor is interfaced to 8253 a programmable interval timer. The maximum number by which the clock frequency on one of the timers is divided by
3035    1.216 2.28 3.210 4.220
3036   1.0
3037 
3038   S.NO.
3039  Questions
3040    Choices
3041   Answers
3042    305
3043Which activity most easily lends itself to incremental design?
3044  1.
3045User Interfaces
30462.
3047Web Services
30483.
3049Enterprise resource planning 4.
3050Embedded Sofftware
3051   3.0
3052   1. 306
3053   Graphical representation of the project, showing each task and activity as horizontal bar whose length is proportion to time taken for a completion of that activity is called
3054      1.Gantt Chart 2. Structure Chart 3.
3055Pert Chart
30564.
3057Time Line
3058     1.0
3059    3017.
3060Software deteriorates rather than wears out because
3061  1.
3062Software suffers from exposure to hostile environments
30632.
3064Defects are more likely to arise after software has been used often
30653.
3066Multiple change requests introduce errors in component interactions
30674.
3068Software spare parts become harder to order
3069   3.0
3070   3018.
3071   The 40-20-40 rule suggests that the least amount of development effort can be spent on
3072      1.Estimation and planning 2. Analysis and design
30733.
3074Coding
30754.
3076T esting
3077     3.0
3078    3019.
3079The prototyping model of software development is
3080  1.
3081A reasonable approach when requirements are well defined
30822.
3083A Useful approach when a customer cannot define requirements clearly
30843.
3085The best approach to use projects with larger development teams
30864.
3087A risky model that rarely produces a meaningful product
3088   2.0
3089   310
3090  In reuse-oriented software engineering the last stage is _________.
3091     1.
3092component analysis
30932.
3094requirements modification
30953.
3096system validation
30974.
3098system design
3099    3.0
3100 
3101   S.NO.
3102  Questions
3103    Choices
3104   Answers
3105   311
3106 Which of the following is not a part/product of requirements engineering?
3107    1.
3108Feasibility study
31092.
3110Requirements validation
31113.
3112System models
31134.
3114Architectural design
3115   4.0
3116  3112. Software Specification is the process where
3117       1. 2. 3. 4.
3118you decide what software you will use to program
3119you develop a prototype and show it to the client
3120You find out what services are required from the system
3121none
3122     3.0
3123    3113. What is an advantage of incremental delivery?
3124  1.
31252.
31263.
31274.
3128everything is coded at once, so the customer receives the full product
3129replacement systems are easily developed with full features that clients expected from the old system
3130Customers can use prototypes and gain experience that informs their requirements for later systems
3131none of the mentioned
3132   3.0
3133     3114. This is a software development process model
3134       1.waterfall model 2. Incremental model
31353.
3136Boehm's Spiral model 4.
3137all
3138     4.0
3139    315
31401. What is the type of software design that defines interfaces between system
3141components?
3142    1. 2. 3. 4.
3143architectural design
3144Interface Design
3145component Design
3146database design
3147    2.0
3148    316
3149The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer a file of 29,154 kilobytes from disk to main memory. The memory is byte addressable. The minimum number of times the DMA controller needs to get the control of the system bus from the processor to transfer the file from the disk to main memory is
3150   1. 454
31512. 455 3. 456 4. 457
3152   3.0
3153 
3154   S.NO.
3155  Questions
3156    Choices
3157   Answers
3158    317
3159For which of the following flip-flop the output clearly defined for all combinations of two inputs?
3160  1.
3161D type flip-flop
31622.
3163R S type flip-flop
31643.
3165J K flip-flop 4.
3166T flip-flop
3167   3.0
3168     318
3169  In excitation table of D flipflop next state is equal to
3170    1.
3171Next State
31722.
3173Present State 3.
3174Previous State
31754.
3176D State
3177     4.0
3178   319
3179   A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is 24 megabytes, the length of the virtual address supported by the system is _________ bits.
3180      1. 33 2. 35 3. 34 4. 36
3181     4.0
3182    320
3183A graphical display of the fundamental products in a truth-table is known as
3184  1. Mapping
31852.
3186Graphing
31873.
3188T-map
31894. Karnaugh-Map
3190   4.0
3191   321
3192  A processor can support a maximum memory of 4 GB, where the memory is word-addressable (a word consists of two bytes). The size of the address bus of the processor is at least __________ bits
3193     1. 30 2. 31 3. 32 4. 33
3194    2.0
3195 
3196   S.NO.
3197  Questions
3198    Choices
3199   Answers
3200    322
3201A Stack-organized Computer uses instruction of
3202  1.
3203Indirect addressing
32042. Two-addressing 3.
3205Zero addressing 4.
3206Index addressing
3207   3.0
3208     323
3209  A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is
3210    1. 19 2. 20 3. 21 4. 22
3211     2.0
3212   324
3213   A circuit that converts n inputs to 2^n outputs is called
3214      1.
3215Encoder
32162.
3217Decoder
32183.
3219Comparator
32204.
3221Carry Look Ahead
3222     1.0
3223   325
3224 A Program Counter contains a number 825 and address part of the instruction contains the number 24. The effective address in the relative address mode, when an instruction is read from the memory is
3225    1. 849
32262. 850
32273. 801 4. 802
3228    2.0
3229   326
3230Buffering is useful because
3231   1.
3232It makes it seem like there’s more memory in the computer
32332.
3234It reduces the number of memory copies required
32353.
3236It allows all device drivers to use the same code
32374.
3238It allows devices and thee CPU to operate asynchronously
3239   4.0
3240 
3241   S.NO.
3242  Questions
3243    Choices
3244   Answers
3245   327
3246 Consider a 6-stage instruction pipeline, where all stages are perfectly balanced.Assume that there is no cycle-time overhead of pipelining. When an application is executing on this 6-stage pipeline, the speedup achieved with respect to non-pipelined execution if 25% of the instructions incur 2 pipeline stall cycles is
3247    1. 1 2. 2 3. 4 4.5
3248    3.0
3249    328
3250Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R))
3251  1.
3252Relation r(R) is in the outer loop.
32532.
3254Relation s(S) is in the outer loop.
32553.
3256Join selection factor between r(R) and s(S) is more than 0.5 4.
3257Join selection factor between r(R) and s(S) is less than 0.5.
3258   1.0
3259     329
3260  Consider a main memory system that consists of 8 memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for 100 nanoseconds (ns) by the data, address, and control signals. During the same 100 ns, and for 500 ns thereafter,
3261the addressed memory module executes one cycle accepting and storing the data. The (internal) operation of different memory modules may overlap in time, but only one request can be on the bus at any time. The maximum number of stores (of one word each) that can be initiated in 1 millisecond is
3262    1. 5535
32632. 65335 3. 53892 4. 10000
3264     4.0
3265   330
3266   Consider two processors P1 and P2 executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P2 takes 25% less time but incurs 20% more CPI (clock cycles per instruction) as compared to the program running on P1 If the clock frequency of P1 is 1GHz, then the clock frequency of P2 (in GHz) is
3267      1. 1.5 2. 1.6 3. 1.7 4. 1.8
3268     2.0
3269   331
3270Content of the program counter is added to the address part of the instruction in order to obtain the effective address is called
3271   1.
3272relative address mode.
32732.
3274index addressing mode. 3.
3275register mode
32764.
3277implied mode
3278   1.0
3279 
3280   S.NO.
3281  Questions
3282    Choices
3283   Answers
3284    332
3285How many address bits are needed to select all memory locations in the 16K × 1 RAM?
3286  1. 8 2. 10 3. 14 4. 16
3287   3.0
3288   333
3289   If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?
3290      1.
3291Width of tag comparator
32922.
3293Width of set index decoder
32943.
3295Width of way selection multiplexer
32964.
3297Width of processor to main memory data bus
3298     4.0
3299   334
3300 If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative mapping. Then each word of cache memory shall be_____.
3301    1.
330211 bits
33032.
330421 bits
33053.
330616 bits 4.
330720 bits
3308    3.0
3309    335
3310If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the service provided is for
3311  1.
3312interrupt of lower priority
33132.
3314interrupt of higher priority 3.
3315both the interrupts
33164.
3317none of the mentioned
3318   2.0
3319   336
3320  Minterms are arranged in map in a sequence of
3321     1.
3322binary sequence
33232.
3324gray code
33253.
3326binary variables 4.
3327BCD code
3328    2.0
3329 
3330   S.NO.
3331  Questions
3332    Choices
3333   Answers
3334   337
3335 Register renaming is done is pipelined processors
3336    1.
3337As an alternative to register allocation at compile time
33382.
3339For efficient access to function parameters and local variables 3.
3340To handle certain kinds of hazards
33414.
3342As part of address translation
3343    3.0
3344    338
3345Simplified form of the boolean expression (X + Y + XY) (X + Z) is
3346  1. X+Y+Z 2.
3347XY + YZ
33483.
3349X + YZ
33504.
3351XZ + Y
3352   3.0
3353   339
3354   The 16-bit 2’s complement representation of an integer is 1111 1111 1111 0101, its decimal representation is
3355      1. 1 2. 2 3. 3 4. -11
3356     4.0
3357   340
3358 The addressing mode used in an instruction of the form ADD R1, R2 is _____.
3359    1. Absolute 2. Indirect 3.
3360Index
33614. Register
3362    3.0
3363   341
3364The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of 4 K × 16?
3365   1.
336610 address, 16 data lines
33672.
336811 address, 8 data lines 3.
336912 address, 12 data lines 4.
337012 address, 16 data lines
3371   4.0
3372 
3373   S.NO.
3374  Questions
3375    Choices
3376   Answers
3377    342
3378The data-in register of I/O port is
3379  1.
3380read by host to get input
33812.
3382read by controller to get input
33833.
3384written by host to send output
33854.
3386written by host to start a command
3387   1.0
3388   343
3389   The Firmware are stored in read-only memory or ________ chips.
3390      1.
3391Flash memory
33922.
3393Dynamic random access memory 3.
3394EEPROM
33954.
3396Random-access memory
3397     3.0
3398   344
3399 The performance of cache memory is frequently measured in terms of a quantity called
3400    1.
3401hit ratio
34022.
3403miss ratio
34043.
3405average ratio 4.
3406ratio
3407    1.0
3408    345
3409The smallest integer than can be represented by an 8-bit number in 2?s complement form is
3410  1. -256
34112. -128 3. -127
34124. 1
3413   2.0
3414   346
3415  The main difference between JK and RS flip-flop is that
3416     1.
3417JK flip flop needs a clock pulse
34182.
3419There is a feedback in JK flip-flop
34203.
3421JK flip-flop accepts both inputs as 1
34224.
3423JK flip-flop is acronym of Junction cathode multi-vibrator
3424    3.0
3425 
3426   S.NO.
3427  Questions
3428    Choices
3429   Answers
3430    347
3431The rate at which a computer clock deviates from a perfect reference clock is called as
3432  1.
3433Clock rate
34342.
3435Clock speed
34363.
3437clock drift rate
34384.
3439Transmission Bandwidth
3440   3.0
3441   348
3442   The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8- way set associative cache is ______ bits
3443      1. 21 2.22
34443. 23 4. 24
3445     4.0
3446   349
3447 To build a mod-19 counter the number of flip-flops required is
3448    1. 3 2. 5 3. 7 4. 9
3449    2.0
3450    350
3451Using 10's complement 72532- 3250 is
3452  1. 69282
34532. 69272
34543. 69252
34554. 69232
3456   1.0
3457   351
3458  What is the main difference between traps and interrupts?
3459     1.
3460How they are initiated
34612.
3462The kind of code that’s used to handle them 3.
3463Whether or not the scheduler is called
34644.
3465How the operating system returns from them
3466    1.0
3467 
3468   S.NO.
3469  Questions
3470    Choices
3471   Answers
3472   352
3473 When an instruction is read from the memory, it is called
3474    1.
3475Memory Read cycle 2.
3476Fetch cycle
34773.
3478Instruction cycle
34794.
3480Memory write cycle
3481    3.0
3482    353
3483Which amongst the following refers to Absolute addressing mode
3484  1.
3485move R1, R2
34862.
3487move LOC1, LOC2
34883.
3489move LOC1, R2 4.
3490move LOC2, R1
3491   1.0
3492   354
3493   Which level of RAID refers to disk mirroring with block striping?
3494      1.
3495RAID level 1 2.
3496RAID level 2 3.
3497RAID level 0 4.
3498RAID level 3
3499     1.0
3500    355
3501Which of the following logic expression is incorrect?
3502  1. 1⊕0=1
35032.
35041 ⊕ 1 ⊕ 0 =1
35053. 1⊕1⊕1=1 4.
35061⊕1=0
3507   2.0
3508   356
3509  Which of the following paging algorithms is most likely to be used in a virtual memory system?
3510     1. FIFO
35112.
3512Second chance
35133.
3514Least Recently Used 4.
3515Least Frequently Used
3516    3.0
3517 
3518   S.NO.
3519  Questions
3520    Choices
3521   Answers
3522    357
3523Which one of the following connects high-speed high-bandwidth device to memory subsystem and CPU.
3524  1.
3525expansion bus
35262.
3527PCI bus
35283.
3529SCSI bus
35304.
3531none of the mentioned
3532   1.0
3533     358
3534  Which one of these is characteristic of RAID 5?
3535    1.
3536Distributed parity 2.
3537No Parity
35383.
3539All parity in a single disk 4.
3540Double Parity
3541     1.0
3542   359
3543   Which two RAID types use parity for data protection?
3544      1.
3545RAID 1
35462.
3547RAID 4
35483.
3549RAID 1+0 4.
3550RAID 5
3551     4.0
3552    360
3553X=1010100 and Y=1000011 using 1's complement Y-X is
3554  1. -10111 2. -10011
35553. -10001 4. -11001
3556   3.0
3557   361
3558  The minimum number of NAND gates required to implement the Boolean function. A + AB' + AB'C is equal to
3559     1. Zero 2.
35601
35613.
35624
35634.
35647
3565    1.0
3566 
3567   S.NO.
3568  Questions
3569    Choices
3570   Answers
3571    362
3572Which of the following boolean expressions is not logically equivalent to all of the rest ?
3573  1.
3574ab + (cd)' + cd + bd' 2.
3575a (b + c) + cd
35763.
3577ab + ac + (cd)'
35784.
3579bd' + c'd' + ab + cd
3580   3.0
3581     363
3582  Which of the following unit will choose to transform decimal number to binary code ?
3583    1.
3584Encoder
35852.
3586Decoder
35873. Multiplexer 4.
3588Counter
3589     1.0
3590   364
3591   If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?
3592     1.Width of tag comparator
35932.Width of set index decoder
35943.Width of way selection multiplexer
35954.Width of processor to main memory data bus
3596    4.0
3597    365
3598 The correspondence between the main memory blocks and those in the cache is given by
3599  1.
3600Hash function
36012.
3602Mapping function
36033.
3604Locale function
36054.
3606Assign function
3607       2.0
3608   366
3609   The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage (with delay 800 picoseconds) is replaced with a functionally equivalent design involving two stages with respective delays 600 and 350 picoseconds. The throughput increase of the pipeline is __________ percent.
3610      1. 33 2. 34 3. 35 4. 32
3611     1.0
3612   367
3613What is the software that runs a computer, including scheduling tasks, managing storage, and handling communication with peripherals?
3614   1.
3615driver
36162.
3617application suitex 3.
3618operating system
36194.
3620bluetooth technology
3621   3.0
3622 
3623   S.NO.
3624  Questions
3625    Choices
3626   Answers
3627   368
3628 For an undirected graph with n vertices and e edges, the sum of the degree of each vertex isequal to
3629    1.2n 2.
3630(2n-1)/2 3.2e
36314. pow(e,2)/2
3632   3.0
3633    369
3634 Which attribute is used to extend the lifetime of a cookie?
3635  1. higher-age 2. increase-age 3.
3636max-age
36374.
3638lifetime
3639   3.0
3640     370
3641  <h2 style="color:blue">I am Blue</h2> is ____ way of styling HTML elements
3642    1.
3643Internal Style 2.
3644Inline Style
36453.
3646External Style 4.
3647Default
3648     2.0
3649     371
3650  ____________ is referred to as Static Web
3651    1.
3652Web 1.0 2.
3653Web 2.0 3.
3654Web 3.0 4.
3655Web 4.0
3656     1.0
3657     372
3658  A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:
3659    1.
366010, 8, 7, 3, 2, 1, 5 2.
366110, 8, 7, 2, 3, 1, 5 3.
366210, 8, 7, 1, 2, 3, 5 4.
366310, 8, 7, 5, 3, 2, 1
3664     1.0
3665   373
3666  A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as
3667     1.
3668full binary tree 2.
3669AVL tree 3.
3670threaded tree 4.
3671complete binary tree
3672    1.0
3673 
3674   S.NO.
3675  Questions
3676    Choices
3677   Answers
3678   374
3679 A binary tree T has 20 leaves. The number of nodes in T having two children is
3680    1. 34 2. 99 3. 7 4. 19
3681    4.0
3682   375
3683 A process executes the code fork ();
3684fork ();
3685fork ();
3686The total number of child processes created is
3687    1. 3 2. 4 3. 7 4. 8
3688    3.0
3689    376
3690A Search engine can serve as
3691  1.
3692both as a server and a client
36932.
3694As Client always
36953.
3696As Server always
36974.
3698Neither client nor server
3699   1.0
3700     377
3701  An object of class A receives a message with an argument that is an instance of class B. Identify the type of relationship between class A and Class B:
3702    1. Generalization 2.
3703Association
37043. Aggregation 4.
3705Realization
3706     1.0
3707     378
3708  Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 = i = 12, 1 = j = 12}. There is an edge between (a, b) and (c, d) if |a - c| = 1 and |b - d| = 1. The number of edges in this graph is
3709    1. 505 2. 506 3. 507 4. 508
3710     2.0
3711   379
3712  Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1⁄2. What is the expected number of unordered cycles of length three?
3713     1.
37141/8 2.
37151 3. 7 4. 8
3716    3.0
3717 
3718   S.NO.
3719  Questions
3720    Choices
3721   Answers
3722    380
3723Consider the C function given below. int f(int j)
3724{
3725static int i = 50;
3726int k;
3727if (i == j)
3728{
3729printf("something");
3730k = f(i);
3731return 0;
3732}
3733else return 0;
3734}
3735Which one of the following is TRUE?
3736  1.
3737The function returns 0 for all values of j.
37382.
3739The function prints the string something for all values of j.
37403.
3741The function returns 0 when j = 50.
37424.
3743The function will exhaust the runtime stack or run into an infinite loop when j = 50.
3744   4.0
3745     381
3746  Consider the following function written the C programming language. void foo (char * a ) {
3747if (* a & & * a ! =' ' ){
3748putchar (*a);
3749}
3750}
3751}
3752The output of the above function on input 'ABCD EFGH' is
3753    1.
3754ABCD EFGH
37552. ABCD
37563.
3757HGFE DCBA
37584. DCBA
3759     1.0
3760     382
3761  Consider the following New-order strategy for traversing a binary tree: 1)Visit the root;
37622)Visit the right subtree using New-order;
37633)Visit the left subtree using New-order;
3764The New-order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 - 2 ? 6 7 * 1 + - is given by:
3765    1. +-167*2?5-34* 2. .-+1*67?2-5*34 3. -+1*76?2-5*43 4. .176*+2543*-?-
3766     3.0
3767     383
3768  Consider the following program: int f(int *p, int n)
3769{
3770if (n <= 1) return 0;
3771else return max ( f (p+1, n-1),p[0]-p[1]); }
3772int main()
3773{
3774int a[] = {3,5,2,6,4};
3775printf("%d", f(a,5));
3776}
3777The value printed by this program is
3778    1. 2 2. 1 3. 3 4. 4
3779     3.0
3780   384
3781  Consider the following recursive C function. Void get (int n)
3782{if (n<1) return;
3783get (n-1)
3784get (n-3) ;
3785printf ("%d",n);
3786If get(6) function is being called in main () then how many times will the get() function be invoked before returning to the main ( ) ?
3787     1. 15 2. 25 3. 43 4. 24
3788    2.0
3789 
3790   S.NO.
3791  Questions
3792    Choices
3793   Answers
3794    385
3795Consider the function func shown below: int func(int num) {
3796int count = 0;
3797while (num) {
3798count++;
3799num>>= 1;
3800}
3801return (count);
3802}
3803The value returned by func(435)is
3804  1. 7 2. 8 3. 9 4. 0
3805   3.0
3806   386
3807   For the array (77 ,62,114,80,9,30,99), write the order of the elements after two passes using the Radix sort
3808      1.
380980 30 62 114 77 9 99
38102.
3811114 30 62 77 9 99 3.
38129 114 30 62 77 80 99 4.
38139 30 62 77 80 99 114
3814     2.0
3815    387
3816How can you make a list that lists the items with numbers?
3817  1. <list> 2. <ol> 3. <dl> 4. <ul>
3818   2.0
3819   388
3820   How do you write "Hello World" in PHP?
3821      1.
3822using System.out.println 2.
3823using Document.Write("Hello World") 3.
3824"Hello World"
38254.
3826using echo("Hello World")
3827     4.0
3828    389
3829HTTP is implemented over
3830  1. UDP 2. TCP 3. SMTP 4. POP
3831   2.0
3832   390
3833  If every node u in G adjacent to every other node v in G, A graph is said to be
3834     1.
3835isolated 2.
3836complete 3.
3837finite 4.
3838strongly connected
3839    2.0
3840 
3841   S.NO.
3842  Questions
3843    Choices
3844   Answers
3845   391
3846 In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
3847    1.
3848A tree has no bridges 2.
3849A bridge cannot be part of a simple cycle 3.
3850Every edge of a clique with size 3 is a bridge (A clique is any compete sub graph of a graph)
38514.
3852A graph with bridges cannot have a cycle
3853    4.0
3854   392
3855 In HTTP, which method gets the resource as specified in the URI
3856    1.
3857GET
38582. POST 3.
3859PUT
38604. TRACE
3861    3.0
3862    393
3863  Java package is a grouping mechanism with the purpose of
38641.
3865Providing the library for the Java program
38662.
3867Controlling the visibility of the classes, interfaces and methods
38683.
3869Replacing header file used in C/C++
38704.
3871An application framework 1.
3872full: (REAR+1) mod n==FRONT empty: REAR ==FRONT
38732.
3874(REAR) mod n==FRONT empty: REAR ==FRONT
38753.
3876(REAR+1) mod n==Rear empty: REAR ==FRONT 4.
3877full: (FRONT+1) mod n==FRONT empty: REAR ==FRONT
3878     2.0
3879     394
3880    Suppose a circular queue of capacity (n ? 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
3881     1.0
3882     395
3883  The following function computes the maximum value contained in an integer array p[ ] of size n (n >= 1).
3884int max(int *p, int n) {
3885int a=0, b=n-1;
3886while (__________) {
3887if (p[a] <= p[b]) { a = a+1; } else { b = b-1; }
3888}
3889return p[a];
3890}
3891The missing loop condition is
3892    1.
3893a != n
38942.
3895b != 0
38963.
3897b > (a+1) 4.
3898b != a
3899     4.0
3900   396
3901  The following HTML element helps making animated text
3902     1.
3903<em>
39042.
3905<ins>
39063.
3907<mark>
39084. <marquee>
3909    4.0
3910 
3911   S.NO.
3912  Questions
3913    Choices
3914   Answers
3915    397
3916The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty binary search tree, such that the resulting tree has height 6, is
3917  1. 63 2. 64 3. 65 4. 66
3918   2.0
3919   398
3920   The purpose of a TLB is
3921      1.
3922To cache page translation information
39232.
3924To cache frequently used data 3.
3925To hold register values while a process is waiting to be run 4.
3926To hold the start and length of the page table
3927     2.0
3928   399
3929 The following HTML element is used to display horizontal line
3930    1. <br> 2. <h> 3. <hr> 4. <h2>
3931    3.0
3932    400
3933To prevent any method from overriding, the method has to declared as,
3934  1. static
39352. const
39363.
3937final 4.
3938extends
3939   3.0
3940     401
3941  Use of ________ allows for some processes to be waiting on I/O while another process executes.
3942    1. multiprogramming 2.
3943multiuser interfacing 3.
3944Random scheduling 4.
3945Variable cpu cycles
3946     1.0
3947   402
3948  What are the parameters of the service method?
3949     1.
3950ServletRequest and ServletResponse 2.
3951HttpServletRequest and HttpServletResponse
39523.
3953HttRequest and HttpResponse 4.
3954Request and Response
3955    2.0
3956 
3957   S.NO.
3958  Questions
3959    Choices
3960   Answers
3961   403
3962 What does JSP stand for?
3963    1.
3964Java Scripting Pages 2.
3965Java Service Pages 3.
3966Java Server Pages
39674.
3968Java Script Program
3969    3.0
3970    404
3971What does the following bit of JavaScript print out? var a = [1,,3,4,5];
3972console.log([a[4], a[1], a[5]]);
3973  1.
39745, undefined,undefined
39752. 5,3,undefined
39763. 5,0,undefined
39774. 5,null,undefined
3978   1.0
3979     405
3980  What is cell padding?
3981    1.
3982Used to separate cell walls from their contents
39832.
3984Used to set space between cells
39853.
3986Used to provide width to a cell
39874.
3988Used to merge two cells
3989     2.0
3990   406
3991   What is the correct HTML for making a text input field?
3992      1.
3993<input type="text">
39942.
3995<textfield> 3.
3996<input type="textfield"> 4.
3997<textinput type="text">
3998     1.0
3999   407
4000What will be printed as the output of the following program? public class testincr
4001{
4002public static void main(String args[])
4003{
4004int i = 0;
4005i = i++ + i; System.out.println(" I = " +i); }
4006}
4007   1. I=0 2. I=1 3. I=2 4. I=3
4008   2.0
4009 
4010   S.NO.
4011  Questions
4012    Choices
4013   Answers
4014    408
4015Which method is used to get the year of a date object in YYYY format in Javascript.
4016  1.
4017getY ear()
40182. getYYYY() 3.
4019getFullY ear() 4.
4020get4Y ear()
4021   1.0
4022   409
4023   Which of the following input controls that cannot be placed using <input> tag?
4024      1.
4025Text
40262. Password 3. Submit 4. Textarea
4027     4.0
4028    410
4029Which is the correct CSS syntax?
4030  1. body:color=black
40312. {body;color:black}
40323. {body:color=black(body}
40334.
4034body {color: black}
4035   4.0
4036   411
4037   Which of the following asymptotic notation is the worst among all?
4038      1.
4039n + 9378 2.
40402^ n-1 3.
40412^ n - 1 4.
40422n ? 1
4043     2.0
4044   412
4045 Which of the following is/are example(s) of stateful application layer protocols? (i)HTTP
4046(ii)FTP
4047(iii)TCP
4048(iv)POP3
4049    1.
4050(i) and (ii) only 2.
4051(ii) and (iii) only 3.
4052(ii) and (iv) only 4.
4053(iv) only
4054    3.0
4055   413
4056Which of these is not a valid attribute of <tr> element?
4057   1. valign 2. bgcolor 3.
4058align
40594. rowspan
4060   4.0
4061 
4062   S.NO.
4063  Questions
4064    Choices
4065   Answers
4066    414
4067Which of these methods has no restrictions on content size when a form is submitted.
4068  1.
4069GET 2.
4070HEAD
40713. POST
40724. PUT
4073   3.0
4074     415
4075  Which one is the first search engine in internet?
4076    1. Google 2.
4077Archie
40783. AltaVista 4.
4079W AIS
4080     2.0
4081   416
4082   While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is
4083      1.
408445 2.
408567 3. 34 4. 78
4086     2.0
4087    417
4088A mailer that transforms a message body of an e-mail into a web page is called a
4089  1.
4090Browser enriched mail client 2.
4091HTML-enabled mail client 3.
4092Rich Text mail client
40934.
4094client server mail client
4095   2.0
4096     418
4097  An incorrectly typed command will cause the operating system to display
4098    1.
4099a prompt
41002.
4101an error message 3.
4102a question mark 4.
4103causes exception
4104     2.0
4105   419
4106  Choose the correct HTML to left-align the content inside a table cell
4107     1. <tdleft>
41082.
4109<td leftalign>
41103.
4111<td valign="left"> 4.
4112<td align="left">
4113    4.0
4114 
4115   S.NO.
4116  Questions
4117    Choices
4118   Answers
4119   420
4120 Consider the below code fragment: if(fork k( ) = = 0)
4121{
4122a= a+5; printf("%d, %d \n", a, &a); }
4123else
4124{
4125a= a ? 5;
4126printf("%d %d \n", 0, &a);
4127}
4128Let u, v be the values printed by parent process and x, y be the values printed by child process. Which one of the following is true?
4129    1.
4130u= x + 10 and v = y
41312.
4132u= x + 10 and v!= y
41333.
4134u + 10= x and v = y 4.
4135u + 10= x and v != y
4136    3.0
4137    421
4138Consider the following C code segment: int a, b, c = 0;
4139void prtFun(void);
4140main( )
4141{ static int a = 1; /* Line 1 */ prtFun( );
4142a + = 1;
4143prtFun( )
4144printf("\n %d %d", a, b);
4145}
4146void prtFun(void)
4147{ static int a=2; /* Line 2 */ int b=1;
4148a+=++b;
4149printf("\n %d %d", a, b);
4150}
4151What output will be generated by the given code segment if: Line 1 is replaced by auto int a = 1;
4152Line 2 is replaced by register int a = 2;
4153  1.
415431 41 42 2.
415542
415661 61 3.
415742
415862 20 4.
415942
416042 20
4161   4.0
4162     422
4163  Consider the following C program. #include <stdio.h>
4164int f1 (void) ;
4165int f 2 (void) ;
4166int x = 10;
4167int main ()
4168{
4169int x=1;
4170x+=f1()+ f2()+f3()+f2() ; printf("%d", x);
4171return 0;
4172}
4173int f1(){int x=25; x++; return x;}
4174int f2(){static int x =50; x++;return x;} int f3(){x*=10; return x};
4175The output of the program is_________.
4176    1. 434 2. 230 3. 43 4. 432
4177     2.0
4178   423
4179  Consider the following program: int f(int *p, int n)
4180{
4181if (n <= 1) return 0;
4182else return max ( f (p+1, n-1),p[0]-p[1]); }
4183int main()
4184{
4185int a[] = {3,5,2,6,4};
4186printf("%d", f(a,5));
4187}
4188The value printed by this program is
4189     1. 1 2. 2 3. 3 4. 4
4190    3.0
4191 
4192   S.NO.
4193  Questions
4194    Choices
4195   Answers
4196    424
4197Find the output of the following program?
4198#include <iostream.h> using namespace std;
4199void myFunction(int& x, int* y, int* z) { static int temp=1;
4200temp += (temp + temp) - 1;
4201x += *(y++ + *z)+ temp - ++temp; *y=x;
4202x=temp;
4203*z= x; cout<<x<<*y<<*z<<temp; }
4204int main() {
4205int i = 0;
4206int j[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; i=i++ - ++i;
4207myFunction(i, j, &i);
4208return 0;
4209}
4210  1. 3332 2. 3233 3. 3232 4. 3133
4211   gar3
4212   425
4213   If you don’t want the frame windows to be resizeable, simply add what to the lines ?
4214      1.
4215save 2.
4216dontresize 3. noresize 4.
4217Delete
4218     3.0
4219    426
4220Sockets originate from
4221  1.
4222BSD Unix 2. Windows 3.
4223Linux
42244.
4225Mac
4226   1.0
4227   427
4228   The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42.Which one of the following is the postorder traversal sequence of the same tree?
4229      1. 10,20,15,23,25,35,42,39,30 2. 15,10,25,23,20,42,35,39,30 3. 15,20,10,23,25,42,35,39,30 4. 15,10,23,25,20,35,42,39,30
4230     4.0
4231   428
4232What will be the output of the following C program? void count(int n){
4233static int d=1;
4234printf("%d ", n);
4235printf("%d ", d); d++;
4236if(n>1) count(n-1); printf("%d ", d);
4237}
4238void main(){ count(3);
4239}
4240   1. 312213444
42412.
4242312111222 3.
42433122134
42444. 3121112
4245   1.0
4246 
4247   S.NO.
4248  Questions
4249    Choices
4250   Answers
4251    429
4252Where in an HTML document is the correct place to refer to an external style sheet?
4253  1.
4254In the section
42552.
4256In the section
42573.
4258At the end of the document
42594.
4260At the top of the document
4261   head
4262   430
4263   Which of the following is included in the head section of HTML
4264      1.
4265title,body,form and script
42662.
4267title,meta tag,script and CSS
42683.
4269title , meta tag,css and form 4.
4270title, body,script and CSS
4271     2.0
4272    431
4273Which of these is Server side technology?
4274  1.
4275CGI
42762.
4277HTML
42783. JavaScript 4.
4279CSS
4280   3.0
4281   432
4282   Which of the following in HTML is used to left align the content inside a table cell?
4283      1.
4284<td raligh = "left" >
42852.
4286<tdleft>
42873.
4288<td leftalign>
42894.
4290<td align = "left">
4291     4.0
4292    433
4293Which one of the following statements is NOT correct about HTTP cookies?
4294  1.
4295A cookie is a piece of code that has the potential to compromise the security of an internet user
42962.
4297A cookie gains entry to the user's work area through an HTTP header
42983.
4299A cookie has an expiry date and time 4.
4300Cookies can be used to track the browsing pattern of a user at a particular site
4301   1.0
4302   434
4303  Consider the following program: int f(int *p, int n)
4304{
4305if (n <= 1) return 0;
4306else return max ( f (p+1, n-1),p[0]-p[1]); }
4307int main()
4308{
4309int a[] = {3,5,2,6,4};
4310printf("%d", f(a,5));
4311}
4312The value printed by this program is
4313     1. 1 2. 2 3. 3 4. 4
4314    3.0
4315 
4316   S.NO.
4317  Questions
4318    Choices
4319   Answers
4320    435
4321Which of these methods has no restrictions on content size when a form is submitted.
4322  1. GET 2. HEAD 3. POST 4. PUT
4323   3.0
4324   436
4325   ______________datastructure used in pushdown automata.
4326      1.
4327Stack
43282.
4329array
43303.
4331queue
43324.
4333linked list
4334     1.0
4335   437
4336 Consider the following:
4337temp=root->left; while(temp->right!=NULL)
4338temp=temp->right; return temp;
4339The above code snippet for a BST with the address of the root node in pointer ‘root’
4340returns
4341    1.Inorder successor of the root 2.
4342Maximum element in the right subtree of root 3.
4343Minimum element in the right subtree of root 4.
4344Inorder predecessor of the root
4345    4.0
4346    438
4347_____ is used to define a special CSS style for a group of HTML elements
4348  1.
4349Class attribute 2.
4350name attribute 3.
4351group attribute 4.
4352id attribute
4353   1.0
4354     439
4355  The _______ attribute defines the action to be performed when the form is submitted
4356    1.
4357method attribute 2.
4358action attribute
43593.
4360onSubmit attribute 4.
4361onClick attribute
4362     2.0
4363   440
4364  Consider a schedule S1 given below;
4365R1(A); W1(A); R2(B); R2(A); R1(B); W2(A+B); W1(B); where R1 and W1 are
4366read and write operations of transaction T1 and R2 and W2 are read and write operations of transaction T2.
4367Which of the following is correct regarding schedule S1?
4368     1.
4369S1 is a serializable schedule
43702.
4371A deadlock will occur if 2PL is used
43723.
4373S1 is a conflict serializable schedule 4.
4374S1 is a view serializable schedule
4375    4.0
4376 
4377   S.NO.
4378  Questions
4379    Choices
4380   Answers
4381    441
4382Boolean algebra is also called
4383  1.
4384switching algebra
43852.
4386arithmetic algebra
43873.
4388linear algebra
43894. algebra
4390   1.0
4391   442
4392   Software prototyping helps to
4393      1.
4394generate code
43952.
4396provide thorough testing
43973.
4398explore possible software solutions 4.
4399collect initial software requirements
4400     2.0
4401    443
4402Activities such as documentation and software configuration management are what kind of process activities?
4403  1.
4404Primary
44052.
4406Validation
44073.
4408Design
44094.
4410supporting
4411   4.0
4412     444
4413  In incremental delivery the ________ services are typically delivered first
4414    1.
4415quickest to complete
44162.
4417highest-priority
44183.
4419cheapest
44204.
4421most fun to code
4422     2.0
4423   445
4424  In incremental development system structure tends to ______ as many new increments are added.
4425     1.
4426degrade
44272.
4428improve
44293.
4430develop its own AI
44314.
4432shrink
4433    1.0
4434 
4435   S.NO.
4436  Questions
4437    Choices
4438   Answers
4439   446
4440 Software specifications are intended to communicate the system needs __________________
4441    1.
4442of the developers to the clients
44432.
4444to marketing
44453.
4446of the clients to the developers
44474.
4448to the general public
4449    3.0
4450    447
4451This software process model takes the fundamental activities of specification, development, validation, and evolution and represents them as separate process phases such as requirements specification, software design, implementation, testing, and so on
4452  1.
4453Incremental development
44542.
4455The waterfall model
44563.
4457Reuse-oriented software engineering
44584.
4459Boehm's spiral model
4460   2.0
4461     448
4462  What is a software process model?
4463    1.
4464A simplified representation of a software process
44652.
4466A presentation put together in Powerpoint
44673.
4468A work flow model of the software’s components
44694.
4470A prototype of the final software product
4471     1.0
4472     449
4473  What is a type of software design that designs system data structures to be used in a database?
4474    1. 2. 3. 4.
4475architectural design
4476interface Design
4477component Design
4478Database design
4479     4.0
4480     450
4481  What is based on the idea of developing an initial implementation, exposing this to user comment and evolving it through several versions until an adequate system has been developed?
4482    1.
4483The Waterfall Method
44842.
4485Incremental Development
44863.
4487Reuse-oriented Software Engineering
44884.
4489Implementation And Unit Testing
4490     2.0
4491   451
4492  What is NOT part of the design process
4493     1.
4494Architectural design
44952.
4496Database design
44973.
4498Component design
44994.
4500Validation testing
4501    4.0
4502 
4503   S.NO.
4504  Questions
4505    Choices
4506   Answers
4507   452
4508 Which is not part of the waterfall method?
4509    1.
4510Requirements Definition
45112.
4512System and Software Design
45133.
4514Implementation and Unit Testing
45154.
4516System Validation
4517    4.0
4518    453
4519Which statement best describes a benefit of Incremental development over the waterfall model
4520  1.
4521It is possible to gather more of the requirements up front
45222.
4523Time to market is faster because there is less overhead
45243.
4525It is easier to get customer feedback on the development work that’s been done
45264.
4527It is easier to reuse existing components.
4528   3.0
4529   454
4530   ___________ adds to the costs of Software Development because it usually means that work that has been completed has to be redone
4531      1.
4532Picture quality 2.
4533Production
45343.
4535Software speed 4.
4536Change
4537     4.0
4538    455
4539Given the following structure template, choose the correct syntax for accessing the 5th subject marks of the 3rd student:
4540struct stud {
4541int marks[6]; char sname[20]; char rno[10];
4542}s[10];
4543  1. stud[2].marks[4]
45442. stud[4].marks[2]
45453.
4546s[2].marks[4] 4.
4547s[4].marks[2]
4548   3.0
4549   456
4550   By default, any real number in C is treated as ____
4551      1.
4552a float
45532.
4554a double
45553.
4556a long double
45574.
4558depends on the memory model
4559     1.0
4560   457
4561____________ is the 1st step in the testing process
4562   1.
4563Analyze results
45642.
4565Plan test
45663.
4567Release product
45684.
4569Conduct tests
4570   2.0
4571 
4572   S.NO.
4573  Questions
4574    Choices
4575   Answers
4576    458
4577A set of documents in which a given document can contain text, graphics video and audio clips as well as embedded references to other documents world wide web pages are called as
4578---------------
4579  1.
4580Hypermedia message
45812.
4582Hypertext document
45833.
4584Hypermedia Documents
45854.
4586Path rectangular grid of Pixels
4587   3.0
4588   459
4589   A software requirements specification (SRS) document should avoid discussing which one of the following?
4590      1.
4591User interface issues
45922.
4593Non-functional requirements
45943.
4595Design specification
45964.Interfaces with third party softwareKey
4597     1.0
4598    460
4599Consider a B+ tree in which the search Answer is 12 bytes long, block size is 1024 bytes,record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ____
4600  1. 40 2. 50 3. 60 4. 70
4601   2.0
4602     461
4603  Extreme Programming process model includes framework activities such as
4604    1.
4605analysis, design,coding,testing
46062.
4607planning,analysis,design,coding
46083.
4609planning,analysis,coding,testing
46104.
4611planning, design, coding, testing
4612     4.0
4613     462
4614  For automatic objects, constructors and destructors are called each time the objects ___
4615    1.
4616enter and leave scope
46172.
4618inherit parent class
46193.
4620are constructed
46214.
4622are destroyed
4623     1.0
4624   463
4625  Important capability needed for an agile software developer is
4626     1.
4627Trust
46282.
4629Competence
46303.
4631Decision-making
46324.
4633HardworkKey
4634    3.0
4635 
4636   S.NO.
4637  Questions
4638    Choices
4639   Answers
4640    464
4641In which phase is Agile Modeling(AM) carried out
4642  1.
4643Analysis
46442.
4645Coding
46463.
4647Planning
46484.
4649TestingKey
4650   3.0
4651   465
4652   Mnemonic codes and variable names are used in
4653      1.
4654Machine language 2.
4655Assembly language 3.
4656high level language 4.
4657Used nowhere
4658     2.0
4659    466
4660Waterfall model of software development is also termed as
4661  1.
4662The linear sequential model
46632.
4664Fountain model
46653.
4666Spiral model
46674.
4668Concurrent development model
4669   1.0
4670     467
4671  Which of the following is not a Life-critical System?
4672    1.
4673Fire Dispatch Systems
46742.
4675Nuclear Reactors
46763.
4677Power Utilities
46784.
4679Inventory Management
4680     4.0
4681     468
4682  Which of the following statement is correct about destructors?
4683    1.
4684A destructor has void return type.
46852.
4686A destructor has integer return type.
46873.
4688A destructor has no return type.
46894.
4690A destructors return type is always same as that of main()
4691     3.0
4692   469
4693  #include <iostream.h> using namespace std; int main()
4694{
4695int x=20; if(!(!x)&&x) cout< else
4696{
4697x=10;
4698cout< return 0; }
4699}
4700     1. 20 2. 10 3. 1 4. 0
4701    1.0
4702 
4703   S.NO.
4704  Questions
4705    Choices
4706   Answers
4707    470
4708Find the output of the following program?
4709#include <iostream.h> using namespace std; typedef int * IntPtr; int main()
4710{
4711IntPtr A, B, C;
4712int D,E;
4713A = new int(3);
4714B = new int(6);
4715C = new int(9);
4716D = 10;
4717E = 20;
4718*A = *B;
4719B = &E;
4720D = (*B)++;
4721*C= (*A)++ * (*B)--;
4722E= *C++ - *B--; cout<<*A<<*B<<*C< return 0; }
4723  1. 62010206
47242. 72010107
47253. 71020106
47264. 10720107
4727   2.0
4728     471
4729  If a , b , c, are three nodes connected in sequence in a singly linked list, find the valid statement that may help to change this list to a circular linked list?
4730    1. a->next=c 2. b->next=c 3. a->next=c 4. c->next=b
4731     4.0
4732     472
4733  Round Robin scheduling is the strategy of temporarily suspending a running process
4734    1.
4735After the CPU time slice expires 2.
4736to allow starving processes to run 3.
4737when it requests IO
47384.
4739when OS wait
4740     1.0
4741   473
4742   With a single resource, deadlock occurs ___________
4743      1.
4744if there are more than two processes competing for that resource 2.
4745if there are only two process completing for that resource
47463.
4747if there is a single process competing for that resource
47484.
4749it never occur in this case
4750     1.0
4751   474
4752______ OS pays more attention on the meeting of the time limits.
4753   1. Distributed 2.
4754Network
47553.
4756Real time 4.
4757Desktop
4758   3.0
4759 
4760   S.NO.
4761  Questions
4762    Choices
4763   Answers
4764    475
4765Consider a software program that is artificially seeded with 100 faults. While testing this program, 159 faults are detected, out of which 75 faults are from those artificially seeded faults. Assuming that both are and seeded faults are of same nature and have same distribution, the estimated number of undetected real fault is
4766  1. 121 2. 175 3. 432 4. 428
4767   4.0
4768   476
4769   Given the code
4770String s1 = ? VIT? ;
4771String s2 = ? VIT ? ;
4772String s3 = new String ( s1);
4773Which of the following would equate to true?
4774      1.
4775s1 == s2 2.
4776s1 = s2 3.
4777s3 == s1 4.
4778s3=s1
4779     13.0
4780    477
4781Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?
4782  1. 0 2. 3 3. 4 4. 5
4783   2.0
4784     478
4785  The following HTML ________ element contains meta data which is not displayed inside the document
4786    1. <form> 2. <title> 3. <table> 4. <frame>
4787     2.0
4788   479
4789   To link your Web page to a style sheet, you must use the _____ tag
4790      1. <STYLESHEET> 2.
4791<STYLE>
47923.
4793<link>
47944.
4795<web>
4796     3.0
4797   480
4798Which of these will create a shuffled list?
4799   1.
4800<ol>
48012.
4802<ul>
48033.
4804<dl>
48054.
4806Nested list
4807   1.0
4808 
4809   S.NO.
4810  Questions
4811    Choices
4812   Answers
4813    481
4814Which one of the following is a cryptographic protocol used to secure HTTP connection?
4815  1.
4816Stream Control Transmission Protocol (SCTP). 2.
4817Transport Layer Security (TSL).
48183.
4819Explicit Congestion Notification (ECN).
48204.
4821Resource Reservation Protocol.
4822   2.0
4823   482
4824   Which of the following is example of in-place algorithm?
4825      1.
4826Bubble Sort 2.
4827Merge Sort 3.
4828Insertion Sort 4.
4829     3.0
4830    483
4831Which of these is asymptotically bigger?
4832  1. 79n2+43n 2. 65n3+34n 3.
48336*2n
48344.
48355*2n
4836   2.0
4837   484
4838   ___ bit in ICW1 indicates whether the 8259A is cascade mode or not
4839     1.LTIM=0 2.LTIM=1 3.SNGL=1 4.SNGL=0
4840    4.0
4841    485
4842____ messages are typically used for diagnostic or control purposes or generated in response to errors in IP operations.
4843  1.ICMP 2.TCP 3.UDP 4.IP
4844   1.0
4845   486
4846   _____ gives the number of bits that can be transmitted over a network in a fixed time period.
4847     1.Latency 2.Jitter 3.Bandwidth 4.Delay
4848    3.0
4849    487
4850______ cryptography refers to encryption methods in which both the sender and receiver share the same key.
4851  1.Symmetric 2.Asymmetric 3.Ceaser key 4.Asymmetric key
4852   1.0
4853     488
4854  ______ is responsible for the final encapsulation of higher-level messages into frames that are sent over the network using the physical layer.
4855    1.Data link layer 2.Network layer 3.Application layer 4.Session layer
4856     1.0
4857     489
4858  _______ appends to the address a slash character and the decimal number of leading bits of the routing prefix.
4859    1.CIDR 2.TCP 3.UDP 4.IP
4860     1.0
4861   490
4862   _______ is assigned to an organization by a global authority.
4863     1.Subnet ID 2.Supernet ID 3.Host ID 4.Network ID
4864    4.0
4865    491
4866_______ produces the relation that has attributes of R1 and R2
4867  1.
4868Cartesian product 2.
4869Difference
48703.
4871Intersection
48724.
4873Product
4874   1.0
4875     492
4876  _______ should keep track of multiple file downloads requested by a particular FTP application, or multiple telnet connections from a single terminal client, or web page retrievals from a web server.
4877    1.Transport layer 2.Application layer 3.Presentation layer 4.Session layer
4878     1.0
4879   493
4880   ________ functions as a request-response protocol in the client-server computing model.
4881     1.HTTP 2.IP 3.TCP 4.UDP
4882    1.0
4883   494
4884________ is commonly used in wireless LAN.
4885   1.
4886time division multiplexing
48872.
4888orthogonal frequency division multiplexing 3.
4889space division multiplexing
48904.
4891long division multiplexing
4892   2.0
4893 
4894   S.NO.
4895  Questions
4896    Choices
4897   Answers
4898    495
4899________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
4900  1.
4901Long term
49022.
4903Short trem
49043.
4905Medium term 4.
4906None of these
4907   1.0
4908     496
4909  _________ does the job of allocating a process to the processor.
4910    1.
4911Long term scheduler
49122.
4913Short term scheduler (CPU Scheduler) 3.
4914Medium term scheduler
49154.
4916Dispatcher
4917     4.0
4918   497
4919   _________ has a dedicated communication path between stations
4920     1.Circuit switching 2.Frame relay 3.Packet switching 4.ATM
4921    1.0
4922    498
4923_________ is a high speed cache used to hold recently referenced page table entries as a part of paged virtual memory
4924  1.
4925Translation Look-aside buffer 2.
4926Inverse page table
49273.
4928Segmented page table
49294.
4930Hierarchical page table
4931   1.0
4932     499
4933  _________ memory management scheme will produce least fragement
4934    1.
4935Best Fit
49362.
4937Worst Fit
49383.
4939First Fit
49404.
4941None of these
4942     1.0
4943     500
4944  _________ register keeps tracks of the instructions stored in program stored in memory.
4945    1.
4946AR (Address Register) 2.
4947XR (Index Register) 3.
4948PC (Program Counter) 4.
4949AC (Accumulator)
4950     3.0
4951     501
4952  _________ states that it is Optimal Replacement algorithm
4953    1.
4954Replace the page that will not be used for a longest period of time 2.
4955Replace the page that will not be used for a shortest period of time 3.
4956Replace the page that will be used for a longest period of time
49574.
4958Replace the page that will be used for a shortest period of time
4959     1.0
4960   502
4961  __________ algorithm is used for the flow control of data between sender and receiver.
4962    1.Dijkstra 2.RIP 3.Leaky bucket 4.Go Back N
4963   4.0
4964 
4965   S.NO.
4966  Questions
4967    Choices
4968   Answers
4969    503
4970___________ programs automatically connects to web sites and download documents and save them to local drive
4971  1.
4972Web Servers
49732.
4974Web Downloading Utilities 3.
4975Stay Connected
49764.
4977Offline Browsers
4978   2.0
4979     504
4980  ___________ signal prevent the microprocessor from reading the same data more than one
4981    1.pipelining 2.handshaking 3.controlling 4.signaling
4982     2.0
4983   505
4984   ____________ function in PHP returns a list of response headers sent (or ready to send)
4985     1.header() 2.headers_list() 3.header_sent() 4.header_send()
4986    2.0
4987    506
4988______________ is an initial version of a software system that is used to demonstrate concepts, try out design options, and find out more about the problem and its possible solutions.
4989  1.
4990Prototype
49912.
4992Architectural Design 3.
4993Subsystem
49944.
4995Module
4996   1.0
4997     507
4998  ________________ is a basic unit of CPU utilization
4999    1.
5000Process
50012.
5002Thread
50033.
5004Process Control Block 4.
5005Program Counter
5006     2.0
5007   508
5008   ______________is a logical unit of access to a DBMS
5009     1.Transaction 2.Optimization 3.Schema 4.Data
5010    1.0
5011    509
5012A graphical HTML browser resident at a network client machine Q accesses a static HTML webpage from a HTTP server S. The static HTML page has exactly one static embedded image which is also at S. Assuming no caching, which one of the following is correct about the HTML webpage loading (including the embedded image)?
5013  1.
5014Q needs to send at least 2 HTTP requests to S, each necessarily in a separate TCP connection to server S
50152.
5016Q needs to send at least 2 HTTP requests to S, but a single TCP connection to server S is sufficient
50173.
5018A single HTTP request from Q to S is sufficient, and a single TCP connection between Q and S is necessary for this
50194.
5020A single HTTP request from Q to S is sufficient, and this is possible without any TCP connection between Q and S
5021   2.0
5022     510
5023  A 20-bit address bus can locate ________.
5024    1.
50251,048,576 locations 2.
50262,097,152 locations 3.
50274,194,304 locations 4.
50288,388,608 locations
5029     1.0
5030   511
5031  A 32-bit address bus allows access to a memory of capacity
5032    1.1 GB 2.16 MB 3.64 MB 4.4 GB
5033   4.0
5034 
5035   S.NO.
5036  Questions
5037    Choices
5038   Answers
5039    512
5040A B-tree of order m has maximum of _____________ children
5041  1.
5042m
50432. m+1 3. m-1 4. m/2
5044   1.0
5045   513
5046   A binary code that progresses such that only one bit changes between two successive codes is:
5047     1.Gray code 2.excess-3 code 3.8421 code 4.nine's-complement code
5048    1.0
5049   514
5050 A certain 5-bit self-complementary code is used to represent the 10 decimal digits 0 through 9. Given that (246) in decimal is represented as 00010 00100 00110 in this code, what is the representation for (375)?
5051    1.00110 00100 00010 2.00011 00111 00101 3.11001 11101 11011 4.11101 11011 11001
5052   4.0
5053    515
5054A client process P needs to make a TCP connection to a server process S. Consider the following situation: the server process S executes a socket(), a bind() and a listen() system call in that order, following which it is preempted. Subsequently, the client process P executes a socket() system call followed by connect() system call to connect to the server process S. The server process has not executed any accept() system call. Which one of the following events could take place?
5055  1.
5056connect () system call returns successfully 2.
5057connect () system call blocks
50583.
5059connect () system call returns an error
50604.
5061connect () system call results in a core dump
5062   3.0
5063     516
5064  A COCOMO model is
5065    1.
5066Common Cost Estimation Model.
50672.
5068Constructive Cost Estimation Model.
50693.
5070Complete Cost Estimation Model.
50714.
5072Comprehensive Cost Estimation Model.
5073     2.0
5074   517
5075   A collection of unused memory reserved for dynamic allocation is called
5076     1.Heap 2.Static 3.array 4.stack dynamic
5077    1.0
5078   518
5079 A comparison between ring and Johnson counters indicates that:
5080    1.A ring counter has fewer flip-flops but requires more decoding circuitry 2.A ring counter has an inverted feedback path 3.A Johnson counter has more flip-flops but less decoding circuitry 4.A Johnson counter has an inverted feedback path
5081   4.0
5082    519
5083A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the maximum duration for which the computer can transmit at the full 10Mbps?
5084  1.
50851.6 seconds 2.
50862 seconds 3.
50875 seconds 4.
50888 seconds
5089   2.0
5090   520
5091   A data structure where elements can be added or removed at either end but not in the middle
5092     1.linked lists 2.Stacks 3.Queues 4.Deque
5093    4.0
5094    521
5095A fault simulation testing technique is
5096  1.
5097Mutation testing 2.
5098Stress testing
50993.
5100Black box testing 4.
5101White box testing
5102   1.0
5103   522
5104  A grammar that produces more than one parse tree for some sentence is called
5105    1.Ambiguous 2.Irregular 3.Regular 4.Unambiguous
5106   1.0
5107 
5108   S.NO.
5109  Questions
5110    Choices
5111   Answers
5112    523
5113A group of bits that tell the computer to perform a specific operation is known as____.
5114  1.
5115Instruction code 2.
5116Micro-operation 3.
5117Accumulator 4.
5118Register
5119   1.0
5120   524
5121   A J-K flip-flop is in a "no change" condition when ________.
5122     1.J = 1, K = 1 2.J = 1, K = 0 3.J = 0, K = 1 4.J = 0, K = 0
5123    4.0
5124   525
5125 A language is represented by a regular expression (a)*(a+ba). Which of the following string does not belong to the regular set represented by the above expression.
5126    1.
5127aaa
51282. aba 3. ababa 4.
5129aa
5130    3.0
5131    526
5132A layer-4 firewall cannot
5133  1.
5134block HTTP traffic during 9:00PM and 5:00AM
51352.
5136block all ICMP traffic
51373.
5138stop incoming traffic from a specific IP address but allow outgoing traffic to same IP
51394.
5140block TCP traffic from a specific user on a specific IP address on multi- user system during 9:00PM and 5:00AM
5141   1.0
5142   527
5143   A linear collection of data elements where the linear node is given by means of pointer is called
5144     1.primitive list 2.node list 3.linked list 4.array
5145    3.0
5146    528
5147A major problem with priority scheduling is _________.
5148  1.
5149Definite blocking 2.
5150Starvation
51513.
5152Low priority
51534.
5154None of these
5155   2.0
5156     529
5157  A minimum state DFA accepting the language L={w/w belongs {0,1}*} number of 0s and 1s in w are divisible by 3 and 5, respectively} has
5158    1.
515915 states 2.
51607 states 3.
51619 states 4.
51628 states
5163     1.0
5164   530
5165  A network that contains multiple hubs is most likely configured in which topology?
5166    1.Mesh 2.Tree 3.Bus 4.Star
5167   2.0
5168 
5169   S.NO.
5170  Questions
5171    Choices
5172   Answers
5173    531
5174A NFA converted to DFA has more than one final state.
5175  1.
5176True
51772.
5178False
51793.
5180may be true 4.
5181always true
5182   1.0
5183     532
5184  A one to many relationship (of table A to Table B) is
5185    1.Where each record in table A can have one or more matching records in table B
51862.Where each record in table B can have one or more matching records in table A
51873.Where each record in Table B is required to have a match in table A 4.Where each record in table A is required to have a match in table B
5188     1.0
5189   533
5190   A packet switching network
5191     1.can reduce the cost of using an information utility 2.allows communications channel to be shared among more than one user 3.can reduce the cost of using an information utility and allows communications channel to be shared among more than one user 4.is free
5192    3.0
5193    534
5194A page fault occurs
5195  1.
5196when the page is not in the main memory 2.
5197when the page is in the cache memory
51983.
5199when the process enters the blocked state 4.
5200when the process is in the ready state
5201   1.0
5202   535
5203   A parameterized constructor with all arguments initialized is same as
5204     1.default constructor 2.parameterized constructor 3.overriding 4.overloading
5205    1.0
5206    536
5207A point-to-point protocol over ethernet is a network protocol for
5208  1.
5209encapsulating PPP frames inside ethernet frames 2.
5210encapsulating ethernet frames inside PPP frames 3.
5211for security of ethernet frames
52124.
5213for security of PPP frames
5214   1.0
5215   537
5216   A primary key, if combined with a foreign key creates
5217     1.Many to many relationships between the tables that connect them 2.Network model between the tables connect them 3.one to many relationship between the tables that connect them 4.Parent child relationship between the tables that connect them
5218    4.0
5219   538
5220A professional software engineer must:
5221   1.
5222be loyal to the organization
52232.
5224build trust from customers
52253.
5226socialize with customers
52274.
5228be loyal to the organization and build trust from customers
5229   4.0
5230 
5231   S.NO.
5232  Questions
5233    Choices
5234   Answers
5235    539
5236A relation R is said to be in 2NF when it does not have
5237  1.
5238Partial Dependencies
52392.
5240Transitive Dependencies
52413.
5242Multivalued Attributes
52434.
5244Both Partial dependencies and Multivalued Dependencies
5245   1.0
5246     540
5247  A relational database is
5248    1.the same as a flat file database
52492.one that consists of two or more tables that are joined in some way 3.one that consists of two or more tables
52504.a database that is able to process tables, queries, forms, reports and macros
5251     4.0
5252   541
5253   A ring counter is same as.
5254     1.up-down counter 2.parallel adder 3.shift register 4.ALU
5255    3.0
5256    542
5257A set of possible data values is called
5258  1. attribute 2. degree 3. domain 4.
5259tuple
5260   4.0
5261   543
5262   A shift register can be used for.
5263     1.Digital delay line 2.Serial to parallel conversion 3.All of these 4.Parallel to serial conversion
5264    4.0
5265    544
5266A single channel is shared by multiple signals by
5267  1.
5268analog modulation
52692.
5270digital modulation
52713.
5272multiplexing
52734.
5274none of the mentioned
5275   3.0
5276   545
5277   A software package designed to store and manage databases
5278     1.Database 2.DBMS 3.Data Model 4.Data
5279    2.0
5280    546
5281A stack organized computer has
5282  1.Three-address Instruction 2. Two-address Instruction
52833.One-address Instruction 4. Zero-address Instruction
5284   4.0
5285     547
5286  2.0
5287    1. TRUE 2. False 3. 4.
5288     2.0
5289     548
5290  A static data member is given a value
5291    1.Within the class definition 2.Outside the class definition 3.When the program is exeuted 4.Never
5292     2.0
5293   549
5294  A synchronous sequential circuit is made up of.
5295    1.combinational gates 2.flip-flops 3.both flip-flops and latches 4.both combinational gates and flip-flops
5296   4.0
5297 
5298   S.NO.
5299  Questions
5300    Choices
5301   Answers
5302    550
5303A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and accesses the same 100 pages but now in the reverse order how many page faults will occur?
5304  1. 196 2. 192 3. 197 4. 195
5305   1.0
5306     551
5307  A table can have only one
5308    1.
5309Secondary key 2.
5310Alternate key 3.
5311Unique key
53124.
5313Primary key
5314     4.0
5315     552
5316  A tree sturctured file directory system
5317    1.
5318allows easy storage and retrieval of file names 2.
5319is not essential when we have millions of files 3.
5320is a much debated unnecessary feature
53214.
5322none of these
5323     1.0
5324   553
5325   A value that has no defined value is expressed in PHP with the following keyword:
5326     1.undef 2.null 3.Cant Define 4.There is no such concept in PHP
5327    2.0
5328    554
5329A variable P is called pointer if
5330  1.P contains the address of an element in DATA 2.P contain the DATA and the address of DATA 3.P can store only memory addresses 4.P points to the address of first element in DATA
5331   1.0
5332   555
5333   A variable P is called pointer if
5334     1.P contains the address of an element in DATA 2.P contain the DATA and the address of DATA 3.P can store only memory addresses 4.P points to the address of first element in DATA
5335    1.0
5336    556
5337A view is a
5338  1.
5339virtual table
53402.
5341subset of the table 3.
5342base table
53434.
5344super table
5345   1.0
5346   557
5347  A Winchester disk is a
5348     1.
5349Disk stack
53502.
5351Removable disk 3.
5352Flexible disk
53534.
5354None of these
5355    1.0
5356 
5357   S.NO.
5358  Questions
5359    Choices
5360   Answers
5361    558
5362A complete binary min-heap is made by including each integer in [1;1023] exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum depth at which integer 9 can appear is
5363  1. 7 2. 8 3. 9 4. 10
5364   2.0
5365   559
5366   Abstraction is
5367     1.Having public members 2.having private member and public function 3.friend function 4.friend classes
5368    2.0
5369   560
5370 2.0
5371    1. developer
53722.
5373end users
53743.
5375test team
53764.
5377systems engineers
5378    2.0
5379    561
5380Access time is faster for _________.
5381  1. ROM 2. SRAM 3. DRAM 4. ERAM
5382   2.0
5383   562
5384   Additive rule
5385     1.cyan+ magenta+ Yellow= white 2.Red + Green + Blue = white 3.cyan+ Green+ Yellow= white 4.cyan+ magenta+ Yellow= Black
5386    2.0
5387   563
5388 Address line for TRAP is?
5389    1. 0023H 2. 0024H 3. 0033H 4. 0099H
5390    2.0
5391    564
5392ALE stands for ___________
5393  1.
5394address latch enable 2.
5395address level enable 3.
5396address leak enable
53974.
5398address leak extension
5399   1.0
5400     565
5401  ALGORITHM HAS THE ________________ TO THE PROBLEM IN _______________ NUMBER OF STEPS
5402    1.SOLUTION & FINITE 2.PROBLEM & INFINITE 3.SOLUTION & INFINITE 4.PROBLEM & FINITE
5403     1.0
5404   566
5405   All devices/host connect to a central switch in _____ topology.
5406     1.Star 2.Ring 3.Bus 4.Tree
5407    1.0
5408   567
5409All the modules of the system are integrated and tested as complete system in the case of
5410   1.
5411Bottom up testing 2.
5412Top-down testing 3.
5413Sandwich testing 4.
5414Big-Bang testing
5415   4.0
5416 
5417   S.NO.
5418  Questions
5419    Choices
5420   Answers
5421    568
5422Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?
5423  1.
5424SLR , LALR 2.
5425CLR , LALR 3.
5426SLR , CLR 4.
5427SLR
5428   3.0
5429     569
5430  An activity is said to be critical if slack time is equal to
5431    1. 0 2. 1 3. 2 4. 3
5432     1.0
5433   570
5434   An advantage of the database approach is
5435     1.Elimination of the data redundancy 2.Ability to associate related data 3.Increase security 4.All of the options
5436    4.0
5437    571
5438An Entity from an ER diagram can be represented in the relational model by a
5439  1.relation
54402.domain
54413.functional dependency 4.single attribute
5442   1.0
5443     572
5444  An ethernet frame that is less than the IEEE 802.3 minimum length of 64 octets is called
5445    1.short frame 2.runt frame 3.mini frame 4.man frame
5446     2.0
5447   573
5448   An intermediate code form is
5449     1.Postfix notation 2.Syntax trees 3.Three address code 4.Postfix notation, Syntax trees and Three address code
5450    4.0
5451    574
5452An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be:
5453  1.
5454255.255.0.0
54552. 255.255.64.0 3. 255.255.128.0 4. 255.255.252.0
5456   4.0
5457   575
5458   Any code inside a loop that always computes the same value can be moved before the loop. This is called
5459     1.Loop invariant computation 2.Interchange of statements 3.inducation variable 4.Algebraic Transformation
5460    1.0
5461   576
5462Application layer protocol defines
5463   1.
5464types of messages exchanged
54652.
5466message format, syntax and semantics
54673.
5468rules for when and how processes send and respond to messages 4.
5469all of the mentioned
5470   4.0
5471 
5472   S.NO.
5473  Questions
5474    Choices
5475   Answers
5476   577
5477 Architecture of the database can be viewed as
5478    1.
5479two levels 2.
5480four levels 3.
5481three levels 4.
5482one level
5483    3.0
5484    578
5485Arrange the operators according to their precedence: +, %, ->, =
5486   1.
5487->, %, +, = 2.
5488=, +, %, -> 3.
5489%, +, =, -> 4.
5490%, ->, =, +
5491   1.0
5492     579
5493  Assume that a table R with 1000 records is to be joined with another table S with 10000 records. What is the maximum number of records that would result in if we join R with S and the equi-join attribute of S is the primary key?
5494    1.
54951000
54962.
549710000
54983. 1,00,00,000 4.
549911000
5500     1.0
5501     580
5502  Assume that we have constructor functions for both base class and derived class. Now consider the declaration in main( ). Base * P = New Derived; in what sequence will the constructor be called ?
5503    1.Derived class constructor followed by Base class constructor. 2.Base class constructor followed by derived class constructor. 3.Base class constructor will not be called. 4.Derived class constructor will not be called.
5504     2.0
5505   581
5506   Assume the base address of CS is 3000H and IP is 2000H. Calculate the memory address.
5507     1.32000H 2.3000H 3.30000H 4.2000H
5508    1.0
5509    582
5510Assume you would like to sort an array in ascending order by value while preserving key associations. Which of the following PHP sorting functions would you use?
5511  1. ksort( ) 2. asort( ) 3. krsort( ) 4.
5512sort( )
5513   2.0
5514     583
5515  Assuming today is , 10 July 2000, what is returned by this statement: SELECT to_char(Last_DAY(sysdate), 'DD-MON-RR') FROM dual;
5516    1. 17-JUL-00 2. 10-JUL-00 3. 31-DEC-00 4. 31-JUL-00
5517     4.0
5518   584
5519   Binary search algorithm can not be applied to
5520     1.sorted linked list 2.sorted binary trees 3.sorted linear array 4.pointer array
5521    4.0
5522   585
5523Bit stuffing refers to
5524   1.inserting a '0' in user data stream to differentiate it with a flag 2.inserting a '0' in flag data stream to avoid ambiguity 3.appending a nibble to the flag sequence 4.appending a nibble to the user data stream
5525  1.0
5526 
5527   S.NO.
5528  Questions
5529    Choices
5530   Answers
5531    586
5532Bits can be send over guided and unguided media as analog signal using .........................
5533  1.
5534digital modulation
55352.
5536amplitude modulation 3.
5537frequency modulation 4.
5538phase modulation
5539   1.0
5540     587
5541  2.0
5542    1. true 2. false 3. 4.
5543     2.0
5544   588
5545   By following modern system engineering practices simulation of reactive systems is no longer necessary.
5546     1. 2.0True 2.
5547FALSE 3. 4.
5548    2.0
5549    589
5550Cache memory acts between_______.
5551  1.
5552CPU and RAM 2.
5553RAM and ROM 3.
5554CPU and Hard Disk 4.
5555None of these
5556   1.0
5557     590
5558  Calculate the block number in free storage management of files system with number of bits per word is 8, the bit vector is
55590001101010101, offset of first 1 bit is 3
5560    1. 59 2. 51 3. 45 4. 53
5561     1.0
5562     591
5563  Calculate the EAT(Effective access time) if 5 micro second is associative look-up time and 0.80 is the hit-ratio in paging hardware with TLB
5564    1.
55656.2 micro second 2.
55667.8 micro second 3.
55672.2 micro second 4.
55683.2 micro second
5569     3.0
5570   592
5571  Cartesian product in relational algebra is
5572     1.
5573a Unary operator 2.
5574a Binary operator 3.
5575a Ternary operator 4.
5576not defined
5577    2.0
5578 
5579   S.NO.
5580  Questions
5581    Choices
5582   Answers
5583   593
5584 Change cannot be easily accommodated in most software systems, unless the system was designed with change in mind.
5585    1. True 2. False 3. 4.
5586   1.0
5587    594
5588Changes made to an information system to add the desired but not necessarily the required features is called
5589  1.
5590Preventative maintenance. 2.
5591Adaptive maintenance.
55923.
5593Corrective maintenance. 4.
5594Perfective maintenance.
5595   4.0
5596     595
5597  Class ____ IP addresses are used for large organizations
5598    1.A 2.B 3.D 4.C
5599     1.0
5600   596
5601   class n{ int a;}; how much memory the compiler allocates for this class
5602     1.0 2.2 3.depends on compiler 4.4
5603    4.0
5604    597
56051.0
5606  1. true 2. false 3. 4.
5607   1.0
5608     598
5609  Classes and components that exhibit functional, layer, or communicational cohesion are relatively easy to implement, test, and maintain.
5610    1. true 2. false 3. 4.
5611     1.0
5612   599
5613   Compile time polymorphism is
5614     1.function overloading 2.template 3.function overriding 4.abstraction
5615    1.0
5616    600
5617Computers use addressing mode techniques for _____________________.
5618  1.
5619giving programming versatility to the user by providing facilities as pointers to memory counters for loop control
56202.
5621to reduce no. of bits in the field of instruction
56223.
5623specifying rules for modifying or interpreting address field of the instruction
56244.
5625All of these
5626   4.0
5627   601
5628   Condition testing is a control structure testing technique where the criteria used to design test cases is that they
5629    1.
56301.0rely on basis path testing
56312.
5632exercise the logical conditions in a program module 3.
5633select test paths based on the locations and uses of variables 4.
5634focus on testing the validity of loop constructs
5635     1.0
5636    602
5637  Consider 2 scenarios:
5638  1.
5639Both are true
56402.
5641Both are False
56423.
5643C1 is true, C2 is false 4.
5644C1 is false, C2 is true
5645   3.0
5646 C1: For DFA (φ, Ʃ, δ, qo, F), ifF= φ,thenL= Ʃ*
5647C2: For NFA (φ, Ʃ, δ, qo, F), ifF= φ,thenL= Ʃ*
5648Where F = Final states set φ = Total states set
5649Choose the correct option ?
5650   603
5651  Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are _________.
5652    1.199 2.200 3.Any number between 0 and 199 4.Any number between 100 and 200
5653   1.0
5654 
5655   S.NO.
5656  Questions
5657    Choices
5658   Answers
5659    604
5660Consider a DFA over ∑ = {a, b} accepting all strings which have number of a’s divisible by 6 and number of b’s divisible by 8. What is the minimum number of states that the DFA will have?
5661  1. 8 2. 14 3. 15 4. 48
5662   4.0
5663   605
5664   Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are
5665     1.3, 3, and 3 2.3, 0, and 1 3.4, 0, and 1 4.3, 0, and 2
5666    2.0
5667    606
5668Consider an instance of TCP’s Additive Increase Multiplicative Decrease(AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a time out occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.
5669  1.
56708 MSS 2.
567114 MSS 3.
56727 MSS 4.
567312 MSS
5674   3.0
5675   607
5676   Consider an undirected graph G with 100 nodes. The maximum number of edges to be included is
5677     1.2451 2.4950 3.9900 4.4851
5678    4.0
5679    608
5680Consider S->SS|a what is the number of different derivation trees for aaaaa
5681  1. 5 2. 3 3. 14 4. 7
5682   3.0
5683     609
5684  Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start symbol and the following set of production rules
5685    1. aaaabb 2. aabbbb 3. aabbab 4. abbbba
5686     3.0
5687 S --> aB B --> b
5688B --> bS B --> aBB
5689S --> bA A --> a
5690A --> aS A --> bAA
5691Which of the following strings is generated by the grammar?
5692     610
5693Consider the data of previous question. Suppose that the sliding window protocol is used with the sender window size of 2^i where is the number of bits identified in the previous question and acknowledgments are always piggybacked. After sending 2^i frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time).
5694     1. 16ms 2. 18ms 3. 20ms 4. 22ms
5695    3.0
5696 
5697   S.NO.
5698  Questions
5699    Choices
5700   Answers
5701    611
5702Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is __________.
5703  1. 0 2. 1 3. 2 4. 3
5704   1.0
5705   612
5706   Consider the following array of elements. {89,19,50,17,12,15,2,5,7,11,6,9,100}.The minimum number of interchanges needed to convert it into a max-heap is
5707     1.4 2.2 3.5 4.3
5708    4.0
5709    613
5710Consider the following C code segment.
5711for (i = 0, i<n; i++)
5712{
5713for (j=0; j<n; j++)
5714{
5715if (i%2)
5716{
5717x += (4*j + 5*i);
5718y += (7 + 4*j); }
5719} }
5720Which one of the following is false?
5721  4.0
5722   4.0
5723   614
5724   Consider the following C declaration struct {
5725short s [5]
5726union {
5727float y;
5728long z;
5729}u;
5730} t;
5731Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes and 8 bytes, respectively. The memory requirement for variable t, ignoring alignment
5732considerations, is
5733    1.10 bytes 2.18 bytes 3.22 bytes 4.14 bytes
5734     2.0
5735    615
5736  Consider the following code segment.
5737  1. 6 2. 8 3. 9 4. 10
5738   4.0
5739 x = u - t; y = x * v; x = y + w; y = t - z; y = x * y;
5740The minimum number of total variables required to convert the above code segment to static single assignment form is
5741       616
5742Consider the following code snippet
5743var a1 = [,,,];
5744var a2 = new Array(3); 0 in a1
57450 in a2
5746Result of Javascript is:
5747    1.
5748true false 2.
5749false true 3.
5750true true 4.
5751false true
5752     1.0
5753   617
5754   Consider the following code snippet: var a = [1,2,3,4,5]; a.slice(0,3); What is the possible output for the above code snippet?
5755     1.Returns [1,2,3] 2.Returns [4,5] 3.Returns [1,2,3,4] 4.Returns [1,2,3,4,5]
5756    1.0
5757    618
5758Consider the following code snippet
5759function oddsums(n) {
5760let total = 0, result=[]; for(let x = 1; x <= n; x++) {
5761let odd = 2*x-1; total += odd; result.push(total);
5762}
5763return result; }
5764What would be the output if
5765oddsums(5);
5766  1.
5767Returns [1,4,9,16,25] 2.
5768Returns [1,2,3,4,5] 3.
5769Returns [3,6,9,12,15] 4.
5770Returns [1,3,5,7,9]
5771   1.0
5772   619
5773  Consider the following code: var a = []; a.unshift(1); a.unshift(22); a.shift(); a.unshift(3,[4,5]); a.shift(); a.shift(); a.shift(); The final output for the shift() is
5774    1.1 2.[4,5] 3.[3,4,5] 4.Exception
5775   1.0
5776 
5777   S.NO.
5778  Questions
5779    Choices
5780   Answers
5781   620
5782 Consider the following function double f(double x)
5783{
5784if (abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x);
5785}
5786Give a value q (to 2 decimals) such that f(q) will return q:_____.
5787    1.1.723 2.1.732 3.0.732 4.1.733
5788   2.0
5789    621
5790Consider the following javascript code snippet :
5791var a = []; a.unshift(1); a.unshift(22); a.shift(); a.unshift(3,[4,5]); a.shift(); a.shift(); a.shift();
5792The final output for the shift() is
5793  1.
57941
57952.
5796[4,5]
57973.
5798[3,4,5]
57994. Exception
5800   1.0
5801     622
5802  Consider the following program in C language:
5803#include main()
5804{
5805int i;
5806int *pi = &i; scanf(?%d?,pi); printf(?%d\n?, i+5); }
5807Which one of the following statements is TRUE?
5808    1.
5809Compilation fails. 2.
5810Execution results in a run-time error. 3.
5811On execution, the value printed is 5 more than the address of variable i 4.
5812On execution, the value printed is 5 more than the integer value entered
5813     4.0
5814   623
5815   Consider the following statements for priority queue :
5816S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
5817S2 : The elements of a priority queue may be complex structures that are ordered on one or several fields.
5818Which of the following is correct?
5819   1.Both S1 and S2 are incorrect 2.S1 is correct and S2 is incorrect 3.Both S1 and S2 are correct 4.S1 is incorrect and S2 is correct
5820    4.0
5821    624
5822  Consider the following two sets of LR(1) items of an LR(1) grammar.
5823  1.
58241 only
58252.
58262 only
58273.
58281 and 4 only 4.
58291,2,3,4
5830   4.0
5831 X -> c.X, c/d X -> .cX, c/d X -> .d, c/d X -> c.X, $
5832X -> .cX, $ X -> .d, $
5833Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are FALSE?
5834 1. Cannot be merged since look aheads are different.
58352. Can be merged but will result in S-R conflict.
58363. Can be merged but will result in R-R conflict.
58374. Cannot be merged since goto on c will lead to two different sets.
5838       625
5839Consider the following two sets of LR(1) items of an LR(1) grammar.
5840    1.
58411 only
58422.
58432 only
58443.
58453 and 4 only 4.
58461,2,3,4
5847     4.0
5848 X -> c.X, c/d X -> .cX, c/d X -> .d, c/d X -> c.X, $
5849X -> .cX, $ X -> .d, $
5850Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are FALSE?
5851 1. Cannot be merged since look aheads are different.
58522. Can be merged but will result in S-R conflict.
58533. Can be merged but will result in R-R conflict.
58544. Cannot be merged since goto on c will lead to two different sets.
5855     626
5856Consider the grammar shown below.
5857    1.
5858LL(1)
58592.
5860SLR(1) but not LL(1)
58613.
5862LALR(1) but not SLR(1) 4.
5863LR(1) but not LALR(1)
5864    1.0
5865 S→CC C→cC|d
5866The grammar is
5867  
5868   S.NO.
5869  Questions
5870    Choices
5871   Answers
5872    627
5873Consider the grammar with the following translation rules and E as the start symbol.
5874  1. 200 2. 180 3. 160 4. 40
5875   3.0
5876 E → E1 # T { E.value = E1.value * T.value } | T{ E.value = T.value }
5877T → T1 & F { T.value = T1.value + F.value }
5878| F{ T.value = F.value } F → num { F.value = num.value }
5879Compute E.value for the root of the parse tree for the expression: 2 # 3 & 5 # 6 & 4.
5880     628
5881 Consider the grammar
5882S → (S) | a
5883Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3 respectively. The following relationship holds good
5884     1. n1<n2<n3 2. n1=n3<n2 3. n1=n2=n3 4. n1>n2>n3
5885     2.0
5886    629
5887  Consider the intermediate code given below:
5888  1.
58895 and 7 2.
58906 and 7 3.
58915 and 2 4.
58927 and 8
5893   2.0
5894 1. i = 1
58952. j = 1
58963. t1 = 5 * i
58974. t2 = t1 + j
58985. t3 = 4 * t2
58996. t4 = t3
59007. a[t4] =
59018. j = j +
59029. if j <=
590310. i = i + 1
590411. if i < 5 goto(2)
5905–1
59061
59075 goto(3)
5908The number of nodes and edges in the control-flow-graph constructed for the above code, respectively, are
5909       630
5910Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is:
5911    1.
5912mn
59132.
5914m+n
59153. (m+n)/2 4. 2(m+n)
5916     1.0
5917     631
5918  Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is:
5919    1.
5920mn
59212. m+n 3.
5922(m + n) / 2 4.
59232(m + n)
5924     1.0
5925   632
5926  Consider the regular language L = (111 + 11111)*. The minimum number of states in any DFA accepting this languages is:
5927     1. 3 2. 5 3. 8 4. 9
5928    4.0
5929 
5930   S.NO.
5931  Questions
5932    Choices
5933   Answers
5934    633
5935Consider the relation R1(employee_name, project_name, dependent_name). If {{employee_name -->-> project_name}, {employee_name -->-> dependent_name}}, what is the highest normal form it satisfies?
5936  1. 2NF 2. 3NF 3. BCNF 4. 4NF
5937   1.0
5938     634
5939  Consider the translation scheme shown below
5940    1. 9+5+2 2. 95+2+ 3. 952++ 4. ++952
5941     2.0
5942 S→TR
5943R → + T {print ('+');} R | ε T → num {print (num.val);}
5944Here num is a token that represents an integer and num.val represents the corresponding integer value. For an input string '9 + 5 + 2', this translation scheme will print
5945   635
5946   Consider two strings A ='qpqrr' and B = 'pqprqrp'. Let x be the length of the LCS between A and B and let y be the number of such longest common subsequences between A and B. Then x + 10y =
5947     1.42 2.34 3.32 4.30
5948    2.0
5949    636
5950Count function in SQL returns the number of
5951  1.
5952values
59532.
5954distinct values 3.
5955groups
59564.
5957columns
5958   1.0
5959     637
5960  CPU Scheduling is the basis of _________ operating system
5961    1.
5962Batch
59632.
5964Real Time
59653. Multi-programming 4.
5966network
5967     2.0
5968     638
5969  create table student_$( id number(4), namee varchar2(10)); reponse would be
5970    1.
5971Error
59722.
5973Table created
59743.
5975Table created with error 4.
5976Table created with data
5977     2.0
5978   639
5979   Creating additional function similar to template function is called
5980     1.implicit specialization 2.explicit specialization 3.abstraction 4.template overriding
5981    4.0
5982   640
5983Cross-compiler is a compiler
5984   1.which is written in a language that is same as the source language. 2.that runs on one computer but produces object code for different type of computer. 3.that generates object code for its host machine. 4.which is written in a language that is different from the source language.
5985  2.0
5986 
5987   S.NO.
5988  Questions
5989    Choices
5990   Answers
5991    641
5992Cryptanalysis is used
5993  1.
5994to find some insecurity in a cryptographic scheme 2.
5995to increase the speed
59963.
5997to encrypt the data
59984.
5999none of the mentioned
6000   1.0
6001     642
6002  Cryptographic hash function takes an arbitrary block of data and returns
6003    1.
6004fixed size bit string
60052.
6006variable size bit string 3.
6007both (a) and (b)
60084.
6009None
6010     1.0
6011   643
6012   Currently there is no single standard file type that can be used to play audio using the audio element consistently on all browsers. Which is the solution that the audio element provides to resolve this conflict?
6013     1.Use JavaScript to determine the web browser in use 2.Use Adobe Flash to play the audio 3.Include multiple audio file formats in the src attribute 4.No Solution
6014       644
6015 1.0
6016    1.
6017rely on basis path testing
60182.
6019exercise the logical conditions in a program module
60203.
6021select test paths based on the locations and uses of variables
60224.
6023focus on testing the validity of loop constructs
6024    1.0
6025    645
6026Data independence means
6027  1.
6028data is defined separately and not included in programs.
60292.
6030programs are not dependent on the physical attributes of data 3.
6031programs are not dependent on the logical attributes of data 4.
6032programs are not dependent on both physical and logical attributes of data
6033   4.0
6034   646
6035   Data Members of the base class that are marked private:
6036     1.does exist in memory when the object of the derived class is created 2.exist in memory when the object of the derived class is created
6037the derived class 3.are visible in the derived class 4.are directly accessible in the derived class
6038    2.0
6039   647
6040 Data Members of the base class that are marked private:
6041    1.does exist in memory when the object of the derived class is created 2.exist in memory when the object of the derived class is created
6042the derived class 3.are visible in the derived class 4.are directly accessible in the derived class
6043   2.0
6044    648
6045Data Store Symbol in DFD represents a
6046  1.
6047Physical file
60482.
6049Data Structure 3.
6050Logical file 4.
6051ALL
6052   2.0
6053   649
6054  DB, DW and DD directives are used to place data in particular location or to simplyallocate space without preassigning anything to space. The DW and DD directories areused to generate
6055    1.f ull address of labels 2.offsets of full address of labels and variables 3.full address of variables 4.offsets
6056   2.0
6057 
6058   S.NO.
6059  Questions
6060    Choices
6061   Answers
6062   650
6063 DCL stands for
6064    1.
6065Data Control Language 2.
6066Data Console Language 3.
6067Data Console Level
60684.
6069Data Control Level
6070    1.0
6071    651
6072Demand paged memory allocation
6073  1.
6074allows the virtual address space to be independent of the physical memory
60752.
6076allows the virtual address space to be a multiple of the physical memory size
60773.
6078allows deadlock to be detected in paging schemes 4.
6079is present only in Windows NT
6080   1.0
6081   652
6082   Desirable properties of relational database design include
6083     1.All of the options
60842.minimizing update anomalies 3.minimizing redundancy
60854.minimizing insertion/deletion anomalies
6086    1.0
6087    653
6088Direction flag is used with
6089  1.
6090String instructions
60912.
6092Stack instructions.
60933.
6094Arithmetic instructions 4.
6095Branch instructions
6096   1.0
6097   654
6098   Divide and conquire mechanism is used in
6099     1.selection sort 2.merge sort 3.quick and merge sorts 4.indexed sequential search
6100    3.0
6101    655
6102DML is provided for
6103  1.
6104Description of logical structure of database.
61052.
6106Addition of new structures in the database system. 3.
6107Manipulation & processing of database.
61084.
6109Definition of physical structure of database system.
6110   3.0
6111     656
6112  Drop SQL clause
6113    1.
6114Drops only the values from the table
61152.
6116drops structure of the table along with values 3.
6117None of the options
61184.
6119changes the structure of the table
6120     2.0
6121   657
6122  Duality principle is used when SE is
6123    1.square 2.symmetric 3.asymmetricd 4.translated
6124   2.0
6125 
6126   S.NO.
6127  Questions
6128    Choices
6129   Answers
6130    658
61311.0
6132  1.
6133applications, data, technology infrastructure
61342.
6135communications, organization, financial infrastructure 3.
6136network, database, reporting structure
61374.
6138systems, requirements, data structure
6139   1.0
6140   659
6141   Each counter of IC 8254 can work in --------------differnt modes of operation
6142     1.6 2.5 3.4 4.3
6143    1.0
6144    660
6145ElGamal encryption system is
6146  1.
6147symmetric key encryption algorithm 2.
6148asymmetric key encryption algorithm 3.
6149not an encryption algorithm
61504.
6151none of the mentioned
6152   2.0
6153     661
6154  EPROM is generally erased by using
6155    1.
6156Ultraviolet rays
61572.
6158infrared rays
61593.
616012 V electrical pulse 4.
616124 V electrical pulse
6162     1.0
6163     662
6164  Ethernet in metropolitan area network (MAN) can be used as
6165    1.
6166pure ethernet
61672.
6168ethernet over SDH
61693.
6170ethernet over MPLS
61714.
6172combination of all of the above mentioned
6173     4.0
6174   663
6175   3.0
6176      1.
6177reduce the granularity of the plan 2.
6178analyze requirements in depth
61793.
6180get all team members to "sign up" to the plan
61814.
6182begin design
6183     3.0
6184   664
61852.0
6186   1.
6187Are not iterative in nature
61882.
6189Can easily accommodate product requirements changes 3.
6190Generally produce throwaway systems
61914.
6192Are not specific to applications
6193   2.0
6194 
6195   S.NO.
6196  Questions
6197    Choices
6198   Answers
6199   665
6200 External Fragmentation of the file system
6201    1. can be avoided by paging
62022. occurs only if the file system is used improperly 3. can be removed by compaction
62034.can be avoided by Segmentation
6204   4.0
6205    666
6206Find the output
6207#include < stdio.h > int main()
6208{
6209int tally=0; for(;;)
6210{
6211if(tally==10) break;
6212printf("%d ",++tally); }
6213return 0; }
6214  1.
62150 1 2 3 4 5 6 7 8 9 10 2.
62160 1 2 3 ... infinte times 3.
62171 2 3 4 5 6 7 8 9 10
62184.
6219123456789
6220   3.0
6221   667
6222   Find the output #include <stdio.h>
6223int main() {
6224int x=65;
6225const unsigned char c=(int)x;
6226printf("%c\n",c);
6227return 0; }
6228      1. Error 2.
622965
62303.
6231A
62324. NULL
6233     3.0
6234   668
6235 Find the output
6236#include <stdio.h> struct sample
6237{
6238int a=0;
6239char b='A'; float c=10.5;
6240};
6241int main() {
6242struct sample s; printf("%d,%c,%f",s.a,s.b,s.c); return 0;
6243}
6244    1.
6245Error
62462.0,A,10.5 3. 0,A,10.500000
62474.
6248No Error, No Output
6249    1.0
6250   669
6251Find the output:
6252#include <stdio.h> int main()
6253{
6254int a=100; printf("%d\n"+1,a); printf("Value is = %d"+3,a); return 0;
6255}
6256   1.
6257Error
62582.
6259101,
6260Value is = 103 3.
6261d
6262ue is = 100
62634.
6264100
6265100
6266   3.0
6267 
6268   S.NO.
6269  Questions
6270    Choices
6271   Answers
6272    670
6273Find the output:
6274#include <stdio.h> int main()
6275{
6276int a=23;
6277; ;printf("%d",a); ;
6278return 0; }
6279  1.
628023
62812. Error 3. ;23; 4. ;23
6282   1.0
6283     671
6284  Find the output:
6285#include <stdio.h> void main()
6286{
6287const char var='A'; ++var; printf("%c",var);
6288}
6289    1.
6290B
62912.
6292A
62933. ERROR 4.
629466
6295     3.0
6296     672
6297  FIND THE OUTPUT:
6298#include <stdio.h> void main()
6299{
6300int x=10; x+=(x++)+(++x)+x; printf("%d",x);
6301}
6302    1. 44 2. 45 3. 46 4. 47
6303     2.0
6304     673
6305  Find the output:
6306#include <stdio.h> void main()
6307{
6308int x=(20 || 40 ) && (10);
6309printf("x= %d",x); }
6310    1.
6311x= 60 2.
6312x= 70 3.
6313x= 0 4.
6314x= 1
6315     4.0
6316     674
6317  Find the output:
6318#include <stdio.h> void main()
6319{
6320char var=10;
6321printf("var is = %d",++var++); }
6322    1.
6323ERROR: can not modify var. 2.
6324ERROR: L-Value required
63253.
632612
63274.
6328ERROR: Expression syntax
6329     2.0
6330   675
6331   First derivative approximation says that values of constant intensities must be
6332     1.1 2.0 3.positive 4.negative
6333    2.0
6334    676
6335Flip-flop excitation tables shows that
6336  1.For the given PS and NS what will be the inputs 2.For the given PS and NS what will be the outputs 3.For the given PS and NS what will be the type of flip-flops 4.For the given PS and NS what will be the values of NS and PS respectively
6337   4.0
6338   677
6339  Following can be used to implement a SOP function without changing it into minterms
6340    1.MUX 2.PLA 3.ROM 4.DeMUX
6341   4.0
6342 
6343   S.NO.
6344  Questions
6345    Choices
6346   Answers
6347    678
6348For a well understood data processing application it is best to use
6349  1.
6350The waterfall model 2.
6351prototyping model 3.
6352the evolutionary model 4.
6353the spiral model
6354   1.0
6355   679
6356   For purposes of behavior modeling a state is any
6357      1. 3.0 2.
6358data object hierarchy.
63593.
6360observable mode of behavior.
63614.
6362well defined process.
6363     3.0
6364    680
6365Foreign Key is
6366  1.
6367A field in a table that matches a key field in another table
63682.
6369A field in a table that contains data that is also contained elsewhere in another table
63703.
6371A key that consists of more than one field
63724.
6373A field in a table that has the same name as a key field in another table
6374   1.0
6375   681
6376   Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the minimum number of bits, i will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
6377      1. i=2 2. i=3 3. i=4 4. i=5
6378     4.0
6379    682
6380FTP server listens for connection on port number
6381  1. 20 2. 21 3. 22 4. 23
6382   2.0
6383   683
6384   Functions that combines to produce Æ’(x,y)
6385     1.illumination and frequency 2.intensity and reflectance 3.illumination and radiance 4.illumination and reflectance
6386    4.0
6387   684
6388Generally Dynamic RAM is used as main memory in a computer system as it______.
6389   1.
6390Consumes less power 2.
6391has higher speed 3.
6392has lower cell density 4.
6393needs refreshing circuitry
6394   2.0
6395 
6396   S.NO.
6397  Questions
6398    Choices
6399   Answers
6400    685
6401Generic process models are:
6402  1.
6403waterfall, componet-based, iterative
64042.
6405waterfall, structural, component-based
64063.
6407sequential, waterfall, iterative
64084.
6409component-based, object-oriented, iterative
6410   4.0
6411     686
6412  Given a comma-separated list of values in a string, which function from the given list can create an array of each individual value with a single call in PHP?
6413    1.
6414strstr( )
64152.
6416extract
64173. explode( ) 4.
6418strtok( )
6419     3.0
6420   687
6421   Given a hash table T with 25 slots that stores 2000 elements, the load factor a for T is_____
6422     1.80 2.0.0125 3.8000 4.1.25
6423    2.0
6424    688
6425Given a variable $email containing the string user@example.com, which of the following PHP statements would extract the string example.com?
6426  1.
6427substr($email, strpos($email, "@"));
64282.
6429strstr($email, "@");
64303.
6431strchr($email, "@");
64324.
6433substr($email, strpos($email, "@")+1);
6434   4.0
6435     689
6436  Given an array that represents elements of arithmetic progression in order. It is also given that one element is missing in the progression, the worst case time complexity to find the missing element efficiently is:
6437    1.theta(n) 2.theta(nLogn) 3.theta(Logn) 4.theta(1)
6438     3.0
6439   690
6440   Given CF=0, BX=00111011 01110101 ROR BX,1. The result is
6441     1.CF=1 BX=10011101 10111010 2.CF=1 BX=10100111 01101110 3.CF=0 BX=01001110 11011101 4.CF=0 BX=01010011 10110111
6442    1.0
6443    691
6444Given the basic ER and relational models, which of the following is INCORRECT?
6445  1.
6446An attributes of an entity can have more that one value
64472.
6448An attribute of an entity can be composite
64493.
6450In a row of a relational table, an attribute can have more than one value 4.
6451In a row of a relational table, an attribute can have exactly one value or a NULL value
6452   3.0
6453     692
6454  Given the Code segment CS = 1000H and the offset BX=0050H. Calculated physical address is --- -------
6455    1.10000H 2.10050H 3.11050H 4.11000H
6456     2.0
6457     693
6458  Given the Extra segment ES = 52B9H and the offset BX=D470H. Calculated physical address is -- --------
6459    1.60000H 2.70000H 3.11000H 4.11050H
6460     4.0
6461   694
6462   Given the frequency f=1.5MHZ for 8253 timer the value of time period T is
6463     1.10ms 2.0.66us 3.1ms 4.100ms
6464    2.0
6465   695
6466Given the functional dependencies, {AB -> CDE and A -> E}, for relation schema R = (A,B,C,D,E) we can infer the following:
6467   1.
6468A is a key for R 2.
6469BE is a key for R 3.
6470AB is a key for R 4.
6471B is a key for R
6472   3.0
6473 
6474   S.NO.
6475  Questions
6476    Choices
6477   Answers
6478   696
6479 Given the language L = {ab, aa, baa}, which of the following strings are in L*?
6480  1.
64811, 2 and 3 2.
64821, 2 and 4 3.
64831, 3 and 4 4.
64842, 3 and 4
6485    2.0
6486  1) abaabaaabaa 2) aaaabaaaa
64873) baaaaabaaaab 4) baaaaabaa
6488     697
6489Grant and revoke are ....... statements.
6490  1. DDL 2. TCL 3. DCL 4. DML
6491   3.0
6492     698
6493  High speed ethernet works on
6494    1.
6495coaxial cable
64962.
6497twisted pair cable
64983.
6499optical fiber
65004.
6501none of the mentioned
6502     3.0
6503     699
6504  How can we count the number of elements in an array?
6505    1.Using sizeof() 2.count() 3.Writing a user defined function and using array_search() 4.using sizeof() and count()
6506     4.0
6507     700
6508  How can you specify default text in an input field?
6509    1.Using JavaScript 2.Using the 'text' attribute 3.Using the 'placeholder' element 4.Using the 'placeholder' attribute
6510     4.0
6511   701
6512   How do I create PHP arrays in a HTML ?
6513     1.< input name= MyArray[]/> 2.< input ="MyArray[]" /> 3.< input name="MyArray[]" /> 4.< input MyArray[] />
6514    3.0
6515    702
6516How do substring() and substr() differ?
6517  1.One is not a method of the String object. 2.substr() takes three arguments, substring() only two. 3.Only one accepts a desired string length as an argument. 4.Besides the spelling, nothing.
6518   3.0
6519   703
6520   How do we access the value of 'd' later? $a = array( 'a', 3 => 'b', 1 => 'c', 'd' );
6521     1.$a[0] 2.$a[1] 3.$a[2] 4.$a[4]
6522    4.0
6523    704
6524How do we prevent margins, borders and padding from overlapping?
6525  1.Setting zero paddings and margins 2.By displaying our list as block elements 3.Using table cells 4.By displaying our list as inline elements
6526   2.0
6527     705
6528  How do we submit form data without a Sumbit button?
6529    1.Using header() function 2.Using Javascript 3.Using fdf_set_submit_form_action() fucntion 4.using header() and javascript
6530     4.0
6531     706
6532  How do you check queue is full in array implementation
6533    1.if(rear==size) 2.if(front==size) 3.if(rear==-1) 4.if(front==-1)
6534     1.0
6535     707
6536  How do you get information from a form that is submitted using the "get" method?
6537    1.Request.QueryString; 2.$_GET[]; 3.Request.Form; 4.$_POST[];
6538     2.0
6539     708
6540  How is a J-K flip-flop made to toggle?
6541    1.J = 0, K = 0 2.J = 0, K = 1 3.J = 1, K = 0 4.J = 1, K = 1
6542     4.0
6543   709
6544   How many bits are required to store one BCD digit?
6545     1.1 2.2 3.3 4.4
6546    4.0
6547    710
6548How many diagrams are here in Unified Modelling Language?
6549  1.
6550six
65512. seven 3. eight 4. nine
6552   4.0
6553     711
6554  How many different states does a 3-bit asynchronous counter have?
6555    1.2 2.4 3.8 4.16
6556     3.0
6557     712
6558  How many flip-flops are required to construct a mod10 counter?
6559    1.10 2.8 3.5 4.4
6560     4.0
6561     713
6562  How many flip-flops are required to make a MOD-32 binary counter?
6563    1.3 2.4 3.5 4.6
6564     3.0
6565   714
6566  How many instances of an abstract class can be created?
6567    1.13 2.5 3.1 4.0
6568   4.0
6569 
6570   S.NO.
6571  Questions
6572    Choices
6573   Answers
6574    715
6575How many minimum states are required in a DFA to find whether a given binary string has odd number of 0's or not, there can be any number of 1's.
6576  1. 1 2. 2 3. 3 4. 4
6577   2.0
6578     716
6579  How many nodes in a tree have no ancestors.
6580    1.2 2.n 3.1 4.0
6581     3.0
6582     717
6583  How many operating modes are available in 8253A.
6584    1.1 2.2 3.6 4.3
6585     3.0
6586   718
6587   How many transistors does the 8086 have
6588     1.29,000 2.10,000 3.129,000 4.110,000
6589    1.0
6590    719
6591How to create a Date object in JavaScript?
6592  1.dateObjectName = new Date([parameters]) 2.dateObjectName.new Date([parameters]) 3.dateObjectName := new Date([parameters]) 4.dateObjectName Date([parameters])
6593   1.0
6594   720
6595   How to create a memory without a name during the execution of the program?
6596     1.malloc() 2.Queue 3.stack 4.list
6597    1.0
6598    721
6599How will you free the allocated memory ?
6600  1.remove(var-name); 2.free(var-name); 3.delete(var-name); 4.dalloc(var- name);
6601   2.0
6602   722
6603   How will you handle the overflow condition of a linked queue through code(note: new_node is a newly created node in a memory)
6604     1.if(rear==size) 2.if(new_node==0) 3.if(front==size) 4.if(new_node==null)
6605    1.0
6606    723
6607HTTP client requests by establishing a __________ connection to a particular port on the server.
6608  1.
6609user datagram protocol
66102.
6611transmission control protocol 3.
6612broader gateway protocol
66134.
6614RIP
6615   2.0
6616   724
6617   IC 8237 has ------------------many pins
6618      1. 40 2. 28 3. 24 4. 20
6619     1.0
6620    725
6621IC 8257 has --------------------many channels for data transfer
6622  1. 1 2. 2 3. 3 4. 4
6623   4.0
6624     726
6625  Identify different segments in a program
6626    1.only code segment 2.data and code segment 3.only data segment 4.data, code, stack and extra segments
6627     4.0
6628     727
6629  Identify the accurate control word for operate counter 0, Read/Write LSB only, Mode 2, BCD countdown.
6630    1.00010111B 2.0001X111B 3.00010101B 4.00110111B
6631     2.0
6632     728
6633  Identify the addressing mode for the instruction MOV AH,47H
6634    1.Immediate addressing mode 2.Direct addressing mode 3.Based addressing mode 4.Indirect addressing mode
6635     2.0
6636   729
6637  Identify the proper data direction and modes of operation of the 8255 ports if the control word written into it is 9BH.
6638    1.Port A as output 2.Port C lower as output 3.Port C upper as input 4.Port B as output
6639   3.0
6640 
6641   S.NO.
6642  Questions
6643    Choices
6644   Answers
6645    730
6646If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum number of hosts per subnet?
6647  1. 1024 2. 1023 3. 2046 4. 2047
6648   3.0
6649   731
6650   If a class C is derived from class B, which is derived from class A, all through public inheritance, then a class C member function can access
6651     1.protected and public data only in C and B 2.protected and public data only in C. 3.private data in A and B. 4.protected data in A and B.
6652    4.0
6653   732
6654 If a constructor function is defined in private section of a class, then
6655    1.The object cannot be created 2.Only its member functions and friends may declare objects of the class 3.Only its friends may declare objects of the class 4.Only its member functions may declare objects of the class
6656   2.0
6657    733
6658If AL= 7FH and instruction ADD AL,1 is given, specify the contents of the six status flag
6659  1.CF=0,PF=0,AF=1,ZF=0,SF=1,OF=1
6660. 2.CF=0,PF=1,AF=0,ZF=0,SF=1,OF=1 3.CF=0,PF=1,AF=1,ZF=O,SF=1,OF=1 4.CF=0,PF=0,AF=1,ZF=O,SF=1,OF=0
6661   4.0
6662   734
6663   If AL=C0H, Determine the content of the register AL after SAL AL,1 instruction is executed.
6664     1.E0H 2.80H 3.0CH 4.0EH
6665    2.0
6666    735
6667If all page frames are initially empty, and a process is allocated 3 page frames in real memory and references its pages in the order 1 2 3 2 4 5 2 3 2 4 1 and the page replacement is FIFO, the total number of page faults caused by the process will be __________
6668  1. 10 2. 7 3. 8 4. 9
6669   4.0
6670     736
6671  If all tasks must be executed in the same time-span, what type of cohesion is being exhibited?
6672    1.
6673Functional Cohesion 2.
6674Temporal Cohesion 3.
6675Functional Cohesion 4.
6676Sequential Cohesion
6677     2.0
6678   737
6679   If class A is friend of class B and if class B is friend of class C, which of the following is true?
6680     1.Class C is friend of Class A 2.Class A is friend of Class C 3.Class A and Class C don’t have any friend relationship 4.Class A and Class C are mutual friends
6681    4.0
6682    738
6683If every requirement stated in the Software Requirement Specification (SRS) has only one interpretation, SRS is said to be
6684  1. correct. 2.
6685unambiguous. 3.
6686consistent. 4. verifiable.
6687   2.0
6688   739
6689   If inspected in a browser, what will be the total width of the div in the following code snippet? #container { width: 600px; border: 2px solid #CCCCCC; padding: 30px 20px; margin: 20px 10px 40px 10px;}
6690     1.664px 2.660px 3.644px 4.600px
6691    1.0
6692   740
6693If L and L' are recursively enumerable, then L is
6694   1.
6695regular
66962.
6697context-free
66983. context-sensitive 4.
6699recursive
6700   4.0
6701 
6702   S.NO.
6703  Questions
6704    Choices
6705   Answers
6706    741
6707If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using Thompson construction will have ------------- states.
6708  1. n 2.
6709n+1 3. n+2 4. n-1
6710   2.0
6711   742
6712   If p and q are assigned the values 2 and 3 respectively then the statement P = q++
6713     1.assigns a value 5 to p 2.assigns a value 3 to p 3.gives an error message 4.assigns a value 4 to p
6714    2.0
6715    743
6716If para1 is the DOM object for a paragraph, what is the correct syntax to change the text within the paragraph?
6717  1."New Text"? 2.para1.value="New Text"; 3.para1.firstChild.nodeValue= "New Text"; 4.para1.nodeValue="New Text";
6718   2.0
6719   744
6720   If the class name is X, what is the type of its "this" pointer?
6721     1.X* 2.const X* const 3.X& 4.X* const
6722    3.0
6723    745
6724If the disk size is 2^30 bytes and block size is 2^12 bytes then find how many such blocks are there?
6725  1. 2^42 2. 2^18 3. 2^360 4. 2^30
6726   2.0
6727   746
6728   If the PIC outputs the type number of C8H, the CPU will retrive the vector stored in the address --- -----------
6729     1.00320H - 00323H 2.00324H - 00327H 3.00223H - 00226H 4.00140H - 00143H
6730        747
6731 If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order _____ bits of a logical address designate the page number, and the ____ low order bits designate the page offset.
6732    1.
6733m,n
67342.
6735n,m
67363. m-n,m 4. m-n,n
6737   4.0
6738     748
6739  If there are n relations how many number of join conditions has to be applied to retrieve the data from all the n relations?
6740    1.
6741N+1
67422.
6743N
67443.
6745N-1
67464.
6747A Number in the range 0 toN.
6748     3.0
6749   749
6750   If we create a file by ‘ifstream’, then the default mode of the file is _________
6751     1.ios :: out 2.ios :: in 3.ios :: app 4.ios :: binary
6752    1.0
6753   750
6754If X->Y and X->Z then
6755   1.
6756Y->Z
67572.
6758Z->Y
67593.
6760X->YZ
67614.
6762Doesn't hold
6763   3.0
6764 
6765   S.NO.
6766  Questions
6767    Choices
6768   Answers
6769    751
6770If x--> y then y --> x. This statement is
6771  1.
6772True
67732.
6774False
67753.
6776Can't Say
67774.
6778Doesn't hold
6779   3.0
6780     752
6781  IF Y is a subset of X then
6782    1.
6783X --> Y
67842.
6785Y -->X
67863.
6787Y -->--> X
67884.
6789X is a sub set of Y
6790     2.0
6791   753
6792   If you have an empty queue and you insert characters ‘r’, ‘a’, ‘t’ (in this order only), what is the order of the characters when you dequeue all the elements?
6793     1.‘r’, ‘a’, ‘t’ 2.‘t’, ‘a’, ‘r’ 3.‘r’, ‘t’, ‘a’ 4.‘t’, ‘r’, ‘a’
6794    1.0
6795    754
6796IMUL source is a signed _________
6797  1. multiplication 2.
6798addition
67993.
6800subtraction
68014.
6802division
6803   1.0
6804     755
6805  In 8086 microprocessor one of the following statements is not true
6806    1.Coprocessor is interfaced in MAX mode 2.Coprocessor is interfaced in MIN mode 3.I/O can be interfaced in MAX / MIN mode 4.Supports pipelining
6807     2.0
6808   756
6809   In 8086 microprocessor the following has the highest priority among all type interrupts
6810     1.TYPE 255 2.DIV 0 3.NMI 4.OVER FLOW
6811    3.0
6812    757
6813In 8086, Example for Non maskable interrupts are ________.
6814  1. TRAP 2. RST6.5 3. INTR 4. RST6.6
6815   1.0
6816     758
6817  In a bottom-up evaluation of a syntax directed definition, inherited attributes can
6818    1.
6819always be evaluated
68202.
6821be evaluated only if the definition is L-​attributed
68223.
6823be evaluated only if the definition has synthesized attributes 4.
6824never be evaluated
6825     2.0
6826   759
6827  In a circular linked list
6828    1.components are arranged hierarchically 2.there is no beginning and no end 3.forward and backward traversal within the list is permitted 4.components are arranged from top to bottom
6829   2.0
6830 
6831   S.NO.
6832  Questions
6833    Choices
6834   Answers
6835    760
6836In a compiler, keywords of a language are recognized during
6837  1.
6838parsing of the program
68392.
6840the code generation
68413.
6842the lexical analysis of the program 4.
6843dataflow analysis
6844   3.0
6845     761
6846  In a conceptual model for a university, which of the following could most appropriately be represented via a recursive relationship?
6847    1.
6848Student credit hours
68492.
6850Course prerequisites
68513.
6852Parking sticker assignments 4.
6853Final exam schedules
6854     2.0
6855   762
6856   In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is True?
6857     1.A tree has no bridge 2.A bridge cannot be part of a simple cycle 3.Every edge of a clique with size>=3 is a bridge (A clique is any complete subgraph of a graph) 4.A graph with bridges cannot have a cycle
6858    4.0
6859    763
6860In a DMA write operation the data is transferred
6861  1.
6862from I/O to memory 2.
6863from memory to I/O 3.
6864from memory to I/O 4.
6865from I/O to I/O
6866   1.0
6867   764
6868   In a microprocessor, the service routine for a certain interrupt starts from a fixed location
6869of memory which cannot be externally set, but the interrupt can be delayed or rejected. Such aninterrupt is
6870     1.maskable and non-vectored 2.non-maskable and vectored 3.maskable and vectored 4.non-maskable and non-vectored
6871    3.0
6872    765
6873In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?
6874  1.
6875For shortest path routing between LANs 2.
6876For avoiding loops in the routing paths 3.
6877For fault tolerance
68784.
6879For minimizing collisions
6880   2.0
6881   766
6882   In a syntax directed translation schema ,if value of an attribute of a node is function of the values of the attributes of its children , then it is called
6883     1.Inherited attributes 2.Synthesized attributes 3.Canonical atrributes 4.Derived atrributes
6884    2.0
6885   767
6886In a token ring network the transmission speed is 10^7 bps and the propagation speed is 200 metres/micro second. The 1-bit delay in this network is equivalent to:
6887   1.
6888500 metres of cable. 2.
6889200 metres of cable. 3.
689020 metres of cable. 4.
689150 metres of cable.
6892   3.0
6893 
6894   S.NO.
6895  Questions
6896    Choices
6897   Answers
6898    768
6899In a virtual memory environment
6900  1.
6901segmentation and page tables are stored in the cache and do not add any substantial overhead
69022.
6903slow down the computer system considerable
69043.
6905segmentation and page tables are stored in the RAM 4.
6906only page table is stored in cache
6907   1.0
6908     769
6909  In access lists and groups which one of the following is correct for the 'RWX' notation of the order 'group, owner, public'
6910    1. 111110001 2. 110111001 3. 001111110 4. 001110111
6911     2.0
6912     770
6913  In an array representation of binary tree, the left child of i th node is located at
6914    1.2i+2 2.(i-1)/2 3.(i-2)/2 4.2i+1
6915     4.0
6916   771
6917   In an array representation of binary tree, the right child of i th node is located at
6918     1.(i-2)/2 2.(i-1)/2 3.2i+2 4.2i+1
6919    3.0
6920    772
6921In an E-R diagram an entity set is represent by a
6922  1.
6923rectangle
69242.
6925ellipse
69263.
6927diamond box 4.
6928circle
6929   1.0
6930     773
6931  In an E-R diagram attributes are represented by
6932    1. rectangle 2.
6933square
69343.
6935ellipse
69364. triangle
6937     3.0
6938   774
6939   In any undirected graph, the sum of the degrees of all nodes is:
6940     1.is twice number of edges 2.is always ODD 3.need not be even 4.must be even
6941    1.0
6942    775
6943In Assembly language programming, minimum number of operands required for an instruction is/are
6944  1. Zero 2. One 3. Two 4. Three
6945   1.0
6946     776
6947  In asynchronous serial communication the physical layer provides
6948    1.start and stop signalling 2.flow control
69493.both (a) and (b)
69504.none of the mentioned
6951     3.0
6952   777
6953  In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?
6954    1.To make sure that it is still complete binary tree 2.It is the easiest possible way 3.Because left and right subtree might be missing 4.maximum value is contained by the root node
6955   1.0
6956 
6957   S.NO.
6958  Questions
6959    Choices
6960   Answers
6961   778
6962 In case of entity integrity, the primary key may be
6963    1.not Null 2.Null
69643.a foreign key 4.any value
6965   1.0
6966    779
69673.0
6968  1.
6969cannot be a member of the software team 2.
6970cannot be a customer
69713.
6972controls and facilitates the process 4.
6973must be an outsider
6974   2.0
6975   780
6976   In context of OSI or TCP/IP computer network models, which of the following is false?
6977     1.Major difference between LAN and WAN is that the later uses switching element 2.Network layer is connection oriented 3.A repeater is used just to forward bits from one network to another one 4.A gateway is used to connect incompatible networks
6978    2.0
6979   781
6980 In cryptography, the order of the letters in a message is rearranged by
6981    1.
6982transpositional ciphers 2.
6983substitution ciphers
69843.
6985both (a) and (b)
69864.
6987none of the mentioned
6988    1.0
6989    782
6990In Ethernet when Manchester encoding is used, the bit rate is:
6991  1.
6992Half the baud rate.
69932.
6994Twice the baud rate. 3.
6995Same as the baud rate. 4.
6996Grows exponentially
6997   1.0
6998     783
6999  In FTP protocol, client contacts server using ____ as the transport protocol.
7000    1.
7001transmission control protocol
70022.
7003user datagram protocol
70043.
7005datagram congestion control protocol 4.
7006stream control transmission protocol
7007     1.0
7008   784
7009   In general tree to binary tree conversion, the two links of the binary tree node points to
7010     1.two leaf nodes in the general tree 2.its right child and sibling in the genral tree 3.its left child and sibling in the general tree 4.its left and right child in the general tree
7011    4.0
7012   785
7013In HTTP pipelining
7014   1.
7015multiple HTTP requests are sent on a single TCP connection without waiting for the corresponding responses
70162.
7017multiple HTTP requests can not be sent on a single TCP connection
70183.
7019multiple HTTP requests are sent in a queue on a single TCP connection 4.
7020none of the mentioned
7021   1.0
7022 
7023   S.NO.
7024  Questions
7025    Choices
7026   Answers
7027    786
7028In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.
7029  1.
7030Shortest Remaining Time Next (SRTN) Scheduling 2.
7031Priorities Based Preemptive Scheduling
70323.
7033Round Robin Scheduling
70344.
7035First Come First Serve
7036   3.0
7037   787
7038   In javascript, RegExp Object Method test() is used to search a string and returns _________
7039     1.true or false 2.found value 3.index 4.Matched or not matched
7040    1.0
7041   788
7042 In linear search algorithm the Worst case occurs when
7043    1.The item is somewhere in the middle of the array 2.The item is not in the array at all 3.The item is the last element in the array 4.The item is the last element in the array or is not there at all
7044   4.0
7045    789
7046In max mode, control bus signal So,S1 and S2 are sent out in ____________ form
7047  1.
7048shared
70492. decoded 3. encoded 4. unshared
7050   3.0
7051     790
7052  In mysql_fetch_array(),if two or more columns of the result have the same field names, what action is taken?
7053    1.
7054the first column will take precedence 2.
7055the column is skipped
70563.
7057the last column will take precedence 4.
7058an error is thrown.
7059     3.0
7060   791
7061   In operator precedence parsing , precedence relations are defoned
7062     1.To delimit the handle 2.For all pair of terminals 3.For all pair of non terminals 4.Only for a certain pair of terminals
7063    3.0
7064    792
7065In PHP, array values are keyed by ______ values (called indexed arrays) or using ______ values (called associative arrays). Of course, these key methods can be combined as well.
7066  1.
7067Float, string
70682.
7069Positive number, negative number 3.
7070String, Boolean
70714.
7072Integer, String
7073   4.0
7074   793
7075   In PHP, which of the following function is used to insert content of one php file into another php file before server executes it
7076     1.include[] 2.#include() 3.include() 4.#include{}
7077    3.0
7078    794
7079In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of, Starvation ? low priority processes may never execute, is resolved by __________.
7080  1.
7081Terminating the process. 2.
7082Aging
70833.
7084Mutual Exclusion
70854.
7086Semaphore
7087   2.0
7088   795
7089  In software engineering development, if there are no applicable theories, people often use adhoc approach.
7090    1. True 2. False 3. 4.
7091   1.0
7092 
7093   S.NO.
7094  Questions
7095    Choices
7096   Answers
7097   796
7098 2.0
7099    1. true 2. false 3. 4.
7100   1.0
7101    797
7102In the absolute the addressing mode
7103  1.
7104The operand is inside the instruction
71052.
7106The address of the operand is inside the instruction
71073.
7108The register containing the address of the operand is specified inside the instruction
71094.
7110The location of the operand is implicit
7111   1.0
7112     798
7113  In the architecture of a database system external level is the
7114    1.view level 2.conceptual level 3.logical level 4.physical level
7115     1.0
7116     799
7117  In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is True?
7118    1.In both AST and CFG, let node N2 be the successor of node N1. In the input program, the code corresponding to N2 is present after the code corresponding to N1 2.For any input program, neither AST nor CFG will contain a cycle 3.Each node in AST and CFG corresponds to at most one statement in the input program 4.The maximum number of successors of a node in an AST and a CFG depends on the input program
7119     4.0
7120     800
7121  In the context of object-oriented software engineering a component contains
7122    4.0
7123     4.0
7124   801
7125   In the following code snippet, what is the correct value of the left margin? margin: 10px 5px 20px 15px;
7126     1.10px 2.5px 3.20px 4.15px
7127    4.0
7128    802
7129In the multi-programming environment, the main memory consisting of _________ number of process.
7130  1.
7131Greater than 100 2.
7132only one
71333.
7134Greater than 50 4.
7135More than one
7136   4.0
7137   803
7138   In the network HTTP resources are located by
7139      1.
7140uniform resource identifier 2.
7141unique resource locator
71423.
7143unique resource identifier 4.
7144unique resource identifier
7145     1.0
7146   804
7147In the operation read_item(x), what does x mean?
7148   1.
7149a file
71502.
7151a record
71523.
7153a disk block
71544.
7155all of the options
7156   4.0
7157 
7158   S.NO.
7159  Questions
7160    Choices
7161   Answers
7162    805
7163In the running state
7164  1.
7165only the process which has control of the processor is found 2.
7166all the processes waiting for I/O to be completed are found 3.
7167all the processes waiting for the processor are found
71684.
7169everything in these options are found
7170   1.0
7171     806
7172  In the slow start phase of the TCP congestion control algorithm, the size of the congestion window .....................
7173    1.
7174does not increase
71752.
7176increases linearly
71773.
7178increases quadratically 4.
7179increases exponentially
7180     4.0
7181   807
7182   In the spiral model ‘risk analysis’ is performed
7183      1.
7184In the first loop
71852.
7186in the first and second loop 3.
7187In every loop
71884.
7189before using spiral model
7190     3.0
7191    808
7192In tunnel mode IPsec protects the
7193  1.
7194entire IP packet
71952.
7196IP header
71973.
7198IP payload
71994.
7200none of the mentioned
7201   1.0
7202   809
7203   In what type of coupling, the complete data structure is passed from one module to another?
7204     1.Control Coupling 2.Stamp Coupling 3.External Coupling 4.Content Coupling
7205    2.0
7206    810
7207In which addressing mode the operand is given explicitly in the instruction
7208  1. Absolute 2.
7209Immediate 3.
7210Indirect 4.
7211Direct
7212   2.0
7213   811
7214  In which case is it mandatory to provide a destructor in a class?
7215    1.Class for which copy constructor is defined 2.Class for which two or more than two objects will be created 3.Almost in every class 4.Class whose objects will be created dynamically
7216   4.0
7217 
7218   S.NO.
7219  Questions
7220    Choices
7221   Answers
7222    812
7223In which mode FTP, the client initiates both the control and data connections.
7224  1.
7225active mode
72262.
7227passive mode
72283.
7229active mode and passive mode 4.
7230none of the mentioned
7231   2.0
7232   813
7233   In which topology, if there are n devices in a network, each device has n-1 ports for cables?
7234     1.Mesh 2.Star 3.Ring 4.Bus
7235    1.0
7236    814
7237In which year, 8086 was introduced?
7238  1. 1978 2. 1979 3. 1977 4. 1981
7239   1.0
7240   815
7241   2.0
7242     1. TRUE 2. FALSE 3. 4.
7243    1.0
7244    816
7245In wireless distribution system
7246  1.
7247multiple access point are inter-connected with each other 2.
7248there is no access point
72493.
7250only one access point exists
72514.
7252none of the mentioned
7253   1.0
7254     817
7255  In wireless network an extended service set is a set of
7256    1.
7257connected basic service sets 2.
7258all stations
72593.
7260all access points
72614.
7262all nodes
7263     1.0
7264   818
7265  Information retrieval is faster from
7266     1.
7267Floppy disk 2.
7268Magnetic tape 3.
7269Hard disk
72704.
7271CD
7272    3.0
7273 
7274   S.NO.
7275  Questions
7276    Choices
7277   Answers
7278    819
7279Insert into Emp(101, ‘XXX’) gives the following error
7280  1.
7281missing Select keyword 2.
7282Missing Values
72833.
7284both of the errors
72854.
7286No of the errors
7287   2.0
7288     820
7289  int main() {
7290int x,y;
7291x=(100,200); y=100,200;
7292printf("x=%d,y=%d",x,y);
7293return 0; }
7294Find the output
7295      1. x=100,y=200 2. x=200,y=200 3.
7296ERROR
72974. x=200,y=100
7298     4.0
7299     821
7300  Interaction Diagram is a combined term for
7301    1.
7302Sequence Diagram + Collaboration Diagram
73032.
7304Activity Diagram + State Chart Diagram
73053.
7306Deployment Diagram + Collaboration Diagram 4.
7307None
7308     1.0
7309   822
7310   Internet Explorer uses ....................... property to create transparent images.
7311     1.-moz-opacity:x 2.filter: alpha(opacity=x) 3.filter: beta(opacity=x) 4.- IE-opac:y
7312    2.0
7313   823
7314 Interpolation search is an improved variant of binary search.
7315It is necessary for this search algorithm to work that data collection should be
7316    1.in sorted form and equally distributed 2.in sorted form and but not equally distributed 3.equally distributed but not sorted 4.unsorted and not evenly distributed
7317   1.0
7318    824
7319IPSec is designed to provide the security at the
7320  1.
7321transport layer 2.
7322network layer
73233.
7324application layer 4.
7325session layer
7326   2.0
7327   825
7328   It is difficult to design asynhronous sequential circuit because.
7329     1.External clock is to be provided 2.It is using Flip flops 3.It is more complex 4.Generally they involve stability problem
7330    4.0
7331   826
7332 It is ok to have a single ideal approach to develop a software.
7333    1. True 2. False 3. 4.
7334   2.0
7335    827
7336It would be ideal if all of computer science theories can be used in software engineering.
7337  1. False 2. True 3. 4.
7338   2.0
7339   828
7340  JavaScript RegExp Object has modifier 'i' to __________
7341    1.Perform case-sensitive matching 2.Perform case-insensitive matching 3.Perform both case-sensitive & case-insensitive matching 4.None of the these
7342   2.0
7343 
7344   S.NO.
7345  Questions
7346    Choices
7347   Answers
7348    829
7349Join is equal to
7350  1.
7351Cartesian Product
73522.
7353Combination of Union and Cartesian product
73543.
7355Combination of selection and Cartesian product
73564.
7357Combination of intersection and Cartesian product
7358   3.0
7359   830
7360   K-map follow following code for marking adjacent variables
7361     1.84-2-1
73622.Gray Code 3.2421 4.8421
7363    2.0
7364   831
7365 Let G be a weighted connected undirected graph with distinct positive edge weights.If every edge weight is increased by the same value, then which of the following statements is/are TRUE ?
7366P: Minimum spanning tree of G does not change. Q: Shortest path between any pair of vertices does not change
7367    1.
7368P Only
73692.
7370Q Only 3.
7371Neither P nor Q 4.
7372Both P and Q
7373    1.0
7374    832
7375Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2 do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model?
7376  1. 2 2. 3 3. 4 4. 5
7377   2.0
7378   833
7379   Let G be a graph with n vertices and m edges, What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represented using adjacency matrix
7380     1.O(n) 2.O(m+n) 3.O(mn) 4.O(n^2)
7381    4.0
7382    834
7383Let G be the CFG, l be the number of left most derivations, r be the number of right most derivations and P be the number of parse trees. Assume l , r and P are computed for a particular string. For a given CFG ‘G’ and given string ‘w’, what is the relation between l , P , r ?
7384  1.
7385l=P=r
73862. l<=P>=r 3. l>=P<=r 4. l<=P<=r
7387   1.0
7388   835
7389  Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error?
7390     1.
7391G(x) contains more than two terms
73922.
7393G(x) does not divide 1+x^k, for any k not exceeding the frame length 3.
73941+x is a factor of G(x)
73954.
7396G(x) has an odd number of terms.
7397    3.0
7398 
7399   S.NO.
7400  Questions
7401    Choices
7402   Answers
7403    836
7404Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
7405  1.
7406L1' is recursive and L2' is recursively enumer​able
74072.
7408L1' is recursive and L2' is not recursively enumerable 3.
7409L1' and L2' are recursively enumerable
74104.
7411L1' is recursively enumerable and L2' is recursive
7412   2.0
7413 L1' --> Complement of L1 L2' --> Complement of L2
7414     837
7415  Let P be a QuickSort Program to sort numbers in ascending order using the first element as pivot, Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4, 1, 5, 3, 2} respectively,Which one of the following holds?
7416    1.t1=5 2.t1>t2 3.t1 4.t1=t2
7417     2.0
7418   838
7419   Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ?
7420     1.T(n) = O(n) 2.T(n) = O(log2n) 3.T(n) = O( n) 4.T(n) = O(n2)
7421    3.0
7422    839
7423Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?
7424  1. n+1 2.
7425n
74263. n-1 4. 2n+1
7427   1.0
7428     840
7429  Local and loop optimization in turn provide motivation for
7430    1.Peephole optimization 2.DFA and Constant folding 3.Basic Code Analysis 4.Data flow analysis
7431.
7432     4.0
7433     841
7434  LOCK prefix is used most often
7435    1.during normal execution. 2.during DMA accesses 3.during interrupt servicing. 4.during memory accesses
7436     3.0
7437   842
7438   Logical addressing is used in _____ layer
7439     1.Network 2.Transport 3.Physical 4.Session
7440    1.0
7441   843
7442 1.0
7443    1.
7444rely basis path testing
74452.
7446exercise the logical conditions in a program module
74473.
7448select test paths based on the locations and uses of variables 4.
7449focus on testing the validity of loop constructs
7450    2.0
7451    844
7452Magnetic tapes are good storage media for
7453  1.
7454backup and low volume data
74552.
7456backup and high volume data
74573.
7458storing original but low volume data
74594.
7460storing original but high volume data
7461   2.0
7462   845
7463   Manager salary details are hidden from the employee. This is
7464     1.Conceptual level data hiding 2.Physical level data hiding 3.External level data hiding 4.None of mentioned
7465    1.0
7466   846
74671.0
7468   1. TRUE 2. FALSE 3. 4.
7469  2.0
7470 
7471   S.NO.
7472  Questions
7473    Choices
7474   Answers
7475    847
7476Match all items in Group 1 with correct options from those given in Group 2.
7477  1.
7478P-4. Q-1, R-2, S-3 2.
7479P-3, Q-1, R-4, S-2 3.
7480P-3, Q-4, R-1, S-2 4.
7481P-2, Q-1, R-4, S-3
7482   2.0
7483 Group 1
7484P. Regular expression Q. Pushdown automata R. Dataflow analysis S. Register allocation
7485Group 2
74861. Syntax analysis 2. Code generation 3. Lexical analysis 4. Code optimization
7487     848
7488  Match the following:
7489    1. a 2. b 3. c 4. d
7490     2.0
7491 List-I
7492A. Lexical analysis
7493List-II
74941. Graph coloring
74952. DFA minimization
74963. Post-order traversal
7497B. Parsing
7498C. Register allocation
7499D. Expression evaluation 4. Production tree
7500 Codes: ABCD
7501(a) 2 3 1 4
7502(b) 2 1 4 3
7503(c) 2 4 1 3
7504(d) 2 3 4 1
7505     849
7506 Memory elements in clocked sequential circuits are called.
7507     1.latches 2.gates 3.signals 4.flipflop
7508    4.0
7509    850
7510Memory unit accessed by content is called______
7511  1.
7512Read only memory
75132.
7514Programmable Memory 3.
7515Virtual Memory
75164.
7517Associative Memory
7518   4.0
7519   851
7520   Mode of communication in which transmission takes place in both directions, but only in one direction at a time is called________________
7521     1.simplex 2.four wired 3.full duplex 4.half-duplex
7522    4.0
7523    852
7524Modifying the software to match changes in the ever changing environment is called
7525  1.
7526adaptive maintenance 2.
7527corrective maintenance 3.
7528perfective maintenance 4.
7529preventive maintenance
7530   1.0
7531   853
7532  Most software continues to be custom built because
7533     1.
7534Component reuse is common in the software world.
75352.
75364.0Reusable components are too expensive to use. 3.
7537Software is easier to build without using someone else's components 4.
7538Off-the-shelf software components are unavailable in many application domains.
7539    1.0
7540 
7541   S.NO.
7542  Questions
7543    Choices
7544   Answers
7545    854
7546Multiple choice examination answer sheets can be evaluated automatically by
7547  1.
7548Optical Mark Reader
75492.
7550Optical Character Reader 3.
7551Magnetic tape reader
75524.
7553Magnetic ink character reader.
7554   1.0
7555     855
7556  Multiple object can be sent over a TCP connection between client and server in
7557    1.
7558persistent HTTP
75592.
7560nonpersistent HTTP
75613.
7562both persistent HTTP and nonpersistent HTTP 4.
7563p-persistent HTTP
7564     1.0
7565   856
7566   Multiple variable declaration of same data type can be avoided by?
7567     1.array 2.identifiers 3.functions 4.Pointer
7568    1.0
7569    857
7570Network layer firewall works as a
7571  1.
7572frame filter
75732.
7574packet filter
75753.
7576both (a) and (b)
75774.
7578none of the mentioned
7579   2.0
7580     858
7581  Network models are complicated by physical keys, but the relation model is
7582    1.Slower because it uses logical keys 2.Slower because it uses physical keys 3.Faster because it uses physical keys 4.Faster because it uses logical keys
7583     4.0
7584     859
7585  Network operating system that does not support symmetric multi-processing (SMP) is
7586    1.Banyan (VINES) 2.Microsoft NT advanced server 3.SCO Unix 4.Novell Network 3.X
7587     4.0
7588     860
7589  NOR Gate does NOT follow
7590    1.DeMorgan’s Theorem 2.Associative Law 3.Commutative Law 4.Distributive Law
7591     4.0
7592     861
7593  Normalisation of database is used to
7594    1.Minimise Errors 2.Improve Security 3.Eliminate redundancy 4.Improve security
7595     3.0
7596   862
7597   Number of the times the instruction sequence below will loop before coming out of loop is, MOV AL, 00h A1: INC AL JNZ A1
7598     1.255 2.01 3.00 4.256
7599    4.0
7600    863
7601ODBC stands for
7602  1.
7603Object Database Connectivity. 2.
7604Oral Database Connectivity. 3.
7605Oracle Database Connectivity. 4.
7606Open Database Connectivity.
7607   4.0
7608   864
7609   One application of a digital multiplexer is to facilitate:
7610     1.data generation 2.serial-to-parallel conversion 3.data selector 4.parity checking
7611    1.0
7612   865
7613One of the fault base testing techniques is
7614   1.
7615unit testing.
76162.
7617beta testing.
76183.
7619Stress testing.
76204.
7621mutation testing.
7622   4.0
7623 
7624   S.NO.
7625  Questions
7626    Choices
7627   Answers
7628    866
7629One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the following statements best explains the need for this field?
7630  1.
7631It can be used to priortize packets
76322.
7633It can be used to reduce delays
76343.
7635It can be used to optimize throughput
76364.
7637It can be used to prevent packet looping
7638   4.0
7639   867
7640   One of the main advantage of using src attribute is
7641     1.It becomes self-cached 2.It makes the HTML file modular 3.It restricts manipulation in the HTML file 4.It simplifies the HTML files
7642    4.0
7643    868
7644One of the purposes of using intermediate code in compilers is to
7645  1.
7646make parsing and semantic analysis simpler
76472.
7648improve error recovery and error reporting
76493.
7650increase the chances of reusing the machine-independent code optimizer in other compilers.
76514.
7652improve the register allocation.
7653   3.0
7654   869
7655   overloading + operator requires return type as object because,
7656     1.reference parameter has to be returned 2.binary addition requires that 3.all overloading functions require that 4.chain of additions
7657    3.0
7658    870
7659Overloading involves writing two or more functions with ________
7660  1.different names and different argument lists 2.different names and the same argument list 3.the same name and different argument lists 4.the same name and the same argument list
7661   3.0
7662   871
7663   Overloading the function operator
7664     1.usually make use of a constructor that takes arguments. 2.allows you to create objects that act syntactically like functions. 3.requires a class with an overloaded operator. 4.requires a class with an overloaded [ ] operator.
7665    3.0
7666    872
7667Packets of the same session may be routed through different paths in:
7668  1.
7669TCP, but not UDP
76702.
7671TCP and UDP
76723.
7673UDP, but not TCP
76744.
7675Neither TCP nor UDP
7676   2.0
7677     873
7678  Paging _________
7679    1.
7680solves the memory fragmentation problem 2.
7681allows modular programming
76823.
7683allows structured programming
76844.
7685avoids deadlock
7686     1.0
7687   874
7688  Parallelism and concurrency is fully achieved in which of the following thread model
7689     1.
7690Many-to-one model 2.
7691Many-to-many
76923.
7693one-to-one model 4.
7694All the models
7695    1.0
7696 
7697   S.NO.
7698  Questions
7699    Choices
7700   Answers
7701    875
7702Passing the request from one schema to another in DBMS architecture is called as _______
7703  1.
7704Mapping
77052. Communication 3.
7706Relational
77074.
7708network
7709   1.0
7710   876
7711   Pee hole optimization
7712     1.Local optimization 2.Loop optimization 3.Constant folding 4.Data flow analysis
7713    3.0
7714   877
7715 2.0
7716    1. true 2. false 3. 4.
7717   4.0
7718   878
7719 Physical layer provides
7720    1.
7721mechanical specifications of electrical connectors and cables 2.
7722electrical specification of transmission line signal level
77233.
7724specification for IR over optical fiber
77254.
7726all of the mentioned
7727    4.0
7728    879
7729Pick an incorrect declaration: 1. int x[5];
77302. int x[5]={1,2,3,4,5};
77313. int x[5] = {1,2}
77324. int x[];
7733  1. 1 2. 2 3. 3 4. 4
7734   4.0
7735   880
7736   Pick the odd one out.
7737     1.[] 2.() 3.:: 4.~
7738    3.0
7739    881
7740Polymorphism reduces the effort required to extend an object system by
7741  1.
7742Coupling objects together more tightly
77432.
77442.0enabling a number of different operations to share the same name. 3.
7745making objects more dependent on one another
77464.
7747removing the barriers imposed by encapsulation.
7748   4.0
7749     882
7750  Popular application of flip-flop are.
7751    1.Shift registers 2.Transfer register 3.Counters 4.All of these
7752     4.0
7753   883
7754   Postorder Tree travsersal is recursive
7755     1.LDR 2.LRD 3.DLR 4.DRL
7756    2.0
7757    884
7758PREDICT THE OUTPUT:
7759#include <stdio.h> void main()
7760{
7761int a=10,b=2,x=0; x=a+b*a+10/2*a; printf("value is =%d",x);
7762}
7763  1.Value is =1250 2. Value is =80
77643.
7765Value is =125
77664. Error
7767   2.0
7768   885
7769   Prim's algorithm is a method available for finding out the minimum cost of a spanning tree. Its time complexity is given by:
7770     1.O(1) 2.O(n*n) 3.O(n logn) 4.O(n)
7771    3.0
7772   886
7773Program flow graphs are identical to program flowcharts.
7774   1. true 2. false 3. 4.
7775  2.0
7776 
7777   S.NO.
7778  Questions
7779    Choices
7780   Answers
7781    887
7782PSW is saved in stack when there is a _____.
7783  1.
7784interrupt recognized 2.
7785execution of RST instruction 3.
7786Execution of CALL instruction 4.
7787All of these
7788   1.0
7789   888
7790   Quantitative methods for assessing the quality of proposed architectural designs are readily available.
7791     1. TRUE 2. FALSE 3. 4.
7792    2.0
7793    889
7794Query Tree uses
7795  1.
7796Relational Algebra
77972.
7798Tuple Relational Calculus 3.
7799Domain Relational Calculus 4.
7800All of the options
7801   4.0
7802     890
7803  Relations produced from an E - R model will always be in
7804    1.3 NF 2.B CNF 3.2 NF 4.1 NF
7805     1.0
7806   891
7807   Relocating bits used by relocating loader are specified by
7808     1.Relocating loader itself 2.Linker 3.Assembler 4.Macro processor
7809    2.0
7810    892
7811Replace the page that has not be used for the longest period of time. This principle is adopted by ____________
7812  1.
7813FIFO Page replacement algorithm
78142.
7815Optimal Page replacement algorithm 3.
7816Round robin scheduling algorithm 4.
7817LRU Page replacement algoorithm
7818   4.0
7819     893
7820  Resource locking ________.
7821    1.
7822Allows multiple tasks to simultaneously use resource 2.
7823Forces only one task to use any resource at any time 3.
7824Can easily cause a dead lock condition
78254.
7826Is not used for disk drives
7827     2.0
7828     894
7829  Risk management is one of the most important jobs for a
7830    1. Client 2. Investor 3.
7831Production team 4.
7832Project manager
7833     4.0
7834   895
7835  Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called _________
7836    1.Static loading 2.Dynamic loading 3.Dynamic linking 4.Overlays
7837   3.0
7838 
7839   S.NO.
7840  Questions
7841    Choices
7842   Answers
7843    896
7844Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called _________
7845  1.
7846Static loading
78472.
7848Dynamic loading 3.
7849Dynamic linking 4.
7850Overlays
7851   3.0
7852   897
7853   Run time polymorphism is achieved by ______
7854     1.friend function 2.virtual function 3.operator overloading 4.function overloading
7855    2.0
7856    898
7857S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of
7858  1.
7859All palindromes
78602.
7861All odd length palindromes.
78623.
7863Strings that begin and end with the same symbol 4.
7864All even length palindromes
7865   2.0
7866   899
7867   1.0
7868     1. true 2. false 3. 4.
7869    2.0
7870    900
7871SELECT department_id, AVG(salary) FROM employees WHERE AVG(salary) > 8000 GROUP BY department_id
7872  1.
7873Displays the department ID along with the average salary of employees in each department if their average of salary is greater than 8000.
78742.
7875Displays a error
78763.
7877Displays the department ID along with the average salary of employees 4.
7878None of the options
7879   2.0
7880     901
7881  SELECT department_id, COUNT(last_name) FROM employees;
7882    1.
7883Displays a error
78842.
7885Displays the department ID along with the number of employees in each department.
78863.
7887None of the options
78884.
7889Dsiplays department ID and a null value
7890     2.0
7891   902
7892  SELECT employee_id, last_name FROM employees WHERE salary = (SELECT MIN(salary) FROM employees GROUP BY department_id);
7893     1.
7894Displays the employee_id and name of employees who gets minimum salary in their department
78952.
7896Error
78973.
7898None of the options
78994.
7900Displays the employee_id, name of employees and their salary
7901    1.0
7902 
7903   S.NO.
7904  Questions
7905    Choices
7906   Answers
7907   903
7908 SELECT last_name, SYSDATE-hire_date FROM employees;
7909    1.
7910Displays number of days an employee has worked in the company.
79112.
7912Displays number of months an employee has worked in the company. 3.
7913Error
79144.
7915None of the mentioned
7916    1.0
7917    904
7918Select operation in SQL is equivalent to
7919  1.
7920the selection operation in relational algebra
79212.
7922the selection operation in relational algebra, except that select in SQL retains duplicates
79233.
7924the projection operation in relational algebra 4.
7925the projection operation in relational algebra, except that select in SQL retains duplicates
7926   4.0
7927     905
7928  Select the conflicting operation:
7929    1.
7930r1(x), w2( y ) 2.
7931r1(x), w1(x) 3.
7932w1( y ), w2(x) 4.
7933r1(x), w2(x)
7934     3.0
7935   906
7936   SELECT THE HIGHEST PRIORITY OPERATOR
7937     1.&& 2., 3.?: 4.++
7938    4.0
7939    907
7940Shift reduce parsers are
7941  1.Vertical parser 2.top down and bottom up parser 3.Bottom up parser 4.Top down parser
7942   3.0
7943     908
7944  Simple network management protocol (SNMP) is implemented with a daughter board in
7945    1.the nodes 2.the server 3.the hubs 4.a separate PC that managers the network
7946     3.0
7947   909
7948   Skewed binary trees can be efficiently represented using
7949     1.Arrays 2.Linked lists 3.Stacks 4.Queues
7950    2.0
7951   910
7952 2.0
7953    1. True 2. False
7954   1.0
7955    911
7956Software engineering includes system engineering.
79573. 4. 1.
7958True 2. False 3. 4.
7959     1.0
7960     912
7961  4.0
7962    1.Customer visible usage scenarios 2.
7963Important software features 3.System inputs and outputs 4. ALL
7964     2.0
7965   913
7966  Software is a product and can be manufactured using the same technologies used for other engineering artifacts.
7967    1. True 2. False 3. 4.
7968   2.0
7969 
7970   S.NO.
7971  Questions
7972    Choices
7973   Answers
7974   914
7975 Software validation is achieved through a series of tests performed by the user once the software is deployed in his or her work environment.
7976    1. true 2. false 3. 4.
7977   2.0
7978    915
7979Some code optimizations are carried out on the intermediate code because
7980  1.
7981they enhance the portability of the compiler to other target processors
79822.
7983program analysis is more accurate on intermediate code than on machine code
79843.
7985the information from dataflow analysis cannot otherwise be used for optimization
79864.
7987the information from the front end cannot otherwise be used for optimization
7988   1.0
7989     916
7990  Some code optimizations are carried out on the intermediate code because
7991    1.The information from data flow analysis cannot otherwise be used for optimization 2.They enhance the portability of the complier to other target processors 3.The information from the front end cannot otherwise be used for optimization 4.Program analysis is name accurate on intermediate code than on machine code
7992     2.0
7993   917
7994   Specify the 2 library functions to dynamically allocate memory?
7995     1.alloc() and memalloc() 2.malloc() and calloc() 3.memalloc() and faralloc() 4.malloc() and memalloc()
7996    2.0
7997   918
7998 Spurious tuples are formed because of
7999    1.
8000join operation done on a non-key attribute 2.
8001outer join operation
80023.
8003transitive dependencies
80044.
8005inner join
8006    1.0
8007    919
8008SRS is also known as specification of
8009  1.
8010White box testing 2.
8011Stress testing
80123.
8013Integrated testing 4.
8014Black box testing
8015   4.0
8016   920
8017  Station A needs to send a message consisting of 9 packets to Station B using a sliding window (window size 3) and go-back-n error control strategy. All packets are ready and immediately available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever get lost), then what is the number of packets that A will transmit for sending the message to B?
8018     1. 12 2. 14 3. 16 4. 18
8019    3.0
8020 
8021   S.NO.
8022  Questions
8023    Choices
8024   Answers
8025    921
8026Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should use?
8027  1. 20 2. 40 3. 160 4. 320
8028   2.0
8029     922
8030  2.0
8031    1. true 2. false 3. 4.
8032     4.0
8033   923
8034   String length is found by the condition
8035     1.str[i]!=NULL 2.str[i]!=sizeof(str) 3.str[i]>='\0' 4.str[i]!='\0'
8036    4.0
8037   924
8038 Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
8039    1.Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT 2.Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT 3.Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR 4.Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT
8040   4.0
8041    925
8042Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
8043  1.Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT 2.Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR 3.Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT 4.Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT
8044   1.0
8045     926
8046  Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging together two sequences at a time, The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____
8047    1.672 2.740 3.358 4.354
8048     3.0
8049   927
8050   Suppose P, Q, R, S, T are sorted sequences having lengths 20,24,30,35,50 respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____
8051     1.368 2.338 3.348 4.358
8052    4.0
8053    928
8054Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 micro sec. The minimum frame size is:
8055  1. 94 2. 416 3. 464 4. 512
8056   4.0
8057     929
8058  Suppose x is dead, that is, never subsequently used, at the point where the statement x=y+z appears in a basic block. Then this statement may be safely removed without changing the value of the basic block. This transformation is known as __________________ .
8059    1.Common subexpression elimination 2.Dead code elimination 3.Renaming temporary variables 4.Loop invarient
8060     2.0
8061   930
8062   Suppose you want to delete the name that occurs before 'Vellore' in an alphabetical listing. Which of the following data structures shall be most efficient for this operation?
8063     1.Circular linked list 2.Dequeue 3.Linked list 4.Doubly linked list
8064    2.0
8065    931
8066Symantec Antivirus is a customized product.
8067  1. True 2. False 3. 4.
8068   2.0
8069     932
8070  Synchronous counters eliminate the delay problems encountered with asynchronous (ripple) counters because the.
8071    1.input clock pulses are applied simultaneously to each stage 2.input clock pulses are applied only to the first and last stages 3.input clock pulses are applied only to the last stage 4.input clock pulses are not used to activate any of the counter stages
8072     4.0
8073     933
8074  Syntax for creating a RegExp object: (i). var txt=new RegExp(pattern,modifiers); (ii). var txt=/pattern/modifiers; Which of the above mentioned syntax is correct?
8075    1.(i) only 2.(ii) only 3.Both (i) and (ii) 4.None of these
8076     3.0
8077   934
8078   Synthesized attribute can be easily simulated by a
8079     1.LR grammar 2.Ambiguous grammar 3.LL grammar 4.LF grammer
8080    1.0
8081   935
8082System prototypes allow users
8083   1.
8084to see how well the system supports their work 2.
8085to start working on the system
80863.
8087to put the system to production
80884.
8089to program the software
8090   1.0
8091 
8092   S.NO.
8093  Questions
8094    Choices
8095   Answers
8096    936
8097System reactions to external events is depicted by
8098  1.
8099State diagram
81002.
8101Activity diagram
81023.
8103Usecase diagram
81044.
8105Sequence diagram
8106   1.0
8107     937
8108  2.0
8109    1. TRUE 2. FALSE 3. 4.
8110     1.0
8111     938
8112  1.0
8113    1. true 2. false 3. 4.
8114     1.0
8115     939
8116  1.0
8117    1. True 2. False 3. 4.
8118     3.0
8119     940
8120  The --------is neither an input nor an output; it is an internal bit programmed via the PC4(Port A) or PC2(Port B)bits
8121    1.IFB 2.INTR 3.INTE 4.NMI
8122     3.0
8123   941
8124   The ........ instruction is used to specify the number of stop bits, data bits,parity bit, and baud rate clock factor for the 8251 UART
8125     1.bit set/reset 2.Mode 3.Command 4.Code
8126    2.0
8127    942
8128The 1 MB byte of memory can be divided into ______ segment
8129  1.
81301 Kbyte 2.
813164 Kbyte 3.
813233 Kbyte 4.
813334 Kbyte
8134   2.0
8135     943
8136  The 16 bit flag of 8086 microprocessor is responsible to indicate ___________
8137    1.
8138the condition of result of ALU operation 2.
8139the condition of memory
81403.
8141the result of addition
81424.
8143the result of subtraction
8144     1.0
8145     944
8146  The 16-bit data segment value is 1000H and the offset is 2000H. calculated physical address is ---- -
8147    1.10000H 2.11000H 3.12000H 4.12500H
8148     3.0
8149   945
8150  The 16-bit stack segment value is 5D27H and the offset is 2C30H. calculated physical address is -- ---
8151    1.5FFEOH 2.5FAE0H 3.5FEA0H 4.12500H
8152   3.0
8153 
8154   S.NO.
8155  Questions
8156    Choices
8157   Answers
8158    946
8159The ___ bus controller device decodes the signals to produce the control bus signal
8160  1. internal 2.
8161data
81623. external 4. address
8163   3.0
8164     947
8165  The ____ translates internet domain and host names to IP address.
8166    1.
8167domain name system
81682.
8169routing information protocol 3.
8170network time protocol
81714.
8172internet relay chat
8173     1.0
8174     948
8175  The _______ method of an Array object adds and/or removes elements from an array.
8176    1.
8177Slice
81782. Reverse 3.
8179Shift
81804. Splice
8181     4.0
8182     949
8183  The ________ ensures that only one IC is active at a time to avoid a bus conflict caused by two ICs writing different data to the same bus
8184    1.control bus 2.control instructions 3.address decoder 4.CPU
8185     3.0
8186   950
8187   The ___________ property specifies the stack order of an element
8188     1.d-index 2.s-index 3.x-index 4.z-index
8189    4.0
8190    951
8191The access method used for magnetic tape is_________
8192  1.
8193Direct
81942.
8195Random
81963.
8197Sequential
81984.
8199None of these
8200   3.0
8201   952
8202   The address resolution protocol (ARP) is used for:
8203      1.
8204Finding the IP address using DNS
82052.
8206Finding the IP address of the default gateway
82073.
8208Finding the IP address that corresponds to a MAC address 4.
8209Finding the MAC address that corresponds to an IP address
8210     4.0
8211   953
8212The advantage of DBMS over file systems is
8213   1.
8214redundancy
82152.
8216data dependence 3.
8217multiple user
82184.
8219single user
8220   1.0
8221 
8222   S.NO.
8223  Questions
8224    Choices
8225   Answers
8226   954
8227 1.0
8228    1.
8229data, hardware, software, people
82302.
8231data, documentation, hardware, software
82323.
8233data, hardware, software, procedures
82344.documentation, hardware, people, procedures
8235    1.0
8236    955
8237The ASCII encoding of binary data is called
8238  1.
8239base 64 encoding 2.
8240base 32 encoding 3.
8241base 16 encoding 4.
8242base 8 encoding
8243   1.0
8244     956
8245  The average time required to reach a storage location in memory and obtain its contents is called the
8246    1.
8247seek time
82482.
8249turnaround time 3.
8250access time
82514.
8252transfer time
8253     3.0
8254     957
8255  The best index for exact match query is
8256    1.
8257Bucket Hash 2.
8258Quad tree
82593.
8260B Tree
82614.
8262B+ Tree
8263     1.0
8264   958
8265   1.0
8266     1.software developers do not need to do any testing
82672.a test team will test the software more thoroughly
82683.testers do not get involved with the project until testing begins 4.arguments between developers and testers are reduced
8269    4.0
8270    959
82714.0
8272  1.
8273examine the system model for errors
82742.
8275have the customer look over the requirements
82763.
8277send them to the design team and see if they have any concerns 4.
8278use a checklist of questions to examine each requirement
8279   2.0
8280   960
8281  The BIU contains FIFO register of size __________ bytes
8282     1. 8 2. 6 3. 4 4. 12
8283    2.0
8284 
8285   S.NO.
8286  Questions
8287    Choices
8288   Answers
8289    961
8290The BIU prefetches the instruction from memory and store them in ________
8291  1. queue 2. register 3. memory 4.
8292stack
8293   1.0
8294     962
8295  The call to the parameterized constructor of base class in the derived class
8296    1.ppears inside the definition of the derived class constructor 2.appears in the member initialization list of the derived class constructor 3.appears inside the definition of the derived class 4.appears at the statement where the derived class object is created
8297     4.0
8298     963
8299  The call to the parameterized constructor of base class in the derived class
8300    1.ppears inside the definition of the derived class constructor 2.appears in the member initialization list of the derived class constructor 3.appears inside the definition of the derived class 4.appears at the statement where the derived class object is created
8301     4.0
8302     964
8303  The combination of Sixteen adjacent squares in four variable K-map represent the function equal to
8304    1.Four literal 2.One literal 3.Unity 4.Zero
8305     3.0
8306   965
8307   The counters of 8253 can be operated in -------- modes of operation.
8308     1.4 2.3 3.6 4.5
8309    3.0
8310    966
8311The cyclomatic complexity metric provides the designer with information regarding the number of
8312  1.
8313cycles in the program 2.
8314errors in the program
83153.
83163.0independent logic paths in the program 4.
8317statements in the program
8318   4.0
8319   967
8320   The data structure required for Breadth First Traversal on a graph is
8321     1.tree 2.array 3.stack 4.queue
8322    4.0
8323    968
8324THE DATA TYPE IS ALL ABOUT
8325  1.NAME VALUE ADDRESS 2.BITS BYTES WORD 3.SIZE LIMITS RESTRICTIONS 4.TYPE SIZE RANGE
8326   4.0
8327     969
8328  The decimal equivalent of hexadecimal number of ‘A580’ is
8329    1.43286 2.42368 3.43288 4.48632
8330     2.0
8331   970
8332   The default copy constructor performs
8333     1.Deep Copy 2.Shallow Copy 3.Soft Copy 4.Hard Copy
8334    2.0
8335   971
8336 The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? I. 7, 6, 5, 4, 4, 3, 2, 1 II. 6, 6, 6, 6, 3, 3, 2, 2 III. 7, 6, 6, 4, 4, 3, 2, 2 IV. 8, 7, 7, 6, 4, 2, 1, 1
8337    1.IV only 2.III and IV 3.I and II 4.II and IV
8338   4.0
8339    972
8340The design process related to data structures and their representation is
8341  1.
8342Architectural design 2.
8343Interface design
83443.
8345Component design 4.
8346Database design
8347   4.0
8348     973
8349  The difference between linear array and a record is
8350    1.A record form a hierarchical structure but a linear array does not 2.All of above 3.An array is suitable for homogeneous data but the data items in a record may have different data type 4.In a record, there may not be a natural ordering in opposed to linear array
8351     3.0
8352     974
8353  The Document object is which part of the object?
8354    1.Tree 2.System 3.Window 4.Screen
8355     3.0
8356   975
8357   The efficient data structure to insert/delete a number in a stored set of numbers is
8358     1.Queue 2.Linked list 3.Doubly linked list 4.Binary tree
8359    2.0
8360    976
8361The entity relationship diagram
8362  1.
8363depicts relationships between data objects
83642.
8365depicts functions that transform the data flow
83663.
8367indicates how data are transformed by the system 4.
8368indicates system reactions to external events
8369   1.0
8370   977
8371  The ESC instruction of 8086 may have two formats. In one of the formats, no memory operand is used. Under this format, the number of external op-codes (for the co- processor) which can be specified is
8372    1.64 2.128 3.256 4.512
8373   2.0
8374 
8375   S.NO.
8376  Questions
8377    Choices
8378   Answers
8379    978
8380The external system bus architecture is created using from ______ architecture
8381  1.
8382Pascal
83832.
8384Dennis Ritchie 3.
8385Charles Babbage 4.
8386Von Neumann
8387   4.0
8388     979
8389  The file transfer protocol is built on
8390    1.
8391data centric architecture
83922.
8393service oriented architecture 3.
8394client server architecture
83954.
8396peer to peer architecture
8397     3.0
8398   980
8399   The first processor to include Virtual memory in the Intel microprocessor familywas
8400     1.Pentium 2.80486 3.80286 4.80386
8401    3.0
8402   981
8403 The following is not a Relational Model Constraint
8404    1.Referential Integrity Constraint 2.Check Constraint 3.Foreign Key Constraint 4.Entity Integrity Constraint
8405   1.0
8406    982
8407The following SQL is which type of join: SELECT CUSTOMER_T. CUSTOMER_ID, ORDER_T. CUSTOMER_ID, NAME, ORDER_ID FROM CUSTOMER_T,ORDER_T ;
8408  1.
8409Equi-join
84102.
8411Natural join 3.
8412Outer join
84134.
8414Cartesian join
8415   4.0
8416   983
8417   4.0
8418      1.
8419Define the specification for computer-based system 2.
8420Develop defect free computer-based systems
84213.
8422Verify the correctness of computer-based systems 4.
8423ALL
8424     1.0
8425    984
8426The function used to remove the leading spaces is
8427  1. ltrim 2. lpad 3. rpad 4. rtrim
8428   1.0
8429   985
8430  The goal of product engineering is to translate the customer's desire for a set of defined capabilities into a working product.
8431    1. TRUE 2. FALSE 3. 4.
8432   1.0
8433 
8434   S.NO.
8435  Questions
8436    Choices
8437   Answers
8438    986
8439The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is
8440  1.
8441ambiguous
84422.
8443left-recursive
84443.
8445right-recursive
84464.
8447an operator-grammar
8448   2.0
8449     987
8450  The grammar S → aSa | bS | c is
8451    1.
8452LL(1) but not LR(1)
84532.
8454LR(1)but not LR(1)
84553.
8456Both LL(1)and LR(1) 4.
8457Neither LL(1)nor LR(1)
8458     3.0
8459     988
8460  The Hardware mechanism that enables a device to notify the CPU is called __________.
8461    1.
8462Polling
84632.
8464Interrupt
84653.
8466Systems Call 4.
8467None of these
8468     2.0
8469   989
8470   The high paging activity is called ________
8471      1.
8472Inter process communication 2.
8473Thrashing
84743.
8475Context Switching
84764.
8477Working Set
8478     2.0
8479    990
8480The IC 8237 is a
8481  1.
8482DMA Controller
84832.
8484Interrupt Controller
84853.
8486Keyboard controller
84874.
8488Serial Interface Controller
8489   1.0
8490   991
8491  The IC 8251 A has ---------------------many pins
8492     1. 24 2. 28 3. 40 4. 30
8493    3.0
8494 
8495   S.NO.
8496  Questions
8497    Choices
8498   Answers
8499    992
8500The IC 8254 has ---------------------many pins
8501  1. 24 2. 28 3. 34 4. 40
8502   1.0
8503     993
8504  The IC 8254 has ----------------many 16 bit counters
8505    1. 1 2. 2 3. 3 4. 4
8506     3.0
8507     994
8508  The IC 8279 has ----------------------many pins
8509    1. 20 2. 30 3. 40 4. 10
8510     4.0
8511   995
8512   The IC Number for USART is --------------------------
8513      1.
8514IC 8251A 2. IC8259 3. IC5255 4.
8515IC 8254
8516     1.0
8517    996
8518The idea of cache memory is based
8519  1.
8520on the property of locality of reference 2.
8521on the heuristic 90-10 rule
85223.
8523on the fact that references generally tend to cluster
85244.
8525all of these
8526   1.0
8527   997
8528  The importance of software design can be summarized in a single word
8529     1. accuracy 2. complexity
85303. 4.0efficiency 4.
8531quality
8532    3.0
8533 
8534   S.NO.
8535  Questions
8536    Choices
8537   Answers
8538    998
8539The Incremental Model is a result of combination of elements of which two models?
8540  1.
8541Build & FIX Model & Waterfall Model 2.
8542Linear Model & RAD Model 3.
8543Linear Model & Prototyping Model 4.
8544Waterfall Model & RAD Model
8545   3.0
8546     999
8547  The incremental model of software development is
8548    1.
8549A reasonable approach when requirements are well defined.
85502.
8551A good approach when a working core product is required quickly. 3.
8552The best approach to use for projects with large development teams. 4.
8553A revolutionary model that is not used for commercial products.
8554     2.0
8555     1000
8556  The intel 8086 microprocessor is a _______ processor
8557    1.
85588 bit 2.
855916 bit 3.
856032 bit 4. 4bit
8561     2.0
8562     1001
8563  The internal block diagram of 80286 contains ---- functional parts.
8564    1.6 2.4 3.2 4.8
8565     2.0
8566   1002
8567   The interrupt cycle ends when the ........... instruction is executed
8568     1.IRET 2.CALL 3.PUSH 4.POP
8569    3.0
8570    1003
8571The intersection of CFL and regular language
8572  1.
8573Is always regular and context free 2.
8574Is always regular
85753.
8576Is always context free
85774.
8578Need not be regular
8579   3.0
8580     1004
8581  The IP is ________ bits in length
8582    1.
85838 bits 2.
85844 bits 3.
858516 bits 4.
858632 bits
8587     4.0
8588   1005
8589  The javascript statement a===b refers to
8590     1.
8591Both a and b are equal in value, type and reference address 2.
8592Both a and b are equal in value
85933.
8594Both a and b are equal in value and type
85954.
8596There is no such statement
8597    3.0
8598 
8599   S.NO.
8600  Questions
8601    Choices
8602   Answers
8603    1006
8604The kernel keeps track of the state of each task by using a data structure called __
8605  1.
8606Process control block 2.
8607Process Status Word 3.
8608Memory control block 4.
8609None of these
8610   1.0
8611     1007
8612  The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as
8613    1.
8614Regular
86152.
8616context free
86173.
8618Recursive
86194.
8620Deterministic context free
8621     1.0
8622     1008
8623  The language L= {0i21i | i≥0 } over the alphabet {0,1, 2} is:
8624    1.
8625not recursive
86262.
8627is recursive and is a deterministic CFL 3.
8628is a regular language 4.
8629is not a deterministic CFL but a CFL
8630     2.0
8631   1009
8632   The language that the computer can understand and execute is called ______
8633      1.
8634Machine language
86352.
8636Application software 3.
8637System program
86384.
8639None of these
8640     1.0
8641    1010
8642The language {am bn Cm+n | m, n ≥ 1} is
8643  1.
8644Regular language
86452.
8646context free but not regular
86473.
8648context sensitive but not context free 4.
8649type-0 but not context sensitive
8650   2.0
8651     1011
8652  The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is ______________.
8653a*b*(ba)*a*
8654     1. 2 2. 3 3. 4 4. 5
8655     2.0
8656     1012
8657  The length property belongs to which of the following objects?
8658    1.Window 2.Element 3.History 4.Document
8659     2.0
8660   1013
8661  The levels of hierarchy in inheritance helps to handle
8662    1.flexibility 2.complexity 3.detailed information 4.security
8663   4.0
8664 
8665   S.NO.
8666  Questions
8667    Choices
8668   Answers
8669    1014
8670The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?
8671  1.
8672Deterministic pushdown automata
86732.
8674Finite state automata
86753.
8676Non-deterministic pushdown automata 4.
8677Turing machine
8678   2.0
8679   1015
8680   The library function used to find the last occurrence of a character in a string is
8681     1.strnstr() 2.laststr() 3.strrchr() 4.strstr()
8682    3.0
8683   1016
8684 The linear sequential model of software development is
8685    1.
8686A reasonable approach when requirements are well defined.
86872.
8688A good approach when a working program is required quickly.
86893.
8690The best approach to use for projects with large development teams. 4.
8691An old fashioned model that cannot be used in a modern context.
8692    1.0
8693    1017
8694The linear sequential model of software development is also known as the
8695  1.
8696Classical life cycle model 2.
8697Spiral model
86983.
8699Waterfall model
87004.
8701Incremental Model
8702   3.0
8703     1018
8704  The load instruction is mostly used to designate a transfer from memory to a processor register known as____.
8705    1. Accumulator 2.
8706Instruction Register 3.
8707Program counter 4.
8708Memory address Register
8709     1.0
8710   1019
8711   The main purpose of a data link content monitor is to
8712     1.detect problems in protocols 2.determine the type of switch used in a data link 3.determine the flow of data 4.determine the type of switching
8713used in data link
8714    1.0
8715   1020
8716The maximum number of superkeys for the relation schema R(E,F,G,H) with E as the key is
8717   1. 7 2. 8 3. 9 4. 6
8718   2.0
8719 
8720   S.NO.
8721  Questions
8722    Choices
8723   Answers
8724    1021
8725The maximum size of payload field in ethernet frame is
8726  1.
87271000 bytes 2.
87281200 bytes 3.
87291300 bytes 4.
87301500 bytes
8731   4.0
8732   1022
8733   The maximum window size for data transmission using the selective reject protocol with n-bit frame sequence numbers is:
8734      1.
87352^n
87362. 2^(n-1) 3.
87372^n – 1 4. 2^(n-2)
8738     2.0
8739    1023
8740The MC 1488 is
8741  1.
8742TTL to RS 232C Level converter 2.
8743RS-232 to TTL level converter 3.
8744Bidirectional Level converter
87454.
8746Unidirectional level converter
8747   1.0
8748     1024
8749  The mechanism that bring a page into memory only when it is needed is called ______
8750    1.
8751Segmentation
87522.
8753Fragmentation
87543.
8755Demand Paging
87564.
8757Page Replacement
8758     3.0
8759   1025
8760   The members of a class, by default, are
8761     1.private 2.protected 3.public 4.mandatory to specify
8762    3.0
8763    1026
8764The memory unit that communicates directly with the CPU is called the
8765  1.
8766main memory
87672.
8768Secondary memory
87693.
8770shared memory
87714.
8772auxiliary memory
8773   1.0
8774   1027
8775  The microprocessor can read/write 16 bit data from or to ________
8776     1.
8777memory
87782.
8779I /O device 3. processor 4.
8780register
8781    1.0
8782 
8783   S.NO.
8784  Questions
8785    Choices
8786   Answers
8787    1028
8788The microprocessor determines whether the specified condition exists or not by testing the ______
8789  1.
8790carry flag
87912.
8792conditional flag 3.
8793common flag
87944.
8795sign flag
8796   2.0
8797     1029
8798  The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X^5 + 4X^3 + 6^X + 5 for a given value of X using only one temporary variable is.
8799    1.6 2.9 3.8 4.7
8800     4.0
8801     1030
8802  The minimum number of arithmetic operations required to evaluate the polynomial P(X)=X^5+4X^3+6^X+5 for a given value of X using only one temporary variable.
8803    1.6 2.7 3.8 4.9
8804     2.0
8805   1031
8806   The minimum number of nodes in a binary tree of depth d (root at level 0) is
8807     1.2d - 1 2.d + 1 3.2d + 1 - 1 4.d
8808    2.0
8809    1032
8810The MMU (Memory Management Unit) is a
8811  1. Hardware 2. Software 3. Firmware 4. Malware
8812   1.0
8813     1033
8814  The nature of collaboration is such that all system requirements are defined by consensus of a committee of customers and developers.
8815    1. TRUE 2. FALSE 3. 4.
8816     2.0
8817   1034
8818   The node type for document returns the value ---.
8819     1.2 2.9 3.3 4.8
8820    4.0
8821    1035
8822The number of auxiliary memory required for a Push Down Machine (PDM) to behave like a Finite State Machine (FSM) is
8823  1. 0 2. 2 3. 4 4. 1
8824   1.0
8825     1036
8826  The number of clock pulses needed to shift one byte of data from input to the output of a 4-bit shift register is.
8827    1.10 2.12 3.16 4.32
8828     3.0
8829     1037
8830  The number of components in a graph with n nodes and 1 edge are
8831    1.n 2.n-2 3.n-1 4.n-3
8832     3.0
8833     1038
8834  The number of components in a graph with n nodes and 1 edge are
8835    1.n 2.n-2 3.n-1 4.n-3
8836     3.0
8837   1039
8838   The number of counters available in internal block diagram of 8253 is
8839     1.2 2.1 3.3 4.4
8840    3.0
8841    1040
8842The number of states in DFA is --------than the number of states in NFA for the same Language.
8843  1.
8844Greater
88452.
8846less
88473.
8848greater equal 4.
8849equal
8850   2.0
8851     1041
8852  The number of tokens in the following C statement is printf("i = %d, &i = %x", i, &i);
8853    2.0
8854     4.0
8855   1042
8856   The operation of processing each element in the list is known as
8857     1.Sorting 2.Merging 3.Inserting 4.Traversal
8858    4.0
8859   1043
8860The other name for MODE 0 in 8253 timer is
8861   1.software triggered strobe 2.Programmable one shot 3.Interrupt on terminal count 4.Square wave rate generator
8862  3.0
8863 
8864   S.NO.
8865  Questions
8866    Choices
8867   Answers
8868    1044
8869The physical layer concerns with
8870  1.
8871bit-by-bit delivery
88722.
8873process to process delivery
88743.
8875application to application delivery 4.
8876Hop by hop delivery
8877   1.0
8878     1045
8879  The physical layer is responsible for
8880    1.
8881line coding
88822.
8883channel coding
88843.
8885modulation
88864.
8887all of the mentioned
8888     4.0
8889   1046
8890   The physical layer translates logical communication requests from the ______ into hardware specific operations.
8891      1.
8892data link layer 2.
8893network layer
88943.
8895trasnport layer 4.
8896application layer
8897     1.0
8898    1047
8899The pop() method of the array in javascript does which of the following task ?
8900  1.
8901decrements the total length by 1
89022.
8903increments the total length by 1
89043.
8905prints the first element but no effect on the length 4.
8906don't return the value of deleted element
8907   1.0
8908     1048
8909  The portion of physical layer that interfaces with the media access control sublayer is called
8910    1.
8911physical signalling sublayer 2.
8912physical data sublayer
89133.
8914physical address sublayer 4.
8915none of the mentioned
8916     1.0
8917   1049
8918   The postfix expression for * + a b - c d is?
8919     1.ab + cd - * 2.ab + cd * - 3.ab + - cd * 4.ab cd + - *
8920    1.0
8921    1050
8922The postfix form of the expression (A+ B)*(C*D- E)*F / G is
8923  1.AB + CD* E - *F *G / 2.AB + CD* E - F **G / 3.AB+ CD*E - FG /** 4.AB + CDE * - * F *G /
8924   3.0
8925   1051
8926  The preorder traversal sequence of a binary search tree is 30,20,10,15,25,23,39,35,42. Which one of the following is the postorder traversal sequence of the same tree?
8927    1.10,20,15,23,25,35,42,39,30 2.15,10,25,23,20,42,35,39,30 3.15,20,10,23,25,42,35,39,30 4.15,10,23,25,20,35,42,39,30
8928   4.0
8929 
8930   S.NO.
8931  Questions
8932    Choices
8933   Answers
8934    1052
8935The process of retaining data for future use is called
8936  1. reading 2. writing 3. storing 4. coding
8937   3.0
8938   1053
8939   The project planner examines the statement of scope and extracts all important software functions which is known as
8940      1.
8941Association
89422. Decomposition 3.
8943Planning process 4.
8944ALL
8945     3.0
8946    1054
89473.0
8948  1.
8949Another name for component-based development.
89502.
8951Another name for component-based development.
89523.
8953A high speed adaptation of the linear sequential model. 4.
8954ALL
8955   4.0
8956   1055
8957   The RDBMS terminology for a row is
8958     1.attribute 2.relation 3.degree 4.tuple
8959    4.0
8960    1056
8961The recognizing capabilities of NDFSM and DFSM
8962  1.
8963may be different
89642.
8965must be different
89663.
8967must be same
89684.
8969none of the mentioned
8970   3.0
8971   1057
8972   The relational model uses some unfamiliar terminology. A tuple is equivalence to a:
8973     1.record 2.field 3.file 4.database
8974    1.0
8975    1058
8976The removal of process from active contention of CPU and reintroduce them into memory later is known as ____________
8977  1. Interrupt 2. Swapping 3.
8978Signal
89794.
8980Thread
8981   2.0
8982     1059
8983  The restriction while using the binary search is ?
8984    1.List should be small in number 2.List should be large in number 3.List should be sorted 4.No restriction
8985     3.0
8986     1060
8987  The result evaluating the postfix expression (10 5 + 60 6 / * 8 –) is
8988    1.284 2.142 3.213 4.71
8989     2.0
8990   1061
8991  The searching technique that takes O (1) time to find a data is
8992    1.Binary Search 2.Linear Search 3.Tree Search 4.Hashing
8993   4.0
8994 
8995   S.NO.
8996  Questions
8997    Choices
8998   Answers
8999    1062
9000The segment number S is legal if
9001  1.
9002S < STBR
90032.
9004S > STBR
90053.
9006S < STLR 4.
9007S > STLR
9008   3.0
9009     1063
9010  The simplest image processing technique is
9011    1.coordinates transformation 2.intensity transformation 3.spatial transformation 4.domain transformation
9012     1.0
9013   1064
9014   The situation when in a linked list START=NULL is
9015     1.overflow 2.underflow 3.housefull 4.saturated
9016    2.0
9017   1065
9018 The smallest element of an array’s index is called its
9019    1.lower bound 2.range
9020D. extract 3.upper bound 4.ion
9021   1.0
9022    1066
9023The smallest finite automation which accepts the language {x | length of x is divisible by 3} has :
9024  1.
90252 states 2.
90263 states 3.
90274 states 4.
90285 states
9029   3.0
9030   1067
9031   The space factor when determining the efficiency of algorithm is measured by
9032     1.Counting the average memory needed by the algorithm 2.Counting the minimum memory needed by the algorithm 3.Counting the maximum memory needed by the algorithm 4.Counting the maximum disk space needed by the algorithm
9033    3.0
9034   1068
9035 4.0
9036    1.
9037Ends with the delivery of the software product
90382.
9039Is not more chaotic than the incremental model
90403.Do not Include project risks evaluation during each iteration 4.Includes feasibility risks
9041   2.0
9042    1069
9043The spiral model was originally proposed by
9044  1.
9045IBM
90462.
9047Barry Boehm 3.
9048Pressman 4.
9049Royce
9050   2.0
9051     1070
9052  The SQL BETWEEN operator
9053    1.
9054Specifies a range to test
90552.
9056specifies between which tables the data is present
90573.
9058specifies the columns between which columns the data is present 4.
9059None of the options
9060     1.0
9061   1071
9062  The starting address for counter 0 of 8253 is 0038H, then port address for control word register is
9063    1.44H 2.49H 3.42H 4.46H
9064   3.0
9065 
9066   S.NO.
9067  Questions
9068    Choices
9069   Answers
9070    1072
9071The state diagram
9072  1.
9073depicts relationships between data objects
90742.
9075depicts functions that transform the data flow
90763.
9077indicates how data are transformed by the system 4.
9078indicates system reactions to external events
9079   1.0
9080   1073
9081   The status that cannot be operated by direct instructions is
9082     1.Z 2.Cy 3.P 4.AC
9083    4.0
9084    1074
9085The stream insertion operator should be overloaded as
9086  1.friend functions 2.member function 3.non member functions 4.static functions
9087   4.0
9088     1075
9089  The stream insertion operator should be overloaded as
9090    1.friend functions 2.member function 3.non member functions 4.static functions
9091     4.0
9092     1076
9093  The switching method fixes the path from source to destination is _________
9094    1.circuit switching 2.Message Switching 3.Packet switching 4.Frame Relay
9095     1.0
9096   1077
9097   The syntax of Eval is ___________
9098     1.[objectName.]eval(numeriC) 2.[objectName.]eval(string) 3. [EvalName.]eval(string) 4.[EvalName.]eval(numeriC)
9099    2.0
9100    1078
9101The system engineering process usually begins with the
9102  1.
9103detailed view 2.
9104domain view
91053.
91064.0element view 4.
9107world view
9108   1.0
9109     1079
9110  1.0
9111    1.
9112Function, performance and constraints of a computer-based system
91132.
9114implementation of each allocated system
91153.
9116element software architecture
91174.time required for system simulation
9118     3.0
9119     1080
9120  The tightest upper bound for the worst case performance of quicksort implemented on an array of n elements by always chosing the pivot as the central element is
9121    1.T(n! logn) 2.O(n logn) 3.O(n^2) 4.O(n^3)
9122     3.0
9123     1081
9124  The time complexity to build a heap with a list of n numbers is
9125    1.O(n logn) 2.O(n) 3.O(log n) 4.O(n2)
9126     2.0
9127   1082
9128   The topology with highest reliability is .........................
9129     1.ring topology 2.star topology 3.bus topology 4.mesh topology
9130    4.0
9131    1083
9132The total number of pins for the IC 8255 is
9133  1. 28 2. 40 3. 30 4. 20
9134   2.0
9135   1084
9136   The two statements that can be used to change the flow of control are
9137     1.switch and do-while 2.if and while 3.if and switch 4.break and continue
9138    3.0
9139   1085
9140The UNION SQL clause can be used with...
9141   1.
9142none of the options
91432.
9144the SELECT clause only
91453.
9146the UPDATE clause only
91474.
9148the DELETE and UPDATE clauses
9149   2.0
9150 
9151   S.NO.
9152  Questions
9153    Choices
9154   Answers
9155    1086
9156The use of traceability tables helps to
9157  1.
9158debug programs following the detection of run-time errors 2.
9159determine the performance of algorithm implementations 3.
9160identify, control, and track requirements changes 4.Analyze design changes
9161   3.0
9162   1087
9163   The value in AL=11011010 after the operation of CBW, the result is
9164     1.AX=1101 1010 1111 1111 2.AX=1101 1010 0000 0000
9165. 3.AX=1111 1111 1101 1010 4.AX=0000 0000 1101 1010
9166    3.0
9167    1088
9168The virtual file system provides us the following
9169  1.
9170Object oriented file implementation
91712.
9172Structured programming file implementation 3.
9173Linked file allocation
91744.
9175Indexed file allocation
9176   2.0
9177     1089
9178  The work of EU is ________
9179    1.
9180encoding
91812.
9182decoding
91833. processing 4. calculations
9184     3.0
9185     1090
9186  2.0
9187    1.
9188size of the budget
91892.
9190size of the product being built
91913.
9192software process being used 4.
9193stakeholders needs
9194     3.0
9195     1091
9196  The worst case running time to search for an element in a balanced binary search tree with n*2^n elements is
9197    1.theta(n log n) 2.theta(n*2^n) 3.theta(n) 4.theta(log n)
9198     3.0
9199   1092
9200   The worst case running time to search for an element in a balanced in a binary search tree with n*2^n elements is
9201     1.theta(n log n) 2.theta(n*2^n) 3.theta(n) 4.theta(log n)
9202    3.0
9203    1093
9204There are n stations in a slotted LAN. Each station attempts to transmit with a probability p in each time slot. What is the probability that only one station transmits in a given time slot?
9205  1.
9206(1-p)^(n-1)
92072. np(1-p)^(n-1) 3. p(1-p)^(n-1) 4. 1-(1-p)^(n-1)
9208   2.0
9209   1094
9210   There is no connection setup phase in __________
9211     1.Frame relay 2.Virtual Circuit Switching 3.Datagram 4.ATM
9212    3.0
9213   1095
9214Thrashing occurs ________
9215   1.
9216when excessive swapping takes place 2.
9217when you thrash your computer
92183.
9219whenever deadlock occurs
92204.
9221when no swapping takes place
9222   1.0
9223 
9224   S.NO.
9225  Questions
9226    Choices
9227   Answers
9228    1096
9229Thresholding function in contrast stretching creates
9230  1.binary image 2.high quality image 3.low quality image 4.enhanced image
9231   1.0
9232   1097
9233   To create an alias Objects have to be passed by
9234     1.address 2.reference 3.value 4.field by field
9235    2.0
9236   1098
9237 To Delete an item from a Queue identify the correct set of statements
9238    1.Q[REAR] = item; REAR ++ 2.item = Q[FRONT]; FRONT++ 3.item = Q[REAR]; FRONT ++ 4.item = Q[FRONT]; REAR ++
9239   2.0
9240   1099
9241 To determine the architectural style or combination of styles that best fits the proposed system, requirements engineering is used to uncover
9242    1.
9243algorithmic complexity
92442.
9245characteristics and constraints 3.
9246control and data
92474.
9248design patterns
9249    2.0
9250    1100
9251To interface memory with the microprocessor, connect register the lines of the address bus must be added to address lines of the _______ chip.
9252  1. single 2. memory 3. multiple 4.
9253triple
9254   2.0
9255   1101
9256   To operate correctly, starting a ring counter requires
9257     1.presetting all the flip-flops 2.clearing one flip-flop and presetting all the others 3.presetting one flip-flop and clearing all the others 4.clearing all the flip-flops
9258    1.0
9259    1102
9260Today the increased power of the personal computer has brought about an abandonment of the practice of team development of software
9261  1. True 2. false 3. 4.
9262   1.0
9263   1103
9264   Trigger is a
9265     1.Statement that enables to start any DBMS 2.Statement that is executed by the user when debugging an application program 3.Statement that is executed automatically by the system as a side effect of a modification to the database 4.Condition the system tests for the validity of the database user
9266    3.0
9267    1104
9268Two computers C1 and C2 are configured as follows. C1 have IP address as 203.197.2.53 and netmask 255.255.128.0. C2 have IP address as 203.197.75.201 and netmask 255.255.192.0. Which one of the following statements is true?
9269  1.
9270C1 and C2 both assume they are on the same network
92712.
9272C2 assumes C1 is on same network, but C1 assumes C2 is on a different network
92733.
9274C1 assumes C2 is on same network, but C2 assumes C1 is on a different network
92754.
9276C1 and C2 both assume they are on different networks.
9277   3.0
9278     1105
9279  Two sets of functional dependencies E and F are equivalent if E+ = F+ .This statement is
9280    1.
9281True
92822.
9283False
92843.
9285Cant Say 4.
9286     1.0
9287   1106
9288  Updating a database means
9289    1.deleting database 2.modifying or adding record occurrences 3.revising the file structure 4.reorganizing the database
9290   2.0
9291 
9292   S.NO.
9293  Questions
9294    Choices
9295   Answers
9296    1107
9297Usability questionnaires are most meaningful to the interface designers when completed by
9298  1. customers
92992.
93003.0experienced programmers 3.
9301product users
93024.
9303project managers
9304   2.0
9305     1108
9306  Using linked list node representation, inserting a node in general tree is performed efficently
9307    1.not possible 2.by merging with an existing node 3.after introducing a new link 4.after converting to binary tree
9308     2.0
9309   1109
9310   Using the 8259A, the INT input of the 8086 can be expanded to accomodeate up to --------------- prioritized interrupt inputs
9311     1.60 2.64 3.16 4.32
9312    2.0
9313   1110
9314 Usually a pure virtual function
9315    1.Will be called only to delete an object 2.Is defined only in derived class 3.Will never be called 4.Has complete function body
9316   2.0
9317    1111
9318Virtual memory is the portion of _______.
9319  1.
9320RAM
93212.
9322Cache Memory 3.
9323Hard Disc
93244.
9325None of these
9326   3.0
9327     1112
9328  Voice privacy in GSM cellular telephone protocol is provided by
9329    1.
9330A5/2 cipher 2.
9331b5/4 cipher 3.
9332b5/6 cipher 4.
9333b5/8 cipher
9334     1.0
9335   1113
9336   VOLATILE MEMORY IS ________________ ?
9337     1.COMPACT DISK 2.HARD DISK 3.RANDOM ACCESS MEMORY 4.READ ONLY MEMORY
9338    3.0
9339    1114
93401.0
9341  1.
9342architecture, interface, component 2.
9343cost, risk, schedule
93443.
9345Information, function, behavior
93464.
9347NONE
9348   1.0
9349   1115
9350  What assess the risk and your plans for risk mitigation and revise these when you learn more about the risk?
9351     1.
9352Risk monitoring 2.
9353Risk planning
93543.
9355Risk analysis
93564.
9357Risk identification
9358    1.0
9359 
9360   S.NO.
9361  Questions
9362    Choices
9363   Answers
9364    1116
9365What characteristic of RAM memory makes it not suitable for permanent storage?
9366  1.
9367too slow 2.
9368unreliable 3.
9369it is volatile 4.
9370too bulky
9371   3.0
9372     1117
9373  What do the 'c' and 'v' in argv stands for?
9374    1.'c' means argument count 'v' means argument vector 2.'c' means argument count 'v' means argument vertex 3.'c' means argument configuration 'v' means argument visibility 4.'c' means argument control 'v' means argument vector
9375     1.0
9376     1118
9377  What does /[^(]* regular expression indicate ?
9378    1.Match one or more characters that are not open paranthesis 2.Match zero or more characters that are open paranthesis 3.Match zero or more characters that are not open paranthesis 4.Match one or more characters that are open paranthesis
9379     2.0
9380     1119
9381  What does explode function in php do
9382    1.Used to convert a string to an array 2.Used to split a given string into the number of chunks specified 3.Used to split a string by a string 4.Used to split string into two equal halves
9383     1.0
9384     1120
9385  What does microprocessor speed depends on
9386    1.Clock 2.Address bus width 3.Data bus width 4.Size of register
9387     2.0
9388   1121
9389   What does parseFloat(9+10) evaluates to in JavaScript?
9390     1.19 2.910 3.9109 4.91
9391    1.0
9392   1122
9393 What does the following declaration mean? int (*ptr)[10];
9394    1.ptr is array of pointers to 10 integers 2.ptr is a pointer to an array of 10 integers 3.ptr is an array of 10 integers 4.ptr is an pointer to array
9395   2.0
9396    1123
9397What elements will the following script output?
9398<?php
9399$array = array (true => 'a', 1 => 'b'); var_dump ($array);
9400?>
9401  1.
94021 => 'b'
94032.
9404True => 'a', a => 'b' 3.
9405NULL
94064.
94070 => 'a', 1 => 'b'
9408   3.0
9409   1124
9410   What gets printed? $str = 'a\\b\n'; echo $str;
9411     1.ab(newline) 2.a\b(newline) 3.a\b\n 4.a\\b(newline)
9412    3.0
9413   1125
9414 What happens if no file path is given in include() function?
9415    1.PHP continues to execute the script. 2.Results in a fatal error 3.Include_path is made use of 4.It haults the script.
9416   3.0
9417    1126
9418What is a Software ?
9419  1.
9420Software is set of programs
94212.
9422Software is documentation and configuration of data
94233.
9424Software is set of programs and Software is documentation and configuration of data
94254.
9426Software is a set of documents.
9427   3.0
9428   1127
9429   What is asynchronous counter.
9430     1.none of them 2.A master clock triggers all the flip-flops at a time 3.all the flip-flop are combined to common clock 4.each flip-flop has it own clock
9431    4.0
9432   1128
9433What is data encryption standard (DES)?
9434   1.
9435block cipher
94362.
9437stream cipher
94383.
9439bit cipher
94404.
9441none of the mentioned
9442   1.0
9443 
9444   S.NO.
9445  Questions
9446    Choices
9447   Answers
9448    1129
9449What is interframe gap?
9450  1.
9451idle time between frames
94522.
9453idle time between frame bits 3.
9454idle time between packets
94554.
9456none of the mentioned
9457   1.0
9458     1130
9459  What is meant by parallel-loading the register?
9460    1.Shifting the data in all flip-flops simultaneously 2.Loading data in two of the flip-flops 3.Loading data in all flip-flops at the same time 4.Momentarily disabling the synchronous SET and RESET inputs
9461     3.0
9462   1131
9463   What is the best case for linear search
9464     1.O(n) 2.O(1) 3.O(log n) 4.O(2n)
9465    2.0
9466    1132
9467What is the code to start displaying the time when document loads?
9468  1.onload = displayTime; 2.window. = displayTime; 3.window.onload = displayTime; 4.window.onload = start;
9469   3.0
9470     1133
9471  What is the condition for resetting(s=0) the S flag in status register?
9472    1.MSB of the result is One 2.MSB of the result is zero 3.LSB of the result is one 4.LSB of the result is zero
9473     2.0
9474   1134
9475   What is the correct CSS syntax for making all the elements bold?
9476     1.p {font-weight:bold;} 2.p style="text-size:bold" 3.p {text-size:bold} 4.p style="font-size:bold">
9477    1.0
9478    1135
9479What is the correct way to connect to a MySQL database?
9480  1.mysqli_db(host,username,password,dbname); 2.mysqli_connect(host,username,password,dbname); 3.mysqli_open(host,username,password,dbname);
94814.
9482mysqli_connect(,,)
9483   2.0
9484     1136
9485  What is the data structures used to perform recursion?
9486    1.list 2.queue 3.stack 4.Tree
9487     3.0
9488     1137
9489  What is the default execution time set in set_time_limit()?
9490    1.20 secs 2.30 secs 3.40 secs 4.50 secs
9491     2.0
9492   1138
9493   What is the default size of a file set in upload_max_filesize ?
9494     1.1 MB 2.2 MB 3.2.5 MB 4.3 MB
9495    2.0
9496    1139
9497What is the difference between echo and print?
9498  1.They both behave the same. 2.Print can take multiple parameters where as echo cannot 3.Echo can take multiple parameters where as print cannot 4.Print is a function where as echo is not.
9499   3.0
9500   1140
9501   What is the following style an example of? img[alt~="Pie"]
9502     1.Attribute Match 2.Exact Value Match 3.Contains Value Match 4.Subcode Match
9503    3.0
9504   1141
9505 What is the highest normal form level satisfied by the following table design? R= {A1,A2,A3,A4,A4} F={A1-> A3, A3->A4}Key ={A1,A2}
9506    1.
95071 NF 2.
95082 NF 3.
95093 NF 4. BCNF
9510    2.0
9511    1142
9512What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A -> Ñ” and A -> a) to parse a string with n tokens?
9513  1. n/2 2. n-1 3. 2n-1 4. 2^n
9514   2.0
9515     1143
9516  What is the maximum size of data that the application layer can pass on to the TCP layer below?
9517    1.
9518Any size
95192.
95202^16 bytes-size of TCP header 3.
95212^16 bytes
95224.
95231500 bytes
9524     1.0
9525   1144
9526   What is the minimum number of NAND gates required to implement A + AB` + AB`C?
9527     1.0 2.1 3.2 4.3
9528    1.0
9529   1145
9530What is the most essential purpose of paranthesis in regular expressions?
9531   1.Define pattern matching techniques 2.Define subpatterns within the complete pattern 3.Define portion of strings in the regular expression 4.All of the mentioned
9532  2.0
9533 
9534   S.NO.
9535  Questions
9536    Choices
9537   Answers
9538   1146
9539 what is the need of segmenting the memory in 8086
9540    1.Increase the memory accessibility 2.Increase the memory addressibility 3.easy to retrieve data 4.faster access
9541   2.0
9542   1147
9543 What is the normal order of activities in which traditional software testing is organized? a. integration testing b. system testing c. unit testing d.validation testing
9544    1.
9545a, d, c, b 2.
9546b, d, a, c
95473.
95483.0c, a, d, b 4.
9549d, b, c, a
9550    1.0
9551    1148
9552What is the order of the stages in the waterfall mode?
9553  1.
9554Requirements Definition, System & Software Design, Implementation & Unit Testing, Integration & System Testing, Operation & Maintenance.
95552.
9556Requirements Definition, Integration & System Testing, System & Software Design, Implementation & Unit Testing, Operation & Maintenance.
95573.
9558System & Software Design, Requirements Definition, Operation & Maintenance, Implementation & Unit Testing, Integration & System Testing.
95594.
9560Implementation & Unit Testing, Requirements Definition, System & Software Design, Integration & System Testing, Operation & Maintenance.
9561   1.0
9562     1149
9563  what is the output for the following function? LPAD(salary,10,'*')
9564    1. 10***24000 2. *****24000 3. 24000***** 4.
9565error
9566     2.0
9567     1150
9568  What is the output?
9569#include <stdio.h> void main()
9570{
9571int a=3,b=2; a=a==b==0; printf("%d,%d",a,b);
9572}
9573    1. 1,2 2. 3,2 3. 0,0 4. 2,3
9574     1.0
9575     1151
9576  What is the purpose of $_SESSION[]?
9577    1.
9578Used to register a global variable
95792.
9580Used to initialize a session
95813.
9582Used to store variables of the current session 4.
9583Used to initialize a cookie
9584     3.0
9585   1152
9586   What is the result of the following code snippet? window.location === document.location
9587     1.False 2.True 3.0 4.1
9588    2.0
9589    1153
9590What is the strpos() function used for?
9591  1.Find the last occurrence of the string within a string 2.Find the first occurrence of the string within a string 3.Find both last and first occurence 4.Search for all occurrence within a string
9592   2.0
9593     1154
9594  What is the time complexity for binary search
9595    1.O(log n) 2.O(n^2) 3.O(1) 4.O(2n)
9596     1.0
9597     1155
9598  What is the time complexity for insertion sort
9599    1.O(log n) 2.O(n) 3.O(n^2) 4.O(1)
9600     3.0
9601   1156
9602  What is the worst case for Selection sort
9603    1.O(log n) 2.O(2n) 3.O(n) 4.O(n^2)
9604   4.0
9605 
9606   S.NO.
9607  Questions
9608    Choices
9609   Answers
9610    1157
9611What is Wired Equivalent Privacy(WEP)?
9612  1.
9613security algorithm for ethernet
96142.
9615security algorithm for wireless networks 3.
9616security algorithm for USB
96174.
9618None
9619   2.0
9620   1158
9621   What is WPA?
9622      1.
9623wi-fi protected access 2.
9624wired protected access 3.
9625wired process access 4.
9626wi-fi process access
9627     1.0
9628    1159
9629What is x+ mode in fopen() used for?
9630  1.
9631Read/Write. Creates a new file. Returns FALSE and an error if file already exists
96322.
9633Write only. Creates a new file. Returns TRUE and an error if file already exists
96343.
9635Read/Write. Opens and clears the contents of file 4.
9636Write. Opens and clears the contents of file
9637   1.0
9638   1160
9639   What keyword covers unhandled possibilities?
9640     1.other 2.default 3.contingency 4.all
9641    2.0
9642   1161
9643 What kind of schema it is?
9644Student(sid, sname, dob, address, pincode)
9645    1.Relaional
96462.Logical Schema 3.Conceptual Schema 4.External View
9647   1.0
9648   1162
9649 What library do you need in order to process images?
9650    1.
9651GD library
96522.
9653ZIP library
96543.
9655Win32 API library 4.
9656BOGUS library
9657    1.0
9658    1163
9659What type of declaration is this: unsigned num;
9660  1.
9661num is unsigned integer 2.
9662num is unsigned float
96633.
9664num is unsigned character 4.
9665Invalid declaration
9666   4.0
9667   1164
9668  What type of register would shift a complete binary number in one bit at a time and shift all the stored bits out one bit at a time?
9669    1.PIPO 2.PISO 3.SIPO 4.SISO
9670   4.0
9671 
9672   S.NO.
9673  Questions
9674    Choices
9675   Answers
9676    1165
9677What will be the output? #include <stdio.h>
9678int main()
9679{
9680extern int ok;
9681printf("value of ok = %d",ok); return 0;
9682}
9683extern int ok=1000;
9684  1.
9685Declaration Error 2.
9686value of ok = 1000 3.
9687value of ok = 0
96884.
9689Linking Error
9690   2.0
9691   1166
9692   What will be the result of the expression 13 & 25
9693     1.25 2.38 3.9 4.12
9694    3.0
9695    1167
9696What will be the status of a computer during storage compaction
9697  1.
9698High paging activity
96992.
9700Thrasing happens
97013.
9702Working set model developed 4.
9703It will sit idle
9704   4.0
9705   1168
9706   What will happen if the first argument of open() is omitted?
9707     1.Error Page 2.Remains in the same page 3.about:blank 4.Open the first page in the history
9708    3.0
9709    1169
9710What will the following script output?
9711<?php
9712$array = array (1, 2, 3, 5, 8, 13, 21, 34, 55); $sum = 0;
9713for ($i = 0; $i < 5; $i++) {
9714$sum += $array[$array[$i]];
9715}
9716echo $sum;
9717?>
9718  1.
971978
97202.
972119
97223. NULL 4.
97235
9724   1.0
9725   1170
9726   What would be the output of the below code fragment? var a = ["s","a","v","e"]; document.write(a.join(""));
9727     1.Undefined 2.save 3.vase 4.S
9728    2.0
9729   1171
9730 1.0
9731    1. true 2. false 3. 4.
9732   1.0
9733    1172
9734When a new row is inserted the constraints that can be violated are
9735  1.
9736Primary Key constraint
97372.
9738Referential Integrity Constraint 3.
9739all of the options
97404.
9741Domain Constraint
9742   1.0
9743   1173
9744  When a single item that triggers other data flow along one of many paths of a data flow diagram, ________ characterizes the information flow.
9745     1.
97463.0high coupling 2.
9747poor modularity 3.
9748transaction flow
97494.
9750transform flow
9751    1.0
9752 
9753   S.NO.
9754  Questions
9755    Choices
9756   Answers
9757    1174
9758When displaying a web page, the application layer uses the
9759  1.
9760HTTP protocol 2.
9761FTP protocol 3.
9762SMTP protocol 4.
9763IMAP Protocol
9764   1.0
9765   1175
9766   When operated in slave mode, the PIC outputs its type number only if the cascaded address received on CAS0-CAS2 matches the address programmed in --------- bits D0-D2
9767     1.ICW1 2.ICW2 3.ICW3 4.ICW4
9768    4.0
9769    1176
9770When the overall flow in a segment of a data flow diagram is largely sequential and follows straight-line paths, _________ is present.
9771  1.
97724.0low coupling 2.
9773good modularity
97743.
9775transaction flow
97764.
9777transform flow
9778   3.0
9779   1177
9780   When the pre-order and post-order traversal of a Binary Tree generates the same output, the tree can have maximum
9781     1.Three nodes 2.Two nodes 3.One node 4.Any number of nodes
9782    3.0
9783    1178
9784When there are infinite distinguishable strings then there cannot be a -------------
9785  1.
9786automata
97872.
9788finite automata
97893.
9790regular expression
97914.
9792both finite automata and regular expression
9793   2.0
9794     1179
9795  When there is an indefinite or an infinity value during an arithmetic value computation, javascript
9796    1.
9797Prints an exception error 2.
9798Prints an overflow error 3.
9799Displays “Infinity”
98004.
9801Prints the value as such
9802     3.0
9803   1180
9804   When used with the datalist element, what is the list attribute in HTML5 used to accomplish?
9805     1.Local databases 2.Drop down lists 3.Autocompletion 4.Global Databases
9806    3.0
9807    1181
9808When we concatenate two languages L1 and L2 recognized by machine M1 and M2 we obtain a machine with final state same as that of __________________
9809  1.
9810M2
98112.
9812M1 and M2 3.
9813M1
98144.
9815M1 or M2
9816   2.0
9817   1182
9818  when you were asked to design a relation, you come across a situation, where passport number is to be included for the people. All the students wont be having passport. So what constraint you would be using?
9819     1.
9820Primary Key 2.
9821Not Null
98223.
9823Default
98244.
9825Unique
9826    4.0
9827 
9828   S.NO.
9829  Questions
9830    Choices
9831   Answers
9832    1183
9833Which of the following is shared between all of the threads in a process? Assume a kernel level thread implementation
9834  1.
9835Register values
98362.
9837File descriptors
98383.
9839Scheduler priority 4.
9840Local variables
9841   2.0
9842   1184
9843   Which buffer is a parallel to serial converter that receives a parallel byte for conversion into a serial signal and further transmission onto the communication channel.
9844     1.Transmit buffer 2.Receive buffer 3.Data bus buffer 4.Modem control
9845    1.0
9846    1185
9847Which character function can be used to return a specified portion of a character string?
9848  1.
9849INSTR
98502. SUBSTRING 3.
9851SUBSTR
98524.
9853POS
9854   3.0
9855     1186
9856  Which command we use to set an image on background?
9857    1.image-background:url('R4R_Logo.jpg') 2.background- image:url('R4R_Logo.jpg') 3.bg-image:url('R4R_Logo.jpg') 4.background-image:href('R4R_Logo.jpg')
9858     2.0
9859   1187
9860   Which Data structure is best suited for the UNDO operation in Windows
9861     1.Both Stack and Queues 2.Queues 3.Stack 4.Arrays
9862    3.0
9863    1188
9864Which database level is closest to the users?
9865  1.
9866External
98672. Conceptual 3.
9868Internal
98694.
9870Physical
9871   1.0
9872     1189
9873  Which date function is used to obtain the date of next Wednesday
9874    1.
9875NEXT_DAY
98762.
9877LAST_DAY
98783.
9879NEXT_DA TE
98804.
9881All of the options
9882     3.0
9883   1190
9884  4.0
9885     1.
9886Architectural design
98872.
9888Component-level design 3.
9889Data design
98904.
9891Interface design
9892    3.0
9893 
9894   S.NO.
9895  Questions
9896    Choices
9897   Answers
9898    1191
9899Which directory implementation is used in most of the Operating Systems?
9900  1.
9901Single level directory structure 2.
9902Two level directory structure 3.
9903Tree directory structure
99044.
9905Acyclic directory structure
9906   3.0
9907     1192
9908  Which directory implementation method creates more dangling pointers?
9909    1.
9910Single level directories
99112.
9912Two level directories
99133.
9914Tree Structured Diretories 4.
9915Acyclic graph directories
9916     4.0
9917   1193
9918   Which element is used to draw graphics images on a web page?
9919     1.script 2.audio 3.embed 4.canvas
9920    4.0
9921    1194
9922Which granularity level of testing checks the behavior of module cooperation?
9923  1.
9924Unit Testing
99252.
9926Integration Testing 3.
9927Acceptance Testing 4.
9928Regression Testing
9929   2.0
9930   1195
9931   Which header file should be included to use functions like malloc() and calloc()?
9932     1.string.h 2.dos.h 3.memory.h 4.stdlib.h
9933    4.0
9934   1196
9935 Which Instruction word is used to specify the number of stop bits, data bits, parity bit and the baud rate clock factor for the 8251A USART
9936    1.Mode 2.Command followed by Mode 3.Command 4.Mode followed by command
9937   4.0
9938    1197
9939Which is a major problem with SQL?
9940  1.
9941SQL cannot support object-orientation
99422.
9943The same query can be written in many ways, each with vastly different execution plans.
99443.
9945SQL syntax is too difficult for non-computer professionals to use 4.
9946SQL creates excessive locks within the database
9947   2.0
9948   1198
9949  Which is not related to deadlock avoidance?
9950     1.
9951Safe State
99522.
9953Unsafe State
99543.
9955Safe Sequence
99564.
9957Resource sequence
9958    3.0
9959 
9960   S.NO.
9961  Questions
9962    Choices
9963   Answers
9964    1199
9965Which is one of the most important stakeholder from the following ?
9966  1.
9967Entry level personnel
99682.
9969Middle level stakeholder 3.
9970Managers
99714.
9972Users of the software
9973   4.0
9974     1200
9975  Which is the correct way to write a JavaScript array?
9976    1.
9977var txt = new Array(1:"tim",2:"kim",3:"jim")
99782.
9979var txt = new Array:1=("tim")2=("kim")3=("jim") 3.
9980var txt = new Array("tim","kim","jim")
99814.
9982var txt = new Array="tim","kim","jim"
9983     3.0
9984     1201
9985  Which is used to store critical pieces of data during subroutines and interrupts
9986    1.
9987Stack
99882.
9989Queue
99903. Accumulator 4.
9991Data register
9992     1.0
9993     1202
9994  Which item is an example of a physical network address?
9995    1.IP address 2.MAC address 3.Workstation name 4.www.proprofs.com
9996     2.0
9997   1203
9998   Which JavaScript function is most useful for finding errors?
9999     1.Confirm 2.Prompt 3.Debug 4.Alert
10000    3.0
10001    1204
10002Which method bypasses the CPU for certain types of data transfer?
10003  1.
10004Software interrupts
100052.
10006Interrupt-driven I/O
100073.
10008Polled I/O
100094.
10010Direct memory access (DMA)
10011   4.0
10012   1205
10013   Which method is used for loading the driver in Java JDBC.
10014      1.
10015getDriver() method 2.
10016class.forName()
100173.
10018createStatement()
100194.
10020getConnection()
10021     1.0
10022   1206
10023Which method is used to search for a substring?
10024   1.
10025stringV ariable.substring(subString) 2.
10026stringV ariable.find(subString)
100273.
10028stringV ariable.indexOf(subString) 4.
10029stringV ariable.indexOf(charAt(0))
10030   3.0
10031 
10032   S.NO.
10033  Questions
10034    Choices
10035   Answers
10036    1207
10037Which model can be selected if user is involved in all the phases of SDLC?
10038  1.
10039Waterfall Model
100402.
10041Prototyping Model
100423.
10043RAD Model
100444.
10045Prototyping Model and RAD model
10046   3.0
10047   1208
10048   3.0
10049      1.
10050design model
100512.
10052implementation model 3.
10053user model 4.
10054client model
10055     2.0
10056    1209
10057Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?
10058  1.
10059CDMA
100602. CSMA/CA 3.
10061ALOHA
100624. CSMA/CD
10063   2.0
10064   1210
10065   Which of the below given sorting techniques has highest best-case runtime complexity?
10066     1.bubble sort 2.insertion sort 3.quick sort 4.selection sort
10067    3.0
10068   1211
10069 Which of the following (in file scope) leads to a compile-time error?
10070    1.const int a=90; 2.const int f1() { return 100; } 3.int f2() const { return 200; } 4.const int f3( const int i) { return 300;}
10071   3.0
10072   1212
10073   Which of the following activities is not one of the four things that need to be accomplished by the generic planning task set?
10074  1.
100753.0Develop overall project strategy 2.
10076Identify the functionality to deliver in each software increment 3.
10077Create a detailed schedule for the complete software project
100784.
10079Devise a means of tracking progress on a regular basis 1.
100801 and 4 2.
100811 and 2 3.
100822 and 3 4.
100831,2 and 4
10084    4.0
10085    1213
10086  Which of the following addressing modes are suitable for program relocation at run time?
100871. Absolute addressing 2. Based addressing
100883. Relative addressing 4. Indirect addressing
10089   4.0
10090     1214
10091  Which of the following algorithm design technique is used in the quick sort algorithm?
10092    1.Greedy method 2.Backtracking 3.Divide and conquer 4.Dynamic programming
10093     3.0
10094     1215
10095  Which of the following algorithm is Minimum Spanning Tree in graph
10096    1.Dijiktra's algorithm 2.AVL Tree algorithm 3.Kruskal's algorithm 4.Merge algorithm
10097     3.0
10098   1216
10099  Which of the following algorithm is used to find the shortest path between two nodes in graph
10100    1.Dijiktra's algorithm 2.Prim's algorithm 3.Kruskal's algorithm 4.Merge algorithm
10101   1.0
10102 
10103   S.NO.
10104  Questions
10105    Choices
10106   Answers
10107    1217
10108Which of the following are decidable?
10109I. Whether the intersection of two regular languages is infinite
10110II. Whether a given context-free language is regular
10111III. Whether two push-down automata accept the same language IV. Whether a given grammar is context-free
10112  1.
10113I and II 2.
10114I and IV 3.
10115II and III 4.
10116I and III
10117   3.0
10118     1218
10119  Which of the following attribute is needed for file upload via form?
10120    1. enctype='multipart/form-data' 2.
10121enctype='singlepart/data'
101223.
10123enctype='file'
101244.
10125enctype='form-data/file'
10126     1.0
10127     1219
10128  Which of the following can be a valid column name?
10129    1.
10130Column
101312. 1966_Invoices 3.
10132Catch_#22
101334.
10134#Invoices
10135     3.0
10136     1220
10137  Which of the following can't be done with client-side JavaScript?
10138    1.Validating a form 2.Sending a form's contents by email 3.Storing the form's contents to a database file on the server 4.Testing the form
10139     3.0
10140   1221
10141   Which of the following case does not exist in complexity theory?
10142     1.Average case 2.Worst case 3.Best case 4.Null case
10143    4.0
10144    1222
10145Which of the following command words need to be programmed to operate a single PIC in fully nested mode with an 8086 microprocessor
10146  1.ICW1 and ICW2 2.ICW1, ICW2 and ICW4 3.ICW2 and ICW3 4.ICW1 and ICW4
10147   2.0
10148   1223
10149   Which of the following correctly describes C++ language?
10150     1.Statically typed language 2.Dynamically typed language 3.Both Statically and dynamically typed language 4.Type-less language
10151    4.0
10152    1224
10153Which of the following describes a handle (as applicable to LR-parsing) appropriately?
10154  1.
10155It is the position in a sentential form where the next shift or reduce operation will occur
101562.
10157It is non-terminal whose production will be used for reduction in the next step
101583.
10159It is a production that may be used for reduction in a future step along with a position in the sentential form where the next shift or reduce operation will occur
101604.
10161It is the production p that will be used for reduction in the next step along with a position in the sentential form where the right hand side of the production may be found
10162   4.0
10163   1225
10164   Which of the following explains cookies nature?
10165     1.Non Volatile 2.Volatile 3.Intransient 4.Transient
10166    4.0
10167   1226
10168Which of the following file access method needs a relative block number 'n'?
10169   1.
10170Contiguous allocation 2.
10171Linked allocation
101723.
10173Direct access
101744.
10175Sequential access
10176   3.0
10177 
10178   S.NO.
10179  Questions
10180    Choices
10181   Answers
10182    1227
10183Which of the following function is used to terminate the script execution in PHP?
10184  1. break() 2. quit() 3.
10185die()
101864. exit()
10187   3.0
10188   1228
10189   Which of the following function sets first n characters of a string to a given character?
10190     1.strset() 2.strnset() 3.strinit() 4.strcset()
10191    2.0
10192    1229
10193Which of the following grammar rules violate the requirements of an operator grammar ? P, Q, R are nonterminals, and r, s, t are terminals.
10194  1.
101951 and 3 only
101962.
101971 only
101983.
101992 and 3 only
102004.
102011,2,3 and 4 only
10202   1.0
10203 1. P→QR
102042. P→QsR 3. P→ε
102054. P→QtRr
10206   1230
10207   which of the following intermediate language can be used in intermediate code generation?
10208     1.Postfix notation and Three address code 2.Quadraples 3.Triples 4.Infix notation and two address code
10209    1.0
10210    1231
10211Which of the following is a black box testing strategy?
10212  1.
10213All Statements Coverage
102142.
10215Control Structure Coverage 3.
10216Cause-Effect Graphs
102174.
10218ALL
10219   3.0
10220     1232
10221  Which of the following is a comparison operator in SQL?
10222    1.
10223=
102242.
10225LIKE
102263. BETWEEN 4.
10227all of the options
10228     4.0
10229   1233
10230  Which of the following is a dynamic model that shows how the system interacts with its environment as it is used?
10231     1.
10232system context model 2.
10233interaction model
102343.
10235environmental model 4.
10236both system context and interaction
10237    2.0
10238 
10239   S.NO.
10240  Questions
10241    Choices
10242   Answers
10243    1234
10244Which of the following is a legal expression in SQL?
10245  1.
10246SELECT NULL FROM EMPLOYEE;
102472.
10248SELECT NAME FROM EMPLOYEE;
102493.
10250SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL; 4.
10251None of the options
10252   2.0
10253     1235
10254  Which of the following is a problem of file management system?
10255    1.
10256difficult to update
102572.
10258lack of data independence 3.
10259data redundancy
102604.
10261all options given
10262     4.0
10263     1236
10264  Which of the following is a project scheduling method that can be applied to software development?
10265    1.
10266PERT
102672.
10268CPM
102693.
10270CMM
102714.
10272both PERT and CPM
10273     4.0
10274     1237
10275  Which of the following is a wrong example of network layer
10276    1.X.25 level 2-ISO 2.Source routing and Domains Naming Usenet 3.X.25 packet land protocols (PLP-ISO) 4.Internet protocol (I/P) ARPA NET
10277     1.0
10278     1238
10279  which of the following is an incorrect definition inside a class ?
10280    1.void * operator new(size_t size) { } 2.void * operator new () { } 3.void operator delete(void * ptr) { } 4.int operator ++() { }
10281     2.0
10282   1239
10283   which of the following is an incorrect definition inside a class ?
10284     1.void * operator new(size_t size) { } 2.void * operator new () { } 3.void operator delete(void * ptr) { } 4.int operator ++() { }
10285    2.0
10286   1240
10287 Which of the following is false for cin?
10288    1.It is a class of which stream is an object. 2.Using cin, the data can be read from user's terminal. 3.It represents standard input. 4.It is an object of istream class.
10289   1.0
10290    1241
10291Which of the following is golden rule for interface design?
10292  1.
10293Place the user in control
102942.
10295Reduce the user’s memory load 3.
10296Make the interface consistent 4.
10297ALL
10298   4.0
10299   1242
10300  Which of the following is lowest in memory hierarchy?
10301     1.
10302Cache memory
103032.
10304Secondary memory 3.
10305Registers 4.
10306RAM
10307    3.0
10308 
10309   S.NO.
10310  Questions
10311    Choices
10312   Answers
10313    1243
10314Which of the following is not a binary operator in relational algebra?
10315  1.
10316Join
103172. Semi-Join 3. Assignment 4.
10318Project
10319   4.0
10320     1244
10321  Which of the following is not a form of memory ?
10322    1.
10323Instruction cache
103242.
10325Instruction register
103263.
10327Instruction opcode
103284.
10329Translation-a-side buffer
10330     3.0
10331     1245
10332  Which of the following is not a property of a transaction?
10333    1. atomicity 2. consistency 3.
10334dirty read 4. durability
10335     4.0
10336     1246
10337  Which of the following is not a SQA plan for a project?
10338    1.
10339evaluations to be performed
103402.
10341amount of technical work
103423.
10343audits and reviews to be performed
103444.
10345documents to be produced by the SQA group
10346     2.0
10347     1247
10348  Which of the following is not a valid attribute of the INPUT tag?
10349    1.TEXT 2.NAME 3.SIZE 4.MAXLENGTH
10350     4.0
10351   1248
10352   Which of the following is NOT a valid PHP comparison operator?
10353     1.!= 2.>= 3.&&& 4.===
10354    3.0
10355    1249
10356Which of the following is not an example of infrastructure components that may need to be integrated into the software architecture?
10357  1.
10358Communications components 2.
10359Database components
103603.
103614.0Interface components 4.
10362Memory management components
10363   2.0
10364   1250
10365   Which of the following is not characteristics of a relational database model
10366     1.Complex logical relationships 2.Treelike structure 3.Tables 4.Records
10367    2.0
10368   1251
10369Which of the following is not considered as a risk in project management?
10370   1.
10371Specification delays 2.
10372Product competition 3.
10373Testing
103744.
10375Staff turnover
10376   4.0
10377 
10378   S.NO.
10379  Questions
10380    Choices
10381   Answers
10382    1252
10383Which of the following is not hardware:
10384  1.
10385Magnetic tape 2.
10386Printer
103873.
10388VDU terminal 4.
10389Assembler
10390   4.0
10391     1253
10392  Which of the following is not one of Hooker's core principles of software engineering practice?
10393    1.
10394All design should be as simple as possible, but no simpler
103952.
10396A software system exists only to provide value to its users.
103973.
10398Pareto principle (20% of any product requires 80% of the effort)
103994.
104003.0Remember that you produce others will consume
10401     3.0
10402     1254
10403  Which of the following is not one of the principles of good coding?
10404    1.
10405Create unit tests before you begin coding
104062.
104073.0Create a visual layout that aids understanding 3.
10408Keep variable names short so that code is compact 4.
10409Write self-documenting code, not program documentation
10410     4.0
10411   1255
10412   Which of the following is not possible using PHP?
10413     1.Deleting files from the server 2.Redirect a visitor to another page 3.Set the value of the window statusbar 4.Obtain the IP address of a Visitor
10414    4.0
10415    1256
10416Which of the following is not the attribute of FCB?
10417  1.
10418File permissions
104192.
10420Program Counter
104213.
10422Access Control List
104234.
10424Pointers to file control blocks
10425   4.0
10426   1257
10427   Which of the following is not the characteristic of constructor?
10428     1.They should be declared in the public section.
10429. 2.They do not have return type. 3.They can not be inherited. 4.They can be virtual.
10430    4.0
10431    1258
10432Which of the following is the best type of module cohesion?
10433  1.
10434Functional Cohesion 2.
10435Temporal Cohesion 3.
10436Functional Cohesion 4.
10437Sequential Cohesion
10438   3.0
10439   1259
10440  Which of the following is the worst type of module coupling?
10441     1.
10442Control Coupling 2.
10443Stamp Coupling 3.
10444External Coupling 4.
10445Content Coupling
10446    3.0
10447 
10448   S.NO.
10449  Questions
10450    Choices
10451   Answers
10452   1260
10453 Which of the following is TRUE?
10454    1.
10455Every subset of a regular set is regular.
104562.
10457Every finite subset of a non-regular set is regular. 3.
10458Every finite subset of a non-regular set is regular. 4.
10459Infinite union of finite sets is regular.
10460    1.0
10461    1261
10462Which of the following is true?
10463  1.
10464The complement of a recursive language is recursive.
104652.
10466The complement of a recursively enumerable language is recursively enumerable
104673.
10468The complement of a recursive language is either recursive or recursively enumerable
104694.
10470The complement of a context-free language is context-free
10471   1.0
10472     1262
10473  Which of the following is TRUE?
10474    1.
10475Every relation in 2NF is also in BCNF
104762.
10477A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
104783.
10479Every relation in BCNF is also in 3NF
104804.
10481No relation can be in both BCNF and 3NF
10482     3.0
10483     1263
10484  Which of the following is true?
10485    1.
10486Segmentation is faster than paging 2.
10487Paging is faster than segmentation 3.
10488Pages are unequal sized pieces
104894.
10490Segments are equal sized pieces
10491     2.0
10492   1264
10493   Which of the following is useful in traversing a given graph by breadth first search?
10494     1.List 2.Queue 3.Set 4.Stack
10495    2.0
10496   1265
10497 Which of the following is valid reason for collecting customer feedback concerning delivered software?
10498    1.
10499Do not allows developers to make changes to the delivered increment
105002.
105012.0Delivery schedule can be revised to reflect changes 3.
10502Developers can not identify changes to incorporate into next increment 4.Delivery schedule can't be revised to reflect changes
10503     4.0
10504   1266
10505Which of the following is/are the DDL statements?
10506   1.
10507Create
105082.
10509Drop
105103.
10511Alter
105124.
10513All of the options
10514   4.0
10515 
10516   S.NO.
10517  Questions
10518    Choices
10519   Answers
10520   1267
10521 Which of the following languages are context-free?
10522  1.L1 and L2 only 2. L1 and L3 only
105233.
10524L3 only
105254.
10526L1 only
10527    2.0
10528  L1={ambnanbm ⎪ m,n≥1} L2={ambnambn ⎪ m,n≥1} L3={ambn ⎪ m=2n+1}
10529     1268
10530Which of the following memory allocation scheme suffers from External fragmentation?
10531  1.
10532Segmentation
105332.
10534Pure Demand Paging 3.
10535swapping
105364.
10537paging
10538   1.0
10539     1269
10540  Which of the following most certainly implies the need for an entire table to implement?
10541    1.
10542A binary relationship
105432.
10544A ternary relationship
105453.
10546A recursive relationship
105474.
10548An identifying relationship
10549     4.0
10550   1270
10551   Which of the following name does not relate to stacks?
10552     1.FIFO lists 2.LIFO list 3.Push-down lists 4.Piles
10553    1.0
10554    1271
10555Which of the following operation is used if we are interested in only certain columns of a table?
10556  1. PROJECTION 2. SELECTION 3.
10557UNION
105584.
10559JOIN
10560   1.0
10561     1272
10562  Which of the following operator can be overloaded through friend function?
10563    1.-> 2.= 3.( ) 4.*
10564     4.0
10565   1273
10566   Which of the following operators has an associativity from Right to Left?
10567     1.+= 2.== 3.<< 4.<=
10568    3.0
10569   1274
10570 Which of the following pattern is the basis of interaction management in many web-based systems?
10571    1.
10572architecture
105732.
10574repository pattern
105753.
10576model-view-controller
105774.
10578different operating system
10579    3.0
10580   1275
10581Which of the following problems is undecidable?
10582   1.
10583Membership problem for CFGs 2.
10584Ambiguity problem for CFGs. 3.
10585Finiteness problem for FSAs
105864.
10587Equivalence problem for FSAs.
10588   2.0
10589 
10590   S.NO.
10591  Questions
10592    Choices
10593   Answers
10594    1276
10595Which of the following problems is undecidable?
10596  1.
10597Deciding if a given context-free grammar is ambiguous.
105982.
10599Deciding if a given string is generated by a given context-free grammar
106003.
10601Deciding if the language generated by a given context-free grammar is empty
106024.
10603Deciding if the language generated by a given context-free grammar is finite.
10604   1.0
10605     1277
10606  Which of the following process is concerned with analyzing the costs and benefits of proposed changes?
10607    1.
10608Change management 2.
10609Version management 3.
10610System building
106114.
10612Release management
10613     1.0
10614   1278
10615   Which of the following property allows you to specify an element’s position with respect to the browser window?
10616     1.relative 2.fixed 3.static 4.absolute
10617    1.0
10618    1279
10619Which of the following risk is the failure of a purchased component to perform as expected?
10620  1.
10621Product risk 2.
10622Project risk 3.
10623Business risk 4.
10624Programming risk
10625   1.0
10626     1280
10627  Which of the following risks are derived from the organizational environment where the software is being developed?
10628    1.
10629People risks
106302.
10631Technology risks 3.
10632Estimation risks 4.
10633Organizational risks
10634     4.0
10635     1281
10636  Which of the following risks are derived from the software or hardware technologies that are used to develop the system?
10637    1.
10638Managerial risks
106392.
10640Technology risks
106413.
10642Estimation risks
106434.
10644Organizational risks
10645     2.0
10646     1282
10647  Which of the following statements about queues is incorrect?
10648    1.Queues are first-in, first-out (FIFO) data structures 2.Queues can be implemented using arrays 3.Queues can be implemented using linked lists 4.New nodes can only be added at the front of the queue
10649     4.0
10650   1283
10651  Which of the following statements are true in c++?
10652    1.Class members are public by default. 2.Structures can not have functions as members. 3.Classes can not have data as public members. 4.Structures can have functions
10653   1.0
10654 
10655   S.NO.
10656  Questions
10657    Choices
10658   Answers
10659    1284
10660Which of the following statements are TRUE?
10661  1.
10662I and II
106632.
10664I and IV
106653.
10666III and IV 4.
10667I, II and III
10668   2.0
10669 I. There exist parsing algorithms for some programming languages whose complexities are less than O(n3).
10670II. A programming language which allows recursion can be implemented with static storage allocation.
10671III. No L-attributed definition can be evaluated in The framework of bottom-up parsing.
10672IV. Code improving transformations can be performed at both source language and intermediate code level.
10673     1285
10674 Which of the following statements best describes the operation of a synchronous up-/down- counter?
10675     1.In general, the counter can be reversed at any point in its counting sequence. 2.The counter can be reversed, but must be reset before counting in the other direction. 3.The counter can count in either direction, but must continue in that direction once started. 4.The count sequence cannot be reversed, once it has begun, without first resetting the counter to zero.
10676    1.0
10677    1286
10678Which of the following statements explains portabililty in non-functional requirements?
10679  1.
10680It is a degree to which software running on one platform can easily be converted to run on another platform.
106812.
10682It can be enhanced by using languages, OS’ and tools that are universally available and standardized.
106833.
10684The ability of the system to behave consistently in a user-acceptable manner when operating within the environment for which the system was intended.
106854.
10686It is a degree to which software running on one platform can easily be converted to run on another platform as well as It can be enhanced by using languages, OS’ and tools that are universally available and standardized.
10687   1.0
10688     1287
10689  Which of the following statements is false?
10690    1.
10691Every NFA can be converted to an equivalent DFA
106922.
10693Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine
106943.
10695Every regular language is also a context-free language 4.
10696Every subset of a recursively enumerable set is recursive
10697     4.0
10698     1288
10699  Which of the following statements is NOT valid about operator overloading?
10700    1.Overloaded operator must have at least one operand of its class type. 2.Only existing operators can be overloaded. 3.The overloaded operators follow the syntax rules of the original operator. 4.The arity of the operator can be changed
10701     3.0
10702   1289
10703   Which of the following statements is NOT valid about operator overloading?
10704     1.Overloaded operator must have at least one operand of its class type. 2.Only existing operators can be overloaded. 3.The overloaded operators follow the syntax rules of the original operator. 4.The arity of the operator can be changed
10705    4.0
10706   1290
10707 Which of the following statements is true?
10708    1.An INPUT field of type password provides excellent security 2.An INPUT field of type password provides a masked field but no real security 3.A maximum length can not be set for a password field 4.A password INPUT field can only be included in a FORM that uses the get METHOD
10709   4.0
10710    1291
10711Which of the following statements is true?
10712  1.Quadraples have some disadvantages over triples notation for an optimizing compiler 2.For optimizing compiler, moving a statement that defines a temporary value requires us to change all references to that statements. It is an overhead for triples notation 3.For optimizing compiler, triples notation has important benefit where statements are often moved around as it incurs no movements or change 4.All the statements are false
10713   2.0
10714     1292
10715  Which of the following statements is/are TRUE for an undirected graph?P:Number of odd degree vertices is even,Q: Sum of degrees of all vertices is even
10716    1.P Only 2.Q Only 3.Both P and Q 4.Neither P nor Q
10717     1.0
10718   1293
10719  Which of the following statements is/are TRUE for an undirected graph?P:Number of odd degree vertices is even,Q: Sum of degrees of all vertices is even
10720    1.P Only 2.Q Only 3.Both P and Q 4.Neither P nor Q
10721   1.0
10722 
10723   S.NO.
10724  Questions
10725    Choices
10726   Answers
10727    1294
10728Which of the following strategies means that the impact of the risk will be reduced?
10729  1.
10730Avoidance strategies
107312.
10732Minimization strategies 3.
10733Contingency plans
107344.
10735ALL
10736   2.0
10737     1295
10738  Which of the following system calls results in the sending of SYN packets?
10739    1. socket 2.
10740bind
107413. listen 4. connect
10742     4.0
10743     1296
10744  Which of the following term is best defined by the statement “The creation of a new codeline from a version in an existing codeline”?
10745    1. Branching 2. Merging 3. Codeline 4. Mainline
10746     1.0
10747     1297
10748  Which of the following term is best defined by the statement: “Derive traceability information to maximize information hiding in the design.”?
10749    1.
10750Underestimated development time 2.
10751Organizational restructuring
107523.
10753Requirements changes 4.
10754None
10755     3.0
10756     1298
10757  Which of the following term is best defined by the statement: “The underlying technology on which the system is built is superseded by new technology.”?
10758    1.
10759Technology change 2.
10760Product competition 3.
10761Requirements change 4.
10762None
10763     1.0
10764   1299
10765  Which of the following term is best defined by the statement: “There will be a change of organizational management with different priorities.”?
10766     1.
10767Staff turnover
107682.
10769Technology change 3.
10770Management change 4.
10771Product competition
10772    3.0
10773 
10774   S.NO.
10775  Questions
10776    Choices
10777   Answers
10778    1300
10779Which of the following traits need to exist among the members of an agile software team?
10780  1.
10781Competence
107822.
10783Decision-making ability
107843.
107854.0Mutual trust and respect 4.
10786ALL
10787   4.0
10788     1301
10789  Which of the following tree may have smaller elements in its left subtree and larger element in its right subtree
10790    1.B+ Tree 2.AVL Tree 3.Binary tree 4.Binary search Tree
10791     4.0
10792   1302
10793   Which of the following ways below is correct to write a CSS?
10794     1.p {color:red;text-align:center}; 2.p {color:red;text-align:center} 3.p {color:red;text-align:center;} 4.p (color:red;text-align:center;)
10795    3.0
10796    1303
10797Which of the following would cause quickest access
10798  1.
10799direct access from a magnetic tape
108002.
10801direct access from a hard disk
108023.
10803direct access from a floppy disk
108044.
10805direct access from a cassette tape
10806   2.0
10807     1304
10808  Which of the regular expressions given below represent the following DFA?
10809    1.
10810I and II only 2.
10811I and III only 3.
10812II and III only 4.
10813I,II,III
10814     3.0
10815 I) 0*1(1+00*1)* II) 0*1*1+11*0*1 III) (0+1)*1
10816   1305
10817   Which of these contains an executable statement?
10818     1.// var a = 0; // var b = 0;2./* var a = 0; // var b = 0; */3./* var a = 0; */ var b = 0; 4.// var a = 0; /* var b = 0; */
10819    3.0
10820    1306
10821Which of these does not belong to the basic principles of good product design ?
10822  1. Adequacy 2. Feasibility 3. Portability 4. Economy
10823   4.0
10824   1307
10825  Which of these framework activities is not normally associated with the user interface design processes?
10826     1.
10827cost estimation
108282.
108291.0interface construction 3.
10830interface validation 4.
10831user and task analysis
10832    3.0
10833 
10834   S.NO.
10835  Questions
10836    Choices
10837   Answers
10838    1308
10839Which of these is incorrect ?
10840  1.
10841Software engineering belongs to Computer science
108422.
10843Software engineering is a part of more general form of System Engineering
108443.
10845Computer science belongs to Software engineering 4.
10846Software engineering is concerned with the practicalities of developing and delivering useful software
10847   3.0
10848     1309
10849  Which of these is not an element of an object-oriented analysis model?
10850    1.
10851Behavioral elements
108522.
10853Class-based elements
108543.
10855Data elements
108564.
10857Scenario-based elements
10858     4.0
10859     1310
10860  Which of these sets of HTML5 attributes can be used for form validation?
10861    1.required, pattern, min and max 2.auto, fixed, number 3.number, text, currency 4.input, radio,checkbox
10862     1.0
10863   1311
10864   Which one is not a self complementary code?
10865     1.8 4 -2 -1 2.4 8 1 2 3.4 4 3 -2 4.2 4 2 1
10866    3.0
10867   1312
10868 Which one of the following is currently the most popular data model?
10869    1.Network Model
108702.Object Model 3.Notation Model 4.Relational Model
10871   4.0
10872   1313
10873 Which one of the file allocation scheme cannot be adopted for dynamic storage allocation
10874    1.
10875Linked allocation
108762.
10877Fixed Indexed allocation
108783.
10879Variable Indexed allocation 4.
10880Contiguous allocation
10881    2.0
10882    1314
10883Which one of the following algorithm is not used in asymmetric-key cryptography?
10884  1.
10885RSA algorithm
108862.
10887diffie-hellman algorithm
108883.
10889electronic code book algorithm 4.
10890ECC
10891   3.0
10892     1315
10893  Which one of the following allows a user at one site to establish a connection to another site and then pass keystrokes from local host to remote host?
10894    1.
10895HTTP
108962.
10897FTP
108983.
10899telnet
109004.
10901none of the mentioned
10902     3.0
10903   1316
10904  Which one of the following correctly describes the meaning of 'namespace' feature in C++?
10905    1.namespaces provide facilities for organizing the names in a program to avoid name clashes 2.Namespaces refer to space between the names in a program 3.Namespaces refer to the memory space allocated for names used in a program 4.Namespaces refer to the space for names.
10906   1.0
10907 
10908   S.NO.
10909  Questions
10910    Choices
10911   Answers
10912    1317
10913Which one of the following event is not possible in wireless LAN.
10914  1.
10915collision detection
109162.
10917Acknowledgement of data frames 3.
10918multi-mode data transmission
109194.
10920none of the mentioned
10921   1.0
10922     1318
10923  Which one of the following is a cryptographic protocol used to secure HTTP connection?
10924    1.
10925stream control transmission protocol (SCTP) 2.
10926transport layer security (TSL)
109273.
10928explicit congestion notification (ECN)
109294.
10930resource reservation protocol
10931     2.0
10932     1319
10933  Which one of the following is a requirement that fits in a developer’s module ?
10934    1. Availability 2. Testability 3.
10935Usability 4.
10936Flexibility
10937     2.0
10938   1320
10939   Which one of the following is an internet standard protocol for managing devices on IP network?
10940      1.
10941dynamic host configuration protocol 2.
10942simple network management protocol 3.
10943internet message access protocol
109444.
10945media gateway protocol
10946     2.0
10947   1321
10948Which one of the following is FALSE?
10949   1.
10950A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end.
109512.
10952Available expression analysis can be used for common subexpression elimination.
109533.
10954Live variable analysis can be used for dead code elimination. 4.
10955x = 4 ∗ 5 => x = 20 is an example of common subexpression elimination.
10956   2.0
10957 
10958   S.NO.
10959  Questions
10960    Choices
10961   Answers
10962    1322
10963Which one of the following is FALSE?
10964  1.
10965There is unique minimal DFA for every regular language 2.
10966Every NFA can be converted to an equivalent PDA
109673.
10968Complement of every context-free language is recursive 4.
10969Every nondeterministic PDA can be converted to an equivalent deterministic PDA
10970   4.0
10971     1323
10972  Which one of the following is not a step of requirement engineering?
10973    1.
10974Elicitation
109752.
10976Design a model 3.
10977Analysis
109784. Documentation
10979     2.0
10980     1324
10981  Which one of the following is not a windows file system?
10982    1.
10983FAT
109842. NTFS 3. FAT32 4. EXT
10985     4.0
10986     1325
10987  Which one of the following is not an application layer protocol?
10988    1.
10989media gateway protocol
109902.
10991dynamic host configuration protocol 3.
10992resource reservation protocol
109934.
10994session initiation protocol
10995     3.0
10996   1326
10997   Which one of the following is not correct?
10998      1.
10999application layer protocols are used by both source and destination devices during a communication session
110002.
11001application layer protocols implemented on the source and destination host must match
110023.
11003both the options 4.
11004     3.0
11005   1327
11006Which one of the following is not the process of Deadlock Recovery?
11007   1.
11008Killing a process
110092.
11010Rollback to the previous state 3.
11011Selecting a Victim
110124.
11013Delaying the process
11014   4.0
11015 
11016   S.NO.
11017  Questions
11018    Choices
11019   Answers
11020    1328
11021Which one of the following is not the responsibility of the DBA?
11022  1.provide security
110232.develop applications 3.periodically tunes the database 4.restores the system after a failure
11024   2.0
11025     1329
11026  Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n>=2 numbers? In the recurrence equations given in the options below, c is a constant.
11027    1.T(n)=2T(n/2)+cn 2.T(n)=T(n–1)+T(0)+cn 3.T(n)=T(n/2)+cn 4.T(n)=2T(n–2)+cn
11028     1.0
11029   1330
11030   Which one of the following is the very first task executed by a session enabled page?
11031     1.Delete the previous session 2.Start a new session 3.Check whether a valid session exists 4.Handle the session
11032    3.0
11033    1331
11034Which one of the following is True at any valid state in shift-reduce parsing?
11035  1.
11036Viable prefixes appear only at the bottom of the stack and not inside 2.
11037Viable prefixes appear only at the top of the stack and not inside
110383.
11039The stack contains only a set of viable prefixes
110404.
11041The stack never contains viable prefixes
11042   3.0
11043     1332
11044  Which one of the following is used as the start frame delimeter in ethernet frame?
11045    1. 10101010 2. 10101011 3. 00000000 4. 11111111
11046     2.0
11047   1333
11048   Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
11049      1.
11050The set of all strings containing the substring 00.
110512.
11052The set of all strings containing at most two 0’s.
110533.
11054The set of all strings containing at least two 0’s.
110554.
11056The set of all strings that begin and end with either 0 or 1.
11057     3.0
11058    1334
11059Which one of the following models is not suitable for accommodating any change?
11060  1.
11061Build & Fix Model 2.
11062Prototyping Model 3.
11063RAD model
110644.
11065Waterfall Model
11066   4.0
11067   1335
11068  Which one of the following modulation scheme is supported by WiMAX?
11069     1.
11070binary phase shift keying modulation
110712.
11072quadrature phase shift keying modulation 3.
11073quadrature amplitude modulation
110744.
11075all of the mentioned
11076    4.0
11077 
11078   S.NO.
11079  Questions
11080    Choices
11081   Answers
11082    1336
11083Which one of the following protocol delivers/stores mail to reciever server?
11084  1.
11085simple mail transfer protocol 2.
11086post office protocol
110873.
11088internet mail access protocol 4.
11089hypertext transfer protocol
11090   1.0
11091   1337
11092   Which one of the following regular expressions over {0, 1} denotes the set of all strings not containing 100 as a substring (a) 0*(11)*0* (b) (0*1010)* (c) 0*1*010 (d) 0*(10)*01*
11093      1.
11094a and b 2.
11095b and c 3.
11096only c 4.
11097only b
11098     14.0
11099    1338
11100Which one of the following statements if FALSE?
11101  1.
11102Any relation with two attributes is in BCNF
111032.
11104A relation in which every key has only one attribute is in 2NF
111053.
11106A prime attribute can be transitively dependent on a key in a 3 NF relation.
111074.
11108A prime attribute can be transitively dependent on a key in a BCNF relation.
11109   4.0
11110     1339
11111  Which one of the following uses 8B/6T encoding scheme
11112    1.100 Base-T1 2.100 Base-T4 3.100 Base TX 4.100 Base-FX
11113     2.0
11114   1340
11115   Which property is used to obtain browser vendor and version information?
11116     1.modal 2.version 3.browser 4.navigator
11117    4.0
11118    1341
11119Which protocol is a signalling communication protocol used for controlling multimedia communication sessions?
11120  1.
11121session initiation protocol
111222.
11123session modelling protocol 3.
11124session maintenance protocol 4.
11125none of the mentioned
11126   1.0
11127     1342
11128  Which question no longer concerns the modern software engineer?
11129    1.
11130Why does computer hardware cost so much?
111312.
11132Why does software take a long time to finish?
111333.
11134Why does it cost so much to develop a piece of software?
111354.
11136Why can't software errors be removed from products prior to delivery?
11137     1.0
11138     1343
11139  Which searching technique is better, if unsorted array is given as input
11140    1.Radix search 2.Linear search 3.Binary search 4.Indexd sequential search
11141     2.0
11142   1344
11143  Which segments of a seven-segment display would be active to display the decimal digit 2?
11144    1.a, c, d, f, and g 2.a, b, c, d, and g 3.a, b, d, e, and g 4.a, b, c, d, e, and f
11145   3.0
11146 
11147   S.NO.
11148  Questions
11149    Choices
11150   Answers
11151    1345
11152Which SQL functions is used to count the number of rows in a SQL query?
11153  1. Sum 2. Count 3. Max 4. ALL
11154   2.0
11155     1346
11156  Which statement does not require semicolon?
11157    1.
11158goto xyz
111592.
11160int x = 20
111613.
11162#define MAX 100
111634.
11164do {... }while(count<=100)
11165     3.0
11166   1347
11167   Which statement is true:
11168     1.Standard form must consists of minterms 2.All standard form are canonical forms 3.Canonical form can consist of a term with a literal missing 4.All canonical form are standard form
11169    1.0
11170    1348
11171Which transmission media has the highest transmission speed in a network?
11172  1.
11173coaxial cable
111742.
11175twisted pair cable 3.
11176optical fiber
111774.
11178electrical cable
11179   3.0
11180     1349
11181  Which of these is a stand alone tag?
11182    1. form 2. frame 3. table 4. anchor
11183     2.0
11184   1350
11185   While inserting the elements 71,65,84,69,67,83 in an empty binary search tree(BST)in the sequence shown, the element in the lowest level is
11186     1.65 2.67 3.83 4.69
11187    2.0
11188   1351
11189Why 'critical section' is not imposed on file systems instead 'file locks' when more than one process tries to access the file?
11190   1.
11191Time consuming
111922.
11193Process entered in to critical section may close the file
111943.
11195we cannot satify the three conditions of mutual exclusion, progress and bounded waiting
111964.
11197we cannot use semaphore
11198   3.0
11199 
11200   S.NO.
11201  Questions
11202    Choices
11203   Answers
11204   1352
11205 WiMAX MAC layer provides an interface between
11206    1.
11207higher transport layers and physical layer 2.
11208application layer and network layer
112093.
11210data link layer and network layer
112114.
11212none of the mentioned
11213    1.0
11214    1353
11215WiMAX provides
11216  1.
11217simplex communication
112182.
11219half duplex communication 3.
11220full duplex communication 4.
11221none of the mentioned
11222   2.0
11223     1354
11224  WiMAX stands for
11225    1.
11226wireless maximum communication
112272.
11228worldwide interoperability for microwave access
112293.
11230worldwide international standard for microwave access 4.
11231none of the mentioned
11232     2.0
11233     1355
11234  WiMAX uses the
11235    1.
11236orthogonal frequency division multiplexing 2.
11237time division multiplexing
112383.
11239space division multiplexing
112404.
11241all of the mentioned
11242     1.0
11243     1356
11244  Wireless transmission can be done via
11245    1.
11246radio waves
112472.
11248microwaves
112493.
11250infrared
112514.
11252all of the mentioned
11253     4.0
11254     1357
11255  Write Through technique is used in which memory for updating the data _____.
11256    1.
11257Virtual memory 2.
11258Main memory 3.
11259Auxiliary memory 4.
11260Cache memory
11261     4.0
11262   1358
11263  You can find the element you want to manipulate by ________ way?
11264    1.getElementById() 2.getElementsByTagName() 3.getElementsByClassName() 4.All of the these
11265   4.0
11266 
11267   S.NO.
11268  Questions
11269    Choices
11270   Answers
11271    1359
11272You have an array of n elements, Suppose you implement quicksort by always choosing the central element of the array as the pivot, Then the tightest upper bound for the worst case performance is
11273  1.O(log n) 2.O(n) 3.O(n^2) 4.O(1)
11274   3.0
11275   1360
11276   You have to sort a list L consisting of a sorted list followed by a few “random” elements.Which of the following sorting methods would be especially suitable for such a task?
11277     1.Bubble sort 2.Selection sort 3.Quick sort 4.Insertion sort
11278    4.0
11279   1361
11280 You need to check the size of a file in PHP function. $size = X(filename); Which function will suitably replace 'X'?
11281    1.
11282filesize
112832.
11284size
112853. sizeofFile 4.
11286getSize
11287    1.0
11288   1362
11289‘Aging registers’ are _______.
11290   1.
11291Counters which indicate how long ago their associated pages have been referenced.
112922.
11293Registers which keep track of when the program was last accessed 3.
11294Counters to keep track of last accessed instruction
112954.
11296Counters to keep track of the latest data structures referred
11297   1.0