W0S33S7X

1
21
31.
43
52.
64
73.
85
94.
106
111.0
122 (a+b)(cd)*(a+b) denotes the following set
131.
14{a(cd)^nb|n>=1}
152.
16{a(cd)^n>=1}U{b(cd)^n|n>=1}
173.
18{a(cd)^na|n>=0}U{a(cd)^nb|n>=0}U{b(cd)^na|n>=0}U{b(cd)^nb|n>=0}
194. {ac^nd^nb|n>=1}
203.0
213
22-24 is 2’s complement form is
231.
2411101000
252.
2601111111
273.
2801001000
294. 00111111
301.0
314
32A 2 bit binary multiplier can be implemented using
331.
342 input ANDs only
352.
362 input X-ORs and 4-input AND gates only
373. XOR gates and shift registers
384.
39Two (2) input NORs and one XNOR gate
402.0
415
42A _________ registrar stores the intermediate arithmetic and logic results in it.
431.
44Address registrar
452. Program counter
463.
47Index registrar
484.
49Accumulator
504.0
516 A class is a
521. Structure
532. Memory
543. Template
554. Function
563.0
577 A constructor without any arguments is
581. default constructor
592. parameterized constructor
603. none
614. overloading
621.0
638 A default constructor is one that
641. that takes all default arguments
652. have to be called explictly
663. gets called automatically
674. does take many parameters
681.0
699 A finite automata that will accept only string X of length n will have _________ many states
701.
71n2
72. n/2
733. n+1
744. infinite
753.0
7610 A friend function to a class A cannot access
771. the data members of the derived class of A.
782. public data members and member functions.
793. protected data members and member functions.
804. private data members and member functions.
811.0
8211 A property which is not true for classes is that they
831. Can closely model objects in the real world.
842. bring together all aspects of an entity in one place.
853. permit data to be hidden from other classes.
864. are removed from memory when not in use.
872.0
8812 A quadruple is a record structure with ______ fields.
891. 3
902. 4
913. 1
924. 2
932.0
9413
95A Stack-organised Computer uses instruction of
961.
97Zero addressing
982.
99Two-addressing
1003.
101Indirect addressing
1024. Index addressing
1031.0
10414 Access to private data is
1051. Restricted to methods of the same class
1062. Restricted to methods of other classes
1073. Available to methods of the same class and other classes
1084. Not an issue because the program will not compile
1091.0
11015 All member functions are _____ to it's class by default
1111. constant
1122. non static
1133. dynamic
1144. static
1154.0
11616 An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if
1171. The LR(1) parser for G has S-R conflicts.
1182. The LR(0) parser for G has S-R conflicts.
1193. The LALR(1) parser for G has reduce-reduce conflicts
1204. The SLR(1) parser for G has S-R conflicts.
1211.0
12217 An optimizing compiler
1231. Is optimized to occupy less space
1242. Optimized the code
1253. Is optimized to take less time for execution
1264. Secured Code
1272.0
128S.NO. Questions Choices Answers
12918
130An unambiguous grammar has
1311. Exactly one leftmost derivation for a string w
1322. At most one leftmost and one rightmost derivation for a string w
1333. At most one rightmost derivation for a string w
1344. Exactly one leftmost and rightmost derivation for a string w
1351.0
13619
137An unambiguous grammar has
1381. Exactly one leftmost derivation for a string w
1392. At most one leftmost and one rightmost derivation for a string w
1403. At most one rightmost derivation for a string w
1414. Exactly one leftmost and rightmost derivation for a string w
1421.0
14320 ASCII, EBCDIC, and Unicode are examples of -----------------
1441. integrated circuits
1452. binary coding schemes
1463. two-state systems
1474. adapter cards
1481.0
14921 baa*c denotes the set
1501. {b^na^mc^p|n,m,p>=1}
1512. {ba^nc|n>=0}
1523. {ba^nc|n>=1}
1534. {w|w is a string of a,b,c}
1543.0
15522 BCD to seven segment is a
1561. encoder
1572. carry look ahead
1583. comparator
1594. decoder
1601.0
16123 Calculate the person months for a project that was completed in two months with two people
162working on it.
1631. 2
1642. 4
1653. 1
1664. 8
1672.0
16824 class A { int a; static float b; } ; What is the size of class A?
1691. sizeof( int ) * 2
1702. sizeof( int ) + sizeof( float )
1713. sizeof( int )
1724. sizeof( float )
1732.0
17425 class n{ int a=0;}obj; what will happen?
1751. nothing
1762. initializes the data member with 0
1773. error
1784. initializes the object with 0
1793.0
18026 class n{ public: int *a;}o,p; assigning o=p is called?
1811. deep copy
1822. shallow copy
1833. error
1844. constructor
1852.0
18627
187class n{ public: int a;}
188obj; obj.a=10; cout << a;
1891. error
1902. 10
1913. 1
1924. 0
1931.0
194S.NO. Questions Choices Answers
19528 class n{ public: int a=7;}p,q; cout<< n.a;
1961. 0
1972. error
1983. depends on compiler
1994. 7
2002.0
20129
202Consider the regular language L = (111 + 11111)*. The minimum number of states in any DFA
203accepting the language is
2041.
2053
2062.
2075
2083.
2098
2104. 9
2114.0
21230
213Content of the program counter is added to the address part of the instruction in order to obtain the
214effective address is called.
2151.
216index addressing mode.
2172.
218register mode.
2193. implied mode.
2204.
221relative address mode.
2224.0
22331 Data Members of the base class that are marked private:
2241. are directly accessible in the derived class
2252. are visible in the derived class
2263. exist in memory when the object of the derived class is created
227the derived class
2284. does exist in memory when the object of the derived class is created
2294.0
23032
231Decimal number 9 in Gray code is
2321. 1111
2332.
2341101
2353.
2361100
2374.
2381110
2392.0
24033
241During a software development project two similar requirements defects were detected. One was
242detected in the requirements phase, and the other during the implementation phase. Which of the
243following statements is mostly likely to be true?
2441. There is no relationship between the phase in which a defect is
245discovered and its repair cost. .
2462. The most expensive defect to correct is the one detected during the
247implementation phase.
2483. The most expensive defect to correct is the one detected during the
249requirements phase.
2504. The cost of fixing either defect will usually be similar.
2512.0
25234 Effective software project management focuses on four P's which are
2531. people, product, process, project
2542. people, product, performance, process
2553. people, performance, payoff, product
2564. people, process, payoff, product
2571.0
25835 FAT file system is
2591. Indexed Allocation and used in Windows OS
2602. used in Windows OS
2613. about storage in RAM
2624. Indexed Allocation.
2631.0
26436 Files whose names end in .h are called _____ files
2651. helper
2662. header
2673. handy
2684. helping
2692.0
270S.NO. Questions Choices Answers
27137 Finite automata recognizes --------grammars
2721.
273type-1
2742.
275type-3
2763. type-0
2774.
278type-2
2792.0
28038 Floating point representation is used to store ______.
2811.
282Boolean values
2832.
284real integers
2853. integers
2864.
287whole numbers
2882.0
28939 Function templates can accept
2901. Only parameters of the basic type
2912. Only one parameter
2923. Any type of parameters
2934. Only parameters of the derived type
2941.0
29540 Functional requirements of a system is modelled using
2961. Use-case Diagram
2972. Sequence Diagram
2983. Class Diagram
2994. Package Diagram
3001.0
30141
302Given an arbitrary non-deterministic finite automaton (NFA). with N states, the maximum number
303of states in an equivalent minimized DFA is at least.
3041.
305N^2
3062.
3072N
3083.
3092^N
3104. N!
3113.0
31242
313Given the language L = {ab, aa, baa}, which of the following strings are in L*?
3141) abaabaaabaa
3152) aaaabaaaa
3163) baaaaabaaaab
3174) baaaaabaa
3181.
3191, 2 and 3
3202.
3212, 3 and 4
3223.
3231, 2 and 4
3244.
3251, 3 and 4
3263.0
32743 Having more than one constructor in a class is
3281. not possible
3292. compile time polymorphism
3303. constructor overriding
3314. error
3323.0
33344 How many DFAs exit with two state over the input alphabet (a,b)
3341.
33516
3362.
33726
3383.
33932
3404. 64
3414.0
34245 How many possible outputs would a decoder have with a 6-bit binary input?
3431. 16
3442. 64
3453. 128
3464. 32
3472.0
348S.NO. Questions Choices Answers
34946 How many select lines would be required for an 8-line-to-1-line multiplexer?
3501. 2
3512. 4
3523. 3
3534. 8
3543.0
35547 How many stages are there in process improvement?
3561. three
3572. four
3583. five
3594. six
3604.0
36148 How many two state FA can be drawn over alphabet{0,1} which accepts(0+1)*
3621.
36312
3642.
36514
3663.
36720
3684. 15
3693.0
37049 How will you free the allocated memory ?
3711. delete(var-name);
3722. dalloc(var-name);
3733. free(var-name);
3744. remove(var-name);
3753.0
37650 Identify the invalid statement from the following
3771. for (; ; )
3782. if (1)
3793. break(0)
3804. while(false)
3813.0
38251
383If a register containing binary data (11001100) is subjected to arithmetic shift left operation, then
384the content of the register after 'ashl' shall be
3851. (10011000)
3862.
387(11001100)
3883.
389(1101100)
3904.
391(10011001)
3921.0
39352 If a university sets up web-based information system that faculty could access to record student
394grades and to advise students, that would be an example of an
3951. intranet
3962. ERP
3973. extranet
3984. CRM
3991.0
40053
401If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using Thompson
402construction will have ------------- states.
4031.
404n+2
4052.
406n+1
4073.
408n
4094. n-1
4102.0
41154
412If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using Thompson
413construction will have ------------- states.
4141.
415n+2
4162.
417n+1
4183.
419n
4204. n-1
4212.0
42255
423If there is a complete DFA M1 recognizing a language L1 and has m states out of which two are
424final states then the machine M recognizing L1 complement will have _____________ final
425states.
4261.m+2
4272.m
4283.m-2
4294. 2
4301.0
431S.NO. Questions Choices Answers
43256 If X is the name of the class, what is the correct way to declare copy constructor of X?
4331. X(class X* arg)
4342. X(X& arg)
4353. X(X* arg)
4364. X(X arg)
4372.0
43857 If you assign a default value to any variable in a function prototype's parameter list, then _____
4391. all parameters to the left of that variable must have default values
4402. all parameters to the right of that variable must have default values
4413. all other parameters in the function prototype must have default values
4424. no other parameters in that prototype can have default values
4432.0
44458 If you want to use a class to define objects in many different programs, you should define the class
445in a C++ _____ file
4461. text
4472. source
4483. header
4494. program
4503.0
45159 In a BCD-to-seven-segment converter, why must a code converter be utilized?
4521. to convert the 4-bit BCD into Gray code
4532. to convert the 4-bit BCD into 7-bit code
4543. to convert the 4-bit BCD into 10-bit code
4554. No conversion is necessary
4562.0
45760 In C++, dynamic memory allocation is accomplished with the operator ____
4581. new
4592. this
4603. malloc
4614. delete
4621.0
46361 In C++, dynamic memory allocation is achieved with the operator _______
4641. malloc()
4652. delete
4663. new
4674. this
4683.0
46962 In CMM, the life cycle activities of requirements analysis, design, code, and test are described in
4701. Software Product Engineering
4712. Software Quality Assurance
4723. Software Subcontract Management
4734. Software Quality Management
4741.0
47563 In computers, subtraction is generally carried out by ______.
4761.
4779’s complement
4782. 2’s complement
4793.
48010’s complement
4814.
4821’s complement
4832.0
48464 In the types of Three-Address statements, copy statements of the form x := y means
4851. The value of x is assigned to y or the value of y is assigned t o x.
4862. The value of x is assigned to y and the value of y is assigned t o x.
4873. The value of y is assigned to x.
4884. The value of x is assigned to y.
4893.0
49065 Many programmers separate a class into two files: _____
4911. one for the primary functions and one for the auxiliary functions
4922. one for the public data and one for the private data
4933. one for the void functions and one for the other functions
4944. one for the declarations and one for the implementations
4954.0
49666 Multiplication of a positive integer by a power of two can be replaced by left shift, which executes
497faster on most machines. This is an example of
4981. Useless Code
4992. Strength Reduction
5003. Induction Variable
5014. Loop unwinding
5022.0
503S.NO. Questions Choices Answers
50467 One can safely state that the output lines for a demultiplexer are under the direct control of the:
5051. input data select lines
5062. the internal OR gate
5073. the internal AND gates
5084. Input data line
5091.0
51068 Overloading a prefix increment operator by means of a member function takes
5111. Three arguments
5122. Two arguments
5133. No argument
5144. One argument
5153.0
51669 Overloading involves writing two or more functions with ________
5171. different names and different argument lists
5182. different names and the same argument list
5193. the same name and the same argument list
5204. the same name and different argument lists
5214.0
52270 Specify the 2 library functions to dynamically allocate memory?
5231. malloc() and calloc()
5242. malloc() and memalloc()
5253. alloc() and memalloc()
5264. memalloc() and faralloc()
5271.0
52871 State the acronym of POMA in software project management
5291. Project Organization Monitoring Adopting
5302. Planning Origanizing Monitoring Adjusting
5313. project oriented maintenance and administration
5324. Project Orientation Mapping Adjusting
5332.0
53472 Templates improve
5351. inheritance
5362. reusability
5373. class
5384. functions
5392.0
54073 The Epsilon-Closure of any state q will contain the state ______________ irrespective of q.
5411. p
5422. Epsilon
5433. q
5444. Final State
5453.0
54674 The binary value for 0.4375 is
5471.
5480.1111
5492.
5500.0111
5513.
5520.0011
5534. 0.1010
5542.0
55575 The call to the parameterized constructor of base class in the derived class
5561. appears inside the definition of the derived class
5572. ppears inside the definition of the derived class constructor
5583. appears at the statement where the derived class object is created
5594. appears in the member initialization list of the derived class
560constructor
5612.0
56276 The fundamental notions of software engineering does not account for ?
5631. Software reuse
5642. Software Security
5653. Software Validation
5664. Software processes
5673.0
568S.NO. Questions Choices Answers
56977
570The language is L={0p1q0r | p,q,r ³ 0 , p ¹ r} is
5711. Context-sensitive but not context-free
5722. Recursive but not Context-free
5733. Regular
5744. Context-free
5754.0
57678 The library function used to find the last occurrence of a character in a string is
5771. strnstr()
5782. strrchr()
5793. laststr()
5804. strstr()
5812.0
58279 The major source of data for other systems are:
5831.
584Electronic Switching System
5852. Transaction Processing Systems
5863. Decision Support System
5874. Management Information System
5882.0
58980 The members of a class in c++ by default, are
5901. private
5912. protected
5923. public
5934. mandatory to specify
5941.0
59581 The minimum length for strings in the regular expression ( 10* + 001* )* is _________
5961. Infinite
5972. One
5983. Zero
5994. Two
6003.0
60182 The negative numbers in the binary system can be represented by
6021. 10's Complement
6032. 2's complement
6043.
605Sign magnitude
6064.
607I's complement
6082.0
60983
610The number of full and half-adders required to add 16-bit numbers is
6111.
6128 half-adders, 8 full-adders
6132.
6141 half-adders, 15 full-adders
6153.
61616 half-adders, 0 full-adders
6174. 4 half-adders, 12 full-adders
6182.0
61984
620The number of states in a machine M recognizing L1UL2 will be __________________ where n
621is the number of states in M1 and m is the number of states in M2 .
6221.m-n
6232.m+n
6243.
625m+n+1
6264. n-m
6272.0
628S.NO. Questions Choices Answers
62985
630The number of states in a machine M recognizing L1UL2 will be __________________ where n
631is the number of states in M1 and m is the number of states in M2 .
6321.m-n
6332.m+n
6343.
635m+n+1
6364. n-m
6372.0
63886 The number of states in DFA is -------- the number of states in NFA for the same Language.
6391.
640Greater then
6412. equal to
6423.
643less then
6444.
645greater then or equal to
6463.0
64787
648The processor 80386/80486 and the Pentium processor uses _____ bits address bus:
6491.
65036
6512.
65232
6533.
65416
6554. 64
6562.0
65788 The set of all strings over the alphabet {a,b} (including epsilon} is denoted by
6581.
659(a+b)^+
6602.
661a^+b^+
6623. a*b*
6634.
664(a+b)*
6654.0
66689 The set of fundamental assumptions about what products the organization should produce, how
667and where it should produce them, and for whom they should be produced is
6681. organizational culture.
6692. behavioral model.
6703. rational model.
6714. agency theory.
6721.0
67390 The set of fundamental assumptions about what products the organization should produce, how
674and where it should produce them, and for whom they should be produced is
6751. organizational culture.
6762. behavioral model.
6773. rational model.
6784. agency theory.
6791.0
68091
681The special memory used to store the micro routines of a computer is ________.
6821.
683Control table
6842.
685Control store
6863.
687Control mart
6884. Control shop
6892.0
69092 The system having memory elements are called.
6911. sequential circuits
6922. complex circuits
6933. combinational circuits
6944. logic circuits
6951.0
696S.NO. Questions Choices Answers
69793 The term m45 should be made up of at least _____ literals.
6981. 6
6992. 31
7003. 4
7014. 5
7022.0
70394 The three key levels at which responsibility can be defined is at the ____,_______,____
7041. Team, Organization, contractor
7052. Project, Strategic, Activity
7063. Project, Activity, WBS
7074. Project, Organization, Team
7084.0
70995 The while loop is referred to as a(n) _____ loop because the loop condition is tested at the
710beginning of the loop
7111. priming
7122. pretest
7133. initial
7144. beginning
7152.0
71696 The word case used in the switch statement represents a
7171. global variable in the C++ language
7182. function in the C++ language
7193. keyword in the C++ language
7204. data type in the C++ language
7213.0
72297 Two access specifiers in C++ are
7231. void and free
7242. public and private
7253. int and double
7264. formal and informal
7272.0
72898 Usecase analysis focuses upon
7291. Actors
7302. Objects
7313. Data
7324. Entities
7331.0
73499 Variables inside parenthesis of functions declarations have _______ level access.
7351. Local
7362. Global
7373. Module
7384. Universal
7391.0
740100 Virtual memory is __________
7411. A type of memory used in super computers
7422. An illusion of extremely large main memory
7433. An extremely large main memory
7444. An extremely large secondary memory
7452.0
746101
747WE RECEIVED “404 – PAGE NOT FOUND” MESSAGE, WHEN WE BROWSE THE
748WEB PAGE. WHICH PROTOCOL PROVIDES THIS MESSAGE?
7491.
750IGP
7512. EGP
7523.
753SNMP
7544.
755ICMP
7564.0
757S.NO. Questions Choices Answers
758102
759What are the minimum number of 2-to-1 multiplexers required to generate a 2- input AND
760gate and a 2-input Ex-OR gate?
7611.
7621 and 2
7632.
7641 and 3
7653.
7661 and 1
7674. 2 and 2
7681.0
769103 What does the following declaration mean?
770int (*ptr)[10];
7711. ptr is array of pointers to 10 integers
7722. ptr is a pointer to an array of 10 integers
7733. ptr is an array of 10 integers
7744. ptr is an pointer to array
7752.0
776104 What is an Accumulator?
7771. A Flip flop
7782. A counter
7793. A Sequential Logic Circuit
7804. A Combinational Logic Circuit
7813.0
782105 What is an ALU?
7831. A Combinational Logic Circuit
7842. A Sequential Logic Circuit
7853. A Combination of Combinational Circuit and Sequential Circuit
7864. A flip flop
7872,3
788106 What is the condition for setting the Overflow flag in status register?
7891. Last two sum bits are different
7902. Last two carrys are same
7913. Last two sum bits are same
7924. Last two carrys are different
7933.0
794107 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a
7951. n/2
7962. n-1
7973. 2n-1
7984. 2^n
7992.0
800108 What is the recommended distribution of effort for a software project?
8011. 50-20-30
8022. 50-30-20
8033. 30-40-30
8044. 40-20-40
8054.0
806109 What is the return type of the conversion operator function?
8071. no return type
8082. int
8093. void
8104. float
8111.0
812110 What is the status of the inputs S0, S1, and S2 of the 74151 eight-line multiplexer in order for the
813output Y to be a copy of input I5?
8141. S0 = 1, S1 = 0, S2 = 1
8152. S0 = 1, S1 = 1, S2 = 0
8163. S0 = 0, S1 = 1, S2 = 0
8174. S0 = 0, S1 = 0, S2 = 1
8181.0
819111 What is true about constant member function of a class?
8201. cannot access any of its class data members
8212. cannot modify values of its class data members
8223. cannot modify values of its class data members which are mutable
8234. can modify values of its class data members
8242.0
825S.NO. Questions Choices Answers
826112 What will be the output of the following code #include void main() { int i; int a[3]=5; for
827(i=2;i>=0;i--) { printf(?%d\n?,a[i]); } }
8281. 0 0 5
8292. 5 0 0
8303. 5 garbage garbage
8314. 5 null null
8323.0
833113 When an instruction is read from the memory, it is called
8341.M emory Read cycle
8352.
836Fetch cycle
8373.
838Instruction cycle
8394.M emory write cycle
8403.0
841114
842When FA M is given which recognizes language L and reverse of L is found by using M then
843there can be ___________Final states
8441.
845Two
8462.
847Three
8483.
849Only one
8504. Any number
8513.0
852115
853When there is complete DFA with Five states out of which two are final states if F is modified
854such that it recognizes complement of the original language then there will be at least
855_________final states.
8561.
8573
8582.
8592
8603.
8615
8624. 7
8633.0
864116 When there is more than one final state in the reduced FA, then its regular expression will contain
865_________ operator surely
8661. dot
8672. binary +
8683. star
8694. unary +
8704.0
871117 When we concatenate two languages L1 and L2 recognized by machine M1 and M2 we obtain a
872machine with final state same as that of __________________
8731. M1 OR M2
8742. M1 AND M2
8753. M2
8764. M1
8772.0
878118 Which directory implementation is used in most Operating System?
8791. Two level directory structure
8802. Acyclic directory structure
8813. Single level directory structure
8824. Tree directory structure
8834.0
884119 Which is not a proper prototype?
8851. double funct(char x)
8862. void funct();
8873. char x();
8884. intfunct(char x, char y);
8891.0
890120 WHICH OF THE BELOW IS CALLED CLASSLESS ADDRESS?
8911.
892191.168.1.1/24
8932.
894191.168.1.1/16
8953.
896191.168.1.1/8
8974.
898191.168.1.1/4
8992.0
900S.NO. Questions Choices Answers
901121 WHICH OF THE BELOW IS NOT AN EMAIL PROTOCOL?
9021. SMTPMP
9032. IMAP
9043. POP
9054. SNMP
9064.0
907122 Which of the following calls a function named displayName, passing it no actual arguments?
9081. call displayName
9092. call displayName ()
9103. displayName
9114. displayName()
9124.0
913123
914Which of the following conversion is not possible (algorithmically)?
9151. nondeterministic PDA to deterministic PDA
9162. nondeterministic FSA to deterministic FSA
9173. regular grammar to context-free grammar
9184. nondeterministic TM to deterministic TM
9191.0
920124 Which of the following derivations does a top-down parser use while parsing an input string? The
921input is assumed to be scanned in left to right order.
9221. Leftmost derivation
9232. Leftmost derivation traced out in reverse
9243. Rightmost derivation
9254. Rightmost derivation traced out in reverse
9261.0
927125 Which of the following functions compares two strings?
9281. compare();
9292. cmp();
9303. stringcompare();
9314. strcmp();
9324.0
933126 Which of the following gives the memory address of a variable pointed to by pointer a?
9341. a;
9352. *a;
9363. &a;
9374. address(a);
9383.0
939127 which of the following intermediate language can be used in intermediate code generation?
9401. Quadraples
9412. Postfix notation and Three address code
9423. Triples
9434. Infix notation and two address code
9441,3,2
945128 Which of the following is a complete function?
9461. void funct(int) { printf(?Hello"); }
9472. int funct();
9483. void funct(x) { printf(?Hello"); }
9494. int funct(int x) { return x=x+1; }
9504.0
951129 Which of the following is a valid destructor of the class name "Country"
9521. void ~Country()
9532. int ~Country(Country obj)
9543. int ~Country()
9554. Country()
9564.0
957130 which of the following is an incorrect definition inside a class ?
9581. void * operator new () { }
9592. int operator ++() { }
9603. void operator delete(void * ptr) { }
9614. void * operator new(size_t size) { }
9622.0
963S.NO. Questions Choices Answers
964131
965Which of the following is correct for a gated D flip-flop?
9661.
967The output toggles if one of the inputs is held HIGH.
9682.
969Only one of the inputs can be HIGH at a time.
9703.
971The output complement follows the input when enabled.
9724. Q output follows the input D when the enable is HIGH.
9734.0
974132 Which of the following is not a technology driver for an information system?
9751. Collaborative technologies
9762. Knowledge asset management
9773. Enterprise applications
9784. Object technologies
9792.0
980133 Which of the following is not a type of constructor?
9811. Copy Constructor
9822. Friend Constructor
9833. Default Constructor
9844. Parametrized Constructor
9852.0
986134 Which of the following is the insertion operator?
9871. /*
9882. //
9893. <<
9904. >>
9914.0
992135 Which of the following is/are main parameters that you should use when computing the costs of a
993software development project?
9941. Hardware and software costs
9952. Effort costs (the costs of paying software engineers and managers)
9963. Travel and training costs
9974. All the parameters required given in the option.
9984.0
999136 Which of the following language feature is not an access specifier in C++?
10001. internal
10012. protected
10023. public
10034. private
10041.0
1005137
1006Which of the following regular expression denotes a language comprising of all possible strings
1007over {a,b} of length n where n is a multiple of 3?
10081. (aaa+ab+a)+(bbb+bb+a)
10092.
1010((a+b) (a+b) (a+b))*
10113.
1012(aaa+bbb)*
10134.
1014(a+b+aa+bb+aba+bba)*
10152.0
1016138
1017Which of the following regular expression identities are true?
10181. r* s* = r* + s*
10192. (r + s)* = (r*s*)*
10203. (r + s)* = r* + s*
10214. (r + s)* = r* s*
10222.0
1023139 Which of the following results in a compile-time error?
10241. int f2() { static int i; i++; return i; }
10252. int f3( static int i) { return 300;}
10263. static int f1() { return 100; }
10274. static int a;
10283.0
1029S.NO. Questions Choices Answers
1030140 Which of the following scheduling algorithm comes under preemptive scheduling?
10311. FCFS
10322. Round Robin
10333. Multilevel Queue Scheduling
10344. Largest Job First
10352.0
1036141 Which of the following special symbol is allowed in a variable name?
10371. _ (underscore)
10382. - (hyphen)
10393. | (pipeline)
10404. * (asterisk)
10411.0
1042142
1043Which of the following statement is false?
10441. For R = R1*, L(R) is empty if and only if L(R1) is empty
10452. For R = (R1), L(R) is empty if and only if L(R1) is empty
10463. For R = R1R2 , L(R) is empty if and only if either L(R1) or L(R2) is
1047empty.
10484. If R = R1+ R2 , L(R) is empty if and only if both L(R1) and L(R2) are
1049empty.
10501.0
1051143
1052Which of the following statement is false?
10531. If there is a PDA by acceptance state that accept L, then there is also a
1054PDA by empty stack that accept L
10552. If there is a NPDA that accept L, then there is also a DPDA that
1056accept L.
10573. If there is a PDA by empty stack, then there is also a CFG G that
1058accept L.
10594. If there is a CFG G that accepts L, then there is also a PDA that accept
1060L.
1061144
1062Which of the following statements is/are FALSE?
10631. Turing recognizable languages are closed under union and
1064complementation.
10652. Turing decidable languages are closed under intersection and
1066complementation
10673. Turing recognizable languages are closed under union and
1068intersection.
10694. For every non-deterministic Turing machine, there exists an equivalent
1070deterministic Turing machine.
1071145 Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
10721. Removing left recursion alone
10732. Factoring the grammar alone
10743. Removing left recursion and factoring the grammar
10754. Removing left recursion, left factoring and ambiguity of the grammar
10764.0
1077146 Which of the following ways are legal to access a class data member using this pointer?
10781. this.x
10792. *this.x
10803. this->x
10814. *this-x
10823.0
1083147 Which one of the following is a top-down parser?
10841. An LR(k) parser.
10852. An LALR(k) parser
10863. Operator precedence parser.
10874. Recursive descent parser.
10884.0
1089S.NO. Questions Choices Answers
1090148 Which one of the following is a valid project Key Performance Indicator (KPI)?
10911. Master schedule.
10922. Staff appraisals.
10933. Management buy in.
10944. Milestone achievement.
10954.0
1096149 Which one of the following is the correct way to declare a pure virtual function?
10971. virtual void Display(void){0};
10982. void Display(void) = 0;
10993. virtual void Display(void) = 0;
11004. virtual void Display = 0;
11013.0
1102150
1103Which one of the following languages over alphabet {0,1} is described by the regular expression:
1104(0+1)*0(0+1)*0(0+1)*?
11051.
1106The set of all strings containing at least two 0’s
11072. The set of all strings that begin and end with either 0 or 1.
11083.
1109The set of all strings containing at most two 0’s.
11104.
1111The set of all strings containing the substring 00.
11121.0
1113151 Which one of the following models is not suitable for accommodating any change?
11141. Build & Fix Model
11152. RAD Model
11163. Waterfall Model
11174. Prototyping Model
11183.0
1119152
1120Which one of the following regular expressions over {0,1} denotes the set of all strings not
1121containing 100 as a substring?
11221.
11230*(11*0)*
11242. 0*1*01
11253.
11260*(10+1)*
11274.
11280*1010*
11291234.0
1130153 Which one of the following statements best defines the purpose of a Product Breakdown Structure
1131(PBS)?
11321. To identify the health and safety strategies and procedures to be used
1133on the project
11342. To establish the extent of work required prior to project
1135commissioning and the handover
11363. To define how the products are produced by identifying derivations
1137and dependencies
11384. To define the hierarchy of deliverables that are required to be
1139produced on the project
11404.0
1141154 Who owns the Project Management Plan (PMP)?
11421. The project team.
11432. The chief executive.
11443. The project manager.
11454. The project support office.
11463.0
1147155
1148Write the regular expression to denote the language L over ? ={ a,b} such that all the string do not
1149contain the substring “ ab”.
11501. a*b*
11512. b*a*
11523. (ab)*
11534. (ba)*
115424.0
1155156 Zero address instruction format is used for
11561.
1157Von-Neuman architecture
11582.
1159RISC architecture
11603.
1161CISC architecture
11624. Stack-organized architecture
11634.0
1164S.NO. Questions Choices Answers
1165157 In a slab under steady state conduction if the thermal conductivity increases along the thickness, the
1166temperature gradient along the direction will become
11671.
1168Steeper
11692.
1170Flatter
11713.
1172Constant
11734.
1174mixed pattern
11753.0
1176158
1177The temperature of a gas stream is to be measured by a thermocouple whose junction can be
1178approximated as 1-mm-dia sphere. The properties of the junction are k = 35 W/m °C, ρ = 8500 kg/m3,
1179and Cp = 320 J/kg °C, and the convection heat transfer coefficient between the junction and the gas is h =
1180210 W/m2 °C. The time taken by the thermocouple to read 99 percent of the initial temperature
1181difference
11821.
11832 sec
11842.
118510 sec
11863.
118728 sec
11884.
118963 sec
11903.0
1191159 Assuming flow to be laminar, if the diameter of the pipe is halved, then the pressure drop will
11921.
1193increase
11942.
1195decrease
11963.
1197remain same
11984.
1199be quadrupled
12001.0
1201160 Dimension of absolute viscosity is
12021.
1203ML-1T-1
12042.
1205MLT-1
12063.
1207ML-1T
12084.
1209MLT
12101.0
1211161
1212Which of the following is minimum error code?
12131.Octal code
12142.Grey code
12153.Binary code
12164.
1217Excess 3 code
12182.0
1219162
1220When used with an IC, what does the term "QUAD" indicate?
12211.
12224 circuits
12232.
12242 circuits
12253.
12268 circuits
12274.
12286 circuits
12291.0
1230S.NO. Questions Choices Answers
1231163 Adding 1001 and 0010 gives
12321.
12331011
12342.
12351111
12363.
12370
12384.
12391010
12401.0
1241164 Radix of binary number system is _____?
12421.
12430
12442.
12451
12463.
12472
12484.
1249A&B
12503.0
1251165 SR Flip flop can be converted to T-type flip-flop if ?
12521. is connected to Q
12532.R is connected to Q
12543.Both S and R are shortend
12554.S and R are connected to Q and Q' respectively
12564.0
1257166 The main difference between JK and RS flip-flop is that?
12581.
1259JK flip-flop does not need a clock pulse
12602.
1261there is feedback in JK flip-flop
12623.
1263JK flip-flop accepts both inputs as 1
12644.
1265JK flip-flop is acronym of junction cathode multivibrator
12663.0
1267167
1268Register is a --------------------
12691.Set of capacitor used to register input instructions in a digital computer
12702.Set of paper tapes and cards put in a file
12713.
1272Temporary storage unit within the CPU having dedicated or general
1273purpose use
12744.Part of the auxiliary memory
12753.0
1276168 Magnitude comparator compares using operation of
12771.
1278addition
12792.
1280subtraction
12813.
1282multiplication
12834.
1284division
1285xnor1
1286S.NO. Questions Choices Answers
1287169 An SR flip flop cannot accept the following input entry
12881.
1289Both input zero
12902.
1291zero at R and one at S
12923.
1293zero at S and one at R
12944.
1295Both inputs one
12964.0
1297170 One operation that is not given by magnitude comparator
12981.
1299equal
13002.
1301less
13023.
1303greater
13044.
1305addition
13062.0
1307171 Automaton accepting the regular expression of any number of a ' s is:
13081.
1309a*
13102.
1311a
13123.
1313a*b*
13144.
1315abc
13161.0
1317172
1318Let L be a set accepted by a nondeterministic finite automaton. The number of states in nondeterministic
1319finite automaton is |Q|. The maximum number of states in equivalent finite
1320automaton that accepts L is
13211.
1322|Q|
13232.
13242|Q|
13253.
13262 raise to power |Q|*1
13274.
13282 raise to power |Q|
13294.0
1330173 Number of final state require to accept Φ(phi) in minimal finite automata.
13311.
13324
13332.
13343
13353.
13361
13374.
13380
13394.0
1340S.NO. Questions Choices Answers
1341174 The embedded c program is converted by cross compiler to
13421.
1343the machine code corresponding to the processor of the PC used for
1344application development
13452.
1346the machine code corresponding to a processor which is different from
1347the processor of the PC used for application development
13483.
1349the machine code for all the microcontrollers
13504.
1351assemble code of the PC used for application development
13522.0
1353175 The regular expression 0*(10*)* denotes the same set as
13541.
1355(1*0)*1*
13562.
13570 + (0 + 10)*
13583.
1359(0 + 1)* 10(0 + 1)*
13604.
1361(0+1)*
13621.0
1363176
1364Which of the following statements is/are FALSE?
1365(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing
1366machine.
1367(2) Turing recognizable languages are closed under union and complementation.
1368(3) Turing decidable languages are closed under intersection and complementation
1369(4) Turing recognizable languages are closed under union and intersection.
13701.
13711 and 4 only
13722.
13731 and 3 only
13743.
13752 only
13764.
13773 only
13783.0
1379177 Two automata are equal when
13801.
1381both are under union
13822.
1383both are under same language
13843.
1385both are having equal number of states
13864.
1387both are having same number of final states
13882.0
1389S.NO. Questions Choices Answers
1390178 What is the minimum number of states needed to a DFA over Σ= (a, b) which accept those words
1391from Σ such that the number of a is even and the number of b is divisible by three.
13921.
13932 states
13942.
13954 states
13963.
13976 states
13984.
13995 states
14003.0
1401179
1402If a language is denoted by a regular expression
1403L = ( x )* (x | y x ) ,
1404then which of the following is not a legal string within L ?
14051.
1406yx
14072.
1408xyx
14093.
1410x
14114.
1412x y x y x
14134.0
1414180
1415The CFG
1416s---> as | bs| a | b
1417is equivalent to regular expression
14181.
1419(a + b)
14202.
1421(a + b) (a + b)*
14223.
1423(a + b) (a + b)
14244.
1425(a + b) (a + b)(a + b) (a + b)
14262.0
1427181 ----------------------------is used to check whether the language is not regular.
14281.
1429Pumping Lemma
14302.
1431RE
14323.
1433MN Theorem
14344.
1435Pigeon hole principle
14361.0
1437182
1438The minimum number of page frames that must be allocated to a running process in a virtual
1439memory environment is determined by
14401.
1441the instruction set architecture
14422.
1443page size
14443.
1445physical memory size
14464.
1447number of processes in memory
14481.0
1449S.NO. Questions Choices Answers
1450183
1451A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32
1452Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory entry
1453contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit. The size of
1454the cache tag directory is
14551.
145611
14572.
145814
14593.
146027
14614.
146216
14634.0
1464184 Pre-emptive scheduling is the strategy of temporarily suspending a running process
14651.
1466before the CPU time slice expires
14672.
1468to allow starving processes to run
14693.
1470when it requests IO
14714.
1472None of mentioned
14731.0
1474185 Multiprogramming systems ______
14751.
1476Are easier to develop than single programming systems
14772.
1478Execute each job faster
14793.
1480Execute more jobs in the same time
14814.
1482Are used only on large main frame computers
14833.0
1484186
1485The DMA controller has _______ registers
14861.
14874
14882.
14892
14903.
14913
14924.
14931
14943.0
1495187
1496The truth table
1497X Y f(X,Y)
14980 0 0
14990 1 0
15001 0 1
15011 1 1
1502represents the Boolean function
15031.
1504X
15052.
1506X+Y
15073.
1508X'Y'
15094.
1510Y
15111.0
1512S.NO. Questions Choices Answers
1513188 Which of the following regular expression denotes a language comprising of all possible
1514strings over Σ= {a,b} of length n where n is a multiple of 3?
15151.
1516(a+b+aa+bb+aba+bba)*
15172.
1518(aaa+bbb)*
15193.
1520((a+b) (a+b) (a+b))*
15214.
1522(aaa+ab+a)+(bbb+bb+a)
15233.0
1524189 Which of the following statement is true?
15251.NFA is more powerful than DFA
15262.DFA is more powerful than NFA
15273.
1528NFA and DFA have equal power
15294.None
15303.0
1531190 Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64.
1532Which of the following most closely approximates the maximum input size of a problem that can
1533be solved in 6 minutes?
15341.256 2.2048 3.1024 4.512 4.0
1535191 ElGamal encryption system is:
15361.
1537symmetric key encryption algorithm
15382.
1539asymmetric key encryption algorithm
15403.
1541not an encryption algorithm
15424.
1543none of the mentioned
15442.0
1545192
1546#include < stdio.h >
1547int main()
1548{
1549typedef auto int AI;
1550AI var=100;
1551printf("var=%d",var);
1552return 0;
1553}
1554Find the output
15551.
1556var=100
15572.
1558var=AI
15593.
1560var=0
15614.
1562Error
15634.0
1564193
1565#include < stdio.h >
1566int main()
1567{
1568typedef char* string;
1569string myName="ABCDEFG";
1570printf("myName=%s (size=%d)",myName,sizeof(myName));
1571return 0;
1572}
1573Find the output
15741.
1575myName=ABCDEFG(size=7)
15762.
1577Error
15783.
1579myName=ABCDEFG(size=4)
15804.
1581myName=ABCDEFG(size=8)
15824.0
1583194
1584#include < stdio.h >
1585int main()
1586{
1587typedef int AAA,BBB,CCC,DDD;
1588AAA aaa=10;
1589BBB bbb=20;
1590CCC ccc=30;
1591DDD ddd=40;
1592printf("%d,%d,%d,%d",aaa,bbb,ccc,ddd);
1593return 0;
1594}
1595Find the output
15961.
1597Error
15982.
159910,10,10,10
16003.
160110,20,30,40
16024.
1603AAA,BBB,CCC,DDD
16043.0
1605S.NO. Questions Choices Answers
1606195
1607#include < stdio.h >
1608int main()
1609{
1610typedef struct
1611{
1612int empid;
1613int bsal;
1614}EMP;
1615EMP E={10012,15100};
1616printf("%d,%d",E.empid,E.bsal);
1617return 0;
1618}
1619Find the output
16201.
162110012,12100
16222.
16230,0
16243.
1625Error
16264.
162710012,10012
16281.0
1629196
1630#include < stdio.h >
1631void main()
1632{ unsigned char var=0;
1633for(var=0;var<=255;var++);
1634{
1635printf("%d ",var);
1636}
1637}
1638Find the output
16391.
16400 1 2 ... 255
16412.
1642255
16433.
1644256
16454.
1646blank screen as output
16471.0
1648197
1649#include <stdio.h>
1650#define MOBILE 0x01
1651#define LAPPY 0x02
1652int main()
1653{
1654unsigned char item=0x00;
1655item |=MOBILE;
1656item |=LAPPY;
1657printf("I have purchased ...:");
1658if(item & MOBILE){
1659printf("Mobile, ");
1660}
1661if(item & LAPPY){
1662printf("Lappy");
1663}
1664return 1;
1665}
16661.
1667I have purchased ...:
16682.
1669I have purchased ...:Mobile, Lappy
16703.
1671I have purchased ...:Mobile,
16724.
1673I have purchased ...:Lappy
16742.0
1675198
1676#include <stdio.h>
1677int main()
1678{
1679char flag=0x0f;
1680flag &= ~0x02;
1681printf("%d",flag);
1682return 0;
1683}
1684Predict the Output.
16851.
168613
16872.
1688d
16893.
169022
16914.
169210
16931.0
1694199
1695#include <stdio.h>
1696int main()
1697{
1698int a=10;
1699int b=2;
1700int c;
1701c=(a & b);
1702printf("c= %d",c);
1703return 0;
1704}
1705Find the output.
17061.
1707c = 12
17082.
1709c = 10
17103.
1711c = 2
17124.
1713c = 0
17143.0
1715S.NO. Questions Choices Answers
1716200
1717#include <stdio.h>
1718#define FUN(x,y) x##y
1719int main()
1720{i
1721nt a1=10,a2=20;
1722printf("%d...%d",FUN(a,1),FUN(a,2));
1723return 0;
1724}
1725Find the output
17261.
1727Error
17282.
172910...10
17303.
173120...20
17324.
173310...20
17344.0
1735201
1736#include <stdio.h>
1737#define LARGEST(x,y) (x>=y)?x:y
1738int main()
1739{
1740int a=10,b=20,l=0;
1741l=LARGEST(a++,b++);
1742printf("a=%d,b=%d,largest=%d",a,b,l);
1743return 0;
1744}
1745Find the output
17461.
1747a=10,b=20,largest=20
17482.
1749a=11,b=21,largest=20
17503.
1751a=11,b=21,largest=21
17524.
1753a=11,b=22,largest=21
17544.0
1755202
1756#include <stdio.h>
1757#define MAX 100
1758int main()
1759{
1760#define MAX 20
1761printf("MAX=%d...",MAX);
1762return 0;
1763}
1764Find the output
17651.
1766Error
17672.
1768MAx=100...
17693.
1770MAx=20...
17714.
1772MAX=10020
17733.0
1774203
1775#include <stdio.h>
1776#define MAX 10
1777int main()
1778{ int array[MAX]={1,2,3},tally;
1779for(tally=0;tally< sizeof(array)/sizeof(int);tally+=1)
1780printf("%d ",*(tally+array));
1781return 0;
1782}
1783Find the output
17841.
1785Error
17862.
17871 3 4 5 6 7 8 9 10 11
17883.
17891 2 3 0 0 0 0 0 0 0
17904.
17910 0 0 0 0 0 0 0 0 0
17923.0
1793204
1794#include <stdio.h>
1795#define MAX 99
1796int main()
1797{
1798printf("%d...",MAX);
1799#undef MAX
1800printf("%d",MAX);
1801return 0;
1802}
1803Find the output
18041.
180599...0
18062.
180799...99
18083.
1809Error
18104.
1811MAX...MAX
18123.0
1813205
1814#include <stdio.h>
1815#define TEXT IncludeHelp
1816int main()
1817{
1818printf("%s",TEXT);
1819return 0;
1820}
1821Find the output
18221.
1823IncludeHelp
18242.
1825TEXT
18263.
1827Error
18284.
1829TEXT IncludeHelp
18303.0
1831S.NO. Questions Choices Answers
1832206
1833#include <stdio.h>
1834#define TRUE 1
1835int main()
1836{
1837if(TRUE)
1838printf("1");
1839printf("2");
1840else
1841printf("3");
1842printf("4");
1843return 0;
1844}
1845Find the output.
18461.
18471
18482.
1849Error
18503.
18512
18524.
185312
18542.0
1855207
1856#include <stdio.h>
1857#define TRUE 1
1858int main()
1859{
1860int loop=10;
1861while(printf("Hello ") && loop--);
1862}
1863Find the output
18641.
1865Hello
18662.
1867Hello Hello Hello Hello ... (infinite times)
18683.
1869Hello (10 times)
18704.
1871Hello (11 times)
18724.0
1873208
1874#include <stdio.h>
1875#define VAR1 VAR2+10
1876#define VAR2 VAR1+20
1877int main()
1878{
1879printf("%d",VAR1);
1880return 0;
1881}
1882Find the output
18831.
1884VAR2+10
18852.
1886VAR1+20
18873.
1888Error
18894.
189010
18913.0
1892209
1893#include <stdio.h>
1894#include < string.h >
1895struct student
1896{
1897char name[20];
1898}std;
1899char * fun(struct student *tempStd)
1900{
1901strcpy(tempStd->name,"Thomas");
1902return tempStd->name;
1903}
1904int main()
1905{
1906strcpy(std.name,"Mike ");
1907printf("%s%s",std.name,fun(&std));
1908return 0;
1909}
1910Find the output
19111.
1912Mike Thomas
19132.
1914Mike Mike
19153.
1916ThomasThomas
19174.
1918ThomasMike
19193.0
1920210
1921#include <stdio.h>
1922#include <string.h>
1923int main()
1924{
1925char s1[]="IncludeHelp";
1926char s2[10];
1927strncpy(s2,s1,5);
1928printf("%s",s2);
1929return 0;
1930}
1931Find the output
19321.
1933Inclu
19342.
1935IncluGARBAGE_VALUE
19363.
1937Error
19384.
1939IncludeHelp
19401.0
1941S.NO. Questions Choices Answers
1942211
1943#include <stdio.h>
1944#include <string.h>
1945int main()
1946{
1947char str1[]="IncludeHelp",str2[]=".Com";
1948printf("%s",str1+strlen(str2));
1949return 0;
1950}
1951Find the output
19521.
1953IncludeHelp.Com
19542.
1955udeHelp
19563.
1957Error
19584.
1959IncludeHelp4
19602.0
1961212
1962#include <stdio.h>
1963#include <string.h>
1964int main()
1965{
1966char str[50]="IncludeHelp";
1967printf("%d...%d",strlen(str),sizeof(str));
1968return 0;
1969}
1970Find the output
19711.
197250...5011...50
19732.
197411...50
19753.
197611...11
19774.
197850...11
19792.0
1980213
1981#include <stdio.h>
1982#include <string.h>
1983int main()
1984{
1985int val=0;
1986char str[]="IncludeHelp.Com";
1987val=strcmp(str,"includehelp.com");
1988printf("%d",val);
1989return 0;
1990}
1991Find the output
19921.
19930
19942.
19951
19963.
1997-1
19984.
1999Error
20003.0
2001214
2002#include <stdio.h>
2003#define OFF 0
2004#if debug == OFF
2005int a=11;
2006#endif
2007int main()
2008{
2009int b=22;
2010printf("%d...%d",a,b);
2011return 0;
2012}
2013Find the output
20141.
201511...22
20162.
2017Error
20183.
201911...11
20204.
202122...22
20221.0
2023215
2024#include <stdio.h>
2025int main()
2026{
2027char *text="Hi Babs.";
2028char x=(char)(text+3);
2029printf("%c\n",x);
2030return 0;
2031}
2032Find the output
20331.
2034Garbage
20352.
2036B
20373.
2038Error
20394.
2040Null
20414.0
2042216
2043#include <stdio.h>
2044int main()
2045{
2046char *text="Hi Babs.";
2047char x=(char)(text[3]);
2048printf("%c\n",x);
2049return 0;
2050}
2051Find the output
20521.
2053Garbage
20542.
2055B
20563.
2057Error
20584.
2059Null
20602.0
2061S.NO. Questions Choices Answers
2062217
2063#include <stdio.h>
2064int main()
2065{
2066int anyVar=10;
2067printf("%d",10);
2068return 0;
2069}e
2070xtern int anyVar;
2071Find the output
20721.
2073Complie time error
20742.
207510
20763.
2077Run Time error
20784.
2079No output
20802.0
2081218
2082#include <stdio.h>
2083int main()
2084{
2085int x=2.3;
2086const char c1=(float)x;
2087const char c2=(int)x;
2088printf("%d,%d\n",c1,c2);
2089return 0;
2090}
2091Find the output
20921.
2093Error
20942.
20952.3,2
20963.
20972.3000000,2
20984.
20992,2
21002.0
2101219
2102#include <stdio.h>
2103struct sample
2104{
2105int a;
2106}sample;
2107int main()
2108{
2109sample.a=100;
2110printf("%d",sample.a);
2111return 0;
2112}
2113Find the output
21141.
21150
21162.
2117100
21183.
2119ERROR
21204.
2121arning
21222.0
2123220
2124#include <stdio.h>
2125char* fun1(void)
2126{
2127char str[]="Hello";
2128return str;
2129}
2130char* fun2(void)
2131{
2132char *str="Hello";
2133return str;
2134}i
2135nt main()
2136{
2137printf("%s,%s",fun1(),fun2());
2138return 0;
2139}
2140Find the output
21411.
2142ERROR
21432.
2144Hello,Hello
21453.
2146Hello,Garbage
21474.
2148Garbage,Hello
21494.0
2150221
2151#include <stdio.h>
2152char* strFun(void)
2153{
2154char *str="IncludeHelp";
2155return str;
2156}i
2157nt main()
2158{
2159char *x;
2160x=strFun();
2161printf("str value = %s",x);
2162return 0;
2163}
2164Find the output
21651.
2166str value= Garbage value
21672.
2168str value = IncludeHelp
21693.
2170Error
21714.
2172No output
21732.0
2174S.NO. Questions Choices Answers
2175222
2176#include <stdio.h>
2177int fooo(void)
2178{
2179static int num=0;
2180num++;
2181return num;
2182}i
2183nt main()
2184{
2185int val;
2186val=fooo();
2187printf("step1: %d\n",val);
2188val=fooo();
2189printf("step2: %d\n",val);
2190val=fooo();
2191printf("step3: %d\n",val);
2192return 0;
2193}
2194Find the output
21951.
2196step1: 1
2197step2: 1
2198step3: 1
21992.
2200step1: 1
2201step2: 2
2202step3: 3
22033.
2204step1: 0
2205step2: 0
2206step3: 0
22074.
2208ERROR
22092.0
2210223
2211#include <stdio.h>
2212int main()
2213{
2214#ifdef debug
2215printf("Start debugging...");
2216#endif
2217printf("IncludeHelp");
2218return 0;
2219}
2220Find the output
22211.
2222Start debugging...IncludeHelp
22232.
2224IncludeHelp
22253.
2226Error
22274.
2228debug
22292.0
2230224
2231#include <stdio.h>
2232int main()
2233{ int a[5]={0x00,0x01,0x02,0x03,0x04},i;
2234i=4;
2235while(a[i])
2236{
2237printf("%02d ",*a+i);
2238--i;
2239}
2240return 0;
2241}
2242Find the output
22431.
224400 01 02 03 04
22452.
224604 03 02 01 00
22473.
224804 03 02 01
22494.
225001 02 03 04
22513.0
2252225
2253#include <stdio.h>
2254int main()
2255{ int a[5]={1,2,3,4,5},b[5]={10,20,30,40,50},tally;
2256for(tally=0;tally< 5;++tally)
2257*(a+tally)=*(tally+a)+ *(b+tally);
2258for(tally=0;tally< 5;tally++)
2259printf("%d ",*(a+tally));
2260return 0;
2261}
2262Find the output
22631.
22641 2 3 4 5
22652.
226610 20 30 40 50
22673.
226811 22 33 44 55
22694.
2270Error
22713.0
2272226
2273#include <stdio.h>
2274int main()
2275{ static int array[]={10,20,30,40,50};
2276printf("%d...%d",*array,*(array+3)* *array);
2277return 0;
2278}
2279Find the output
22801.
2281Error
22822.
228310...40
22843.
228510...300
22864.
228710...400
22884.0
2289S.NO. Questions Choices Answers
2290227
2291#include <stdio.h>
2292int main()
2293{ static int x[]={'A','B','C','D','E'},tally;
2294for(tally=0;tally< sizeof(x)/sizeof(int) ; tally+=1)
2295printf("%c,%c,%c\n",*(x+tally)+1,x[tally]+1,*(tally+x)+1);
2296return 0;
2297}
2298Find the output
22991.
2300Error
23012.
2302A,A,A
2303B,B,B
2304C,C,C
2305D,D,D
2306E,E,E
23073.
2308B,B,B
2309C,C,C
2310D,D,D
2311E,E,E
2312F,F,F
23134.
2314E,E,E
2315D,D,D
2316C,C,C
2317B,B,B
2318A,A,A
23193.0
2320228
2321#include <stdio.h>
2322int main()
2323{
2324char result,str[]="\0IncludeHelp";
2325result=printf("%s",str);
2326if(result)
2327printf("TRUE");
2328else
2329printf("FALSE");
2330return 0;
2331}
2332Find the output
23331.
2334\0IncludeHelpTRUE
23352.
2336\0IncludeHelpFALSE
23373.
2338Error
23394.
2340FALSE
23414.0
2342229
2343#include <stdio.h>
2344int main()
2345{
2346char str[8]="IncludeHelp";
2347printf("%s",str);
2348return 0;
2349}
2350Find the output
23511.
2352IncludeHelp
23532.
2354IncludeH
23553.
2356Error
23574.
2358No output
23593.0
2360230
2361#include <stdio.h>
2362int main()
2363{
2364char str[]="Hello%s%dFriends";
2365printf(str);
2366printf("\n");
2367printf("%s",str);
2368return 0;
2369}
2370Find the output
23711.
2372HelloFriends
2373HelloFriends
23742.
2375Hello%s%dFriends
2376Hello%s%dFriends
23773.
2378Hello(null)0Friends
2379Hello%s%dFriends
23804.
2381Garbage value
23823.0
2383S.NO. Questions Choices Answers
2384231
2385#include <stdio.h>
2386int main()
2387{
2388char str[]="value is =%d";
2389int a='7';
2390str[11]='c';
2391printf(str,a);
2392return 0;
2393}
2394Find the output
23951.
2396value is = %d
23972.
2398value is = %c
23993.
2400value is = 55
24014.
2402value is = 7
24034.0
2404232
2405#include <stdio.h>
2406int main()
2407{
2408char X[10]={'A'},i;
2409for(i=0; i<10; i++)
2410printf("%d ",X[i]);
2411return 0;
2412}
2413Find the output
24141.
2415A 0 0 0 0 0 0 0 0 0
24162.
2417A
24183.
2419A 32 32 32 32 32 32 32 32 32
24204.
2421Error
24224.0
2423233
2424#include <stdio.h>
2425int main()
2426{
2427char *str="IncludeHelp";
2428printf("%c\n",*&*str);
2429return 0;
2430}
2431Find the output
24321.
2433Error
24342.
2435IncludeHelp
24363.
2437I
24384.
2439*I
24403.0
2441234
2442#include <stdio.h>
2443int main(){
2444float a=125.50;
2445int b=125.50;
2446char c='A';
2447printf("%d,%d,%d\n",sizeof(a),sizeof(b),sizeof(125.50));
2448printf("%d,%d\n",sizeof(c),sizeof(65));
2449return 0;
2450}
2451What will be the output on a 32 bit compiler.
24521.
24534, 4, 4
24541, 4
24552.
24564, 4, 8
24571, 1
24583.
24594, 4, 4
24601, 1
24614.
24624, 4, 8
24631, 4
24644.0
2465235
2466#include <stdio.h>
2467int main()
2468{
2469if( (-100 && 100)||(20 && -20) )
2470printf("%s","Condition is true.");
2471else
2472printf("%s","Condition is false.");
2473return 0;
2474}
2475Find the output
24761.
2477Condition is True
24782.
2479Condition is False
24803.
2481No output
24824.
2483Error
24841.0
2485S.NO. Questions Choices Answers
2486236
2487#include <stdio.h>
2488int main()
2489{
2490int a=10;
2491if(10L == a)
2492printf("10L");
2493else if(10==a)
2494printf("10");
2495else
2496printf("0");
2497return 0;
2498}
2499Find the output.
25001.
250110
25022.
250310L
25043.
250510L10
25064.
2507Error
25082.0
2509237
2510#include <stdio.h>
2511int main()
2512{
2513int a=10;
2514if(a==10)
2515{
2516printf("Hello...");
2517break;
2518printf("Ok");
2519}
2520else
2521{
2522printf("Hii");
2523}
2524return 0;
2525}
2526Find the output.
25271.
2528Hello...
25292.
2530Hello...OK
25313.
2532OK...
25334.
2534Error
25354.0
2536238
2537#include <stdio.h>
2538int main()
2539{
2540int a=15;
2541float b=1.234;
2542printf("%*f",a,b);
2543return 0;
2544}
2545Predict the output?
25461.
25471.234
25482.
25491.234000
25503.
25511.234000
25524.
2553Error
25543.0
2555239
2556#include <stdio.h>
2557int main()
2558{
2559int i;
2560for(i=0; i< 5; i++)
2561{
2562if(i*i > 30 )
2563goto lbl;
2564else
2565printf("%d",i);
2566lbl:
2567printf("IHelp ");
2568}
2569return 0;
2570}
2571Find the output
25721.
25730IHelp 1IHelp 2IHelp 3IHelp 4IHelp
25742.
25750IHelp 1IHelp 2IHelp 4IHelp
25763.
25771IHelp
25784.
2579Error
25801.0
2581240
2582#include <stdio.h>
2583int main()
2584{
2585int MAX=10;
2586int array[MAX];
2587printf("size of array is = %d",sizeof(array);
2588return 0;
2589}
2590Find the output
25911.
2592size of array is = 20
25932.
2594size of array is = 40
25953.
2596size of array is = 4
25974.
2598Error
25992.0
2600S.NO. Questions Choices Answers
2601241
2602#include <stdio.h>
2603int main()
2604{
2605int pn=100;
2606if(pn>20)
2607if(pn<20)
2608printf("Heyyyyy");
2609else
2610printf("Hiiiii");
2611return 0;
2612}
2613Find the output.
26141.
2615No output
26162.
2617Hiiiii
26183.
2619Heyyyyy
26204.
2621HeyyyyyHiiiii
26222.0
2623242
2624#include <stdio.h>
2625int main()
2626{
2627int var=100;
2628{
2629int var=200;
2630printf("%d...",var);
2631}
2632printf("%d",var);
2633return 0;
2634}
2635Find the output
26361.
2637ERROR
26382.
2639200...200
26403.
2641100...100
26424.
2643200...100
26444.0
2645243
2646#include <stdio.h>
2647int main()
2648{
2649int var=250;
2650printf("value of var = %d\n",var);
2651200+50;
2652"includehelp.com";
2653printf("%s\n","includehelp");
2654return 0;
2655}
2656Find the output
26571.
2658value of var = 250
2659includehelp.com
26602.
2661value of var = 250
2662includehelp
26633.
2664Error
26654.
2666value of var = 250
2667Garbage
26682.0
2669244
2670#include <stdio.h>
2671int main()
2672{
2673int iVal;
2674char cVal;
2675void *ptr; // void pointer
2676iVal=50; cVal=65;
2677ptr=&iVal;
2678printf("value =%d,size= %d\n",*(int*)ptr,sizeof(ptr));
2679ptr=&cVal;
2680printf("value =%d,size= %d\n",*(char*)ptr,sizeof(ptr));
2681return 0;
2682}
2683Find the output
26841.
2685Error
26862.
2687value =50,size= 4
2688value =65,size= 4
26893.
2690value =50,size= 4
2691value =65,size= 1
26924.
2693Garbage value
26942.0
2695245
2696#include <stdio.h>
2697int main()
2698{
2699static int var[5];
2700int count=0;
2701var[++count]=++count;
2702for(count=0;count<5;count++)
2703printf("%d ",var[count]);
2704return 0;
2705}
2706Find the output
27071.
27080 1 0 0 0
27092.
27100 2 0 0 0
27113.
27120 0 2 0 0
27134.
27140 0 0 0 0
27153.0
2716S.NO. Questions Choices Answers
2717246
2718#include <stdio.h>
2719int main()
2720{
2721struct sample{
2722int a;
2723int b;
2724sample *s;
2725}t;
2726printf("%d,%d",sizeof(sample),sizeof(t.s));
2727return 0;
2728}
2729Find the output
27301.
273112, 12
27322.
273312, 0
27343.
2735Error
27364.
273712, 4
27384.0
2739247
2740#include <stdio.h>
2741int main()
2742{
2743struct std
2744{
2745char name[30];
2746int age;
2747};
2748struct std s1={"Mike",26};
2749struct std s2=s1;
2750printf("Name: %s, Age: %d\n",s2.name,s2.age);
2751}
2752Find the output
27531.
2754Name: Mike, Age: 26
27552.
2756Name: Garbage, Age: Garbage
27573.
2758Name: Null, Age: 26
27594.
2760Error
27611.0
2762248
2763#include <stdio.h>
2764int main()
2765{
2766typedef struct tag{
2767char str[10];
2768int a;
2769}har;
2770har h1,h2={"IHelp",10};
2771h1=h2;
2772h1.str[1]='h';
2773printf("%s,%d",h1.str,h1.a);
2774return 0;
2775}
2776Find the output
27771.
2778ERROR
27792.
2780IHelp, 10
27813.
2782IHelp, 0
27834.
2784Ihelp, 10
27854.0
2786249
2787#include <stdio.h>
2788int main()
2789{
2790union test
2791{
2792int i;
2793int j;
2794};
2795union test var=10;
2796printf("%d,%d\n",var.i,var.j);
2797}
2798Find the output
27991.
280010,10
28012.
280210,0
28033.
28040,10
28054.
2806Error
28074.0
2808250
2809#include <stdio.h>
2810int main()
2811{
2812union values
2813{
2814int intVal;
2815char chrVal[2];i
2816};
2817union values val;
2818val.chrVal[0]='A'; val.chrVal[1]='B';
2819printf("\n%c,%c,%d",val.chrVal[0],val.chrVal[1],val.intVal);
2820return 0;
2821}
2822Find the output
28231.
2824A,B,0
28252.
2826A,B,16961
28273.
2828B,B,66
28294.
2830A,A,65
28312.0
2832S.NO. Questions Choices Answers
2833251
2834#include <stdio.h>
2835int main()
2836{
2837union values
2838{
2839unsigned char a;
2840unsigned char b;
2841unsigned int c;
2842};
2843union values val;
2844val.a=1;
2845val.b=2;
2846val.c=300;
2847printf("%d,%d,%d",val.a,val.b,val.c);
2848return 0;
2849}
2850Find the output
28511.
285244,44,300
28532.
28541,2,300
28553.
28562,2,300
28574.
2858256,256,300
28591.0
2860252
2861#include <stdio.h>
2862int main()
2863{
2864void *ptr;
2865++ptr;
2866printf("%u",ptr);
2867return 0;
2868}
2869Find the output
28701.
28712004
28722.
28732001
28743.
28752000
28764.
2877ERROR
28782.0
2879253
2880#include <stdio.h>
2881struct employee{
2882int empId;
2883char *name;
2884int age;
2885};
2886int main()
2887{
2888struct employee emp []={ {1,"Mike",24}, {2,"AAA",24}, {3,"BBB",25}, {4,"CCC",30} };
2889printf("Id : %d, Age : %d, Name : %s", emp[2].empId,3[emp].age,(*(emp+1)).name);
2890return 0;
2891}
2892Find the output
28931.
2894Id: 3, Age: 24, Name: Mike
28952.
2896Id: 3, Age: 23, Name: Mike
28973.
2898Id: 3, Age: 30, Name: AAA
28994.
2900Error
29013.0
2902254
2903#include <stdio.h>
2904void main()
2905{
2906int a=2;
2907switch(a)
2908{
2909printf("Message\n");
2910default:
2911printf("Default\n");
2912case 2:
2913printf("Case-2\n");
2914case 3:
2915printf("Case-3\n");
2916}
2917printf("Exit from switch\n");
2918}
2919Find the output
29201.
2921Case-2
29222.
2923Message
29243.
2925Message
2926Case-2
29274.
2928Case-2
2929Case-3
2930Exit from switch
29314.0
2932S.NO. Questions Choices Answers
2933255
2934#include <stdio.h>
2935void main(){
2936static int staticVar;
2937int j;
2938for(j=0;j<=5;j+=2)
2939switch(j){
2940case 1:
2941staticVar++;
2942break;
2943case 2:
2944staticVar+=2;
2945case 4:
2946staticVar%=2;
2947j=-1;
2948continue;
2949default:
2950--staticVar;
2951continue;
2952}
2953printf("%d",staticVar);
2954}
2955Find the output
29561.
29570
29582.
29591
29603.
29612
29624.
2963Error
29641.0
2965256
2966#include <stdio.h>
2967void main(){
2968int a=0;
2969a=5||2|1;
2970printf("%d",a);
2971}
2972Find the output.
29731.
29742
29752.
29761
29773.
29780
29794.
29808
29812.0
2982257
2983#include <stdio.h>
2984void main(){
2985int a=1;
2986switch(a/2)
2987{
2988case NULL:
2989printf("Case NULL\n");
2990break;
2991case 0:
2992printf("Case ZERO\n");
2993break;
2994default:
2995printf("DEFAULT\n");
2996break;
2997}
2998}
2999Find the output
30001.
3001Case NULL
30022.
3003Case ZERO
30043.
3005Case DEFAULT
30064.
3007Error
30084.0
3009258
3010#include <stdio.h>
3011void main()
3012{
3013int a=2;
3014int b=a;
3015switch(b)
3016{
3017case a:
3018printf("Case-a\n"); break;
3019case 3:
3020printf("Case-3\n"); break;
3021default:
3022printf("No option\n"); break;
3023}
3024printf("Exit from switch");
3025}
3026Find the output
30271.
3028Case-2
30292.
3030Error: case expression not constant
30313.
3032Message
3033Case-2
30344.
3035Case-2
3036Case-3
3037Exit from switch
30382.0
3039S.NO. Questions Choices Answers
3040259
3041#include <stdio.h>
3042void main()
3043{
3044int cnt=1;
3045while(cnt>=10)
3046{
3047printf("%d,",cnt);
3048cnt+=1;
3049}
3050printf("\nAfter loop cnt=%d",cnt);
3051printf("\n");
3052}
3053Find the output
30541.
3055After loop cnt= 1
30562.
30571,
3058After loop cnt= 2
30593.
3060After loop cnt= 2
30614.
306211
30631.0
3064260
3065#include <stdio.h>
3066void main()
3067{
3068int i,j,charVal='A';
3069for(i=5;i>=1;i--)
3070{
3071for(j=0;j< i;j++)
3072printf("%c ",(charVal+j));
3073printf("\n");
3074}
3075}
3076Identify the output
30771.
3078A B C D E
3079A B C D E
3080A B C D E
3081A B C D E
3082A B C D E
30832.
3084A B C D
3085A B C D
3086A B C D
3087A B C D
30883.
3089A B C D
3090A B C
3091A B
3092A
30934.
3094A B C D E
3095A B C D
3096A B C
3097A B
3098A
30993.0
3100261
3101#include <stdio.h>
3102void main()
3103{
3104int i=1;
3105while (i<=5)
3106{
3107printf("%d",i);
3108if (i==5)
3109goto print;
3110i++;
3111}
3112}f
3113un()
3114{
3115print:
3116printf("includehelp.com");
3117}
3118Find the output
31191.
3120Error
31212.
312212345includehelp.com
31233.
31241234includehelp.com
31254.
31261includehelp.com 2includehelp.com 3includehelp.com 4includehelp.com
31275includehelp.com
31281.0
3129262
3130#include <stdio.h>
3131void main(){
3132int intVar=20,x;
3133x= ++intVar,intVar++,++intVar;
3134printf("Value of intVar=%d, x=%d",intVar,x);
3135}
3136Find the output
31371.
3138Value of intVar=23, x=21
31392.
3140Value of intVar=23, x=23
31413.
3142Value of intVar=21, x=21
31434.ERROR
31441.0
3145S.NO. Questions Choices Answers
3146263
3147#include <stdio.h>
3148void main()
3149{
3150int tally;
3151for(tally=0;tally<10;++tally)
3152{
3153printf("#");
3154if(tally>6)
3155continue;
3156printf("%d",tally);
3157}
3158}
3159Find the output
31601.
3161#0#1#2#3#4#5#6###
31622.
3163#0#1#2#3#4#5#6#7#8#9#10
31643.
3165#0#1#2#3#4#5##7#8#9#10
31664.
3167#0#1#2#3#4#5#
31681.0
3169264
3170#include <stdio.h>
3171void main(){
3172unsigned char c=290;
3173printf("%d",c);
3174}
3175Find the output
31761.
317734
31782.
3179290
31803.
3181Garbage value
31824.
3183Error
31841.0
3185265
3186#include <stdio.h>
3187void main()
3188{c
3189har cnt=0;
3190for(;cnt++;printf("%d",cnt)) ;
3191printf("%d",cnt);
3192}
3193Find the output
31941.
31950 1 2 ... infinity
31962.
31971 2 2 ... 127
31983.
31990
32004.
32011
32024.0
3203266
3204#include <stdio.h<
3205#include <string.h>
3206int main()
3207{
3208char str[];
3209strcpy(str,"Hello");
3210printf("%s",str);
3211return 0;
3212}
3213Find the output
32141.
3215Hello
32162.
3217Error
32183.
3219NULL
32204.
3221NO OUTPUT
32222.0
3223267
3224#include
3225#define SUM(x,y) int s; s=x+y; printf("sum=%d\n",s);
3226int main()
3227{
3228SUM(10,20);
3229return 0;
3230}
3231Find the output
32321.
3233sum=30
32342.
323510,20
32363.
3237Error
32384.
3239sum=0
32401.0
3241268
3242#include
3243int main()
3244{
3245char ch=10;
3246void *ptr=&ch;
3247printf("%d,%d",*(char*)ptr,++(*(char*)ptr));
3248return 0;
3249}
3250Find the output
32511.
325211, 11
32532.
325410, 11
32553.
3256Error
32574.
325810, 10
32591.0
3260S.NO. Questions Choices Answers
3261269
3262#include
3263int main()
3264{
3265char *str []={"AAAAA","BBBBB","CCCCC","DDDDD"};
3266char **sptr []={str+3,str+2,str+1,str};
3267char ***pp;
3268pp=sptr;
3269++pp;
3270printf("%s",**++pp+2);
3271return 0;
3272}
3273Find the output
32741.
3275BBBBB
32762.
3277CCCCC
32783.
3279BBB
32804.
3281Error
32823.0
3283270
3284#include
3285int main()
3286{
3287int a=10,b=2;
3288int *pa=&a,*pb=&b;
3289printf("value = %d", *pa/*pb);
3290return 0;
3291}
3292Find the output
32931.
32945
32952.
32965.0
32973.
3298ERROR
32994.
3300No output
33011.0
3302271
3303#include
3304void fun(int *ptr)
3305{
3306*ptr=100;
3307}i
3308nt main()
3309{
3310int num=50;
3311int *pp=#
3312fun(& *pp);
3313printf("%d,%d",num,*pp);
3314return 0;
3315}
3316Find the output
33171.
3318100,100
33192.
332050,50
33213.
332250,100
33234.
3324Error in function calling
33253.0
3326272
3327#include
3328#define FUN(x) x*x
3329int main()
3330{i
3331nt val=0;
3332val=128/FUN(8);
3333printf("val=%d",val);
3334return 0;
3335}
3336Find the output
33371.
33382
33392.
334012864
33413.
334240
33434.
33441
33452.0
3346273
3347#include
3348int main ()
3349{s
3350tatic int a[]={10, 20, 30 40, 50};
3351static int *p[]= {a, a+3, a+4, a+1, a+2};
3352int **ptr=p;
3353ptr++;
3354printf ("%d%d", ptr p, **ptr);
3355}
3356The output of the program is __________
33571.
335843
33592.
3360140
33613.
336289
33634.
336478
33652.0
3366274
3367#include <stdio.h>
3368#define TRUE 1
3369int main()
3370{
3371switch(TRUE)
3372{
3373printf("Hello");
3374}
3375}
3376Find the output
33771.
3378Hello
33792.
3380ERROR
33813.
3382No output
33834.
3384Garbage
33853.0
3386S.NO. Questions Choices Answers
3387275
3388#include <stdio.h>
3389enum numbers
3390{
3391zero, one, two, three , four=3,five,six,seven=0,eight
3392};
3393void main()
3394{
3395printf("%d,%d,%d,%d,%d,%d,%d,%d,%d",zero,one,two,three,four,five,six,seven,eight);
3396}
3397What will be the output.
33981.
33990, 1, 2, 3, 3, 4, 5, 0, 1
34002.
34010, 1, 2,3,3,1,2,3,4
34023.
34030,1,2,3,3,1,2,3,4
34044.
34050, 1, 2, 3, 3, 4, 5, 0, 9
34061.0
3407276
3408#include <stdio.h>
3409int main(){
3410char val=250;
3411int ans;
3412ans= val+ !val + ~val + ++val;
3413printf("%d",ans);
3414return 0;
3415}
3416Find the output.
34171.
3418-5
34192.
3420-6
34213.
34220
34234.
34246
34252.0
3426277
3427#include <stdio.h>
3428int main()
3429{
3430float a,b;
3431a=3.0f;
3432b=4.0f;
3433printf("%.0f,%.1f,%.2f",a/b,a/b,a/b);
3434return 0;
3435}
3436Find the output.
34371.
34381, 0.8, 0.75
34392.
34400, 0.7, 0.75
34413.
34420, 0.8, 0.75
34434.
3444Error: Invalid format Specifier
34453.0
3446278
3447#include <stdio.h>
3448int main(){
3449float a;
3450(int)a= 10;
3451printf("value of a=%d",a);
3452return 0;
3453}
3454Find the output
34551.
3456value of a=10
34572.
3458value of a=10.000000
34593.
3460value of a=0
34614.
3462L-Value required
34634.0
3464279
3465#include <stdio.h>
3466int main()
3467{
3468int i=-1,j=-1,k=0,l=2,m;
3469m=i++&&j++&&k++||l++;
3470printf("%d %d %d %d %d",i,j,k,l,m);
3471return 0;
3472}
3473Find the output
34741.
34750 0 1 2 1
34762.
34770 0 1 3 2
34783.
34790 0 1 3 1
34804.
34810 1 1 3 1
34823.0
3483280
3484#include <stdio.h>
3485int main()
3486{
3487int intVar=24;
3488static int x=intVar;
3489printf("%d,%d",intVar,x);
3490return 0;
3491}
3492Find the output of this program, (program name is: static_ec.c)
34931.
349424, 24
34952.
349624, 0
34973.
3498Error: Illegal Initialization
34994.
3500Run time error
35013.0
3502S.NO. Questions Choices Answers
3503281
3504#include <stdio.h>
3505int main()
3506{
3507int ok=-100;
3508-100;
3509printf("%d",ok);
3510return 0;
3511}
3512Find the output.
35131.
35140
35152.
3516-100
35173.
3518100
35194.
3520Error
35212.0
3522282
3523#include <stdio.h>
3524int main()
3525{
3526int var;
3527var=- -10;
3528printf("value of var= %d\n",var);
3529var=+ +10;
3530printf("value of var= %d\n",var);
3531return 0;
3532}
3533Find the output
35341.
3535ERROR
35362.
3537value of var= -10
3538value of var= 10
35393.
3540value of var= 10
3541value of var= 10
35424.
3543value of var= 10
3544value of var= 11
35453.0
3546283
3547#include <stdio.h>
3548int main(){
3549int x;
3550x=100,30,50;
3551printf("x=%d\n",x);
3552x=(100,30,50);
3553printf("x=%d\n",x);
3554return 0;
3555}
3556Find the output
35571.
3558x=100
3559x=100
35602.
3561x=100
3562x=50
35633.
3564x=50
3565x=50
35664.
3567x=50
3568x=100
35692.0
3570284
3571#include <stdio.h>
3572void main()
3573{
3574int a=10;
3575switch(a){
3576case 5+5:
3577printf("Hello\n");
3578default:
3579printf("OK\n");
3580}
3581}
3582Find the output
35831.
3584Hello
35852.
3586OK
35873.
3588Hello
3589OK
35904.
3591Error
35923.0
3593285
3594#include <stdio.h>
3595void main()
3596{
3597unsigned short var='B';
3598var+=2;
3599var++;
3600printf("var : %c , %d ", var,var);
3601}
3602Find the output
36031.
3604var : E, 69
36052.
3606var : E, 68
36073.
3608var : D, 69
36094.
3610var : D, 68
36111.0
3612S.NO. Questions Choices Answers
3613286
3614#include <stdio.h>
3615void main()
3616{
3617int a=2;
3618switch(a/2*1.5)
3619{
3620case 1:
3621printf("One...");
3622break;
3623case 2:
3624printf("Two...");
3625break;
3626default:
3627printf("Other...");
3628break;
3629}
3630}
3631Find the output
36321.
3633One...
36342.
3635Two...
36363.
3637Other...
36384.
3639Error
36404.0
3641287
3642#include <stdio.h>
3643void main()
3644{
3645short a=2;
3646switch(a)
3647{
3648case 1L:
3649printf("One\n");
3650break;
3651case 2L:
3652printf("Two\n");
3653break;
3654default:
3655printf("Else\n");
3656break;
3657}
3658}
3659Find the output
36601.
3661One
36622.
3663Two
36643.
3665Else
36664.
3667Error
36682.0
3669288
3670#include <stdio.h>
3671void main()
3672{
3673short day=2;
3674switch(day)
3675{
3676case 2: || case 22:
3677printf("%d nd",day);
3678break;
3679default:
3680printf("%d th",day);
3681break;
3682}
3683}
3684Find the output
36851.
36862 nd
36872.
368822 nd
36893.
3690Error
36914.
36922 nd
369322 nd
36943.0
3695289
3696#include <stdio.h>
3697int main(){
3698int a,b,c;
3699a=0x10; b=010;
3700c=a+b;
3701printf("\nAddition is= %d",c);
3702return 0;
3703}
3704Find the output.
37051.
3706Addition is = 20
37072.
3708Addition is = 24
37093.
3710Addition is = Garbage
37114.
3712Error
37132.0
3714290
3715#include <stdio.h>
3716void main()
3717{
3718int x;
3719x= (printf("AA")||printf("BB"));
3720printf("%d",x);
3721printf("\n");
3722x= (printf("AA")&&printf("BB"));
3723printf("%d",x);
3724}
3725Find the output
37261.
3727AABB1
3728AABB1
37292.
37301
37311
37323.
3733AABB1
3734AA1
37354.
3736AA1
3737AABB1
37384.0
3739S.NO. Questions Choices Answers
3740291 $a = array( null => 'a', true => 'b', false => 'c', 0 => 'd', 1 => 'e', '' => 'f' ); echo count($a), "\n";
3741What will be printed? 1.2 2.3 3.4 4.5 2.0
3742292 $a = array(); if ($a[1]) null; echo count($a), "\n"; What will be printed? 1.0 2.1 3.2 4.Code wont work 1.0
3743293 What is the most common approach for the development of application system now?
37441.
3745Incremental development
37462.
3747Agile
37483.
3749Waterfall
37504.
3751None of the options
37521.0
3753294 ........ data type can store unstructured data
37541.
3755RAW
37562.
3757CHAR
37583.
3759NUMERIC
37604.
3761VARCHAR
37621.0
3763295 A wireless network interface controller can work in
37641.
3765infrastructure mode
37662.
3767ad-hoc mode
37683.
3769both infrastructure and ad-hoc mode
37704.
3771none
37723.0
3773296
3774Consider the code snippet given below
3775var count = [1,,3];
3776What is the observation made?
37771.
3778The omitted value takes “undefined”
37792.
3780This results in an error
37813.
3782This results in an exception
37834.
3784Can't predict
37851.0
3786297
3787Consider the following javascript statements
3788x = ~-y;
3789w = x = y = z;
3790q = a?b:c?d:e?f:g;
3791The above code snippet is equivalent to:
37921.
3793x = ~(-y); w = (x = (y = z));
3794q = a?b:(c?d:(e?f:g));
37952.
3796x = a?b:(c?d:(e?f:g));
3797q = ~(-y); w = (x = (y = z));
37983.
3799x = (x = (y = z));w = ~(-y);
3800q = a?b:(c?d:(e?f:g));
38014.
3802x = ~(-y); w = (x = (y = z));
3803q = (c?d:(e?f:g));
38044.0
3805S.NO. Questions Choices Answers
3806298
3807Consider the following statements
3808var text = "testing: 1, 2, 3"; // Sample text
3809var pattern = /\d+/g // Matches all instances of one or more digits
3810In order to check if the pattern matches with the string “text”, the statement is
38111.
3812text==pattern
38132.
3814text.equals(pattern)
38153.
3816text.test(pattern)
38174.
3818pattern.test(text)
38194.0
3820299 ------ is the minimal super key
38211.
3822Partial Key
38232.
3824Candidate Key
38253.
3826Surrogate Key
38274.
3828Unique Key
38292.0
3830300 ----------- is a built - in JavaScript function which can be used to execute another function after a
3831given time interval. 1.Timeout( ) 2.TimeInterval( ) 3.setTimeout ( ) 4.All of the above 3.0
3832301 .......... command can be used to modify a column in a table
38331.
3834alter
38352.
3836update
38373.
3838set
38394.
3840create
38411.0
3842302 .………………… is preferred method for enforcing data integrity
38431.
3844Constraints
38452.
3846Stored Procedure
38473.
3848Triggers
38494.
3850Cursors
38511.0
3852303 66.6% risk is considered as
38531.
3854very low
38552.
3856low
38573.
3858moderate
38594.
3860high
38614.0
3862304 8086 microprocessor is interfaced to 8253 a programmable interval timer. The maximum number
3863by which the clock frequency on one of the timers is divided by 1.216 2.28 3.210 4.220 1.0
3864S.NO. Questions Choices Answers
3865305 Which activity most easily lends itself to incremental design?
38661.
3867User Interfaces
38682.
3869Web Services
38703.
3871Enterprise resource planning
38724.
3873Embedded Sofftware
38743.0
38753016. Graphical representation of the project, showing each task and activity as horizontal bar whose
3876length is proportion to time taken for a completion of that activity is called
38771.Gantt Chart 2.
3878Structure Chart
38793.
3880Pert Chart
38814.
3882Time Line
38831.0
38843017. Software deteriorates rather than wears out because
38851.
3886Software suffers from exposure to hostile environments
38872.
3888Defects are more likely to arise after software has been used
3889often
38903.
3891Multiple change requests introduce errors in component
3892interactions
38934.
3894Software spare parts become harder to order
38953.0
38963018. The 40-20-40 rule suggests that the least amount of development effort can be spent on
38971.Estimation and planning 2.
3898Analysis and design
38993.
3900Coding
39014.
3902Testing
39033.0
39043019. The prototyping model of software development is
39051.
3906A reasonable approach when requirements are well defined
39072.
3908A Useful approach when a customer cannot define requirements
3909clearly
39103.
3911The best approach to use projects with larger development teams
39124.
3913A risky model that rarely produces a meaningful product
39142.0
3915310 In reuse-oriented software engineering the last stage is _________.
39161.
3917component analysis
39182.
3919requirements modification
39203.
3921system validation
39224.
3923system design
39243.0
3925S.NO. Questions Choices Answers
3926311 Which of the following is not a part/product of requirements engineering?
39271.
3928Feasibility study
39292.
3930Requirements validation
39313.
3932System models
39334.
3934Architectural design
39354.0
39363112. Software Specification is the process where
39371.
3938you decide what software you will use to program
39392.
3940you develop a prototype and show it to the client
39413.
3942You find out what services are required from the system
39434.
3944none
39453.0
39463113. What is an advantage of incremental delivery?
39471.
3948everything is coded at once, so the customer receives the full
3949product
39502.
3951replacement systems are easily developed with full features that
3952clients expected from the old system
39533.
3954Customers can use prototypes and gain experience that informs
3955their requirements for later systems
39564.
3957none of the mentioned
39583.0
39593114. This is a software development process model
39601.waterfall model 2.
3961Incremental model
39623.
3963Boehm's Spiral model
39644.
3965all
39664.0
39673115. What is the type of software design that defines interfaces between system
3968components?
39691.
3970architectural design
39712.
3972Interface Design
39733.
3974component Design
39754.
3976database design
39772.0
3978316
3979The size of the data count register of a DMA controller is 16 bits. The processor needs to transfer a
3980file of 29,154 kilobytes from disk to main memory. The memory is byte addressable. The
3981minimum number of times the DMA controller needs to get the control of the system bus from the
3982processor to transfer the file from the disk to main memory is
39831.
3984454
39852.
3986455
39873.
3988456
39894.
3990457
39913.0
3992S.NO. Questions Choices Answers
3993317
3994For which of the following flip-flop the output clearly defined for all combinations of two inputs?
39951.
3996D type flip-flop
39972.
3998R S type flip-flop
39993.
4000J K flip-flop
40014.
4002T flip-flop
40033.0
4004318
4005In excitation table of D flipflop next state is equal to
40061.
4007Next State
40082.
4009Present State
40103.
4011Previous State
40124.
4013D State
40144.0
4015319
4016A computer system implements 8 kilobyte pages and a +32-bit physical address space. Each page
4017table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the
4018maximum size of the page table of a process is 24 megabytes, the length of the virtual address
4019supported by the system is _________ bits.
40201.
402133
40222.
402335
40243.
402534
40264.
402736
40284.0
4029320
4030A graphical display of the fundamental products in a truth-table is known as
40311.
4032Mapping
40332.
4034Graphing
40353.
4036T-map
40374.
4038Karnaugh-Map
40394.0
4040321
4041A processor can support a maximum memory of 4 GB, where the memory is word-addressable (a
4042word consists of two bytes). The size of the address bus of the processor is at least __________
4043bits
40441.
404530
40462.
404731
40483.
404932
40504.
405133
40522.0
4053S.NO. Questions Choices Answers
4054322
4055A Stack-organized Computer uses instruction of
40561.
4057Indirect addressing
40582.
4059Two-addressing
40603.
4061Zero addressing
40624.
4063Index addressing
40643.0
4065323
4066A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of
40678 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of
4068bits for the TAG field is
40691.
407019
40712.
407220
40733.
407421
40754.
407622
40772.0
4078324
4079A circuit that converts n inputs to 2^n outputs is called
40801.
4081Encoder
40822.
4083Decoder
40843.
4085Comparator
40864.
4087Carry Look Ahead
40881.0
4089325
4090A Program Counter contains a number 825 and address part of the instruction contains the number
409124. The effective address in the relative address mode, when an instruction is read from the
4092memory is
40931.
4094849
40952.
4096850
40973.
4098801
40994.
4100802
41012.0
4102326
4103Buffering is useful because
41041.
4105It makes it seem like there’s more memory in the computer
41062.
4107It reduces the number of memory copies required
41083.
4109It allows all device drivers to use the same code
41104.
4111It allows devices and thee CPU to operate asynchronously
41124.0
4113S.NO. Questions Choices Answers
4114327
4115Consider a 6-stage instruction pipeline, where all stages are perfectly balanced.Assume that there
4116is no cycle-time overhead of pipelining. When an application is executing on this 6-stage pipeline,
4117the speedup achieved with respect to non-pipelined execution if 25% of the instructions incur 2
4118pipeline stall cycles is
41191.
41201
41212.
41222
41233.
41244
41254.5
41263.0
4127328
4128Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method.
4129There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for
4130intermediate results. Assuming size(r(R))
41311.
4132Relation r(R) is in the outer loop.
41332.
4134Relation s(S) is in the outer loop.
41353.
4136Join selection factor between r(R) and s(S) is more than 0.5
41374.
4138Join selection factor between r(R) and s(S) is less than 0.5.
41391.0
4140329
4141Consider a main memory system that consists of 8 memory modules attached to the system bus,
4142which is one word wide. When a write request is made, the bus is occupied for 100 nanoseconds
4143(ns) by the data, address, and control signals. During the same 100 ns, and for 500 ns thereafter,
4144the addressed memory module executes one cycle accepting and storing the data. The (internal)
4145operation of different memory modules may overlap in time, but only one request can be on the bus
4146at any time. The maximum number of stores (of one word each) that can be initiated in 1
4147millisecond is
41481.
41495535
41502.
415165335
41523.
415353892
41544.
415510000
41564.0
4157330
4158Consider two processors P1 and P2 executing the same instruction set. Assume that under identical
4159conditions, for the same input, a program running on P2 takes 25% less time but incurs 20% more
4160CPI (clock cycles per instruction) as compared to the program running on P1 If the clock
4161frequency of P1 is 1GHz, then the clock frequency of P2 (in GHz) is
41621.
41631.5
41642.
41651.6
41663.
41671.7
41684.
41691.8
41702.0
4171331
4172Content of the program counter is added to the address part of the instruction in order to obtain the
4173effective address is called
41741.
4175relative address mode.
41762.
4177index addressing mode.
41783.
4179register mode
41804.
4181implied mode
41821.0
4183S.NO. Questions Choices Answers
4184332
4185How many address bits are needed to select all memory locations in the 16K × 1 RAM?
41861.
41878
41882.
418910
41903.
419114
41924.
419316
41943.0
4195333
4196If the associativity of a processor cache is doubled while keeping the capacity and block size
4197unchanged, which one of the following is guaranteed to be NOT affected?
41981.
4199Width of tag comparator
42002.
4201Width of set index decoder
42023.
4203Width of way selection multiplexer
42044.
4205Width of processor to main memory data bus
42064.0
4207334
4208If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative
4209mapping. Then each word of cache memory shall be_____.
42101.
421111 bits
42122.
421321 bits
42143.
421516 bits
42164.
421720 bits
42183.0
4219335
4220If two interrupts, one of higher priority and other of lower priority occur simultaneously, then the
4221service provided is for
42221.
4223interrupt of lower priority
42242.
4225interrupt of higher priority
42263.
4227both the interrupts
42284.
4229none of the mentioned
42302.0
4231336
4232Minterms are arranged in map in a sequence of
42331.
4234binary sequence
42352.
4236gray code
42373.
4238binary variables
42394.
4240BCD code
42412.0
4242S.NO. Questions Choices Answers
4243337
4244Register renaming is done is pipelined processors
42451.
4246As an alternative to register allocation at compile time
42472.
4248For efficient access to function parameters and local variables
42493.
4250To handle certain kinds of hazards
42514.
4252As part of address translation
42533.0
4254338
4255Simplified form of the boolean expression (X + Y + XY) (X + Z) is
42561.
4257X + Y + Z
42582.
4259XY + YZ
42603.
4261X + YZ
42624.
4263XZ + Y
42643.0
4265339
4266The 16-bit 2’s complement representation of an integer is 1111 1111 1111 0101, its decimal
4267representation is
42681.
42691
42702.
42712
42723.
42733
42744.
4275-11
42764.0
4277340
4278The addressing mode used in an instruction of the form ADD R1, R2 is _____.
42791.
4280Absolute
42812.
4282Indirect
42833.
4284Index
42854.
4286Register
42873.0
4288341
4289The capacity of a memory unit is defined by the number of words multiplied by the number of
4290bits/word. How many separate address and data lines are needed for a memory of 4 K × 16?
42911.
429210 address, 16 data lines
42932.
429411 address, 8 data lines
42953.
429612 address, 12 data lines
42974.
429812 address, 16 data lines
42994.0
4300S.NO. Questions Choices Answers
4301342
4302The data-in register of I/O port is
43031.
4304read by host to get input
43052.
4306read by controller to get input
43073.
4308written by host to send output
43094.
4310written by host to start a command
43111.0
4312343
4313The Firmware are stored in read-only memory or ________ chips.
43141.
4315Flash memory
43162.
4317Dynamic random access memory
43183.
4319EEPROM
43204.
4321Random-access memory
43223.0
4323344
4324The performance of cache memory is frequently measured in terms of a quantity called
43251.
4326hit ratio
43272.
4328miss ratio
43293.
4330average ratio
43314.
4332ratio
43331.0
4334345
4335The smallest integer than can be represented by an 8-bit number in 2?s complement form is
43361.
4337-256
43382.
4339-128
43403.
4341-127
43424.
43431
43442.0
4345346
4346The main difference between JK and RS flip-flop is that
43471.
4348JK flip flop needs a clock pulse
43492.
4350There is a feedback in JK flip-flop
43513.
4352JK flip-flop accepts both inputs as 1
43534.
4354JK flip-flop is acronym of Junction cathode multi-vibrator
43553.0
4356S.NO. Questions Choices Answers
4357347
4358The rate at which a computer clock deviates from a perfect reference clock is called as
43591.
4360Clock rate
43612.
4362Clock speed
43633.
4364clock drift rate
43654.
4366Transmission Bandwidth
43673.0
4368348
4369The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8-
4370way set associative cache is ______ bits
43711.
437221
43732.22
43743.
437523
43764.
437724
43784.0
4379349
4380To build a mod-19 counter the number of flip-flops required is
43811.
43823
43832.
43845
43853.
43867
43874.
43889
43892.0
4390350
4391Using 10's complement 72532- 3250 is
43921.
439369282
43942.
439569272
43963.
439769252
43984.
439969232
44001.0
4401351
4402What is the main difference between traps and interrupts?
44031.
4404How they are initiated
44052.
4406The kind of code that’s used to handle them
44073.
4408Whether or not the scheduler is called
44094.
4410How the operating system returns from them
44111.0
4412S.NO. Questions Choices Answers
4413352
4414When an instruction is read from the memory, it is called
44151.
4416Memory Read cycle
44172.
4418Fetch cycle
44193.
4420Instruction cycle
44214.
4422Memory write cycle
44233.0
4424353
4425Which amongst the following refers to Absolute addressing mode
44261.
4427move R1, R2
44282.
4429move LOC1, LOC2
44303.
4431move LOC1, R2
44324.
4433move LOC2, R1
44341.0
4435354
4436Which level of RAID refers to disk mirroring with block striping?
44371.
4438RAID level 1
44392.
4440RAID level 2
44413.
4442RAID level 0
44434.
4444RAID level 3
44451.0
4446355
4447Which of the following logic expression is incorrect?
44481.
44491 ⊕ 0 = 1
44502.
44511 ⊕ 1 ⊕ 0 =1
44523.
44531 ⊕ 1 ⊕ 1 = 1
44544.
44551 ⊕ 1 = 0
44562.0
4457356
4458Which of the following paging algorithms is most likely to be used in a virtual memory system?
44591.
4460FIFO
44612.
4462Second chance
44633.
4464Least Recently Used
44654.
4466Least Frequently Used
44673.0
4468S.NO. Questions Choices Answers
4469357
4470Which one of the following connects high-speed high-bandwidth device to memory subsystem and
4471CPU.
44721.
4473expansion bus
44742.
4475PCI bus
44763.
4477SCSI bus
44784.
4479none of the mentioned
44801.0
4481358
4482Which one of these is characteristic of RAID 5?
44831.
4484Distributed parity
44852.
4486No Parity
44873.
4488All parity in a single disk
44894.
4490Double Parity
44911.0
4492359
4493Which two RAID types use parity for data protection?
44941.
4495RAID 1
44962.
4497RAID 4
44983.
4499RAID 1+0
45004.
4501RAID 5
45024.0
4503360
4504X=1010100 and Y=1000011 using 1's complement Y-X is
45051.
4506-10111
45072.
4508-10011
45093.
4510-10001
45114.
4512-11001
45133.0
4514361
4515The minimum number of NAND gates required to implement the Boolean function. A + AB' +
4516AB'C is equal to
45171.
4518Zero
45192.
45201
45213.
45224
45234.
45247
45251.0
4526S.NO. Questions Choices Answers
4527362
4528Which of the following boolean expressions is not logically equivalent to all of the rest ?
45291.
4530ab + (cd)' + cd + bd'
45312.
4532a (b + c) + cd
45333.
4534ab + ac + (cd)'
45354.
4536bd' + c'd' + ab + cd
45373.0
4538363
4539Which of the following unit will choose to transform decimal number to binary code ?
45401.
4541Encoder
45422.
4543Decoder
45443.
4545Multiplexer
45464.
4547Counter
45481.0
4549364
4550If the associativity of a processor cache is doubled while keeping the capacity and block size
4551unchanged, which one of the following is guaranteed to be NOT affected?
45521.Width of tag comparator
45532.Width of set index decoder
45543.Width of way selection multiplexer
45554.Width of processor to main memory data bus
45564.0
4557365
4558The correspondence between the main memory blocks and those in the cache is given by
45591.
4560Hash function
45612.
4562Mapping function
45633.
4564Locale function
45654.
4566Assign function
45672.0
4568366
4569The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage (with
4570delay 800 picoseconds) is replaced with a functionally equivalent design involving two stages with
4571respective delays 600 and 350 picoseconds. The throughput increase of the pipeline is __________
4572percent.
45731.
457433
45752.
457634
45773.
457835
45794.
458032
45811.0
4582367
4583What is the software that runs a computer, including scheduling tasks, managing storage, and
4584handling communication with peripherals?
45851.
4586driver
45872.
4588application suitex
45893.
4590operating system
45914.
4592bluetooth technology
45933.0
4594S.NO. Questions Choices Answers
4595368 For an undirected graph with n vertices and e edges, the sum of the degree of each vertex isequal
4596to
45971.2n
45982.
4599(2n-1)/2
46003.2e
46014.
4602pow(e,2)/2
46033.0
4604369 Which attribute is used to extend the lifetime of a cookie?
46051.
4606higher-age
46072.
4608increase-age
46093.
4610max-age
46114.
4612lifetime
46133.0
4614370 <h2 style="color:blue">I am Blue</h2> is ____ way of styling HTML elements
46151.
4616Internal Style
46172.
4618Inline Style
46193.
4620External Style
46214.
4622Default
46232.0
4624371 ____________ is referred to as Static Web
46251.
4626Web 1.0
46272.
4628Web 2.0
46293.
4630Web 3.0
46314.
4632Web 4.0
46331.0
4634372
4635A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order
4636traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that
4637order. The level-order traversal of the heap after the insertion of the elements is:
46381.
463910, 8, 7, 3, 2, 1, 5
46402.
464110, 8, 7, 2, 3, 1, 5
46423.
464310, 8, 7, 1, 2, 3, 5
46444.
464510, 8, 7, 5, 3, 2, 1
46461.0
4647373
4648A binary tree in which if all its levels except possibly the last, have the maximum number of nodes
4649and all the nodes at the last level appear as far left as possible, is known as
46501.
4651full binary tree
46522.
4653AVL tree
46543.
4655threaded tree
46564.
4657complete binary tree
46581.0
4659S.NO. Questions Choices Answers
4660374 A binary tree T has 20 leaves. The number of nodes in T having two children is
46611.
466234
46632.
466499
46653.
46667
46674.
466819
46694.0
4670375
4671A process executes the code
4672fork ();
4673fork ();
4674fork ();
4675The total number of child processes created is
46761.
46773
46782.
46794
46803.
46817
46824.
46838
46843.0
4685376 A Search engine can serve as
46861.
4687both as a server and a client
46882.
4689As Client always
46903.
4691As Server always
46924.
4693Neither client nor server
46941.0
4695377 An object of class A receives a message with an argument that is an instance of class B. Identify
4696the type of relationship between class A and Class B:
46971.
4698Generalization
46992.
4700Association
47013.
4702Aggregation
47034.
4704Realization
47051.0
4706378
4707Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 =
4708i = 12, 1 = j = 12}. There is an edge between (a, b) and (c, d) if |a - c| = 1 and |b - d| = 1. The
4709number of edges in this graph is
47101.
4711505
47122.
4713506
47143.
4715507
47164.
4717508
47182.0
4719379
4720Consider an undirected random graph of eight vertices. The probability that there is an edge
4721between a pair of vertices is ½. What is the expected number of unordered cycles of length
4722three?
47231.
47241/8
47252.
47261
47273.
47287
47294.
47308
47313.0
4732S.NO. Questions Choices Answers
4733380
4734Consider the C function given below.
4735int f(int j)
4736{s
4737tatic int i = 50;
4738int k;
4739if (i == j)
4740{
4741printf("something");
4742k = f(i);
4743return 0;
4744}e
4745lse return 0;
4746}
4747Which one of the following is TRUE?
47481.
4749The function returns 0 for all values of j.
47502.
4751The function prints the string something for all values of j.
47523.
4753The function returns 0 when j = 50.
47544.
4755The function will exhaust the runtime stack or run into an infinite loop
4756when j = 50.
47574.0
4758381
4759Consider the following function written the C programming language.
4760void foo (char * a ) {
4761if (* a & & * a ! =' ' ){
4762putchar (*a);
4763}}}
4764The output of the above function on input 'ABCD EFGH' is
47651.
4766ABCD EFGH
47672.
4768ABCD
47693.
4770HGFE DCBA
47714.
4772DCBA
47731.0
4774382
4775Consider the following New-order strategy for traversing a binary tree:
47761)Visit the root;
47772)Visit the right subtree using New-order;
47783)Visit the left subtree using New-order;
4779The New-order traversal of the expression tree corresponding to the reverse polish expression 3 4 *
47805 - 2 ? 6 7 * 1 + - is given by:
47811.
4782+ - 1 6 7 * 2 ? 5 - 3 4 *
47832.
4784. - + 1 * 6 7 ? 2 - 5 * 3 4
47853.
4786- + 1 * 7 6 ? 2 - 5 * 4 3
47874.
4788. 1 7 6 * + 2 5 4 3 * - ? -
47893.0
4790383
4791Consider the following program:
4792int f(int *p, int n)
4793{i
4794f (n <= 1) return 0;
4795else return max ( f (p+1, n-1),p[0]-p[1]);
4796}i
4797nt main()
4798{i
4799nt a[] = {3,5,2,6,4};
4800printf("%d", f(a,5));
4801}
4802The value printed by this program is
48031.
48042
48052.
48061
48073.
48083
48094.
48104
48113.0
4812384
4813Consider the following recursive C function.
4814Void get (int n)
4815{if (n<1) return;
4816get (n-1)
4817get (n-3) ;
4818printf ("%d",n);
4819If get(6) function is being called in main () then how many times will the get() function be invoked
4820before returning to the main ( ) ?
48211.
482215
48232.
482425
48253.
482643
48274.
482824
48292.0
4830S.NO. Questions Choices Answers
4831385
4832Consider the function func shown below:
4833int func(int num) {
4834int count = 0;
4835while (num) {
4836count++;
4837num>>= 1;
4838}r
4839eturn (count);
4840}
4841The value returned by func(435)is
48421.
48437
48442.
48458
48463.
48479
48484.
48490
48503.0
4851386 For the array (77 ,62,114,80,9,30,99), write the order of the elements after two passes using the
4852Radix sort
48531.
485480 30 62 114 77 9 99
48552.
4856114 30 62 77 9 99
48573.
48589 114 30 62 77 80 99
48594.
48609 30 62 77 80 99 114
48612.0
4862387 How can you make a list that lists the items with numbers?
48631.
4864<list>
48652.
4866<ol>
48673.
4868<dl>
48694.
4870<ul>
48712.0
4872388 How do you write "Hello World" in PHP?
48731.
4874using System.out.println
48752.
4876using Document.Write("Hello World")
48773.
4878"Hello World"
48794.
4880using echo("Hello World")
48814.0
4882389 HTTP is implemented over
48831.
4884UDP
48852.
4886TCP
48873.
4888SMTP
48894.
4890POP
48912.0
4892390 If every node u in G adjacent to every other node v in G, A graph is said to be
48931.
4894isolated
48952.
4896complete
48973.
4898finite
48994.
4900strongly connected
49012.0
4902S.NO. Questions Choices Answers
4903391 In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the
4904following statements is true?
49051.
4906A tree has no bridges
49072.
4908A bridge cannot be part of a simple cycle
49093.
4910Every edge of a clique with size 3 is a bridge (A clique is any compete
4911sub graph of a graph)
49124.
4913A graph with bridges cannot have a cycle
49144.0
4915392 In HTTP, which method gets the resource as specified in the URI
49161.
4917GET
49182.
4919POST
49203.
4921PUT
49224.
4923TRACE
49243.0
4925393 Java package is a grouping mechanism with the purpose of
49261.
4927Providing the library for the Java program
49282.
4929Controlling the visibility of the classes, interfaces and methods
49303.
4931Replacing header file used in C/C++
49324.
4933An application framework
49342.0
4935394
4936Suppose a circular queue of capacity (n ? 1) elements is implemented with an array of n elements.
4937Assume that the insertion and deletion operations are carried out using REAR and FRONT as
4938array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue
4939full and queue empty are
49401.
4941full: (REAR+1) mod n==FRONT
4942empty: REAR ==FRONT
49432.
4944(REAR) mod n==FRONT
4945empty: REAR ==FRONT
49463.
4947(REAR+1) mod n==Rear
4948empty: REAR ==FRONT
49494.
4950full: (FRONT+1) mod n==FRONT
4951empty: REAR ==FRONT
49521.0
4953395
4954The following function computes the maximum value contained in an integer array
4955p[ ] of size n (n >= 1).
4956int max(int *p, int n) {
4957int a=0, b=n-1;
4958while (__________) {
4959if (p[a] <= p[b]) { a = a+1; }
4960else { b = b-1; }
4961}r
4962eturn p[a];
4963}
4964The missing loop condition is
49651.
4966a != n
49672.
4968b != 0
49693.
4970b > (a+1)
49714.
4972b != a
49734.0
4974396 The following HTML element helps making animated text
49751.
4976<em>
49772.
4978<ins>
49793.
4980<mark>
49814.
4982<marquee>
49834.0
4984S.NO. Questions Choices Answers
4985397 The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty binary
4986search tree, such that the resulting tree has height 6, is
49871.
498863
49892.
499064
49913.
499265
49934.
499466
49952.0
4996398
4997The purpose of a TLB is
49981.
4999To cache page translation information
50002.
5001To cache frequently used data
50023.
5003To hold register values while a process is waiting to be run
50044.
5005To hold the start and length of the page table
50062.0
5007399 The following HTML element is used to display horizontal line
50081.
5009<br>
50102.
5011<h>
50123.
5013<hr>
50144.
5015<h2>
50163.0
5017400 To prevent any method from overriding, the method has to declared as,
50181.
5019static
50202.
5021const
50223.
5023final
50244.
5025extends
50263.0
5027401 Use of ________ allows for some processes to be waiting on I/O while another process executes.
50281.
5029multiprogramming
50302.
5031multiuser interfacing
50323.
5033Random scheduling
50344.
5035Variable cpu cycles
50361.0
5037402 What are the parameters of the service method?
50381.
5039ServletRequest and ServletResponse
50402.
5041HttpServletRequest and HttpServletResponse
50423.
5043HttRequest and HttpResponse
50444.
5045Request and Response
50462.0
5047S.NO. Questions Choices Answers
5048403 What does JSP stand for?
50491.
5050Java Scripting Pages
50512.
5052Java Service Pages
50533.
5054Java Server Pages
50554.
5056Java Script Program
50573.0
5058404
5059What does the following bit of JavaScript print out?
5060var a = [1,,3,4,5];
5061console.log([a[4], a[1], a[5]]);
50621.
50635, undefined,undefined
50642.
50655,3,undefined
50663.
50675,0,undefined
50684.
50695,null,undefined
50701.0
5071405 What is cell padding?
50721.
5073Used to separate cell walls from their contents
50742.
5075Used to set space between cells
50763.
5077Used to provide width to a cell
50784.
5079Used to merge two cells
50802.0
5081406 What is the correct HTML for making a text input field?
50821.
5083<input type="text">
50842.
5085<textfield>
50863.
5087<input type="textfield">
50884.
5089<textinput type="text">
50901.0
5091407
5092What will be printed as the output of the following program?
5093public class testincr
5094{
5095public static void main(String args[])
5096{i
5097nt i = 0;
5098i = i++ + i;
5099System.out.println(" I = " +i);
5100}}
51011.
5102I = 0
51032.
5104I = 1
51053.
5106I = 2
51074.
5108I = 3
51092.0
5110S.NO. Questions Choices Answers
5111408 Which method is used to get the year of a date object in YYYY format in Javascript.
51121.
5113getYear()
51142.
5115getYYYY()
51163.
5117getFullYear()
51184.
5119get4Year()
51201.0
5121409 Which of the following input controls that cannot be placed using <input> tag?
51221.
5123Text
51242.
5125Password
51263.
5127Submit
51284.
5129Textarea
51304.0
5131410 Which is the correct CSS syntax?
51321.
5133body:color=black
51342.
5135{body;color:black}
51363.
5137{body:color=black(body}
51384.
5139body {color: black}
51404.0
5141411 Which of the following asymptotic notation is the worst among all?
51421.
5143n + 9378
51442.
51452^ n-1
51463.
51472^ n - 1
51484.
51492n ? 1
51502.0
5151412
5152Which of the following is/are example(s) of stateful application layer protocols?
5153(i)HTTP
5154(ii)FTP
5155(iii)TCP
5156(iv)POP3
51571.
5158(i) and (ii) only
51592.
5160(ii) and (iii) only
51613.
5162(ii) and (iv) only
51634.
5164(iv) only
51653.0
5166413 Which of these is not a valid attribute of <tr> element?
51671.
5168valign
51692.
5170bgcolor
51713.
5172align
51734.
5174rowspan
51754.0
5176S.NO. Questions Choices Answers
5177414
5178Which of these methods has no restrictions on content size when a form is submitted.
51791.
5180GET
51812.
5182HEAD
51833.
5184POST
51854.
5186PUT
51873.0
5188415 Which one is the first search engine in internet?
51891.
5190Google
51912.
5192Archie
51933.
5194AltaVista
51954.
5196WAIS
51972.0
5198416 While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in the
5199sequence shown, the element in the lowest level is
52001.
520145
52022.
520367
52043.
520534
52064.
520778
52082.0
5209417 A mailer that transforms a message body of an e-mail into a web page is called a
52101.
5211Browser enriched mail client
52122.
5213HTML-enabled mail client
52143.
5215Rich Text mail client
52164.
5217client server mail client
52182.0
5219418 An incorrectly typed command will cause the operating system to display
52201.
5221a prompt
52222.
5223an error message
52243.
5225a question mark
52264.
5227causes exception
52282.0
5229419 Choose the correct HTML to left-align the content inside a table cell
52301.
5231<tdleft>
52322.
5233<td leftalign>
52343.
5235<td valign="left">
52364.
5237<td align="left">
52384.0
5239S.NO. Questions Choices Answers
5240420
5241Consider the below code fragment:
5242if(fork k( ) = = 0)
5243{a
5244= a+5; printf("%d, %d \n", a, &a);
5245}e
5246lse
5247{a
5248= a ? 5;
5249printf("%d %d \n", 0, &a);
5250}
5251Let u, v be the values printed by parent process and x, y be the values printed by child process.
5252Which one of the following is true?
52531.
5254u= x + 10 and v = y
52552.
5256u= x + 10 and v!= y
52573.
5258u + 10= x and v = y
52594.
5260u + 10= x and v != y
52613.0
5262421
5263Consider the following C code segment:
5264int a, b, c = 0;
5265void prtFun(void);
5266main( )
5267{ static int a = 1; /* Line 1 */
5268prtFun( );
5269a + = 1;
5270prtFun( )
5271printf("\n %d %d", a, b);
5272}
5273void prtFun(void)
5274{ static int a=2; /* Line 2 */
5275int b=1;
5276a+=++b;
5277printf("\n %d %d", a, b);
5278}
5279What output will be generated by the given code segment if:
5280Line 1 is replaced by auto int a = 1;
5281Line 2 is replaced by register int a = 2;
52821.
528331
528441
528542
52862.
528742
528861
528961
52903.
529142
529262
529320
52944.
529542
529642
529720
52984.0
5299422
5300Consider the following C program.
5301#include <stdio.h>
5302int f1 (void) ;
5303int f 2 (void) ;
5304int x = 10;
5305int main ()
5306{i
5307nt x=1;
5308x+=f1()+ f2()+f3()+f2() ;
5309printf("%d", x);
5310return 0;
5311}i
5312nt f1(){int x=25; x++; return x;}
5313int f2(){static int x =50; x++;return x;}
5314int f3(){x*=10; return x};
5315The output of the program is_________.
53161.
5317434
53182.
5319230
53203.
532143
53224.
5323432
53242.0
5325423
5326Consider the following program:
5327int f(int *p, int n)
5328{i
5329f (n <= 1) return 0;
5330else return max ( f (p+1, n-1),p[0]-p[1]);
5331}i
5332nt main()
5333{i
5334nt a[] = {3,5,2,6,4};
5335printf("%d", f(a,5));
5336}
5337The value printed by this program is
53381.
53391
53402.
53412
53423.
53433
53444.
53454
53463.0
5347S.NO. Questions Choices Answers
5348424
5349Find the output of the following program?
5350#include <iostream.h>
5351using namespace std;
5352void myFunction(int& x, int* y, int* z) {
5353static int temp=1;
5354temp += (temp + temp) - 1;
5355x += *(y++ + *z)+ temp - ++temp;
5356*y=x;
5357x=temp;
5358*z= x;
5359cout<<x<<*y<<*z<<temp;
5360}
5361int main() {
5362int i = 0;
5363int j[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
5364i=i++ - ++i;
5365myFunction(i, j, &i);
5366return 0;
5367}
53681.
53693 3 3 2
53702.
53713 2 3 3
53723.
53733 2 3 2
53744.
53753 1 3 3
5376gar3
5377425 If you don’t want the frame windows to be resizeable, simply add what to the lines ?
53781.
5379save
53802.
5381dontresize
53823.
5383noresize
53844.
5385Delete
53863.0
5387426 Sockets originate from
53881.
5389BSD Unix
53902.
5391Windows
53923.
5393Linux
53944.
5395Mac
53961.0
5397427 The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42.Which
5398one of the following is the postorder traversal sequence of the same tree?
53991.
540010,20,15,23,25,35,42,39,30
54012.
540215,10,25,23,20,42,35,39,30
54033.
540415,20,10,23,25,42,35,39,30
54054.
540615,10,23,25,20,35,42,39,30
54074.0
5408428
5409What will be the output of the following C program?
5410void count(int n){
5411static int d=1;
5412printf("%d ", n);
5413printf("%d ", d);
5414d++;
5415if(n>1) count(n-1);
5416printf("%d ", d);
5417}
5418void main(){
5419count(3);
5420}
54211.
54223 1 2 2 1 3 4 4 4
54232.
54243 1 2 1 1 1 2 2 2
54253.
54263 1 2 2 1 3 4
54274.
54283 1 2 1 1 1 2
54291.0
5430S.NO. Questions Choices Answers
5431429 Where in an HTML document is the correct place to refer to an external style sheet?
54321.
5433In the section
54342.
5435In the section
54363.
5437At the end of the document
54384.
5439At the top of the document
5440head
5441430 Which of the following is included in the head section of HTML
54421.
5443title,body,form and script
54442.
5445title,meta tag,script and CSS
54463.
5447title , meta tag,css and form
54484.
5449title, body,script and CSS
54502.0
5451431 Which of these is Server side technology?
54521.
5453CGI
54542.
5455HTML
54563.
5457JavaScript
54584.
5459CSS
54603.0
5461432 Which of the following in HTML is used to left align the content inside a table cell?
54621.
5463<td raligh = "left" >
54642.
5465<tdleft>
54663.
5467<td leftalign>
54684.
5469<td align = "left">
54704.0
5471433 Which one of the following statements is NOT correct about HTTP cookies?
54721.
5473A cookie is a piece of code that has the potential to compromise the
5474security of an internet user
54752.
5476A cookie gains entry to the user's work area through an HTTP header
54773.
5478A cookie has an expiry date and time
54794.
5480Cookies can be used to track the browsing pattern of a user at a particular
5481site
54821.0
5483434
5484Consider the following program:
5485int f(int *p, int n)
5486{i
5487f (n <= 1) return 0;
5488else return max ( f (p+1, n-1),p[0]-p[1]);
5489}i
5490nt main()
5491{i
5492nt a[] = {3,5,2,6,4};
5493printf("%d", f(a,5));
5494}
5495The value printed by this program is
54961.
54971
54982.
54992
55003.
55013
55024.
55034
55043.0
5505S.NO. Questions Choices Answers
5506435 Which of these methods has no restrictions on content size when a form is submitted.
55071.
5508GET
55092.
5510HEAD
55113.
5512POST
55134.
5514PUT
55153.0
5516436
5517______________datastructure used in pushdown automata.
55181.
5519Stack
55202.
5521array
55223.
5523queue
55244.
5525linked list
55261.0
5527437
5528Consider the following:
5529temp=root->left;
5530while(temp->right!=NULL)
5531temp=temp->right;
5532return temp;
5533The above code snippet for a BST with the address of the root node in pointer ‘root’ returns
55341.Inorder successor of the root 2.
5535Maximum element in the right subtree of root
55363.
5537Minimum element in the right subtree of root
55384.
5539Inorder predecessor of the root
55404.0
5541438 _____ is used to define a special CSS style for a group of HTML elements
55421.
5543Class attribute
55442.
5545name attribute
55463.
5547group attribute
55484.
5549id attribute
55501.0
5551439 The _______ attribute defines the action to be performed when the form is submitted
55521.
5553method attribute
55542.
5555action attribute
55563.
5557onSubmit attribute
55584.
5559onClick attribute
55602.0
5561440
5562Consider a schedule S1 given below;
5563R1(A); W1(A); R2(B); R2(A); R1(B); W2(A+B); W1(B); where R1 and W1 are
5564read and write operations of transaction T1 and R2 and W2 are read and
5565write operations of transaction T2.
5566Which of the following is correct regarding schedule S1?
55671.
5568S1 is a serializable schedule
55692.
5570A deadlock will occur if 2PL is used
55713.
5572S1 is a conflict serializable schedule
55734.
5574S1 is a view serializable schedule
55754.0
5576S.NO. Questions Choices Answers
5577441
5578Boolean algebra is also called
55791.
5580switching algebra
55812.
5582arithmetic algebra
55833.
5584linear algebra
55854.
5586algebra
55871.0
5588442 Software prototyping helps to
55891.
5590generate code
55912.
5592provide thorough testing
55933.
5594explore possible software solutions
55954.
5596collect initial software requirements
55972.0
5598443 Activities such as documentation and software configuration management are what
5599kind of process activities?
56001.
5601Primary
56022.
5603Validation
56043.
5605Design
56064.
5607supporting
56084.0
5609444 In incremental delivery the ________ services are typically delivered first
56101.
5611quickest to complete
56122.
5613highest-priority
56143.
5615cheapest
56164.
5617most fun to code
56182.0
5619445 In incremental development system structure tends to ______ as many new
5620increments are added.
56211.
5622degrade
56232.
5624improve
56253.
5626develop its own AI
56274.
5628shrink
56291.0
5630S.NO. Questions Choices Answers
5631446 Software specifications are intended to communicate the system needs
5632__________________
56331.
5634of the developers to the clients
56352.
5636to marketing
56373.
5638of the clients to the developers
56394.
5640to the general public
56413.0
5642447
5643This software process model takes the fundamental activities of specification,
5644development, validation, and evolution and represents them as separate process
5645phases such as requirements specification, software design, implementation,
5646testing, and so on
56471.
5648Incremental development
56492.
5650The waterfall model
56513.
5652Reuse-oriented software engineering
56534.
5654Boehm's spiral model
56552.0
5656448 What is a software process model?
56571.
5658A simplified representation of a software process
56592.
5660A presentation put together in Powerpoint
56613.
5662A work flow model of the software’s components
56634.
5664A prototype of the final software product
56651.0
5666449 What is a type of software design that designs system data structures to be used
5667in a database?
56681.
5669architectural design
56702.
5671interface Design
56723.
5673component Design
56744.
5675Database design
56764.0
5677450
5678What is based on the idea of developing an initial implementation, exposing this
5679to user comment and evolving it through several versions until an adequate system
5680has been developed?
56811.
5682The Waterfall Method
56832.
5684Incremental Development
56853.
5686Reuse-oriented Software Engineering
56874.
5688Implementation And Unit Testing
56892.0
5690451 What is NOT part of the design process
56911.
5692Architectural design
56932.
5694Database design
56953.
5696Component design
56974.
5698Validation testing
56994.0
5700S.NO. Questions Choices Answers
5701452 Which is not part of the waterfall method?
57021.
5703Requirements Definition
57042.
5705System and Software Design
57063.
5707Implementation and Unit Testing
57084.
5709System Validation
57104.0
5711453 Which statement best describes a benefit of Incremental development over the
5712waterfall model
57131.
5714It is possible to gather more of the requirements up front
57152.
5716Time to market is faster because there is less overhead
57173.
5718It is easier to get customer feedback on the development
5719work that’s been done
57204.
5721It is easier to reuse existing components.
57223.0
5723454 ___________ adds to the costs of Software Development because it usually means that work that
5724has been completed has to be redone
57251.
5726Picture quality
57272.
5728Production
57293.
5730Software speed
57314.
5732Change
57334.0
5734455
5735Given the following structure template, choose the correct syntax for accessing the 5th subject marks of the 3rd student:
5736struct stud
5737{
5738int marks[6];
5739char sname[20];
5740char rno[10];
5741}s[10];
57421.
5743stud[2].marks[4]
57442.
5745stud[4].marks[2]
57463.
5747s[2].marks[4]
57484.
5749s[4].marks[2]
57503.0
5751456 By default, any real number in C is treated as ____
57521.
5753a float
57542.
5755a double
57563.
5757a long double
57584.
5759depends on the memory model
57601.0
5761457 ____________ is the 1st step in the testing process
57621.
5763Analyze results
57642.
5765Plan test
57663.
5767Release product
57684.
5769Conduct tests
57702.0
5771S.NO. Questions Choices Answers
5772458
5773A set of documents in which a given document can contain text, graphics video and
5774audio clips as well as embedded references to other documents world wide web
5775pages are called as
5776---------------
57771.
5778Hypermedia message
57792.
5780Hypertext document
57813.
5782Hypermedia Documents
57834.
5784Path rectangular grid of Pixels
57853.0
5786459 A software requirements specification (SRS) document should avoid discussing
5787which one of the following?
57881.
5789User interface issues
57902.
5791Non-functional requirements
57923.
5793Design specification
57944.Interfaces with third party softwareKey
57951.0
5796460
5797Consider a B+ tree in which the search Answer is 12 bytes long, block size is 1024
5798bytes,record pointer is 10 bytes long and block pointer is 8 bytes long. The
5799maximum number of keys that can be accommodated in each non-leaf node of the
5800tree is ____
58011.
580240
58032.
580450
58053.
580660
58074.
580870
58092.0
5810461 Extreme Programming process model includes framework activities such as
58111.
5812analysis, design,coding,testing
58132.
5814planning,analysis,design,coding
58153.
5816planning,analysis,coding,testing
58174.
5818planning, design, coding, testing
58194.0
5820462 For automatic objects, constructors and destructors are called each time the objects
5821___
58221.
5823enter and leave scope
58242.
5825inherit parent class
58263.
5827are constructed
58284.
5829are destroyed
58301.0
5831463 Important capability needed for an agile software developer is
58321.
5833Trust
58342.
5835Competence
58363.
5837Decision-making
58384.
5839HardworkKey
58403.0
5841S.NO. Questions Choices Answers
5842464 In which phase is Agile Modeling(AM) carried out
58431.
5844Analysis
58452.
5846Coding
58473.
5848Planning
58494.
5850TestingKey
58513.0
5852465 Mnemonic codes and variable names are used in
58531.
5854Machine language
58552.
5856Assembly language
58573.
5858high level language
58594.
5860Used nowhere
58612.0
5862466 Waterfall model of software development is also termed as
58631.
5864The linear sequential model
58652.
5866Fountain model
58673.
5868Spiral model
58694.
5870Concurrent development model
58711.0
5872467 Which of the following is not a Life-critical System?
58731.
5874Fire Dispatch Systems
58752.
5876Nuclear Reactors
58773.
5878Power Utilities
58794.
5880Inventory Management
58814.0
5882468 Which of the following statement is correct about destructors?
58831.
5884A destructor has void return type.
58852.
5886A destructor has integer return type.
58873.
5888A destructor has no return type.
58894.
5890A destructors return type is always same as that of main()
58913.0
5892469
5893#include <iostream.h>
5894using namespace std;
5895int main()
5896{i
5897nt x=20;
5898if(!(!x)&&x)
5899cout< else
5900{
5901x=10;
5902cout< return 0;
5903}
5904}
59051.
590620
59072.
590810
59093.
59101
59114.
59120
59131.0
5914S.NO. Questions Choices Answers
5915470
5916Find the output of the following program?
5917#include <iostream.h>
5918using namespace std;
5919typedef int * IntPtr;
5920int main()
5921{I
5922ntPtr A, B, C;
5923int D,E;
5924A = new int(3);
5925B = new int(6);
5926C = new int(9);
5927D = 10;
5928E = 20;
5929*A = *B;
5930B = &E;
5931D = (*B)++;
5932*C= (*A)++ * (*B)--;
5933E= *C++ - *B--;
5934cout<<*A<<*B<<*C< return 0;
5935}
59361.
593762010206
59382.
593972010107
59403.
594171020106
59424.
594310720107
59442.0
5945471 If a , b , c, are three nodes connected in sequence in a singly linked list, find the valid statement
5946that may help to change this list to a circular linked list?
59471.
5948a->next=c
59492.
5950b->next=c
59513.
5952a->next=c
59534.
5954c->next=b
59554.0
5956472 Round Robin scheduling is the strategy of temporarily suspending a running process
59571.
5958After the CPU time slice expires
59592.
5960to allow starving processes to run
59613.
5962when it requests IO
59634.
5964when OS wait
59651.0
5966473 With a single resource, deadlock occurs ___________
59671.
5968if there are more than two processes competing for that resource
59692.
5970if there are only two process completing for that resource
59713.
5972if there is a single process competing for that resource
59734.
5974it never occur in this case
59751.0
5976474 ______ OS pays more attention on the meeting of the time limits.
59771.
5978Distributed
59792.
5980Network
59813.
5982Real time
59834.
5984Desktop
59853.0
5986S.NO. Questions Choices Answers
5987475
5988Consider a software program that is artificially seeded with 100 faults. While testing this program,
5989159 faults are detected, out of which 75 faults are from those artificially seeded faults. Assuming
5990that both are and seeded faults are of same nature and have same distribution, the estimated
5991number of undetected real fault is
59921.
5993121
59942.
5995175
59963.
5997432
59984.
5999428
60004.0
6001476
6002Given the code
6003String s1 = ? VIT? ;
6004String s2 = ? VIT ? ;
6005String s3 = new String ( s1);
6006Which of the following would equate to true?
60071.
6008s1 == s2
60092.
6010s1 = s2
60113.
6012s3 == s1
60134.
6014s3=s1
601513.0
6016477 Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?
60171.
60180
60192.
60203
60213.
60224
60234.
60245
60252.0
6026478 The following HTML ________ element contains meta data which is not displayed inside the
6027document
60281.
6029<form>
60302.
6031<title>
60323.
6033<table>
60344.
6035<frame>
60362.0
6037479 To link your Web page to a style sheet, you must use the _____ tag
60381.
6039<STYLESHEET>
60402.
6041<STYLE>
60423.
6043<link>
60444.
6045<web>
60463.0
6047480 Which of these will create a shuffled list?
60481.
6049<ol>
60502.
6051<ul>
60523.
6053<dl>
60544.
6055Nested list
60561.0
6057S.NO. Questions Choices Answers
6058481 Which one of the following is a cryptographic protocol used to secure HTTP connection?
60591.
6060Stream Control Transmission Protocol (SCTP).
60612.
6062Transport Layer Security (TSL).
60633.
6064Explicit Congestion Notification (ECN).
60654.
6066Resource Reservation Protocol.
60672.0
6068482 Which of the following is example of in-place algorithm?
60691.
6070Bubble Sort
60712.
6072Merge Sort
60733.
6074Insertion Sort
60754.
60763.0
6077483 Which of these is asymptotically bigger?
60781.
607979n2+43n
60802.
608165n3+34n
60823.
60836*2n
60844.
60855*2n
60862.0
6087484 ___ bit in ICW1 indicates whether the 8259A is cascade mode or not 1.LTIM=0 2.LTIM=1 3.SNGL=1 4.SNGL=0 4.0
6088485
6089____ messages are typically used for diagnostic or control purposes or generated in response to
6090errors in IP operations. 1.ICMP 2.TCP 3.UDP 4.IP 1.0
6091486 _____ gives the number of bits that can be transmitted over a network in a fixed time period. 1.Latency 2.Jitter 3.Bandwidth 4.Delay 3.0
6092487 ______ cryptography refers to encryption methods in which both the sender and receiver share the
6093same key. 1.Symmetric 2.Asymmetric 3.Ceaser key 4.Asymmetric key 1.0
6094488 ______ is responsible for the final encapsulation of higher-level messages into frames that are sent
6095over the network using the physical layer. 1.Data link layer 2.Network layer 3.Application layer 4.Session layer 1.0
6096489 _______ appends to the address a slash character and the decimal number of leading bits of the
6097routing prefix. 1.CIDR 2.TCP 3.UDP 4.IP 1.0
6098490 _______ is assigned to an organization by a global authority. 1.Subnet ID 2.Supernet ID 3.Host ID 4.Network ID 4.0
6099491 _______ produces the relation that has attributes of R1 and R2
61001.
6101Cartesian product
61022.
6103Difference
61043.
6105Intersection
61064.
6107Product
61081.0
6109492 _______ should keep track of multiple file downloads requested by a particular FTP application, or
6110multiple telnet connections from a single terminal client, or web page retrievals from a web server. 1.Transport layer 2.Application layer 3.Presentation layer 4.Session layer 1.0
6111493 ________ functions as a request-response protocol in the client-server computing model. 1.HTTP 2.IP 3.TCP 4.UDP 1.0
6112494 ________ is commonly used in wireless LAN.
61131.
6114time division multiplexing
61152.
6116orthogonal frequency division multiplexing
61173.
6118space division multiplexing
61194.
6120long division multiplexing
61212.0
6122S.NO. Questions Choices Answers
6123495 ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
61241.
6125Long term
61262.
6127Short trem
61283.
6129Medium term
61304.
6131None of these
61321.0
6133496 _________ does the job of allocating a process to the processor.
61341.
6135Long term scheduler
61362.
6137Short term scheduler (CPU Scheduler)
61383.
6139Medium term scheduler
61404.
6141Dispatcher
61424.0
6143497 _________ has a dedicated communication path between stations 1.Circuit switching 2.Frame relay 3.Packet switching 4.ATM 1.0
6144498 _________ is a high speed cache used to hold recently referenced page table entries as a part of
6145paged virtual memory
61461.
6147Translation Look-aside buffer
61482.
6149Inverse page table
61503.
6151Segmented page table
61524.
6153Hierarchical page table
61541.0
6155499
6156_________ memory management scheme will produce least fragement
61571.
6158Best Fit
61592.
6160Worst Fit
61613.
6162First Fit
61634.
6164None of these
61651.0
6166500 _________ register keeps tracks of the instructions stored in program stored in memory.
61671.
6168AR (Address Register)
61692.
6170XR (Index Register)
61713.
6172PC (Program Counter)
61734.
6174AC (Accumulator)
61753.0
6176501 _________ states that it is Optimal Replacement algorithm
61771.
6178Replace the page that will not be used for a longest period of time
61792.
6180Replace the page that will not be used for a shortest period of time
61813.
6182Replace the page that will be used for a longest period of time
61834.
6184Replace the page that will be used for a shortest period of time
61851.0
6186502 __________ algorithm is used for the flow control of data between sender and receiver. 1.Dijkstra 2.RIP 3.Leaky bucket 4.Go Back N 4.0
6187S.NO. Questions Choices Answers
6188503 ___________ programs automatically connects to web sites and download documents and save
6189them to local drive
61901.
6191Web Servers
61922.
6193Web Downloading Utilities
61943.
6195Stay Connected
61964.
6197Offline Browsers
61982.0
6199504 ___________ signal prevent the microprocessor from reading the same data more than one 1.pipelining 2.handshaking 3.controlling 4.signaling 2.0
6200505 ____________ function in PHP returns a list of response headers sent (or ready to send) 1.header() 2.headers_list() 3.header_sent() 4.header_send() 2.0
6201506
6202______________ is an initial version of a software system that is used to demonstrate concepts, try
6203out design options, and find out more about the problem and its possible solutions.
62041.
6205Prototype
62062.
6207Architectural Design
62083.
6209Subsystem
62104.
6211Module
62121.0
6213507 ________________ is a basic unit of CPU utilization
62141.
6215Process
62162.
6217Thread
62183.
6219Process Control Block
62204.
6221Program Counter
62222.0
6223508 ______________is a logical unit of access to a DBMS
62241.Transaction
62252.Optimization
62263.Schema
62274.Data
62281.0
6229509
6230A graphical HTML browser resident at a network client machine Q accesses a static HTML
6231webpage from a HTTP server S. The static HTML page has exactly one static embedded image
6232which is also at S. Assuming no caching, which one of the following is correct about the HTML
6233webpage loading (including the embedded image)?
62341.
6235Q needs to send at least 2 HTTP requests to S, each necessarily in a
6236separate TCP connection to server S
62372.
6238Q needs to send at least 2 HTTP requests to S, but a single TCP
6239connection to server S is sufficient
62403.
6241A single HTTP request from Q to S is sufficient, and a single TCP
6242connection between Q and S is necessary for this
62434.
6244A single HTTP request from Q to S is sufficient, and this is possible
6245without any TCP connection between Q and S
62462.0
6247510 A 20-bit address bus can locate ________.
62481.
62491,048,576 locations
62502.
62512,097,152 locations
62523.
62534,194,304 locations
62544.
62558,388,608 locations
62561.0
6257511 A 32-bit address bus allows access to a memory of capacity 1.1 GB 2.16 MB 3.64 MB 4.4 GB 4.0
6258S.NO. Questions Choices Answers
6259512 A B-tree of order m has maximum of _____________ children
62601.
6261m
62622.
6263m + 1
62643.
6265m - 1
62664.
6267m/2
62681.0
6269513 A binary code that progresses such that only one bit changes between two successive codes is: 1.Gray code 2.excess-3 code 3.8421 code 4.nine's-complement code 1.0
6270514
6271A certain 5-bit self-complementary code is used to represent the 10 decimal digits 0 through 9.
6272Given that (246) in decimal is represented as 00010 00100 00110 in this code, what is the
6273representation for (375)?
62741.00110 00100 00010 2.00011 00111 00101 3.11001 11101 11011
62754.11101 11011 11001 4.0
6276515
6277A client process P needs to make a TCP connection to a server process S. Consider the following
6278situation: the server process S executes a socket(), a bind() and a listen() system call in that order,
6279following which it is preempted. Subsequently, the client process P executes a socket() system call
6280followed by connect() system call to connect to the server process S. The server process has not
6281executed any accept() system call. Which one of the following events could take place?
62821.
6283connect () system call returns successfully
62842.
6285connect () system call blocks
62863.
6287connect () system call returns an error
62884.
6289connect () system call results in a core dump
62903.0
6291516 A COCOMO model is
62921.
6293Common Cost Estimation Model.
62942.
6295Constructive Cost Estimation Model.
62963.
6297Complete Cost Estimation Model.
62984.
6299Comprehensive Cost Estimation Model.
63002.0
6301517 A collection of unused memory reserved for dynamic allocation is called 1.Heap 2.Static 3.array 4.stack dynamic 1.0
6302518 A comparison between ring and Johnson counters indicates that:
63031.A ring counter has fewer flip-flops but requires more decoding
6304circuitry 2.A ring counter has an inverted feedback path 3.A Johnson
6305counter has more flip-flops but less decoding circuitry 4.A Johnson
6306counter has an inverted feedback path
63074.0
6308519
6309A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a
6310rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the maximum duration for
6311which the computer can transmit at the full 10Mbps?
63121.
63131.6 seconds
63142.
63152 seconds
63163.
63175 seconds
63184.
63198 seconds
63202.0
6321520 A data structure where elements can be added or removed at either end but not in the middle 1.linked lists 2.Stacks 3.Queues 4.Deque 4.0
6322521 A fault simulation testing technique is
63231.
6324Mutation testing
63252.
6326Stress testing
63273.
6328Black box testing
63294.
6330White box testing
63311.0
6332522 A grammar that produces more than one parse tree for some sentence is called 1.Ambiguous 2.Irregular 3.Regular 4.Unambiguous 1.0
6333S.NO. Questions Choices Answers
6334523 A group of bits that tell the computer to perform a specific operation is known as____.
63351.
6336Instruction code
63372.
6338Micro-operation
63393.
6340Accumulator
63414.
6342Register
63431.0
6344524 A J-K flip-flop is in a "no change" condition when ________. 1.J = 1, K = 1 2.J = 1, K = 0 3.J = 0, K = 1 4.J = 0, K = 0 4.0
6345525 A language is represented by a regular expression (a)*(a+ba). Which of the following string does
6346not belong to the regular set represented by the above expression.
63471.
6348aaa
63492.
6350aba
63513.
6352ababa
63534.
6354aa
63553.0
6356526 A layer-4 firewall cannot
63571.
6358block HTTP traffic during 9:00PM and 5:00AM
63592.
6360block all ICMP traffic
63613.
6362stop incoming traffic from a specific IP address but allow outgoing
6363traffic to same IP
63644.
6365block TCP traffic from a specific user on a specific IP address on multiuser
6366system during 9:00PM and 5:00AM
63671.0
6368527 A linear collection of data elements where the linear node is given by means of pointer is called 1.primitive list 2.node list 3.linked list 4.array 3.0
6369528 A major problem with priority scheduling is _________.
63701.
6371Definite blocking
63722.
6373Starvation
63743.
6375Low priority
63764.
6377None of these
63782.0
6379529 A minimum state DFA accepting the language L={w/w belongs {0,1}*} number of 0s and 1s in w
6380are divisible by 3 and 5, respectively} has
63811.
638215 states
63832.
63847 states
63853.
63869 states
63874.
63888 states
63891.0
6390530 A network that contains multiple hubs is most likely configured in which topology? 1.Mesh 2.Tree 3.Bus 4.Star 2.0
6391S.NO. Questions Choices Answers
6392531 A NFA converted to DFA has more than one final state.
63931.
6394True
63952.
6396False
63973.
6398may be true
63994.
6400always true
64011.0
6402532 A one to many relationship (of table A to Table B) is
64031.Where each record in table A can have one or more matching records
6404in table B
64052.Where each record in table B can have one or more matching records
6406in table A
64073.Where each record in Table B is required to have a match in table A
64084.Where each record in table A is required to have a match in table B
64091.0
6410533 A packet switching network
64111.can reduce the cost of using an information utility 2.allows
6412communications channel to be shared among more than one user 3.can
6413reduce the cost of using an information utility and allows
6414communications channel to be shared among more than one user 4.is
6415free
64163.0
6417534 A page fault occurs
64181.
6419when the page is not in the main memory
64202.
6421when the page is in the cache memory
64223.
6423when the process enters the blocked state
64244.
6425when the process is in the ready state
64261.0
6427535 A parameterized constructor with all arguments initialized is same as 1.default constructor 2.parameterized constructor 3.overriding
64284.overloading 1.0
6429536 A point-to-point protocol over ethernet is a network protocol for
64301.
6431encapsulating PPP frames inside ethernet frames
64322.
6433encapsulating ethernet frames inside PPP frames
64343.
6435for security of ethernet frames
64364.
6437for security of PPP frames
64381.0
6439537 A primary key, if combined with a foreign key creates
64401.Many to many relationships between the tables that connect them
64412.Network model between the tables connect them 3.one to many
6442relationship between the tables that connect them 4.Parent child
6443relationship between the tables that connect them
64444.0
6445538 A professional software engineer must:
64461.
6447be loyal to the organization
64482.
6449build trust from customers
64503.
6451socialize with customers
64524.
6453be loyal to the organization and build trust from customers
64544.0
6455S.NO. Questions Choices Answers
6456539 A relation R is said to be in 2NF when it does not have
64571.
6458Partial Dependencies
64592.
6460Transitive Dependencies
64613.
6462Multivalued Attributes
64634.
6464Both Partial dependencies and Multivalued Dependencies
64651.0
6466540 A relational database is
64671.the same as a flat file database
64682.one that consists of two or more tables that are joined in some way
64693.one that consists of two or more tables
64704.a database that is able to process tables, queries, forms, reports and
6471macros
64724.0
6473541 A ring counter is same as. 1.up-down counter 2.parallel adder 3.shift register 4.ALU 3.0
6474542 A set of possible data values is called
64751.
6476attribute
64772.
6478degree
64793.
6480domain
64814.
6482tuple
64834.0
6484543 A shift register can be used for. 1.Digital delay line 2.Serial to parallel conversion 3.All of these
64854.Parallel to serial conversion 4.0
6486544 A single channel is shared by multiple signals by
64871.
6488analog modulation
64892.
6490digital modulation
64913.
6492multiplexing
64934.
6494none of the mentioned
64953.0
6496545 A software package designed to store and manage databases
64971.Database
64982.DBMS
64993.Data Model
65004.Data
65012.0
6502546 A stack organized computer has
65031.Three-address Instruction
65042. Two-address Instruction
65053.One-address Instruction
65064. Zero-address Instruction
65074.0
6508547 2.0
65091.
6510TRUE
65112.
6512False
65133. 4.
65142.0
6515548 A static data member is given a value 1.Within the class definition 2.Outside the class definition 3.When the
6516program is exeuted 4.Never 2.0
6517549 A synchronous sequential circuit is made up of. 1.combinational gates 2.flip-flops 3.both flip-flops and latches 4.both
6518combinational gates and flip-flops 4.0
6519S.NO. Questions Choices Answers
6520550
6521A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to
6522begin with. The system first accesses 100 distinct pages in some order and accesses the same 100
6523pages but now in the reverse order how many page faults will occur?
65241.
6525196
65262.
6527192
65283.
6529197
65304.
6531195
65321.0
6533551 A table can have only one
65341.
6535Secondary key
65362.
6537Alternate key
65383.
6539Unique key
65404.
6541Primary key
65424.0
6543552 A tree sturctured file directory system
65441.
6545allows easy storage and retrieval of file names
65462.
6547is not essential when we have millions of files
65483.
6549is a much debated unnecessary feature
65504.
6551none of these
65521.0
6553553 A value that has no defined value is expressed in PHP with the following keyword: 1.undef 2.null 3.Cant Define 4.There is no such concept in PHP 2.0
6554554 A variable P is called pointer if
65551.P contains the address of an element in DATA 2.P contain the DATA
6556and the address of DATA 3.P can store only memory addresses 4.P
6557points to the address of first element in DATA
65581.0
6559555 A variable P is called pointer if
65601.P contains the address of an element in DATA 2.P contain the DATA
6561and the address of DATA 3.P can store only memory addresses 4.P
6562points to the address of first element in DATA
65631.0
6564556 A view is a
65651.
6566virtual table
65672.
6568subset of the table
65693.
6570base table
65714.
6572super table
65731.0
6574557 A Winchester disk is a
65751.
6576Disk stack
65772.
6578Removable disk
65793.
6580Flexible disk
65814.
6582None of these
65831.0
6584S.NO. Questions Choices Answers
6585558
6586A complete binary min-heap is made by including each integer in [1;1023] exactly once. The
6587depth of a node in the heap is the length of the path from the root of the heap to that node. Thus,
6588the root is at depth 0. The maximum depth at which integer 9 can appear is
65891.
65907
65912.
65928
65933.
65949
65954.
659610
65972.0
6598559 Abstraction is 1.Having public members 2.having private member and public function
65993.friend function 4.friend classes 2.0
6600560 2.0
66011.
6602developer
66032.
6604end users
66053.
6606test team
66074.
6608systems engineers
66092.0
6610561 Access time is faster for _________.
66111.
6612ROM
66132.
6614SRAM
66153.
6616DRAM
66174.
6618ERAM
66192.0
6620562 Additive rule 1.cyan+ magenta+ Yellow= white 2.Red + Green + Blue = white
66213.cyan+ Green+ Yellow= white 4.cyan+ magenta+ Yellow= Black 2.0
6622563 Address line for TRAP is?
66231.
66240023H
66252.
66260024H
66273.
66280033H
66294.
66300099H
66312.0
6632564 ALE stands for ___________
66331.
6634address latch enable
66352.
6636address level enable
66373.
6638address leak enable
66394.
6640address leak extension
66411.0
6642565 ALGORITHM HAS THE ________________ TO THE PROBLEM IN _______________
6643NUMBER OF STEPS
66441.SOLUTION & FINITE 2.PROBLEM & INFINITE 3.SOLUTION &
6645INFINITE 4.PROBLEM & FINITE 1.0
6646566 All devices/host connect to a central switch in _____ topology. 1.Star 2.Ring 3.Bus 4.Tree 1.0
6647567 All the modules of the system are integrated and tested as complete system in the case of
66481.
6649Bottom up testing
66502.
6651Top-down testing
66523.
6653Sandwich testing
66544.
6655Big-Bang testing
66564.0
6657S.NO. Questions Choices Answers
6658568 Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the
6659method that is very easy to implement and the method that is the most powerful, in that order?
66601.
6661SLR , LALR
66622.
6663CLR , LALR
66643.
6665SLR , CLR
66664.
6667SLR
66683.0
6669569 An activity is said to be critical if slack time is equal to
66701.
66710
66722.
66731
66743.
66752
66764.
66773
66781.0
6679570 An advantage of the database approach is 1.Elimination of the data redundancy 2.Ability to associate related data
66803.Increase security 4.All of the options 4.0
6681571 An Entity from an ER diagram can be represented in the relational model by a
66821.relation
66832.domain
66843.functional dependency
66854.single attribute
66861.0
6687572 An ethernet frame that is less than the IEEE 802.3 minimum length of 64 octets is called
66881.short frame
66892.runt frame
66903.mini frame
66914.man frame
66922.0
6693573 An intermediate code form is 1.Postfix notation 2.Syntax trees 3.Three address code 4.Postfix notation,
6694Syntax trees and Three address code 4.0
6695574 An organization has a class B network and wishes to form subnets for 64 departments. The subnet
6696mask would be:
66971.
6698255.255.0.0
66992.
6700255.255.64.0
67013.
6702255.255.128.0
67034.
6704255.255.252.0
67054.0
6706575 Any code inside a loop that always computes the same value can be moved before the loop. This is
6707called
67081.Loop invariant computation 2.Interchange of statements 3.inducation
6709variable 4.Algebraic Transformation 1.0
6710576 Application layer protocol defines
67111.
6712types of messages exchanged
67132.
6714message format, syntax and semantics
67153.
6716rules for when and how processes send and respond to messages
67174.
6718all of the mentioned
67194.0
6720S.NO. Questions Choices Answers
6721577 Architecture of the database can be viewed as
67221.
6723two levels
67242.
6725four levels
67263.
6727three levels
67284.
6729one level
67303.0
6731578 Arrange the operators according to their precedence: +, %, ->, =
67321.
6733->, %, +, =
67342.
6735=, +, %, ->
67363.
6737%, +, =, ->
67384.
6739%, ->, =, +
67401.0
6741579
6742Assume that a table R with 1000 records is to be joined with another table S with 10000 records.
6743What is the maximum number of records that would result in if we join R with S and the equi-join
6744attribute of S is the primary key?
67451.
67461000
67472.
674810000
67493.
67501,00,00,000
67514.
675211000
67531.0
6754580 Assume that we have constructor functions for both base class and derived class. Now consider the
6755declaration in main( ). Base * P = New Derived; in what sequence will the constructor be called ?
67561.Derived class constructor followed by Base class constructor. 2.Base
6757class constructor followed by derived class constructor. 3.Base class
6758constructor will not be called. 4.Derived class constructor will not be
6759called.
67602.0
6761581 Assume the base address of CS is 3000H and IP is 2000H. Calculate the memory address. 1.32000H 2.3000H 3.30000H 4.2000H 1.0
6762582 Assume you would like to sort an array in ascending order by value while preserving key
6763associations. Which of the following PHP sorting functions would you use?
67641.
6765ksort( )
67662.
6767asort( )
67683.
6769krsort( )
67704.
6771sort( )
67722.0
6773583 Assuming today is , 10 July 2000, what is returned by this statement: SELECT
6774to_char(Last_DAY(sysdate), 'DD-MON-RR') FROM dual;
67751.
677617-JUL-00
67772.
677810-JUL-00
67793.
678031-DEC-00
67814.
678231-JUL-00
67834.0
6784584 Binary search algorithm can not be applied to 1.sorted linked list 2.sorted binary trees 3.sorted linear array 4.pointer
6785array 4.0
6786585 Bit stuffing refers to
67871.inserting a '0' in user data stream to differentiate it with a flag
67882.inserting a '0' in flag data stream to avoid ambiguity 3.appending a
6789nibble to the flag sequence 4.appending a nibble to the user data stream
67901.0
6791S.NO. Questions Choices Answers
6792586 Bits can be send over guided and unguided media as analog signal using .........................
67931.
6794digital modulation
67952.
6796amplitude modulation
67973.
6798frequency modulation
67994.
6800phase modulation
68011.0
6802587 2.0
68031.
6804true
68052.
6806false
68073. 4.
68082.0
6809588 By following modern system engineering practices simulation of reactive systems is no longer
6810necessary.
68111.
68122.0True
68132.
6814FALSE
68153. 4.
68162.0
6817589 Cache memory acts between_______.
68181.
6819CPU and RAM
68202.
6821RAM and ROM
68223.
6823CPU and Hard Disk
68244.
6825None of these
68261.0
6827590
6828Calculate the block number in free storage management of files system with number of bits per
6829word is 8, the bit vector is
68300001101010101, offset of first 1 bit is 3
68311.
683259
68332.
683451
68353.
683645
68374.
683853
68391.0
6840591 Calculate the EAT(Effective access time) if 5 micro second is associative look-up time and 0.80 is
6841the hit-ratio in paging hardware with TLB
68421.
68436.2 micro second
68442.
68457.8 micro second
68463.
68472.2 micro second
68484.
68493.2 micro second
68503.0
6851592 Cartesian product in relational algebra is
68521.
6853a Unary operator
68542.
6855a Binary operator
68563.
6857a Ternary operator
68584.
6859not defined
68602.0
6861S.NO. Questions Choices Answers
6862593 Change cannot be easily accommodated in most software systems, unless the system was designed
6863with change in mind.
68641.
6865True
68662.
6867False
68683. 4.
68691.0
6870594
6871Changes made to an information system to add the desired but not necessarily the
6872required features is called
68731.
6874Preventative maintenance.
68752.
6876Adaptive maintenance.
68773.
6878Corrective maintenance.
68794.
6880Perfective maintenance.
68814.0
6882595 Class ____ IP addresses are used for large organizations 1.A 2.B 3.D 4.C 1.0
6883596 class n{ int a;}; how much memory the compiler allocates for this class 1.0 2.2 3.depends on compiler 4.4 4.0
6884597 1.0
68851.
6886true
68872.
6888false
68893. 4.
68901.0
6891598 Classes and components that exhibit functional, layer, or communicational cohesion are relatively
6892easy to implement, test, and maintain.
68931.
6894true
68952.
6896false
68973. 4.
68981.0
6899599 Compile time polymorphism is 1.function overloading 2.template 3.function overriding 4.abstraction 1.0
6900600 Computers use addressing mode techniques for _____________________.
69011.
6902giving programming versatility to the user by providing facilities as
6903pointers to memory counters for loop control
69042.
6905to reduce no. of bits in the field of instruction
69063.
6907specifying rules for modifying or interpreting address field of the
6908instruction
69094.
6910All of these
69114.0
6912601 Condition testing is a control structure testing technique where the criteria used to design test cases
6913is that they
69141.
69151.0rely on basis path testing
69162.
6917exercise the logical conditions in a program module
69183.
6919select test paths based on the locations and uses of variables
69204.
6921focus on testing the validity of loop constructs
69221.0
6923602
6924Consider 2 scenarios:
6925C1: For DFA (ϕ, Ʃ, δ, qo, F),
6926if F = Ï•, then L = Æ©*
6927C2: For NFA (ϕ, Ʃ, δ, qo, F),
6928if F = Ï•, then L = Æ©*
6929Where F = Final states set
6930Ï• = Total states set
6931Choose the correct option ?
69321.
6933Both are true
69342.
6935Both are False
69363.
6937C1 is true, C2 is false
69384.
6939C1 is false, C2 is true
69403.0
6941603 Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly
6942two children are _________.
69431.199 2.200 3.Any number between 0 and 199 4.Any number between
6944100 and 200 1.0
6945S.NO. Questions Choices Answers
6946604 Consider a DFA over Σ = {a, b} accepting all strings which have number of a’s divisible by 6 and number of b’s
6947divisible by 8. What is the minimum number of states that the DFA will have?
69481.
69498
69502.
695114
69523.
695315
69544.
695548
69564.0
6957605
6958Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved
6959by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The
6960maximum, minimum, and average chain lengths in the hash table, respectively, are
69611.3, 3, and 3 2.3, 0, and 1 3.4, 0, and 1 4.3, 0, and 2 2.0
6962606
6963Consider an instance of TCP’s Additive Increase Multiplicative Decrease(AIMD) algorithm where
6964the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the
6965first transmission is 8 MSS. Assume that a time out occurs during the fifth transmission. Find the
6966congestion window size at the end of the tenth transmission.
69671.
69688 MSS
69692.
697014 MSS
69713.
69727 MSS
69734.
697412 MSS
69753.0
6976607 Consider an undirected graph G with 100 nodes. The maximum number of edges to be included is 1.2451 2.4950 3.9900 4.4851 4.0
6977608 Consider S->SS|a what is the number of different derivation trees for aaaaa
69781.
69795
69802.
69813
69823.
698314
69844.
69857
69863.0
6987609
6988Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start
6989symbol and the following set of production rules
6990S --> aB S --> bA
6991B --> b A --> a
6992B --> bS A --> aS
6993B --> aBB A --> bAA
6994Which of the following strings is generated by the grammar?
69951.
6996aaaabb
69972.
6998aabbbb
69993.
7000aabbab
70014.
7002abbbba
70033.0
7004610
7005Consider the data of previous question. Suppose that the sliding window protocol is used with the
7006sender window size of 2^i where is the number of bits identified in the previous question and
7007acknowledgments are always piggybacked. After sending 2^i frames, what is the minimum time
7008the sender will have to wait before starting transmission of the next frame? (Identify the closest
7009choice ignoring the frame processing time).
70101.
701116ms
70122.
701318ms
70143.
701520ms
70164.
701722ms
70183.0
7019S.NO. Questions Choices Answers
7020611 Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the
7021language L(M) ∩ L(N) is __________.
70221.
70230
70242.
70251
70263.
70272
70284.
70293
70301.0
7031612 Consider the following array of elements. {89,19,50,17,12,15,2,5,7,11,6,9,100}.The minimum
7032number of interchanges needed to convert it into a max-heap is 1.4 2.2 3.5 4.3 4.0
7033613
7034Consider the following C code segment.
70354.0 4.0
7036614
7037Consider the following C declaration
7038struct {
7039short s [5]
7040union {
7041float y;
7042long z;
7043}u;
7044} t;
7045Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes and 8 bytes,
7046respectively. The memory requirement for variable t, ignoring alignment
7047considerations, is
70481.10 bytes 2.18 bytes 3.22 bytes 4.14 bytes 2.0
7049615
7050Consider the following code segment.
7051x = u - t;
7052y = x * v;
7053x = y + w;
7054y = t - z;
7055y = x * y;
7056The minimum number of total variables required to convert the above code segment to static single
7057assignment form is
70581.
70596
70602.
70618
70623.
70639
70644.
706510
70664.0
7067616
7068Consider the following code snippet
7069var a1 = [,,,];
7070var a2 = new Array(3);
70710 in a1
70720 in a2
7073Result of Javascript is:
70741.
7075true false
70762.
7077false true
70783.
7079true true
70804.
7081false true
70821.0
7083617 Consider the following code snippet: var a = [1,2,3,4,5]; a.slice(0,3); What is the possible output
7084for the above code snippet?
70851.Returns [1,2,3] 2.Returns [4,5] 3.Returns [1,2,3,4] 4.Returns
7086[1,2,3,4,5] 1.0
7087618
7088Consider the following code snippet
7089function oddsums(n)
7090{
7091let total = 0, result=[];
7092for(let x = 1; x <= n; x++)
7093{
7094let odd = 2*x-1;
7095total += odd;
7096result.push(total);
7097}
7098return result;
7099}
7100What would be the output if
7101oddsums(5);
71021.
7103Returns [1,4,9,16,25]
71042.
7105Returns [1,2,3,4,5]
71063.
7107Returns [3,6,9,12,15]
71084.
7109Returns [1,3,5,7,9]
71101.0
7111619 Consider the following code: var a = []; a.unshift(1); a.unshift(22); a.shift(); a.unshift(3,[4,5]);
7112a.shift(); a.shift(); a.shift(); The final output for the shift() is 1.1 2.[4,5] 3.[3,4,5] 4.Exception 1.0
7113S.NO. Questions Choices Answers
7114for (i = 0, i<n; i++)
7115{
7116for (j=0; j<n; j++)
7117{
7118if (i%2)
7119{
7120x += (4*j + 5*i);
7121y += (7 + 4*j);
7122}
7123}
7124}
7125Which one of the following is false?
7126620
7127Consider the following function
7128double f(double x)
7129{i
7130f (abs(x*x - 3) < 0.01) return x;
7131else return f(x/2 + 1.5/x);
7132}
7133Give a value q (to 2 decimals) such that f(q) will return q:_____.
71341.1.723 2.1.732 3.0.732 4.1.733 2.0
7135621
7136Consider the following javascript code snippet :
7137var a = [];
7138a.unshift(1);
7139a.unshift(22);
7140a.shift();
7141a.unshift(3,[4,5]);
7142a.shift();
7143a.shift();
7144a.shift();
7145The final output for the shift() is
71461.
71471
71482.
7149[4,5]
71503.
7151[3,4,5]
71524.
7153Exception
71541.0
7155622
7156Consider the following program in C language:
7157#include
7158main()
7159{i
7160nt i;
7161int *pi = &i;
7162scanf(?%d?,pi);
7163printf(?%d\n?, i+5);
7164}
7165Which one of the following statements is TRUE?
71661.
7167Compilation fails.
71682.
7169Execution results in a run-time error.
71703.
7171On execution, the value printed is 5 more than the address of variable i
71724.
7173On execution, the value printed is 5 more than the integer value entered
71744.0
7175623
7176Consider the following statements for priority queue :
7177S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result
7178of its basic operations.
7179S2 : The elements of a priority queue may be complex structures that are ordered on one or several
7180fields.
7181Which of the following is correct?
71821.Both S1 and S2 are incorrect 2.S1 is correct and S2 is incorrect 3.Both
7183S1 and S2 are correct 4.S1 is incorrect and S2 is correct 4.0
7184624
7185Consider the following two sets of LR(1) items of an LR(1) grammar.
7186X -> c.X, c/d
7187X -> .cX, c/d
7188X -> .d, c/d
7189X -> c.X, $
7190X -> .cX, $
7191X -> .d, $
7192Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are
7193FALSE?
71941. Cannot be merged since look aheads are different.
71952. Can be merged but will result in S-R conflict.
71963. Can be merged but will result in R-R conflict.
71974. Cannot be merged since goto on c will lead to two different sets.
71981.
71991 only
72002.
72012 only
72023.
72031 and 4 only
72044.
72051,2,3,4
72064.0
7207625
7208Consider the following two sets of LR(1) items of an LR(1) grammar.
7209X -> c.X, c/d
7210X -> .cX, c/d
7211X -> .d, c/d
7212X -> c.X, $
7213X -> .cX, $
7214X -> .d, $
7215Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are
7216FALSE?
72171. Cannot be merged since look aheads are different.
72182. Can be merged but will result in S-R conflict.
72193. Can be merged but will result in R-R conflict.
72204. Cannot be merged since goto on c will lead to two different sets.
72211.
72221 only
72232.
72242 only
72253.
72263 and 4 only
72274.
72281,2,3,4
72294.0
7230626
7231Consider the grammar shown below.
7232S → C C
7233C → c C | d
7234The grammar is
72351.
7236LL(1)
72372.
7238SLR(1) but not LL(1)
72393.
7240LALR(1) but not SLR(1)
72414.
7242LR(1) but not LALR(1)
72431.0
7244S.NO. Questions Choices Answers
7245627
7246Consider the grammar with the following translation rules and E as the start symbol.
7247E → E1 # T { E.value = E1.value * T.value }
7248| T{ E.value = T.value }
7249T → T1 & F { T.value = T1.value + F.value }
7250| F{ T.value = F.value }
7251F → num { F.value = num.value }
7252Compute E.value for the root of the parse tree for the expression: 2 # 3 & 5 # 6 & 4.
72531.
7254200
72552.
7256180
72573.
7258160
72594.
726040
72613.0
7262628
7263Consider the grammar
7264S → (S) | a
7265Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3
7266respectively. The following relationship holds good
72671.
7268n1<n2<n3
72692.
7270n1=n3<n2
72713.
7272n1=n2=n3
72734.
7274n1>n2>n3
72752.0
7276629
7277Consider the intermediate code given below:
72781. i = 1
72792. j = 1
72803. t1 = 5 * i
72814. t2 = t1 + j
72825. t3 = 4 * t2
72836. t4 = t3
72847. a[t4] = –1
72858. j = j + 1
72869. if j <= 5 goto(3)
728710. i = i + 1
728811. if i < 5 goto(2)
7289The number of nodes and edges in the control-flow-graph constructed for the above code, respectively, are
72901.
72915 and 7
72922.
72936 and 7
72943.
72955 and 2
72964.
72977 and 8
72982.0
7299630 Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the
7300maximum size of join is:
73011.
7302mn
73032.
7304m+n
73053.
7306(m+n)/2
73074.
73082(m+n)
73091.0
7310631 Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the
7311maximum size of join is:
73121.
7313mn
73142.
7315m + n
73163.
7317(m + n) / 2
73184.
73192(m + n)
73201.0
7321632 Consider the regular language L = (111 + 11111)*. The minimum number of states in any DFA accepting this
7322languages is:
73231.
73243
73252.
73265
73273.
73288
73294.
73309
73314.0
7332S.NO. Questions Choices Answers
7333633
7334Consider the relation R1(employee_name, project_name, dependent_name). If {{employee_name
7335-->-> project_name}, {employee_name -->-> dependent_name}}, what is the highest normal form
7336it satisfies?
73371.
73382NF
73392.
73403NF
73413.
7342BCNF
73434.
73444NF
73451.0
7346634
7347Consider the translation scheme shown below
7348S → T R
7349R → + T {print ('+');} R | ε
7350T → num {print (num.val);}
7351Here num is a token that represents an integer and num.val represents the corresponding integer value. For an
7352input string '9 + 5 + 2', this translation scheme will print
73531.
73549 + 5 + 2
73552.
73569 5 + 2 +
73573.
73589 5 2 + +
73594.
7360+ + 9 5 2
73612.0
7362635 Consider two strings A ='qpqrr' and B = 'pqprqrp'. Let x be the length of the LCS between A and B
7363and let y be the number of such longest common subsequences between A and B. Then x + 10y = 1.42 2.34 3.32 4.30 2.0
7364636 Count function in SQL returns the number of
73651.
7366values
73672.
7368distinct values
73693.
7370groups
73714.
7372columns
73731.0
7374637 CPU Scheduling is the basis of _________ operating system
73751.
7376Batch
73772.
7378Real Time
73793.
7380Multi-programming
73814.
7382network
73832.0
7384638 create table student_$( id number(4), namee varchar2(10)); reponse would be
73851.
7386Error
73872.
7388Table created
73893.
7390Table created with error
73914.
7392Table created with data
73932.0
7394639 Creating additional function similar to template function is called 1.implicit specialization 2.explicit specialization 3.abstraction 4.template
7395overriding 4.0
7396640 Cross-compiler is a compiler
73971.which is written in a language that is same as the source language.
73982.that runs on one computer but produces object code for different type
7399of computer. 3.that generates object code for its host machine. 4.which is
7400written in a language that is different from the source language.
74012.0
7402S.NO. Questions Choices Answers
7403641 Cryptanalysis is used
74041.
7405to find some insecurity in a cryptographic scheme
74062.
7407to increase the speed
74083.
7409to encrypt the data
74104.
7411none of the mentioned
74121.0
7413642 Cryptographic hash function takes an arbitrary block of data and returns
74141.
7415fixed size bit string
74162.
7417variable size bit string
74183.
7419both (a) and (b)
74204.
7421None
74221.0
7423643
7424Currently there is no single standard file type that can be used to play audio using the audio
7425element consistently on all browsers. Which is the solution that the audio element provides to
7426resolve this conflict?
74271.Use JavaScript to determine the web browser in use 2.Use Adobe
7428Flash to play the audio 3.Include multiple audio file formats in the src
7429attribute 4.No Solution
7430644 1.0
74311.
7432rely on basis path testing
74332.
7434exercise the logical conditions in a program module
74353.
7436select test paths based on the locations and uses of variables
74374.
7438focus on testing the validity of loop constructs
74391.0
7440645 Data independence means
74411.
7442data is defined separately and not included in programs.
74432.
7444programs are not dependent on the physical attributes of data
74453.
7446programs are not dependent on the logical attributes of data
74474.
7448programs are not dependent on both physical and logical attributes of
7449data
74504.0
7451646 Data Members of the base class that are marked private:
74521.does exist in memory when the object of the derived class is created
74532.exist in memory when the object of the derived class is created
7454the derived class 3.are visible in the derived class 4.are directly
7455accessible in the derived class
74562.0
7457647 Data Members of the base class that are marked private:
74581.does exist in memory when the object of the derived class is created
74592.exist in memory when the object of the derived class is created
7460the derived class 3.are visible in the derived class 4.are directly
7461accessible in the derived class
74622.0
7463648 Data Store Symbol in DFD represents a
74641.
7465Physical file
74662.
7467Data Structure
74683.
7469Logical file
74704.
7471ALL
74722.0
7473649 DB, DW and DD directives are used to place data in particular location or to simplyallocate space
7474without preassigning anything to space. The DW and DD directories areused to generate
74751.f ull address of labels 2.offsets of full address of labels and variables
74763.full address of variables 4.offsets 2.0
7477S.NO. Questions Choices Answers
7478650 DCL stands for
74791.
7480Data Control Language
74812.
7482Data Console Language
74833.
7484Data Console Level
74854.
7486Data Control Level
74871.0
7488651 Demand paged memory allocation
74891.
7490allows the virtual address space to be independent of the physical
7491memory
74922.
7493allows the virtual address space to be a multiple of the physical memory
7494size
74953.
7496allows deadlock to be detected in paging schemes
74974.
7498is present only in Windows NT
74991.0
7500652
7501Desirable properties of relational database design include
75021.All of the options
75032.minimizing update anomalies
75043.minimizing redundancy
75054.minimizing insertion/deletion anomalies
75061.0
7507653 Direction flag is used with
75081.
7509String instructions
75102.
7511Stack instructions.
75123.
7513Arithmetic instructions
75144.
7515Branch instructions
75161.0
7517654 Divide and conquire mechanism is used in 1.selection sort 2.merge sort 3.quick and merge sorts 4.indexed
7518sequential search 3.0
7519655 DML is provided for
75201.
7521Description of logical structure of database.
75222.
7523Addition of new structures in the database system.
75243.
7525Manipulation & processing of database.
75264.
7527Definition of physical structure of database system.
75283.0
7529656 Drop SQL clause
75301.
7531Drops only the values from the table
75322.
7533drops structure of the table along with values
75343.
7535None of the options
75364.
7537changes the structure of the table
75382.0
7539657 Duality principle is used when SE is 1.square 2.symmetric 3.asymmetricd 4.translated 2.0
7540S.NO. Questions Choices Answers
7541658 1.0
75421.
7543applications, data, technology infrastructure
75442.
7545communications, organization, financial infrastructure
75463.
7547network, database, reporting structure
75484.
7549systems, requirements, data structure
75501.0
7551659 Each counter of IC 8254 can work in --------------differnt modes of operation
75521.6
75532.5
75543.4
75554.3
75561.0
7557660 ElGamal encryption system is
75581.
7559symmetric key encryption algorithm
75602.
7561asymmetric key encryption algorithm
75623.
7563not an encryption algorithm
75644.
7565none of the mentioned
75662.0
7567661 EPROM is generally erased by using
75681.
7569Ultraviolet rays
75702.
7571infrared rays
75723.
757312 V electrical pulse
75744.
757524 V electrical pulse
75761.0
7577662 Ethernet in metropolitan area network (MAN) can be used as
75781.
7579pure ethernet
75802.
7581ethernet over SDH
75823.
7583ethernet over MPLS
75844.
7585combination of all of the above mentioned
75864.0
7587663 3.0
75881.
7589reduce the granularity of the plan
75902.
7591analyze requirements in depth
75923.
7593get all team members to "sign up" to the plan
75944.
7595begin design
75963.0
7597664 2.0
75981.
7599Are not iterative in nature
76002.
7601Can easily accommodate product requirements changes
76023.
7603Generally produce throwaway systems
76044.
7605Are not specific to applications
76062.0
7607S.NO. Questions Choices Answers
7608665 External Fragmentation of the file system
76091. can be avoided by paging
76102. occurs only if the file system is used improperly
76113. can be removed by compaction
76124.can be avoided by Segmentation
76134.0
7614666
7615Find the output
7616#include < stdio.h >
7617int main()
7618{
7619int tally=0;
7620for(;;)
7621{
7622if(tally==10)
7623break;
7624printf("%d ",++tally);
7625}
7626return 0;
7627}
76281.
76290 1 2 3 4 5 6 7 8 9 10
76302.
76310 1 2 3 ... infinte times
76323.
76331 2 3 4 5 6 7 8 9 10
76344.
76351 2 3 4 5 6 7 8 9
76363.0
7637667
7638Find the output
7639#include <stdio.h>
7640int main()
7641{
7642int x=65;
7643const unsigned char c=(int)x;
7644printf("%c\n",c);
7645return 0;
7646}
76471.
7648Error
76492.
765065
76513.
7652A
76534.
7654NULL
76553.0
7656668
7657Find the output
7658#include <stdio.h>
7659struct sample
7660{
7661int a=0;
7662char b='A';
7663float c=10.5;
7664};
7665int main()
7666{
7667struct sample s;
7668printf("%d,%c,%f",s.a,s.b,s.c);
7669return 0;
7670}
76711.
7672Error
76732.0,A,10.5 3.
76740,A,10.500000
76754.
7676No Error, No Output
76771.0
7678669
7679Find the output:
7680#include <stdio.h>
7681int main()
7682{
7683int a=100;
7684printf("%d\n"+1,a);
7685printf("Value is = %d"+3,a);
7686return 0;
7687}
76881.
7689Error
76902.
7691101,
7692Value is = 103
76933.
7694d
7695ue is = 100
76964.
7697100
7698100
76993.0
7700S.NO. Questions Choices Answers
7701670
7702Find the output:
7703#include <stdio.h>
7704int main()
7705{
7706int a=23;
7707;
7708;printf("%d",a);
7709;
7710return 0;
7711}
77121.
771323
77142.
7715Error
77163.
7717;23;
77184.
7719;23
77201.0
7721671
7722Find the output:
7723#include <stdio.h>
7724void main()
7725{
7726const char var='A';
7727++var;
7728printf("%c",var);
7729}
77301.
7731B
77322.
7733A
77343.
7735ERROR
77364.
773766
77383.0
7739672
7740FIND THE OUTPUT:
7741#include <stdio.h>
7742void main()
7743{
7744int x=10;
7745x+=(x++)+(++x)+x;
7746printf("%d",x);
7747}
77481.
774944
77502.
775145
77523.
775346
77544.
775547
77562.0
7757673
7758Find the output:
7759#include <stdio.h>
7760void main()
7761{
7762int x=(20 || 40 ) && (10);
7763printf("x= %d",x);
7764}
77651.
7766x= 60
77672.
7768x= 70
77693.
7770x= 0
77714.
7772x= 1
77734.0
7774674
7775Find the output:
7776#include <stdio.h>
7777void main()
7778{
7779char var=10;
7780printf("var is = %d",++var++);
7781}
77821.
7783ERROR: can not modify var.
77842.
7785ERROR: L-Value required
77863.
778712
77884.
7789ERROR: Expression syntax
77902.0
7791675 First derivative approximation says that values of constant intensities must be 1.1 2.0 3.positive 4.negative 2.0
7792676 Flip-flop excitation tables shows that
77931.For the given PS and NS what will be the inputs 2.For the given PS
7794and NS what will be the outputs 3.For the given PS and NS what will be
7795the type of flip-flops 4.For the given PS and NS what will be the values
7796of NS and PS respectively
77974.0
7798677 Following can be used to implement a SOP function without changing it into minterms 1.MUX 2.PLA 3.ROM 4.DeMUX 4.0
7799S.NO. Questions Choices Answers
7800678 For a well understood data processing application it is best to use
78011.
7802The waterfall model
78032.
7804prototyping model
78053.
7806the evolutionary model
78074.
7808the spiral model
78091.0
7810679 For purposes of behavior modeling a state is any
78111.
78123.0
78132.
7814data object hierarchy.
78153.
7816observable mode of behavior.
78174.
7818well defined process.
78193.0
7820680 Foreign Key is
78211.
7822A field in a table that matches a key field in another table
78232.
7824A field in a table that contains data that is also contained elsewhere in
7825another table
78263.
7827A key that consists of more than one field
78284.
7829A field in a table that has the same name as a key field in another table
78301.0
7831681
7832Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time
7833is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the
7834link). What is the minimum number of bits, i will be required to represent the sequence numbers
7835distinctly? Assume that no time gap needs to be given between transmission of two frames.
78361.
7837i=2
78382.
7839i=3
78403.
7841i=4
78424.
7843i=5
78444.0
7845682 FTP server listens for connection on port number
78461.
784720
78482.
784921
78503.
785122
78524.
785323
78542.0
7855683 Functions that combines to produce Æ’(x,y) 1.illumination and frequency 2.intensity and reflectance 3.illumination
7856and radiance 4.illumination and reflectance 4.0
7857684 Generally Dynamic RAM is used as main memory in a computer system as it______.
78581.
7859Consumes less power
78602.
7861has higher speed
78623.
7863has lower cell density
78644.
7865needs refreshing circuitry
78662.0
7867S.NO. Questions Choices Answers
7868685 Generic process models are:
78691.
7870waterfall, componet-based, iterative
78712.
7872waterfall, structural, component-based
78733.
7874sequential, waterfall, iterative
78754.
7876component-based, object-oriented, iterative
78774.0
7878686 Given a comma-separated list of values in a string, which function from the given list can create an
7879array of each individual value with a single call in PHP?
78801.
7881strstr( )
78822.
7883extract
78843.
7885explode( )
78864.
7887strtok( )
78883.0
7889687 Given a hash table T with 25 slots that stores 2000 elements, the load factor a for T is_____ 1.80 2.0.0125 3.8000 4.1.25 2.0
7890688 Given a variable $email containing the string user@example.com, which of the following PHP
7891statements would extract the string example.com?
78921.
7893substr($email, strpos($email, "@"));
78942.
7895strstr($email, "@");
78963.
7897strchr($email, "@");
78984.
7899substr($email, strpos($email, "@")+1);
79004.0
7901689
7902Given an array that represents elements of arithmetic progression in order. It is also given that one
7903element is missing in the progression, the worst case time complexity to find the missing element
7904efficiently is:
79051.theta(n) 2.theta(nLogn) 3.theta(Logn) 4.theta(1) 3.0
7906690 Given CF=0, BX=00111011 01110101 ROR BX,1. The result is 1.CF=1 BX=10011101 10111010 2.CF=1 BX=10100111 01101110
79073.CF=0 BX=01001110 11011101 4.CF=0 BX=01010011 10110111 1.0
7908691 Given the basic ER and relational models, which of the following is INCORRECT?
79091.
7910An attributes of an entity can have more that one value
79112.
7912An attribute of an entity can be composite
79133.
7914In a row of a relational table, an attribute can have more than one value
79154.
7916In a row of a relational table, an attribute can have exactly one value or a
7917NULL value
79183.0
7919692 Given the Code segment CS = 1000H and the offset BX=0050H. Calculated physical address is ---
7920------- 1.10000H 2.10050H 3.11050H 4.11000H 2.0
7921693 Given the Extra segment ES = 52B9H and the offset BX=D470H. Calculated physical address is --
7922-------- 1.60000H 2.70000H 3.11000H 4.11050H 4.0
7923694 Given the frequency f=1.5MHZ for 8253 timer the value of time period T is 1.10ms 2.0.66us 3.1ms 4.100ms 2.0
7924695 Given the functional dependencies, {AB -> CDE and A -> E}, for relation schema R =
7925(A,B,C,D,E) we can infer the following:
79261.
7927A is a key for R
79282.
7929BE is a key for R
79303.
7931AB is a key for R
79324.
7933B is a key for R
79343.0
7935S.NO. Questions Choices Answers
7936696
7937Given the language L = {ab, aa, baa}, which of the following strings are in L*?
79381) abaabaaabaa
79392) aaaabaaaa
79403) baaaaabaaaab
79414) baaaaabaa
79421.
79431, 2 and 3
79442.
79451, 2 and 4
79463.
79471, 3 and 4
79484.
79492, 3 and 4
79502.0
7951697 Grant and revoke are ....... statements.
79521.
7953DDL
79542.
7955TCL
79563.
7957DCL
79584.
7959DML
79603.0
7961698 High speed ethernet works on
79621.
7963coaxial cable
79642.
7965twisted pair cable
79663.
7967optical fiber
79684.
7969none of the mentioned
79703.0
7971699 How can we count the number of elements in an array? 1.Using sizeof() 2.count() 3.Writing a user defined function and using
7972array_search() 4.using sizeof() and count() 4.0
7973700 How can you specify default text in an input field? 1.Using JavaScript 2.Using the 'text' attribute 3.Using the 'placeholder'
7974element 4.Using the 'placeholder' attribute 4.0
7975701 How do I create PHP arrays in a HTML ? 1.< input name= MyArray[]/> 2.< input ="MyArray[]" /> 3.< input
7976name="MyArray[]" /> 4.< input MyArray[] /> 3.0
7977702 How do substring() and substr() differ?
79781.One is not a method of the String object. 2.substr() takes three
7979arguments, substring() only two. 3.Only one accepts a desired string
7980length as an argument. 4.Besides the spelling, nothing.
79813.0
7982703 How do we access the value of 'd' later? $a = array( 'a', 3 => 'b', 1 => 'c', 'd' ); 1.$a[0] 2.$a[1] 3.$a[2] 4.$a[4] 4.0
7983704 How do we prevent margins, borders and padding from overlapping? 1.Setting zero paddings and margins 2.By displaying our list as block
7984elements 3.Using table cells 4.By displaying our list as inline elements 2.0
7985705 How do we submit form data without a Sumbit button? 1.Using header() function 2.Using Javascript 3.Using
7986fdf_set_submit_form_action() fucntion 4.using header() and javascript 4.0
7987706 How do you check queue is full in array implementation 1.if(rear==size) 2.if(front==size) 3.if(rear==-1) 4.if(front==-1) 1.0
7988707 How do you get information from a form that is submitted using the "get" method? 1.Request.QueryString; 2.$_GET[]; 3.Request.Form; 4.$_POST[]; 2.0
7989708 How is a J-K flip-flop made to toggle? 1.J = 0, K = 0 2.J = 0, K = 1 3.J = 1, K = 0 4.J = 1, K = 1 4.0
7990709 How many bits are required to store one BCD digit? 1.1 2.2 3.3 4.4 4.0
7991710 How many diagrams are here in Unified Modelling Language?
79921.
7993six
79942.
7995seven
79963.
7997eight
79984.
7999nine
80004.0
8001711 How many different states does a 3-bit asynchronous counter have? 1.2 2.4 3.8 4.16 3.0
8002712 How many flip-flops are required to construct a mod10 counter? 1.10 2.8 3.5 4.4 4.0
8003713 How many flip-flops are required to make a MOD-32 binary counter? 1.3 2.4 3.5 4.6 3.0
8004714 How many instances of an abstract class can be created? 1.13 2.5 3.1 4.0 4.0
8005S.NO. Questions Choices Answers
8006715 How many minimum states are required in a DFA to find whether a given binary string has odd number of 0's
8007or not, there can be any number of 1's.
80081.
80091
80102.
80112
80123.
80133
80144.
80154
80162.0
8017716 How many nodes in a tree have no ancestors. 1.2 2.n 3.1 4.0 3.0
8018717 How many operating modes are available in 8253A. 1.1 2.2 3.6 4.3 3.0
8019718 How many transistors does the 8086 have 1.29,000 2.10,000 3.129,000 4.110,000 1.0
8020719 How to create a Date object in JavaScript?
80211.dateObjectName = new Date([parameters]) 2.dateObjectName.new
8022Date([parameters]) 3.dateObjectName := new Date([parameters])
80234.dateObjectName Date([parameters])
80241.0
8025720 How to create a memory without a name during the execution of the program? 1.malloc() 2.Queue 3.stack 4.list 1.0
8026721 How will you free the allocated memory ? 1.remove(var-name); 2.free(var-name); 3.delete(var-name); 4.dalloc(varname);
80272.0
8028722 How will you handle the overflow condition of a linked queue through code(note: new_node is a
8029newly created node in a memory)
80301.if(rear==size) 2.if(new_node==0) 3.if(front==size)
80314.if(new_node==null) 1.0
8032723 HTTP client requests by establishing a __________ connection to a particular port on the server.
80331.
8034user datagram protocol
80352.
8036transmission control protocol
80373.
8038broader gateway protocol
80394.
8040RIP
80412.0
8042724 IC 8237 has ------------------many pins
80431.
804440
80452.
804628
80473.
804824
80494.
805020
80511.0
8052725 IC 8257 has --------------------many channels for data transfer
80531.
80541
80552.
80562
80573.
80583
80594.
80604
80614.0
8062726 Identify different segments in a program 1.only code segment 2.data and code segment 3.only data segment
80634.data, code, stack and extra segments 4.0
8064727 Identify the accurate control word for operate counter 0, Read/Write LSB only, Mode 2, BCD
8065countdown. 1.00010111B 2.0001X111B 3.00010101B 4.00110111B 2.0
8066728 Identify the addressing mode for the instruction MOV AH,47H 1.Immediate addressing mode 2.Direct addressing mode 3.Based
8067addressing mode 4.Indirect addressing mode 2.0
8068729 Identify the proper data direction and modes of operation of the 8255 ports if the control word
8069written into it is 9BH.
80701.Port A as output 2.Port C lower as output 3.Port C upper as input
80714.Port B as output 3.0
8072S.NO. Questions Choices Answers
8073730 If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum
8074number of hosts per subnet?
80751.
80761024
80772.
80781023
80793.
80802046
80814.
80822047
80833.0
8084731 If a class C is derived from class B, which is derived from class A, all through public inheritance,
8085then a class C member function can access
80861.protected and public data only in C and B 2.protected and public data
8087only in C. 3.private data in A and B. 4.protected data in A and B. 4.0
8088732 If a constructor function is defined in private section of a class, then
80891.The object cannot be created 2.Only its member functions and friends
8090may declare objects of the class 3.Only its friends may declare objects of
8091the class 4.Only its member functions may declare objects of the class
80922.0
8093733 If AL= 7FH and instruction ADD AL,1 is given, specify the contents of the six status flag
80941.CF=0,PF=0,AF=1,ZF=0,SF=1,OF=1
8095. 2.CF=0,PF=1,AF=0,ZF=0,SF=1,OF=1
80963.CF=0,PF=1,AF=1,ZF=O,SF=1,OF=1
80974.CF=0,PF=0,AF=1,ZF=O,SF=1,OF=0
80984.0
8099734 If AL=C0H, Determine the content of the register AL after SAL AL,1 instruction is executed. 1.E0H 2.80H 3.0CH 4.0EH 2.0
8100735
8101If all page frames are initially empty, and a process is allocated 3 page frames in real memory and
8102references its pages in the order 1 2 3 2 4 5 2 3 2 4 1 and the page replacement is FIFO, the total
8103number of page faults caused by the process will be __________
81041.
810510
81062.
81077
81083.
81098
81104.
81119
81124.0
8113736 If all tasks must be executed in the same time-span, what type of cohesion is being exhibited?
81141.
8115Functional Cohesion
81162.
8117Temporal Cohesion
81183.
8119Functional Cohesion
81204.
8121Sequential Cohesion
81222.0
8123737 If class A is friend of class B and if class B is friend of class C, which of the following is true?
81241.Class C is friend of Class A 2.Class A is friend of Class C 3.Class A
8125and Class C don’t have any friend relationship 4.Class A and Class C are
8126mutual friends
81274.0
8128738
8129If every requirement stated in the Software Requirement Specification (SRS) has only one
8130interpretation, SRS is said to be
81311.
8132correct.
81332.
8134unambiguous.
81353.
8136consistent.
81374.
8138verifiable.
81392.0
8140739
8141If inspected in a browser, what will be the total width of the div in the following code snippet?
8142#container { width: 600px; border: 2px solid #CCCCCC; padding: 30px 20px; margin: 20px 10px
814340px 10px;}
81441.664px 2.660px 3.644px 4.600px 1.0
8145740 If L and L' are recursively enumerable, then L is
81461.
8147regular
81482.
8149context-free
81503.
8151context-sensitive
81524.
8153recursive
81544.0
8155S.NO. Questions Choices Answers
8156741 If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using Thompson
8157construction will have ------------- states.
81581.
8159n
81602.
8161n+1
81623.
8163n+2
81644.
8165n-1
81662.0
8167742 If p and q are assigned the values 2 and 3 respectively then the statement P = q++ 1.assigns a value 5 to p 2.assigns a value 3 to p 3.gives an error message
81684.assigns a value 4 to p 2.0
8169743 If para1 is the DOM object for a paragraph, what is the correct syntax to change the text within the
8170paragraph?
81711."New Text"? 2.para1.value="New Text";
81723.para1.firstChild.nodeValue= "New Text"; 4.para1.nodeValue="New
8173Text";
81742.0
8175744 If the class name is X, what is the type of its "this" pointer? 1.X* 2.const X* const 3.X& 4.X* const 3.0
8176745 If the disk size is 2^30 bytes and block size is 2^12 bytes then find how many such blocks are
8177there?
81781.
81792^42
81802.
81812^18
81823.
81832^360
81844.
81852^30
81862.0
8187746 If the PIC outputs the type number of C8H, the CPU will retrive the vector stored in the address ---
8188-----------
81891.00320H - 00323H 2.00324H - 00327H 3.00223H - 00226H 4.00140H
8190- 00143H
8191747
8192If the size of logical address space is 2 to the power of m, and a page size is 2 to the
8193power of n addressing units, then the high order _____ bits of a logical address designate
8194the page number, and the ____ low order bits designate the page offset.
81951.
8196m,n
81972.
8198n,m
81993.
8200m-n,m
82014.
8202m-n,n
82034.0
8204748 If there are n relations how many number of join conditions has to be applied to retrieve the data
8205from all the n relations?
82061.
8207N+1
82082.
8209N
82103.
8211N-1
82124.
8213A Number in the range 0 toN.
82143.0
8215749 If we create a file by ‘ifstream’, then the default mode of the file is _________ 1.ios :: out 2.ios :: in 3.ios :: app 4.ios :: binary 1.0
8216750 If X->Y and X->Z then
82171.
8218Y->Z
82192.
8220Z->Y
82213.
8222X->YZ
82234.
8224Doesn't hold
82253.0
8226S.NO. Questions Choices Answers
8227751 If x--> y then y --> x. This statement is
82281.
8229True
82302.
8231False
82323.
8233Can't Say
82344.
8235Doesn't hold
82363.0
8237752 IF Y is a subset of X then
82381.
8239X --> Y
82402.
8241Y -->X
82423.
8243Y -->--> X
82444.
8245X is a sub set of Y
82462.0
8247753 If you have an empty queue and you insert characters ‘r’, ‘a’, ‘t’ (in this order only), what is the
8248order of the characters when you dequeue all the elements? 1.‘r’, ‘a’, ‘t’ 2.‘t’, ‘a’, ‘r’ 3.‘r’, ‘t’, ‘a’ 4.‘t’, ‘r’, ‘a’ 1.0
8249754 IMUL source is a signed _________
82501.
8251multiplication
82522.
8253addition
82543.
8255subtraction
82564.
8257division
82581.0
8259755 In 8086 microprocessor one of the following statements is not true
82601.Coprocessor is interfaced in MAX mode 2.Coprocessor is interfaced in
8261MIN mode 3.I/O can be interfaced in MAX / MIN mode 4.Supports
8262pipelining
82632.0
8264756 In 8086 microprocessor the following has the highest priority among all type interrupts 1.TYPE 255 2.DIV 0 3.NMI 4.OVER FLOW 3.0
8265757 In 8086, Example for Non maskable interrupts are ________.
82661.
8267TRAP
82682.
8269RST6.5
82703.
8271INTR
82724.
8273RST6.6
82741.0
8275758 In a bottom-up evaluation of a syntax directed definition, inherited attributes can
82761.
8277always be evaluated
82782.
8279be evaluated only if the definition is L- attributed
82803.
8281be evaluated only if the definition has synthesized attributes
82824.
8283never be evaluated
82842.0
8285759 In a circular linked list
82861.components are arranged hierarchically 2.there is no beginning and no
8287end 3.forward and backward traversal within the list is permitted
82884.components are arranged from top to bottom
82892.0
8290S.NO. Questions Choices Answers
8291760 In a compiler, keywords of a language are recognized during
82921.
8293parsing of the program
82942.
8295the code generation
82963.
8297the lexical analysis of the program
82984.
8299dataflow analysis
83003.0
8301761 In a conceptual model for a university, which of the following could most appropriately be
8302represented via a recursive relationship?
83031.
8304Student credit hours
83052.
8306Course prerequisites
83073.
8308Parking sticker assignments
83094.
8310Final exam schedules
83112.0
8312762 In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the
8313following statements is True?
83141.A tree has no bridge 2.A bridge cannot be part of a simple cycle
83153.Every edge of a clique with size>=3 is a bridge (A clique is any
8316complete subgraph of a graph) 4.A graph with bridges cannot have a
8317cycle
83184.0
8319763 In a DMA write operation the data is transferred
83201.
8321from I/O to memory
83222.
8323from memory to I/O
83243.
8325from memory to I/O
83264.
8327from I/O to I/O
83281.0
8329764
8330In a microprocessor, the service routine for a certain interrupt starts from a fixed location
8331of memory which cannot be externally set, but the interrupt can be delayed or rejected. Such
8332aninterrupt is
83331.maskable and non-vectored 2.non-maskable and vectored 3.maskable
8334and vectored 4.non-maskable and non-vectored 3.0
8335765
8336In a network of LANs connected by bridges, packets are sent from one LAN to another through
8337intermediate bridges. Since more than one path may exist between two LANs, packets may have to
8338be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?
83391.
8340For shortest path routing between LANs
83412.
8342For avoiding loops in the routing paths
83433.
8344For fault tolerance
83454.
8346For minimizing collisions
83472.0
8348766 In a syntax directed translation schema ,if value of an attribute of a node is function of the values of
8349the attributes of its children , then it is called
83501.Inherited attributes 2.Synthesized attributes 3.Canonical atrributes
83514.Derived atrributes 2.0
8352767 In a token ring network the transmission speed is 10^7 bps and the propagation speed is 200
8353metres/micro second. The 1-bit delay in this network is equivalent to:
83541.
8355500 metres of cable.
83562.
8357200 metres of cable.
83583.
835920 metres of cable.
83604.
836150 metres of cable.
83623.0
8363S.NO. Questions Choices Answers
8364768 In a virtual memory environment
83651.
8366segmentation and page tables are stored in the cache and do not add any
8367substantial overhead
83682.
8369slow down the computer system considerable
83703.
8371segmentation and page tables are stored in the RAM
83724.
8373only page table is stored in cache
83741.0
8375769 In access lists and groups which one of the following is correct for the 'RWX' notation of the order
8376'group, owner, public'
83771.
8378111110001
83792.
8380110111001
83813.
8382001111110
83834.
8384001110111
83852.0
8386770 In an array representation of binary tree, the left child of i th node is located at 1.2i+2 2.(i-1)/2 3.(i-2)/2 4.2i+1 4.0
8387771 In an array representation of binary tree, the right child of i th node is located at 1.(i-2)/2 2.(i-1)/2 3.2i+2 4.2i+1 3.0
8388772 In an E-R diagram an entity set is represent by a
83891.
8390rectangle
83912.
8392ellipse
83933.
8394diamond box
83954.
8396circle
83971.0
8398773 In an E-R diagram attributes are represented by
83991.
8400rectangle
84012.
8402square
84033.
8404ellipse
84054.
8406triangle
84073.0
8408774 In any undirected graph, the sum of the degrees of all nodes is: 1.is twice number of edges 2.is always ODD 3.need not be even 4.must
8409be even 1.0
8410775 In Assembly language programming, minimum number of operands required for an instruction
8411is/are
84121.
8413Zero
84142.
8415One
84163.
8417Two
84184.
8419Three
84201.0
8421776 In asynchronous serial communication the physical layer provides
84221.start and stop signalling
84232.flow control
84243.both (a) and (b)
84254.none of the mentioned
84263.0
8427777 In binary heap, whenever the root is removed then the
8428rightmost element of last level is replaced by the root. Why?
84291.To make sure that it is still complete binary tree 2.It is the easiest
8430possible way 3.Because left and right subtree might be missing
84314.maximum value is contained by the root node
84321.0
8433S.NO. Questions Choices Answers
8434778 In case of entity integrity, the primary key may be
84351.not Null
84362.Null
84373.a foreign key
84384.any value
84391.0
8440779 3.0
84411.
8442cannot be a member of the software team
84432.
8444cannot be a customer
84453.
8446controls and facilitates the process
84474.
8448must be an outsider
84492.0
8450780 In context of OSI or TCP/IP computer network models, which of the following is false?
84511.Major difference between LAN and WAN is that the later uses
8452switching element 2.Network layer is connection oriented 3.A repeater is
8453used just to forward bits from one network to another one 4.A gateway is
8454used to connect incompatible networks
84552.0
8456781 In cryptography, the order of the letters in a message is rearranged by
84571.
8458transpositional ciphers
84592.
8460substitution ciphers
84613.
8462both (a) and (b)
84634.
8464none of the mentioned
84651.0
8466782 In Ethernet when Manchester encoding is used, the bit rate is:
84671.
8468Half the baud rate.
84692.
8470Twice the baud rate.
84713.
8472Same as the baud rate.
84734.
8474Grows exponentially
84751.0
8476783 In FTP protocol, client contacts server using ____ as the transport protocol.
84771.
8478transmission control protocol
84792.
8480user datagram protocol
84813.
8482datagram congestion control protocol
84834.
8484stream control transmission protocol
84851.0
8486784 In general tree to binary tree conversion, the two links of the binary tree node points to
84871.two leaf nodes in the general tree 2.its right child and sibling in the
8488genral tree 3.its left child and sibling in the general tree 4.its left and
8489right child in the general tree
84904.0
8491785 In HTTP pipelining
84921.
8493multiple HTTP requests are sent on a single TCP connection without
8494waiting for the corresponding responses
84952.
8496multiple HTTP requests can not be sent on a single TCP connection
84973.
8498multiple HTTP requests are sent in a queue on a single TCP connection
84994.
8500none of the mentioned
85011.0
8502S.NO. Questions Choices Answers
8503786
8504In interactive environments such as time-sharing systems, the primary requirement is to provide
8505reasonably good response time and in general, to share system resources equitably. In such
8506situations, the scheduling algorithm that is most popularly applied is ________.
85071.
8508Shortest Remaining Time Next (SRTN) Scheduling
85092.
8510Priorities Based Preemptive Scheduling
85113.
8512Round Robin Scheduling
85134.
8514First Come First Serve
85153.0
8516787 In javascript, RegExp Object Method test() is used to search a string and returns _________ 1.true or false 2.found value 3.index 4.Matched or not matched 1.0
8517788 In linear search algorithm the Worst case occurs when
85181.The item is somewhere in the middle of the array 2.The item is not in
8519the array at all 3.The item is the last element in the array 4.The item is
8520the last element in the array or is not there at all
85214.0
8522789 In max mode, control bus signal So,S1 and S2 are sent out in ____________ form
85231.
8524shared
85252.
8526decoded
85273.
8528encoded
85294.
8530unshared
85313.0
8532790 In mysql_fetch_array(),if two or more columns of the result have the same field names, what
8533action is taken?
85341.
8535the first column will take precedence
85362.
8537the column is skipped
85383.
8539the last column will take precedence
85404.
8541an error is thrown.
85423.0
8543791 In operator precedence parsing , precedence relations are defoned 1.To delimit the handle 2.For all pair of terminals 3.For all pair of non
8544terminals 4.Only for a certain pair of terminals 3.0
8545792 In PHP, array values are keyed by ______ values (called indexed arrays) or using ______ values
8546(called associative arrays). Of course, these key methods can be combined as well.
85471.
8548Float, string
85492.
8550Positive number, negative number
85513.
8552String, Boolean
85534.
8554Integer, String
85554.0
8556793 In PHP, which of the following function is used to insert content of one php file into another php
8557file before server executes it 1.include[] 2.#include() 3.include() 4.#include{} 3.0
8558794
8559In Priority Scheduling a priority number (integer) is associated with each process. The CPU is
8560allocated to the process with the highest priority (smallest integer = highest priority). The problem
8561of, Starvation ? low priority processes may never execute, is resolved by __________.
85621.
8563Terminating the process.
85642.
8565Aging
85663.
8567Mutual Exclusion
85684.
8569Semaphore
85702.0
8571795 In software engineering development, if there are no applicable theories, people often use adhoc
8572approach.
85731.
8574True
85752.
8576False
85773. 4.
85781.0
8579S.NO. Questions Choices Answers
8580796 2.0
85811.
8582true
85832.
8584false
85853. 4.
85861.0
8587797 In the absolute the addressing mode
85881.
8589The operand is inside the instruction
85902.
8591The address of the operand is inside the instruction
85923.
8593The register containing the address of the operand is specified inside the
8594instruction
85954.
8596The location of the operand is implicit
85971.0
8598798 In the architecture of a database system external level is the
85991.view level
86002.conceptual level
86013.logical level
86024.physical level
86031.0
8604799 In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the
8605following is True?
86061.In both AST and CFG, let node N2 be the successor of node N1. In the
8607input program, the code corresponding to N2 is present after the code
8608corresponding to N1 2.For any input program, neither AST nor CFG will
8609contain a cycle 3.Each node in AST and CFG corresponds to at most one
8610statement in the input program 4.The maximum number of successors of
8611a node in an AST and a CFG depends on the input program
86124.0
8613800 In the context of object-oriented software engineering a component contains 4.0 4.0
8614801 In the following code snippet, what is the correct value of the left margin? margin: 10px 5px 20px
861515px; 1.10px 2.5px 3.20px 4.15px 4.0
8616802 In the multi-programming environment, the main memory consisting of _________ number of
8617process.
86181.
8619Greater than 100
86202.
8621only one
86223.
8623Greater than 50
86244.
8625More than one
86264.0
8627803 In the network HTTP resources are located by
86281.
8629uniform resource identifier
86302.
8631unique resource locator
86323.
8633unique resource identifier
86344.
8635unique resource identifier
86361.0
8637804 In the operation read_item(x), what does x mean?
86381.
8639a file
86402.
8641a record
86423.
8643a disk block
86444.
8645all of the options
86464.0
8647S.NO. Questions Choices Answers
8648805 In the running state
86491.
8650only the process which has control of the processor is found
86512.
8652all the processes waiting for I/O to be completed are found
86533.
8654all the processes waiting for the processor are found
86554.
8656everything in these options are found
86571.0
8658806 In the slow start phase of the TCP congestion control algorithm, the size of the congestion window
8659.....................
86601.
8661does not increase
86622.
8663increases linearly
86643.
8665increases quadratically
86664.
8667increases exponentially
86684.0
8669807 In the spiral model ‘risk analysis’ is performed
86701.
8671In the first loop
86722.
8673in the first and second loop
86743.
8675In every loop
86764.
8677before using spiral model
86783.0
8679808 In tunnel mode IPsec protects the
86801.
8681entire IP packet
86822.
8683IP header
86843.
8685IP payload
86864.
8687none of the mentioned
86881.0
8689809 In what type of coupling, the complete data structure is passed from one module to another?
86901.Control Coupling
86912.Stamp Coupling
86923.External Coupling
86934.Content Coupling
86942.0
8695810 In which addressing mode the operand is given explicitly in the instruction
86961.
8697Absolute
86982.
8699Immediate
87003.
8701Indirect
87024.
8703Direct
87042.0
8705811 In which case is it mandatory to provide a destructor in a class?
87061.Class for which copy constructor is defined 2.Class for which two or
8707more than two objects will be created 3.Almost in every class 4.Class
8708whose objects will be created dynamically
87094.0
8710S.NO. Questions Choices Answers
8711812 In which mode FTP, the client initiates both the control and data connections.
87121.
8713active mode
87142.
8715passive mode
87163.
8717active mode and passive mode
87184.
8719none of the mentioned
87202.0
8721813 In which topology, if there are n devices in a network, each device has n-1 ports for cables? 1.Mesh 2.Star 3.Ring 4.Bus 1.0
8722814 In which year, 8086 was introduced?
87231.
87241978
87252.
87261979
87273.
87281977
87294.
87301981
87311.0
8732815 2.0
87331.
8734TRUE
87352.
8736FALSE
87373. 4.
87381.0
8739816 In wireless distribution system
87401.
8741multiple access point are inter-connected with each other
87422.
8743there is no access point
87443.
8745only one access point exists
87464.
8747none of the mentioned
87481.0
8749817 In wireless network an extended service set is a set of
87501.
8751connected basic service sets
87522.
8753all stations
87543.
8755all access points
87564.
8757all nodes
87581.0
8759818 Information retrieval is faster from
87601.
8761Floppy disk
87622.
8763Magnetic tape
87643.
8765Hard disk
87664.
8767CD
87683.0
8769S.NO. Questions Choices Answers
8770819 Insert into Emp(101, ‘XXX’) gives the following error
87711.
8772missing Select keyword
87732.
8774Missing Values
87753.
8776both of the errors
87774.
8778No of the errors
87792.0
8780820
8781int main()
8782{
8783int x,y;
8784x=(100,200);
8785y=100,200;
8786printf("x=%d,y=%d",x,y);
8787return 0;
8788}
8789Find the output
87901.
8791x=100,y=200
87922.
8793x=200,y=200
87943.
8795ERROR
87964.
8797x=200,y=100
87984.0
8799821 Interaction Diagram is a combined term for
88001.
8801Sequence Diagram + Collaboration Diagram
88022.
8803Activity Diagram + State Chart Diagram
88043.
8805Deployment Diagram + Collaboration Diagram
88064.
8807None
88081.0
8809822 Internet Explorer uses ....................... property to create transparent images. 1.-moz-opacity:x 2.filter: alpha(opacity=x) 3.filter: beta(opacity=x) 4.-
8810IE-opac:y 2.0
8811823 Interpolation search is an improved variant of binary search.
8812It is necessary for this search algorithm to work that data collection should be
88131.in sorted form and equally distributed 2.in sorted form and but not
8814equally distributed 3.equally distributed but not sorted 4.unsorted and not
8815evenly distributed
88161.0
8817824 IPSec is designed to provide the security at the
88181.
8819transport layer
88202.
8821network layer
88223.
8823application layer
88244.
8825session layer
88262.0
8827825 It is difficult to design asynhronous sequential circuit because. 1.External clock is to be provided 2.It is using Flip flops 3.It is more
8828complex 4.Generally they involve stability problem 4.0
8829826 It is ok to have a single ideal approach to develop a software.
88301.
8831True
88322.
8833False
88343. 4.
88352.0
8836827 It would be ideal if all of computer science theories can be used in software engineering.
88371.
8838False
88392.
8840True
88413. 4.
88422.0
8843828 JavaScript RegExp Object has modifier 'i' to __________
88441.Perform case-sensitive matching 2.Perform case-insensitive matching
88453.Perform both case-sensitive & case-insensitive matching 4.None of the
8846these
88472.0
8848S.NO. Questions Choices Answers
8849829 Join is equal to
88501.
8851Cartesian Product
88522.
8853Combination of Union and Cartesian product
88543.
8855Combination of selection and Cartesian product
88564.
8857Combination of intersection and Cartesian product
88583.0
8859830 K-map follow following code for marking adjacent variables 1.84-2-1
88602.Gray Code 3.2421 4.8421 2.0
8861831
8862Let G be a weighted connected undirected graph with distinct positive edge weights.If every edge
8863weight is increased by the same value, then which of the following statements is/are TRUE ?
8864P: Minimum spanning tree of G does not change. Q: Shortest path between any pair of vertices
8865does not change
88661.
8867P Only
88682.
8869Q Only
88703.
8871Neither P nor Q
88724.
8873Both P and Q
88741.0
8875832
8876Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2
8877are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1
8878and R2 do not have any attributes of their own. What is the minimum number of tables required to
8879represent this situation in the relational model?
88801.
88812
88822.
88833
88843.
88854
88864.
88875
88882.0
8889833
8890Let G be a graph with n vertices and m edges, What is the tightest upper bound on the running time
8891on Depth First Search of G? Assume that the graph is represented using adjacency matrix 1.O(n) 2.O(m+n) 3.O(mn) 4.O(n^2) 4.0
8892834
8893Let G be the CFG, l be the number of left most derivations, r be the number of right most
8894derivations and P be the number of parse trees. Assume l , r and P are computed for a particular
8895string. For a given CFG ‘G’ and given string ‘w’, what is the relation between l , P , r ?
88961.
8897l=P=r
88982.
8899l<=P>=r
89003.
8901l>=P<=r
89024.
8903l<=P<=r
89041.0
8905835 Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be
8906satisfied by G(x) to detect odd number of bits in error?
89071.
8908G(x) contains more than two terms
89092.
8910G(x) does not divide 1+x^k, for any k not exceeding the frame length
89113.
89121+x is a factor of G(x)
89134.
8914G(x) has an odd number of terms.
89153.0
8916S.NO. Questions Choices Answers
8917836
8918Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which
8919one of the following is TRUE?
8920L1' --> Complement of L1
8921L2' --> Complement of L2
89221.
8923L1' is recursive and L2' is recursively enumer able
89242.
8925L1' is recursive and L2' is not recursively enumerable
89263.
8927L1' and L2' are recursively enumerable
89284.
8929L1' is recursively enumerable and L2' is recursive
89302.0
8931837
8932Let P be a QuickSort Program to sort numbers in ascending order using the first element as pivot,
8933Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4, 1, 5, 3,
89342} respectively,Which one of the following holds?
89351.t1=5 2.t1>t2 3.t1 4.t1=t2 2.0
8936838 Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n,
8937which of the following is TRUE ? 1.T(n) = O(n) 2.T(n) = O(log2n) 3.T(n) = O( n) 4.T(n) = O(n2) 3.0
8938839 Let 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
8939states in a non-deterministic finite automaton that accepts L?
89401.
8941n+1
89422.
8943n
89443.
8945n-1
89464.
89472n+1
89481.0
8949840 Local and loop optimization in turn provide motivation for
89501.Peephole optimization 2.DFA and Constant folding 3.Basic Code
8951Analysis 4.Data flow analysis
8952.
89534.0
8954841 LOCK prefix is used most often 1.during normal execution. 2.during DMA accesses 3.during interrupt
8955servicing. 4.during memory accesses 3.0
8956842 Logical addressing is used in _____ layer 1.Network 2.Transport 3.Physical 4.Session 1.0
8957843
89581.0
89591.
8960rely basis path testing
89612.
8962exercise the logical conditions in a program module
89633.
8964select test paths based on the locations and uses of variables
89654.
8966focus on testing the validity of loop constructs
89672.0
8968844 Magnetic tapes are good storage media for
89691.
8970backup and low volume data
89712.
8972backup and high volume data
89733.
8974storing original but low volume data
89754.
8976storing original but high volume data
89772.0
8978845 Manager salary details are hidden from the employee. This is 1.Conceptual level data hiding 2.Physical level data hiding 3.External
8979level data hiding 4.None of mentioned 1.0
8980846 1.0
89811.
8982TRUE
89832.
8984FALSE
89853. 4.
89862.0
8987S.NO. Questions Choices Answers
8988847
8989Match all items in Group 1 with correct options from those given in Group 2.
8990Group 1 Group 2
8991P. Regular expression 1. Syntax analysis
8992Q. Pushdown automata 2. Code generation
8993R. Dataflow analysis 3. Lexical analysis
8994S. Register allocation 4. Code optimization
89951.
8996P-4. Q-1, R-2, S-3
89972.
8998P-3, Q-1, R-4, S-2
89993.
9000P-3, Q-4, R-1, S-2
90014.
9002P-2, Q-1, R-4, S-3
90032.0
9004848
9005Match the following:
9006List-I List-II
9007A. Lexical analysis 1. Graph coloring
9008B. Parsing 2. DFA minimization
9009C. Register allocation 3. Post-order traversal
9010D. Expression evaluation 4. Production tree
9011Codes:
9012A B C D
9013(a) 2 3 1 4
9014(b) 2 1 4 3
9015(c) 2 4 1 3
9016(d) 2 3 4 1
90171.
9018a
90192.
9020b
90213.
9022c
90234.
9024d
90252.0
9026849 Memory elements in clocked sequential circuits are called. 1.latches 2.gates 3.signals 4.flipflop 4.0
9027850 Memory unit accessed by content is called______
90281.
9029Read only memory
90302.
9031Programmable Memory
90323.
9033Virtual Memory
90344.
9035Associative Memory
90364.0
9037851 Mode of communication in which transmission takes place in both directions, but only in one
9038direction at a time is called________________ 1.simplex 2.four wired 3.full duplex 4.half-duplex 4.0
9039852 Modifying the software to match changes in the ever changing environment is called
90401.
9041adaptive maintenance
90422.
9043corrective maintenance
90443.
9045perfective maintenance
90464.
9047preventive maintenance
90481.0
9049853 Most software continues to be custom built because
90501.
9051Component reuse is common in the software world.
90522.
90534.0Reusable components are too expensive to use.
90543.
9055Software is easier to build without using someone else's components
90564.
9057Off-the-shelf software components are unavailable in many application
9058domains.
90591.0
9060S.NO. Questions Choices Answers
9061854 Multiple choice examination answer sheets can be evaluated automatically by
90621.
9063Optical Mark Reader
90642.
9065Optical Character Reader
90663.
9067Magnetic tape reader
90684.
9069Magnetic ink character reader.
90701.0
9071855 Multiple object can be sent over a TCP connection between client and server in
90721.
9073persistent HTTP
90742.
9075nonpersistent HTTP
90763.
9077both persistent HTTP and nonpersistent HTTP
90784.
9079p-persistent HTTP
90801.0
9081856 Multiple variable declaration of same data type can be avoided by? 1.array 2.identifiers 3.functions 4.Pointer 1.0
9082857 Network layer firewall works as a
90831.
9084frame filter
90852.
9086packet filter
90873.
9088both (a) and (b)
90894.
9090none of the mentioned
90912.0
9092858 Network models are complicated by physical keys, but the relation model is
90931.Slower because it uses logical keys 2.Slower because it uses physical
9094keys 3.Faster because it uses physical keys 4.Faster because it uses
9095logical keys
90964.0
9097859 Network operating system that does not support symmetric multi-processing (SMP) is 1.Banyan (VINES) 2.Microsoft NT advanced server 3.SCO Unix
90984.Novell Network 3.X 4.0
9099860 NOR Gate does NOT follow 1.DeMorgan’s Theorem 2.Associative Law 3.Commutative Law
91004.Distributive Law 4.0
9101861 Normalisation of database is used to 1.Minimise Errors 2.Improve Security 3.Eliminate redundancy
91024.Improve security 3.0
9103862 Number of the times the instruction sequence below will loop before coming out of loop is, MOV
9104AL, 00h A1: INC AL JNZ A1 1.255 2.01 3.00 4.256 4.0
9105863 ODBC stands for
91061.
9107Object Database Connectivity.
91082.
9109Oral Database Connectivity.
91103.
9111Oracle Database Connectivity.
91124.
9113Open Database Connectivity.
91144.0
9115864 One application of a digital multiplexer is to facilitate: 1.data generation 2.serial-to-parallel conversion 3.data selector 4.parity
9116checking 1.0
9117865 One of the fault base testing techniques is
91181.
9119unit testing.
91202.
9121beta testing.
91223.
9123Stress testing.
91244.
9125mutation testing.
91264.0
9127S.NO. Questions Choices Answers
9128866 One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the following
9129statements best explains the need for this field?
91301.
9131It can be used to priortize packets
91322.
9133It can be used to reduce delays
91343.
9135It can be used to optimize throughput
91364.
9137It can be used to prevent packet looping
91384.0
9139867 One of the main advantage of using src attribute is 1.It becomes self-cached 2.It makes the HTML file modular 3.It restricts
9140manipulation in the HTML file 4.It simplifies the HTML files 4.0
9141868 One of the purposes of using intermediate code in compilers is to
91421.
9143make parsing and semantic analysis simpler
91442.
9145improve error recovery and error reporting
91463.
9147increase the chances of reusing the machine-independent code optimizer
9148in other compilers.
91494.
9150improve the register allocation.
91513.0
9152869 overloading + operator requires return type as object because, 1.reference parameter has to be returned 2.binary addition requires that
91533.all overloading functions require that 4.chain of additions 3.0
9154870 Overloading involves writing two or more functions with ________
91551.different names and different argument lists 2.different names and the
9156same argument list 3.the same name and different argument lists 4.the
9157same name and the same argument list
91583.0
9159871 Overloading the function operator
91601.usually make use of a constructor that takes arguments. 2.allows you to
9161create objects that act syntactically like functions. 3.requires a class with
9162an overloaded operator. 4.requires a class with an overloaded [ ] operator.
91633.0
9164872 Packets of the same session may be routed through different paths in:
91651.
9166TCP, but not UDP
91672.
9168TCP and UDP
91693.
9170UDP, but not TCP
91714.
9172Neither TCP nor UDP
91732.0
9174873 Paging _________
91751.
9176solves the memory fragmentation problem
91772.
9178allows modular programming
91793.
9180allows structured programming
91814.
9182avoids deadlock
91831.0
9184874 Parallelism and concurrency is fully achieved in which of the following thread model
91851.
9186Many-to-one model
91872.
9188Many-to-many
91893.
9190one-to-one model
91914.
9192All the models
91931.0
9194S.NO. Questions Choices Answers
9195875 Passing the request from one schema to another in DBMS architecture is called as _______
91961.
9197Mapping
91982.
9199Communication
92003.
9201Relational
92024.
9203network
92041.0
9205876 Pee hole optimization 1.Local optimization 2.Loop optimization 3.Constant folding 4.Data flow
9206analysis 3.0
9207877 2.0
92081.
9209true
92102.
9211false
92123. 4.
92134.0
9214878 Physical layer provides
92151.
9216mechanical specifications of electrical connectors and cables
92172.
9218electrical specification of transmission line signal level
92193.
9220specification for IR over optical fiber
92214.
9222all of the mentioned
92234.0
9224879
9225Pick an incorrect declaration:
92261. int x[5];
92272. int x[5]={1,2,3,4,5};
92283. int x[5] = {1,2}
92294. int x[];
92301.
92311
92322.
92332
92343.
92353
92364.
92374
92384.0
9239880 Pick the odd one out. 1.[] 2.() 3.:: 4.~ 3.0
9240881 Polymorphism reduces the effort required to extend an object system by
92411.
9242Coupling objects together more tightly
92432.
92442.0enabling a number of different operations to share the same name.
92453.
9246making objects more dependent on one another
92474.
9248removing the barriers imposed by encapsulation.
92494.0
9250882 Popular application of flip-flop are. 1.Shift registers 2.Transfer register 3.Counters 4.All of these 4.0
9251883 Postorder Tree travsersal is recursive 1.LDR 2.LRD 3.DLR 4.DRL 2.0
9252884
9253PREDICT THE OUTPUT:
9254#include <stdio.h>
9255void main()
9256{
9257int a=10,b=2,x=0;
9258x=a+b*a+10/2*a;
9259printf("value is =%d",x);
9260}
92611.Value is =1250 2.
9262Value is =80
92633.
9264Value is =125
92654.
9266Error
92672.0
9268885 Prim's algorithm is a method available for finding out the minimum cost of a spanning tree.
9269Its time complexity is given by: 1.O(1) 2.O(n*n) 3.O(n logn) 4.O(n) 3.0
9270886 Program flow graphs are identical to program flowcharts.
92711.
9272true
92732.
9274false
92753. 4.
92762.0
9277S.NO. Questions Choices Answers
9278887 PSW is saved in stack when there is a _____.
92791.
9280interrupt recognized
92812.
9282execution of RST instruction
92833.
9284Execution of CALL instruction
92854.
9286All of these
92871.0
9288888 Quantitative methods for assessing the quality of proposed architectural designs are readily
9289available.
92901.
9291TRUE
92922.
9293FALSE
92943. 4.
92952.0
9296889 Query Tree uses
92971.
9298Relational Algebra
92992.
9300Tuple Relational Calculus
93013.
9302Domain Relational Calculus
93034.
9304All of the options
93054.0
9306890 Relations produced from an E - R model will always be in 1.3 NF 2.B CNF 3.2 NF 4.1 NF 1.0
9307891 Relocating bits used by relocating loader are specified by 1.Relocating loader itself 2.Linker 3.Assembler 4.Macro processor 2.0
9308892 Replace the page that has not be used for the longest period of time. This principle is adopted by
9309____________
93101.
9311FIFO Page replacement algorithm
93122.
9313Optimal Page replacement algorithm
93143.
9315Round robin scheduling algorithm
93164.
9317LRU Page replacement algoorithm
93184.0
9319893 Resource locking ________.
93201.
9321Allows multiple tasks to simultaneously use resource
93222.
9323Forces only one task to use any resource at any time
93243.
9325Can easily cause a dead lock condition
93264.
9327Is not used for disk drives
93282.0
9329894 Risk management is one of the most important jobs for a
93301.
9331Client
93322.
9333Investor
93343.
9335Production team
93364.
9337Project manager
93384.0
9339895 Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format.
9340The main program is loaded into memory & is executed. This type of loading is called _________ 1.Static loading 2.Dynamic loading 3.Dynamic linking 4.Overlays 3.0
9341S.NO. Questions Choices Answers
9342896 Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format.
9343The main program is loaded into memory & is executed. This type of loading is called _________
93441.
9345Static loading
93462.
9347Dynamic loading
93483.
9349Dynamic linking
93504.
9351Overlays
93523.0
9353897 Run time polymorphism is achieved by ______ 1.friend function 2.virtual function 3.operator overloading 4.function
9354overloading 2.0
9355898 S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of
93561.
9357All palindromes
93582.
9359All odd length palindromes.
93603.
9361Strings that begin and end with the same symbol
93624.
9363All even length palindromes
93642.0
9365899 1.0
93661.
9367true
93682.
9369false
93703. 4.
93712.0
9372900 SELECT department_id, AVG(salary) FROM employees WHERE AVG(salary) > 8000 GROUP
9373BY department_id
93741.
9375Displays the department ID along with the average salary of employees
9376in each department if their average of salary is greater than 8000.
93772.
9378Displays a error
93793.
9380Displays the department ID along with the average salary of employees
93814.
9382None of the options
93832.0
9384901 SELECT department_id, COUNT(last_name) FROM employees;
93851.
9386Displays a error
93872.
9388Displays the department ID along with the number of employees in each
9389department.
93903.
9391None of the options
93924.
9393Dsiplays department ID and a null value
93942.0
9395902
9396SELECT employee_id, last_name FROM employees WHERE salary = (SELECT MIN(salary)
9397FROM employees GROUP BY department_id);
93981.
9399Displays the employee_id and name of employees who gets minimum
9400salary in their department
94012.
9402Error
94033.
9404None of the options
94054.
9406Displays the employee_id, name of employees and their salary
94071.0
9408S.NO. Questions Choices Answers
9409903 SELECT last_name, SYSDATE-hire_date FROM employees;
94101.
9411Displays number of days an employee has worked in the company.
94122.
9413Displays number of months an employee has worked in the company.
94143.
9415Error
94164.
9417None of the mentioned
94181.0
9419904 Select operation in SQL is equivalent to
94201.
9421the selection operation in relational algebra
94222.
9423the selection operation in relational algebra, except that select in SQL
9424retains duplicates
94253.
9426the projection operation in relational algebra
94274.
9428the projection operation in relational algebra, except that select in SQL
9429retains duplicates
94304.0
9431905 Select the conflicting operation:
94321.
9433r1(x), w2( y )
94342.
9435r1(x), w1(x)
94363.
9437w1( y ), w2(x)
94384.
9439r1(x), w2(x)
94403.0
9441906 SELECT THE HIGHEST PRIORITY OPERATOR 1.&& 2., 3.?: 4.++ 4.0
9442907 Shift reduce parsers are 1.Vertical parser 2.top down and bottom up parser 3.Bottom up parser
94434.Top down parser 3.0
9444908 Simple network management protocol (SNMP) is implemented with a daughter board in 1.the nodes 2.the server 3.the hubs 4.a separate PC that managers the
9445network 3.0
9446909 Skewed binary trees can be efficiently represented using 1.Arrays 2.Linked lists 3.Stacks 4.Queues 2.0
9447910 2.0
94481.
9449True
94502.
9451False
94523. 4.
94531.0
9454911 Software engineering includes system engineering.
94551.
9456True
94572.
9458False
94593. 4.
94601.0
9461912 4.0
94621.Customer visible usage scenarios
94632.
9464Important software features
94653.System inputs and outputs 4.
9466ALL
94672.0
9468913 Software is a product and can be manufactured using the same technologies used for other
9469engineering artifacts.
94701.
9471True
94722.
9473False
94743. 4.
94752.0
9476S.NO. Questions Choices Answers
9477914 Software validation is achieved through a series of tests performed by the user once the software is
9478deployed in his or her work environment.
94791.
9480true
94812.
9482false
94833. 4.
94842.0
9485915 Some code optimizations are carried out on the intermediate code because
94861.
9487they enhance the portability of the compiler to other target processors
94882.
9489program analysis is more accurate on intermediate code than on machine
9490code
94913.
9492the information from dataflow analysis cannot otherwise be used for
9493optimization
94944.
9495the information from the front end cannot otherwise be used for
9496optimization
94971.0
9498916 Some code optimizations are carried out on the intermediate code because
94991.The information from data flow analysis cannot otherwise be used for
9500optimization 2.They enhance the portability of the complier to other
9501target processors 3.The information from the front end cannot otherwise
9502be used for optimization 4.Program analysis is name accurate on
9503intermediate code than on machine code
95042.0
9505917 Specify the 2 library functions to dynamically allocate memory? 1.alloc() and memalloc() 2.malloc() and calloc() 3.memalloc() and
9506faralloc() 4.malloc() and memalloc() 2.0
9507918 Spurious tuples are formed because of
95081.
9509join operation done on a non-key attribute
95102.
9511outer join operation
95123.
9513transitive dependencies
95144.
9515inner join
95161.0
9517919 SRS is also known as specification of
95181.
9519White box testing
95202.
9521Stress testing
95223.
9523Integrated testing
95244.
9525Black box testing
95264.0
9527920
9528Station A needs to send a message consisting of 9 packets to Station B using a sliding window
9529(window size 3) and go-back-n error control strategy. All packets are ready and immediately
9530available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever
9531get lost), then what is the number of packets that A will transmit for sending the message to B?
95321.
953312
95342.
953514
95363.
953716
95384.
953918
95403.0
9541S.NO. Questions Choices Answers
9542921
9543Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol.
9544The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path
9545between A and B is 128 kbps. What is the optimal window size that A should use?
95461.
954720
95482.
954940
95503.
9551160
95524.
9553320
95542.0
9555922 2.0
95561.
9557true
95582.
9559false
95603. 4.
95614.0
9562923 String length is found by the condition 1.str[i]!=NULL 2.str[i]!=sizeof(str) 3.str[i]>='\0' 4.str[i]!='\0' 4.0
9563924
9564Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements.
9565Assume that the insertion and deletion operation are carried out using REAR and FRONT as array
9566index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full
9567and queue empty are
95681.Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT 2.Full:
9569REAR == FRONT, empty: (REAR+1) mod n == FRONT 3.Full:
9570(REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR
95714.Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT
95724.0
9573925
9574Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements.
9575Assume that the insertion and deletion operation are carried out using REAR and FRONT as array
9576index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full
9577and queue empty are
95781.Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT 2.Full:
9579(REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR
95803.Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT 4.Full:
9581(FRONT+1) mod n == REAR, empty: REAR == FRONT
95821.0
9583926
9584Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They
9585are to be merged into a single sequence by merging together two sequences at a time, The number
9586of comparisons that will be needed in the worst case by the optimal algorithm for doing this is
9587____
95881.672 2.740 3.358 4.354 3.0
9589927
9590Suppose P, Q, R, S, T are sorted sequences having lengths 20,24,30,35,50 respectively. They are
9591to be merged into a single sequence by merging together two sequences at a time. The number of
9592comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____
95931.368 2.338 3.348 4.358 4.0
9594928 Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is
959546.4 micro sec. The minimum frame size is:
95961.
959794
95982.
9599416
96003.
9601464
96024.
9603512
96044.0
9605929
9606Suppose x is dead, that is, never subsequently used, at the point where the statement x=y+z
9607appears in a basic block. Then this statement may be safely removed without changing the value of
9608the basic block. This transformation is known as __________________ .
96091.Common subexpression elimination 2.Dead code elimination
96103.Renaming temporary variables 4.Loop invarient 2.0
9611930 Suppose you want to delete the name that occurs before 'Vellore' in an alphabetical listing.
9612Which of the following data structures shall be most efficient for this operation? 1.Circular linked list 2.Dequeue 3.Linked list 4.Doubly linked list 2.0
9613931 Symantec Antivirus is a customized product.
96141.
9615True
96162.
9617False
96183. 4.
96192.0
9620932 Synchronous counters eliminate the delay problems encountered with asynchronous (ripple)
9621counters because the.
96221.input clock pulses are applied simultaneously to each stage 2.input
9623clock pulses are applied only to the first and last stages 3.input clock
9624pulses are applied only to the last stage 4.input clock pulses are not used
9625to activate any of the counter stages
96264.0
9627933 Syntax for creating a RegExp object: (i). var txt=new RegExp(pattern,modifiers); (ii). var
9628txt=/pattern/modifiers; Which of the above mentioned syntax is correct? 1.(i) only 2.(ii) only 3.Both (i) and (ii) 4.None of these 3.0
9629934 Synthesized attribute can be easily simulated by a 1.LR grammar 2.Ambiguous grammar 3.LL grammar 4.LF grammer 1.0
9630935 System prototypes allow users
96311.
9632to see how well the system supports their work
96332.
9634to start working on the system
96353.
9636to put the system to production
96374.
9638to program the software
96391.0
9640S.NO. Questions Choices Answers
9641936 System reactions to external events is depicted by
96421.
9643State diagram
96442.
9645Activity diagram
96463.
9647Usecase diagram
96484.
9649Sequence diagram
96501.0
9651937 2.0
96521.
9653TRUE
96542.
9655FALSE
96563. 4.
96571.0
9658938 1.0
96591.
9660true
96612.
9662false
96633. 4.
96641.0
9665939 1.0
96661.
9667True
96682.
9669False
96703. 4.
96713.0
9672940 The --------is neither an input nor an output; it is an internal bit programmed via the PC4(Port A) or
9673PC2(Port B)bits 1.IFB 2.INTR 3.INTE 4.NMI 3.0
9674941 The ........ instruction is used to specify the number of stop bits, data bits,parity bit, and baud rate
9675clock factor for the 8251 UART 1.bit set/reset 2.Mode 3.Command 4.Code 2.0
9676942 The 1 MB byte of memory can be divided into ______ segment
96771.
96781 Kbyte
96792.
968064 Kbyte
96813.
968233 Kbyte
96834.
968434 Kbyte
96852.0
9686943 The 16 bit flag of 8086 microprocessor is responsible to indicate ___________
96871.
9688the condition of result of ALU operation
96892.
9690the condition of memory
96913.
9692the result of addition
96934.
9694the result of subtraction
96951.0
9696944
9697The 16-bit data segment value is 1000H and the offset is 2000H. calculated physical address is ----
9698- 1.10000H 2.11000H 3.12000H 4.12500H 3.0
9699945 The 16-bit stack segment value is 5D27H and the offset is 2C30H. calculated physical address is --
9700--- 1.5FFEOH 2.5FAE0H 3.5FEA0H 4.12500H 3.0
9701S.NO. Questions Choices Answers
9702946 The ___ bus controller device decodes the signals to produce the control bus signal
97031.
9704internal
97052.
9706data
97073.
9708external
97094.
9710address
97113.0
9712947 The ____ translates internet domain and host names to IP address.
97131.
9714domain name system
97152.
9716routing information protocol
97173.
9718network time protocol
97194.
9720internet relay chat
97211.0
9722948 The _______ method of an Array object adds and/or removes elements from an array.
97231.
9724Slice
97252.
9726Reverse
97273.
9728Shift
97294.
9730Splice
97314.0
9732949 The ________ ensures that only one IC is active at a time to avoid a bus conflict caused by two ICs
9733writing different data to the same bus 1.control bus 2.control instructions 3.address decoder 4.CPU 3.0
9734950 The ___________ property specifies the stack order of an element 1.d-index 2.s-index 3.x-index 4.z-index 4.0
9735951 The access method used for magnetic tape is_________
97361.
9737Direct
97382.
9739Random
97403.
9741Sequential
97424.
9743None of these
97443.0
9745952 The address resolution protocol (ARP) is used for:
97461.
9747Finding the IP address using DNS
97482.
9749Finding the IP address of the default gateway
97503.
9751Finding the IP address that corresponds to a MAC address
97524.
9753Finding the MAC address that corresponds to an IP address
97544.0
9755953 The advantage of DBMS over file systems is
97561.
9757redundancy
97582.
9759data dependence
97603.
9761multiple user
97624.
9763single user
97641.0
9765S.NO. Questions Choices Answers
9766954 1.0
97671.
9768data, hardware, software, people
97692.
9770data, documentation, hardware, software
97713.
9772data, hardware, software, procedures
97734.documentation, hardware, people, procedures
97741.0
9775955 The ASCII encoding of binary data is called
97761.
9777base 64 encoding
97782.
9779base 32 encoding
97803.
9781base 16 encoding
97824.
9783base 8 encoding
97841.0
9785956 The average time required to reach a storage location in memory and obtain its contents is called
9786the
97871.
9788seek time
97892.
9790turnaround time
97913.
9792access time
97934.
9794transfer time
97953.0
9796957 The best index for exact match query is
97971.
9798Bucket Hash
97992.
9800Quad tree
98013.
9802B Tree
98034.
9804B+ Tree
98051.0
9806958 1.0
98071.software developers do not need to do any testing
98082.a test team will test the software more thoroughly
98093.testers do not get involved with the project until testing begins
98104.arguments between developers and testers are reduced
98114.0
9812959 4.0
98131.
9814examine the system model for errors
98152.
9816have the customer look over the requirements
98173.
9818send them to the design team and see if they have any concerns
98194.
9820use a checklist of questions to examine each requirement
98212.0
9822960 The BIU contains FIFO register of size __________ bytes
98231.
98248
98252.
98266
98273.
98284
98294.
983012
98312.0
9832S.NO. Questions Choices Answers
9833961 The BIU prefetches the instruction from memory and store them in ________
98341.
9835queue
98362.
9837register
98383.
9839memory
98404.
9841stack
98421.0
9843962 The call to the parameterized constructor of base class in the derived class
98441.ppears inside the definition of the derived class constructor 2.appears
9845in the member initialization list of the derived class constructor 3.appears
9846inside the definition of the derived class 4.appears at the statement where
9847the derived class object is created
98484.0
9849963 The call to the parameterized constructor of base class in the derived class
98501.ppears inside the definition of the derived class constructor 2.appears
9851in the member initialization list of the derived class constructor 3.appears
9852inside the definition of the derived class 4.appears at the statement where
9853the derived class object is created
98544.0
9855964 The combination of Sixteen adjacent squares in four variable K-map represent the function equal
9856to 1.Four literal 2.One literal 3.Unity 4.Zero 3.0
9857965 The counters of 8253 can be operated in -------- modes of operation. 1.4 2.3 3.6 4.5 3.0
9858966 The cyclomatic complexity metric provides the designer with information regarding the number of
98591.
9860cycles in the program
98612.
9862errors in the program
98633.
98643.0independent logic paths in the program
98654.
9866statements in the program
98674.0
9868967 The data structure required for Breadth First Traversal on a graph is 1.tree 2.array 3.stack 4.queue 4.0
9869968 THE DATA TYPE IS ALL ABOUT 1.NAME VALUE ADDRESS 2.BITS BYTES WORD 3.SIZE LIMITS
9870RESTRICTIONS 4.TYPE SIZE RANGE 4.0
9871969 The decimal equivalent of hexadecimal number of ‘A580’ is 1.43286 2.42368 3.43288 4.48632 2.0
9872970 The default copy constructor performs 1.Deep Copy 2.Shallow Copy 3.Soft Copy 4.Hard Copy 2.0
9873971
9874The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in
9875decreasing order. Which of the following sequences can not be the degree sequence of any graph?
9876I. 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
98771.IV only 2.III and IV 3.I and II 4.II and IV 4.0
9878972 The design process related to data structures and their representation is
98791.
9880Architectural design
98812.
9882Interface design
98833.
9884Component design
98854.
9886Database design
98874.0
9888973 The difference between linear array and a record is
98891.A record form a hierarchical structure but a linear array does not 2.All
9890of above 3.An array is suitable for homogeneous data but the data items
9891in a record may have different data type 4.In a record, there may not be a
9892natural ordering in opposed to linear array
98933.0
9894974 The Document object is which part of the object? 1.Tree 2.System 3.Window 4.Screen 3.0
9895975 The efficient data structure to insert/delete a number in a stored set of numbers is 1.Queue 2.Linked list 3.Doubly linked list 4.Binary tree 2.0
9896976 The entity relationship diagram
98971.
9898depicts relationships between data objects
98992.
9900depicts functions that transform the data flow
99013.
9902indicates how data are transformed by the system
99034.
9904indicates system reactions to external events
99051.0
9906977
9907The ESC instruction of 8086 may have two formats. In one of the formats, no memory operand is
9908used. Under this format, the number of external op-codes (for the co- processor) which can be
9909specified is
99101.64 2.128 3.256 4.512 2.0
9911S.NO. Questions Choices Answers
9912978 The external system bus architecture is created using from ______ architecture
99131.
9914Pascal
99152.
9916Dennis Ritchie
99173.
9918Charles Babbage
99194.
9920Von Neumann
99214.0
9922979 The file transfer protocol is built on
99231.
9924data centric architecture
99252.
9926service oriented architecture
99273.
9928client server architecture
99294.
9930peer to peer architecture
99313.0
9932980 The first processor to include Virtual memory in the Intel microprocessor familywas 1.Pentium 2.80486 3.80286 4.80386 3.0
9933981 The following is not a Relational Model Constraint 1.Referential Integrity Constraint 2.Check Constraint 3.Foreign Key
9934Constraint 4.Entity Integrity Constraint 1.0
9935982 The following SQL is which type of join: SELECT CUSTOMER_T. CUSTOMER_ID,
9936ORDER_T. CUSTOMER_ID, NAME, ORDER_ID FROM CUSTOMER_T,ORDER_T ;
99371.
9938Equi-join
99392.
9940Natural join
99413.
9942Outer join
99434.
9944Cartesian join
99454.0
9946983 4.0
99471.
9948Define the specification for computer-based system
99492.
9950Develop defect free computer-based systems
99513.
9952Verify the correctness of computer-based systems
99534.
9954ALL
99551.0
9956984 The function used to remove the leading spaces is
99571.
9958ltrim
99592.
9960lpad
99613.
9962rpad
99634.
9964rtrim
99651.0
9966985 The goal of product engineering is to translate the customer's desire for a set of defined capabilities
9967into a working product.
99681.
9969TRUE
99702.
9971FALSE
99723. 4.
99731.0
9974S.NO. Questions Choices Answers
9975986 The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is
99761.
9977ambiguous
99782.
9979left-recursive
99803.
9981right-recursive
99824.
9983an operator-grammar
99842.0
9985987 The grammar S → aSa | bS | c is
99861.
9987LL(1) but not LR(1)
99882.
9989LR(1)but not LR(1)
99903.
9991Both LL(1)and LR(1)
99924.
9993Neither LL(1)nor LR(1)
99943.0
9995988 The Hardware mechanism that enables a device to notify the CPU is called __________.
99961.
9997Polling
99982.
9999Interrupt
100003.
10001Systems Call
100024.
10003None of these
100042.0
10005989 The high paging activity is called ________
100061.
10007Inter process communication
100082.
10009Thrashing
100103.
10011Context Switching
100124.
10013Working Set
100142.0
10015990 The IC 8237 is a
100161.
10017DMA Controller
100182.
10019Interrupt Controller
100203.
10021Keyboard controller
100224.
10023Serial Interface Controller
100241.0
10025991 The IC 8251 A has ---------------------many pins
100261.
1002724
100282.
1002928
100303.
1003140
100324.
1003330
100343.0
10035S.NO. Questions Choices Answers
10036992 The IC 8254 has ---------------------many pins
100371.
1003824
100392.
1004028
100413.
1004234
100434.
1004440
100451.0
10046993 The IC 8254 has ----------------many 16 bit counters
100471.
100481
100492.
100502
100513.
100523
100534.
100544
100553.0
10056994 The IC 8279 has ----------------------many pins
100571.
1005820
100592.
1006030
100613.
1006240
100634.
1006410
100654.0
10066995 The IC Number for USART is --------------------------
100671.
10068IC 8251A
100692.
10070IC8259
100713.
10072IC5255
100734.
10074IC 8254
100751.0
10076996 The idea of cache memory is based
100771.
10078on the property of locality of reference
100792.
10080on the heuristic 90-10 rule
100813.
10082on the fact that references generally tend to cluster
100834.
10084all of these
100851.0
10086997 The importance of software design can be summarized in a single word
100871.
10088accuracy
100892.
10090complexity
100913.
100924.0efficiency
100934.
10094quality
100953.0
10096S.NO. Questions Choices Answers
10097998 The Incremental Model is a result of combination of elements of which two models?
100981.
10099Build & FIX Model & Waterfall Model
101002.
10101Linear Model & RAD Model
101023.
10103Linear Model & Prototyping Model
101044.
10105Waterfall Model & RAD Model
101063.0
10107999 The incremental model of software development is
101081.
10109A reasonable approach when requirements are well defined.
101102.
10111A good approach when a working core product is required quickly.
101123.
10113The best approach to use for projects with large development teams.
101144.
10115A revolutionary model that is not used for commercial products.
101162.0
101171000 The intel 8086 microprocessor is a _______ processor
101181.
101198 bit
101202.
1012116 bit
101223.
1012332 bit
101244.
101254bit
101262.0
101271001 The internal block diagram of 80286 contains ---- functional parts. 1.6 2.4 3.2 4.8 2.0
101281002 The interrupt cycle ends when the ........... instruction is executed 1.IRET 2.CALL 3.PUSH 4.POP 3.0
101291003 The intersection of CFL and regular language
101301.
10131Is always regular and context free
101322.
10133Is always regular
101343.
10135Is always context free
101364.
10137Need not be regular
101383.0
101391004 The IP is ________ bits in length
101401.
101418 bits
101422.
101434 bits
101443.
1014516 bits
101464.
1014732 bits
101484.0
101491005 The javascript statement a===b refers to
101501.
10151Both a and b are equal in value, type and reference address
101522.
10153Both a and b are equal in value
101543.
10155Both a and b are equal in value and type
101564.
10157There is no such statement
101583.0
10159S.NO. Questions Choices Answers
101601006 The kernel keeps track of the state of each task by using a data structure called __
101611.
10162Process control block
101632.
10164Process Status Word
101653.
10166Memory control block
101674.
10168None of these
101691.0
101701007 The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described
10171as
101721.
10173Regular
101742.
10175context free
101763.
10177Recursive
101784.
10179Deterministic context free
101801.0
101811008 The language L= {0 21 | i≥0 } over the alphabet {0,1, 2} is:
101821.
10183not recursive
101842.
10185is recursive and is a deterministic CFL
101863.
10187is a regular language
101884.
10189is not a deterministic CFL but a CFL
101902.0
101911009 The language that the computer can understand and execute is called ______
101921.
10193Machine language
101942.
10195Application software
101963.
10197System program
101984.
10199None of these
102001.0
102011010 The language {a b C | m, n ≥ 1} is
102021.
10203Regular language
102042.
10205context free but not regular
102063.
10207context sensitive but not context free
102084.
10209type-0 but not context sensitive
102102.0
102111011
10212The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is
10213______________.
10214a*b*(ba)*a*
102151.
102162
102172.
102183
102193.
102204
102214.
102225
102232.0
102241012 The length property belongs to which of the following objects? 1.Window 2.Element 3.History 4.Document 2.0
102251013 The levels of hierarchy in inheritance helps to handle 1.flexibility 2.complexity 3.detailed information 4.security 4.0
10226S.NO. Questions Choices Answers
10227i i
10228m n m+n
102291014
10230The lexical analysis for a modern language such as Java needs the power of which one of the
10231following machine models in a necessary and sufficient sense?
102321.
10233Deterministic pushdown automata
102342.
10235Finite state automata
102363.
10237Non-deterministic pushdown automata
102384.
10239Turing machine
102402.0
102411015 The library function used to find the last occurrence of a character in a string is 1.strnstr() 2.laststr() 3.strrchr() 4.strstr() 3.0
102421016 The linear sequential model of software development is
102431.
10244A reasonable approach when requirements are well defined.
102452.
10246A good approach when a working program is required quickly.
102473.
10248The best approach to use for projects with large development teams.
102494.
10250An old fashioned model that cannot be used in a modern context.
102511.0
102521017 The linear sequential model of software development is also known as the
102531.
10254Classical life cycle model
102552.
10256Spiral model
102573.
10258Waterfall model
102594.
10260Incremental Model
102613.0
102621018 The load instruction is mostly used to designate a transfer from memory to a processor register
10263known as____.
102641.
10265Accumulator
102662.
10267Instruction Register
102683.
10269Program counter
102704.
10271Memory address Register
102721.0
102731019 The main purpose of a data link content monitor is to
102741.detect problems in protocols 2.determine the type of switch used in a
10275data link 3.determine the flow of data 4.determine the type of switching
10276used in data link
102771.0
102781020 The maximum number of superkeys for the relation schema R(E,F,G,H) with E as the key is
102791.
102807
102812.
102828
102833.
102849
102854.
102866
102872.0
10288S.NO. Questions Choices Answers
102891021 The maximum size of payload field in ethernet frame is
102901.
102911000 bytes
102922.
102931200 bytes
102943.
102951300 bytes
102964.
102971500 bytes
102984.0
102991022
10300The maximum window size for data transmission using the selective reject protocol with n-bit
10301frame sequence numbers is:
103021.
103032^n
103042.
103052^(n-1)
103063.
103072^n – 1
103084.
103092^(n-2)
103102.0
103111023 The MC 1488 is
103121.
10313TTL to RS 232C Level converter
103142.
10315RS-232 to TTL level converter
103163.
10317Bidirectional Level converter
103184.
10319Unidirectional level converter
103201.0
103211024 The mechanism that bring a page into memory only when it is needed is called ______
103221.
10323Segmentation
103242.
10325Fragmentation
103263.
10327Demand Paging
103284.
10329Page Replacement
103303.0
103311025 The members of a class, by default, are 1.private 2.protected 3.public 4.mandatory to specify 3.0
103321026 The memory unit that communicates directly with the CPU is called the
103331.
10334main memory
103352.
10336Secondary memory
103373.
10338shared memory
103394.
10340auxiliary memory
103411.0
103421027 The microprocessor can read/write 16 bit data from or to ________
103431.
10344memory
103452.
10346I /O device
103473.
10348processor
103494.
10350register
103511.0
10352S.NO. Questions Choices Answers
103531028 The microprocessor determines whether the specified condition exists or not by testing the
10354______
103551.
10356carry flag
103572.
10358conditional flag
103593.
10360common flag
103614.
10362sign flag
103632.0
103641029 The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X^5 +
103654X^3 + 6^X + 5 for a given value of X using only one temporary variable is. 1.6 2.9 3.8 4.7 4.0
103661030 The minimum number of arithmetic operations required to evaluate the polynomial
10367P(X)=X^5+4X^3+6^X+5 for a given value of X using only one temporary variable. 1.6 2.7 3.8 4.9 2.0
103681031 The minimum number of nodes in a binary tree of depth d (root at level 0) is 1.2d - 1 2.d + 1 3.2d + 1 - 1 4.d 2.0
103691032
10370The MMU (Memory Management Unit) is a
103711.
10372Hardware
103732.
10374Software
103753.
10376Firmware
103774.
10378Malware
103791.0
103801033 The nature of collaboration is such that all system requirements are defined by consensus of a
10381committee of customers and developers.
103821.
10383TRUE
103842.
10385FALSE
103863. 4.
103872.0
103881034 The node type for document returns the value ---. 1.2 2.9 3.3 4.8 4.0
103891035 The number of auxiliary memory required for a Push Down Machine (PDM) to behave like a Finite
10390State Machine (FSM) is
103911.
103920
103932.
103942
103953.
103964
103974.
103981
103991.0
104001036 The number of clock pulses needed to shift one byte of data from input to the output of a 4-bit shift
10401register is. 1.10 2.12 3.16 4.32 3.0
104021037 The number of components in a graph with n nodes and 1 edge are 1.n 2.n-2 3.n-1 4.n-3 3.0
104031038 The number of components in a graph with n nodes and 1 edge are 1.n 2.n-2 3.n-1 4.n-3 3.0
104041039 The number of counters available in internal block diagram of 8253 is 1.2 2.1 3.3 4.4 3.0
104051040 The number of states in DFA is --------than the number of states in NFA for the same Language.
104061.
10407Greater
104082.
10409less
104103.
10411greater equal
104124.
10413equal
104142.0
104151041 The number of tokens in the following C statement is 2.0 4.0
104161042 The operation of processing each element in the list is known as 1.Sorting 2.Merging 3.Inserting 4.Traversal 4.0
104171043 The other name for MODE 0 in 8253 timer is 1.software triggered strobe 2.Programmable one shot 3.Interrupt on
10418terminal count 4.Square wave rate generator 3.0
10419S.NO. Questions Choices Answers
10420printf("i = %d, &i = %x", i, &i);
104211044 The physical layer concerns with
104221.
10423bit-by-bit delivery
104242.
10425process to process delivery
104263.
10427application to application delivery
104284.
10429Hop by hop delivery
104301.0
104311045 The physical layer is responsible for
104321.
10433line coding
104342.
10435channel coding
104363.
10437modulation
104384.
10439all of the mentioned
104404.0
104411046 The physical layer translates logical communication requests from the ______ into hardware
10442specific operations.
104431.
10444data link layer
104452.
10446network layer
104473.
10448trasnport layer
104494.
10450application layer
104511.0
104521047 The pop() method of the array in javascript does which of the following task ?
104531.
10454decrements the total length by 1
104552.
10456increments the total length by 1
104573.
10458prints the first element but no effect on the length
104594.
10460don't return the value of deleted element
104611.0
104621048 The portion of physical layer that interfaces with the media access control sublayer is called
104631.
10464physical signalling sublayer
104652.
10466physical data sublayer
104673.
10468physical address sublayer
104694.
10470none of the mentioned
104711.0
104721049 The postfix expression for * + a b - c d is? 1.ab + cd - * 2.ab + cd * - 3.ab + - cd * 4.ab cd + - * 1.0
104731050 The postfix form of the expression (A+ B)*(C*D- E)*F / G is 1.AB + CD* E - *F *G / 2.AB + CD* E - F **G / 3.AB+ CD*E - FG /**
104744.AB + CDE * - * F *G / 3.0
104751051 The preorder traversal sequence of a binary search tree is 30,20,10,15,25,23,39,35,42. Which one
10476of the following is the postorder traversal sequence of the same tree?
104771.10,20,15,23,25,35,42,39,30 2.15,10,25,23,20,42,35,39,30
104783.15,20,10,23,25,42,35,39,30 4.15,10,23,25,20,35,42,39,30 4.0
10479S.NO. Questions Choices Answers
104801052 The process of retaining data for future use is called
104811.
10482reading
104832.
10484writing
104853.
10486storing
104874.
10488coding
104893.0
104901053
10491The project planner examines the statement of scope and extracts all important software functions
10492which is known as
104931.
10494Association
104952.
10496Decomposition
104973.
10498Planning process
104994.
10500ALL
105013.0
105021054 3.0
105031.
10504Another name for component-based development.
105052.
10506Another name for component-based development.
105073.
10508A high speed adaptation of the linear sequential model.
105094.
10510ALL
105114.0
105121055 The RDBMS terminology for a row is
105131.attribute
105142.relation
105153.degree
105164.tuple
105174.0
105181056 The recognizing capabilities of NDFSM and DFSM
105191.
10520may be different
105212.
10522must be different
105233.
10524must be same
105254.
10526none of the mentioned
105273.0
105281057 The relational model uses some unfamiliar terminology. A tuple is equivalence to a: 1.record 2.field 3.file 4.database 1.0
105291058 The removal of process from active contention of CPU and reintroduce them into memory later is
10530known as ____________
105311.
10532Interrupt
105332.
10534Swapping
105353.
10536Signal
105374.
10538Thread
105392.0
105401059 The restriction while using the binary search is ? 1.List should be small in number 2.List should be large in number 3.List
10541should be sorted 4.No restriction 3.0
105421060 The result evaluating the postfix expression (10 5 + 60 6 / * 8 –) is 1.284 2.142 3.213 4.71 2.0
105431061 The searching technique that takes O (1) time to find a data is 1.Binary Search 2.Linear Search 3.Tree Search 4.Hashing 4.0
10544S.NO. Questions Choices Answers
105451062 The segment number S is legal if
105461.
10547S < STBR
105482.
10549S > STBR
105503.
10551S < STLR
105524.
10553S > STLR
105543.0
105551063 The simplest image processing technique is
105561.coordinates transformation 2.intensity transformation 3.spatial
10557transformation 4.domain transformation 1.0
105581064 The situation when in a linked list START=NULL is 1.overflow 2.underflow 3.housefull 4.saturated 2.0
105591065 The smallest element of an array’s index is called its 1.lower bound 2.range
10560D. extract 3.upper bound 4.ion 1.0
105611066 The smallest finite automation which accepts the language {x | length of x is divisible by 3} has :
105621.
105632 states
105642.
105653 states
105663.
105674 states
105684.
105695 states
105703.0
105711067 The space factor when determining the efficiency of algorithm is measured by
105721.Counting the average memory needed by the algorithm 2.Counting the
10573minimum memory needed by the algorithm 3.Counting the maximum
10574memory needed by the algorithm 4.Counting the maximum disk space
10575needed by the algorithm
105763.0
105771068 4.0
105781.
10579Ends with the delivery of the software product
105802.
10581Is not more chaotic than the incremental model
105823.Do not Include project risks evaluation during each iteration 4.Includes
10583feasibility risks
105842.0
105851069 The spiral model was originally proposed by
105861.
10587IBM
105882.
10589Barry Boehm
105903.
10591Pressman
105924.
10593Royce
105942.0
105951070 The SQL BETWEEN operator
105961.
10597Specifies a range to test
105982.
10599specifies between which tables the data is present
106003.
10601specifies the columns between which columns the data is present
106024.
10603None of the options
106041.0
106051071 The starting address for counter 0 of 8253 is 0038H, then port address for control word register is 1.44H 2.49H 3.42H 4.46H 3.0
10606S.NO. Questions Choices Answers
106071072 The state diagram
106081.
10609depicts relationships between data objects
106102.
10611depicts functions that transform the data flow
106123.
10613indicates how data are transformed by the system
106144.
10615indicates system reactions to external events
106161.0
106171073 The status that cannot be operated by direct instructions is 1.Z 2.Cy 3.P 4.AC 4.0
106181074 The stream insertion operator should be overloaded as 1.friend functions 2.member function 3.non member functions 4.static
10619functions 4.0
106201075 The stream insertion operator should be overloaded as 1.friend functions 2.member function 3.non member functions 4.static
10621functions 4.0
106221076 The switching method fixes the path from source to destination is _________ 1.circuit switching 2.Message Switching 3.Packet switching 4.Frame
10623Relay 1.0
106241077 The syntax of Eval is ___________ 1.[objectName.]eval(numeriC) 2.[objectName.]eval(string) 3.
10625[EvalName.]eval(string) 4.[EvalName.]eval(numeriC) 2.0
106261078 The system engineering process usually begins with the
106271.
10628detailed view
106292.
10630domain view
106313.
106324.0element view
106334.
10634world view
106351.0
106361079 1.0
106371.
10638Function, performance and constraints of a computer-based system
106392.
10640implementation of each allocated system
106413.
10642element software architecture
106434.time required for system simulation
106443.0
106451080 The tightest upper bound for the worst case performance of quicksort implemented on an array of
10646n elements by always chosing the pivot as the central element is 1.T(n! logn) 2.O(n logn) 3.O(n^2) 4.O(n^3) 3.0
106471081 The time complexity to build a heap with a list of n numbers is 1.O(n logn) 2.O(n) 3.O(log n) 4.O(n2) 2.0
106481082 The topology with highest reliability is ......................... 1.ring topology 2.star topology 3.bus topology 4.mesh topology 4.0
106491083
10650The total number of pins for the IC 8255 is
106511.
1065228
106532.
1065440
106553.
1065630
106574.
1065820
106592.0
106601084 The two statements that can be used to change the flow of control are 1.switch and do-while 2.if and while 3.if and switch 4.break and
10661continue 3.0
106621085 The UNION SQL clause can be used with…
106631.
10664none of the options
106652.
10666the SELECT clause only
106673.
10668the UPDATE clause only
106694.
10670the DELETE and UPDATE clauses
106712.0
10672S.NO. Questions Choices Answers
106731086 The use of traceability tables helps to
106741.
10675debug programs following the detection of run-time errors
106762.
10677determine the performance of algorithm implementations
106783.
10679identify, control, and track requirements changes
106804.Analyze design changes
106813.0
106821087 The value in AL=11011010 after the operation of CBW, the result is 1.AX=1101 1010 1111 1111 2.AX=1101 1010 0000 0000
10683. 3.AX=1111 1111 1101 1010 4.AX=0000 0000 1101 1010 3.0
106841088 The virtual file system provides us the following
106851.
10686Object oriented file implementation
106872.
10688Structured programming file implementation
106893.
10690Linked file allocation
106914.
10692Indexed file allocation
106932.0
106941089 The work of EU is ________
106951.
10696encoding
106972.
10698decoding
106993.
10700processing
107014.
10702calculations
107033.0
107041090 2.0
107051.
10706size of the budget
107072.
10708size of the product being built
107093.
10710software process being used
107114.
10712stakeholders needs
107133.0
107141091 The worst case running time to search for an element in a balanced binary search tree with n*2^n
10715elements is 1.theta(n log n) 2.theta(n*2^n) 3.theta(n) 4.theta(log n) 3.0
107161092 The worst case running time to search for an element in a balanced in a binary search tree with
10717n*2^n elements is 1.theta(n log n) 2.theta(n*2^n) 3.theta(n) 4.theta(log n) 3.0
107181093 There are n stations in a slotted LAN. Each station attempts to transmit with a probability p in each
10719time slot. What is the probability that only one station transmits in a given time slot?
107201.
10721(1-p)^(n-1)
107222.
10723np(1-p)^(n-1)
107243.
10725p(1-p)^(n-1)
107264.
107271-(1-p)^(n-1)
107282.0
107291094 There is no connection setup phase in __________ 1.Frame relay 2.Virtual Circuit Switching 3.Datagram 4.ATM 3.0
107301095 Thrashing occurs ________
107311.
10732when excessive swapping takes place
107332.
10734when you thrash your computer
107353.
10736whenever deadlock occurs
107374.
10738when no swapping takes place
107391.0
10740S.NO. Questions Choices Answers
107411096 Thresholding function in contrast stretching creates 1.binary image 2.high quality image 3.low quality image 4.enhanced
10742image 1.0
107431097 To create an alias Objects have to be passed by 1.address 2.reference 3.value 4.field by field 2.0
107441098 To Delete an item from a Queue identify the correct set of statements 1.Q[REAR] = item; REAR ++ 2.item = Q[FRONT]; FRONT++ 3.item =
10745Q[REAR]; FRONT ++ 4.item = Q[FRONT]; REAR ++ 2.0
107461099 To determine the architectural style or combination of styles that best fits the proposed system,
10747requirements engineering is used to uncover
107481.
10749algorithmic complexity
107502.
10751characteristics and constraints
107523.
10753control and data
107544.
10755design patterns
107562.0
107571100 To interface memory with the microprocessor, connect register the lines of the address bus
10758must be added to address lines of the _______ chip.
107591.
10760single
107612.
10762memory
107633.
10764multiple
107654.
10766triple
107672.0
107681101 To operate correctly, starting a ring counter requires
107691.presetting all the flip-flops 2.clearing one flip-flop and presetting all
10770the others 3.presetting one flip-flop and clearing all the others 4.clearing
10771all the flip-flops
107721.0
107731102 Today the increased power of the personal computer has brought about an abandonment of the
10774practice of team development of software
107751.
10776True
107772.
10778false
107793. 4.
107801.0
107811103 Trigger is a
107821.Statement that enables to start any DBMS 2.Statement that is executed
10783by the user when debugging an application program 3.Statement that is
10784executed automatically by the system as a side effect of a modification to
10785the database 4.Condition the system tests for the validity of the database
10786user
107873.0
107881104
10789Two computers C1 and C2 are configured as follows. C1 have IP address as 203.197.2.53 and
10790netmask 255.255.128.0. C2 have IP address as 203.197.75.201 and netmask 255.255.192.0. Which
10791one of the following statements is true?
107921.
10793C1 and C2 both assume they are on the same network
107942.
10795C2 assumes C1 is on same network, but C1 assumes C2 is on a different
10796network
107973.
10798C1 assumes C2 is on same network, but C2 assumes C1 is on a different
10799network
108004.
10801C1 and C2 both assume they are on different networks.
108023.0
108031105 Two sets of functional dependencies E and F are equivalent if E+ = F+ .This statement is
108041.
10805True
108062.
10807False
108083.
10809Cant Say
108104.
108111.0
108121106 Updating a database means 1.deleting database 2.modifying or adding record occurrences 3.revising
10813the file structure 4.reorganizing the database 2.0
10814S.NO. Questions Choices Answers
108151107 Usability questionnaires are most meaningful to the interface designers when completed by
108161.
10817customers
108182.
108193.0experienced programmers
108203.
10821product users
108224.
10823project managers
108242.0
108251108 Using linked list node representation, inserting a node in general tree is performed efficently 1.not possible 2.by merging with an existing node 3.after introducing a
10826new link 4.after converting to binary tree 2.0
108271109 Using the 8259A, the INT input of the 8086 can be expanded to accomodeate up to ---------------
10828prioritized interrupt inputs 1.60 2.64 3.16 4.32 2.0
108291110 Usually a pure virtual function 1.Will be called only to delete an object 2.Is defined only in derived class
108303.Will never be called 4.Has complete function body 2.0
108311111 Virtual memory is the portion of _______.
108321.
10833RAM
108342.
10835Cache Memory
108363.
10837Hard Disc
108384.
10839None of these
108403.0
108411112 Voice privacy in GSM cellular telephone protocol is provided by
108421.
10843A5/2 cipher
108442.
10845b5/4 cipher
108463.
10847b5/6 cipher
108484.
10849b5/8 cipher
108501.0
108511113 VOLATILE MEMORY IS ________________ ? 1.COMPACT DISK 2.HARD DISK 3.RANDOM ACCESS MEMORY
108524.READ ONLY MEMORY 3.0
108531114 1.0
108541.
10855architecture, interface, component
108562.
10857cost, risk, schedule
108583.
10859Information, function, behavior
108604.
10861NONE
108621.0
108631115
10864What assess the risk and your plans for risk mitigation and revise these when you learn more about
10865the risk?
108661.
10867Risk monitoring
108682.
10869Risk planning
108703.
10871Risk analysis
108724.
10873Risk identification
108741.0
10875S.NO. Questions Choices Answers
108761116 What characteristic of RAM memory makes it not suitable for permanent storage?
108771.
10878too slow
108792.
10880unreliable
108813.
10882it is volatile
108834.
10884too bulky
108853.0
108861117 What do the 'c' and 'v' in argv stands for?
108871.'c' means argument count 'v' means argument vector 2.'c' means
10888argument count 'v' means argument vertex 3.'c' means argument
10889configuration 'v' means argument visibility 4.'c' means argument control
10890'v' means argument vector
108911.0
108921118 What does /[^(]* regular expression indicate ?
108931.Match one or more characters that are not open paranthesis 2.Match
10894zero or more characters that are open paranthesis 3.Match zero or more
10895characters that are not open paranthesis 4.Match one or more characters
10896that are open paranthesis
108972.0
108981119 What does explode function in php do
108991.Used to convert a string to an array 2.Used to split a given string into
10900the number of chunks specified 3.Used to split a string by a string 4.Used
10901to split string into two equal halves
109021.0
109031120 What does microprocessor speed depends on 1.Clock 2.Address bus width 3.Data bus width 4.Size of register 2.0
109041121 What does parseFloat(9+10) evaluates to in JavaScript? 1.19 2.910 3.9109 4.91 1.0
109051122 What does the following declaration mean?
10906int (*ptr)[10];
109071.ptr is array of pointers to 10 integers 2.ptr is a pointer to an array of 10
10908integers 3.ptr is an array of 10 integers 4.ptr is an pointer to array 2.0
109091123
10910What elements will the following script output?
10911<?php
10912$array = array (true => 'a', 1 => 'b');
10913var_dump ($array);
10914?>
109151.
109161 => 'b'
109172.
10918True => 'a', a => 'b'
109193.
10920NULL
109214.
109220 => 'a', 1 => 'b'
109233.0
109241124 What gets printed? $str = 'a\\b\n'; echo $str; 1.ab(newline) 2.a\b(newline) 3.a\b\n 4.a\\b(newline) 3.0
109251125 What happens if no file path is given in include() function? 1.PHP continues to execute the script. 2.Results in a fatal error
109263.Include_path is made use of 4.It haults the script. 3.0
109271126 What is a Software ?
109281.
10929Software is set of programs
109302.
10931Software is documentation and configuration of data
109323.
10933Software is set of programs and Software is documentation and
10934configuration of data
109354.
10936Software is a set of documents.
109373.0
109381127 What is asynchronous counter.
109391.none of them 2.A master clock triggers all the flip-flops at a time 3.all
10940the flip-flop are combined to common clock 4.each flip-flop has it own
10941clock
109424.0
109431128 What is data encryption standard (DES)?
109441.
10945block cipher
109462.
10947stream cipher
109483.
10949bit cipher
109504.
10951none of the mentioned
109521.0
10953S.NO. Questions Choices Answers
109541129 What is interframe gap?
109551.
10956idle time between frames
109572.
10958idle time between frame bits
109593.
10960idle time between packets
109614.
10962none of the mentioned
109631.0
109641130 What is meant by parallel-loading the register?
109651.Shifting the data in all flip-flops simultaneously 2.Loading data in two
10966of the flip-flops 3.Loading data in all flip-flops at the same time
109674.Momentarily disabling the synchronous SET and RESET inputs
109683.0
109691131 What is the best case for linear search 1.O(n) 2.O(1) 3.O(log n) 4.O(2n) 2.0
109701132 What is the code to start displaying the time when document loads? 1.onload = displayTime; 2.window. = displayTime; 3.window.onload =
10971displayTime; 4.window.onload = start; 3.0
109721133 What is the condition for resetting(s=0) the S flag in status register? 1.MSB of the result is One 2.MSB of the result is zero 3.LSB of the
10973result is one 4.LSB of the result is zero 2.0
109741134 What is the correct CSS syntax for making all the elements bold? 1.p {font-weight:bold;} 2.p style="text-size:bold" 3.p {text-size:bold}
109754.p style="font-size:bold"> 1.0
109761135 What is the correct way to connect to a MySQL database?
109771.mysqli_db(host,username,password,dbname);
109782.mysqli_connect(host,username,password,dbname);
109793.mysqli_open(host,username,password,dbname);
109804.
10981mysqli_connect(,,)
109822.0
109831136 What is the data structures used to perform recursion? 1.list 2.queue 3.stack 4.Tree 3.0
109841137 What is the default execution time set in set_time_limit()? 1.20 secs 2.30 secs 3.40 secs 4.50 secs 2.0
109851138 What is the default size of a file set in upload_max_filesize ? 1.1 MB 2.2 MB 3.2.5 MB 4.3 MB 2.0
109861139 What is the difference between echo and print?
109871.They both behave the same. 2.Print can take multiple parameters where
10988as echo cannot 3.Echo can take multiple parameters where as print
10989cannot 4.Print is a function where as echo is not.
109903.0
109911140 What is the following style an example of? img[alt~="Pie"] 1.Attribute Match 2.Exact Value Match 3.Contains Value Match
109924.Subcode Match 3.0
109931141 What is the highest normal form level satisfied by the following table design? R=
10994{A1,A2,A3,A4,A4} F={A1-> A3, A3->A4}Key ={A1,A2}
109951.
109961 NF
109972.
109982 NF
109993.
110003 NF
110014.
11002BCNF
110032.0
110041142 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no
11005epsilon- and unit-production (i.e., of type A -> Ñ” and A -> a) to parse a string with n tokens?
110061.
11007n/2
110082.
11009n-1
110103.
110112n-1
110124.
110132^n
110142.0
110151143 What is the maximum size of data that the application layer can pass on to the TCP layer below?
110161.
11017Any size
110182.
110192^16 bytes-size of TCP header
110203.
110212^16 bytes
110224.
110231500 bytes
110241.0
110251144 What is the minimum number of NAND gates required to implement A + AB` + AB`C? 1.0 2.1 3.2 4.3 1.0
110261145 What is the most essential purpose of paranthesis in regular expressions?
110271.Define pattern matching techniques 2.Define subpatterns within the
11028complete pattern 3.Define portion of strings in the regular expression
110294.All of the mentioned
110302.0
11031S.NO. Questions Choices Answers
110321146 what is the need of segmenting the memory in 8086 1.Increase the memory accessibility 2.Increase the memory addressibility
110333.easy to retrieve data 4.faster access 2.0
110341147 What is the normal order of activities in which traditional software testing is organized? a.
11035integration testing b. system testing c. unit testing d.validation testing
110361.
11037a, d, c, b
110382.
11039b, d, a, c
110403.
110413.0c, a, d, b
110424.
11043d, b, c, a
110441.0
110451148 What is the order of the stages in the waterfall mode?
110461.
11047Requirements Definition, System & Software Design, Implementation &
11048Unit Testing, Integration & System Testing, Operation & Maintenance.
110492.
11050Requirements Definition, Integration & System Testing, System &
11051Software Design, Implementation & Unit Testing, Operation &
11052Maintenance.
110533.
11054System & Software Design, Requirements Definition, Operation &
11055Maintenance, Implementation & Unit Testing, Integration & System
11056Testing.
110574.
11058Implementation & Unit Testing, Requirements Definition, System &
11059Software Design, Integration & System Testing, Operation &
11060Maintenance.
110611.0
110621149 what is the output for the following function? LPAD(salary,10,'*')
110631.
1106410***24000
110652.
11066*****24000
110673.
1106824000*****
110694.
11070error
110712.0
110721150
11073What is the output?
11074#include <stdio.h>
11075void main()
11076{
11077int a=3,b=2;
11078a=a==b==0;
11079printf("%d,%d",a,b);
11080}
110811.
110821,2
110832.
110843,2
110853.
110860,0
110874.
110882,3
110891.0
110901151 What is the purpose of $_SESSION[]?
110911.
11092Used to register a global variable
110932.
11094Used to initialize a session
110953.
11096Used to store variables of the current session
110974.
11098Used to initialize a cookie
110993.0
111001152 What is the result of the following code snippet? window.location === document.location 1.False 2.True 3.0 4.1 2.0
111011153 What is the strpos() function used for?
111021.Find the last occurrence of the string within a string 2.Find the first
11103occurrence of the string within a string 3.Find both last and first
11104occurence 4.Search for all occurrence within a string
111052.0
111061154 What is the time complexity for binary search 1.O(log n) 2.O(n^2) 3.O(1) 4.O(2n) 1.0
111071155 What is the time complexity for insertion sort 1.O(log n) 2.O(n) 3.O(n^2) 4.O(1) 3.0
111081156 What is the worst case for Selection sort 1.O(log n) 2.O(2n) 3.O(n) 4.O(n^2) 4.0
11109S.NO. Questions Choices Answers
111101157 What is Wired Equivalent Privacy(WEP)?
111111.
11112security algorithm for ethernet
111132.
11114security algorithm for wireless networks
111153.
11116security algorithm for USB
111174.
11118None
111192.0
111201158 What is WPA?
111211.
11122wi-fi protected access
111232.
11124wired protected access
111253.
11126wired process access
111274.
11128wi-fi process access
111291.0
111301159 What is x+ mode in fopen() used for?
111311.
11132Read/Write. Creates a new file. Returns FALSE and an error if file
11133already exists
111342.
11135Write only. Creates a new file. Returns TRUE and an error if file already
11136exists
111373.
11138Read/Write. Opens and clears the contents of file
111394.
11140Write. Opens and clears the contents of file
111411.0
111421160 What keyword covers unhandled possibilities? 1.other 2.default 3.contingency 4.all 2.0
111431161
11144What kind of schema it is?
11145Student(sid, sname, dob, address, pincode)
111461.Relaional
111472.Logical Schema
111483.Conceptual Schema
111494.External View
111501.0
111511162 What library do you need in order to process images?
111521.
11153GD library
111542.
11155ZIP library
111563.
11157Win32 API library
111584.
11159BOGUS library
111601.0
111611163
11162What type of declaration is this:
11163unsigned num;
111641.
11165num is unsigned integer
111662.
11167num is unsigned float
111683.
11169num is unsigned character
111704.
11171Invalid declaration
111724.0
111731164 What type of register would shift a complete binary number in one bit at a time and shift all the
11174stored bits out one bit at a time? 1.PIPO 2.PISO 3.SIPO 4.SISO 4.0
11175S.NO. Questions Choices Answers
111761165
11177What will be the output?
11178#include <stdio.h>
11179int main()
11180{
11181extern int ok;
11182printf("value of ok = %d",ok);
11183return 0;
11184}
11185extern int ok=1000;
111861.
11187Declaration Error
111882.
11189value of ok = 1000
111903.
11191value of ok = 0
111924.
11193Linking Error
111942.0
111951166 What will be the result of the expression 13 & 25 1.25 2.38 3.9 4.12 3.0
111961167 What will be the status of a computer during storage compaction
111971.
11198High paging activity
111992.
11200Thrasing happens
112013.
11202Working set model developed
112034.
11204It will sit idle
112054.0
112061168 What will happen if the first argument of open() is omitted? 1.Error Page 2.Remains in the same page 3.about:blank 4.Open the first
11207page in the history 3.0
112081169
11209What will the following script output?
11210<?php
11211$array = array (1, 2, 3, 5, 8, 13, 21, 34, 55);
11212$sum = 0;
11213for ($i = 0; $i < 5; $i++) {
11214$sum += $array[$array[$i]];
11215}e
11216cho $sum;
11217?>
112181.
1121978
112202.
1122119
112223.
11223NULL
112244.
112255
112261.0
112271170 What would be the output of the below code fragment? var a = ["s","a","v","e"];
11228document.write(a.join("")); 1.Undefined 2.save 3.vase 4.S 2.0
112291171 1.0
112301.
11231true
112322.
11233false
112343. 4.
112351.0
112361172 When a new row is inserted the constraints that can be violated are
112371.
11238Primary Key constraint
112392.
11240Referential Integrity Constraint
112413.
11242all of the options
112434.
11244Domain Constraint
112451.0
112461173 When a single item that triggers other data flow along one of many paths of a data flow diagram,
11247________ characterizes the information flow.
112481.
112493.0high coupling
112502.
11251poor modularity
112523.
11253transaction flow
112544.
11255transform flow
112561.0
11257S.NO. Questions Choices Answers
112581174 When displaying a web page, the application layer uses the
112591.
11260HTTP protocol
112612.
11262FTP protocol
112633.
11264SMTP protocol
112654.
11266IMAP Protocol
112671.0
112681175 When operated in slave mode, the PIC outputs its type number only if the cascaded address
11269received on CAS0-CAS2 matches the address programmed in --------- bits D0-D2 1.ICW1 2.ICW2 3.ICW3 4.ICW4 4.0
112701176 When the overall flow in a segment of a data flow diagram is largely sequential and follows
11271straight-line paths, _________ is present.
112721.
112734.0low coupling
112742.
11275good modularity
112763.
11277transaction flow
112784.
11279transform flow
112803.0
112811177 When the pre-order and post-order traversal of a Binary Tree generates the same output, the tree
11282can have maximum 1.Three nodes 2.Two nodes 3.One node 4.Any number of nodes 3.0
112831178 When there are infinite distinguishable strings then there cannot be a -------------
112841.
11285automata
112862.
11287finite automata
112883.
11289regular expression
112904.
11291both finite automata and regular expression
112922.0
112931179 When there is an indefinite or an infinity value during an arithmetic value computation, javascript
112941.
11295Prints an exception error
112962.
11297Prints an overflow error
112983.
11299Displays “Infinity”
113004.
11301Prints the value as such
113023.0
113031180 When used with the datalist element, what is the list attribute in HTML5 used to accomplish? 1.Local databases 2.Drop down lists 3.Autocompletion 4.Global
11304Databases 3.0
113051181 When we concatenate two languages L1 and L2 recognized by machine M1 and M2 we obtain a
11306machine with final state same as that of __________________
113071.
11308M2
113092.
11310M1 and M2
113113.
11312M1
113134.
11314M1 or M2
113152.0
113161182
11317when you were asked to design a relation, you come across a situation, where passport number is
11318to be included for the people. All the students wont be having passport. So what constraint you
11319would be using?
113201.
11321Primary Key
113222.
11323Not Null
113243.
11325Default
113264.
11327Unique
113284.0
11329S.NO. Questions Choices Answers
113301183 Which of the following is shared between all of the threads in a process? Assume a kernel level
11331thread implementation
113321.
11333Register values
113342.
11335File descriptors
113363.
11337Scheduler priority
113384.
11339Local variables
113402.0
113411184 Which buffer is a parallel to serial converter that receives a parallel byte for conversion into a
11342serial signal and further transmission onto the communication channel. 1.Transmit buffer 2.Receive buffer 3.Data bus buffer 4.Modem control 1.0
113431185 Which character function can be used to return a specified portion of a character string?
113441.
11345INSTR
113462.
11347SUBSTRING
113483.
11349SUBSTR
113504.
11351POS
113523.0
113531186 Which command we use to set an image on background?
113541.image-background:url('R4R_Logo.jpg') 2.backgroundimage:
11355url('R4R_Logo.jpg') 3.bg-image:url('R4R_Logo.jpg')
113564.background-image:href('R4R_Logo.jpg')
113572.0
113581187 Which Data structure is best suited for the UNDO operation in Windows 1.Both Stack and Queues 2.Queues 3.Stack 4.Arrays 3.0
113591188 Which database level is closest to the users?
113601.
11361External
113622.
11363Conceptual
113643.
11365Internal
113664.
11367Physical
113681.0
113691189 Which date function is used to obtain the date of next Wednesday
113701.
11371NEXT_DAY
113722.
11373LAST_DAY
113743.
11375NEXT_DATE
113764.
11377All of the options
113783.0
113791190 4.0
113801.
11381Architectural design
113822.
11383Component-level design
113843.
11385Data design
113864.
11387Interface design
113883.0
11389S.NO. Questions Choices Answers
113901191 Which directory implementation is used in most of the Operating Systems?
113911.
11392Single level directory structure
113932.
11394Two level directory structure
113953.
11396Tree directory structure
113974.
11398Acyclic directory structure
113993.0
114001192 Which directory implementation method creates more dangling pointers?
114011.
11402Single level directories
114032.
11404Two level directories
114053.
11406Tree Structured Diretories
114074.
11408Acyclic graph directories
114094.0
114101193 Which element is used to draw graphics images on a web page? 1.script 2.audio 3.embed 4.canvas 4.0
114111194 Which granularity level of testing checks the behavior of module cooperation?
114121.
11413Unit Testing
114142.
11415Integration Testing
114163.
11417Acceptance Testing
114184.
11419Regression Testing
114202.0
114211195 Which header file should be included to use functions like malloc() and calloc()? 1.string.h 2.dos.h 3.memory.h 4.stdlib.h 4.0
114221196 Which Instruction word is used to specify the number of stop bits, data bits, parity bit and the baud
11423rate clock factor for the 8251A USART
114241.Mode 2.Command followed by Mode 3.Command 4.Mode followed
11425by command 4.0
114261197 Which is a major problem with SQL?
114271.
11428SQL cannot support object-orientation
114292.
11430The same query can be written in many ways, each with vastly different
11431execution plans.
114323.
11433SQL syntax is too difficult for non-computer professionals to use
114344.
11435SQL creates excessive locks within the database
114362.0
114371198 Which is not related to deadlock avoidance?
114381.
11439Safe State
114402.
11441Unsafe State
114423.
11443Safe Sequence
114444.
11445Resource sequence
114463.0
11447S.NO. Questions Choices Answers
114481199 Which is one of the most important stakeholder from the following ?
114491.
11450Entry level personnel
114512.
11452Middle level stakeholder
114533.
11454Managers
114554.
11456Users of the software
114574.0
114581200 Which is the correct way to write a JavaScript array?
114591.
11460var txt = new Array(1:"tim",2:"kim",3:"jim")
114612.
11462var txt = new Array:1=("tim")2=("kim")3=("jim")
114633.
11464var txt = new Array("tim","kim","jim")
114654.
11466var txt = new Array="tim","kim","jim"
114673.0
114681201 Which is used to store critical pieces of data during subroutines and interrupts
114691.
11470Stack
114712.
11472Queue
114733.
11474Accumulator
114754.
11476Data register
114771.0
114781202 Which item is an example of a physical network address? 1.IP address 2.MAC address 3.Workstation name 4.www.proprofs.com 2.0
114791203 Which JavaScript function is most useful for finding errors? 1.Confirm 2.Prompt 3.Debug 4.Alert 3.0
114801204 Which method bypasses the CPU for certain types of data transfer?
114811.
11482Software interrupts
114832.
11484Interrupt-driven I/O
114853.
11486Polled I/O
114874.
11488Direct memory access (DMA)
114894.0
114901205 Which method is used for loading the driver in Java JDBC.
114911.
11492getDriver() method
114932.
11494class.forName()
114953.
11496createStatement()
114974.
11498getConnection()
114991.0
115001206 Which method is used to search for a substring?
115011.
11502stringVariable.substring(subString)
115032.
11504stringVariable.find(subString)
115053.
11506stringVariable.indexOf(subString)
115074.
11508stringVariable.indexOf(charAt(0))
115093.0
11510S.NO. Questions Choices Answers
115111207 Which model can be selected if user is involved in all the phases of SDLC?
115121.
11513Waterfall Model
115142.
11515Prototyping Model
115163.
11517RAD Model
115184.
11519Prototyping Model and RAD model
115203.0
115211208 3.0
115221.
11523design model
115242.
11525implementation model
115263.
11527user model
115284.
11529client model
115302.0
115311209 Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?
115321.
11533CDMA
115342.
11535CSMA/CA
115363.
11537ALOHA
115384.
11539CSMA/CD
115402.0
115411210 Which of the below given sorting techniques has highest best-case runtime complexity? 1.bubble sort 2.insertion sort 3.quick sort 4.selection sort 3.0
115421211 Which of the following (in file scope) leads to a compile-time error? 1.const int a=90; 2.const int f1() { return 100; } 3.int f2() const { return
11543200; } 4.const int f3( const int i) { return 300;} 3.0
115441212 Which of the following activities is not one of the four things that need to be accomplished by the
11545generic planning task set?
115461.
115473.0Develop overall project strategy
115482.
11549Identify the functionality to deliver in each software increment
115503.
11551Create a detailed schedule for the complete software project
115524.
11553Devise a means of tracking progress on a regular basis
115544.0
115551213
11556Which of the following addressing modes are suitable for program
11557relocation at run time?
115581. Absolute addressing
115592. Based addressing
115603. Relative addressing
115614. Indirect addressing
115621.
115631 and 4
115642.
115651 and 2
115663.
115672 and 3
115684.
115691,2 and 4
115704.0
115711214 Which of the following algorithm design technique is used in the quick sort algorithm? 1.Greedy method 2.Backtracking 3.Divide and conquer 4.Dynamic
11572programming 3.0
115731215 Which of the following algorithm is Minimum Spanning Tree in graph 1.Dijiktra's algorithm 2.AVL Tree algorithm 3.Kruskal's algorithm
115744.Merge algorithm 3.0
115751216 Which of the following algorithm is used to find the shortest path between two nodes in graph 1.Dijiktra's algorithm 2.Prim's algorithm 3.Kruskal's algorithm 4.Merge
11576algorithm 1.0
11577S.NO. Questions Choices Answers
115781217
11579Which of the following are decidable?
11580I. Whether the intersection of two regular languages is infinite
11581II. Whether a given context-free language is regular
11582III. Whether two push-down automata accept the same language
11583IV. Whether a given grammar is context-free
115841.
11585I and II
115862.
11587I and IV
115883.
11589II and III
115904.
11591I and III
115923.0
115931218 Which of the following attribute is needed for file upload via form?
115941.
11595enctype='multipart/form-data'
115962.
11597enctype='singlepart/data'
115983.
11599enctype='file'
116004.
11601enctype='form-data/file'
116021.0
116031219 Which of the following can be a valid column name?
116041.
11605Column
116062.
116071966_Invoices
116083.
11609Catch_#22
116104.
11611#Invoices
116123.0
116131220 Which of the following can't be done with client-side JavaScript? 1.Validating a form 2.Sending a form's contents by email 3.Storing the
11614form's contents to a database file on the server 4.Testing the form 3.0
116151221 Which of the following case does not exist in complexity theory? 1.Average case 2.Worst case 3.Best case 4.Null case 4.0
116161222 Which of the following command words need to be programmed to operate a single PIC in fully
11617nested mode with an 8086 microprocessor
116181.ICW1 and ICW2 2.ICW1, ICW2 and ICW4 3.ICW2 and ICW3
116194.ICW1 and ICW4 2.0
116201223 Which of the following correctly describes C++ language? 1.Statically typed language 2.Dynamically typed language 3.Both
11621Statically and dynamically typed language 4.Type-less language 4.0
116221224 Which of the following describes a handle (as applicable to LR-parsing) appropriately?
116231.
11624It is the position in a sentential form where the next shift or reduce
11625operation will occur
116262.
11627It is non-terminal whose production will be used for reduction in the next
11628step
116293.
11630It is a production that may be used for reduction in a future step along
11631with a position in the sentential form where the next shift or reduce
11632operation will occur
116334.
11634It is the production p that will be used for reduction in the next step
11635along with a position in the sentential form where the right hand side of
11636the production may be found
116374.0
116381225 Which of the following explains cookies nature? 1.Non Volatile 2.Volatile 3.Intransient 4.Transient 4.0
116391226 Which of the following file access method needs a relative block number 'n'?
116401.
11641Contiguous allocation
116422.
11643Linked allocation
116443.
11645Direct access
116464.
11647Sequential access
116483.0
11649S.NO. Questions Choices Answers
116501227 Which of the following function is used to terminate the script execution in PHP?
116511.
11652break()
116532.
11654quit()
116553.
11656die()
116574.
11658exit()
116593.0
116601228 Which of the following function sets first n characters of a string to a given character? 1.strset() 2.strnset() 3.strinit() 4.strcset() 2.0
116611229
11662Which of the following grammar rules violate the requirements of an operator grammar ? P, Q, R are
11663nonterminals, and r, s, t are terminals.
116641. P → Q R
116652. P → Q s R
116663. P → ε
116674. P → Q t R r
116681.
116691 and 3 only
116702.
116711 only
116723.
116732 and 3 only
116744.
116751,2,3 and 4 only
116761.0
116771230 which of the following intermediate language can be used in intermediate code generation? 1.Postfix notation and Three address code 2.Quadraples 3.Triples 4.Infix
11678notation and two address code 1.0
116791231 Which of the following is a black box testing strategy?
116801.
11681All Statements Coverage
116822.
11683Control Structure Coverage
116843.
11685Cause-Effect Graphs
116864.
11687ALL
116883.0
116891232 Which of the following is a comparison operator in SQL?
116901.
11691=
116922.
11693LIKE
116943.
11695BETWEEN
116964.
11697all of the options
116984.0
116991233
11700Which of the following is a dynamic model that shows how the system interacts with its
11701environment as it is used?
117021.
11703system context model
117042.
11705interaction model
117063.
11707environmental model
117084.
11709both system context and interaction
117102.0
11711S.NO. Questions Choices Answers
117121234 Which of the following is a legal expression in SQL?
117131.
11714SELECT NULL FROM EMPLOYEE;
117152.
11716SELECT NAME FROM EMPLOYEE;
117173.
11718SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL;
117194.
11720None of the options
117212.0
117221235 Which of the following is a problem of file management system?
117231.
11724difficult to update
117252.
11726lack of data independence
117273.
11728data redundancy
117294.
11730all options given
117314.0
117321236
11733Which of the following is a project scheduling method that can be applied to software
11734development?
117351.
11736PERT
117372.
11738CPM
117393.
11740CMM
117414.
11742both PERT and CPM
117434.0
117441237 Which of the following is a wrong example of network layer
117451.X.25 level 2-ISO 2.Source routing and Domains Naming Usenet
117463.X.25 packet land protocols (PLP-ISO) 4.Internet protocol (I/P) ARPA
11747NET
117481.0
117491238 which of the following is an incorrect definition inside a class ? 1.void * operator new(size_t size) { } 2.void * operator new () { } 3.void
11750operator delete(void * ptr) { } 4.int operator ++() { } 2.0
117511239 which of the following is an incorrect definition inside a class ? 1.void * operator new(size_t size) { } 2.void * operator new () { } 3.void
11752operator delete(void * ptr) { } 4.int operator ++() { } 2.0
117531240 Which of the following is false for cin?
117541.It is a class of which stream is an object. 2.Using cin, the data can be
11755read from user's terminal. 3.It represents standard input. 4.It is an object
11756of istream class.
117571.0
117581241 Which of the following is golden rule for interface design?
117591.
11760Place the user in control
117612.
11762Reduce the user’s memory load
117633.
11764Make the interface consistent
117654.
11766ALL
117674.0
117681242 Which of the following is lowest in memory hierarchy?
117691.
11770Cache memory
117712.
11772Secondary memory
117733.
11774Registers
117754.
11776RAM
117773.0
11778S.NO. Questions Choices Answers
117791243 Which of the following is not a binary operator in relational algebra?
117801.
11781Join
117822.
11783Semi-Join
117843.
11785Assignment
117864.
11787Project
117884.0
117891244 Which of the following is not a form of memory ?
117901.
11791Instruction cache
117922.
11793Instruction register
117943.
11795Instruction opcode
117964.
11797Translation-a-side buffer
117983.0
117991245 Which of the following is not a property of a transaction?
118001.
11801atomicity
118022.
11803consistency
118043.
11805dirty read
118064.
11807durability
118084.0
118091246 Which of the following is not a SQA plan for a project?
118101.
11811evaluations to be performed
118122.
11813amount of technical work
118143.
11815audits and reviews to be performed
118164.
11817documents to be produced by the SQA group
118182.0
118191247 Which of the following is not a valid attribute of the INPUT tag? 1.TEXT 2.NAME 3.SIZE 4.MAXLENGTH 4.0
118201248 Which of the following is NOT a valid PHP comparison operator? 1.!= 2.>= 3.&&& 4.=== 3.0
118211249 Which of the following is not an example of infrastructure components that may need to be
11822integrated into the software architecture?
118231.
11824Communications components
118252.
11826Database components
118273.
118284.0Interface components
118294.
11830Memory management components
118312.0
118321250 Which of the following is not characteristics of a relational database model 1.Complex logical relationships 2.Treelike structure 3.Tables 4.Records 2.0
118331251 Which of the following is not considered as a risk in project management?
118341.
11835Specification delays
118362.
11837Product competition
118383.
11839Testing
118404.
11841Staff turnover
118424.0
11843S.NO. Questions Choices Answers
118441252 Which of the following is not hardware:
118451.
11846Magnetic tape
118472.
11848Printer
118493.
11850VDU terminal
118514.
11852Assembler
118534.0
118541253 Which of the following is not one of Hooker's core principles of software engineering practice?
118551.
11856All design should be as simple as possible, but no simpler
118572.
11858A software system exists only to provide value to its users.
118593.
11860Pareto principle (20% of any product requires 80% of the effort)
118614.
118623.0Remember that you produce others will consume
118633.0
118641254 Which of the following is not one of the principles of good coding?
118651.
11866Create unit tests before you begin coding
118672.
118683.0Create a visual layout that aids understanding
118693.
11870Keep variable names short so that code is compact
118714.
11872Write self-documenting code, not program documentation
118734.0
118741255 Which of the following is not possible using PHP? 1.Deleting files from the server 2.Redirect a visitor to another page 3.Set
11875the value of the window statusbar 4.Obtain the IP address of a Visitor 4.0
118761256 Which of the following is not the attribute of FCB?
118771.
11878File permissions
118792.
11880Program Counter
118813.
11882Access Control List
118834.
11884Pointers to file control blocks
118854.0
118861257 Which of the following is not the characteristic of constructor?
118871.They should be declared in the public section.
11888. 2.They do not have return type. 3.They can not be inherited. 4.They can
11889be virtual.
118904.0
118911258 Which of the following is the best type of module cohesion?
118921.
11893Functional Cohesion
118942.
11895Temporal Cohesion
118963.
11897Functional Cohesion
118984.
11899Sequential Cohesion
119003.0
119011259 Which of the following is the worst type of module coupling?
119021.
11903Control Coupling
119042.
11905Stamp Coupling
119063.
11907External Coupling
119084.
11909Content Coupling
119103.0
11911S.NO. Questions Choices Answers
119121260 Which of the following is TRUE?
119131.
11914Every subset of a regular set is regular.
119152.
11916Every finite subset of a non-regular set is regular.
119173.
11918Every finite subset of a non-regular set is regular.
119194.
11920Infinite union of finite sets is regular.
119211.0
119221261 Which of the following is true?
119231.
11924The complement of a recursive language is recursive.
119252.
11926The complement of a recursively enumerable language is recursively
11927enumerable
119283.
11929The complement of a recursive language is either recursive or
11930recursively enumerable
119314.
11932The complement of a context-free language is context-free
119331.0
119341262 Which of the following is TRUE?
119351.
11936Every relation in 2NF is also in BCNF
119372.
11938A relation R is in 3NF if every non-prime attribute of R is fully
11939functionally dependent on every key of R
119403.
11941Every relation in BCNF is also in 3NF
119424.
11943No relation can be in both BCNF and 3NF
119443.0
119451263
11946Which of the following is true?
119471.
11948Segmentation is faster than paging
119492.
11950Paging is faster than segmentation
119513.
11952Pages are unequal sized pieces
119534.
11954Segments are equal sized pieces
119552.0
119561264 Which of the following is useful in traversing a given graph by breadth first search? 1.List 2.Queue 3.Set 4.Stack 2.0
119571265 Which of the following is valid reason for collecting customer feedback concerning delivered
11958software?
119591.
11960Do not allows developers to make changes to the delivered increment
119612.
119622.0Delivery schedule can be revised to reflect changes
119633.
11964Developers can not identify changes to incorporate into next increment
119654.Delivery schedule can't be revised to reflect changes
119664.0
119671266 Which of the following is/are the DDL statements?
119681.
11969Create
119702.
11971Drop
119723.
11973Alter
119744.
11975All of the options
119764.0
11977S.NO. Questions Choices Answers
119781267
11979Which of the following languages are context-free?
11980L1 = {a b a b ⎪ m, n ≥ 1}
11981L2 = {a b a b ⎪ m, n ≥ 1}
11982L3 = {a b ⎪ m = 2n + 1}
119831.L1 and L2 only 2.
11984L1 and L3 only
119853.
11986L3 only
119874.
11988L1 only
119892.0
119901268 Which of the following memory allocation scheme suffers from External fragmentation?
119911.
11992Segmentation
119932.
11994Pure Demand Paging
119953.
11996swapping
119974.
11998paging
119991.0
120001269 Which of the following most certainly implies the need for an entire table to implement?
120011.
12002A binary relationship
120032.
12004A ternary relationship
120053.
12006A recursive relationship
120074.
12008An identifying relationship
120094.0
120101270 Which of the following name does not relate to stacks? 1.FIFO lists 2.LIFO list 3.Push-down lists 4.Piles 1.0
120111271 Which of the following operation is used if we are interested in only certain columns of a table?
120121.
12013PROJECTION
120142.
12015SELECTION
120163.
12017UNION
120184.
12019JOIN
120201.0
120211272 Which of the following operator can be overloaded through friend function? 1.-> 2.= 3.( ) 4.* 4.0
120221273 Which of the following operators has an associativity from Right to Left? 1.+= 2.== 3.<< 4.<= 3.0
120231274
12024Which of the following pattern is the basis of interaction management in many web-based
12025systems?
120261.
12027architecture
120282.
12029repository pattern
120303.
12031model-view-controller
120324.
12033different operating system
120343.0
120351275 Which of the following problems is undecidable?
120361.
12037Membership problem for CFGs
120382.
12039Ambiguity problem for CFGs.
120403.
12041Finiteness problem for FSAs
120424.
12043Equivalence problem for FSAs.
120442.0
12045S.NO. Questions Choices Answers
12046m n n m
12047m n m n
12048m n
120491276 Which of the following problems is undecidable?
120501.
12051Deciding if a given context-free grammar is ambiguous.
120522.
12053Deciding if a given string is generated by a given context-free grammar
120543.
12055Deciding if the language generated by a given context-free grammar is
12056empty
120574.
12058Deciding if the language generated by a given context-free grammar is
12059finite.
120601.0
120611277
12062Which of the following process is concerned with analyzing the costs and benefits of proposed
12063changes?
120641.
12065Change management
120662.
12067Version management
120683.
12069System building
120704.
12071Release management
120721.0
120731278 Which of the following property allows you to specify an element’s position with respect to the
12074browser window? 1.relative 2.fixed 3.static 4.absolute 1.0
120751279 Which of the following risk is the failure of a purchased component to perform as expected?
120761.
12077Product risk
120782.
12079Project risk
120803.
12081Business risk
120824.
12083Programming risk
120841.0
120851280
12086Which of the following risks are derived from the organizational environment where the software
12087is being developed?
120881.
12089People risks
120902.
12091Technology risks
120923.
12093Estimation risks
120944.
12095Organizational risks
120964.0
120971281
12098Which of the following risks are derived from the software or hardware technologies that are used
12099to develop the system?
121001.
12101Managerial risks
121022.
12103Technology risks
121043.
12105Estimation risks
121064.
12107Organizational risks
121082.0
121091282 Which of the following statements about queues is incorrect?
121101.Queues are first-in, first-out (FIFO) data structures 2.Queues can be
12111implemented using arrays 3.Queues can be implemented using linked
12112lists 4.New nodes can only be added at the front of the queue
121134.0
121141283 Which of the following statements are true in c++?
121151.Class members are public by default. 2.Structures can not have
12116functions as members. 3.Classes can not have data as public members.
121174.Structures can have functions
121181.0
12119S.NO. Questions Choices Answers
121201284
12121Which of the following statements are TRUE?
12122I. There exist parsing algorithms for some programming languages
12123whose complexities are less than O(n ).
12124II. A programming language which allows recursion can be implemented
12125with static storage allocation.
12126III. No L-attributed definition can be evaluated in The framework
12127of bottom-up parsing.
12128IV. Code improving transformations can be performed at both source
12129language and intermediate code level.
121301.
12131I and II
121322.
12133I and IV
121343.
12135III and IV
121364.
12137I, II and III
121382.0
121391285 Which of the following statements best describes the operation of a synchronous up-/downcounter?
121401.In general, the counter can be reversed at any point in its counting
12141sequence. 2.The counter can be reversed, but must be reset before
12142counting in the other direction. 3.The counter can count in either
12143direction, but must continue in that direction once started. 4.The count
12144sequence cannot be reversed, once it has begun, without first resetting
12145the counter to zero.
121461.0
121471286 Which of the following statements explains portabililty in non-functional requirements?
121481.
12149It is a degree to which software running on one platform can easily be
12150converted to run on another platform.
121512.
12152It can be enhanced by using languages, OS’ and tools that are universally
12153available and standardized.
121543.
12155The ability of the system to behave consistently in a user-acceptable
12156manner when operating within the environment for which the system
12157was intended.
121584.
12159It is a degree to which software running on one platform can easily be
12160converted to run on another platform as well as It can be enhanced by
12161using languages, OS’ and tools that are universally available and
12162standardized.
121631.0
121641287 Which of the following statements is false?
121651.
12166Every NFA can be converted to an equivalent DFA
121672.
12168Every non-deterministic Turing machine can be converted to an
12169equivalent deterministic Turing machine
121703.
12171Every regular language is also a context-free language
121724.
12173Every subset of a recursively enumerable set is recursive
121744.0
121751288 Which of the following statements is NOT valid about operator overloading?
121761.Overloaded operator must have at least one operand of its class type.
121772.Only existing operators can be overloaded. 3.The overloaded operators
12178follow the syntax rules of the original operator. 4.The arity of the
12179operator can be changed
121803.0
121811289 Which of the following statements is NOT valid about operator overloading?
121821.Overloaded operator must have at least one operand of its class type.
121832.Only existing operators can be overloaded. 3.The overloaded operators
12184follow the syntax rules of the original operator. 4.The arity of the
12185operator can be changed
121864.0
121871290 Which of the following statements is true?
121881.An INPUT field of type password provides excellent security 2.An
12189INPUT field of type password provides a masked field but no real
12190security 3.A maximum length can not be set for a password field 4.A
12191password INPUT field can only be included in a FORM that uses the get
12192METHOD
121934.0
121941291 Which of the following statements is true?
121951.Quadraples have some disadvantages over triples notation for an
12196optimizing compiler 2.For optimizing compiler, moving a statement that
12197defines a temporary value requires us to change all references to that
12198statements. It is an overhead for triples notation 3.For optimizing
12199compiler, triples notation has important benefit where statements are
12200often moved around as it incurs no movements or change 4.All the
12201statements are false
122022.0
122031292 Which of the following statements is/are TRUE for an undirected graph?P:Number of odd degree
12204vertices is even,Q: Sum of degrees of all vertices is even 1.P Only 2.Q Only 3.Both P and Q 4.Neither P nor Q 1.0
122051293 Which of the following statements is/are TRUE for an undirected graph?P:Number of odd degree
12206vertices is even,Q: Sum of degrees of all vertices is even 1.P Only 2.Q Only 3.Both P and Q 4.Neither P nor Q 1.0
12207S.NO. Questions Choices Answers
122083
122091294
12210Which of the following strategies means that the impact of the risk will be reduced?
122111.
12212Avoidance strategies
122132.
12214Minimization strategies
122153.
12216Contingency plans
122174.
12218ALL
122192.0
122201295 Which of the following system calls results in the sending of SYN packets?
122211.
12222socket
122232.
12224bind
122253.
12226listen
122274.
12228connect
122294.0
122301296 Which of the following term is best defined by the statement “The creation of a new codeline from
12231a version in an existing codeline”?
122321.
12233Branching
122342.
12235Merging
122363.
12237Codeline
122384.
12239Mainline
122401.0
122411297
12242Which of the following term is best defined by the statement: “Derive traceability information to
12243maximize information hiding in the design.”?
122441.
12245Underestimated development time
122462.
12247Organizational restructuring
122483.
12249Requirements changes
122504.
12251None
122523.0
122531298
12254Which of the following term is best defined by the statement: “The underlying technology on
12255which the system is built is superseded by new technology.”?
122561.
12257Technology change
122582.
12259Product competition
122603.
12261Requirements change
122624.
12263None
122641.0
122651299
12266Which of the following term is best defined by the statement: “There will be a change of
12267organizational management with different priorities.”?
122681.
12269Staff turnover
122702.
12271Technology change
122723.
12273Management change
122744.
12275Product competition
122763.0
12277S.NO. Questions Choices Answers
122781300 Which of the following traits need to exist among the members of an agile software team?
122791.
12280Competence
122812.
12282Decision-making ability
122833.
122844.0Mutual trust and respect
122854.
12286ALL
122874.0
122881301 Which of the following tree may have smaller elements in its left subtree and larger element in its
12289right subtree 1.B+ Tree 2.AVL Tree 3.Binary tree 4.Binary search Tree 4.0
122901302 Which of the following ways below is correct to write a CSS? 1.p {color:red;text-align:center}; 2.p {color:red;text-align:center} 3.p
12291{color:red;text-align:center;} 4.p (color:red;text-align:center;) 3.0
122921303 Which of the following would cause quickest access
122931.
12294direct access from a magnetic tape
122952.
12296direct access from a hard disk
122973.
12298direct access from a floppy disk
122994.
12300direct access from a cassette tape
123012.0
123021304
12303Which of the regular expressions given below represent the following DFA?
12304I) 0*1(1+00*1)*
12305II) 0*1*1+11*0*1
12306III) (0+1)*1
123071.
12308I and II only
123092.
12310I and III only
123113.
12312II and III only
123134.
12314I,II,III
123153.0
123161305 Which of these contains an executable statement? 1.// var a = 0; // var b = 0; 2./* var a = 0; // var b = 0; */ 3./* var a = 0; */
12317var b = 0; 4.// var a = 0; /* var b = 0; */ 3.0
123181306 Which of these does not belong to the basic principles of good product design ?
123191.
12320Adequacy
123212.
12322Feasibility
123233.
12324Portability
123254.
12326Economy
123274.0
123281307 Which of these framework activities is not normally associated with the user interface design
12329processes?
123301.
12331cost estimation
123322.
123331.0interface construction
123343.
12335interface validation
123364.
12337user and task analysis
123383.0
12339S.NO. Questions Choices Answers
123401308 Which of these is incorrect ?
123411.
12342Software engineering belongs to Computer science
123432.
12344Software engineering is a part of more general form of System
12345Engineering
123463.
12347Computer science belongs to Software engineering
123484.
12349Software engineering is concerned with the practicalities of developing
12350and delivering useful software
123513.0
123521309 Which of these is not an element of an object-oriented analysis model?
123531.
12354Behavioral elements
123552.
12356Class-based elements
123573.
12358Data elements
123594.
12360Scenario-based elements
123614.0
123621310 Which of these sets of HTML5 attributes can be used for form validation? 1.required, pattern, min and max 2.auto, fixed, number 3.number, text,
12363currency 4.input, radio,checkbox 1.0
123641311 Which one is not a self complementary code? 1.8 4 -2 -1 2.4 8 1 2 3.4 4 3 -2 4.2 4 2 1 3.0
123651312 Which one of the following is currently the most popular data model?
123661.Network Model
123672.Object Model 3.Notation Model
123684.Relational Model
123694.0
123701313 Which one of the file allocation scheme cannot be adopted for dynamic storage allocation
123711.
12372Linked allocation
123732.
12374Fixed Indexed allocation
123753.
12376Variable Indexed allocation
123774.
12378Contiguous allocation
123792.0
123801314 Which one of the following algorithm is not used in asymmetric-key cryptography?
123811.
12382RSA algorithm
123832.
12384diffie-hellman algorithm
123853.
12386electronic code book algorithm
123874.
12388ECC
123893.0
123901315 Which one of the following allows a user at one site to establish a connection to another site and
12391then pass keystrokes from local host to remote host?
123921.
12393HTTP
123942.
12395FTP
123963.
12397telnet
123984.
12399none of the mentioned
124003.0
124011316 Which one of the following correctly describes the meaning of 'namespace' feature in C++?
124021.namespaces provide facilities for organizing the names in a program to
12403avoid name clashes 2.Namespaces refer to space between the names in a
12404program 3.Namespaces refer to the memory space allocated for names
12405used in a program 4.Namespaces refer to the space for names.
124061.0
12407S.NO. Questions Choices Answers
124081317 Which one of the following event is not possible in wireless LAN.
124091.
12410collision detection
124112.
12412Acknowledgement of data frames
124133.
12414multi-mode data transmission
124154.
12416none of the mentioned
124171.0
124181318 Which one of the following is a cryptographic protocol used to secure HTTP connection?
124191.
12420stream control transmission protocol (SCTP)
124212.
12422transport layer security (TSL)
124233.
12424explicit congestion notification (ECN)
124254.
12426resource reservation protocol
124272.0
124281319 Which one of the following is a requirement that fits in a developer’s module ?
124291.
12430Availability
124312.
12432Testability
124333.
12434Usability
124354.
12436Flexibility
124372.0
124381320 Which one of the following is an internet standard protocol for managing devices on IP network?
124391.
12440dynamic host configuration protocol
124412.
12442simple network management protocol
124433.
12444internet message access protocol
124454.
12446media gateway protocol
124472.0
124481321 Which one of the following is FALSE?
124491.
12450A basic block is a sequence of instructions where control enters the
12451sequence at the beginning and exits at the end.
124522.
12453Available expression analysis can be used for common subexpression
12454elimination.
124553.
12456Live variable analysis can be used for dead code elimination.
124574.
12458x = 4 ∗ 5 => x = 20 is an example of common subexpression
12459elimination.
124602.0
12461S.NO. Questions Choices Answers
124621322 Which one of the following is FALSE?
124631.
12464There is unique minimal DFA for every regular language
124652.
12466Every NFA can be converted to an equivalent PDA
124673.
12468Complement of every context-free language is recursive
124694.
12470Every nondeterministic PDA can be converted to an equivalent
12471deterministic PDA
124724.0
124731323 Which one of the following is not a step of requirement engineering?
124741.
12475Elicitation
124762.
12477Design a model
124783.
12479Analysis
124804.
12481Documentation
124822.0
124831324 Which one of the following is not a windows file system?
124841.
12485FAT
124862.
12487NTFS
124883.
12489FAT32
124904.
12491EXT
124924.0
124931325 Which one of the following is not an application layer protocol?
124941.
12495media gateway protocol
124962.
12497dynamic host configuration protocol
124983.
12499resource reservation protocol
125004.
12501session initiation protocol
125023.0
125031326 Which one of the following is not correct?
125041.
12505application layer protocols are used by both source and destination
12506devices during a communication session
125072.
12508application layer protocols implemented on the source and destination
12509host must match
125103.
12511both the options
125124.
125133.0
125141327
12515Which one of the following is not the process of Deadlock Recovery?
125161.
12517Killing a process
125182.
12519Rollback to the previous state
125203.
12521Selecting a Victim
125224.
12523Delaying the process
125244.0
12525S.NO. Questions Choices Answers
125261328 Which one of the following is not the responsibility of the DBA?
125271.provide security
125282.develop applications
125293.periodically tunes the database
125304.restores the system after a failure
125312.0
125321329
12533Which one of the following is the recurrence equation for the worst case time complexity of the
12534Quicksort algorithm for sorting n>=2 numbers? In the recurrence equations given in the options
12535below, c is a constant.
125361.T(n)=2T(n/2)+cn 2.T(n)=T(n–1)+T(0)+cn 3.T(n)=T(n/2)+cn
125374.T(n)=2T(n–2)+cn 1.0
125381330 Which one of the following is the very first task executed by a session enabled page? 1.Delete the previous session 2.Start a new session 3.Check whether a
12539valid session exists 4.Handle the session 3.0
125401331 Which one of the following is True at any valid state in shift-reduce parsing?
125411.
12542Viable prefixes appear only at the bottom of the stack and not inside
125432.
12544Viable prefixes appear only at the top of the stack and not inside
125453.
12546The stack contains only a set of viable prefixes
125474.
12548The stack never contains viable prefixes
125493.0
125501332 Which one of the following is used as the start frame delimeter in ethernet frame?
125511.
1255210101010
125532.
1255410101011
125553.
1255600000000
125574.
1255811111111
125592.0
125601333 Which one of the following languages over the alphabet {0,1} is described by the regular expression:
12561(0+1)*0(0+1)*0(0+1)*?
125621.
12563The set of all strings containing the substring 00.
125642.
12565The set of all strings containing at most two 0’s.
125663.
12567The set of all strings containing at least two 0’s.
125684.
12569The set of all strings that begin and end with either 0 or 1.
125703.0
125711334 Which one of the following models is not suitable for accommodating any change?
125721.
12573Build & Fix Model
125742.
12575Prototyping Model
125763.
12577RAD model
125784.
12579Waterfall Model
125804.0
125811335 Which one of the following modulation scheme is supported by WiMAX?
125821.
12583binary phase shift keying modulation
125842.
12585quadrature phase shift keying modulation
125863.
12587quadrature amplitude modulation
125884.
12589all of the mentioned
125904.0
12591S.NO. Questions Choices Answers
125921336 Which one of the following protocol delivers/stores mail to reciever server?
125931.
12594simple mail transfer protocol
125952.
12596post office protocol
125973.
12598internet mail access protocol
125994.
12600hypertext transfer protocol
126011.0
126021337 Which one of the following regular expressions over {0, 1} denotes the set of all strings not
12603containing 100 as a substring (a) 0*(11)*0* (b) (0*1010)* (c) 0*1*010 (d) 0*(10)*01*
126041.
12605a and b
126062.
12607b and c
126083.
12609only c
126104.
12611only b
1261214.0
126131338 Which one of the following statements if FALSE?
126141.
12615Any relation with two attributes is in BCNF
126162.
12617A relation in which every key has only one attribute is in 2NF
126183.
12619A prime attribute can be transitively dependent on a key in a 3 NF
12620relation.
126214.
12622A prime attribute can be transitively dependent on a key in a BCNF
12623relation.
126244.0
126251339 Which one of the following uses 8B/6T encoding scheme 1.100 Base-T1 2.100 Base-T4 3.100 Base TX 4.100 Base-FX 2.0
126261340 Which property is used to obtain browser vendor and version information? 1.modal 2.version 3.browser 4.navigator 4.0
126271341 Which protocol is a signalling communication protocol used for controlling multimedia
12628communication sessions?
126291.
12630session initiation protocol
126312.
12632session modelling protocol
126333.
12634session maintenance protocol
126354.
12636none of the mentioned
126371.0
126381342 Which question no longer concerns the modern software engineer?
126391.
12640Why does computer hardware cost so much?
126412.
12642Why does software take a long time to finish?
126433.
12644Why does it cost so much to develop a piece of software?
126454.
12646Why can't software errors be removed from products prior to delivery?
126471.0
126481343 Which searching technique is better, if unsorted array is given as input 1.Radix search 2.Linear search 3.Binary search 4.Indexd sequential
12649search 2.0
126501344 Which segments of a seven-segment display would be active to display the decimal digit 2? 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 3.0
12651S.NO. Questions Choices Answers
126521345 Which SQL functions is used to count the number of rows in a SQL query?
126531.
12654Sum
126552.
12656Count
126573.
12658Max
126594.
12660ALL
126612.0
126621346 Which statement does not require semicolon?
126631.
12664goto xyz
126652.
12666int x = 20
126673.
12668#define MAX 100
126694.
12670do {... }while(count<=100)
126713.0
126721347 Which statement is true:
126731.Standard form must consists of minterms 2.All standard form are
12674canonical forms 3.Canonical form can consist of a term with a literal
12675missing 4.All canonical form are standard form
126761.0
126771348 Which transmission media has the highest transmission speed in a network?
126781.
12679coaxial cable
126802.
12681twisted pair cable
126823.
12683optical fiber
126844.
12685electrical cable
126863.0
126871349 Which of these is a stand alone tag?
126881.
12689form
126902.
12691frame
126923.
12693table
126944.
12695anchor
126962.0
126971350 While inserting the elements 71,65,84,69,67,83 in an empty binary search tree(BST)in the
12698sequence shown, the element in the lowest level is 1.65 2.67 3.83 4.69 2.0
126991351 Why 'critical section' is not imposed on file systems instead 'file locks' when more than one process
12700tries to access the file?
127011.
12702Time consuming
127032.
12704Process entered in to critical section may close the file
127053.
12706we cannot satify the three conditions of mutual exclusion, progress and
12707bounded waiting
127084.
12709we cannot use semaphore
127103.0
12711S.NO. Questions Choices Answers
127121352 WiMAX MAC layer provides an interface between
127131.
12714higher transport layers and physical layer
127152.
12716application layer and network layer
127173.
12718data link layer and network layer
127194.
12720none of the mentioned
127211.0
127221353 WiMAX provides
127231.
12724simplex communication
127252.
12726half duplex communication
127273.
12728full duplex communication
127294.
12730none of the mentioned
127312.0
127321354 WiMAX stands for
127331.
12734wireless maximum communication
127352.
12736worldwide interoperability for microwave access
127373.
12738worldwide international standard for microwave access
127394.
12740none of the mentioned
127412.0
127421355 WiMAX uses the
127431.
12744orthogonal frequency division multiplexing
127452.
12746time division multiplexing
127473.
12748space division multiplexing
127494.
12750all of the mentioned
127511.0
127521356 Wireless transmission can be done via
127531.
12754radio waves
127552.
12756microwaves
127573.
12758infrared
127594.
12760all of the mentioned
127614.0
127621357 Write Through technique is used in which memory for updating the data _____.
127631.
12764Virtual memory
127652.
12766Main memory
127673.
12768Auxiliary memory
127694.
12770Cache memory
127714.0
127721358 You can find the element you want to manipulate by ________ way? 1.getElementById() 2.getElementsByTagName()
127733.getElementsByClassName() 4.All of the these 4.0
12774S.NO. Questions Choices Answers
127751359 You have an array of n elements, Suppose you implement quicksort by always choosing the central
12776element of the array as the pivot, Then the tightest upper bound for the worst case performance is 1.O(log n) 2.O(n) 3.O(n^2) 4.O(1) 3.0
127771360 You have to sort a list L consisting of a sorted list followed by a few “random” elements.Which of
12778the following sorting methods would be especially suitable for such a task? 1.Bubble sort 2.Selection sort 3.Quick sort 4.Insertion sort 4.0
127791361 You need to check the size of a file in PHP function. $size = X(filename); Which function will
12780suitably replace 'X'?
127811.
12782filesize
127832.
12784size
127853.
12786sizeofFile
127874.
12788getSize
127891.0
127901362 ‘Aging registers’ are _______.
127911.
12792Counters which indicate how long ago their associated pages have been
12793referenced.
127942.
12795Registers which keep track of when the program was last accessed
127963.
12797Counters to keep track of last accessed instruction
127984.
12799Counters to keep track of the latest data structures referred
128001.0
12801S.NO. Questions Choices Answers