fQyuv4xj

1Comprehensive Examination CSE - 2019 Batch
2Mayank Lakshay
3S.NO. Questions Choices Answers
41
51.
63
72.
84
93.
105
114.
126
131.0
142
15(a+b)(cd)*(a+b) denotes the following set
161.
17{a(cd)^nb|n>=1}
182.
19{a(cd)^n>=1}U{b(cd)^n|n>=1}
203.
21{a(cd)^na|n>=0}U{a(cd)^nb|n>=0}U{b(cd)^na|n>=0}U{b(cd)^nb|n>=0}
224. {ac^nd^nb|n>=1}
233.0
243
25-24 is 2’s complement form is
261.
2711101000
282.
2901111111
303.
3101001000
324. 00111111
331.0
344
35A 2 bit binary multiplier can be implemented using
361.
372 input ANDs only
382.
392 input X-ORs and 4-input AND gates only
403. XOR gates and shift registers
414.
42Two (2) input NORs and one XNOR gate
432.0
445
45A _________ registrar stores the intermediate arithmetic and logic results in it.
461.
47Address registrar
482. Program counter
493.
50Index registrar
514.
52Accumulator
534.0
546 A class is a
551. Structure
562. Memory
573. Template
584. Function
593.0
607 A constructor without any arguments is
611. default constructor
622. parameterized constructor
633. none
644. overloading
651.0
668 A default constructor is one that
671. that takes all default arguments
682. have to be called explictly
693. gets called automatically
704. does take many parameters
711.0
729
73A finite automata that will accept only string X of length n will have _________ many
74states
751.
76n
772. n/2
783. n+1
794. infinite
803.0
8110 A friend function to a class A cannot access
821. the data members of the derived class of A.
832. public data members and member functions.
843. protected data members and member functions.
854. private data members and member functions.
861.0
8711 A property which is not true for classes is that they
881. Can closely model objects in the real world.
892. bring together all aspects of an entity in one place.
903. permit data to be hidden from other classes.
914. are removed from memory when not in use.
922.0
9312 A quadruple is a record structure with ______ fields.
941. 3
952. 4
963. 1
974. 2
982.0
9913
100A Stack-organised Computer uses instruction of
1011.
102Zero addressing
1032.
104Two-addressing
1053.
106Indirect addressing
1074. Index addressing
1081.0
109S.NO. Questions Choices Answers
11014 Access to private data is
1111. Restricted to methods of the same class
1122. Restricted to methods of other classes
1133. Available to methods of the same class and other classes
1144. Not an issue because the program will not compile
1151.0
11615 All member functions are _____ to it's class by default
1171. constant
1182. non static
1193. dynamic
1204. static
1214.0
12216 An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if
1231. The LR(1) parser for G has S-R conflicts.
1242. The LR(0) parser for G has S-R conflicts.
1253. The LALR(1) parser for G has reduce-reduce conflicts
1264. The SLR(1) parser for G has S-R conflicts.
1271.0
12817 An optimizing compiler
1291. Is optimized to occupy less space
1302. Optimized the code
1313. Is optimized to take less time for execution
1324. Secured Code
1332.0
13418
135An unambiguous grammar has
1361. Exactly one leftmost derivation for a string w
1372. At most one leftmost and one rightmost derivation for a string w
1383. At most one rightmost derivation for a string w
1394. Exactly one leftmost and rightmost derivation for a string w
1401.0
14119
142An unambiguous grammar has
1431. Exactly one leftmost derivation for a string w
1442. At most one leftmost and one rightmost derivation for a string w
1453. At most one rightmost derivation for a string w
1464. Exactly one leftmost and rightmost derivation for a string w
1471.0
14820 ASCII, EBCDIC, and Unicode are examples of -----------------
1491. integrated circuits
1502. binary coding schemes
1513. two-state systems
1524. adapter cards
1531.0
15421 baa*c denotes the set
1551. {b^na^mc^p|n,m,p>=1}
1562. {ba^nc|n>=0}
1573. {ba^nc|n>=1}
1584. {w|w is a string of a,b,c}
1593.0
16022 BCD to seven segment is a
1611. encoder
1622. carry look ahead
1633. comparator
1644. decoder
1651.0
166S.NO. Questions Choices Answers
16723 Calculate the person months for a project that was completed in two months with two
168people working on it.
1691. 2
1702. 4
1713. 1
1724. 8
1732.0
17424 class A { int a; static float b; } ; What is the size of class A?
1751. sizeof( int ) * 2
1762. sizeof( int ) + sizeof( float )
1773. sizeof( int )
1784. sizeof( float )
1792.0
18025 class n{ int a=0;}obj; what will happen?
1811. nothing
1822. initializes the data member with 0
1833. error
1844. initializes the object with 0
1853.0
18626 class n{ public: int *a;}o,p; assigning o=p is called?
1871. deep copy
1882. shallow copy
1893. error
1904. constructor
1912.0
19227
193class n{ public: int a;}
194obj; obj.a=10; cout << a;
1951. error
1962. 10
1973. 1
1984. 0
1991.0
20028 class n{ public: int a=7;}p,q; cout<< n.a;
2011. 0
2022. error
2033. depends on compiler
2044. 7
2052.0
20629
207Consider the regular language L = (111 + 11111)*. The minimum number of states in
208any DFA accepting the language is
2091.
2103
2112.
2125
2133.
2148
2154. 9
2164.0
21730
218Content of the program counter is added to the address part of the instruction in order to
219obtain the effective address is called.
2201.
221index addressing mode.
2222.
223register mode.
2243. implied mode.
2254.
226relative address mode.
2274.0
22831 Data Members of the base class that are marked private:
2291. are directly accessible in the derived class
2302. are visible in the derived class
2313. exist in memory when the object of the derived class is created
232the derived class
2334. does exist in memory when the object of the derived class is
234created
2354.0
236S.NO. Questions Choices Answers
23732
238Decimal number 9 in Gray code is
2391. 1111
2402.
2411101
2423.
2431100
2444.
2451110
2462.0
24733
248During a software development project two similar requirements defects were detected.
249One was detected in the requirements phase, and the other during the implementation
250phase. Which of the following statements is mostly likely to be true?
2511. There is no relationship between the phase in which a defect is
252discovered and its repair cost. .
2532. The most expensive defect to correct is the one detected during
254the implementation phase.
2553. The most expensive defect to correct is the one detected during
256the requirements phase.
2574. The cost of fixing either defect will usually be similar.
2582.0
25934 Effective software project management focuses on four P's which are
2601. people, product, process, project
2612. people, product, performance, process
2623. people, performance, payoff, product
2634. people, process, payoff, product
2641.0
26535 FAT file system is
2661. Indexed Allocation and used in Windows OS
2672. used in Windows OS
2683. about storage in RAM
2694. Indexed Allocation.
2701.0
27136 Files whose names end in .h are called _____ files
2721. helper
2732. header
2743. handy
2754. helping
2762.0
27737 Finite automata recognizes --------grammars
2781.
279type-1
2802.
281type-3
2823. type-0
2834.
284type-2
2852.0
28638
287Floating point representation is used to store ______.
2881.
289Boolean values
2902.
291real integers
2923. integers
2934.
294whole numbers
2952.0
29639 Function templates can accept
2971. Only parameters of the basic type
2982. Only one parameter
2993. Any type of parameters
3004. Only parameters of the derived type
3011.0
302S.NO. Questions Choices Answers
30340 Functional requirements of a system is modelled using
3041. Use-case Diagram
3052. Sequence Diagram
3063. Class Diagram
3074. Package Diagram
3081.0
30941
310Given an arbitrary non-deterministic finite automaton (NFA). with N states, the maximum
311number of states in an equivalent minimized DFA is at least.
3121.
313N^2
3142.
3152N
3163.
3172^N
3184. N!
3193.0
32042
321Given the language L = {ab, aa, baa}, which of the following strings are in L*?
3221) abaabaaabaa
3232) aaaabaaaa
3243) baaaaabaaaab
3254) baaaaabaa
3261.
3271, 2 and 3
3282.
3292, 3 and 4
3303.
3311, 2 and 4
3324.
3331, 3 and 4
3343.0
33543 Having more than one constructor in a class is
3361. not possible
3372. compile time polymorphism
3383. constructor overriding
3394. error
3403.0
34144 How many DFAs exit with two state over the input alphabet (a,b)
3421.
34316
3442.
34526
3463.
34732
3484. 64
3494.0
35045 How many possible outputs would a decoder have with a 6-bit binary input?
3511. 16
3522. 64
3533. 128
3544. 32
3552.0
35646 How many select lines would be required for an 8-line-to-1-line multiplexer?
3571. 2
3582. 4
3593. 3
3604. 8
3613.0
36247 How many stages are there in process improvement?
3631. three
3642. four
3653. five
3664. six
3674.0
368S.NO. Questions Choices Answers
36948 How many two state FA can be drawn over alphabet{0,1} which accepts(0+1)*
3701.
37112
3722.
37314
3743.
37520
3764. 15
3773.0
37849 How will you free the allocated memory ?
3791. delete(var-name);
3802. dalloc(var-name);
3813. free(var-name);
3824. remove(var-name);
3833.0
38450 Identify the invalid statement from the following
3851. for (; ; )
3862. if (1)
3873. break(0)
3884. while(false)
3893.0
39051
391If a register containing binary data (11001100) is subjected to arithmetic shift left
392operation, then the content of the register after 'ashl' shall be
3931. (10011000)
3942.
395(11001100)
3963.
397(1101100)
3984.
399(10011001)
4001.0
40152
402If a university sets up web-based information system that faculty could access to record
403student grades and to advise students, that would be an example of an
4041. intranet
4052. ERP
4063. extranet
4074. CRM
4081.0
40953
410If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using
411Thompson construction will have ------------- states.
4121.
413n+2
4142.
415n+1
4163.
417n
4184. n-1
4192.0
42054
421If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using
422Thompson construction will have ------------- states.
4231.
424n+2
4252.
426n+1
4273.
428n
4294. n-1
4302.0
43155
432If there is a complete DFA M1 recognizing a language L1 and has m states out of which
433two are final states then the machine M recognizing L1 complement will have
434_____________ final states.
4351.
436m+2
4372.
438m
4393.
440m-2
4414. 2
4421.0
443S.NO. Questions Choices Answers
44456 If X is the name of the class, what is the correct way to declare copy constructor of X?
4451. X(class X* arg)
4462. X(X& arg)
4473. X(X* arg)
4484. X(X arg)
4492.0
45057
451If you assign a default value to any variable in a function prototype's parameter list, then
452_____
4531. all parameters to the left of that variable must have default values
4542. all parameters to the right of that variable must have default values
4553. all other parameters in the function prototype must have default
456values
4574. no other parameters in that prototype can have default values
4582.0
45958
460If you want to use a class to define objects in many different programs, you should
461define the class in a C++ _____ file
4621. text
4632. source
4643. header
4654. program
4663.0
46759 In a BCD-to-seven-segment converter, why must a code converter be utilized?
4681. to convert the 4-bit BCD into Gray code
4692. to convert the 4-bit BCD into 7-bit code
4703. to convert the 4-bit BCD into 10-bit code
4714. No conversion is necessary
4722.0
47360 In C++, dynamic memory allocation is accomplished with the operator ____
4741. new
4752. this
4763. malloc
4774. delete
4781.0
47961 In C++, dynamic memory allocation is achieved with the operator _______
4801. malloc()
4812. delete
4823. new
4834. this
4843.0
48562
486In CMM, the life cycle activities of requirements analysis, design, code, and test are
487described in
4881. Software Product Engineering
4892. Software Quality Assurance
4903. Software Subcontract Management
4914. Software Quality Management
4921.0
49363
494In computers, subtraction is generally carried out by ______.
4951.
4969’s complement
4972. 2’s complement
4983.
49910’s complement
5004.
5011’s complement
5022.0
50364 In the types of Three-Address statements, copy statements of the form x := y means
5041. The value of x is assigned to y or the value of y is assigned t o x.
5052. The value of x is assigned to y and the value of y is assigned t o x.
5063. The value of y is assigned to x.
5074. The value of x is assigned to y.
5083.0
50965 Many programmers separate a class into two files: _____
5101. one for the primary functions and one for the auxiliary functions
5112. one for the public data and one for the private data
5123. one for the void functions and one for the other functions
5134. one for the declarations and one for the implementations
5144.0
515S.NO. Questions Choices Answers
51666 Multiplication of a positive integer by a power of two can be replaced by left shift, which
517executes faster on most machines. This is an example of
5181. Useless Code
5192. Strength Reduction
5203. Induction Variable
5214. Loop unwinding
5222.0
52367 One can safely state that the output lines for a demultiplexer are under the direct control
524of the:
5251. input data select lines
5262. the internal OR gate
5273. the internal AND gates
5284. Input data line
5291.0
53068 Overloading a prefix increment operator by means of a member function takes
5311. Three arguments
5322. Two arguments
5333. No argument
5344. One argument
5353.0
53669 Overloading involves writing two or more functions with ________
5371. different names and different argument lists
5382. different names and the same argument list
5393. the same name and the same argument list
5404. the same name and different argument lists
5414.0
54270 Specify the 2 library functions to dynamically allocate memory?
5431. malloc() and calloc()
5442. malloc() and memalloc()
5453. alloc() and memalloc()
5464. memalloc() and faralloc()
5471.0
54871 State the acronym of POMA in software project management
5491. Project Organization Monitoring Adopting
5502. Planning Origanizing Monitoring Adjusting
5513. project oriented maintenance and administration
5524. Project Orientation Mapping Adjusting
5532.0
55472 Templates improve
5551. inheritance
5562. reusability
5573. class
5584. functions
5592.0
56073 The Epsilon-Closure of any state q will contain the state ______________ irrespective
561of q.
5621. p
5632. Epsilon
5643. q
5654. Final State
5663.0
56774 The binary value for 0.4375 is
5681.
5690.1111
5702.
5710.0111
5723.
5730.0011
5744. 0.1010
5752.0
57675 The call to the parameterized constructor of base class in the derived class
5771. appears inside the definition of the derived class
5782. ppears inside the definition of the derived class constructor
5793. appears at the statement where the derived class object is created
5804. appears in the member initialization list of the derived class
581constructor
5822.0
583S.NO. Questions Choices Answers
58476 The fundamental notions of software engineering does not account for ?
5851. Software reuse
5862. Software Security
5873. Software Validation
5884. Software processes
5893.0
59077
591The language is L={0
592p1
593q0
594r
595| p,q,r ³ 0 , p ¹ r} is
5961. Context-sensitive but not context-free
5972. Recursive but not Context-free
5983. Regular
5994. Context-free
6004.0
60178 The library function used to find the last occurrence of a character in a string is
6021. strnstr()
6032. strrchr()
6043. laststr()
6054. strstr()
6062.0
60779 The major source of data for other systems are:
6081.
609Electronic Switching System
6102. Transaction Processing Systems
6113. Decision Support System
6124. Management Information System
6132.0
61480 The members of a class in c++ by default, are
6151. private
6162. protected
6173. public
6184. mandatory to specify
6191.0
62081 The minimum length for strings in the regular expression ( 10* + 001* )* is
621_________
6221. Infinite
6232. One
6243. Zero
6254. Two
6263.0
62782 The negative numbers in the binary system can be represented by
6281. 10's Complement
6292. 2's complement
6303.
631Sign magnitude
6324.
633I's complement
6342.0
63583
636The number of full and half-adders required to add 16-bit numbers is
6371.
6388 half-adders, 8 full-adders
6392.
6401 half-adders, 15 full-adders
6413.
64216 half-adders, 0 full-adders
6434. 4 half-adders, 12 full-adders
6442.0
645S.NO. Questions Choices Answers
64684
647The number of states in a machine M recognizing L1UL2 will be __________________
648where n is the number of states in M1 and m is the number of states in M2 .
6491.
650m-n
6512.
652m+n
6533.
654m+n+1
6554. n-m
6562.0
65785
658The number of states in a machine M recognizing L1UL2 will be __________________
659where n is the number of states in M1 and m is the number of states in M2 .
6601.
661m-n
6622.
663m+n
6643.
665m+n+1
6664. n-m
6672.0
66886
669The number of states in DFA is -------- the number of states in NFA for the same
670Language.
6711.
672Greater then
6732. equal to
6743.
675less then
6764.
677greater then or equal to
6783.0
67987
680The processor 80386/80486 and the Pentium processor uses _____ bits address bus:
6811.
68236
6832.
68432
6853.
68616
6874. 64
6882.0
68988 The set of all strings over the alphabet {a,b} (including epsilon} is denoted by
6901.
691(a+b)^+
6922.
693a^+b^+
6943. a*b*
6954.
696(a+b)*
6974.0
69889
699The set of fundamental assumptions about what products the organization should
700produce, how and where it should produce them, and for whom they should be
701produced is
7021. organizational culture.
7032. behavioral model.
7043. rational model.
7054. agency theory.
7061.0
70790
708The set of fundamental assumptions about what products the organization should
709produce, how and where it should produce them, and for whom they should be
710produced is
7111. organizational culture.
7122. behavioral model.
7133. rational model.
7144. agency theory.
7151.0
716S.NO. Questions Choices Answers
71791
718The special memory used to store the micro routines of a computer is ________.
7191.
720Control table
7212.
722Control store
7233.
724Control mart
7254. Control shop
7262.0
72792 The system having memory elements are called.
7281. sequential circuits
7292. complex circuits
7303. combinational circuits
7314. logic circuits
7321.0
73393 The term m45 should be made up of at least _____ literals.
7341. 6
7352. 31
7363. 4
7374. 5
7382.0
73994 The three key levels at which responsibility can be defined is at the ____,_______,____
7401. Team, Organization, contractor
7412. Project, Strategic, Activity
7423. Project, Activity, WBS
7434. Project, Organization, Team
7444.0
74595 The while loop is referred to as a(n) _____ loop because the loop condition is tested at
746the beginning of the loop
7471. priming
7482. pretest
7493. initial
7504. beginning
7512.0
75296 The word case used in the switch statement represents a
7531. global variable in the C++ language
7542. function in the C++ language
7553. keyword in the C++ language
7564. data type in the C++ language
7573.0
75897 Two access specifiers in C++ are
7591. void and free
7602. public and private
7613. int and double
7624. formal and informal
7632.0
76498 Usecase analysis focuses upon
7651. Actors
7662. Objects
7673. Data
7684. Entities
7691.0
77099 Variables inside parenthesis of functions declarations have _______ level access.
7711. Local
7722. Global
7733. Module
7744. Universal
7751.0
776S.NO. Questions Choices Answers
777100 Virtual memory is __________
7781. A type of memory used in super computers
7792. An illusion of extremely large main memory
7803. An extremely large main memory
7814. An extremely large secondary memory
7822.0
783101
784WE RECEIVED “404 – PAGE NOT FOUND” MESSAGE, WHEN WE BROWSE
785THE WEB PAGE. WHICH PROTOCOL PROVIDES THIS MESSAGE?
7861.
787IGP
7882. EGP
7893.
790SNMP
7914.
792ICMP
7934.0
794102
795What are the minimum number of 2-to-1 multiplexers required to generate a 2-
796input AND gate and a 2-input Ex-OR gate?
7971.
7981 and 2
7992.
8001 and 3
8013.
8021 and 1
8034. 2 and 2
8041.0
805103 What does the following declaration mean?
806int (*ptr)[10];
8071. ptr is array of pointers to 10 integers
8082. ptr is a pointer to an array of 10 integers
8093. ptr is an array of 10 integers
8104. ptr is an pointer to array
8112.0
812104 What is an Accumulator?
8131. A Flip flop
8142. A counter
8153. A Sequential Logic Circuit
8164. A Combinational Logic Circuit
8173.0
818105 What is an ALU?
8191. A Combinational Logic Circuit
8202. A Sequential Logic Circuit
8213. A Combination of Combinational Circuit and Sequential Circuit
8224. A flip flop
8232,3
824106 What is the condition for setting the Overflow flag in status register?
8251. Last two sum bits are different
8262. Last two carrys are same
8273. Last two sum bits are same
8284. Last two carrys are different
8293.0
830107 What is the maximum number of reduce moves that can be taken by a bottom-up parser
831for a
8321. n/2
8332. n-1
8343. 2n-1
8354. 2^n
8362.0
837S.NO. Questions Choices Answers
838108 What is the recommended distribution of effort for a software project?
8391. 50-20-30
8402. 50-30-20
8413. 30-40-30
8424. 40-20-40
8434.0
844109 What is the return type of the conversion operator function?
8451. no return type
8462. int
8473. void
8484. float
8491.0
850110 What is the status of the inputs S0, S1, and S2 of the 74151 eight-line multiplexer in
851order for the output Y to be a copy of input I5?
8521. S0 = 1, S1 = 0, S2 = 1
8532. S0 = 1, S1 = 1, S2 = 0
8543. S0 = 0, S1 = 1, S2 = 0
8554. S0 = 0, S1 = 0, S2 = 1
8561.0
857111 What is true about constant member function of a class?
8581. cannot access any of its class data members
8592. cannot modify values of its class data members
8603. cannot modify values of its class data members which are mutable
8614. can modify values of its class data members
8622.0
863112 What will be the output of the following code #include void main() { int i; int a[3]=5; for
864(i=2;i>=0;i--) { printf(?%d\n?,a[i]); } }
8651. 0 0 5
8662. 5 0 0
8673. 5 garbage garbage
8684. 5 null null
8693.0
870113 When an instruction is read from the memory, it is called
8711.
872Memory Read cycle
8732.
874Fetch cycle
8753.
876Instruction cycle
8774.
878Memory write cycle
8793.0
880114
881When FA M is given which recognizes language L and reverse of L is found by using
882M then there can be ___________Final states
8831.
884Two
8852.
886Three
8873.
888Only one
8894. Any number
8903.0
891115
892When there is complete DFA with Five states out of which two are final states if F is
893modified such that it recognizes complement of the original language then there will be
894at least _________final states.
8951.
8963
8972.
8982
8993.
9005
9014. 7
9023.0
903116 When there is more than one final state in the reduced FA, then its regular expression
904will contain _________ operator surely
9051. dot
9062. binary +
9073. star
9084. unary +
9094.0
910S.NO. Questions Choices Answers
911117 When we concatenate two languages L1 and L2 recognized by machine M1 and M2 we
912obtain a machine with final state same as that of __________________
9131. M1 OR M2
9142. M1 AND M2
9153. M2
9164. M1
9172.0
918118 Which directory implementation is used in most Operating System?
9191. Two level directory structure
9202. Acyclic directory structure
9213. Single level directory structure
9224. Tree directory structure
9234.0
924119 Which is not a proper prototype?
9251. double funct(char x)
9262. void funct();
9273. char x();
9284. intfunct(char x, char y);
9291.0
930120 WHICH OF THE BELOW IS CALLED CLASSLESS ADDRESS?
9311.
932191.168.1.1/24
9332.
934191.168.1.1/16
9353.
936191.168.1.1/8
9374.
938191.168.1.1/4
9392.0
940121 WHICH OF THE BELOW IS NOT AN EMAIL PROTOCOL?
9411. SMTPMP
9422. IMAP
9433. POP
9444. SNMP
9454.0
946122 Which of the following calls a function named displayName, passing it no actual
947arguments?
9481. call displayName
9492. call displayName ()
9503. displayName
9514. displayName()
9524.0
953123
954Which of the following conversion is not possible (algorithmically)?
9551. nondeterministic PDA to deterministic PDA
9562. nondeterministic FSA to deterministic FSA
9573. regular grammar to context-free grammar
9584. nondeterministic TM to deterministic TM
9591.0
960124 Which of the following derivations does a top-down parser use while parsing an input
961string? The input is assumed to be scanned in left to right order.
9621. Leftmost derivation
9632. Leftmost derivation traced out in reverse
9643. Rightmost derivation
9654. Rightmost derivation traced out in reverse
9661.0
967S.NO. Questions Choices Answers
968125 Which of the following functions compares two strings?
9691. compare();
9702. cmp();
9713. stringcompare();
9724. strcmp();
9734.0
974126 Which of the following gives the memory address of a variable pointed to by pointer a?
9751. a;
9762. *a;
9773. &a;
9784. address(a);
9793.0
980127 which of the following intermediate language can be used in intermediate code
981generation?
9821. Quadraples
9832. Postfix notation and Three address code
9843. Triples
9854. Infix notation and two address code
9861,3,2
987128 Which of the following is a complete function?
9881. void funct(int) { printf(?Hello"); }
9892. int funct();
9903. void funct(x) { printf(?Hello"); }
9914. int funct(int x) { return x=x+1; }
9924.0
993129 Which of the following is a valid destructor of the class name "Country"
9941. void ~Country()
9952. int ~Country(Country obj)
9963. int ~Country()
9974. Country()
9984.0
999130 which of the following is an incorrect definition inside a class ?
10001. void * operator new () { }
10012. int operator ++() { }
10023. void operator delete(void * ptr) { }
10034. void * operator new(size_t size) { }
10042.0
1005131
1006Which of the following is correct for a gated D flip-flop?
10071.
1008The output toggles if one of the inputs is held HIGH.
10092.
1010Only one of the inputs can be HIGH at a time.
10113.
1012The output complement follows the input when
1013enabled.
10144. Q output follows the input D when the enable is HIGH.
10154.0
1016132 Which of the following is not a technology driver for an information system?
10171. Collaborative technologies
10182. Knowledge asset management
10193. Enterprise applications
10204. Object technologies
10212.0
1022133 Which of the following is not a type of constructor?
10231. Copy Constructor
10242. Friend Constructor
10253. Default Constructor
10264. Parametrized Constructor
10272.0
1028S.NO. Questions Choices Answers
1029134 Which of the following is the insertion operator?
10301. /*
10312. //
10323. <<
10334. >>
10344.0
1035135 Which of the following is/are main parameters that you should use when computing the
1036costs of a software development project?
10371. Hardware and software costs
10382. Effort costs (the costs of paying software engineers and
1039managers)
10403. Travel and training costs
10414. All the parameters required given in the option.
10424.0
1043136 Which of the following language feature is not an access specifier in C++?
10441. internal
10452. protected
10463. public
10474. private
10481.0
1049137
1050Which of the following regular expression denotes a language comprising of all possible
1051strings over {a,b} of length n where n is a multiple of 3?
10521. (aaa+ab+a)+(bbb+bb+a)
10532.
1054((a+b) (a+b) (a+b))*
10553.
1056(aaa+bbb)*
10574.
1058(a+b+aa+bb+aba+bba)*
10592.0
1060138
1061Which of the following regular expression identities are true?
10621. r* s* = r* + s*
10632. (r + s)* = (r*s*)*
10643. (r + s)* = r* + s*
10654. (r + s)* = r* s*
10662.0
1067139 Which of the following results in a compile-time error?
10681. int f2() { static int i; i++; return i; }
10692. int f3( static int i) { return 300;}
10703. static int f1() { return 100; }
10714. static int a;
10723.0
1073140 Which of the following scheduling algorithm comes under preemptive scheduling?
10741. FCFS
10752. Round Robin
10763. Multilevel Queue Scheduling
10774. Largest Job First
10782.0
1079141 Which of the following special symbol is allowed in a variable name?
10801. _ (underscore)
10812. - (hyphen)
10823. | (pipeline)
10834. * (asterisk)
10841.0
1085S.NO. Questions Choices Answers
1086142
1087Which of the following statement is false?
10881. For R = R1*, L(R) is empty if and only if L(R1) is empty
10892. For R = (R1), L(R) is empty if and only if L(R1) is empty
10903. For R = R1R2 , L(R) is empty if and only if either L(R1) or L(R2) is
1091empty.
10924. If R = R1+ R2 , L(R) is empty if and only if both L(R1) and L(R2)
1093are empty.
10941.0
1095143
1096Which of the following statement is false?
10971. If there is a PDA by acceptance state that accept L, then there is
1098also a PDA by empty stack that accept L
10992. If there is a NPDA that accept L, then there is also a DPDA that
1100accept L.
11013. If there is a PDA by empty stack, then there is also a CFG G that
1102accept L.
11034. If there is a CFG G that accepts L, then there is also a PDA that
1104accept L.
1105144
1106Which of the following statements is/are FALSE?
11071. Turing recognizable languages are closed under union and
1108complementation.
11092. Turing decidable languages are closed under intersection and
1110complementation
11113. Turing recognizable languages are closed under union and
1112intersection.
11134. For every non-deterministic Turing machine, there exists an
1114equivalent deterministic Turing machine.
1115145 Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
11161. Removing left recursion alone
11172. Factoring the grammar alone
11183. Removing left recursion and factoring the grammar
11194. Removing left recursion, left factoring and ambiguity of the
1120grammar
11214.0
1122146 Which of the following ways are legal to access a class data member using this pointer?
11231. this.x
11242. *this.x
11253. this->x
11264. *this-x
11273.0
1128147 Which one of the following is a top-down parser?
11291. An LR(k) parser.
11302. An LALR(k) parser
11313. Operator precedence parser.
11324. Recursive descent parser.
11334.0
1134148 Which one of the following is a valid project Key Performance Indicator (KPI)?
11351. Master schedule.
11362. Staff appraisals.
11373. Management buy in.
11384. Milestone achievement.
11394.0
1140S.NO. Questions Choices Answers
1141149 Which one of the following is the correct way to declare a pure virtual function?
11421. virtual void Display(void){0};
11432. void Display(void) = 0;
11443. virtual void Display(void) = 0;
11454. virtual void Display = 0;
11463.0
1147150
1148Which one of the following languages over alphabet {0,1} is described by the regular
1149expression:
1150(0+1)*0(0+1)*0(0+1)*?
11511.
1152The set of all strings containing at least two 0’s
11532. The set of all strings that begin and end with either 0 or 1.
11543.
1155The set of all strings containing at most two 0’s.
11564.
1157The set of all strings containing the substring 00.
11581.0
1159151 Which one of the following models is not suitable for accommodating any change?
11601. Build & Fix Model
11612. RAD Model
11623. Waterfall Model
11634. Prototyping Model
11643.0
1165152
1166Which one of the following regular expressions over {0,1} denotes the set of all strings
1167not containing 100 as a substring?
11681.
11690*(11*0)*
11702. 0*1*01
11713.
11720*(10+1)*
11734.
11740*1010*
11751234.0
1176153 Which one of the following statements best defines the purpose of a Product Breakdown
1177Structure (PBS)?
11781. To identify the health and safety strategies and procedures to be
1179used on the project
11802. To establish the extent of work required prior to project
1181commissioning and the handover
11823. To define how the products are produced by identifying
1183derivations and dependencies
11844. To define the hierarchy of deliverables that are required to be
1185produced on the project
11864.0
1187154 Who owns the Project Management Plan (PMP)?
11881. The project team.
11892. The chief executive.
11903. The project manager.
11914. The project support office.
11923.0
1193155
1194Write the regular expression to denote the language L over ? ={ a,b} such that all the
1195string do not contain the substring “ ab”.
11961. a*b*
11972. b*a*
11983. (ab)*
11994. (ba)*
120024.0
1201156 Zero address instruction format is used for
12021.
1203Von-Neuman architecture
12042.
1205RISC architecture
12063.
1207CISC architecture
12084. Stack-organized architecture
12094.0
1210S.NO. Questions Choices Answers
1211157
1212In a slab under steady state conduction if the thermal conductivity increases along the
1213thickness, the temperature gradient along the direction will become
12141.
1215Steeper
12162.
1217Flatter
12183.
1219Constant
12204.
1221mixed pattern
12223.0
1223158
1224The temperature of a gas stream is to be measured by a thermocouple whose junction can be
1225approximated as 1-mm-dia sphere. The properties of the junction are k = 35 W/m °C, ρ = 8500
1226kg/m3
1227, and Cp = 320 J/kg °C, and the convection heat transfer coefficient between the junction
1228and the gas is h = 210 W/m2 °C. The time taken by the thermocouple to read 99 percent of the
1229initial temperature difference
12301.
12312 sec
12322.
123310 sec
12343.
123528 sec
12364.
123763 sec
12383.0
1239159 Assuming flow to be laminar, if the diameter of the pipe is halved, then the pressure drop
1240will
12411.
1242increase
12432.
1244decrease
12453.
1246remain same
12474.
1248be quadrupled
12491.0
1250160 Dimension of absolute viscosity is
12511.
1252ML
1253-1T
1254-1
12552.
1256MLT
1257-1
12583.
1259ML
1260-1T
12614.
1262MLT
12631.0
1264161
1265Which of the following is minimum error code?
12661.Octal code
12672.Grey code
12683.Binary code
12694.
1270Excess 3 code
12712.0
1272162
1273When used with an IC, what does the term "QUAD" indicate?
12741.
12754 circuits
12762.
12772 circuits
12783.
12798 circuits
12804.
12816 circuits
12821.0
1283S.NO. Questions Choices Answers
1284163 Adding 1001 and 0010 gives
12851.
12861011
12872.
12881111
12893.
12900
12914.
12921010
12931.0
1294164 Radix of binary number system is _____?
12951.
12960
12972.
12981
12993.
13002
13014.
1302A&B
13033.0
1304165 SR Flip flop can be converted to T-type flip-flop if ?
13051. is connected to Q
13062.R is connected to Q
13073.Both S and R are shortend
13084.S and R are connected to Q and Q' respectively
13094.0
1310166 The main difference between JK and RS flip-flop is that?
13111.
1312JK flip-flop does not need a clock pulse
13132.
1314there is feedback in JK flip-flop
13153.
1316JK flip-flop accepts both inputs as 1
13174.
1318JK flip-flop is acronym of junction cathode multivibrator
13193.0
1320167
1321Register is a --------------------
13221.Set of capacitor used to register input instructions in a digital
1323computer
13242.Set of paper tapes and cards put in a file
13253.
1326Temporary storage unit within the CPU having dedicated or general
1327purpose use
13284.Part of the auxiliary memory
13293.0
1330S.NO. Questions Choices Answers
1331168 Magnitude comparator compares using operation of
13321.
1333addition
13342.
1335subtraction
13363.
1337multiplication
13384.
1339division
1340xnor1
1341169 An SR flip flop cannot accept the following input entry
13421.
1343Both input zero
13442.
1345zero at R and one at S
13463.
1347zero at S and one at R
13484.
1349Both inputs one
13504.0
1351170 One operation that is not given by magnitude comparator
13521.
1353equal
13542.
1355less
13563.
1357greater
13584.
1359addition
13602.0
1361171 Automaton accepting the regular expression of any number of a ' s is:
13621.
1363a*
13642.
1365a
13663.
1367a*b*
13684.
1369abc
13701.0
1371172
1372Let L be a set accepted by a nondeterministic finite automaton. The number of states in
1373non-deterministic finite automaton is |Q|. The maximum number of states in equivalent
1374finite automaton that accepts L is
13751.
1376|Q|
13772.
13782|Q|
13793.
13802 raise to power |Q|*1
13814.
13822 raise to power |Q|
13834.0
1384S.NO. Questions Choices Answers
1385173 Number of final state require to accept Φ(phi) in minimal finite automata.
13861.
13874
13882.
13893
13903.
13911
13924.
13930
13944.0
1395174 The embedded c program is converted by cross compiler to
13961.
1397the machine code corresponding to the processor of the PC used for
1398application development
13992.
1400the machine code corresponding to a processor which is different
1401from the processor of the PC used for application development
14023.
1403the machine code for all the microcontrollers
14044.
1405assemble code of the PC used for application development
14062.0
1407175 The regular expression 0*(10*)* denotes the same set as
14081.
1409(1*0)*1*
14102.
14110 + (0 + 10)*
14123.
1413(0 + 1)* 10(0 + 1)*
14144.
1415(0+1)*
14161.0
1417176
1418Which of the following statements is/are FALSE?
1419(1) For every non-deterministic Turing machine, there exists an equivalent deterministic
1420Turing machine.
1421(2) Turing recognizable languages are closed under union and complementation.
1422(3) Turing decidable languages are closed under intersection and complementation
1423(4) Turing recognizable languages are closed under union and intersection.
14241.
14251 and 4 only
14262.
14271 and 3 only
14283.
14292 only
14304.
14313 only
14323.0
1433S.NO. Questions Choices Answers
1434177 Two automata are equal when
14351.
1436both are under union
14372.
1438both are under same language
14393.
1440both are having equal number of states
14414.
1442both are having same number of final states
14432.0
1444178
1445What is the minimum number of states needed to a DFA over Σ= (a, b) which accept
1446those words from Σ such that the number of a is even and the number of b is divisible
1447by three.
14481.
14492 states
14502.
14514 states
14523.
14536 states
14544.
14555 states
14563.0
1457179
1458If a language is denoted by a regular expression
1459L = ( x )* (x | y x ) ,
1460then which of the following is not a legal string within L ?
14611.
1462yx
14632.
1464xyx
14653.
1466x
14674.
1468x y x y x
14694.0
1470180
1471The CFG
1472s---> as | bs| a | b
1473is equivalent to regular expression
14741.
1475(a + b)
14762.
1477(a + b) (a + b)*
14783.
1479(a + b) (a + b)
14804.
1481(a + b) (a + b)(a + b) (a + b)
14822.0
1483S.NO. Questions Choices Answers
1484181 ----------------------------is used to check whether the language is not regular.
14851.
1486Pumping Lemma
14872.
1488RE
14893.
1490MN Theorem
14914.
1492Pigeon hole principle
14931.0
1494182
1495The minimum number of page frames that must be allocated to a running process in a
1496virtual memory environment is determined by
14971.
1498the instruction set architecture
14992.
1500page size
15013.
1502physical memory size
15034.
1504number of processes in memory
15051.0
1506183
1507A computer has a 256 KByte, 4-way set associative, write back data cache with block
1508size of 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each
1509cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit
1510and 1 replacement bit. The size of the cache tag directory is
15111.
151211
15132.
151414
15153.
151627
15174.
151816
15194.0
1520184 Pre-emptive scheduling is the strategy of temporarily suspending a running process
15211.
1522before the CPU time slice expires
15232.
1524to allow starving processes to run
15253.
1526when it requests IO
15274.
1528None of mentioned
15291.0
1530185 Multiprogramming systems ______
15311.
1532Are easier to develop than single programming systems
15332.
1534Execute each job faster
15353.
1536Execute more jobs in the same time
15374.
1538Are used only on large main frame computers
15393.0
1540S.NO. Questions Choices Answers
1541186
1542The DMA controller has _______ registers
15431.
15444
15452.
15462
15473.
15483
15494.
15501
15513.0
1552187
1553The truth table
1554X Y f(X,Y)
15550 0 0
15560 1 0
15571 0 1
15581 1 1
1559represents the Boolean function
15601.
1561X
15622.
1563X+Y
15643.
1565X'Y'
15664.
1567Y
15681.0
1569188 Which of the following regular expression denotes a language comprising of all
1570possible strings over ∑= {a,b} of length n where n is a multiple of 3?
15711.
1572(a+b+aa+bb+aba+bba)*
15732.
1574(aaa+bbb)*
15753.
1576((a+b) (a+b) (a+b))*
15774.
1578(aaa+ab+a)+(bbb+bb+a)
15793.0
1580189 Which of the following statement is true?
15811.NFA is more powerful than DFA
15822.DFA is more powerful than NFA
15833.
1584NFA and DFA have equal power
15854.None
15863.0
1587190 Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of
1588size 64. Which of the following most closely approximates the maximum input size of a
1589problem that can be solved in 6 minutes?
15901.256 2.2048 3.1024 4.512 4.0
1591191 ElGamal encryption system is:
15921.
1593symmetric key encryption algorithm
15942.
1595asymmetric key encryption algorithm
15963.
1597not an encryption algorithm
15984.
1599none of the mentioned
16002.0
1601S.NO. Questions Choices Answers
16021
16039
16042
1605#in
1606clu
1607d
1608e
1609<
1610s
1611t
1612dio.h
1613> int main() { typedef auto int AI; AI var=100; printf("var=%d",var
1614); return 0; }Find the output
16151. va
1616r
1617=
16181
16190
16200
16212. va
1622r
1623=
1624AI 3. var=0 4. Error
16254.0
16261
16279
16283
1629#in
1630clu
1631d
1632e
1633<
1634s
1635t
1636dio.h
1637> int main() { typedef char* strin
1638g; string myName="AB
1639C
1640D
1641E
1642F
1643G
1644"; printf("myName=%s (size=%d
1645)
1646",m
1647y
1648N
1649a
1650m
1651e,siz
1652e
1653o
1654f
1655(
1656m
1657y
1658N
1659a
1660m
1661e
1662)
1663); return 0; }Find the output
16641. m
1665y
1666N
1667a
1668m
1669e
1670=
1671A
1672B
1673C
1674D
1675E
1676F
1677G
1678(
1679siz
1680e
1681=
16827
1683)
16842. E
1685r
1686r
1687o
1688r
16893. m
1690y
1691N
1692a
1693m
1694e
1695=
1696A
1697B
1698C
1699D
1700E
1701F
1702G
1703(
1704siz
1705e
1706=
17074
1708)
17094. m
1710y
1711N
1712a
1713m
1714e
1715=
1716A
1717B
1718C
1719D
1720E
1721F
1722G
1723(
1724siz
1725e
1726=
17278
1728)
17294.0
17301
17319
17324
1733#in
1734clu
1735d
1736e
1737<
1738s
1739t
1740dio.h
1741> int main() { typedef int AAA,B
1742B
1743B,C
1744C
1745C,D
1746D
1747D; AAA aaa=10; BBB bbb=20; CCC ccc=30; DDD ddd=40; printf("%d,%d,%d,%d",aaa,bbb,c
1748c
1749c,d
1750d
1751d
1752); return 0; }Find the output
17531. E
1754r
1755r
1756o
1757r
17582. 10,1
17590,1
17600,1
17610
17623. 10,2
17630,3
17640,4
17650
17664. AA
1767A,B
1768B
1769B,C
1770C
1771C,D
1772D
1773D
17743.0
17751
17769
17775
1778#in
1779clu
1780d
1781e
1782<
1783s
1784t
1785dio.h
1786> int main() { typedef struct { int empid; int bsal; }EMP; EMP E={10012,1
17875
17881
17890
17900
1791}; printf("%d,%d",E.empid,E.b
1792s
1793al); return 0; }Find the output
17941. 10
17950
17961
17972,1
17982
17991
18000
18010
18022. 0,0 3. Err
1803o
1804r
18054. 10
18060
18071
18082,1
18090
18100
18111
18122
18131.0
18141
18159
18166
1817#in
1818clu
1819d
1820e
1821<
1822s
1823t
1824dio.h
1825>
1826v
1827oid
1828m
1829ain
1830(
1831)
1832{
1833u
1834n
1835sig
1836n
1837e
1838d
1839c
1840h
1841a
1842r
1843v
1844a
1845r
1846=
18470; for(var=0;var<=255;va
1848r
1849+
1850+
1851); { printf("%d ",var); }
1852}Fin
1853d
1854t
1855h
1856e
1857o
1858u
1859t
1860p
1861u
1862t
18631. 0
18641
18652 ... 2
18665
18675
18682. 25
18695
18703. 25
18716
18724. bla
1873n
1874k
1875s
1876c
1877r
1878e
1879e
1880n
1881a
1882s
1883o
1884u
1885t
1886p
1887u
1888t
18891.0
1890S.N
1891O. Q
1892u
1893e
1894s
1895tio
1896n
1897s
1898C
1899h
1900oic
1901e
1902s
1903A
1904n
1905s
1906w
1907e
1908r
1909s
19101
19119
19127
1913#in
1914clu
1915d
1916e
1917<
1918s
1919t
1920dio.h
1921>
1922#
1923d
1924e
1925fin
1926e
1927M
1928O
1929BIL
1930E
19310
1932x
19330
19341
1935#
1936d
1937e
1938fin
1939e
1940L
1941A
1942P
1943P
1944Y
19450
1946x
19470
19482 int main() {unsigned char item=0
1949x
19500
19510; item |=MOBILE; item |=LAPPY; printf("I have purchased ...:"
1952); if(item & MOBILE){ printf("Mobile, "); }if(item & LAPPY){ printf("Lappy"); }return 1; }
19531. I h
1954a
1955v
1956e
1957p
1958u
1959r
1960c
1961h
1962a
1963s
1964e
1965d ...: 2. I have purchased ...:M
1966o
1967bile, L
1968a
1969p
1970p
1971y
19723. I h
1973a
1974v
1975e
1976p
1977u
1978r
1979c
1980h
1981a
1982s
1983e
1984d ...:M
1985o
1986bile, 4. I have purchased ...:Lappy
19872.0
19881
19899
19908
1991#in
1992clu
1993d
1994e
1995<
1996s
1997t
1998dio.h
1999> int main() {char flag=0x0f; flag &= ~0x02; printf("%d",flag); return 0; }Predict the Outp
2000u
2001t. 1. 132. d3. 224. 10
20021.0
20031
20049
20059
2006#in
2007clu
2008d
2009e
2010<
2011s
2012t
2013dio.h
2014> int main() {int a=10; int b=2; int c; c=(a & b); printf("c= %d",c); return 0; }Find the output. 1. c
2015=
20161
20172
20182. c
2019=
20201
20210
20223. c
2023=
20242
20254. c
2026=
20270
20283.0
20292
20300
20310
2032#in
2033clu
2034d
2035e
2036<
2037s
2038t
2039dio.h
2040>
2041#
2042d
2043e
2044fin
2045e
2046F
2047U
2048N
2049(
2050x,y
2051)
2052x
2053#
2054#
2055y int main() {int a1=10,a2=20; printf("%d...%d",FUN(a,1
2056),F
2057U
2058N
2059(
2060a,2
2061)
2062); return 0; }Find the output
20631. E
2064r
2065r
2066o
2067r
20682. 10...1
20690
20703. 20...2
20710
20724. 10...2
20730
20744.0
20752
20760
20771
2078#in
2079clu
2080d
2081e
2082<
2083s
2084t
2085dio.h
2086>
2087#
2088d
2089e
2090fin
2091e
2092L
2093A
2094R
2095G
2096E
2097S
2098T
2099(
2100x,y
2101)
2102(
2103x
2104>
2105=
2106y
2107)
2108?
2109x:y int main() { int a=10,b=20,l=0; l=LARGEST(a++,b++); printf("a=%d,b=%d,largest=%d",a,b,l); return 0; }Find the output
21101. a=
21111
21120,b
2113=
21142
21150,la
2116r
2117g
2118e
2119s
2120t
2121=
21222
21230
21242. a=
21251
21261,b
2127=
21282
21291,la
2130r
2131g
2132e
2133s
2134t
2135=
21362
21370
21383. a=
21391
21401,b
2141=
21422
21431,la
2144r
2145g
2146e
2147s
2148t
2149=
21502
21511
21524. a=
21531
21541,b
2155=
21562
21572,la
2158r
2159g
2160e
2161s
2162t
2163=
21642
21651
21664.0
2167S.N
2168O. Q
2169u
2170e
2171s
2172tio
2173n
2174s
2175C
2176h
2177oic
2178e
2179s
2180A
2181n
2182s
2183w
2184e
2185r
2186s
21872
21880
21892
2190#in
2191clu
2192d
2193e
2194<
2195s
2196t
2197dio.h
2198>
2199#
2200d
2201e
2202fin
2203e
2204M
2205A
2206X
22071
22080
22090 int main() {#define MAX 20 printf("MAX=%d...",M
2210A
2211X
2212); return 0; }Find the output
22131. E
2214r
2215r
2216o
2217r
22182. M
2219A
2220x
2221=
22221
22230
22240... 3. MAx=20... 4. MAX=1002
22250
22263.0
22272
22280
22293
2230#in
2231clu
2232d
2233e
2234<
2235s
2236t
2237dio.h
2238>
2239#
2240d
2241e
2242fin
2243e
2244M
2245A
2246X
22471
22480 int main() { int array[MAX]=
2249{
22501,2,3
2251},t
2252ally; for(tally=0;tally< sizeof(array
2253)
2254/siz
2255e
2256o
2257f
2258(in
2259t
2260);t
2261ally
2262+
2263=
22641
2265)
2266p
2267rin
2268t
2269f
2270(
2271"
2272%
2273d
2274",*
2275(
2276t
2277ally
2278+
2279a
2280r
2281r
2282a
2283y
2284)
2285); return 0; }Find the output
22861. E
2287r
2288r
2289o
2290r
22912. 1
22923
22934
22945
22956
22967
22978
22989
22991
23000
23011
23021
23033. 1
23042
23053
23060
23070
23080
23090
23100
23110
23120
23134. 0
23140
23150
23160
23170
23180
23190
23200
23210
23220
23233.0
23242
23250
23264
2327#in
2328clu
2329d
2330e
2331<
2332s
2333t
2334dio.h
2335>
2336#
2337d
2338e
2339fin
2340e
2341M
2342A
2343X
23449
23459 int main() { printf("%d...",M
2346A
2347X
2348); #undef MAX printf("%d",MAX); return 0; }Find the output
23491. 99...0 2. 99...9
23509
23513. E
2352r
2353r
2354o
2355r
23564. M
2357A
2358X...M
2359A
2360X
23613.0
23622
23630
23645
2365#in
2366clu
2367d
2368e
2369<
2370s
2371t
2372dio.h
2373>
2374#
2375d
2376e
2377fin
2378e
2379T
2380E
2381X
2382T In
2383clu
2384d
2385e
2386H
2387elp int main() { printf("%s",TEXT); return 0; }Find the output
23881. In
2389clu
2390d
2391e
2392H
2393elp
23942. TE
2395X
2396T
23973. E
2398r
2399r
2400o
2401r
24024. TE
2403X
2404T In
2405clu
2406d
2407e
2408H
2409elp
24103.0
24112
24120
24136
2414#in
2415clu
2416d
2417e
2418<
2419s
2420t
2421dio.h
2422>
2423#
2424d
2425e
2426fin
2427e
2428T
2429R
2430U
2431E
24321 int main() { if(TRUE) printf("1"); printf("2"); elseprintf("3"); printf("4"); return 0; }Find the output. 1. 12. E
2433r
2434r
2435o
2436r
24373. 24. 12
24382.0
2439S.N
2440O. Q
2441u
2442e
2443s
2444tio
2445n
2446s
2447C
2448h
2449oic
2450e
2451s
2452A
2453n
2454s
2455w
2456e
2457r
2458s
24592
24600
24617
2462#in
2463clu
2464d
2465e
2466<
2467s
2468t
2469dio.h
2470>
2471#
2472d
2473e
2474fin
2475e
2476T
2477R
2478U
2479E
24801 int main() { int loop=10; while(printf("H
2481ello
2482"
2483)
2484&
2485& lo
2486o
2487p
2488-
2489-
2490); }Find the output
24911. H
2492ello
24932. H
2494ello
2495H
2496ello
2497H
2498ello
2499H
2500ello ... (in
2501finit
2502e
2503tim
2504e
2505s
2506)
25073. H
2508ello
2509(
25101
25110
2512tim
2513e
2514s
2515)
25164. H
2517ello
2518(
25191
25201
2521tim
2522e
2523s
2524)
25254.0
25262
25270
25288
2529#in
2530clu
2531d
2532e
2533<
2534s
2535t
2536dio.h
2537>
2538#
2539d
2540e
2541fin
2542e
2543V
2544A
2545R
25461
2547V
2548A
2549R
25502
2551+
25521
25530
2554#
2555d
2556e
2557fin
2558e
2559V
2560A
2561R
25622
2563V
2564A
2565R
25661
2567+
25682
25690 int main() { printf("%d",VAR1); return 0; }Find the output
25701. VA
2571R
25722
2573+
25741
25750
25762. VA
2577R
25781
2579+
25802
25810
25823. E
2583r
2584r
2585o
2586r
25874. 10
25883.0
25892
25900
25919
2592#in
2593clu
2594d
2595e
2596<
2597s
2598t
2599dio.h
2600>
2601#in
2602clu
2603d
2604e
2605<
2606s
2607t
2608rin
2609g.h
2610>
2611s
2612t
2613r
2614u
2615c
2616t
2617s
2618t
2619u
2620d
2621e
2622n
2623t
2624{
2625c
2626h
2627a
2628r
2629n
2630a
2631m
2632e[2
26330]; }std; char * fun(struct s
2634t
2635u
2636d
2637e
2638n
2639t
2640*
2641t
2642e
2643m
2644p
2645S
2646t
2647d
2648)
2649{
2650s
2651t
2652r
2653c
2654p
2655y
2656(
2657t
2658e
2659m
2660p
2661S
2662t
2663d
2664-
2665>
2666n
2667a
2668m
2669e,"
2670T
2671h
2672o
2673m
2674a
2675s
2676"
2677); return tempStd->name; }int main() { strcpy(std.name,"Mike "); printf("%s%s",std.name,fun(&std)); return 0; }Find the output
26781. Mik
2679e
2680T
2681h
2682o
2683m
2684a
2685s
26862. Mik
2687e
2688Mik
2689e
26903. Th
2691o
2692m
2693a
2694s
2695T
2696h
2697o
2698m
2699a
2700s
27014. Th
2702o
2703m
2704a
2705s
2706Mik
2707e
27083.0
27092
27101
27110
2712#in
2713clu
2714d
2715e
2716<
2717s
2718t
2719dio.h
2720>
2721#in
2722clu
2723d
2724e
2725<
2726s
2727t
2728rin
2729g.h
2730> int main() { char s1[]="Includ
2731e
2732H
2733elp
2734"; char s2[10]; strncpy(s2,s1,5); printf("%s",s2); return 0; }Find the output
27351. In
2736clu
27372. In
2738clu
2739G
2740A
2741R
2742B
2743A
2744G
2745E
2746_
2747V
2748A
2749L
2750U
2751E
27523. E
2753r
2754r
2755o
2756r
27574. In
2758clu
2759d
2760e
2761H
2762elp
27631.0
27642
27651
27661
2767#in
2768clu
2769d
2770e
2771<
2772s
2773t
2774dio.h
2775>
2776#in
2777clu
2778d
2779e
2780<
2781s
2782t
2783rin
2784g.h
2785> int main() { char str1[]="Includ
2786e
2787H
2788elp
2789",s
2790t
2791r
27922[]=
2793".C
2794o
2795m
2796"; printf("%s",str1+strlen(str2)); return 0; }Find the output
27971. In
2798clu
2799d
2800e
2801H
2802elp.C
2803o
2804m
28052. ud
2806e
2807H
2808elp
28093. E
2810r
2811r
2812o
2813r
28144. In
2815clu
2816d
2817e
2818H
2819elp
28204
28212.0
2822S.N
2823O. Q
2824u
2825e
2826s
2827tio
2828n
2829s
2830C
2831h
2832oic
2833e
2834s
2835A
2836n
2837s
2838w
2839e
2840r
2841s
28422
28431
28442
2845#in
2846clu
2847d
2848e
2849<
2850s
2851t
2852dio.h
2853>
2854#in
2855clu
2856d
2857e
2858<
2859s
2860t
2861rin
2862g.h
2863> int main() { char str[50]="Inclu
2864d
2865e
2866H
2867elp
2868"; printf("%d...%d",strlen(str),siz
2869e
2870o
2871f
2872(
2873s
2874t
2875r
2876)
2877); return 0; }Find the output
28781. 50...5
28790
28801
28811...5
28820
28832. 11...5
28840
28853. 11...1
28861
28874. 50...1
28881
28892.0
28902
28911
28923
2893#in
2894clu
2895d
2896e
2897<
2898s
2899t
2900dio.h
2901>
2902#in
2903clu
2904d
2905e
2906<
2907s
2908t
2909rin
2910g.h
2911> int main() { int val=0; char str[]="Includ
2912e
2913H
2914elp.C
2915o
2916m
2917"; val=strcmp(str,"includehelp.co
2918m
2919"
2920); printf("%d",val); return 0; }Find the output
29211. 02. 13. -14. E
2922r
2923r
2924o
2925r
29263.0
29272
29281
29294
2930#in
2931clu
2932d
2933e
2934<
2935s
2936t
2937dio.h
2938>
2939#
2940d
2941e
2942fin
2943e
2944O
2945F
2946F
29470
2948#if
2949d
2950e
2951b
2952u
2953g
2954=
2955=
2956O
2957F
2958F int a=11; #endif int main() { int b=22; printf("%d...%d",a,b
2959); return 0; }Find the output
29601. 11...2
29612
29622. E
2963r
2964r
2965o
2966r
29673. 11...1
29681
29694. 22...2
29702
29711.0
29722
29731
29745
2975#in
2976clu
2977d
2978e
2979<
2980s
2981t
2982dio.h
2983> int main() { char *text="Hi Ba
2984b
2985s."; char x=(char)(text+3); printf("%c\n",x); return 0; }Find the output
29861. G
2987a
2988r
2989b
2990a
2991g
2992e
29932. B3. E
2994r
2995r
2996o
2997r
29984. N
2999ull 4.0
30002
30011
30026
3003#in
3004clu
3005d
3006e
3007<
3008s
3009t
3010dio.h
3011> int main() { char *text="Hi Ba
3012b
3013s."; char x=(char)(text[3]); printf("%c\n",x); return 0; }Find the output
30141. G
3015a
3016r
3017b
3018a
3019g
3020e
30212. B3. E
3022r
3023r
3024o
3025r
30264. N
3027ull 2.0
3028S.N
3029O. Q
3030u
3031e
3032s
3033tio
3034n
3035s
3036C
3037h
3038oic
3039e
3040s
3041A
3042n
3043s
3044w
3045e
3046r
3047s
30482
30491
30507
3051#in
3052clu
3053d
3054e
3055<
3056s
3057t
3058dio.h
3059> int main() { int anyVar=10; printf("%d",10); return 0; }extern int anyVar; Find the output
30601. C
3061o
3062m
3063plie
3064tim
3065e
3066e
3067r
3068r
3069o
3070r
30712. 103. Ru
3072n
3073Tim
3074e
3075e
3076r
3077r
3078o
3079r
30804. N
3081o
3082o
3083u
3084t
3085p
3086u
3087t
30882.0
30892
30901
30918
3092#in
3093clu
3094d
3095e
3096<
3097s
3098t
3099dio.h
3100> int main() { int x=2.3; const char c1=(flo
3101a
3102t
3103)
3104x; const char c2=(int)x; printf("%d,%d\n",c1,c2
3105); return 0; }Find the output
31061. E
3107r
3108r
3109o
3110r
31112. 2.3,2 3. 2.300
31120
31130
31140
31150,2
31164. 2,2
31172.0
31182
31191
31209
3121#in
3122clu
3123d
3124e
3125<
3126s
3127t
3128dio.h
3129>
3130s
3131t
3132r
3133u
3134c
3135t
3136s
3137a
3138m
3139ple
3140{ in
3141t
3142a; }sample; int main(
3143)
3144{
3145s
3146a
3147m
3148ple.a
3149=
31501
31510
31520; printf("%d",sam
3153ple.a
3154); return 0; }Find the output
31551. 02. 10
31560
31573. E
3158R
3159R
3160O
3161R
31624. ar
3163nin
3164g
31652.0
31662
31672
31680
3169#in
3170clu
3171d
3172e
3173<
3174s
3175t
3176dio.h
3177>
3178c
3179h
3180a
3181r
3182*
3183f
3184u
3185n
31861
3187(
3188v
3189oid
3190)
3191{
3192c
3193h
3194a
3195r
3196s
3197t
3198r[]=
3199"
3200H
3201ello
3202"; return str; }char* fun2(void) { char *str="Hello"; return str; }int main() { printf("%s,%s",fun
32031
3204(
3205),f
3206u
3207n
32082
3209(
3210)
3211); return 0; }Find the output
32121. E
3213R
3214R
3215O
3216R
32172. H
3218ello,H
3219ello
32203. H
3221ello,G
3222a
3223r
3224b
3225a
3226g
3227e
32284. G
3229a
3230r
3231b
3232a
3233g
3234e,H
3235ello
32364.0
32372
32382
32391
3240#in
3241clu
3242d
3243e
3244<
3245s
3246t
3247dio.h
3248>
3249c
3250h
3251a
3252r
3253*
3254s
3255t
3256r
3257F
3258u
3259n
3260(
3261v
3262oid
3263)
3264{
3265c
3266h
3267a
3268r
3269*
3270s
3271t
3272r
3273=
3274"In
3275clu
3276d
3277e
3278H
3279elp
3280"; return str; }int main() { char *x; x=strFun(); printf("str value = %s",x); return 0; }Find the output
32811. st
3282r
3283v
3284alu
3285e
3286=
3287G
3288a
3289r
3290b
3291a
3292g
3293e
3294v
3295alu
3296e
32972. st
3298r
3299v
3300alu
3301e
3302= In
3303clu
3304d
3305e
3306H
3307elp
33083. E
3309r
3310r
3311o
3312r
33134. N
3314o
3315o
3316u
3317t
3318p
3319u
3320t
33212.0
3322S.N
3323O. Q
3324u
3325e
3326s
3327tio
3328n
3329s
3330C
3331h
3332oic
3333e
3334s
3335A
3336n
3337s
3338w
3339e
3340r
3341s
33422
33432
33442
3345#in
3346clu
3347d
3348e
3349<
3350s
3351t
3352dio.h
3353> int fooo(void) { static int num=0; num++; return num; }int main() { int val; val=fooo(); printf("step1: %d
3354\
3355n
3356",v
3357al); val=fooo(); printf("step2: %d\n",val); val=fooo(); printf("step3: %d\n",val); return 0; }Find the output
33581. st
3359e
3360p
33611: 1
3362s
3363t
3364e
3365p
33662: 1
3367s
3368t
3369e
3370p
33713: 1
33722. st
3373e
3374p
33751: 1
3376s
3377t
3378e
3379p
33802: 2
3381s
3382t
3383e
3384p
33853: 3
33863. st
3387e
3388p
33891: 0
3390s
3391t
3392e
3393p
33942: 0
3395s
3396t
3397e
3398p
33993: 0
34004. E
3401R
3402R
3403O
3404R
34052.0
34062
34072
34083
3409#in
3410clu
3411d
3412e
3413<
3414s
3415t
3416dio.h
3417> int main() {#ifdef debug printf("Start debu
3418g
3419gin
3420g..."
3421); #endif printf("IncludeHelp"); return 0; }Find the output
34221. St
3423a
3424r
3425t
3426d
3427e
3428b
3429u
3430g
3431gin
3432g...In
3433clu
3434d
3435e
3436H
3437elp
34382. In
3439clu
3440d
3441e
3442H
3443elp
34443. E
3445r
3446r
3447o
3448r
34494. de
3450b
3451u
3452g
34532.0
34542
34552
34564
3457#in
3458clu
3459d
3460e
3461<
3462s
3463t
3464dio.h
3465> int main() { int a[5]={0x00,0x
34660
34671,0
3468x
34690
34702,0
3471x
34720
34733,0
3474x
34750
34764
3477},i; i=4; while(a[i]) { printf("%02d ",*a+i); --i; }return 0; }Find the output
34781. 00
34790
34801
34810
34822
34830
34843
34850
34864
34872. 04
34880
34893
34900
34912
34920
34931
34940
34950
34963. 04
34970
34983
34990
35002
35010
35021
35034. 01
35040
35052
35060
35073
35080
35094
35103.0
35112
35122
35135
3514#in
3515clu
3516d
3517e
3518<
3519s
3520t
3521dio.h
3522> int main() { int a[5]={1,2,3,4,5
3523},b[5]=
3524{
35251
35260,2
35270,3
35280,4
35290,5
35300
3531},t
3532ally; for(tally=0;tally< 5;++tally) *(a+tally)=*(tally+a)+ *(b+tally); for(tally=0;tally< 5;tally++) printf("%d ",*(a+tally)); return 0; }Find the output
35331. 1
35342
35353
35364
35375
35382. 10
35392
35400
35413
35420
35434
35440
35455
35460
35473. 11
35482
35492
35503
35513
35524
35534
35545
35555
35564. E
3557r
3558r
3559o
3560r
35613.0
35622
35632
35646
3565#in
3566clu
3567d
3568e
3569<
3570s
3571t
3572dio.h
3573> int main() { static int array[]=
3574{
35751
35760,2
35770,3
35780,4
35790,5
35800
3581}; printf("%d...%d",*array,*(array+3)*
3582*
3583a
3584r
3585r
3586a
3587y
3588); return 0; }Find the output
35891. E
3590r
3591r
3592o
3593r
35942. 10...4
35950
35963. 10...3
35970
35980
35994. 10...4
36000
36010
36024.0
3603S.N
3604O. Q
3605u
3606e
3607s
3608tio
3609n
3610s
3611C
3612h
3613oic
3614e
3615s
3616A
3617n
3618s
3619w
3620e
3621r
3622s
3623227
3624#include <stdio.h>
3625int main()
3626{ static int x[]={'A','B','C','D','E'},tally;
3627for(tally=0;tally< sizeof(x)/sizeof(int) ; tally+=1)
3628printf("%c,%c,%c\n",*(x+tally)+1,x[tally]+1,*(tally+x)+1);
3629return 0;
3630}
3631Find the output
36321.
3633Error
36342.
3635A,A,A
3636B,B,B
3637C,C,C
3638D,D,D
3639E,E,E
36403.
3641B,B,B
3642C,C,C
3643D,D,D
3644E,E,E
3645F,F,F
36464.
3647E,E,E
3648D,D,D
3649C,C,C
3650B,B,B
3651A,A,A
36523.0
3653228
3654#include <stdio.h>
3655int main()
3656{
3657char result,str[]="\0IncludeHelp";
3658result=printf("%s",str);
3659if(result)
3660printf("TRUE");
3661else
3662printf("FALSE");
3663return 0;
3664}
3665Find the output
36661.
3667\0IncludeHelpTRUE
36682.
3669\0IncludeHelpFALSE
36703.
3671Error
36724.
3673FALSE
36744.0
3675229
3676#include <stdio.h>
3677int main()
3678{
3679char str[8]="IncludeHelp";
3680printf("%s",str);
3681return 0;
3682}
3683Find the output
36841.
3685IncludeHelp
36862.
3687IncludeH
36883.
3689Error
36904.
3691No output
36923.0
3693S.NO. Questions Choices Answers
36942
36953
36960
3697#in
3698clu
3699d
3700e
3701<
3702s
3703t
3704dio.h
3705> int main() { char str[]="Hello%
3706s
3707%
3708d
3709F
3710rie
3711n
3712d
3713s
3714"; printf(str); printf("\n"); printf("%s",str); return 0; }Find the output
37151. H
3716ello
3717F
3718rie
3719n
3720d
3721s
3722H
3723ello
3724F
3725rie
3726n
3727d
3728s
37292. H
3730ello
3731%
3732s
3733%
3734d
3735F
3736rie
3737n
3738d
3739s
3740H
3741ello
3742%
3743s
3744%
3745d
3746F
3747rie
3748n
3749d
3750s
37513. H
3752ello
3753(
3754n
3755ull)
37560
3757F
3758rie
3759n
3760d
3761s
3762H
3763ello
3764%
3765s
3766%
3767d
3768F
3769rie
3770n
3771d
3772s
37734. G
3774a
3775r
3776b
3777a
3778g
3779e
3780v
3781alu
3782e
37833.0
37842
37853
37861
3787#in
3788clu
3789d
3790e
3791<
3792s
3793t
3794dio.h
3795> int main() { char str[]="value is
3796=
3797%
3798d
3799"; int a='7'; str[11]='c'; printf(str,a); return 0; }Find the output
38001. valu
3801e is
3802=
3803%
3804d
38052. valu
3806e is
3807=
3808%
3809c
38103. valu
3811e is
3812=
38135
38145
38154. valu
3816e is
3817=
38187
38194.0
38202
38213
38222
3823#in
3824clu
3825d
3826e
3827<
3828s
3829t
3830dio.h
3831> int main() { char X[10]={'A'},i; for(i=0; i<10; i++) printf("%d ",X[i]); return 0; }Find the output
38321. A
38330
38340
38350
38360
38370
38380
38390
38400
38410
38422. A3. A
38433
38442
38453
38462
38473
38482
38493
38502
38513
38522
38533
38542
38553
38562
38573
38582
38593
38602
38614. E
3862r
3863r
3864o
3865r
38664.0
38672
38683
38693
3870#in
3871clu
3872d
3873e
3874<
3875s
3876t
3877dio.h
3878> int main() { char *str="Inclu
3879d
3880e
3881H
3882elp
3883"; printf("%c\n",*&*str); return 0; }Find the output
38841. E
3885r
3886r
3887o
3888r
38892. In
3890clu
3891d
3892e
3893H
3894elp
38953. I4. *I 3.0
3896S.N
3897O. Q
3898u
3899e
3900s
3901tio
3902n
3903s
3904C
3905h
3906oic
3907e
3908s
3909A
3910n
3911s
3912w
3913e
3914r
3915s
39162
39173
39184
3919#in
3920clu
3921d
3922e
3923<
3924s
3925t
3926dio.h
3927> int main(){ float a=125.50; int b=125.50; char c='A'; printf("%d,%d,%
3928d
3929\
3930n
3931",siz
3932e
3933o
3934f
3935(
3936a
3937),siz
3938e
3939o
3940f
3941(
3942b
3943),siz
3944e
3945o
3946f
3947(
39481
39492
39505.5
39510
3952)
3953); printf("%d,%d\n",sizeof(c),sizeof(65)); return 0; }What will be the output on a 32 bit compiler. 1. 4, 4, 4 1, 4 2. 4, 4, 8 1, 1 3. 4, 4, 4 1, 1 4. 4, 4, 8 1, 4
39544.0
39552
39563
39575
3958#in
3959clu
3960d
3961e
3962<
3963s
3964t
3965dio.h
3966> int main() { if( (-100 && 100)||(
39672
39680
3969&
3970&
3971-
39722
39730
3974)
3975)
3976p
3977rin
3978t
3979f
3980(
3981"
3982%
3983s
3984","
3985C
3986o
3987n
3988ditio
3989n is
3990t
3991r
3992u
3993e."
3994); elseprintf("%s","Condition is false."); return 0; }Find the output
39951. C
3996o
3997n
3998ditio
3999n is
4000T
4001r
4002u
4003e
40042. C
4005o
4006n
4007ditio
4008n is
4009F
4010als
4011e
40123. N
4013o
4014o
4015u
4016t
4017p
4018u
4019t
40204. E
4021r
4022r
4023o
4024r
40251.0
40262
40273
40286
4029#in
4030clu
4031d
4032e
4033<
4034s
4035t
4036dio.h
4037> int main() { int a=10; if(10L == a) printf("10L"); else if(10==a) printf("10"); elseprintf("0"); return 0; }Find the output. 1. 102. 10
4038L
40393. 10
4040L
40411
40420
40434. E
4044r
4045r
4046o
4047r
40482.0
40492
40503
40517
4052#in
4053clu
4054d
4055e
4056<
4057s
4058t
4059dio.h
4060> int main() { int a=10; if(a==10) { printf("Hello..."
4061); break; printf("Ok"); }else { printf("Hii"); }return 0; }
4062Fin
4063d
4064t
4065h
4066e
4067o
4068u
4069t
4070p
4071u
4072t. 1. H
4073ello... 2. Hello...O
4074K
40753. O
4076K... 4. Error
40774.0
40782
40793
40808
4081#in
4082clu
4083d
4084e
4085<
4086s
4087t
4088dio.h
4089> int main() { int a=15; float b=1.234; printf("%*f",a,b); return 0; }Predict the output?
40901. 1.2
40913
40924
40932. 1.2
40943
40954
40960
40970
40980
40993. 1.2
41003
41014
41020
41030
41040
41054. E
4106r
4107r
4108o
4109r
41103.0
4111S.N
4112O. Q
4113u
4114e
4115s
4116tio
4117n
4118s
4119C
4120h
4121oic
4122e
4123s
4124A
4125n
4126s
4127w
4128e
4129r
4130s
41312
41323
41339
4134#in
4135clu
4136d
4137e
4138<
4139s
4140t
4141dio.h
4142> int main() { int i; for(i=0; i< 5; i++) { if(i*i > 30 ) goto lbl; elseprintf("%d",i); lbl:printf("IHelp "); }return 0; }Find the output
41431. 0IH
4144elp
41451IH
4146elp
41472IH
4148elp
41493IH
4150elp
41514IH
4152elp
41532. 0IH
4154elp
41551IH
4156elp
41572IH
4158elp
41594IH
4160elp
41613. 1IH
4162elp
41634. E
4164r
4165r
4166o
4167r
41681.0
41692
41704
41710
4172#in
4173clu
4174d
4175e
4176<
4177s
4178t
4179dio.h
4180> int main() { int MAX=10; int array[MAX]; printf("size of arr
4181a
4182y is
4183=
4184%
4185d
4186",siz
4187e
4188o
4189f
4190(
4191a
4192r
4193r
4194a
4195y
4196); return 0; }Find the output
41971. siz
4198e
4199o
4200f
4201a
4202r
4203r
4204a
4205y is
4206=
42072
42080
42092. siz
4210e
4211o
4212f
4213a
4214r
4215r
4216a
4217y is
4218=
42194
42200
42213. siz
4222e
4223o
4224f
4225a
4226r
4227r
4228a
4229y is
4230=
42314
42324. E
4233r
4234r
4235o
4236r
42372.0
42382
42394
42401
4241#in
4242clu
4243d
4244e
4245<
4246s
4247t
4248dio.h
4249> int main() { int pn=100; if(pn>20) if(pn<20) printf("Heyy
4250y
4251y
4252y
4253"
4254); elseprintf("Hiiiii"); return 0; }Find the output. 1. N
4255o
4256o
4257u
4258t
4259p
4260u
4261t
42622. Hiiiii 3. Heyy
4263y
4264y
4265y
42664. H
4267e
4268y
4269y
4270y
4271y
4272y
4273Hiiiii 2.0
42742
42754
42762
4277#in
4278clu
4279d
4280e
4281<
4282s
4283t
4284dio.h
4285> int main() { int var=100; { int var=200; printf("%d...",v
4286a
4287r
4288); }printf("%d",var); return 0; }Find the output
42891. E
4290R
4291R
4292O
4293R
42942. 20
42950...2
42960
42970
42983. 10
42990...1
43000
43010
43024. 20
43030...1
43040
43050
43064.0
43072
43084
43093
4310#in
4311clu
4312d
4313e
4314<
4315s
4316t
4317dio.h
4318> int main() { int var=250; printf("value of v
4319a
4320r
4321=
4322%
4323d
4324\
4325n
4326",v
4327a
4328r
4329); 200+50; "includehelp.com"; printf("%s\n","includehelp"); return 0; }Find the output
43301. valu
4331e
4332o
4333f
4334v
4335a
4336r
4337=
43382
43395
43400 includehelp.com 2. value of var = 250 includehelp 3. Error 4. value of var = 250 Garbage
43412.0
4342S.N
4343O. Q
4344u
4345e
4346s
4347tio
4348n
4349s
4350C
4351h
4352oic
4353e
4354s
4355A
4356n
4357s
4358w
4359e
4360r
4361s
43622
43634
43644
4365#in
4366clu
4367d
4368e
4369<
4370s
4371t
4372dio.h
4373> int main() { int iVal; char cVal; void *ptr; // void
4374p
4375oin
4376t
4377e
4378r iVal=50; cVal=65; ptr=&iVal; printf("value =%d,size= %
4379d
4380\
4381n
4382",*
4383(in
4384t
4385*
4386)
4387p
4388t
4389r,siz
4390e
4391o
4392f
4393(
4394p
4395t
4396r
4397)
4398); ptr=&cVal; printf("value =%d,size= %d\n",*(char*)ptr,sizeof(ptr
4399)
4400); return 0; }Find the output
44011. E
4402r
4403r
4404o
4405r
44062. valu
4407e
4408=
44095
44100,siz
4411e
4412=
44134
4414v
4415alu
4416e
4417=
44186
44195,siz
4420e
4421=
44224
44233. valu
4424e
4425=
44265
44270,siz
4428e
4429=
44304
4431v
4432alu
4433e
4434=
44356
44365,siz
4437e
4438=
44391
44404. G
4441a
4442r
4443b
4444a
4445g
4446e
4447v
4448alu
4449e
44502.0
44512
44524
44535
4454#in
4455clu
4456d
4457e
4458<
4459s
4460t
4461dio.h
4462> int main() { static int var[5]; int count=0; var[++count]=++
4463c
4464o
4465u
4466n
4467t; for(count=0;count<5;co
4468u
4469n
4470t
4471+
4472+
4473)
4474p
4475rin
4476t
4477f
4478(
4479"
4480%
4481d
4482",v
4483a
4484r[c
4485o
4486u
4487n
4488t]); return 0; }Find the output
44891. 0
44901
44910
44920
44930
44942. 0
44952
44960
44970
44980
44993. 0
45000
45012
45020
45030
45044. 0
45050
45060
45070
45080
45093.0
45102
45114
45126
4513#in
4514clu
4515d
4516e
4517<
4518s
4519t
4520dio.h
4521> int main() { struct sample{ int a; int b; sample *s; }t; printf("%d,%d",siz
4522e
4523o
4524f
4525(
4526s
4527a
4528m
4529ple
4530),siz
4531e
4532o
4533f
4534(
4535t.s
4536)
4537); return 0; }Find the output
45381. 12, 1
45392
45402. 12, 0 3. Error 4. 12, 4
45414.0
45422
45434
45447
4545#in
4546clu
4547d
4548e
4549<
4550s
4551t
4552dio.h
4553> int main() { struct std { char name[30]; int age; };struct std s1={"Mik
4554e
4555",2
45566
4557}; struct std s2=s1; printf("Name: %s, Age: %
4558d
4559\
4560n
4561",s
45622.n
4563a
4564m
4565e,s
45662.a
4567g
4568e
4569); }Find the output
45701. N
4571a
4572m
4573e: Mik
4574e, A
4575g
4576e: 2
45776
45782. N
4579a
4580m
4581e: G
4582a
4583r
4584b
4585a
4586g
4587e, A
4588g
4589e: G
4590a
4591r
4592b
4593a
4594g
4595e
45963. N
4597a
4598m
4599e: N
4600ull, A
4601g
4602e: 2
46036
46044. E
4605r
4606r
4607o
4608r
46091.0
46102
46114
46128
4613#in
4614clu
4615d
4616e
4617<
4618s
4619t
4620dio.h
4621> int main() { typedef struct tag
4622{
4623c
4624h
4625a
4626r
4627s
4628t
4629r[1
46300]; int a; }har; har h1,h2={"IH
4631elp
4632",1
46330
4634}; h1=h2; h1.str[1]='h'; printf("%s,%d",h1.str,h1.a
4635); return 0; }Find the output
46361. E
4637R
4638R
4639O
4640R
46412. IH
4642elp, 1
46430
46443. IH
4645elp, 0
46464. Ih
4647elp, 1
46480
46494.0
4650S.N
4651O. Q
4652u
4653e
4654s
4655tio
4656n
4657s
4658C
4659h
4660oic
4661e
4662s
4663A
4664n
4665s
4666w
4667e
4668r
4669s
4670249
4671#include <stdio.h>
4672int main()
4673{
4674union test
4675{
4676int i;
4677int j;
4678};
4679union test var=10;
4680printf("%d,%d\n",var.i,var.j);
4681}
4682Find the output
46831.
468410,10
46852.
468610,0
46873.
46880,10
46894.
4690Error
46914.0
4692250
4693#include <stdio.h>
4694int main()
4695{
4696union values
4697{
4698int intVal;
4699char chrVal[2];i
4700};
4701union values val;
4702val.chrVal[0]='A'; val.chrVal[1]='B';
4703printf("\n%c,%c,%d",val.chrVal[0],val.chrVal[1],val.intVal);
4704return 0;
4705}
4706Find the output
47071.
4708A,B,0
47092.
4710A,B,16961
47113.
4712B,B,66
47134.
4714A,A,65
47152.0
4716251
4717#include <stdio.h>
4718int main()
4719{
4720union values
4721{
4722unsigned char a;
4723unsigned char b;
4724unsigned int c;
4725};
4726union values val;
4727val.a=1;
4728val.b=2;
4729val.c=300;
4730printf("%d,%d,%d",val.a,val.b,val.c);
4731return 0;
4732}
4733Find the output
47341.
473544,44,300
47362.
47371,2,300
47383.
47392,2,300
47404.
4741256,256,300
47421.0
4743252
4744#include <stdio.h>
4745int main()
4746{
4747void *ptr;
4748++ptr;
4749printf("%u",ptr);
4750return 0;
4751}
4752Find the output
47531.
47542004
47552.
47562001
47573.
47582000
47594.
4760ERROR
47612.0
4762253
4763#include <stdio.h>
4764struct employee{
4765int empId;
4766char *name;
4767int age;
4768};
4769int main()
4770{
4771struct employee emp []={ {1,"Mike",24}, {2,"AAA",24}, {3,"BBB",25}, {4,"CCC",30} };
4772printf("Id : %d, Age : %d, Name : %s", emp[2].empId,3[emp].age,(*(emp+1)).name);
4773return 0;
4774}
4775Find the output
47761.
4777Id: 3, Age: 24, Name: Mike
47782.
4779Id: 3, Age: 23, Name: Mike
47803.
4781Id: 3, Age: 30, Name: AAA
47824.
4783Error
47843.0
4785S.NO. Questions Choices Answers
47862
47875
47884
4789#in
4790clu
4791d
4792e
4793<
4794s
4795t
4796dio.h
4797>
4798v
4799oid
4800m
4801ain
4802(
4803)
4804{ in
4805t
4806a
4807=
48082; switch(a
4809)
4810{
4811p
4812rin
4813t
4814f
4815(
4816"
4817M
4818e
4819s
4820s
4821a
4822g
4823e
4824\
4825n
4826"
4827); default: printf("Default\n"); case 2: printf("Case-2\n"); case 3: printf("Case-3\n"); }printf("Exit from switch\
4828n
4829"
4830); }Find the output
48311. C
4832a
4833s
4834e
4835-
48362
48372. M
4838e
4839s
4840s
4841a
4842g
4843e
48443. M
4845e
4846s
4847s
4848a
4849g
4850e
4851C
4852a
4853s
4854e
4855-
48562
48574. C
4858a
4859s
4860e
4861-
48622
4863C
4864a
4865s
4866e
4867-
48683
4869E
4870xit
4871f
4872r
4873o
4874m
4875s
4876wit
4877c
4878h
48794.0
48802
48815
48825
4883#in
4884clu
4885d
4886e
4887<
4888s
4889t
4890dio.h
4891>
4892v
4893oid
4894m
4895ain
4896(
4897)
4898{
4899s
4900t
4901a
4902tic in
4903t
4904s
4905t
4906a
4907tic
4908V
4909a
4910r; int j; for(j=0;j<=5;j+=2) switch(j){ case 1: staticVar++; break; case 2: staticVar+=2; case 4: staticVar%=2; j=-1; continue; default: --staticVar; continue; }printf("%d",staticV
4911a
4912r
4913); }Find the output
49141. 02. 13. 24. E
4915r
4916r
4917o
4918r
49191.0
49202
49215
49226
4923#in
4924clu
4925d
4926e
4927<
4928s
4929t
4930dio.h
4931>
4932v
4933oid
4934m
4935ain
4936(
4937)
4938{ int a=0; a=5||2|1; printf("%d
4939",a
4940); }Find the output. 1. 22. 13. 04. 8
49412.0
49422
49435
49447
4945#in
4946clu
4947d
4948e
4949<
4950s
4951t
4952dio.h
4953>
4954v
4955oid
4956m
4957ain
4958(
4959)
4960{ int a=1; switch(a/2
4961)
4962{
4963c
4964a
4965s
4966e
4967N
4968U
4969L
4970L: printf("Ca
4971s
4972e
4973N
4974U
4975L
4976L
4977\
4978n
4979"
4980); break; case 0: printf("Case ZERO\n"); break; default: printf("DEFAULT\n"); break; }
4981}Fin
4982d
4983t
4984h
4985e
4986o
4987u
4988t
4989p
4990u
4991t
49921. C
4993a
4994s
4995e
4996N
4997U
4998L
4999L
50002. C
5001a
5002s
5003e
5004Z
5005E
5006R
5007O
50083. C
5009a
5010s
5011e
5012D
5013E
5014F
5015A
5016U
5017L
5018T
50194. E
5020r
5021r
5022o
5023r
50244.0
5025S.N
5026O. Q
5027u
5028e
5029s
5030tio
5031n
5032s
5033C
5034h
5035oic
5036e
5037s
5038A
5039n
5040s
5041w
5042e
5043r
5044s
50452
50465
50478
5048#in
5049clu
5050d
5051e
5052<
5053s
5054t
5055dio.h
5056>
5057v
5058oid
5059m
5060ain
5061(
5062)
5063{ in
5064t
5065a
5066=
50672; int b=a; switch(b
5068)
5069{
5070c
5071a
5072s
5073e
5074a: printf
5075(
5076"
5077C
5078a
5079s
5080e
5081-
5082a
5083\
5084n
5085"
5086); b
5087r
5088e
5089a
5090k; case 3: printf("Case-3\n"); break; default: printf("No option\n"); break; }printf("Exit from switch"); }Find the output
50911. C
5092a
5093s
5094e
5095-
50962
50972. E
5098r
5099r
5100o
5101r: c
5102a
5103s
5104e
5105e
5106x
5107p
5108r
5109e
5110s
5111sio
5112n
5113n
5114o
5115t
5116c
5117o
5118n
5119s
5120t
5121a
5122n
5123t
51243. M
5125e
5126s
5127s
5128a
5129g
5130e
5131C
5132a
5133s
5134e
5135-
51362
51374. C
5138a
5139s
5140e
5141-
51422
5143C
5144a
5145s
5146e
5147-
51483
5149E
5150xit
5151f
5152r
5153o
5154m
5155s
5156wit
5157c
5158h
51592.0
51602
51615
51629
5163#in
5164clu
5165d
5166e
5167<
5168s
5169t
5170dio.h
5171>
5172v
5173oid
5174m
5175ain
5176(
5177)
5178{ in
5179t
5180c
5181n
5182t
5183=
51841; while(cnt
5185>
5186=
51871
51880
5189)
5190{
5191p
5192rin
5193t
5194f
5195(
5196"
5197%
5198d,",c
5199n
5200t
5201); cnt+=1; }printf("\nAfter loop
5202c
5203n
5204t
5205=
5206%
5207d
5208",c
5209n
5210t
5211); printf("\n"); }Find the output
52121. Af
5213t
5214e
5215r lo
5216o
5217p
5218c
5219n
5220t
5221=
52221
52232. 1, Af
5224t
5225e
5226r lo
5227o
5228p
5229c
5230n
5231t
5232=
52332
52343. Af
5235t
5236e
5237r lo
5238o
5239p
5240c
5241n
5242t
5243=
52442
52454. 11
52461.0
52472
52486
52490
5250#in
5251clu
5252d
5253e
5254<
5255s
5256t
5257dio.h
5258>
5259v
5260oid
5261m
5262ain
5263(
5264)
5265{ in
5266t i,j,c
5267h
5268a
5269r
5270V
5271al='A'; for(i=5;i>=1;i--) { for(j=0;j< i;j++) printf("%c ",(c
5272h
5273a
5274r
5275V
5276al+j)
5277); printf("\n"); }
5278}Id
5279e
5280n
5281tif
5282y
5283t
5284h
5285e
5286o
5287u
5288t
5289p
5290u
5291t
52921. A
5293B
5294C
5295D
5296E
5297A
5298B
5299C
5300D
5301E
5302A
5303B
5304C
5305D
5306E
5307A
5308B
5309C
5310D
5311E
5312A
5313B
5314C
5315D
5316E
53172. A
5318B
5319C
5320D
5321A
5322B
5323C
5324D
5325A
5326B
5327C
5328D
5329A
5330B
5331C
5332D
53333. A
5334B
5335C
5336D
5337A
5338B
5339C
5340A
5341B
5342A4. A
5343B
5344C
5345D
5346E
5347A
5348B
5349C
5350D
5351A
5352B
5353C
5354A
5355B
5356A
53573.0
5358S.N
5359O. Q
5360u
5361e
5362s
5363tio
5364n
5365s
5366C
5367h
5368oic
5369e
5370s
5371A
5372n
5373s
5374w
5375e
5376r
5377s
53782
53796
53801
5381#in
5382clu
5383d
5384e
5385<
5386s
5387t
5388dio.h
5389>
5390v
5391oid
5392m
5393ain
5394(
5395)
5396{ in
5397t i=
53981; while (i<
5399=
54005
5401)
5402{
5403p
5404rin
5405t
5406f
5407(
5408"
5409%
5410d
5411",i); if (i==5) goto print; i++; }
5412}f
5413u
5414n
5415(
5416)
5417{
5418p
5419rin
5420t: prin
5421t
5422f
5423(
5424"in
5425clu
5426d
5427e
5428h
5429elp.c
5430o
5431m
5432"
5433); }Find the output
54341. E
5435r
5436r
5437o
5438r
54392. 12
54403
54414
54425in
5443clu
5444d
5445e
5446h
5447elp.c
5448o
5449m
54503. 12
54513
54524in
5453clu
5454d
5455e
5456h
5457elp.c
5458o
5459m
54604. 1in
5461clu
5462d
5463e
5464h
5465elp.c
5466o
5467m
54682in
5469clu
5470d
5471e
5472h
5473elp.c
5474o
5475m
54763in
5477clu
5478d
5479e
5480h
5481elp.c
5482o
5483m
54844in
5485clu
5486d
5487e
5488h
5489elp.c
5490o
5491m
54925in
5493clu
5494d
5495e
5496h
5497elp.c
5498o
5499m
55001.0
55012
55026
55032
5504#in
5505clu
5506d
5507e
5508<
5509s
5510t
5511dio.h
5512>
5513v
5514oid
5515m
5516ain
5517(
5518)
5519{ int intVar=
55202
55210,x; x= ++intVar,intV
5522a
5523r
5524+
5525+,+
5526+in
5527t
5528V
5529a
5530r; printf("Value of intVar=%d, x=%
5531d
5532",in
5533t
5534V
5535a
5536r,x
5537); }Find the output
55381. Valu
5539e
5540o
5541f in
5542t
5543V
5544a
5545r
5546=
55472
55483, x
5549=
55502
55511
55522. Valu
5553e
5554o
5555f in
5556t
5557V
5558a
5559r
5560=
55612
55623, x
5563=
55642
55653
55663. Valu
5567e
5568o
5569f in
5570t
5571V
5572a
5573r
5574=
55752
55761, x
5577=
55782
55791
55804.E
5581R
5582R
5583O
5584R
55851.0
55862
55876
55883
5589#in
5590clu
5591d
5592e
5593<
5594s
5595t
5596dio.h
5597>
5598v
5599oid
5600m
5601ain
5602(
5603)
5604{ in
5605t
5606t
5607ally; for(tally=
56080;t
5609ally
5610<
56111
56120;+
5613+
5614t
5615ally
5616)
5617{
5618p
5619rin
5620t
5621f
5622(
5623"
5624#
5625"
5626); if(tally>6) continue; printf("%d",t
5627ally
5628); }
5629}Fin
5630d
5631t
5632h
5633e
5634o
5635u
5636t
5637p
5638u
5639t
56401. #0
5641#
56421
5643#
56442
5645#
56463
5647#
56484
5649#
56505
5651#
56526
5653#
5654#
5655#
56562. #0
5657#
56581
5659#
56602
5661#
56623
5663#
56644
5665#
56665
5667#
56686
5669#
56707
5671#
56728
5673#
56749
5675#
56761
56770
56783. #0
5679#
56801
5681#
56822
5683#
56843
5685#
56864
5687#
56885
5689#
5690#
56917
5692#
56938
5694#
56959
5696#
56971
56980
56994. #0
5700#
57011
5702#
57032
5704#
57053
5706#
57074
5708#
57095
5710#
57111.0
57122
57136
57144
5715#in
5716clu
5717d
5718e
5719<
5720s
5721t
5722dio.h
5723>
5724v
5725oid
5726m
5727ain
5728(
5729)
5730{
5731u
5732n
5733sig
5734n
5735e
5736d
5737c
5738h
5739a
5740r
5741c
5742=
57432
57449
57450; printf("%d",c); }Find the output
57461. 342. 29
57470
57483. G
5749a
5750r
5751b
5752a
5753g
5754e
5755v
5756alu
5757e
57584. E
5759r
5760r
5761o
5762r
57631.0
57642
57656
57665
5767#in
5768clu
5769d
5770e
5771<
5772s
5773t
5774dio.h
5775>
5776v
5777oid
5778m
5779ain
5780(
5781)
5782{c
5783h
5784a
5785r
5786c
5787n
5788t
5789=
57900; for(;cnt++;p
5791rin
5792t
5793f
5794(
5795"
5796%
5797d
5798",c
5799n
5800t
5801)
5802) ; printf("%d",cnt); }Find the output
58031. 0
58041
58052 ... in
5806finit
5807y
58082. 1
58092
58102 ... 1
58112
58127
58133. 04. 1
58144.0
5815S.N
5816O. Q
5817u
5818e
5819s
5820tio
5821n
5822s
5823C
5824h
5825oic
5826e
5827s
5828A
5829n
5830s
5831w
5832e
5833r
5834s
58352
58366
58376
5838#in
5839clu
5840d
5841e
5842<
5843s
5844t
5845dio.h
5846<
5847#in
5848clu
5849d
5850e
5851<
5852s
5853t
5854rin
5855g.h
5856> int main() { char str[]; strcpy(str,"Hello"); printf("%s",str); return 0; }Find the output
58571. H
5858ello
58592. E
5860r
5861r
5862o
5863r
58643. N
5865U
5866L
5867L
58684. N
5869O
5870O
5871U
5872T
5873P
5874U
5875T
58762.0
58772
58786
58797
5880#in
5881clu
5882d
5883e
5884#
5885d
5886e
5887fin
5888e
5889S
5890U
5891M
5892(
5893x,y
5894) in
5895t
5896s; s
5897=
5898x
5899+
5900y; p
5901rin
5902t
5903f
5904(
5905"
5906s
5907u
5908m
5909=
5910%
5911d
5912\
5913n
5914",s
5915); int main() { SUM(10,20); return 0; }Find the output
59161. su
5917m
5918=
59193
59200
59212. 10,2
59220
59233. E
5924r
5925r
5926o
5927r
59284. su
5929m
5930=
59310
59321.0
59332
59346
59358
5936#in
5937clu
5938d
5939e int main(
5940)
5941{
5942c
5943h
5944a
5945r
5946c
5947h
5948=
59491
59500; void *ptr=&c
5951h; printf("%d,%d",*
5952(
5953c
5954h
5955a
5956r
5957*
5958)
5959p
5960t
5961r,+
5962+
5963(
5964*
5965(
5966c
5967h
5968a
5969r
5970*
5971)
5972p
5973t
5974r
5975)
5976); return 0; }Find the output
59771. 11, 1
59781
59792. 10, 1
59801
59813. E
5982r
5983r
5984o
5985r
59864. 10, 1
59870
59881.0
59892
59906
59919
5992#in
5993clu
5994d
5995e int main(
5996)
5997{
5998c
5999h
6000a
6001r
6002*
6003s
6004t
6005r []=
6006{
6007"
6008A
6009A
6010A
6011A
6012A
6013","
6014B
6015B
6016B
6017B
6018B
6019","
6020C
6021C
6022C
6023C
6024C
6025","
6026D
6027D
6028D
6029D
6030D
6031"
6032}; char **sptr []={str+3,str+2,str+1,str}; char ***pp; pp=sptr; ++pp; printf("%s",**++pp+2); return 0; }Find the output
60331. B
6034B
6035B
6036B
6037B
60382. C
6039C
6040C
6041C
6042C
60433. B
6044B
6045B
60464. E
6047r
6048r
6049o
6050r
60513.0
60522
60537
60540
6055#in
6056clu
6057d
6058e int main(
6059)
6060{ in
6061t
6062a
6063=
60641
60650,b
6066=
60672; int *pa=&a,*p
6068b
6069=
6070&
6071b; printf("value = %d", *
6072p
6073a
6074/
6075*
6076p
6077b
6078); return 0; }Find the output
60791. 52. 5.0 3. ER
6080R
6081O
6082R
60834. N
6084o
6085o
6086u
6087t
6088p
6089u
6090t
60911.0
6092S.N
6093O. Q
6094u
6095e
6096s
6097tio
6098n
6099s
6100C
6101h
6102oic
6103e
6104s
6105A
6106n
6107s
6108w
6109e
6110r
6111s
6112271
6113#include
6114void fun(int *ptr)
6115{
6116*ptr=100;
6117}
6118int main()
6119{
6120int num=50;
6121int *pp=#
6122fun(& *pp);
6123printf("%d,%d",num,*pp);
6124return 0;
6125}
6126Find the output
61271.
6128100,100
61292.
613050,50
61313.
613250,100
61334.
6134Error in function calling
61353.0
6136272
6137#include
6138#define FUN(x) x*x
6139int main()
6140{
6141int val=0;
6142val=128/FUN(8);
6143printf("val=%d",val);
6144return 0;
6145}
6146Find the output
61471.
61482
61492.
615012864
61513.
615240
61534.
61541
61552.0
6156273
6157#include
6158int main ()
6159{
6160static int a[]={10, 20, 30 40, 50};
6161static int *p[]= {a, a+3, a+4, a+1, a+2};
6162int **ptr=p;
6163ptr++;
6164printf ("%d%d", ptr p, **ptr);
6165}
6166The output of the program is __________
61671.
616843
61692.
6170140
61713.
617289
61734.
617478
61752.0
6176274
6177#include <stdio.h>
6178#define TRUE 1
6179int main()
6180{
6181switch(TRUE)
6182{
6183printf("Hello");
6184}
6185}
6186Find the output
61871.
6188Hello
61892.
6190ERROR
61913.
6192No output
61934.
6194Garbage
61953.0
6196275
6197#include <stdio.h>
6198enum numbers
6199{
6200zero, one, two, three , four=3,five,six,seven=0,eight
6201};
6202void main()
6203{
6204printf("%d,%d,%d,%d,%d,%d,%d,%d,%d",zero,one,two,three,four,five,six,seven,eight);
6205}
6206What will be the output.
62071.
62080, 1, 2, 3, 3, 4, 5, 0, 1
62092.
62100, 1, 2,3,3,1,2,3,4
62113.
62120,1,2,3,3,1,2,3,4
62134.
62140, 1, 2, 3, 3, 4, 5, 0, 9
62151.0
6216S.NO. Questions Choices Answers
62172
62187
62196
6220#in
6221clu
6222d
6223e
6224<
6225s
6226t
6227dio.h
6228> int main(){ char val=250; int ans; ans= val+ !val +
6229~
6230v
6231al +
6232+
6233+
6234v
6235al; printf("%d",ans); return 0; }Find the output. 1. -52. -63. 04. 6
62362.0
62372
62387
62397
6240#in
6241clu
6242d
6243e
6244<
6245s
6246t
6247dio.h
6248> int main() { float a,b; a=3.0f; b=4.0f; printf("%.0f,%.1f,%.2
6249f
6250",a
6251/
6252b,a
6253/
6254b,a
6255/
6256b
6257); return 0; }Find the output. 1. 1, 0.8, 0.7
62585
62592. 0, 0.7, 0.7
62605
62613. 0, 0.8, 0.7
62625
62634. E
6264r
6265r
6266o
6267r: In
6268v
6269alid
6270f
6271o
6272r
6273m
6274a
6275t
6276S
6277p
6278e
6279cifie
6280r
62813.0
62822
62837
62848
6285#in
6286clu
6287d
6288e
6289<
6290s
6291t
6292dio.h
6293> int main(){ float a; (int)a= 10; printf("value of a
6294=
6295%
6296d
6297",a
6298); return 0; }Find the output
62991. valu
6300e
6301o
6302f
6303a
6304=
63051
63060
63072. valu
6308e
6309o
6310f
6311a
6312=
63131
63140.0
63150
63160
63170
63180
63190
63203. valu
6321e
6322o
6323f
6324a
6325=
63260
63274. LV
6328alu
6329e
6330r
6331e
6332q
6333uir
6334e
6335d
63364.0
63372
63387
63399
6340#in
6341clu
6342d
6343e
6344<
6345s
6346t
6347dio.h
6348> int main() { int i=-1,j=-1,k=0,l=
63492,m; m=i++&&j++&&k++||l+
6350+; printf("%d %d %d %d %d
6351",i,j,k,l,m
6352); return 0; }Find the output
63531. 0
63540
63551
63562
63571
63582. 0
63590
63601
63613
63622
63633. 0
63640
63651
63663
63671
63684. 0
63691
63701
63713
63721
63733.0
63742
63758
63760
6377#in
6378clu
6379d
6380e
6381<
6382s
6383t
6384dio.h
6385> int main() { int intVar=24; static int x=intVa
6386r; printf("%d,%d",intV
6387a
6388r,x
6389); return 0; }Find the output of this prog
6390r
6391a
6392m, (
6393p
6394r
6395o
6396g
6397r
6398a
6399m
6400n
6401a
6402m
6403e is: s
6404t
6405a
6406tic
6407_
6408e
6409c.c
6410)
64111. 24, 2
64124
64132. 24, 0 3. Error: Ille
6414g
6415al Initializ
6416a
6417tio
6418n
64194. R
6420u
6421n
6422tim
6423e
6424e
6425r
6426r
6427o
6428r
64293.0
6430S.N
6431O. Q
6432u
6433e
6434s
6435tio
6436n
6437s
6438C
6439h
6440oic
6441e
6442s
6443A
6444n
6445s
6446w
6447e
6448r
6449s
64502
64518
64521
6453#in
6454clu
6455d
6456e
6457<
6458s
6459t
6460dio.h
6461> int main() { int ok=-100; -100; printf("%d",ok); return 0; }Find the output. 1. 02. -1
64620
64630
64643. 10
64650
64664. E
6467r
6468r
6469o
6470r
64712.0
64722
64738
64742
6475#in
6476clu
6477d
6478e
6479<
6480s
6481t
6482dio.h
6483> int main() { int var; var=- -10; printf("value of v
6484a
6485r
6486=
6487%
6488d
6489\
6490n
6491",v
6492a
6493r
6494); var=+ +10; printf("value of var= %d\n",var); return 0; }Find the output
64951. E
6496R
6497R
6498O
6499R
65002. valu
6501e
6502o
6503f
6504v
6505a
6506r
6507=
6508-
65091
65100
6511v
6512alu
6513e
6514o
6515f
6516v
6517a
6518r
6519=
65201
65210
65223. valu
6523e
6524o
6525f
6526v
6527a
6528r
6529=
65301
65310
6532v
6533alu
6534e
6535o
6536f
6537v
6538a
6539r
6540=
65411
65420
65434. valu
6544e
6545o
6546f
6547v
6548a
6549r
6550=
65511
65520
6553v
6554alu
6555e
6556o
6557f
6558v
6559a
6560r
6561=
65621
65631
65643.0
65652
65668
65673
6568#in
6569clu
6570d
6571e
6572<
6573s
6574t
6575dio.h
6576> int main(){ int x; x=100,30,50; printf("x=%d\n",x
6577); x=(100,30,50); printf("x=%d\n",x); return 0; }Find the output
65781. x=
65791
65800
65810
6582x
6583=
65841
65850
65860
65872. x=
65881
65890
65900
6591x
6592=
65935
65940
65953. x=
65965
65970
6598x
6599=
66005
66010
66024. x=
66035
66040
6605x
6606=
66071
66080
66090
66102.0
66112
66128
66134
6614#in
6615clu
6616d
6617e
6618<
6619s
6620t
6621dio.h
6622>
6623v
6624oid
6625m
6626ain
6627(
6628)
6629{ in
6630t
6631a
6632=
66331
66340; switch(a)
6635{
6636c
6637a
6638s
6639e
66405
6641+
66425: printf("H
6643ello
6644\
6645n
6646"
6647); default: printf("OK\n"); }
6648}Fin
6649d
6650t
6651h
6652e
6653o
6654u
6655t
6656p
6657u
6658t
66591. H
6660ello
66612. O
6662K
66633. H
6664ello
6665O
6666K
66674. E
6668r
6669r
6670o
6671r
66723.0
6673S.N
6674O. Q
6675u
6676e
6677s
6678tio
6679n
6680s
6681C
6682h
6683oic
6684e
6685s
6686A
6687n
6688s
6689w
6690e
6691r
6692s
66932
66948
66955
6696#in
6697clu
6698d
6699e
6700<
6701s
6702t
6703dio.h
6704>
6705v
6706oid
6707m
6708ain
6709(
6710)
6711{
6712u
6713n
6714sig
6715n
6716e
6717d
6718s
6719h
6720o
6721r
6722t
6723v
6724a
6725r
6726='B'; var+=2; var++; printf("var : %c , %d ", v
6727a
6728r,v
6729a
6730r
6731); }Find the output
67321. va
6733r : E, 6
67349
67352. va
6736r : E, 6
67378
67383. va
6739r : D, 6
67409
67414. va
6742r : D, 6
67438
67441.0
67452
67468
67476
6748#in
6749clu
6750d
6751e
6752<
6753s
6754t
6755dio.h
6756>
6757v
6758oid
6759m
6760ain
6761(
6762)
6763{ in
6764t
6765a
6766=
67672; switch(a
6768/
67692
6770*
67711.5
6772)
6773{
6774c
6775a
6776s
6777e
67781: printf
6779(
6780"
6781O
6782n
6783e..."
6784); break; case 2: printf("Two..."); break; default: printf("Other..."
6785); break; }
6786}Fin
6787d
6788t
6789h
6790e
6791o
6792u
6793t
6794p
6795u
6796t
67971. O
6798n
6799e... 2. Two... 3. Other... 4. Error
68004.0
68012
68028
68037
6804#in
6805clu
6806d
6807e
6808<
6809s
6810t
6811dio.h
6812>
6813v
6814oid
6815m
6816ain
6817(
6818)
6819{
6820s
6821h
6822o
6823r
6824t
6825a
6826=
68272; switch(a) { case 1L: printf("
6828O
6829n
6830e
6831\
6832n
6833"
6834); break; case 2L: printf("Two\n"); break; default: printf("Else\n"); break; }
6835}Fin
6836d
6837t
6838h
6839e
6840o
6841u
6842t
6843p
6844u
6845t
68461. O
6847n
6848e
68492. Tw
6850o
68513. Els
6852e
68534. E
6854r
6855r
6856o
6857r
68582.0
68592
68608
68618
6862#in
6863clu
6864d
6865e
6866<
6867s
6868t
6869dio.h
6870>
6871v
6872oid
6873m
6874ain
6875(
6876)
6877{
6878s
6879h
6880o
6881r
6882t
6883d
6884a
6885y
6886=
68872; switch(day) { case 2: || c
6888a
6889s
6890e
68912
68922: printf("%d nd",d
6893a
6894y
6895); break; default: printf("%d th",day); break; }
6896}Fin
6897d
6898t
6899h
6900e
6901o
6902u
6903t
6904p
6905u
6906t
69071. 2
6908n
6909d
69102. 22
6911n
6912d
69133. E
6914r
6915r
6916o
6917r
69184. 2
6919n
6920d
69212
69222
6923n
6924d
69253.0
69262
69278
69289
6929#in
6930clu
6931d
6932e
6933<
6934s
6935t
6936dio.h
6937> int main(){ int a,b,c; a=0x10; b=010; c=a+b; printf("\nAddition is
6938=
6939%
6940d
6941",c
6942); return 0; }Find the output. 1. Ad
6943ditio
6944n is
6945=
69462
69470
69482. Ad
6949ditio
6950n is
6951=
69522
69534
69543. Ad
6955ditio
6956n is
6957=
6958G
6959a
6960r
6961b
6962a
6963g
6964e
69654. E
6966r
6967r
6968o
6969r
69702.0
6971S.N
6972O. Q
6973u
6974e
6975s
6976tio
6977n
6978s
6979C
6980h
6981oic
6982e
6983s
6984A
6985n
6986s
6987w
6988e
6989r
6990s
6991290
6992#include <stdio.h>
6993void main()
6994{
6995int x;
6996x= (printf("AA")||printf("BB"));
6997printf("%d",x);
6998printf("\n");
6999x= (printf("AA")&&printf("BB"));
7000printf("%d",x);
7001}
7002Find the output
70031.
7004AABB1
7005AABB1
70062.
70071
70081
70093.
7010AABB1
7011AA1
70124.
7013AA1
7014AABB1
70154.0
7016291
7017$a = array( null => 'a', true => 'b', false => 'c', 0 => 'd', 1 => 'e', '' => 'f' ); echo count($a),
7018"\n"; What will be printed?
70191.2 2.3 3.4 4.5 2.0
7020292 $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
7021293 What is the most common approach for the development of application system now?
70221.
7023Incremental development
70242.
7025Agile
70263.
7027Waterfall
70284.
7029None of the options
70301.0
7031294 ........ data type can store unstructured data
70321.
7033RAW
70342.
7035CHAR
70363.
7037NUMERIC
70384.
7039VARCHAR
70401.0
7041295 A wireless network interface controller can work in
70421.
7043infrastructure mode
70442.
7045ad-hoc mode
70463.
7047both infrastructure and ad-hoc mode
70484.
7049none
70503.0
7051S.NO. Questions Choices Answers
7052296
7053Consider the code snippet given below
7054var count = [1,,3];
7055What is the observation made?
70561.
7057The omitted value takes “undefined”
70582.
7059This results in an error
70603.
7061This results in an exception
70624.
7063Can't predict
70641.0
7065297
7066Consider the following javascript statements
7067x = ~-y;
7068w = x = y = z;
7069q = a?b:c?d:e?f:g;
7070The above code snippet is equivalent to:
70711.
7072x = ~(-y); w = (x = (y = z));
7073q = a?b:(c?d:(e?f:g));
70742.
7075x = a?b:(c?d:(e?f:g));
7076q = ~(-y); w = (x = (y = z));
70773.
7078x = (x = (y = z));w = ~(-y);
7079q = a?b:(c?d:(e?f:g));
70804.
7081x = ~(-y); w = (x = (y = z));
7082q = (c?d:(e?f:g));
70834.0
7084298
7085Consider the following statements
7086var text = "testing: 1, 2, 3"; // Sample text
7087var pattern = /\d+/g // Matches all instances of one or more digits
7088In order to check if the pattern matches with the string “text”, the statement is
70891.
7090text==pattern
70912.
7092text.equals(pattern)
70933.
7094text.test(pattern)
70954.
7096pattern.test(text)
70974.0
7098299 ------ is the minimal super key
70991.
7100Partial Key
71012.
7102Candidate Key
71033.
7104Surrogate Key
71054.
7106Unique Key
71072.0
7108300
7109----------- is a built - in JavaScript function which can be used to execute another function
7110after a given time interval.
71111.Timeout( ) 2.TimeInterval( ) 3.setTimeout ( ) 4.All of the above 3.0
7112301 .......... command can be used to modify a column in a table
71131.
7114alter
71152.
7116update
71173.
7118set
71194.
7120create
71211.0
7122S.NO. Questions Choices Answers
7123302 .………………… is preferred method for enforcing data integrity
71241.
7125Constraints
71262.
7127Stored Procedure
71283.
7129Triggers
71304.
7131Cursors
71321.0
7133303 66.6% risk is considered as
71341.
7135very low
71362.
7137low
71383.
7139moderate
71404.
7141high
71424.0
7143304
71448086 microprocessor is interfaced to 8253 a programmable interval timer. The maximum
7145number by which the clock frequency on one of the timers is divided by
71461.216 2.28 3.210 4.220 1.0
7147305 Which activity most easily lends itself to incremental design?
71481.
7149User Interfaces
71502.
7151Web Services
71523.
7153Enterprise resource planning
71544.
7155Embedded Sofftware
71563.0
7157306
71581. Graphical representation of the project, showing each task and activity as horizontal
7159bar whose length is proportion to time taken for a completion of that activity is called
71601.Gantt Chart 2.
7161Structure Chart
71623.
7163Pert Chart
71644.
7165Time Line
71661.0
71673017. Software deteriorates rather than wears out because
71681.
7169Software suffers from exposure to hostile environments
71702.
7171Defects are more likely to arise after software has been used
7172often
71733.
7174Multiple change requests introduce errors in component
7175interactions
71764.
7177Software spare parts become harder to order
71783.0
7179S.NO. Questions Choices Answers
7180308
71811. The 40-20-40 rule suggests that the least amount of development effort can be spent
7182on
71831.Estimation and planning 2.
7184Analysis and design
71853.
7186Coding
71874.
7188Testing
71893.0
71903019. The prototyping model of software development is
71911.
7192A reasonable approach when requirements are well defined
71932.
7194A Useful approach when a customer cannot define requirements clearly
71953.
7196The best approach to use projects with larger development teams
71974.
7198A risky model that rarely produces a meaningful product
71992.0
7200310 In reuse-oriented software engineering the last stage is _________.
72011.
7202component analysis
72032.
7204requirements modification
72053.
7206system validation
72074.
7208system design
72093.0
7210311 Which of the following is not a part/product of requirements engineering?
72111.
7212Feasibility study
72132.
7214Requirements validation
72153.
7216System models
72174.
7218Architectural design
72194.0
72203112. Software Specification is the process where
72211.
7222you decide what software you will use to program
72232.
7224you develop a prototype and show it to the client
72253.
7226You find out what services are required from the system
72274.
7228none
72293.0
7230S.NO. Questions Choices Answers
72313113. What is an advantage of incremental delivery?
72321.
7233everything is coded at once, so the customer receives the
7234full product
72352.
7236replacement systems are easily developed with full features
7237that clients expected from the old system
72383.
7239Customers can use prototypes and gain experience that
7240informs their requirements for later systems
72414.
7242none of the mentioned
72433.0
72443114. This is a software development process model
72451.waterfall model 2.
7246Incremental model
72473.
7248Boehm's Spiral model
72494.
7250all
72514.0
72523115. What is the type of software design that defines interfaces between system components?
72531.
7254architectural design
72552.
7256Interface Design
72573.
7258component Design
72594.
7260database design
72612.0
7262316
7263The size of the data count register of a DMA controller is 16 bits. The processor needs to
7264transfer a file of 29,154 kilobytes from disk to main memory. The memory is byte
7265addressable. The minimum number of times the DMA controller needs to get the control
7266of the system bus from the processor to transfer the file from the disk to main memory is
72671.
7268454
72692.
7270455
72713.
7272456
72734.
7274457
72753.0
7276317
7277For which of the following flip-flop the output clearly defined for all combinations of two
7278inputs?
72791.
7280D type flip-flop
72812.
7282R S type flip-flop
72833.
7284J K flip-flop
72854.
7286T flip-flop
72873.0
7288S.NO. Questions Choices Answers
7289318
7290In excitation table of D flipflop next state is equal to
72911.
7292Next State
72932.
7294Present State
72953.
7296Previous State
72974.
7298D State
72994.0
7300319
7301A computer system implements 8 kilobyte pages and a +32-bit physical address space.
7302Each page table entry contains a valid bit, a dirty bit, three permission bits, and the
7303translation. If the maximum size of the page table of a process is 24 megabytes, the
7304length of the virtual address supported by the system is _________ bits.
73051.
730633
73072.
730835
73093.
731034
73114.
731236
73134.0
7314320
7315A graphical display of the fundamental products in a truth-table is known as
73161.
7317Mapping
73182.
7319Graphing
73203.
7321T-map
73224.
7323Karnaugh-Map
73244.0
7325321
7326A processor can support a maximum memory of 4 GB, where the memory is wordaddressable
7327(a word consists of two bytes). The size of the address bus of the processor
7328is at least __________ bits
73291.
733030
73312.
733231
73333.
733432
73354.
733633
73372.0
7338322
7339A Stack-organized Computer uses instruction of
73401.
7341Indirect addressing
73422.
7343Two-addressing
73443.
7345Zero addressing
73464.
7347Index addressing
73483.0
7349S.NO. Questions Choices Answers
7350323
7351A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a
7352block size of 8 words. The word length is 32 bits. The size of the physical address space
7353is 4 GB. The number of bits for the TAG field is
73541.
735519
73562.
735720
73583.
735921
73604.
736122
73622.0
7363324
7364A circuit that converts n inputs to 2^n outputs is called
73651.
7366Encoder
73672.
7368Decoder
73693.
7370Comparator
73714.
7372Carry Look Ahead
73731.0
7374325
7375A Program Counter contains a number 825 and address part of the instruction contains
7376the number 24. The effective address in the relative address mode, when an instruction
7377is read from the memory is
73781.
7379849
73802.
7381850
73823.
7383801
73844.
7385802
73862.0
7387326
7388Buffering is useful because
73891.
7390It makes it seem like there’s more memory in the computer
73912.
7392It reduces the number of memory copies required
73933.
7394It allows all device drivers to use the same code
73954.
7396It allows devices and thee CPU to operate asynchronously
73974.0
7398S.NO. Questions Choices Answers
7399327
7400Consider a 6-stage instruction pipeline, where all stages are perfectly balanced.Assume
7401that there is no cycle-time overhead of pipelining. When an application is executing on
7402this 6-stage pipeline, the speedup achieved with respect to non-pipelined execution if
740325% of the instructions incur 2 pipeline stall cycles is
74041.
74051
74062.
74072
74083.
74094
74104.5
74113.0
7412328
7413Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop
7414method. There are 3 buffers each of size equal to disk block size, out of which one buffer
7415is reserved for intermediate results. Assuming size(r(R))
74161.
7417Relation r(R) is in the outer loop.
74182.
7419Relation s(S) is in the outer loop.
74203.
7421Join selection factor between r(R) and s(S) is more than 0.5
74224.
7423Join selection factor between r(R) and s(S) is less than 0.5.
74241.0
7425329
7426Consider a main memory system that consists of 8 memory modules attached to the
7427system bus, which is one word wide. When a write request is made, the bus is occupied
7428for 100 nanoseconds (ns) by the data, address, and control signals. During the same
7429100 ns, and for 500 ns thereafter, the addressed memory module executes one cycle
7430accepting and storing the data. The (internal) operation of different memory modules
7431may overlap in time, but only one request can be on the bus at any time. The maximum
7432number of stores (of one word each) that can be initiated in 1 millisecond is
74331.
74345535
74352.
743665335
74373.
743853892
74394.
744010000
74414.0
7442330
7443Consider two processors P1 and P2 executing the same instruction set. Assume that
7444under identical conditions, for the same input, a program running on P2 takes 25% less
7445time but incurs 20% more CPI (clock cycles per instruction) as compared to the program
7446running on P1 If the clock frequency of P1 is 1GHz, then the clock frequency of P2 (in
7447GHz) is
74481.
74491.5
74502.
74511.6
74523.
74531.7
74544.
74551.8
74562.0
7457331
7458Content of the program counter is added to the address part of the instruction in order to
7459obtain the effective address is called
74601.
7461relative address mode.
74622.
7463index addressing mode.
74643.
7465register mode
74664.
7467implied mode
74681.0
7469S.NO. Questions Choices Answers
7470332
7471How many address bits are needed to select all memory locations in the 16K × 1 RAM?
74721.
74738
74742.
747510
74763.
747714
74784.
747916
74803.0
7481333
7482If the associativity of a processor cache is doubled while keeping the capacity and block
7483size unchanged, which one of the following is guaranteed to be NOT affected?
74841.
7485Width of tag comparator
74862.
7487Width of set index decoder
74883.
7489Width of way selection multiplexer
74904.
7491Width of processor to main memory data bus
74924.0
7493334
7494If the main memory is of 8K bytes and the cache memory is of 2K words. It uses
7495associative mapping. Then each word of cache memory shall be_____.
74961.
749711 bits
74982.
749921 bits
75003.
750116 bits
75024.
750320 bits
75043.0
7505335
7506If two interrupts, one of higher priority and other of lower priority occur simultaneously,
7507then the service provided is for
75081.
7509interrupt of lower priority
75102.
7511interrupt of higher priority
75123.
7513both the interrupts
75144.
7515none of the mentioned
75162.0
7517336
7518Minterms are arranged in map in a sequence of
75191.
7520binary sequence
75212.
7522gray code
75233.
7524binary variables
75254.
7526BCD code
75272.0
7528S.NO. Questions Choices Answers
7529337
7530Register renaming is done is pipelined processors
75311.
7532As an alternative to register allocation at compile time
75332.
7534For efficient access to function parameters and local variables
75353.
7536To handle certain kinds of hazards
75374.
7538As part of address translation
75393.0
7540338
7541Simplified form of the boolean expression (X + Y + XY) (X + Z) is
75421.
7543X + Y + Z
75442.
7545XY + YZ
75463.
7547X + YZ
75484.
7549XZ + Y
75503.0
7551339
7552The 16-bit 2’s complement representation of an integer is 1111 1111 1111 0101, its
7553decimal representation is
75541.
75551
75562.
75572
75583.
75593
75604.
7561-11
75624.0
7563340
7564The addressing mode used in an instruction of the form ADD R1, R2 is _____.
75651.
7566Absolute
75672.
7568Indirect
75693.
7570Index
75714.
7572Register
75733.0
7574341
7575The capacity of a memory unit is defined by the number of words multiplied by the
7576number of bits/word. How many separate address and data lines are needed for a
7577memory of 4 K × 16?
75781.
757910 address, 16 data lines
75802.
758111 address, 8 data lines
75823.
758312 address, 12 data lines
75844.
758512 address, 16 data lines
75864.0
7587S.NO. Questions Choices Answers
7588342
7589The data-in register of I/O port is
75901.
7591read by host to get input
75922.
7593read by controller to get input
75943.
7595written by host to send output
75964.
7597written by host to start a command
75981.0
7599343
7600The Firmware are stored in read-only memory or ________ chips.
76011.
7602Flash memory
76032.
7604Dynamic random access memory
76053.
7606EEPROM
76074.
7608Random-access memory
76093.0
7610344
7611The performance of cache memory is frequently measured in terms of a quantity called
76121.
7613hit ratio
76142.
7615miss ratio
76163.
7617average ratio
76184.
7619ratio
76201.0
7621345
7622The smallest integer than can be represented by an 8-bit number in 2?s complement
7623form is
76241.
7625-256
76262.
7627-128
76283.
7629-127
76304.
76311
76322.0
7633346 The main difference between JK and RS flip-flop is that
76341.
7635JK flip flop needs a clock pulse
76362.
7637There is a feedback in JK flip-flop
76383.
7639JK flip-flop accepts both inputs as 1
76404.
7641JK flip-flop is acronym of Junction cathode multi-vibrator
76423.0
7643S.NO. Questions Choices Answers
7644347
7645The rate at which a computer clock deviates from a perfect reference clock is called as
76461.
7647Clock rate
76482.
7649Clock speed
76503.
7651clock drift rate
76524.
7653Transmission Bandwidth
76543.0
7655348
7656The width of the physical address on a machine is 40 bits. The width of the tag field in a
7657512 KB 8-way set associative cache is ______ bits
76581.
765921
76602.22
76613.
766223
76634.
766424
76654.0
7666349
7667To build a mod-19 counter the number of flip-flops required is
76681.
76693
76702.
76715
76723.
76737
76744.
76759
76762.0
7677350
7678Using 10's complement 72532- 3250 is
76791.
768069282
76812.
768269272
76833.
768469252
76854.
768669232
76871.0
7688351
7689What is the main difference between traps and interrupts?
76901.
7691How they are initiated
76922.
7693The kind of code that’s used to handle them
76943.
7695Whether or not the scheduler is called
76964.
7697How the operating system returns from them
76981.0
7699S.NO. Questions Choices Answers
7700352
7701When an instruction is read from the memory, it is called
77021.
7703Memory Read cycle
77042.
7705Fetch cycle
77063.
7707Instruction cycle
77084.
7709Memory write cycle
77103.0
7711353
7712Which amongst the following refers to Absolute addressing mode
77131.
7714move R1, R2
77152.
7716move LOC1, LOC2
77173.
7718move LOC1, R2
77194.
7720move LOC2, R1
77211.0
7722354
7723Which level of RAID refers to disk mirroring with block striping?
77241.
7725RAID level 1
77262.
7727RAID level 2
77283.
7729RAID level 0
77304.
7731RAID level 3
77321.0
7733355
7734Which of the following logic expression is incorrect?
77351.
77361 ⊕ 0 = 1
77372.
77381 ⊕ 1 ⊕ 0 =1
77393.
77401 ⊕ 1 ⊕ 1 = 1
77414.
77421 ⊕ 1 = 0
77432.0
7744356
7745Which of the following paging algorithms is most likely to be used in a virtual memory
7746system?
77471.
7748FIFO
77492.
7750Second chance
77513.
7752Least Recently Used
77534.
7754Least Frequently Used
77553.0
7756S.NO. Questions Choices Answers
7757357
7758Which one of the following connects high-speed high-bandwidth device to memory
7759subsystem and CPU.
77601.
7761expansion bus
77622.
7763PCI bus
77643.
7765SCSI bus
77664.
7767none of the mentioned
77681.0
7769358
7770Which one of these is characteristic of RAID 5?
77711.
7772Distributed parity
77732.
7774No Parity
77753.
7776All parity in a single disk
77774.
7778Double Parity
77791.0
7780359
7781Which two RAID types use parity for data protection?
77821.
7783RAID 1
77842.
7785RAID 4
77863.
7787RAID 1+0
77884.
7789RAID 5
77904.0
7791360
7792X=1010100 and Y=1000011 using 1's complement Y-X is
77931.
7794-10111
77952.
7796-10011
77973.
7798-10001
77994.
7800-11001
78013.0
7802361
7803The minimum number of NAND gates required to implement the Boolean function. A +
7804AB' + AB'C is equal to
78051.
7806Zero
78072.
78081
78093.
78104
78114.
78127
78131.0
7814S.NO. Questions Choices Answers
7815362
7816Which of the following boolean expressions is not logically equivalent to all of the rest ?
78171.
7818ab + (cd)' + cd + bd'
78192.
7820a (b + c) + cd
78213.
7822ab + ac + (cd)'
78234.
7824bd' + c'd' + ab + cd
78253.0
7826363
7827Which of the following unit will choose to transform decimal number to binary code ?
78281.
7829Encoder
78302.
7831Decoder
78323.
7833Multiplexer
78344.
7835Counter
78361.0
7837364
7838If the associativity of a processor cache is doubled while keeping the capacity and block
7839size unchanged, which one of the following is guaranteed to be NOT affected?
78401.Width of tag comparator
78412.Width of set index decoder
78423.Width of way selection multiplexer
78434.Width of processor to main memory data bus
78444.0
7845365
7846The correspondence between the main memory blocks and those in the cache is given by
78471.
7848Hash function
78492.
7850Mapping function
78513.
7852Locale function
78534.
7854Assign function
78552.0
7856366
7857The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first
7858stage (with delay 800 picoseconds) is replaced with a functionally equivalent design
7859involving two stages with respective delays 600 and 350 picoseconds. The throughput
7860increase of the pipeline is __________ percent.
78611.
786233
78632.
786434
78653.
786635
78674.
786832
78691.0
7870S.NO. Questions Choices Answers
7871367
7872What is the software that runs a computer, including scheduling tasks, managing
7873storage, and handling communication with peripherals?
78741.
7875driver
78762.
7877application suitex
78783.
7879operating system
78804.
7881bluetooth technology
78823.0
7883368 For an undirected graph with n vertices and e edges, the sum of the degree of each
7884vertex isequal to
78851.2n
78862.
7887(2n-1)/2
78883.2e
78894.
7890pow(e,2)/2
78913.0
7892369 Which attribute is used to extend the lifetime of a cookie?
78931.
7894higher-age
78952.
7896increase-age
78973.
7898max-age
78994.
7900lifetime
79013.0
7902370 <h2 style="color:blue">I am Blue</h2> is ____ way of styling HTML elements
79031.
7904Internal Style
79052.
7906Inline Style
79073.
7908External Style
79094.
7910Default
79112.0
7912371
7913____________ is referred to as Static Web
79141.
7915Web 1.0
79162.
7917Web 2.0
79183.
7919Web 3.0
79204.
7921Web 4.0
79221.0
7923372
7924A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The levelorder
7925traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into
7926the heap in that order. The level-order traversal of the heap after the insertion of the
7927elements is:
79281.
792910, 8, 7, 3, 2, 1, 5
79302.
793110, 8, 7, 2, 3, 1, 5
79323.
793310, 8, 7, 1, 2, 3, 5
79344.
793510, 8, 7, 5, 3, 2, 1
79361.0
7937S.NO. Questions Choices Answers
7938373
7939A binary tree in which if all its levels except possibly the last, have the maximum number
7940of nodes and all the nodes at the last level appear as far left as possible, is known as
79411.
7942full binary tree
79432.
7944AVL tree
79453.
7946threaded tree
79474.
7948complete binary tree
79491.0
7950374 A binary tree T has 20 leaves. The number of nodes in T having two children is
79511.
795234
79532.
795499
79553.
79567
79574.
795819
79594.0
7960375
7961A process executes the code
7962fork ();
7963fork ();
7964fork ();
7965The total number of child processes created is
79661.
79673
79682.
79694
79703.
79717
79724.
79738
79743.0
7975376 A Search engine can serve as
79761.
7977both as a server and a client
79782.
7979As Client always
79803.
7981As Server always
79824.
7983Neither client nor server
79841.0
7985377 An object of class A receives a message with an argument that is an instance of class B.
7986Identify the type of relationship between class A and Class B:
79871.
7988Generalization
79892.
7990Association
79913.
7992Aggregation
79934.
7994Realization
79951.0
7996S.NO. Questions Choices Answers
7997378
7998Consider an undirected graph G where self-loops are not allowed. The vertex set of G is
7999{(i, j): 1 = i = 12, 1 = j = 12}. There is an edge between (a, b) and (c, d) if |a - c| = 1 and |b
8000- d| = 1. The number of edges in this graph is
80011.
8002505
80032.
8004506
80053.
8006507
80074.
8008508
80092.0
8010379
8011Consider an undirected random graph of eight vertices. The probability that there is an
8012edge between a pair of vertices is ½. What is the expected number of unordered cycles
8013of length three?
80141.
80151/8
80162.
80171
80183.
80197
80204.
80218
80223.0
8023380
8024Consider the C function given below.
8025int f(int j)
8026{
8027static int i = 50;
8028int k;
8029if (i == j)
8030{
8031printf("something");
8032k = f(i);
8033return 0;
8034}
8035else return 0;
8036}
8037Which one of the following is TRUE?
80381.
8039The function returns 0 for all values of j.
80402.
8041The function prints the string something for all values of j.
80423.
8043The function returns 0 when j = 50.
80444.
8045The function will exhaust the runtime stack or run into an infinite loop
8046when j = 50.
80474.0
8048381
8049Consider the following function written the C programming language.
8050void foo (char * a ) {
8051if (* a & & * a ! =' ' ){
8052putchar (*a);
8053}
8054}
8055}
8056The output of the above function on input 'ABCD EFGH' is
80571.
8058ABCD EFGH
80592.
8060ABCD
80613.
8062HGFE DCBA
80634.
8064DCBA
80651.0
8066382
8067Consider the following New-order strategy for traversing a binary tree:
80681)Visit the root;
80692)Visit the right subtree using New-order;
80703)Visit the left subtree using New-order;
8071The New-order traversal of the expression tree corresponding to the reverse polish
8072expression 3 4 * 5 - 2 ? 6 7 * 1 + - is given by:
80731.
8074+ - 1 6 7 * 2 ? 5 - 3 4 *
80752.
8076. - + 1 * 6 7 ? 2 - 5 * 3 4
80773.
8078- + 1 * 7 6 ? 2 - 5 * 4 3
80794.
8080. 1 7 6 * + 2 5 4 3 * - ? -
80813.0
8082S.NO. Questions Choices Answers
8083383
8084Consider the following program:
8085int f(int *p, int n)
8086{
8087if (n <= 1) return 0;
8088else return max ( f (p+1, n-1),p[0]-p[1]);
8089}
8090int main()
8091{
8092int a[] = {3,5,2,6,4};
8093printf("%d", f(a,5));
8094}
8095The value printed by this program is
80961.
80972
80982.
80991
81003.
81013
81024.
81034
81043.0
8105384
8106Consider the following recursive C function.
8107Void get (int n)
8108{if (n<1) return;
8109get (n-1)
8110get (n-3) ;
8111printf ("%d",n);
8112If get(6) function is being called in main () then how many times will the get() function be
8113invoked before returning to the main ( ) ?
81141.
811515
81162.
811725
81183.
811943
81204.
812124
81222.0
8123385
8124Consider the function func shown below:
8125int func(int num) {
8126int count = 0;
8127while (num) {
8128count++;
8129num>>= 1;
8130}
8131return (count);
8132}
8133The value returned by func(435)is
81341.
81357
81362.
81378
81383.
81399
81404.
81410
81423.0
8143386 For the array (77 ,62,114,80,9,30,99), write the order of the elements after two passes
8144using the Radix sort
81451.
814680 30 62 114 77 9 99
81472.
8148114 30 62 77 9 99
81493.
81509 114 30 62 77 80 99
81514.
81529 30 62 77 80 99 114
81532.0
8154387 How can you make a list that lists the items with numbers?
81551.
8156<list>
81572.
8158<ol>
81593.
8160<dl>
81614.
8162<ul>
81632.0
8164S.NO. Questions Choices Answers
8165388 How do you write "Hello World" in PHP?
81661.
8167using System.out.println
81682.
8169using Document.Write("Hello World")
81703.
8171"Hello World"
81724.
8173using echo("Hello World")
81744.0
8175389 HTTP is implemented over
81761.
8177UDP
81782.
8179TCP
81803.
8181SMTP
81824.
8183POP
81842.0
8185390
8186If every node u in G adjacent to every other node v in G, A graph is said to be
81871.
8188isolated
81892.
8190complete
81913.
8192finite
81934.
8194strongly connected
81952.0
8196391 In a connected graph, a bridge is an edge whose removal disconnects a graph. Which
8197one of the following statements is true?
81981.
8199A tree has no bridges
82002.
8201A bridge cannot be part of a simple cycle
82023.
8203Every edge of a clique with size 3 is a bridge (A clique is any
8204compete sub graph of a graph)
82054.
8206A graph with bridges cannot have a cycle
82074.0
8208392
8209In HTTP, which method gets the resource as specified in the URI
82101.
8211GET
82122.
8213POST
82143.
8215PUT
82164.
8217TRACE
82183.0
8219S.NO. Questions Choices Answers
8220393
8221Java package is a grouping mechanism with the purpose of
82221.
8223Providing the library for the Java program
82242.
8225Controlling the visibility of the classes, interfaces and methods
82263.
8227Replacing header file used in C/C++
82284.
8229An application framework
82302.0
8231394
8232Suppose a circular queue of capacity (n ? 1) elements is implemented with an array of n
8233elements. Assume that the insertion and deletion operations are carried out using
8234REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0.
8235The conditions to detect queue full and queue empty are
82361.
8237full: (REAR+1) mod n==FRONT
8238empty: REAR ==FRONT
82392.
8240(REAR) mod n==FRONT
8241empty: REAR ==FRONT
82423.
8243(REAR+1) mod n==Rear
8244empty: REAR ==FRONT
82454.
8246full: (FRONT+1) mod n==FRONT
8247empty: REAR ==FRONT
82481.0
8249395
8250The following function computes the maximum value contained in an integer array
8251p[ ] of size n (n >= 1).
8252int max(int *p, int n) {
8253int a=0, b=n-1;
8254while (__________) {
8255if (p[a] <= p[b]) { a = a+1; }
8256else { b = b-1; }
8257}
8258return p[a];
8259}
8260The missing loop condition is
82611.
8262a != n
82632.
8264b != 0
82653.
8266b > (a+1)
82674.
8268b != a
82694.0
8270396 The following HTML element helps making animated text
82711.
8272<em>
82732.
8274<ins>
82753.
8276<mark>
82774.
8278<marquee>
82794.0
8280397 The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty
8281binary search tree, such that the resulting tree has height 6, is
82821.
828363
82842.
828564
82863.
828765
82884.
828966
82902.0
8291S.NO. Questions Choices Answers
8292398 The purpose of a TLB is
82931.
8294To cache page translation information
82952.
8296To cache frequently used data
82973.
8298To hold register values while a process is waiting to be run
82994.
8300To hold the start and length of the page table
83012.0
8302399 The following HTML element is used to display horizontal line
83031.
8304<br>
83052.
8306<h>
83073.
8308<hr>
83094.
8310<h2>
83113.0
8312400 To prevent any method from overriding, the method has to declared as,
83131.
8314static
83152.
8316const
83173.
8318final
83194.
8320extends
83213.0
8322401 Use of ________ allows for some processes to be waiting on I/O while another process
8323executes.
83241.
8325multiprogramming
83262.
8327multiuser interfacing
83283.
8329Random scheduling
83304.
8331Variable cpu cycles
83321.0
8333402 What are the parameters of the service method?
83341.
8335ServletRequest and ServletResponse
83362.
8337HttpServletRequest and HttpServletResponse
83383.
8339HttRequest and HttpResponse
83404.
8341Request and Response
83422.0
8343S.NO. Questions Choices Answers
8344403 What does JSP stand for?
83451.
8346Java Scripting Pages
83472.
8348Java Service Pages
83493.
8350Java Server Pages
83514.
8352Java Script Program
83533.0
8354404
8355What does the following bit of JavaScript print out?
8356var a = [1,,3,4,5];
8357console.log([a[4], a[1], a[5]]);
83581.
83595, undefined,undefined
83602.
83615,3,undefined
83623.
83635,0,undefined
83644.
83655,null,undefined
83661.0
8367405 What is cell padding?
83681.
8369Used to separate cell walls from their contents
83702.
8371Used to set space between cells
83723.
8373Used to provide width to a cell
83744.
8375Used to merge two cells
83762.0
8377406 What is the correct HTML for making a text input field?
83781.
8379<input type="text">
83802.
8381<textfield>
83823.
8383<input type="textfield">
83844.
8385<textinput type="text">
83861.0
8387407
8388What will be printed as the output of the following program?
8389public class testincr
8390{
8391public static void main(String args[])
8392{
8393int i = 0;
8394i = i++ + i;
8395System.out.println(" I = " +i);
8396}
8397}
83981.
8399I = 0
84002.
8401I = 1
84023.
8403I = 2
84044.
8405I = 3
84062.0
8407S.NO. Questions Choices Answers
8408408 Which method is used to get the year of a date object in YYYY format in Javascript.
84091.
8410getYear()
84112.
8412getYYYY()
84133.
8414getFullYear()
84154.
8416get4Year()
84171.0
8418409 Which of the following input controls that cannot be placed using <input> tag?
84191.
8420Text
84212.
8422Password
84233.
8424Submit
84254.
8426Textarea
84274.0
8428410 Which is the correct CSS syntax?
84291.
8430body:color=black
84312.
8432{body;color:black}
84333.
8434{body:color=black(body}
84354.
8436body {color: black}
84374.0
8438411 Which of the following asymptotic notation is the worst among all?
84391.
8440n + 9378
84412.
84422^ n-1
84433.
84442^ n - 1
84454.
84462n ? 1
84472.0
8448412
8449Which of the following is/are example(s) of stateful application layer protocols?
8450(i)HTTP
8451(ii)FTP
8452(iii)TCP
8453(iv)POP3
84541.
8455(i) and (ii) only
84562.
8457(ii) and (iii) only
84583.
8459(ii) and (iv) only
84604.
8461(iv) only
84623.0
8463413 Which of these is not a valid attribute of <tr> element?
84641.
8465valign
84662.
8467bgcolor
84683.
8469align
84704.
8471rowspan
84724.0
8473S.NO. Questions Choices Answers
8474414
8475Which of these methods has no restrictions on content size when a form is submitted.
84761.
8477GET
84782.
8479HEAD
84803.
8481POST
84824.
8483PUT
84843.0
8485415 Which one is the first search engine in internet?
84861.
8487Google
84882.
8489Archie
84903.
8491AltaVista
84924.
8493WAIS
84942.0
8495416 While inserting the elements 71,65,84,69,67,83 in an empty binary search tree (BST) in
8496the sequence shown, the element in the lowest level is
84971.
849845
84992.
850067
85013.
850234
85034.
850478
85052.0
8506417 A mailer that transforms a message body of an e-mail into a web page is called a
85071.
8508Browser enriched mail client
85092.
8510HTML-enabled mail client
85113.
8512Rich Text mail client
85134.
8514client server mail client
85152.0
8516418 An incorrectly typed command will cause the operating system to display
85171.
8518a prompt
85192.
8520an error message
85213.
8522a question mark
85234.
8524causes exception
85252.0
8526S.NO. Questions Choices Answers
8527419 Choose the correct HTML to left-align the content inside a table cell
85281.
8529<tdleft>
85302.
8531<td leftalign>
85323.
8533<td valign="left">
85344.
8535<td align="left">
85364.0
8537420
8538Consider the below code fragment:
8539if(fork k( ) = = 0)
8540{
8541a= a+5; printf("%d, %d \n", a, &a);
8542}
8543else
8544{
8545a= a ? 5;
8546printf("%d %d \n", 0, &a);
8547}
8548Let u, v be the values printed by parent process and x, y be the values printed by child
8549process. Which one of the following is true?
85501.
8551u= x + 10 and v = y
85522.
8553u= x + 10 and v!= y
85543.
8555u + 10= x and v = y
85564.
8557u + 10= x and v != y
85583.0
8559421
8560Consider the following C code segment:
8561int a, b, c = 0;
8562void prtFun(void);
8563main( )
8564{ static int a = 1; /* Line 1 */
8565prtFun( );
8566a + = 1;
8567prtFun( )
8568printf("\n %d %d", a, b);
8569}
8570void prtFun(void)
8571{ static int a=2; /* Line 2 */
8572int b=1;
8573a+=++b;
8574printf("\n %d %d", a, b);
8575}
8576What output will be generated by the given code segment if:
8577Line 1 is replaced by auto int a = 1;
8578Line 2 is replaced by register int a = 2;
85791.
858031
858141
858242
85832.
858442
858561
858661
85873.
858842
858962
859020
85914.
859242
859342
859420
85954.0
8596422
8597Consider the following C program.
8598#include <stdio.h>
8599int f1 (void) ;
8600int f 2 (void) ;
8601int x = 10;
8602int main ()
8603{
8604int x=1;
8605x+=f1()+ f2()+f3()+f2() ;
8606printf("%d", x);
8607return 0;
8608}
8609int f1(){int x=25; x++; return x;}
8610int f2(){static int x =50; x++;return x;}
8611int f3(){x*=10; return x};
8612The output of the program is_________.
86131.
8614434
86152.
8616230
86173.
861843
86194.
8620432
86212.0
8622423
8623Consider the following program:
8624int f(int *p, int n)
8625{
8626if (n <= 1) return 0;
8627else return max ( f (p+1, n-1),p[0]-p[1]);
8628}
8629int main()
8630{
8631int a[] = {3,5,2,6,4};
8632printf("%d", f(a,5));
8633}
8634The value printed by this program is
86351.
86361
86372.
86382
86393.
86403
86414.
86424
86433.0
8644S.NO. Questions Choices Answers
8645424
8646Find the output of the following program?
8647#include <iostream.h>
8648using namespace std;
8649void myFunction(int& x, int* y, int* z) {
8650static int temp=1;
8651temp += (temp + temp) - 1;
8652x += *(y++ + *z)+ temp - ++temp;
8653*y=x;
8654x=temp;
8655*z= x;
8656cout<<x<<*y<<*z<<temp;
8657}
8658int main() {
8659int i = 0;
8660int j[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
8661i=i++ - ++i;
8662myFunction(i, j, &i);
8663return 0;
8664}
86651.
86663 3 3 2
86672.
86683 2 3 3
86693.
86703 2 3 2
86714.
86723 1 3 3
8673gar3
8674425
8675If you don’t want the frame windows to be resizeable, simply add what to the lines ?
86761.
8677save
86782.
8679dontresize
86803.
8681noresize
86824.
8683Delete
86843.0
8685426 Sockets originate from
86861.
8687BSD Unix
86882.
8689Windows
86903.
8691Linux
86924.
8693Mac
86941.0
8695427 The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35,
869642.Which one of the following is the postorder traversal sequence of the same tree?
86971.
869810,20,15,23,25,35,42,39,30
86992.
870015,10,25,23,20,42,35,39,30
87013.
870215,20,10,23,25,42,35,39,30
87034.
870415,10,23,25,20,35,42,39,30
87054.0
8706428
8707What will be the output of the following C program?
8708void count(int n){
8709static int d=1;
8710printf("%d ", n);
8711printf("%d ", d);
8712d++;
8713if(n>1) count(n-1);
8714printf("%d ", d);
8715}
8716void main(){
8717count(3);
8718}
87191.
87203 1 2 2 1 3 4 4 4
87212.
87223 1 2 1 1 1 2 2 2
87233.
87243 1 2 2 1 3 4
87254.
87263 1 2 1 1 1 2
87271.0
8728S.NO. Questions Choices Answers
8729429 Where in an HTML document is the correct place to refer to an external style sheet?
87301.
8731In the section
87322.
8733In the section
87343.
8735At the end of the document
87364.
8737At the top of the document
8738head
8739430 Which of the following is included in the head section of HTML
87401.
8741title,body,form and script
87422.
8743title,meta tag,script and CSS
87443.
8745title , meta tag,css and form
87464.
8747title, body,script and CSS
87482.0
8749431 Which of these is Server side technology?
87501.
8751CGI
87522.
8753HTML
87543.
8755JavaScript
87564.
8757CSS
87583.0
8759432 Which of the following in HTML is used to left align the content inside a table cell?
87601.
8761<td raligh = "left" >
87622.
8763<tdleft>
87643.
8765<td leftalign>
87664.
8767<td align = "left">
87684.0
8769433 Which one of the following statements is NOT correct about HTTP cookies?
87701.
8771A cookie is a piece of code that has the potential to compromise the
8772security of an internet user
87732.
8774A cookie gains entry to the user's work area through an HTTP
8775header
87763.
8777A cookie has an expiry date and time
87784.
8779Cookies can be used to track the browsing pattern of a user at a
8780particular site
87811.0
8782S.NO. Questions Choices Answers
8783434
8784Consider the following program:
8785int f(int *p, int n)
8786{
8787if (n <= 1) return 0;
8788else return max ( f (p+1, n-1),p[0]-p[1]);
8789}
8790int main()
8791{
8792int a[] = {3,5,2,6,4};
8793printf("%d", f(a,5));
8794}
8795The value printed by this program is
87961.
87971
87982.
87992
88003.
88013
88024.
88034
88043.0
8805435 Which of these methods has no restrictions on content size when a form is submitted.
88061.
8807GET
88082.
8809HEAD
88103.
8811POST
88124.
8813PUT
88143.0
8815436
8816______________datastructure used in pushdown automata.
88171.
8818Stack
88192.
8820array
88213.
8822queue
88234.
8824linked list
88251.0
8826437
8827Consider the following:
8828temp=root->left;
8829while(temp->right!=NULL)
8830temp=temp->right;
8831return temp;
8832The above code snippet for a BST with the address of the root node in pointer
8833‘root’ returns
88341.Inorder successor of the root 2.
8835Maximum element in the right subtree of root
88363.
8837Minimum element in the right subtree of root
88384.
8839Inorder predecessor of the root
88404.0
8841438
8842_____ is used to define a special CSS style for a group of HTML elements
88431.
8844Class attribute
88452.
8846name attribute
88473.
8848group attribute
88494.
8850id attribute
88511.0
8852S.NO. Questions Choices Answers
8853439 The _______ attribute defines the action to be performed when the form is submitted
88541.
8855method attribute
88562.
8857action attribute
88583.
8859onSubmit attribute
88604.
8861onClick attribute
88622.0
8863440
8864Consider a schedule S1 given below;
8865R1(A); W1(A); R2(B); R2(A); R1(B); W2(A+B); W1(B); where R1 and W1 are read and
8866write operations of transaction T1 and R2 and W2 are read and write operations of
8867transaction T2.
8868Which of the following is correct regarding schedule S1?
88691.
8870S1 is a serializable schedule
88712.
8872A deadlock will occur if 2PL is used
88733.
8874S1 is a conflict serializable schedule
88754.
8876S1 is a view serializable schedule
88774.0
8878441
8879Boolean algebra is also called
88801.
8881switching algebra
88822.
8883arithmetic algebra
88843.
8885linear algebra
88864.
8887algebra
88881.0
8889442 Software prototyping helps to
88901.
8891generate code
88922.
8893provide thorough testing
88943.
8895explore possible software solutions
88964.
8897collect initial software requirements
88982.0
8899443
8900Activities such as documentation and software configuration management are what kind of process
8901activities?
89021.
8903Primary
89042.
8905Validation
89063.
8907Design
89084.
8909supporting
89104.0
8911S.NO. Questions Choices Answers
8912444 In incremental delivery the ________ services are typically delivered first
89131.
8914quickest to complete
89152.
8916highest-priority
89173.
8918cheapest
89194.
8920most fun to code
89212.0
8922445 In incremental development system structure tends to ______ as many new increments are added.
89231.
8924degrade
89252.
8926improve
89273.
8928develop its own AI
89294.
8930shrink
89311.0
8932446 Software specifications are intended to communicate the system needs __________________
89331.
8934of the developers to the clients
89352.
8936to marketing
89373.
8938of the clients to the developers
89394.
8940to the general public
89413.0
8942447
8943This software process model takes the fundamental activities of specification, development, validation,
8944and evolution and represents them as separate process phases such as requirements specification,
8945software design, implementation, testing, and so on
89461.
8947Incremental development
89482.
8949The waterfall model
89503.
8951Reuse-oriented software engineering
89524.
8953Boehm's spiral model
89542.0
8955448 What is a software process model?
89561.
8957A simplified representation of a software process
89582.
8959A presentation put together in Powerpoint
89603.
8961A work flow model of the software’s components
89624.
8963A prototype of the final software product
89641.0
8965S.NO. Questions Choices Answers
8966449 What is a type of software design that designs system data structures to be used in a database?
89671.
8968architectural design
89692.
8970interface Design
89713.
8972component Design
89734.
8974Database design
89754.0
8976450 What is based on the idea of developing an initial implementation, exposing this to user comment and
8977evolving it through several versions until an adequate system has been developed?
89781.
8979The Waterfall Method
89802.
8981Incremental Development
89823.
8983Reuse-oriented Software Engineering
89844.
8985Implementation And Unit Testing
89862.0
8987451 What is NOT part of the design process
89881.
8989Architectural design
89902.
8991Database design
89923.
8993Component design
89944.
8995Validation testing
89964.0
8997452 Which is not part of the waterfall method?
89981.
8999Requirements Definition
90002.
9001System and Software Design
90023.
9003Implementation and Unit Testing
90044.
9005System Validation
90064.0
9007453 Which statement best describes a benefit of Incremental development over the waterfall model
90081.
9009It is possible to gather more of the requirements up front
90102.
9011Time to market is faster because there is less overhead
90123.
9013It is easier to get customer feedback on the development work that’s been done
90144.
9015It is easier to reuse existing components.
90163.0
9017S.NO. Questions Choices Answers
9018454
9019___________ adds to the costs of Software Development because it usually means that
9020work that has been completed has to be redone
90211.
9022Picture quality
90232.
9024Production
90253.
9026Software speed
90274.
9028Change
90294.0
9030455
9031Given the following structure template, choose the correct syntax for accessing the 5th subject marks of
9032the 3rd student:
9033struct stud
9034{
9035int marks[6];
9036char sname[20];
9037char rno[10];
9038}s[10];
90391.
9040stud[2].marks[4]
90412.
9042stud[4].marks[2]
90433.
9044s[2].marks[4]
90454.
9046s[4].marks[2]
90473.0
9048456 By default, any real number in C is treated as ____
90491.
9050a float
90512.
9052a double
90533.
9054a long double
90554.
9056depends on the memory model
90571.0
9058457 ____________ is the 1st step in the testing process
90591.
9060Analyze results
90612.
9062Plan test
90633.
9064Release product
90654.
9066Conduct tests
90672.0
9068458
9069A set of documents in which a given document can contain text, graphics video and
9070audio clips as well as embedded references to other documents world wide web
9071pages are called as
9072---------------
90731.
9074Hypermedia message
90752.
9076Hypertext document
90773.
9078Hypermedia Documents
90794.
9080Path rectangular grid of Pixels
90813.0
9082S.NO. Questions Choices Answers
9083459
9084A software requirements specification (SRS) document should avoid discussing
9085which one of the following?
90861.
9087User interface issues
90882.
9089Non-functional requirements
90903.
9091Design specification
90924.Interfaces with third party softwareKey
90931.0
9094460
9095Consider a B+ tree in which the search Answer is 12 bytes long, block size is 1024
9096bytes,record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the
9097tree is ____
90981.
909940
91002.
910150
91023.
910360
91044.
910570
91062.0
9107461 Extreme Programming process model includes framework activities such as
91081.
9109analysis, design,coding,testing
91102.
9111planning,analysis,design,coding
91123.
9113planning,analysis,coding,testing
91144.
9115planning, design, coding, testing
91164.0
9117462
9118For automatic objects, constructors and destructors are called each time the
9119objects ___
91201.
9121enter and leave scope
91222.
9123inherit parent class
91243.
9125are constructed
91264.
9127are destroyed
91281.0
9129463 Important capability needed for an agile software developer is
91301.
9131Trust
91322.
9133Competence
91343.
9135Decision-making
91364.
9137HardworkKey
91383.0
9139S.NO. Questions Choices Answers
9140464 In which phase is Agile Modeling(AM) carried out
91411.
9142Analysis
91432.
9144Coding
91453.
9146Planning
91474.
9148TestingKey
91493.0
9150465 Mnemonic codes and variable names are used in
91511.
9152Machine language
91532.
9154Assembly language
91553.
9156high level language
91574.
9158Used nowhere
91592.0
9160466 Waterfall model of software development is also termed as
91611.
9162The linear sequential model
91632.
9164Fountain model
91653.
9166Spiral model
91674.
9168Concurrent development model
91691.0
9170467 Which of the following is not a Life-critical System?
91711.
9172Fire Dispatch Systems
91732.
9174Nuclear Reactors
91753.
9176Power Utilities
91774.
9178Inventory Management
91794.0
9180468 Which of the following statement is correct about destructors?
91811.
9182A destructor has void return type.
91832.
9184A destructor has integer return type.
91853.
9186A destructor has no return type.
91874.
9188A destructors return type is always same as that of main()
91893.0
9190S.NO. Questions Choices Answers
9191469
9192#include <iostream.h>
9193using namespace std;
9194int main()
9195{
9196int x=20;
9197if(!(!x)&&x)
9198cout< else
9199{
9200x=10;
9201cout< return 0;
9202}
9203}
92041.
920520
92062.
920710
92083.
92091
92104.
92110
92121.0
9213470
9214Find the output of the following program?
9215#include <iostream.h>
9216using namespace std;
9217typedef int * IntPtr;
9218int main()
9219{
9220IntPtr A, B, C;
9221int D,E;
9222A = new int(3);
9223B = new int(6);
9224C = new int(9);
9225D = 10;
9226E = 20;
9227*A = *B;
9228B = &E;
9229D = (*B)++;
9230*C= (*A)++ * (*B)--;
9231E= *C++ - *B--;
9232cout<<*A<<*B<<*C< return 0;
9233}
92341.
923562010206
92362.
923772010107
92383.
923971020106
92404.
924110720107
92422.0
9243471
9244If a , b , c, are three nodes connected in sequence in a singly linked list, find the valid
9245statement that may help to change this list to a circular linked list?
92461.
9247a->next=c
92482.
9249b->next=c
92503.
9251a->next=c
92524.
9253c->next=b
92544.0
9255472 Round Robin scheduling is the strategy of temporarily suspending a running process
92561.
9257After the CPU time slice expires
92582.
9259to allow starving processes to run
92603.
9261when it requests IO
92624.
9263when OS wait
92641.0
9265473 With a single resource, deadlock occurs ___________
92661.
9267if there are more than two processes competing for that resource
92682.
9269if there are only two process completing for that resource
92703.
9271if there is a single process competing for that resource
92724.
9273it never occur in this case
92741.0
9275S.NO. Questions Choices Answers
9276474 ______ OS pays more attention on the meeting of the time limits.
92771.
9278Distributed
92792.
9280Network
92813.
9282Real time
92834.
9284Desktop
92853.0
9286475
9287Consider a software program that is artificially seeded with 100 faults. While testing this
9288program, 159 faults are detected, out of which 75 faults are from those artificially seeded
9289faults. Assuming that both are and seeded faults are of same nature and have same
9290distribution, the estimated number of undetected real fault is
92911.
9292121
92932.
9294175
92953.
9296432
92974.
9298428
92994.0
9300476
9301Given the code
9302String s1 = ? VIT? ;
9303String s2 = ? VIT ? ;
9304String s3 = new String ( s1);
9305Which of the following would equate to true?
93061.
9307s1 == s2
93082.
9309s1 = s2
93103.
9311s3 == s1
93124.
9313s3=s1
931413.0
9315477 Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?
93161.
93170
93182.
93193
93203.
93214
93224.
93235
93242.0
9325478 The following HTML ________ element contains meta data which is not displayed
9326inside the document
93271.
9328<form>
93292.
9330<title>
93313.
9332<table>
93334.
9334<frame>
93352.0
9336S.NO. Questions Choices Answers
9337479 To link your Web page to a style sheet, you must use the _____ tag
93381.
9339<STYLESHEET>
93402.
9341<STYLE>
93423.
9343<link>
93444.
9345<web>
93463.0
9347480 Which of these will create a shuffled list?
93481.
9349<ol>
93502.
9351<ul>
93523.
9353<dl>
93544.
9355Nested list
93561.0
9357481 Which one of the following is a cryptographic protocol used to secure HTTP
9358connection?
93591.
9360Stream Control Transmission Protocol (SCTP).
93612.
9362Transport Layer Security (TSL).
93633.
9364Explicit Congestion Notification (ECN).
93654.
9366Resource Reservation Protocol.
93672.0
9368482 Which of the following is example of in-place algorithm?
93691.
9370Bubble Sort
93712.
9372Merge Sort
93733.
9374Insertion Sort
93754.
93763.0
9377483 Which of these is asymptotically bigger?
93781.
937979n
93802+43n
93812.
938265n
93833+34n
93843.
93856*2
9386n
93874.
93885*2n
93892.0
9390484 ___ 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
9391485
9392____ messages are typically used for diagnostic or control purposes or generated in
9393response to errors in IP operations.
93941.ICMP 2.TCP 3.UDP 4.IP 1.0
9395486
9396_____ gives the number of bits that can be transmitted over a network in a fixed time
9397period.
93981.Latency 2.Jitter 3.Bandwidth 4.Delay 3.0
9399487
9400______ cryptography refers to encryption methods in which both the sender and
9401receiver share the same key.
94021.Symmetric 2.Asymmetric 3.Ceaser key 4.Asymmetric key 1.0
9403488
9404______ is responsible for the final encapsulation of higher-level messages into frames
9405that are sent over the network using the physical layer.
94061.Data link layer 2.Network layer 3.Application layer 4.Session layer 1.0
9407489
9408_______ appends to the address a slash character and the decimal number of leading
9409bits of the routing prefix.
94101.CIDR 2.TCP 3.UDP 4.IP 1.0
9411490 _______ is assigned to an organization by a global authority. 1.Subnet ID 2.Supernet ID 3.Host ID 4.Network ID 4.0
9412S.NO. Questions Choices Answers
9413491 _______ produces the relation that has attributes of R1 and R2
94141.
9415Cartesian product
94162.
9417Difference
94183.
9419Intersection
94204.
9421Product
94221.0
9423492
9424_______ should keep track of multiple file downloads requested by a particular FTP
9425application, or multiple telnet connections from a single terminal client, or web page
9426retrievals from a web server.
94271.Transport layer 2.Application layer 3.Presentation layer 4.Session
9428layer
94291.0
9430493
9431________ functions as a request-response protocol in the client-server computing
9432model.
94331.HTTP 2.IP 3.TCP 4.UDP 1.0
9434494 ________ is commonly used in wireless LAN.
94351.
9436time division multiplexing
94372.
9438orthogonal frequency division multiplexing
94393.
9440space division multiplexing
94414.
9442long division multiplexing
94432.0
9444495
9445________ scheduler selects the jobs from the pool of jobs and loads into the ready
9446queue.
94471.
9448Long term
94492.
9450Short trem
94513.
9452Medium term
94534.
9454None of these
94551.0
9456496 _________ does the job of allocating a process to the processor.
94571.
9458Long term scheduler
94592.
9460Short term scheduler (CPU Scheduler)
94613.
9462Medium term scheduler
94634.
9464Dispatcher
94654.0
9466497 _________ has a dedicated communication path between stations 1.Circuit switching 2.Frame relay 3.Packet switching 4.ATM 1.0
9467498
9468_________ is a high speed cache used to hold recently referenced page table entries
9469as a part of paged virtual memory
94701.
9471Translation Look-aside buffer
94722.
9473Inverse page table
94743.
9475Segmented page table
94764.
9477Hierarchical page table
94781.0
9479S.NO. Questions Choices Answers
9480499
9481_________ memory management scheme will produce least fragement
94821.
9483Best Fit
94842.
9485Worst Fit
94863.
9487First Fit
94884.
9489None of these
94901.0
9491500 _________ register keeps tracks of the instructions stored in program stored in memory.
94921.
9493AR (Address Register)
94942.
9495XR (Index Register)
94963.
9497PC (Program Counter)
94984.
9499AC (Accumulator)
95003.0
9501501 _________ states that it is Optimal Replacement algorithm
95021.
9503Replace the page that will not be used for a longest period of time
95042.
9505Replace the page that will not be used for a shortest period of time
95063.
9507Replace the page that will be used for a longest period of time
95084.
9509Replace the page that will be used for a shortest period of time
95101.0
9511502 __________ 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
9512503
9513___________ programs automatically connects to web sites and download documents
9514and save them to local drive
95151.
9516Web Servers
95172.
9518Web Downloading Utilities
95193.
9520Stay Connected
95214.
9522Offline Browsers
95232.0
9524504
9525___________ signal prevent the microprocessor from reading the same data more than
9526one
95271.pipelining 2.handshaking 3.controlling 4.signaling 2.0
9528505
9529____________ function in PHP returns a list of response headers sent (or ready to
9530send)
95311.header() 2.headers_list() 3.header_sent() 4.header_send() 2.0
9532506
9533______________ is an initial version of a software system that is used to demonstrate
9534concepts, try out design options, and find out more about the problem and its possible
9535solutions.
95361.
9537Prototype
95382.
9539Architectural Design
95403.
9541Subsystem
95424.
9543Module
95441.0
9545S.NO. Questions Choices Answers
9546507 ________________ is a basic unit of CPU utilization
95471.
9548Process
95492.
9550Thread
95513.
9552Process Control Block
95534.
9554Program Counter
95552.0
9556508 ______________is a logical unit of access to a DBMS
95571.Transaction
95582.Optimization
95593.Schema
95604.Data
95611.0
9562509
9563A graphical HTML browser resident at a network client machine Q accesses a static
9564HTML webpage from a HTTP server S. The static HTML page has exactly one static
9565embedded image which is also at S. Assuming no caching, which one of the following is
9566correct about the HTML webpage loading (including the embedded image)?
95671.
9568Q needs to send at least 2 HTTP requests to S, each necessarily in
9569a separate TCP connection to server S
95702.
9571Q needs to send at least 2 HTTP requests to S, but a single TCP
9572connection to server S is sufficient
95733.
9574A single HTTP request from Q to S is sufficient, and a single TCP
9575connection between Q and S is necessary for this
95764.
9577A single HTTP request from Q to S is sufficient, and this is possible
9578without any TCP connection between Q and S
95792.0
9580510 A 20-bit address bus can locate ________.
95811.
95821,048,576 locations
95832.
95842,097,152 locations
95853.
95864,194,304 locations
95874.
95888,388,608 locations
95891.0
9590511 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
9591512 A B-tree of order m has maximum of _____________ children
95921.
9593m
95942.
9595m + 1
95963.
9597m - 1
95984.
9599m/2
96001.0
9601513 A binary code that progresses such that only one bit changes between two successive
9602codes is:
96031.Gray code 2.excess-3 code 3.8421 code 4.nine's-complement
9604code
96051.0
9606514
9607A certain 5-bit self-complementary code is used to represent the 10 decimal digits 0
9608through 9.
9609Given that (246) in decimal is represented as 00010 00100 00110 in this code, what is
9610the representation for (375)?
96111.00110 00100 00010 2.00011 00111 00101 3.11001 11101 11011
96124.11101 11011 11001
96134.0
9614S.NO. Questions Choices Answers
9615515
9616A client process P needs to make a TCP connection to a server process S. Consider the
9617following situation: the server process S executes a socket(), a bind() and a listen()
9618system call in that order, following which it is preempted. Subsequently, the client
9619process P executes a socket() system call followed by connect() system call to connect
9620to the server process S. The server process has not executed any accept() system call. Which one of the following events could take place?
96211.
9622connect () system call returns successfully
96232.
9624connect () system call blocks
96253.
9626connect () system call returns an error
96274.
9628connect () system call results in a core dump
96293.0
9630516 A COCOMO model is
96311.
9632Common Cost Estimation Model.
96332.
9634Constructive Cost Estimation Model.
96353.
9636Complete Cost Estimation Model.
96374.
9638Comprehensive Cost Estimation Model.
96392.0
9640517 A collection of unused memory reserved for dynamic allocation is called 1.Heap 2.Static 3.array 4.stack dynamic 1.0
9641518 A comparison between ring and Johnson counters indicates that:
96421.A ring counter has fewer flip-flops but requires more decoding
9643circuitry 2.A ring counter has an inverted feedback path 3.A Johnson
9644counter has more flip-flops but less decoding circuitry 4.A Johnson
9645counter has an inverted feedback path
96464.0
9647519
9648A computer on a 10Mbps network is regulated by a token bucket. The token bucket is
9649filled at a rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the
9650maximum duration for which the computer can transmit at the full 10Mbps?
96511.
96521.6 seconds
96532.
96542 seconds
96553.
96565 seconds
96574.
96588 seconds
96592.0
9660520 A data structure where elements can be added or removed at either end but not in the
9661middle
96621.linked lists 2.Stacks 3.Queues 4.Deque 4.0
9663521 A fault simulation testing technique is
96641.
9665Mutation testing
96662.
9667Stress testing
96683.
9669Black box testing
96704.
9671White box testing
96721.0
9673522 A grammar that produces more than one parse tree for some sentence is called 1.Ambiguous 2.Irregular 3.Regular 4.Unambiguous 1.0
9674523 A group of bits that tell the computer to perform a specific operation is known as____.
96751.
9676Instruction code
96772.
9678Micro-operation
96793.
9680Accumulator
96814.
9682Register
96831.0
9684524 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
9685S.NO. Questions Choices Answers
9686525 A language is represented by a regular expression (a)*(a+ba). Which of the following
9687string does not belong to the regular set represented by the above expression.
96881.
9689aaa
96902.
9691aba
96923.
9693ababa
96944.
9695aa
96963.0
9697526 A layer-4 firewall cannot
96981.
9699block HTTP traffic during 9:00PM and 5:00AM
97002.
9701block all ICMP traffic
97023.
9703stop incoming traffic from a specific IP address but allow outgoing
9704traffic to same IP
97054.
9706block TCP traffic from a specific user on a specific IP address on
9707multi-user system during 9:00PM and 5:00AM
97081.0
9709527 A linear collection of data elements where the linear node is given by means of pointer
9710is called
97111.primitive list 2.node list 3.linked list 4.array 3.0
9712528 A major problem with priority scheduling is _________.
97131.
9714Definite blocking
97152.
9716Starvation
97173.
9718Low priority
97194.
9720None of these
97212.0
9722529 A minimum state DFA accepting the language L={w/w belongs {0,1}*} number of 0s and
97231s in w are divisible by 3 and 5, respectively} has
97241.
972515 states
97262.
97277 states
97283.
97299 states
97304.
97318 states
97321.0
9733530 A network that contains multiple hubs is most likely configured in which topology? 1.Mesh 2.Tree 3.Bus 4.Star 2.0
9734531 A NFA converted to DFA has more than one final state.
97351.
9736True
97372.
9738False
97393.
9740may be true
97414.
9742always true
97431.0
9744S.NO. Questions Choices Answers
9745532 A one to many relationship (of table A to Table B) is
97461.Where each record in table A can have one or more matching
9747records in table B
97482.Where each record in table B can have one or more matching
9749records in table A
97503.Where each record in Table B is required to have a match in table
9751A
97524.Where each record in table A is required to have a match in table
9753B
97541.0
9755533 A packet switching network
97561.can reduce the cost of using an information utility 2.allows
9757communications channel to be shared among more than one user
97583.can reduce the cost of using an information utility and allows
9759communications channel to be shared among more than one user
97604.is free
97613.0
9762534 A page fault occurs
97631.
9764when the page is not in the main memory
97652.
9766when the page is in the cache memory
97673.
9768when the process enters the blocked state
97694.
9770when the process is in the ready state
97711.0
9772535 A parameterized constructor with all arguments initialized is same as
97731.default constructor 2.parameterized constructor 3.overriding
97744.overloading
97751.0
9776536 A point-to-point protocol over ethernet is a network protocol for
97771.
9778encapsulating PPP frames inside ethernet frames
97792.
9780encapsulating ethernet frames inside PPP frames
97813.
9782for security of ethernet frames
97834.
9784for security of PPP frames
97851.0
9786537 A primary key, if combined with a foreign key creates
97871.Many to many relationships between the tables that connect them
97882.Network model between the tables connect them 3.one to many
9789relationship between the tables that connect them 4.Parent child
9790relationship between the tables that connect them
97914.0
9792538 A professional software engineer must:
97931.
9794be loyal to the organization
97952.
9796build trust from customers
97973.
9798socialize with customers
97994.
9800be loyal to the organization and build trust from customers
98014.0
9802539 A relation R is said to be in 2NF when it does not have
98031.
9804Partial Dependencies
98052.
9806Transitive Dependencies
98073.
9808Multivalued Attributes
98094.
9810Both Partial dependencies and Multivalued Dependencies
98111.0
9812S.NO. Questions Choices Answers
9813540 A relational database is
98141.the same as a flat file database
98152.one that consists of two or more tables that are joined in some way
98163.one that consists of two or more tables
98174.a database that is able to process tables, queries, forms, reports
9818and macros
98194.0
9820541 A ring counter is same as. 1.up-down counter 2.parallel adder 3.shift register 4.ALU 3.0
9821542 A set of possible data values is called
98221.
9823attribute
98242.
9825degree
98263.
9827domain
98284.
9829tuple
98304.0
9831543 A shift register can be used for.
98321.Digital delay line 2.Serial to parallel conversion 3.All of these
98334.Parallel to serial conversion
98344.0
9835544 A single channel is shared by multiple signals by
98361.
9837analog modulation
98382.
9839digital modulation
98403.
9841multiplexing
98424.
9843none of the mentioned
98443.0
9845545 A software package designed to store and manage databases
98461.Database
98472.DBMS
98483.Data Model
98494.Data
98502.0
9851546 A stack organized computer has
98521.Three-address Instruction
98532. Two-address Instruction
98543.One-address Instruction
98554. Zero-address Instruction
98564.0
9857547 A stakeholder is anyone who will purchase the completed software system under
9858development.
98591.
9860TRUE
98612.
9862False
98633. 4.
98642.0
9865548 A static data member is given a value
98661.Within the class definition 2.Outside the class definition 3.When
9867the program is exeuted 4.Never
98682.0
9869549 A synchronous sequential circuit is made up of.
98701.combinational gates 2.flip-flops 3.both flip-flops and latches 4.both
9871combinational gates and flip-flops
98724.0
9873550
9874A system uses FIFO policy for page replacement. It has 4 page frames with no pages
9875loaded to begin with. The system first accesses 100 distinct pages in some order and
9876accesses the same 100 pages but now in the reverse order how many page faults will
9877occur?
98781.
9879196
98802.
9881192
98823.
9883197
98844.
9885195
98861.0
9887S.NO. Questions Choices Answers
9888551 A table can have only one
98891.
9890Secondary key
98912.
9892Alternate key
98933.
9894Unique key
98954.
9896Primary key
98974.0
9898552 A tree sturctured file directory system
98991.
9900allows easy storage and retrieval of file names
99012.
9902is not essential when we have millions of files
99033.
9904is a much debated unnecessary feature
99054.
9906none of these
99071.0
9908553 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
9909554 A variable P is called pointer if
99101.P contains the address of an element in DATA 2.P contain the
9911DATA and the address of DATA 3.P can store only memory
9912addresses 4.P points to the address of first element in DATA
99131.0
9914555 A variable P is called pointer if
99151.P contains the address of an element in DATA 2.P contain the
9916DATA and the address of DATA 3.P can store only memory
9917addresses 4.P points to the address of first element in DATA
99181.0
9919556 A view is a
99201.
9921virtual table
99222.
9923subset of the table
99243.
9925base table
99264.
9927super table
99281.0
9929557 A Winchester disk is a
99301.
9931Disk stack
99322.
9933Removable disk
99343.
9935Flexible disk
99364.
9937None of these
99381.0
9939558
9940A complete binary min-heap is made by including each integer in [1;1023] exactly once.
9941The depth of a node in the heap is the length of the path from the root of the heap to that
9942node. Thus, the root is at depth 0. The maximum depth at which integer 9 can appear is
99431.
99447
99452.
99468
99473.
99489
99494.
995010
99512.0
9952559 Abstraction is
99531.Having public members 2.having private member and public
9954function 3.friend function 4.friend classes
99552.0
9956S.NO. Questions Choices Answers
9957560 Acceptance tests are normally conducted by the
99581.
9959developer
99602.
9961end users
99623.
9963test team
99644.
9965systems engineers
99662.0
9967561 Access time is faster for _________.
99681.
9969ROM
99702.
9971SRAM
99723.
9973DRAM
99744.
9975ERAM
99762.0
9977562 Additive rule
99781.cyan+ magenta+ Yellow= white 2.Red + Green + Blue = white
99793.cyan+ Green+ Yellow= white 4.cyan+ magenta+ Yellow= Black
99802.0
9981563 Address line for TRAP is?
99821.
99830023H
99842.
99850024H
99863.
99870033H
99884.
99890099H
99902.0
9991564 ALE stands for ___________
99921.
9993address latch enable
99942.
9995address level enable
99963.
9997address leak enable
99984.
9999address leak extension
100001.0
10001565 ALGORITHM HAS THE ________________ TO THE PROBLEM IN
10002_______________ NUMBER OF STEPS
100031.SOLUTION & FINITE 2.PROBLEM & INFINITE 3.SOLUTION &
10004INFINITE 4.PROBLEM & FINITE
100051.0
10006566 All devices/host connect to a central switch in _____ topology. 1.Star 2.Ring 3.Bus 4.Tree 1.0
10007567
10008All the modules of the system are integrated and tested as complete system in the case
10009of
100101.
10011Bottom up testing
100122.
10013Top-down testing
100143.
10015Sandwich testing
100164.
10017Big-Bang testing
100184.0
10019S.NO. Questions Choices Answers
10020568
10021Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the
10022method that is very easy to implement and the method that is the most powerful, in that order?
100231.
10024SLR , LALR
100252.
10026CLR , LALR
100273.
10028SLR , CLR
100294.
10030SLR
100313.0
10032569 An activity is said to be critical if slack time is equal to
100331.
100340
100352.
100361
100373.
100382
100394.
100403
100411.0
10042570 An advantage of the database approach is
100431.Elimination of the data redundancy 2.Ability to associate related
10044data 3.Increase security 4.All of the options
100454.0
10046571 An Entity from an ER diagram can be represented in the relational model by a
100471.relation
100482.domain
100493.functional dependency
100504.single attribute
100511.0
10052572 An ethernet frame that is less than the IEEE 802.3 minimum length of 64 octets is called
100531.short frame
100542.runt frame
100553.mini frame
100564.man frame
100572.0
10058573 An intermediate code form is
100591.Postfix notation 2.Syntax trees 3.Three address code 4.Postfix
10060notation, Syntax trees and Three address code
100614.0
10062574 An organization has a class B network and wishes to form subnets for 64 departments.
10063The subnet mask would be:
100641.
10065255.255.0.0
100662.
10067255.255.64.0
100683.
10069255.255.128.0
100704.
10071255.255.252.0
100724.0
10073575 Any code inside a loop that always computes the same value can be moved before the
10074loop. This is called
100751.Loop invariant computation 2.Interchange of statements
100763.inducation variable 4.Algebraic Transformation
100771.0
10078576 Application layer protocol defines
100791.
10080types of messages exchanged
100812.
10082message format, syntax and semantics
100833.
10084rules for when and how processes send and respond to messages
100854.
10086all of the mentioned
100874.0
10088S.NO. Questions Choices Answers
10089577 Architecture of the database can be viewed as
100901.
10091two levels
100922.
10093four levels
100943.
10095three levels
100964.
10097one level
100983.0
10099578 Arrange the operators according to their precedence: +, %, ->, =
101001.
10101->, %, +, =
101022.
10103=, +, %, ->
101043.
10105%, +, =, ->
101064.
10107%, ->, =, +
101081.0
10109579
10110Assume that a table R with 1000 records is to be joined with another table S with 10000
10111records. What is the maximum number of records that would result in if we join R with S
10112and the equi-join attribute of S is the primary key?
101131.
101141000
101152.
1011610000
101173.
101181,00,00,000
101194.
1012011000
101211.0
10122580
10123Assume that we have constructor functions for both base class and derived class. Now
10124consider the declaration in main( ). Base * P = New Derived; in what sequence will the
10125constructor be called ?
101261.Derived class constructor followed by Base class constructor.
101272.Base class constructor followed by derived class constructor.
101283.Base class constructor will not be called. 4.Derived class
10129constructor will not be called.
101302.0
10131581 Assume the base address of CS is 3000H and IP is 2000H. Calculate the memory
10132address.
101331.32000H 2.3000H 3.30000H 4.2000H 1.0
10134582 Assume you would like to sort an array in ascending order by value while preserving
10135key associations. Which of the following PHP sorting functions would you use?
101361.
10137ksort( )
101382.
10139asort( )
101403.
10141krsort( )
101424.
10143sort( )
101442.0
10145583 Assuming today is , 10 July 2000, what is returned by this statement: SELECT
10146to_char(Last_DAY(sysdate), 'DD-MON-RR') FROM dual;
101471.
1014817-JUL-00
101492.
1015010-JUL-00
101513.
1015231-DEC-00
101534.
1015431-JUL-00
101554.0
10156584 Binary search algorithm can not be applied to
101571.sorted linked list 2.sorted binary trees 3.sorted linear array
101584.pointer array
101594.0
10160S.NO. Questions Choices Answers
10161585 Bit stuffing refers to
101621.inserting a '0' in user data stream to differentiate it with a flag
101632.inserting a '0' in flag data stream to avoid ambiguity 3.appending a
10164nibble to the flag sequence 4.appending a nibble to the user data
10165stream
101661.0
10167586 Bits can be send over guided and unguided media as analog signal using
10168.........................
101691.
10170digital modulation
101712.
10172amplitude modulation
101733.
10174frequency modulation
101754.
10176phase modulation
101771.0
10178587 Boundary value analysis can only be used to do white-box testing.
101791.
10180true
101812.
10182false
101833. 4.
101842.0
10185588 By following modern system engineering practices simulation of reactive systems is no
10186longer necessary.
101871.
10188True
101892.
10190FALSE
101913. 4.
101922.0
10193589 Cache memory acts between_______.
101941.
10195CPU and RAM
101962.
10197RAM and ROM
101983.
10199CPU and Hard Disk
102004.
10201None of these
102021.0
10203590
10204Calculate the block number in free storage management of files system with number of
10205bits per word is 8, the bit vector is
102060001101010101, offset of first 1 bit is 3
102071.
1020859
102092.
1021051
102113.
1021245
102134.
1021453
102151.0
10216591 Calculate the EAT(Effective access time) if 5 micro second is associative look-up time
10217and 0.80 is the hit-ratio in paging hardware with TLB
102181.
102196.2 micro second
102202.
102217.8 micro second
102223.
102232.2 micro second
102244.
102253.2 micro second
102263.0
10227S.NO. Questions Choices Answers
10228592 Cartesian product in relational algebra is
102291.
10230a Unary operator
102312.
10232a Binary operator
102333.
10234a Ternary operator
102354.
10236not defined
102372.0
10238593 Change cannot be easily accommodated in most software systems, unless the system
10239was designed with change in mind.
102401.
10241True
102422.
10243False
102443. 4.
102451.0
10246594
10247Changes made to an information system to add the desired but not necessarily the
10248required features is called
102491.
10250Preventative maintenance.
102512.
10252Adaptive maintenance.
102533.
10254Corrective maintenance.
102554.
10256Perfective maintenance.
102574.0
10258595 Class ____ IP addresses are used for large organizations 1.A 2.B 3.D 4.C 1.0
10259596 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
10260597 Class testing of object-oriented software is equivalent to unit testing for traditional
10261software.
102621.
10263true
102642.
10265false
102663. 4.
102671.0
10268598 Classes and components that exhibit functional, layer, or communicational cohesion are
10269relatively easy to implement, test, and maintain.
102701.
10271true
102722.
10273false
102743. 4.
102751.0
10276599 Compile time polymorphism is 1.function overloading 2.template 3.function overriding 4.abstraction 1.0
10277600 Computers use addressing mode techniques for _____________________.
102781.
10279giving programming versatility to the user by providing facilities as
10280pointers to memory counters for loop control
102812.
10282to reduce no. of bits in the field of instruction
102833.
10284specifying rules for modifying or interpreting address field of the
10285instruction
102864.
10287All of these
102884.0
10289S.NO. Questions Choices Answers
10290601 Condition testing is a control structure testing technique where the criteria used to
10291design test cases is that they
102921.
10293rely on basis path testing
102942.
10295exercise the logical conditions in a program module
102963.
10297select test paths based on the locations and uses of variables
102984.
10299focus on testing the validity of loop constructs
103001.0
10301602
10302Consider 2 scenarios:
10303C1: For DFA (ϕ, Ʃ, δ, qo, F),
10304if F = Ï•, then L = Æ©*
10305C2: For NFA (ϕ, Ʃ, δ, qo, F),
10306if F = Ï•, then L = Æ©*
10307Where F = Final states set
10308Ï• = Total states set
10309Choose the correct option ?
103101.
10311Both are true
103122.
10313Both are False
103143.
10315C1 is true, C2 is false
103164.
10317C1 is false, C2 is true
103183.0
10319603 Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that
10320have exactly two children are _________.
103211.199 2.200 3.Any number between 0 and 199 4.Any number
10322between 100 and 200
103231.0
10324604 Consider a DFA over ∑ = {a, b} accepting all strings which have number of a’s divisible by 6 and number of
10325b’s divisible by 8. What is the minimum number of states that the DFA will have?
103261.
103278
103282.
1032914
103303.
1033115
103324.
1033348
103344.0
10335605
10336Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions
10337are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15,
1033820, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash
10339table, respectively, are
103401.3, 3, and 3 2.3, 0, and 1 3.4, 0, and 1 4.3, 0, and 2 2.0
10341606
10342Consider an instance of TCP’s Additive Increase Multiplicative Decrease(AIMD)
10343algorithm where the window size at the start of the slow start phase is 2 MSS and the
10344threshold at the start of the first transmission is 8 MSS. Assume that a time out occurs
10345during the fifth transmission. Find the congestion window size at the end of the tenth
10346transmission.
103471.
103488 MSS
103492.
1035014 MSS
103513.
103527 MSS
103534.
1035412 MSS
103553.0
10356607 Consider an undirected graph G with 100 nodes. The maximum number of edges to be
10357included is
103581.2451 2.4950 3.9900 4.4851 4.0
10359608 Consider S->SS|a what is the number of different derivation trees for aaaaa
103601.
103615
103622.
103633
103643.
1036514
103664.
103677
103683.0
10369S.NO. Questions Choices Answers
10370609
10371Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start
10372symbol and the following set of production rules
10373S --> aB S --> bA
10374B --> b A --> a
10375B --> bS A --> aS
10376B --> aBB A --> bAA
10377Which of the following strings is generated by the grammar?
103781.
10379aaaabb
103802.
10381aabbbb
103823.
10383aabbab
103844.
10385abbbba
103863.0
10387610
10388Consider the data of previous question. Suppose that the sliding window protocol is
10389used with the sender window size of 2^i where is the number of bits identified in the
10390previous question and acknowledgments are always piggybacked. After sending 2^i
10391frames, what is the minimum time the sender will have to wait before starting
10392transmission of the next frame? (Identify the closest choice ignoring the frame
10393processing time).
103941.
1039516ms
103962.
1039718ms
103983.
1039920ms
104004.
1040122ms
104023.0
10403611 Consider the DFAs M and N given above. The number of states in a minimal DFA that
10404accepts the language L(M) ∩ L(N) is __________.
104051.
104060
104072.
104081
104093.
104102
104114.
104123
104131.0
10414612 Consider the following array of elements. {89,19,50,17,12,15,2,5,7,11,6,9,100}.The
10415minimum number of interchanges needed to convert it into a max-heap is
104161.4 2.2 3.5 4.3 4.0
10417613
10418Consider the following C code segment.
104191.
10420The code contains loop invariant computation
104212.
10422There is scope of common sub-expression elimination in this code
104233.
10424There is scope of strength reduction in this code
104254.
10426There is scope of dead code elimination in this code
104274.0
10428614
10429Consider the following C declaration
10430struct {
10431short s [5]
10432union {
10433float y;
10434long z;
10435}u;
10436} t;
10437Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes and 8
10438bytes, respectively. The memory requirement for variable t, ignoring alignment
10439considerations, is
104401.10 bytes 2.18 bytes 3.22 bytes 4.14 bytes 2.0
10441S.NO. Questions Choices Answers
10442for (i = 0, i<n; i++)
10443{
10444for (j=0; j<n; j++)
10445{
10446if (i%2)
10447{
10448x += (4*j + 5*i);
10449y += (7 + 4*j);
10450}
10451}
10452}
10453Which one of the following is false?
10454615
10455Consider the following code segment.
10456x = u - t;
10457y = x * v;
10458x = y + w;
10459y = t - z;
10460y = x * y;
10461The minimum number of total variables required to convert the above code segment to static single
10462assignment form is
104631.
104646
104652.
104668
104673.
104689
104694.
1047010
104714.0
10472616
10473Consider the following code snippet
10474var a1 = [,,,];
10475var a2 = new Array(3);
104760 in a1
104770 in a2
10478Result of Javascript is:
104791.
10480true false
104812.
10482false true
104833.
10484true true
104854.
10486false true
104871.0
10488617 Consider the following code snippet: var a = [1,2,3,4,5]; a.slice(0,3); What is the possible
10489output for the above code snippet?
104901.Returns [1,2,3] 2.Returns [4,5] 3.Returns [1,2,3,4] 4.Returns
10491[1,2,3,4,5]
104921.0
10493618
10494Consider the following code snippet
10495function oddsums(n)
10496{
10497let total = 0, result=[];
10498for(let x = 1; x <= n; x++)
10499{
10500let odd = 2*x-1;
10501total += odd;
10502result.push(total);
10503}
10504return result;
10505}
10506What would be the output if
10507oddsums(5);
105081.
10509Returns [1,4,9,16,25]
105102.
10511Returns [1,2,3,4,5]
105123.
10513Returns [3,6,9,12,15]
105144.
10515Returns [1,3,5,7,9]
105161.0
10517619 Consider the following code: var a = []; a.unshift(1); a.unshift(22); a.shift(); a.unshift(3,
10518[4,5]); a.shift(); a.shift(); a.shift(); The final output for the shift() is
105191.1 2.[4,5] 3.[3,4,5] 4.Exception 1.0
10520620
10521Consider the following function
10522double f(double x)
10523{
10524if (abs(x*x - 3) < 0.01) return x;
10525else return f(x/2 + 1.5/x);
10526}
10527Give a value q (to 2 decimals) such that f(q) will return q:_____.
105281.1.723 2.1.732 3.0.732 4.1.733 2.0
10529621
10530Consider the following javascript code snippet :
10531var a = [];
10532a.unshift(1);
10533a.unshift(22);
10534a.shift();
10535a.unshift(3,[4,5]);
10536a.shift();
10537a.shift();
10538a.shift();
10539The final output for the shift() is
105401.
105411
105422.
10543[4,5]
105443.
10545[3,4,5]
105464.
10547Exception
105481.0
10549S.NO. Questions Choices Answers
10550622
10551Consider the following program in C language:
10552#include
10553main()
10554{
10555int i;
10556int *pi = &i;
10557scanf(?%d?,pi);
10558printf(?%d\n?, i+5);
10559}
10560Which one of the following statements is TRUE?
105611.
10562Compilation fails.
105632.
10564Execution results in a run-time error.
105653.
10566On execution, the value printed is 5 more than the address of
10567variable i
105684.
10569On execution, the value printed is 5 more than the integer value
10570entered
105714.0
10572623
10573Consider the following statements for priority queue :
10574S1 : It is a data structure in which the intrinsic ordering of the elements does determine
10575the result of its basic operations.
10576S2 : The elements of a priority queue may be complex structures that are ordered on
10577one or several fields. Which of the following is correct?
105781.Both S1 and S2 are incorrect 2.S1 is correct and S2 is incorrect
105793.Both S1 and S2 are correct 4.S1 is incorrect and S2 is correct 4.0
10580624
10581Consider the following two sets of LR(1) items of an LR(1) grammar.
10582X -> c.X, c/d
10583X -> .cX, c/d
10584X -> .d, c/d
10585X -> c.X, $
10586X -> .cX, $
10587X -> .d, $
10588Which of the following statements related to merging of the two sets in the corresponding LALR parser
10589is/are FALSE?
105901. Cannot be merged since look aheads are different.
105912. Can be merged but will result in S-R conflict.
105923. Can be merged but will result in R-R conflict.
105934. Cannot be merged since goto on c will lead to two different sets.
105941.
105951 only
105962.
105972 only
105983.
105991 and 4 only
106004.
106011,2,3,4
106024.0
10603625
10604Consider the following two sets of LR(1) items of an LR(1) grammar.
10605X -> c.X, c/d
10606X -> .cX, c/d
10607X -> .d, c/d
10608X -> c.X, $
10609X -> .cX, $
10610X -> .d, $
10611Which of the following statements related to merging of the two sets in the corresponding LALR parser
10612is/are FALSE?
106131. Cannot be merged since look aheads are different.
106142. Can be merged but will result in S-R conflict.
106153. Can be merged but will result in R-R conflict.
106164. Cannot be merged since goto on c will lead to two different sets.
106171.
106181 only
106192.
106202 only
106213.
106223 and 4 only
106234.
106241,2,3,4
106254.0
10626626
10627Consider the grammar shown below.
10628S → C C
10629C → c C | d
10630The grammar is
106311.
10632LL(1)
106332.
10634SLR(1) but not LL(1)
106353.
10636LALR(1) but not SLR(1)
106374.
10638LR(1) but not LALR(1)
106391.0
10640627
10641Consider the grammar with the following translation rules and E as the start symbol.
10642E → E1 # T { E.value = E1.value * T.value }
10643| T{ E.value = T.value }
10644T → T1 & F { T.value = T1.value + F.value }
10645| F{ T.value = F.value }
10646F → num { F.value = num.value }
10647Compute E.value for the root of the parse tree for the expression: 2 # 3 & 5 # 6 & 4.
106481.
10649200
106502.
10651180
106523.
10653160
106544.
1065540
106563.0
10657S.NO. Questions Choices Answers
10658628
10659Consider the grammar
10660S → (S) | a
10661Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3
10662respectively. The following relationship holds good
106631.
10664n1<n2<n3
106652.
10666n1=n3<n2
106673.
10668n1=n2=n3
106694.
10670n1>n2>n3
106712.0
10672629
10673Consider the intermediate code given below:
106741. i = 1
106752. j = 1
106763. t1 = 5 * i
106774. t2 = t1 + j
106785. t3 = 4 * t2
106796. t4 = t3
106807. a[t4] = –1
106818. j = j + 1
106829. if j <= 5 goto(3)
1068310. i = i + 1
1068411. if i < 5 goto(2)
10685The number of nodes and edges in the control-flow-graph constructed for the above code, respectively, are
106861.
106875 and 7
106882.
106896 and 7
106903.
106915 and 2
106924.
106937 and 8
106942.0
10695630 Consider the join of a relation R with relation S. If R has m tuples and S has n tuples,
10696then the maximum size of join is:
106971.
10698mn
106992.
10700m+n
107013.
10702(m+n)/2
107034.
107042(m+n)
107051.0
10706631 Consider the join of a relation R with relation S. If R has m tuples and S has n
10707tuples, then the maximum size of join is:
107081.
10709mn
107102.
10711m + n
107123.
10713(m + n) / 2
107144.
107152(m + n)
107161.0
10717632
10718Consider the regular language L = (111 + 11111)*. The minimum number of states in any DFA accepting
10719this languages is:
107201.
107213
107222.
107235
107243.
107258
107264.
107279
107284.0
10729S.NO. Questions Choices Answers
10730633
10731Consider the relation R1(employee_name, project_name, dependent_name). If
10732{{employee_name -->-> project_name}, {employee_name -->-> dependent_name}},
10733what is the highest normal form it satisfies?
107341.
107352NF
107362.
107373NF
107383.
10739BCNF
107404.
107414NF
107421.0
10743634
10744Consider the translation scheme shown below
10745S → T R
10746R → + T {print ('+');} R | ε
10747T → num {print (num.val);}
10748Here num is a token that represents an integer and num.val represents the corresponding integer value. For
10749an input string '9 + 5 + 2', this translation scheme will print
107501.
107519 + 5 + 2
107522.
107539 5 + 2 +
107543.
107559 5 2 + +
107564.
10757+ + 9 5 2
107582.0
10759635
10760Consider two strings A ='qpqrr' and B = 'pqprqrp'. Let x be the length of the LCS
10761between A and B and let y be the number of such longest common subsequences
10762between A and B. Then x + 10y =
107631.42 2.34 3.32 4.30 2.0
10764636 Count function in SQL returns the number of
107651.
10766values
107672.
10768distinct values
107693.
10770groups
107714.
10772columns
107731.0
10774637 CPU Scheduling is the basis of _________ operating system
107751.
10776Batch
107772.
10778Real Time
107793.
10780Multi-programming
107814.
10782network
107832.0
10784638 create table student_$( id number(4), namee varchar2(10)); reponse would be
107851.
10786Error
107872.
10788Table created
107893.
10790Table created with error
107914.
10792Table created with data
107932.0
10794639 Creating additional function similar to template function is called
107951.implicit specialization 2.explicit specialization 3.abstraction
107964.template overriding
107974.0
10798640 Cross-compiler is a compiler
107991.which is written in a language that is same as the source
10800language. 2.that runs on one computer but produces object code for
10801different type of computer. 3.that generates object code for its host
10802machine. 4.which is written in a language that is different from the
10803source language.
108042.0
10805S.NO. Questions Choices Answers
10806641 Cryptanalysis is used
108071.
10808to find some insecurity in a cryptographic scheme
108092.
10810to increase the speed
108113.
10812to encrypt the data
108134.
10814none of the mentioned
108151.0
10816642 Cryptographic hash function takes an arbitrary block of data and returns
108171.
10818fixed size bit string
108192.
10820variable size bit string
108213.
10822both (a) and (b)
108234.
10824None
108251.0
10826643
10827Currently there is no single standard file type that can be used to play audio using the
10828audio element consistently on all browsers. Which is the solution that the audio element
10829provides to resolve this conflict?
108301.Use JavaScript to determine the web browser in use 2.Use Adobe
10831Flash to play the audio 3.Include multiple audio file formats in the src
10832attribute 4.No Solution
10833644 Data flow testing is a control structure testing technique where the criteria used to
10834design test cases is that they
108351.
10836rely on basis path testing
108372.
10838exercise the logical conditions in a program module
108393.
10840select test paths based on the locations and uses of variables
108414.
10842focus on testing the validity of loop constructs
108431.0
10844645 Data independence means
108451.
10846data is defined separately and not included in programs.
108472.
10848programs are not dependent on the physical attributes of data
108493.
10850programs are not dependent on the logical attributes of data
108514.
10852programs are not dependent on both physical and logical attributes
10853of data
108544.0
10855646 Data Members of the base class that are marked private:
108561.does exist in memory when the object of the derived class is
10857created 2.exist in memory when the object of the derived class is
10858created
10859the derived class 3.are visible in the derived class 4.are directly
10860accessible in the derived class
108612.0
10862647 Data Members of the base class that are marked private:
108631.does exist in memory when the object of the derived class is
10864created 2.exist in memory when the object of the derived class is
10865created
10866the derived class 3.are visible in the derived class 4.are directly
10867accessible in the derived class
108682.0
10869648 Data Store Symbol in DFD represents a
108701.
10871Physical file
108722.
10873Data Structure
108743.
10875Logical file
108764.
10877ALL
108782.0
10879S.NO. Questions Choices Answers
10880649
10881DB, DW and DD directives are used to place data in particular location or to
10882simplyallocate space without preassigning anything to space. The DW and DD
10883directories areused to generate
108841.f ull address of labels 2.offsets of full address of labels and
10885variables 3.full address of variables 4.offsets
108862.0
10887650 DCL stands for
108881.
10889Data Control Language
108902.
10891Data Console Language
108923.
10893Data Console Level
108944.
10895Data Control Level
108961.0
10897651 Demand paged memory allocation
108981.
10899allows the virtual address space to be independent of the physical
10900memory
109012.
10902allows the virtual address space to be a multiple of the physical
10903memory size
109043.
10905allows deadlock to be detected in paging schemes
109064.
10907is present only in Windows NT
109081.0
10909652
10910Desirable properties of relational database design include
109111.All of the options
109122.minimizing update anomalies
109133.minimizing redundancy
109144.minimizing insertion/deletion anomalies
109151.0
10916653 Direction flag is used with
109171.
10918String instructions
109192.
10920Stack instructions.
109213.
10922Arithmetic instructions
109234.
10924Branch instructions
109251.0
10926654 Divide and conquire mechanism is used in
109271.selection sort 2.merge sort 3.quick and merge sorts 4.indexed
10928sequential search
109293.0
10930655 DML is provided for
109311.
10932Description of logical structure of database.
109332.
10934Addition of new structures in the database system.
109353.
10936Manipulation & processing of database.
109374.
10938Definition of physical structure of database system.
109393.0
10940S.NO. Questions Choices Answers
10941656 Drop SQL clause
109421.
10943Drops only the values from the table
109442.
10945drops structure of the table along with values
109463.
10947None of the options
109484.
10949changes the structure of the table
109502.0
10951657 Duality principle is used when SE is 1.square 2.symmetric 3.asymmetricd 4.translated 2.0
10952658 During business process engineering, three different architectures are examined
109531.
10954applications, data, technology infrastructure
109552.
10956communications, organization, financial infrastructure
109573.
10958network, database, reporting structure
109594.
10960systems, requirements, data structure
109611.0
10962659 Each counter of IC 8254 can work in --------------differnt modes of operation
109631.6
109642.5
109653.4
109664.3
109671.0
10968660 ElGamal encryption system is
109691.
10970symmetric key encryption algorithm
109712.
10972asymmetric key encryption algorithm
109733.
10974not an encryption algorithm
109754.
10976none of the mentioned
109772.0
10978661 EPROM is generally erased by using
109791.
10980Ultraviolet rays
109812.
10982infrared rays
109833.
1098412 V electrical pulse
109854.
1098624 V electrical pulse
109871.0
10988662 Ethernet in metropolitan area network (MAN) can be used as
109891.
10990pure ethernet
109912.
10992ethernet over SDH
109933.
10994ethernet over MPLS
109954.
10996combination of all of the above mentioned
109974.0
10998S.NO. Questions Choices Answers
10999663 Everyone on the software team should be involved in the planning activity so that we
11000can
110011.
11002reduce the granularity of the plan
110032.
11004analyze requirements in depth
110053.
11006get all team members to "sign up" to the plan
110074.
11008begin design
110093.0
11010664 Evolutionary software process models
110111.
11012Are not iterative in nature
110132.
11014Can easily accommodate product requirements changes
110153.
11016Generally produce throwaway systems
110174.
11018Are not specific to applications
110192.0
11020665 External Fragmentation of the file system
110211. can be avoided by paging
110222. occurs only if the file system is used improperly
110233. can be removed by compaction
110244.can be avoided by Segmentation
110254.0
11026666
11027Find the output
11028#include < stdio.h >
11029int main()
11030{
11031int tally=0;
11032for(;;)
11033{
11034if(tally==10)
11035break;
11036printf("%d ",++tally);
11037}
11038return 0;
11039}
110401.
110410 1 2 3 4 5 6 7 8 9 10
110422.
110430 1 2 3 ... infinte times
110443.
110451 2 3 4 5 6 7 8 9 10
110464.
110471 2 3 4 5 6 7 8 9
110483.0
11049667
11050Find the output
11051#include <stdio.h>
11052int main()
11053{
11054int x=65;
11055const unsigned char c=(int)x;
11056printf("%c\n",c);
11057return 0;
11058}
110591.
11060Error
110612.
1106265
110633.
11064A
110654.
11066NULL
110673.0
11068668
11069Find the output
11070#include <stdio.h>
11071struct sample
11072{
11073int a=0;
11074char b='A';
11075float c=10.5;
11076};
11077int main()
11078{
11079struct sample s;
11080printf("%d,%c,%f",s.a,s.b,s.c);
11081return 0;
11082}
110831.
11084Error
110852.0,A,10.5 3.
110860,A,10.500000
110874.
11088No Error, No Output
110891.0
11090S.NO. Questions Choices Answers
110916
110926
110939
11094Fin
11095d
11096t
11097h
11098e
11099o
11100u
11101t
11102p
11103u
11104t: #include <stdio.h
11105> int main() { int a=100; printf("%d\n"+1,a
11106); printf("Value is = %
11107d
11108"
11109+
111103,a
11111); return 0; }
111121. E
11113r
11114r
11115o
11116r
111172. 10
111181, Valu
11119e is
11120=
111211
111220
111233
111243. due is
11125=
111261
111270
111280
111294. 10
111300
111311
111320
111330
111343.0
111356
111367
111370
11138Fin
11139d
11140t
11141h
11142e
11143o
11144u
11145t
11146p
11147u
11148t: #include <stdio.h
11149> int main() { int a=23; ;;printf("%d",a); ;return 0; }
111501. 232. Er
11151r
11152o
11153r
111543. ;2
111553; 4. ;23
111561.0
111576
111587
111591
11160Fin
11161d
11162t
11163h
11164e
11165o
11166u
11167t
11168p
11169u
11170t: #include <stdio.h
11171>
11172v
11173oid
11174m
11175ain
11176(
11177)
11178{
11179c
11180o
11181n
11182s
11183t
11184c
11185h
11186a
11187r
11188v
11189a
11190r
11191='A'; ++var; printf("%c",var); }
111921. B2. A3. E
11193R
11194R
11195O
11196R
111974. 66
111983.0
111996
112007
112012
11202FIN
11203D
11204T
11205H
11206E
11207O
11208U
11209T
11210P
11211U
11212T: #include <stdio.h> void main() { int x=10; x+=(x++)+(++x)+x; printf("%d",x); }
112131. 442. 453. 464. 47
112142.0
112156
112167
112173
11218Fin
11219d
11220t
11221h
11222e
11223o
11224u
11225t
11226p
11227u
11228t: #include <stdio.h
11229>
11230v
11231oid
11232m
11233ain
11234(
11235)
11236{ in
11237t
11238x
11239=
11240(
112412
112420 || 4
112430
11244)
11245&
11246&
11247(
112481
112490
11250); printf("x= %d",x); }
112511. x=
112526
112530
112542. x=
112557
112560
112573. x=
112580
112594. x=
112601
112614.0
11262S.N
11263O. Q
11264u
11265e
11266s
11267tio
11268n
11269s
11270C
11271h
11272oic
11273e
11274s
11275A
11276n
11277s
11278w
11279e
11280r
11281s
11282674
11283Find the output:
11284#include <stdio.h>
11285void main()
11286{
11287char var=10;
11288printf("var is = %d",++var++);
11289}
112901.
11291ERROR: can not modify var.
112922.
11293ERROR: L-Value required
112943.
1129512
112964.
11297ERROR: Expression syntax
112982.0
11299675 First derivative approximation says that values of constant intensities must be 1.1 2.0 3.positive 4.negative 2.0
11300676 Flip-flop excitation tables shows that
113011.For the given PS and NS what will be the inputs 2.For the given
11302PS and NS what will be the outputs 3.For the given PS and NS what
11303will be the type of flip-flops 4.For the given PS and NS what will be
11304the values of NS and PS respectively
113054.0
11306677 Following can be used to implement a SOP function without changing it into minterms 1.MUX 2.PLA 3.ROM 4.DeMUX 4.0
11307678 For a well understood data processing application it is best to use
113081.
11309The waterfall model
113102.
11311prototyping model
113123.
11313the evolutionary model
113144.
11315the spiral model
113161.0
11317679 For purposes of behavior modeling a state is any
113181.
11319consumer or producer of data.
113202.
11321data object hierarchy.
113223.
11323observable mode of behavior.
113244.
11325well defined process.
113263.0
11327680 Foreign Key is
113281.
11329A field in a table that matches a key field in another table
113302.
11331A field in a table that contains data that is also contained elsewhere
11332in another table
113333.
11334A key that consists of more than one field
113354.
11336A field in a table that has the same name as a key field in another
11337table
113381.0
11339681
11340Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The
11341propagation time is 25ms. Frames are to be transmitted into this link to maximally pack
11342them in transit (within the link). What is the minimum number of bits, i will be required to
11343represent the sequence numbers distinctly? Assume that no time gap needs to be given
11344between transmission of two frames.
113451.
11346i=2
113472.
11348i=3
113493.
11350i=4
113514.
11352i=5
113534.0
11354S.NO. Questions Choices Answers
11355682 FTP server listens for connection on port number
113561.
1135720
113582.
1135921
113603.
1136122
113624.
1136323
113642.0
11365683 Functions that combines to produce Æ’(x,y)
113661.illumination and frequency 2.intensity and reflectance
113673.illumination and radiance 4.illumination and reflectance
113684.0
11369684 Generally Dynamic RAM is used as main memory in a computer system as it______.
113701.
11371Consumes less power
113722.
11373has higher speed
113743.
11375has lower cell density
113764.
11377needs refreshing circuitry
113782.0
11379685 Generic process models are:
113801.
11381waterfall, componet-based, iterative
113822.
11383waterfall, structural, component-based
113843.
11385sequential, waterfall, iterative
113864.
11387component-based, object-oriented, iterative
113884.0
11389686 Given a comma-separated list of values in a string, which function from the given list can
11390create an array of each individual value with a single call in PHP?
113911.
11392strstr( )
113932.
11394extract
113953.
11396explode( )
113974.
11398strtok( )
113993.0
11400687 Given a hash table T with 25 slots that stores 2000 elements, the load factor a for T
11401is_____
114021.80 2.0.0125 3.8000 4.1.25 2.0
11403688 Given a variable $email containing the string user@example.com, which of the
11404following PHP statements would extract the string example.com?
114051.
11406substr($email, strpos($email, "@"));
114072.
11408strstr($email, "@");
114093.
11410strchr($email, "@");
114114.
11412substr($email, strpos($email, "@")+1);
114134.0
11414689
11415Given an array that represents elements of arithmetic progression in order. It is also
11416given that one element is missing in the progression, the worst case time complexity to
11417find the missing element efficiently is:
114181.theta(n) 2.theta(nLogn) 3.theta(Logn) 4.theta(1) 3.0
11419S.NO. Questions Choices Answers
11420690 Given CF=0, BX=00111011 01110101 ROR BX,1. The result is
114211.CF=1 BX=10011101 10111010 2.CF=1 BX=10100111 01101110
114223.CF=0 BX=01001110 11011101 4.CF=0 BX=01010011 10110111
114231.0
11424691 Given the basic ER and relational models, which of the following is INCORRECT?
114251.
11426An attributes of an entity can have more that one value
114272.
11428An attribute of an entity can be composite
114293.
11430In a row of a relational table, an attribute can have more than one
11431value
114324.
11433In a row of a relational table, an attribute can have exactly one value
11434or a NULL value
114353.0
11436692 Given the Code segment CS = 1000H and the offset BX=0050H. Calculated physical
11437address is ----------
114381.10000H 2.10050H 3.11050H 4.11000H 2.0
11439693 Given the Extra segment ES = 52B9H and the offset BX=D470H. Calculated physical
11440address is ----------
114411.60000H 2.70000H 3.11000H 4.11050H 4.0
11442694 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
11443695 Given the functional dependencies, {AB -> CDE and A -> E}, for relation schema R =
11444(A,B,C,D,E) we can infer the following:
114451.
11446A is a key for R
114472.
11448BE is a key for R
114493.
11450AB is a key for R
114514.
11452B is a key for R
114533.0
11454696
11455Given the language L = {ab, aa, baa}, which of the following strings are in L*?
114561) abaabaaabaa
114572) aaaabaaaa
114583) baaaaabaaaab
114594) baaaaabaa
114601.
114611, 2 and 3
114622.
114631, 2 and 4
114643.
114651, 3 and 4
114664.
114672, 3 and 4
114682.0
11469697 Grant and revoke are ....... statements.
114701.
11471DDL
114722.
11473TCL
114743.
11475DCL
114764.
11477DML
114783.0
11479698 High speed ethernet works on
114801.
11481coaxial cable
114822.
11483twisted pair cable
114843.
11485optical fiber
114864.
11487none of the mentioned
114883.0
11489S.NO. Questions Choices Answers
11490699 How can we count the number of elements in an array?
114911.Using sizeof() 2.count() 3.Writing a user defined function and using
11492array_search() 4.using sizeof() and count()
114934.0
11494700 How can you specify default text in an input field?
114951.Using JavaScript 2.Using the 'text' attribute 3.Using the
11496'placeholder' element 4.Using the 'placeholder' attribute
114974.0
11498701 How do I create PHP arrays in a HTML ?
114991.< input name= MyArray[]/> 2.< input ="MyArray[]" /> 3.< input
11500name="MyArray[]" /> 4.< input MyArray[] />
115013.0
11502702 How do substring() and substr() differ?
115031.One is not a method of the String object. 2.substr() takes three
11504arguments, substring() only two. 3.Only one accepts a desired string
11505length as an argument. 4.Besides the spelling, nothing.
115063.0
11507703 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
11508704 How do we prevent margins, borders and padding from overlapping?
115091.Setting zero paddings and margins 2.By displaying our list as
11510block elements 3.Using table cells 4.By displaying our list as inline
11511elements
115122.0
11513705 How do we submit form data without a Sumbit button?
115141.Using header() function 2.Using Javascript 3.Using
11515fdf_set_submit_form_action() fucntion 4.using header() and
11516javascript
115174.0
11518706 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
11519707 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
11520708 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
11521709 How many bits are required to store one BCD digit? 1.1 2.2 3.3 4.4 4.0
11522710 How many diagrams are here in Unified Modelling Language?
115231.
11524six
115252.
11526seven
115273.
11528eight
115294.
11530nine
115313.0
11532711 How many different states does a 3-bit asynchronous counter have? 1.2 2.4 3.8 4.16 4.0
11533712 How many flip-flops are required to construct a mod10 counter? 1.10 2.8 3.5 4.4 3.0
11534713 How many flip-flops are required to make a MOD-32 binary counter? 1.3 2.4 3.5 4.6 4.0
11535714 How many instances of an abstract class can be created? 1.13 2.5 3.1 4.0 2.0
11536715
11537How many minimum states are required in a DFA to find whether a given binary string has odd number of
115380's or not, there can be any number of 1's.
115391.
115401
115412.
115422
115433.
115443
115454.
115464
115473.0
11548716 How many nodes in a tree have no ancestors. 1.2 2.n 3.1 4.0 3.0
11549717 How many operating modes are available in 8253A. 1.1 2.2 3.6 4.3 1.0
11550718 How many transistors does the 8086 have 1.29,000 2.10,000 3.129,000 4.110,000 1.0
11551719 How to create a Date object in JavaScript?
115521.dateObjectName = new Date([parameters])
115532.dateObjectName.new Date([parameters]) 3.dateObjectName :=
11554new Date([parameters]) 4.dateObjectName Date([parameters])
115551.0
11556720 How to create a memory without a name during the execution of the program? 1.malloc() 2.Queue 3.stack 4.list 2.0
11557721 How will you free the allocated memory ?
115581.remove(var-name); 2.free(var-name); 3.delete(var-name);
115594.dalloc(var-name);
115601.0
11561722 How will you handle the overflow condition of a linked queue through code(note:
11562new_node is a newly created node in a memory)
115631.if(rear==size) 2.if(new_node==0) 3.if(front==size)
115644.if(new_node==null)
115652.0
11566723 HTTP client requests by establishing a __________ connection to a particular port on
11567the server.
115681.
11569user datagram protocol
115702.
11571transmission control protocol
115723.
11573broader gateway protocol
115744.
11575RIP
115761.0
11577S.NO. Questions Choices Answers
11578724 IC 8237 has ------------------many pins
115791.
1158040
115812.
1158228
115833.
1158424
115854.
1158620
115874.0
11588725 IC 8257 has --------------------many channels for data transfer
115891.
115901
115912.
115922
115933.
115943
115954.
115964
115974.0
11598726 Identify different segments in a program
115991.only code segment 2.data and code segment 3.only data segment
116004.data, code, stack and extra segments
116012.0
11602727
11603Identify the accurate control word for operate counter 0, Read/Write LSB only, Mode 2,
11604BCD countdown.
116051.00010111B 2.0001X111B 3.00010101B 4.00110111B 2.0
11606728 Identify the addressing mode for the instruction MOV AH,47H
116071.Immediate addressing mode 2.Direct addressing mode 3.Based
11608addressing mode 4.Indirect addressing mode
116093.0
11610729
11611Identify the proper data direction and modes of operation of the 8255 ports if the control
11612word written into it is 9BH.
116131.Port A as output 2.Port C lower as output 3.Port C upper as input
116144.Port B as output
116153.0
11616730
11617If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the
11618maximum number of hosts per subnet?
116191.
116201024
116212.
116221023
116233.
116242046
116254.
116262047
116274.0
11628731
11629If a class C is derived from class B, which is derived from class A, all through public
11630inheritance, then a class C member function can access
116311.protected and public data only in C and B 2.protected and public
11632data only in C. 3.private data in A and B. 4.protected data in A and B.
116332.0
11634732 If a constructor function is defined in private section of a class, then
116351.The object cannot be created 2.Only its member functions and
11636friends may declare objects of the class 3.Only its friends may
11637declare objects of the class 4.Only its member functions may declare
11638objects of the class
116394.0
11640733 If AL= 7FH and instruction ADD AL,1 is given, specify the contents of the six status flag
116411.CF=0,PF=0,AF=1,ZF=0,SF=1,OF=1
11642. 2.CF=0,PF=1,AF=0,ZF=0,SF=1,OF=1
116433.CF=0,PF=1,AF=1,ZF=O,SF=1,OF=1
116444.CF=0,PF=0,AF=1,ZF=O,SF=1,OF=0
116452.0
11646734
11647If AL=C0H, Determine the content of the register AL after SAL AL,1 instruction is
11648executed.
116491.E0H 2.80H 3.0CH 4.0EH 4.0
11650735
11651If all page frames are initially empty, and a process is allocated 3 page frames in real
11652memory and references its pages in the order 1 2 3 2 4 5 2 3 2 4 1 and the page
11653replacement is FIFO, the total number of page faults caused by the process will be
11654__________
116551.
1165610
116572.
116587
116593.
116608
116614.
116629
116632.0
11664S.NO. Questions Choices Answers
11665736
11666If all tasks must be executed in the same time-span, what type of cohesion is being
11667exhibited?
116681.
11669Functional Cohesion
116702.
11671Temporal Cohesion
116723.
11673Functional Cohesion
116744.
11675Sequential Cohesion
116764.0
11677737
11678If class A is friend of class B and if class B is friend of class C, which of the following is
11679true?
116801.Class C is friend of Class A 2.Class A is friend of Class C 3.Class
11681A and Class C don’t have any friend relationship 4.Class A and
11682Class C are mutual friends
116832.0
11684738
11685If every requirement stated in the Software Requirement Specification (SRS) has only
11686one interpretation, SRS is said to be
116871.
11688correct.
116892.
11690unambiguous.
116913.
11692consistent.
116934.
11694verifiable.
116951.0
11696739
11697If inspected in a browser, what will be the total width of the div in the following code
11698snippet? #container { width: 600px; border: 2px solid #CCCCCC; padding: 30px 20px;
11699margin: 20px 10px 40px 10px;}
117001.664px 2.660px 3.644px 4.600px 4.0
11701740 If L and L' are recursively enumerable, then L is
117021.
11703regular
117042.
11705context-free
117063.
11707context-sensitive
117084.
11709recursive
117102.0
11711741
11712If M1 machine recognizing L with n states, then M2 recognizing L* constructed Using
11713Thompson construction will have ------------- states.
117141.
11715n
117162.
11717n+1
117183.
11719n+2
117204.
11721n-1
117222.0
11723742 If p and q are assigned the values 2 and 3 respectively then the statement P = q++
117241.assigns a value 5 to p 2.assigns a value 3 to p 3.gives an error
11725message 4.assigns a value 4 to p
117262.0
11727743
11728If para1 is the DOM object for a paragraph, what is the correct syntax to change the text
11729within the paragraph?
117301."New Text"? 2.para1.value="New Text";
117313.para1.firstChild.nodeValue= "New Text";
117324.para1.nodeValue="New Text";
117333.0
11734744 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 2.0
11735S.NO. Questions Choices Answers
11736745
11737If the disk size is 2^30 bytes and block size is 2^12 bytes then find how many such
11738blocks are there?
117391.
117402^42
117412.
117422^18
117433.
117442^360
117454.
117462^30
11747746
11748If the PIC outputs the type number of C8H, the CPU will retrive the vector stored in the
11749address --------------
117501.00320H - 00323H 2.00324H - 00327H 3.00223H - 00226H
117514.00140H - 00143H
117524.0
11753747
11754If the size of logical address space is 2 to the power of m, and a page size is 2 to the
11755power of n addressing units, then the high order _____ bits of a logical address
11756designate the page number, and the ____ low order bits designate the page offset.
117571.
11758m,n
117592.
11760n,m
117613.
11762m-n,m
117634.
11764m-n,n
117653.0
11766748
11767If there are n relations how many number of join conditions has to be applied to retrieve
11768the data from all the n relations?
117691.
11770N+1
117712.
11772N
117733.
11774N-1
117754.
11776A Number in the range 0 toN.
117771.0
11778749 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 3.0
11779750 If X->Y and X->Z then
117801.
11781Y->Z
117822.
11783Z->Y
117843.
11785X->YZ
117864.
11787Doesn't hold
117883.0
11789751 If x--> y then y --> x. This statement is
117901.
11791True
117922.
11793False
117943.
11795Can't Say
117964.
11797Doesn't hold
117982.0
11799S.NO. Questions Choices Answers
11800752 IF Y is a subset of X then
118011.
11802X --> Y
118032.
11804Y -->X
118053.
11806Y -->--> X
118074.
11808X is a sub set of Y
118091.0
11810753
11811If you have an empty queue and you insert characters ‘r’, ‘a’, ‘t’ (in this order only), what
11812is the order of the characters when you dequeue all the elements?
118131.‘r’, ‘a’, ‘t’ 2.‘t’, ‘a’, ‘r’ 3.‘r’, ‘t’, ‘a’ 4.‘t’, ‘r’, ‘a’ 1.0
11814754 IMUL source is a signed _________
118151.
11816multiplication
118172.
11818addition
118193.
11820subtraction
118214.
11822division
118232.0
11824755 In 8086 microprocessor one of the following statements is not true
118251.Coprocessor is interfaced in MAX mode 2.Coprocessor is
11826interfaced in MIN mode 3.I/O can be interfaced in MAX / MIN mode
118274.Supports pipelining
118283.0
11829756 In 8086 microprocessor the following has the highest priority among all type interrupts 1.TYPE 255 2.DIV 0 3.NMI 4.OVER FLOW 1.0
11830757 In 8086, Example for Non maskable interrupts are ________.
118311.
11832TRAP
118332.
11834RST6.5
118353.
11836INTR
118374.
11838RST6.6
118392.0
11840758 In a bottom-up evaluation of a syntax directed definition, inherited attributes can
118411.
11842always be evaluated
118432.
11844be evaluated only if the definition is L-attributed
118453.
11846be evaluated only if the definition has synthesized attributes
118474.
11848never be evaluated
118492.0
11850759 In a circular linked list
118511.components are arranged hierarchically 2.there is no beginning
11852and no end 3.forward and backward traversal within the list is
11853permitted 4.components are arranged from top to bottom
118543.0
11855760 In a compiler, keywords of a language are recognized during
118561.
11857parsing of the program
118582.
11859the code generation
118603.
11861the lexical analysis of the program
118624.
11863dataflow analysis
118642.0
11865S.NO. Questions Choices Answers
11866761
11867In a conceptual model for a university, which of the following could most appropriately
11868be represented via a recursive relationship?
118691.
11870Student credit hours
118712.
11872Course prerequisites
118733.
11874Parking sticker assignments
118754.
11876Final exam schedules
118774.0
11878762
11879In a connected graph, a bridge is an edge whose removal disconnects a graph. Which
11880one of the following statements is True?
118811.A tree has no bridge 2.A bridge cannot be part of a simple cycle
118823.Every edge of a clique with size>=3 is a bridge (A clique is any
11883complete subgraph of a graph) 4.A graph with bridges cannot have a
11884cycle
118851.0
11886763 In a DMA write operation the data is transferred
118871.
11888from I/O to memory
118892.
11890from memory to I/O
118913.
11892from memory to I/O
118934.
11894from I/O to I/O
118953.0
11896764
11897In a microprocessor, the service routine for a certain interrupt starts from a fixed location
11898of memory which cannot be externally set, but the interrupt can be delayed or rejected.
11899Such aninterrupt is
119001.maskable and non-vectored 2.non-maskable and vectored
119013.maskable and vectored 4.non-maskable and non-vectored
119022.0
11903765
11904In a network of LANs connected by bridges, packets are sent from one LAN to another
11905through intermediate bridges. Since more than one path may exist between two LANs,
11906packets may have to be routed through multiple bridges. Why is the spanning tree
11907algorithm used for bridge-routing?
119081.
11909For shortest path routing between LANs
119102.
11911For avoiding loops in the routing paths
119123.
11913For fault tolerance
119144.
11915For minimizing collisions
119162.0
11917766
11918In a syntax directed translation schema ,if value of an attribute of a node is function of
11919the values of the attributes of its children , then it is called
119201.Inherited attributes 2.Synthesized attributes 3.Canonical atrributes
119214.Derived atrributes
119223.0
11923767
11924In a token ring network the transmission speed is 10^7 bps and the propagation speed
11925is 200 metres/micro second. The 1-bit delay in this network is equivalent to:
119261.
11927500 metres of cable.
119282.
11929200 metres of cable.
119303.
1193120 metres of cable.
119324.
1193350 metres of cable.
119341.0
11935768 In a virtual memory environment
119361.
11937segmentation and page tables are stored in the cache and do not
11938add any substantial overhead
119392.
11940slow down the computer system considerable
119413.
11942segmentation and page tables are stored in the RAM
119434.
11944only page table is stored in cache
119452.0
11946S.NO. Questions Choices Answers
11947769
11948In access lists and groups which one of the following is correct for the 'RWX' notation of
11949the order 'group, owner, public'
119501.
11951111110001
119522.
11953110111001
119543.
11955001111110
119564.
11957001110111
119584.0
11959770 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 3.0
11960771 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 1.0
11961772 In an E-R diagram an entity set is represent by a
119621.
11963rectangle
119642.
11965ellipse
119663.
11967diamond box
119684.
11969circle
119703.0
11971773 In an E-R diagram attributes are represented by
119721.
11973rectangle
119742.
11975square
119763.
11977ellipse
119784.
11979triangle
119801.0
11981774 In any undirected graph, the sum of the degrees of all nodes is:
119821.is twice number of edges 2.is always ODD 3.need not be even
119834.must be even
119841.0
11985775
11986In Assembly language programming, minimum number of operands required for an
11987instruction is/are
119881.
11989Zero
119902.
11991One
119923.
11993Two
119944.
11995Three
119963.0
11997776 In asynchronous serial communication the physical layer provides
119981.start and stop signalling
119992.flow control
120003.both (a) and (b)
120014.none of the mentioned
120021.0
12003777
12004In binary heap, whenever the root is removed then the
12005rightmost element of last level is replaced by the root. Why?
120061.To make sure that it is still complete binary tree 2.It is the easiest
12007possible way 3.Because left and right subtree might be missing
120084.maximum value is contained by the root node
120091.0
12010778 In case of entity integrity, the primary key may be
120111.not Null
120122.Null
120133.a foreign key
120144.any value
120153.0
12016S.NO. Questions Choices Answers
12017779
12018In collaborative requirements gathering, the facilitator
120191.
12020cannot be a member of the software team
120212.
12022cannot be a customer
120233.
12024controls and facilitates the process
120254.
12026must be an outsider
120272.0
12028780 In context of OSI or TCP/IP computer network models, which of the following is false?
120291.Major difference between LAN and WAN is that the later uses
12030switching element 2.Network layer is connection oriented 3.A
12031repeater is used just to forward bits from one network to another one
120324.A gateway is used to connect incompatible networks
120331.0
12034781 In cryptography, the order of the letters in a message is rearranged by
120351.
12036transpositional ciphers
120372.
12038substitution ciphers
120393.
12040both (a) and (b)
120414.
12042none of the mentioned
120431.0
12044782 In Ethernet when Manchester encoding is used, the bit rate is:
120451.
12046Half the baud rate.
120472.
12048Twice the baud rate.
120493.
12050Same as the baud rate.
120514.
12052Grows exponentially
120531.0
12054783 In FTP protocol, client contacts server using ____ as the transport protocol.
120551.
12056transmission control protocol
120572.
12058user datagram protocol
120593.
12060datagram congestion control protocol
120614.
12062stream control transmission protocol
120634.0
12064784 In general tree to binary tree conversion, the two links of the binary tree node points to
120651.two leaf nodes in the general tree 2.its right child and sibling in the
12066genral tree 3.its left child and sibling in the general tree 4.its left and
12067right child in the general tree
120681.0
12069785 In HTTP pipelining
120701.
12071multiple HTTP requests are sent on a single TCP connection
12072without waiting for the corresponding responses
120732.
12074multiple HTTP requests can not be sent on a single TCP connection
120753.
12076multiple HTTP requests are sent in a queue on a single TCP
12077connection
120784.
12079none of the mentioned
120803.0
12081S.NO. Questions Choices Answers
12082786
12083In interactive environments such as time-sharing systems, the primary requirement is to
12084provide reasonably good response time and in general, to share system resources
12085equitably. In such situations, the scheduling algorithm that is most popularly applied is
12086________.
120871.
12088Shortest Remaining Time Next (SRTN) Scheduling
120892.
12090Priorities Based Preemptive Scheduling
120913.
12092Round Robin Scheduling
120934.
12094First Come First Serve
120951.0
12096787
12097In javascript, RegExp Object Method test() is used to search a string and returns
12098_________
120991.true or false 2.found value 3.index 4.Matched or not matched 4.0
12100788 In linear search algorithm the Worst case occurs when
121011.The item is somewhere in the middle of the array 2.The item is not
12102in the array at all 3.The item is the last element in the array 4.The
12103item is the last element in the array or is not there at all
121043.0
12105789 In max mode, control bus signal So,S1 and S2 are sent out in ____________ form
121061.
12107shared
121082.
12109decoded
121103.
12111encoded
121124.
12113unshared
121143.0
12115790
12116In mysql_fetch_array(),if two or more columns of the result have the same field names,
12117what action is taken?
121181.
12119the first column will take precedence
121202.
12121the column is skipped
121223.
12123the last column will take precedence
121244.
12125an error is thrown.
121263.0
12127791 In operator precedence parsing , precedence relations are defoned
121281.To delimit the handle 2.For all pair of terminals 3.For all pair of non
12129terminals 4.Only for a certain pair of terminals
121304.0
12131792
12132In PHP, array values are keyed by ______ values (called indexed arrays) or using
12133______ values (called associative arrays). Of course, these key methods can be
12134combined as well.
121351.
12136Float, string
121372.
12138Positive number, negative number
121393.
12140String, Boolean
121414.
12142Integer, String
121433.0
12144793
12145In PHP, which of the following function is used to insert content of one php file into
12146another php file before server executes it 1.include[] 2.#include() 3.include() 4.#include{} 2.0
12147794
12148In Priority Scheduling a priority number (integer) is associated with each process. The
12149CPU is allocated to the process with the highest priority (smallest integer = highest
12150priority). The problem of, Starvation ? low priority processes may never execute, is
12151resolved by __________.
121521.
12153Terminating the process.
121542.
12155Aging
121563.
12157Mutual Exclusion
121584.
12159Semaphore
121601.0
12161S.NO. Questions Choices Answers
12162795
12163In software engineering development, if there are no applicable theories, people often
12164use adhoc approach.
121651.
12166True
121672.
12168False
121693. 4.
121702.0
12171796 In software quality assurance work there is no difference between software verification
12172and software validation.
121731.
12174true
121752.
12176false
121773. 4.
121781.0
12179797 In the absolute the addressing mode
121801.
12181The operand is inside the instruction
121822.
12183The address of the operand is inside the instruction
121843.
12185The register containing the address of the operand is specified
12186inside the instruction
121874.
12188The location of the operand is implicit
121891.0
12190798 In the architecture of a database system external level is the
121911.view level
121922.conceptual level
121933.logical level
121944.physical level
121954.0
12196799
12197In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of
12198the following is True?
121991.In both AST and CFG, let node N2 be the successor of node N1. In
12200the input program, the code corresponding to N2 is present after the
12201code corresponding to N1 2.For any input program, neither AST nor
12202CFG will contain a cycle 3.Each node in AST and CFG corresponds
12203to at most one statement in the input program 4.The maximum
12204number of successors of a node in an AST and a CFG depends on
12205the input program
122064.0
12207800 In the context of object-oriented software engineering a component contains
122081.
12209attributes and operations
122102.
12211instances of each class
122123.
12213roles for each actor (device or user)
122144.
12215a set of collaborating classes
122164.0
12217801
12218In the following code snippet, what is the correct value of the left margin? margin: 10px
122195px 20px 15px;
122201.10px 2.5px 3.20px 4.15px 4.0
12221802
12222In the multi-programming environment, the main memory consisting of _________
12223number of process.
122241.
12225Greater than 100
122262.
12227only one
122283.
12229Greater than 50
122304.
12231More than one
122321.0
12233S.NO. Questions Choices Answers
12234803 In the network HTTP resources are located by
122351.
12236uniform resource identifier
122372.
12238unique resource locator
122393.
12240unique resource identifier
122414.
12242unique resource identifier
122434.0
12244804 In the operation read_item(x), what does x mean?
122451.
12246a file
122472.
12248a record
122493.
12250a disk block
122514.
12252all of the options
122531.0
12254805 In the running state
122551.
12256only the process which has control of the processor is found
122572.
12258all the processes waiting for I/O to be completed are found
122593.
12260all the processes waiting for the processor are found
122614.
12262everything in these options are found
122634.0
12264806
12265In the slow start phase of the TCP congestion control algorithm, the size of the
12266congestion window .....................
122671.
12268does not increase
122692.
12270increases linearly
122713.
12272increases quadratically
122734.
12274increases exponentially
122753.0
12276807 In the spiral model ‘risk analysis’ is performed
122771.
12278In the first loop
122792.
12280in the first and second loop
122813.
12282In every loop
122834.
12284before using spiral model
122851.0
12286S.NO. Questions Choices Answers
12287808 In tunnel mode IPsec protects the
122881.
12289entire IP packet
122902.
12291IP header
122923.
12293IP payload
122944.
12295none of the mentioned
122962.0
12297809
12298In what type of coupling, the complete data structure is passed from one module to
12299another?
123001.Control Coupling
123012.Stamp Coupling
123023.External Coupling
123034.Content Coupling
123042.0
12305810 In which addressing mode the operand is given explicitly in the instruction
123061.
12307Absolute
123082.
12309Immediate
123103.
12311Indirect
123124.
12313Direct
123144.0
12315811 In which case is it mandatory to provide a destructor in a class?
123161.Class for which copy constructor is defined 2.Class for which two
12317or more than two objects will be created 3.Almost in every class
123184.Class whose objects will be created dynamically
123192.0
12320812 In which mode FTP, the client initiates both the control and data connections.
123211.
12322active mode
123232.
12324passive mode
123253.
12326active mode and passive mode
123274.
12328none of the mentioned
123291.0
12330813
12331In which topology, if there are n devices in a network, each device has n-1 ports for
12332cables?
123331.Mesh 2.Star 3.Ring 4.Bus 1.0
12334814 In which year, 8086 was introduced?
123351.
123361978
123372.
123381979
123393.
123401977
123414.
123421981
123432.0
12344815 In win-win negotiation, the customer's needs are met even though the developer's need
12345may not be.
123461.
12347TRUE
123482.
12349FALSE
123503. 4.
123511.0
12352S.NO. Questions Choices Answers
12353816 In wireless distribution system
123541.
12355multiple access point are inter-connected with each other
123562.
12357there is no access point
123583.
12359only one access point exists
123604.
12361none of the mentioned
123621.0
12363817 In wireless network an extended service set is a set of
123641.
12365connected basic service sets
123662.
12367all stations
123683.
12369all access points
123704.
12371all nodes
123723.0
12373818 Information retrieval is faster from
123741.
12375Floppy disk
123762.
12377Magnetic tape
123783.
12379Hard disk
123804.
12381CD
123822.0
12383819 Insert into Emp(101, ‘XXX’) gives the following error
123841.
12385missing Select keyword
123862.
12387Missing Values
123883.
12389both of the errors
123904.
12391No of the errors
123924.0
12393820
12394int main()
12395{
12396int x,y;
12397x=(100,200);
12398y=100,200;
12399printf("x=%d,y=%d",x,y);
12400return 0;
12401}
12402Find the output
124031.
12404x=100,y=200
124052.
12406x=200,y=200
124073.
12408ERROR
124094.
12410x=200,y=100
124111.0
12412S.NO. Questions Choices Answers
12413821 Interaction Diagram is a combined term for
124141.
12415Sequence Diagram + Collaboration Diagram
124162.
12417Activity Diagram + State Chart Diagram
124183.
12419Deployment Diagram + Collaboration Diagram
124204.
12421None
124222.0
12423822 Internet Explorer uses ....................... property to create transparent images.
124241.-moz-opacity:x 2.filter: alpha(opacity=x) 3.filter: beta(opacity=x) 4.-
12425IE-opac:y
124261.0
12427823
12428Interpolation search is an improved variant of binary search.
12429It is necessary for this search algorithm to work that data collection should be
124301.in sorted form and equally distributed 2.in sorted form and but not
12431equally distributed 3.equally distributed but not sorted 4.unsorted
12432and not evenly distributed
124332.0
12434824 IPSec is designed to provide the security at the
124351.
12436transport layer
124372.
12438network layer
124393.
12440application layer
124414.
12442session layer
124434.0
12444825 It is difficult to design asynhronous sequential circuit because.
124451.External clock is to be provided 2.It is using Flip flops 3.It is more
12446complex 4.Generally they involve stability problem
124472.0
12448826 It is ok to have a single ideal approach to develop a software.
124491.
12450True
124512.
12452False
124533. 4.
124542.0
12455827 It would be ideal if all of computer science theories can be used in software engineering.
124561.
12457False
124582.
12459True
124603. 4.
124612.0
12462828 JavaScript RegExp Object has modifier 'i' to __________
124631.Perform case-sensitive matching 2.Perform case-insensitive
12464matching 3.Perform both case-sensitive & case-insensitive matching
124654.None of the these
124663.0
12467829 Join is equal to
124681.
12469Cartesian Product
124702.
12471Combination of Union and Cartesian product
124723.
12473Combination of selection and Cartesian product
124744.
12475Combination of intersection and Cartesian product
124762.0
12477830 K-map follow following code for marking adjacent variables
124781.84-2-1
124792.Gray Code 3.2421 4.8421
124801.0
12481S.NO. Questions Choices Answers
12482831
12483Let G be a weighted connected undirected graph with distinct positive edge weights.If
12484every edge weight is increased by the same value, then which of the following
12485statements is/are TRUE ? P: Minimum spanning tree of G does not change. Q: Shortest
12486path between any pair of vertices does not change
124871.
12488P Only
124892.
12490Q Only
124913.
12492Neither P nor Q
124934.
12494Both P and Q
124952.0
12496832
12497Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1
12498and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is
12499many-to-many. R1 and R2 do not have any attributes of their own. What is the minimum
12500number of tables required to represent this situation in the relational model?
125011.
125022
125032.
125043
125053.
125064
125074.
125085
125094.0
12510833
12511Let G be a graph with n vertices and m edges, What is the tightest upper bound on the
12512running time on Depth First Search of G? Assume that the graph is represented using
12513adjacency matrix
125141.O(n) 2.O(m+n) 3.O(mn) 4.O(n^2) 1.0
12515834
12516Let G be the CFG, l be the number of left most derivations, r be the number of right most
12517derivations and P be the number of parse trees. Assume l , r and P are computed for a
12518particular string. For a given CFG ‘G’ and given string ‘w’, what is the relation between l
12519, P , r ?
125201.
12521l=P=r
125222.
12523l<=P>=r
125243.
12525l>=P<=r
125264.
12527l<=P<=r
125283.0
12529835
12530Let G(x) be the generator polynomial used for CRC checking. What is the condition that
12531should be satisfied by G(x) to detect odd number of bits in error?
125321.
12533G(x) contains more than two terms
125342.
12535G(x) does not divide 1+x^k, for any k not exceeding the frame length
125363.
125371+x is a factor of G(x)
125384.
12539G(x) has an odd number of terms.
125402.0
12541836
12542Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language.
12543Which one of the following is TRUE?
12544L1' --> Complement of L1
12545L2' --> Complement of L2
125461.
12547L1' is recursive and L2' is recursively enumerable
125482.
12549L1' is recursive and L2' is not recursively enumerable
125503.
12551L1' and L2' are recursively enumerable
125524.
12553L1' is recursively enumerable and L2' is recursive
125542.0
12555837
12556Let P be a QuickSort Program to sort numbers in ascending order using the first element
12557as pivot, Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4,
125585} and {4, 1, 5, 3, 2} respectively,Which one of the following holds?
125591.t1=5 2.t1>t2 3.t1 4.t1=t2 3.0
12560838
12561Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n,
12562which of the following is TRUE ?
125631.T(n) = O(n) 2.T(n) = O(log2n) 3.T(n) = O( n) 4.T(n) = O(n2) 1.0
12564S.NO. Questions Choices Answers
12565839
12566Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum
12567number of states in a non-deterministic finite automaton that accepts L?
125681.
12569n+1
125702.
12571n
125723.
12573n-1
125744.
125752n+1
125764.0
12577840 Local and loop optimization in turn provide motivation for
125781.Peephole optimization 2.DFA and Constant folding 3.Basic Code
12579Analysis 4.Data flow analysis
12580.
125813.0
12582841 LOCK prefix is used most often
125831.during normal execution. 2.during DMA accesses 3.during
12584interrupt servicing. 4.during memory accesses
125851.0
12586842 Logical addressing is used in _____ layer 1.Network 2.Transport 3.Physical 4.Session 1.0
12587843 Loop testing is a control structure testing technique where the criteria used to design test
12588cases is that they
125891.
12590rely basis path testing
125912.
12592exercise the logical conditions in a program module
125933.
12594select test paths based on the locations and uses of variables
125954.
12596focus on testing the validity of loop constructs
125972.0
12598844 Magnetic tapes are good storage media for
125991.
12600backup and low volume data
126012.
12602backup and high volume data
126033.
12604storing original but low volume data
126054.
12606storing original but high volume data
126071.0
12608845 Manager salary details are hidden from the employee. This is
126091.Conceptual level data hiding 2.Physical level data hiding
126103.External level data hiding 4.None of mentioned
126111.0
12612846 Many of the tasks from the generic task sets for analysis modeling and design can be
12613conducted in parallel with one another.
126141.
12615TRUE
126162.
12617FALSE
126183. 4.
126192.0
12620847
12621Match all items in Group 1 with correct options from those given in Group 2.
12622Group 1 Group 2
12623P. Regular expression 1. Syntax analysis
12624Q. Pushdown automata 2. Code generation
12625R. Dataflow analysis 3. Lexical analysis
12626S. Register allocation 4. Code optimization
126271.
12628P-4. Q-1, R-2, S-3
126292.
12630P-3, Q-1, R-4, S-2
126313.
12632P-3, Q-4, R-1, S-2
126334.
12634P-2, Q-1, R-4, S-3
126352.0
12636S.NO. Questions Choices Answers
12637848
12638Match the following:
12639List-I List-II
12640A. Lexical analysis 1. Graph coloring
12641B. Parsing 2. DFA minimization
12642C. Register allocation 3. Post-order traversal
12643D. Expression evaluation 4. Production tree
12644Codes:
12645A B C D
12646(a) 2 3 1 4
12647(b) 2 1 4 3
12648(c) 2 4 1 3
12649(d) 2 3 4 1
126501.
12651a
126522.
12653b
126543.
12655c
126564.
12657d
126584.0
12659849 Memory elements in clocked sequential circuits are called. 1.latches 2.gates 3.signals 4.flipflop 4.0
12660850 Memory unit accessed by content is called______
126611.
12662Read only memory
126632.
12664Programmable Memory
126653.
12666Virtual Memory
126674.
12668Associative Memory
126694.0
12670851 Mode of communication in which transmission takes place in both directions, but only in
12671one direction at a time is called________________
126721.simplex 2.four wired 3.full duplex 4.half-duplex 1.0
12673852 Modifying the software to match changes in the ever changing environment is called
126741.
12675adaptive maintenance
126762.
12677corrective maintenance
126783.
12679perfective maintenance
126804.
12681preventive maintenance
126824.0
12683853 Most software continues to be custom built because
126841.
12685Component reuse is common in the software world.
126862.
12687Reusable components are too expensive to use.
126883.
12689Software is easier to build without using someone else's
12690components
126914.
12692Off-the-shelf software components are unavailable in many
12693application domains.
126941.0
12695854 Multiple choice examination answer sheets can be evaluated automatically by
126961.
12697Optical Mark Reader
126982.
12699Optical Character Reader
127003.
12701Magnetic tape reader
127024.
12703Magnetic ink character reader.
127041.0
12705S.NO. Questions Choices Answers
12706855 Multiple object can be sent over a TCP connection between client and server in
127071.
12708persistent HTTP
127092.
12710nonpersistent HTTP
127113.
12712both persistent HTTP and nonpersistent HTTP
127134.
12714p-persistent HTTP
127151.0
12716856 Multiple variable declaration of same data type can be avoided by? 1.array 2.identifiers 3.functions 4.Pointer 2.0
12717857 Network layer firewall works as a
127181.
12719frame filter
127202.
12721packet filter
127223.
12723both (a) and (b)
127244.
12725none of the mentioned
127264.0
12727858 Network models are complicated by physical keys, but the relation model is
127281.Slower because it uses logical keys 2.Slower because it uses
12729physical keys 3.Faster because it uses physical keys 4.Faster
12730because it uses logical keys
127314.0
12732859 Network operating system that does not support symmetric multi-processing (SMP) is
127331.Banyan (VINES) 2.Microsoft NT advanced server 3.SCO Unix
127344.Novell Network 3.X
127354.0
12736860 NOR Gate does NOT follow
127371.DeMorgan’s Theorem 2.Associative Law 3.Commutative Law
127384.Distributive Law
127393.0
12740861 Normalisation of database is used to
127411.Minimise Errors 2.Improve Security 3.Eliminate redundancy
127424.Improve security
127434.0
12744862 Number of the times the instruction sequence below will loop before coming out of loop
12745is, MOV AL, 00h A1: INC AL JNZ A1
127461.255 2.01 3.00 4.256 4.0
12747863 ODBC stands for
127481.
12749Object Database Connectivity.
127502.
12751Oral Database Connectivity.
127523.
12753Oracle Database Connectivity.
127544.
12755Open Database Connectivity.
127561.0
12757864 One application of a digital multiplexer is to facilitate:
127581.data generation 2.serial-to-parallel conversion 3.data selector
127594.parity checking
127604.0
12761865 One of the fault base testing techniques is
127621.
12763unit testing.
127642.
12765beta testing.
127663.
12767Stress testing.
127684.
12769mutation testing.
127704.0
12771S.NO. Questions Choices Answers
12772866 One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the
12773following statements best explains the need for this field?
127741.
12775It can be used to priortize packets
127762.
12777It can be used to reduce delays
127783.
12779It can be used to optimize throughput
127804.
12781It can be used to prevent packet looping
127824.0
12783867 One of the main advantage of using src attribute is
127841.It becomes self-cached 2.It makes the HTML file modular 3.It
12785restricts manipulation in the HTML file 4.It simplifies the HTML files
127863.0
12787868 One of the purposes of using intermediate code in compilers is to
127881.
12789make parsing and semantic analysis simpler
127902.
12791improve error recovery and error reporting
127923.
12793increase the chances of reusing the machine-independent code
12794optimizer in other compilers.
127954.
12796improve the register allocation.
127973.0
12798869 overloading + operator requires return type as object because,
127991.reference parameter has to be returned 2.binary addition requires
12800that 3.all overloading functions require that 4.chain of additions
128013.0
12802870 Overloading involves writing two or more functions with ________
128031.different names and different argument lists 2.different names and
12804the same argument list 3.the same name and different argument lists
128054.the same name and the same argument list
128063.0
12807871 Overloading the function operator
128081.usually make use of a constructor that takes arguments. 2.allows
12809you to create objects that act syntactically like functions. 3.requires a
12810class with an overloaded operator. 4.requires a class with an
12811overloaded [ ] operator.
128122.0
12813872 Packets of the same session may be routed through different paths in:
128141.
12815TCP, but not UDP
128162.
12817TCP and UDP
128183.
12819UDP, but not TCP
128204.
12821Neither TCP nor UDP
128221.0
12823873 Paging _________
128241.
12825solves the memory fragmentation problem
128262.
12827allows modular programming
128283.
12829allows structured programming
128304.
12831avoids deadlock
128321.0
12833S.NO. Questions Choices Answers
12834874 Parallelism and concurrency is fully achieved in which of the following thread model
128351.
12836Many-to-one model
128372.
12838Many-to-many
128393.
12840one-to-one model
128414.
12842All the models
128431.0
12844875 Passing the request from one schema to another in DBMS architecture is called as
12845_______
128461.
12847Mapping
128482.
12849Communication
128503.
12851Relational
128524.
12853network
128543.0
12855876 Pee hole optimization
128561.Local optimization 2.Loop optimization 3.Constant folding 4.Data
12857flow analysis
128582.0
12859877 Performance testing is only important for real-time or embedded systems.
128601.
12861true
128622.
12863false
128643. 4.
128654.0
12866878 Physical layer provides
128671.
12868mechanical specifications of electrical connectors and cables
128692.
12870electrical specification of transmission line signal level
128713.
12872specification for IR over optical fiber
128734.
12874all of the mentioned
128754.0
12876879
12877Pick an incorrect declaration:
128781. int x[5];
128792. int x[5]={1,2,3,4,5};
128803. int x[5] = {1,2}
128814. int x[];
128821.
128831
128842.
128852
128863.
128873
128884.
128894
128903.0
12891880 Pick the odd one out. 1.[] 2.() 3.:: 4.~ 2.0
12892881 Polymorphism reduces the effort required to extend an object system by
128931.
12894Coupling objects together more tightly
128952.
12896enabling a number of different operations to share the same name.
128973.
12898making objects more dependent on one another
128994.
12900removing the barriers imposed by encapsulation.
129014.0
12902882 Popular application of flip-flop are. 1.Shift registers 2.Transfer register 3.Counters 4.All of these 2.0
12903883 Postorder Tree travsersal is recursive 1.LDR 2.LRD 3.DLR 4.DRL 2.0
12904S.NO. Questions Choices Answers
12905884
12906PREDICT THE OUTPUT:
12907#include <stdio.h>
12908void main()
12909{
12910int a=10,b=2,x=0;
12911x=a+b*a+10/2*a;
12912printf("value is =%d",x);
12913}
129141.Value is =1250 2.
12915Value is =80
129163.
12917Value is =125
129184.
12919Error
129203.0
12921885
12922Prim's algorithm is a method available for finding out the minimum cost of a spanning
12923tree.
12924Its time complexity is given by:
129251.O(1) 2.O(n*n) 3.O(n logn) 4.O(n) 2.0
12926886 Program flow graphs are identical to program flowcharts.
129271.
12928true
129292.
12930false
129313. 4.
129321.0
12933887 PSW is saved in stack when there is a _____.
129341.
12935interrupt recognized
129362.
12937execution of RST instruction
129383.
12939Execution of CALL instruction
129404.
12941All of these
129422.0
12943888 Quantitative methods for assessing the quality of proposed architectural designs are
12944readily available.
129451.
12946TRUE
129472.
12948FALSE
129493. 4.
129504.0
12951889 Query Tree uses
129521.
12953Relational Algebra
129542.
12955Tuple Relational Calculus
129563.
12957Domain Relational Calculus
129584.
12959All of the options
129601.0
12961890 Relations produced from an E - R model will always be in 1.3 NF 2.B CNF 3.2 NF 4.1 NF 2.0
12962891 Relocating bits used by relocating loader are specified by 1.Relocating loader itself 2.Linker 3.Assembler 4.Macro processor 4.0
12963892 Replace the page that has not be used for the longest period of time. This principle is
12964adopted by ____________
129651.
12966FIFO Page replacement algorithm
129672.
12968Optimal Page replacement algorithm
129693.
12970Round robin scheduling algorithm
129714.
12972LRU Page replacement algoorithm
129732.0
12974S.NO. Questions Choices Answers
12975893 Resource locking ________.
129761.
12977Allows multiple tasks to simultaneously use resource
129782.
12979Forces only one task to use any resource at any time
129803.
12981Can easily cause a dead lock condition
129824.
12983Is not used for disk drives
129844.0
12985894 Risk management is one of the most important jobs for a
129861.
12987Client
129882.
12989Investor
129903.
12991Production team
129924.
12993Project manager
129943.0
12995895
12996Routine is not loaded until it is called. All routines are kept on disk in a relocatable load
12997format. The main program is loaded into memory & is executed. This type of loading is
12998called _________
129991.Static loading 2.Dynamic loading 3.Dynamic linking 4.Overlays 3.0
13000896
13001Routine is not loaded until it is called. All routines are kept on disk in a relocatable load
13002format. The main program is loaded into memory & is executed. This type of loading is
13003called _________
130041.
13005Static loading
130062.
13007Dynamic loading
130083.
13009Dynamic linking
130104.
13011Overlays
130122.0
13013897 Run time polymorphism is achieved by ______
130141.friend function 2.virtual function 3.operator overloading 4.function
13015overloading
130162.0
13017898 S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of
130181.
13019All palindromes
130202.
13021All odd length palindromes.
130223.
13023Strings that begin and end with the same symbol
130244.
13025All even length palindromes
130261.0
13027899 Security testing attempts to verify that protection mechanisms built into a system protect
13028it from improper penetration
130291.
13030true
130312.
13032false
130333. 4.
130342.0
13035S.NO. Questions Choices Answers
13036900 SELECT department_id, AVG(salary) FROM employees WHERE AVG(salary) > 8000
13037GROUP BY department_id
130381.
13039Displays the department ID along with the average salary of
13040employees in each department if their average of salary is greater
13041than 8000.
130422.
13043Displays a error
130443.
13045Displays the department ID along with the average salary of
13046employees
130474.
13048None of the options
130492.0
13050901 SELECT department_id, COUNT(last_name) FROM employees;
130511.
13052Displays a error
130532.
13054Displays the department ID along with the number of employees in
13055each department.
130563.
13057None of the options
130584.
13059Dsiplays department ID and a null value
130601.0
13061902 SELECT employee_id, last_name FROM employees WHERE salary = (SELECT
13062MIN(salary) FROM employees GROUP BY department_id);
130631.
13064Displays the employee_id and name of employees who gets
13065minimum salary in their department
130662.
13067Error
130683.
13069None of the options
130704.
13071Displays the employee_id, name of employees and their salary
130721.0
13073903 SELECT last_name, SYSDATE-hire_date FROM employees;
130741.
13075Displays number of days an employee has worked in the company.
130762.
13077Displays number of months an employee has worked in the
13078company.
130793.
13080Error
130814.
13082None of the mentioned
130834.0
13084904 Select operation in SQL is equivalent to
130851.
13086the selection operation in relational algebra
130872.
13088the selection operation in relational algebra, except that select in
13089SQL retains duplicates
130903.
13091the projection operation in relational algebra
130924.
13093the projection operation in relational algebra, except that select in
13094SQL retains duplicates
130953.0
13096S.NO. Questions Choices Answers
13097905 Select the conflicting operation:
130981.
13099r1(x), w2( y )
131002.
13101r1(x), w1(x)
131023.
13103w1( y ), w2(x)
131044.
13105r1(x), w2(x)
131064.0
13107906 SELECT THE HIGHEST PRIORITY OPERATOR 1.&& 2., 3.?: 4.++ 3.0
13108907 Shift reduce parsers are
131091.Vertical parser 2.top down and bottom up parser 3.Bottom up
13110parser 4.Top down parser
131113.0
13112908 Simple network management protocol (SNMP) is implemented with a daughter board in
131131.the nodes 2.the server 3.the hubs 4.a separate PC that managers
13114the network
131152.0
13116909 Skewed binary trees can be efficiently represented using 1.Arrays 2.Linked lists 3.Stacks 4.Queues 2.0
13117910 Software coupling is a sign of poor architectural design and can always be avoided in
13118every system.
131191.
13120True
131212.
13122False
131233. 4.
131241.0
13125911 Software engineering includes system engineering.
131261.
13127True
131282.
13129False
131303. 4.
131314.0
13132912 Software engineers collaborate with customers to define which of the following?
131331.Customer visible usage scenarios
131342.
13135Important software features
131363.System inputs and outputs 4.
13137ALL
131382.0
13139913 Software is a product and can be manufactured using the same technologies used for
13140other engineering artifacts.
131411.
13142True
131432.
13144False
131453. 4.
131462.0
13147914 Software validation is achieved through a series of tests performed by the user once the
13148software is deployed in his or her work environment.
131491.
13150true
131512.
13152false
131533. 4.
131541.0
13155915 Some code optimizations are carried out on the intermediate code because
131561.
13157they enhance the portability of the compiler to other target
13158processors
131592.
13160program analysis is more accurate on intermediate code than on
13161machine code
131623.
13163the information from dataflow analysis cannot otherwise be used for
13164optimization
131654.
13166the information from the front end cannot otherwise be used for
13167optimization
131682.0
13169S.NO. Questions Choices Answers
13170916 Some code optimizations are carried out on the intermediate code because
131711.The information from data flow analysis cannot otherwise be used
13172for optimization 2.They enhance the portability of the complier to
13173other target processors 3.The information from the front end cannot
13174otherwise be used for optimization 4.Program analysis is name
13175accurate on intermediate code than on machine code
131762.0
13177917 Specify the 2 library functions to dynamically allocate memory?
131781.alloc() and memalloc() 2.malloc() and calloc() 3.memalloc() and
13179faralloc() 4.malloc() and memalloc()
131801.0
13181918 Spurious tuples are formed because of
131821.
13183join operation done on a non-key attribute
131842.
13185outer join operation
131863.
13187transitive dependencies
131884.
13189inner join
131904.0
13191919 SRS is also known as specification of
131921.
13193White box testing
131942.
13195Stress testing
131963.
13197Integrated testing
131984.
13199Black box testing
132003.0
13201920
13202Station A needs to send a message consisting of 9 packets to Station B using a sliding
13203window (window size 3) and go-back-n error control strategy. All packets are ready and
13204immediately available for transmission. If every 5th packet that A transmits gets lost (but
13205no acks from B ever get lost), then what is the number of packets that A will transmit for
13206sending the message to B?
132071.
1320812
132092.
1321014
132113.
1321216
132134.
1321418
132152.0
13216921
13217Station A uses 32 byte packets to transmit messages to Station B using a sliding
13218window protocol. The round trip delay between A and B is 80 milliseconds and the
13219bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal
13220window size that A should use?
132211.
1322220
132232.
1322440
132253.
13226160
132274.
13228320
132292.0
13230922 Stress testing examines the pressures placed on the user during system use in extreme
13231environments
132321.
13233true
132342.
13235false
132363. 4.
132374.0
13238923 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
13239924
13240Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n
13241elements. Assume that the insertion and deletion operation are carried out using REAR
13242and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The
13243conditions to detect queue full and queue empty are
132441.Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT
132452.Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT
132463.Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n ==
13247REAR 4.Full: (REAR+1) mod n == FRONT, empty: REAR ==
13248FRONT
132491.0
13250S.NO. Questions Choices Answers
13251925
13252Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n
13253elements. Assume that the insertion and deletion operation are carried out using REAR
13254and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The
13255conditions to detect queue full and queue empty are
132561.Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT
132572.Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n ==
13258REAR 3.Full: REAR == FRONT, empty: (REAR+1) mod n ==
13259FRONT 4.Full: (FRONT+1) mod n == REAR, empty: REAR ==
13260FRONT
132613.0
13262926
13263Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50
13264respectively. They are to be merged into a single sequence by merging together two
13265sequences at a time, The number of comparisons that will be needed in the worst case
13266by the optimal algorithm for doing this is ____
132671.672 2.740 3.358 4.354 4.0
13268927
13269Suppose P, Q, R, S, T are sorted sequences having lengths 20,24,30,35,50
13270respectively. They are to be merged into a single sequence by merging together two
13271sequences at a time. The number of comparisons that will be needed in the worst case
13272by the optimal algorithm for doing this is ____
132731.368 2.338 3.348 4.358 4.0
13274928 Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming
13275signal is 46.4 micro sec. The minimum frame size is:
132761.
1327794
132782.
13279416
132803.
13281464
132824.
13283512
132842.0
13285929
13286Suppose x is dead, that is, never subsequently used, at the point where the statement
13287x=y+z appears in a basic block. Then this statement may be safely removed without
13288changing the value of the basic block. This transformation is known as
13289__________________ .
132901.Common subexpression elimination 2.Dead code elimination
132913.Renaming temporary variables 4.Loop invarient
132922.0
13293930
13294Suppose you want to delete the name that occurs before 'Vellore' in an alphabetical
13295listing. Which of the following data structures shall be most efficient for this operation?
132961.Circular linked list 2.Dequeue 3.Linked list 4.Doubly linked list 2.0
13297931 Symantec Antivirus is a customized product.
132981.
13299True
133002.
13301False
133023. 4.
133034.0
13304932 Synchronous counters eliminate the delay problems encountered with asynchronous
13305(ripple) counters because the.
133061.input clock pulses are applied simultaneously to each stage
133072.input clock pulses are applied only to the first and last stages
133083.input clock pulses are applied only to the last stage 4.input clock
13309pulses are not used to activate any of the counter stages
133103.0
13311933 Syntax for creating a RegExp object: (i). var txt=new RegExp(pattern,modifiers); (ii). var
13312txt=/pattern/modifiers; Which of the above mentioned syntax is correct?
133131.(i) only 2.(ii) only 3.Both (i) and (ii) 4.None of these 1.0
13314934 Synthesized attribute can be easily simulated by a 1.LR grammar 2.Ambiguous grammar 3.LL grammar 4.LF grammer 1.0
13315935 System prototypes allow users
133161.
13317to see how well the system supports their work
133182.
13319to start working on the system
133203.
13321to put the system to production
133224.
13323to program the software
133241.0
13325936 System reactions to external events is depicted by
133261.
13327State diagram
133282.
13329Activity diagram
133303.
13331Usecase diagram
133324.
13333Sequence diagram
133342.0
13335S.NO. Questions Choices Answers
13336937 Teams using agile software practices never create models.
133371.
13338TRUE
133392.
13340FALSE
133413. 4.
133421.0
13343938 The focus of validation testing is to uncover places that a user will be able to observe
13344failure of the software to conform to its requirements.
133451.
13346true
133472.
13348false
133493. 4.
133501.0
13351939 The job of the requirements engineer is to categorize all stakeholder information in a
13352way that allows decision makers to choose an internally consistent set of requirements.
133531.
13354True
133552.
13356False
133573. 4.
133583.0
13359940 The --------is neither an input nor an output; it is an internal bit programmed via the
13360PC4(Port A) or PC2(Port B)bits
133611.IFB 2.INTR 3.INTE 4.NMI 2.0
13362941 The ........ instruction is used to specify the number of stop bits, data bits,parity bit, and
13363baud rate clock factor for the 8251 UART
133641.bit set/reset 2.Mode 3.Command 4.Code 2.0
13365942 The 1 MB byte of memory can be divided into ______ segment
133661.
133671 Kbyte
133682.
1336964 Kbyte
133703.
1337133 Kbyte
133724.
1337334 Kbyte
133741.0
13375943 The 16 bit flag of 8086 microprocessor is responsible to indicate ___________
133761.
13377the condition of result of ALU operation
133782.
13379the condition of memory
133803.
13381the result of addition
133824.
13383the result of subtraction
133843.0
13385944 The 16-bit data segment value is 1000H and the offset is 2000H. calculated physical
13386address is -----
133871.10000H 2.11000H 3.12000H 4.12500H 3.0
13388945 The 16-bit stack segment value is 5D27H and the offset is 2C30H. calculated physical
13389address is -----
133901.5FFEOH 2.5FAE0H 3.5FEA0H 4.12500H 3.0
13391946 The ___ bus controller device decodes the signals to produce the control bus signal
133921.
13393internal
133942.
13395data
133963.
13397external
133984.
13399address
134001.0
13401S.NO. Questions Choices Answers
13402947 The ____ translates internet domain and host names to IP address.
134031.
13404domain name system
134052.
13406routing information protocol
134073.
13408network time protocol
134094.
13410internet relay chat
134114.0
13412948 The _______ method of an Array object adds and/or removes elements from an array.
134131.
13414Slice
134152.
13416Reverse
134173.
13418Shift
134194.
13420Splice
134213.0
13422949 The ________ ensures that only one IC is active at a time to avoid a bus conflict
13423caused by two ICs writing different data to the same bus
134241.control bus 2.control instructions 3.address decoder 4.CPU 4.0
13425950 The ___________ property specifies the stack order of an element 1.d-index 2.s-index 3.x-index 4.z-index 3.0
13426951 The access method used for magnetic tape is_________
134271.
13428Direct
134292.
13430Random
134313.
13432Sequential
134334.
13434None of these
134354.0
13436952 The address resolution protocol (ARP) is used for:
134371.
13438Finding the IP address using DNS
134392.
13440Finding the IP address of the default gateway
134413.
13442Finding the IP address that corresponds to a MAC address
134434.
13444Finding the MAC address that corresponds to an IP address
134451.0
13446953 The advantage of DBMS over file systems is
134471.
13448redundancy
134492.
13450data dependence
134513.
13452multiple user
134534.
13454single user
134551.0
13456S.NO. Questions Choices Answers
13457954 The architecture components for product engineering are
134581.
13459data, hardware, software, people
134602.
13461data, documentation, hardware, software
134623.
13463data, hardware, software, procedures
134644.documentation, hardware, people, procedures
134651.0
13466955 The ASCII encoding of binary data is called
134671.
13468base 64 encoding
134692.
13470base 32 encoding
134713.
13472base 16 encoding
134734.
13474base 8 encoding
134753.0
13476956 The average time required to reach a storage location in memory and obtain its contents
13477is called the
134781.
13479seek time
134802.
13481turnaround time
134823.
13483access time
134844.
13485transfer time
134861.0
13487957 The best index for exact match query is
134881.
13489Bucket Hash
134902.
13491Quad tree
134923.
13493B Tree
134944.
13495B+ Tree
134961.0
13497958 The best reason for using Independent software test teams is that
134981.software developers do not need to do any testing
134992.a test team will test the software more thoroughly
135003.testers do not get involved with the project until testing begins
135014.arguments between developers and testers are reduced
135024.0
13503959 The best way to conduct a requirements validation review is to
135041.
13505examine the system model for errors
135062.
13507have the customer look over the requirements
135083.
13509send them to the design team and see if they have any concerns
135104.
13511use a checklist of questions to examine each requirement
135122.0
13513S.NO. Questions Choices Answers
13514960 The BIU contains FIFO register of size __________ bytes
135151.
135168
135172.
135186
135193.
135204
135214.
1352212
135231.0
13524961 The BIU prefetches the instruction from memory and store them in ________
135251.
13526queue
135272.
13528register
135293.
13530memory
135314.
13532stack
135334.0
13534962 The call to the parameterized constructor of base class in the derived class
135351.ppears inside the definition of the derived class constructor
135362.appears in the member initialization list of the derived class
13537constructor 3.appears inside the definition of the derived class
135384.appears at the statement where the derived class object is created
135394.0
13540963 The call to the parameterized constructor of base class in the derived class
135411.ppears inside the definition of the derived class constructor
135422.appears in the member initialization list of the derived class
13543constructor 3.appears inside the definition of the derived class
135444.appears at the statement where the derived class object is created
135453.0
13546964 The combination of Sixteen adjacent squares in four variable K-map represent the
13547function equal to
135481.Four literal 2.One literal 3.Unity 4.Zero 3.0
13549965 The counters of 8253 can be operated in -------- modes of operation. 1.4 2.3 3.6 4.5 3.0
13550966 The cyclomatic complexity metric provides the designer with information regarding the
13551number of
135521.
13553cycles in the program
135542.
13555errors in the program
135563.
13557independent logic paths in the program
135584.
13559statements in the program
135604.0
13561967 The data structure required for Breadth First Traversal on a graph is 1.tree 2.array 3.stack 4.queue 4.0
13562968 THE DATA TYPE IS ALL ABOUT
135631.NAME VALUE ADDRESS 2.BITS BYTES WORD 3.SIZE LIMITS
13564RESTRICTIONS 4.TYPE SIZE RANGE
135652.0
13566969 The decimal equivalent of hexadecimal number of ‘A580’ is 1.43286 2.42368 3.43288 4.48632 2.0
13567970 The default copy constructor performs 1.Deep Copy 2.Shallow Copy 3.Soft Copy 4.Hard Copy 4.0
13568971
13569The degree sequence of a simple graph is the sequence of the degrees of the nodes in
13570the graph in decreasing order. Which of the following sequences can not be the degree
13571sequence of any graph?I. 7, 6, 5, 4, 4, 3, 2, 1 II. 6, 6, 6, 6, 3, 3, 2, 2 III. 7, 6, 6, 4, 4, 3, 2, 2
13572IV. 8, 7, 7, 6, 4, 2, 1, 1
135731.IV only 2.III and IV 3.I and II 4.II and IV 4.0
13574972 The design process related to data structures and their representation is
135751.
13576Architectural design
135772.
13578Interface design
135793.
13580Component design
135814.
13582Database design
135833.0
13584S.NO. Questions Choices Answers
13585973 The difference between linear array and a record is
135861.A record form a hierarchical structure but a linear array does not
135872.All of above 3.An array is suitable for homogeneous data but the
13588data items in a record may have different data type 4.In a record,
13589there may not be a natural ordering in opposed to linear array
135903.0
13591974 The Document object is which part of the object? 1.Tree 2.System 3.Window 4.Screen 2.0
13592975 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 1.0
13593976 The entity relationship diagram
135941.
13595depicts relationships between data objects
135962.
13597depicts functions that transform the data flow
135983.
13599indicates how data are transformed by the system
136004.
13601indicates system reactions to external events
136022.0
13603977
13604The ESC instruction of 8086 may have two formats. In one of the formats, no memory
13605operand is used. Under this format, the number of external op-codes (for the
13606co- processor) which can be specified is
136071.64 2.128 3.256 4.512 4.0
13608978 The external system bus architecture is created using from ______ architecture
136091.
13610Pascal
136112.
13612Dennis Ritchie
136133.
13614Charles Babbage
136154.
13616Von Neumann
136173.0
13618979 The file transfer protocol is built on
136191.
13620data centric architecture
136212.
13622service oriented architecture
136233.
13624client server architecture
136254.
13626peer to peer architecture
136273.0
13628980 The first processor to include Virtual memory in the Intel microprocessor familywas 1.Pentium 2.80486 3.80286 4.80386 1.0
13629981 The following is not a Relational Model Constraint
136301.Referential Integrity Constraint 2.Check Constraint 3.Foreign Key
13631Constraint 4.Entity Integrity Constraint
136324.0
13633982 The following SQL is which type of join: SELECT CUSTOMER_T. CUSTOMER_ID,
13634ORDER_T. CUSTOMER_ID, NAME, ORDER_ID FROM CUSTOMER_T,ORDER_T ;
136351.
13636Equi-join
136372.
13638Natural join
136393.
13640Outer join
136414.
13642Cartesian join
136434.0
13644S.NO. Questions Choices Answers
13645983 The formal methods model of software development makes use of mathematical
13646methods to
136471.
13648Define the specification for computer-based system
136492.
13650Develop defect free computer-based systems
136513.
13652Verify the correctness of computer-based systems
136534.
13654ALL
136551.0
13656984 The function used to remove the leading spaces is
136571.
13658ltrim
136592.
13660lpad
136613.
13662rpad
136634.
13664rtrim
136651.0
13666985
13667The goal of product engineering is to translate the customer's desire for a set of defined
13668capabilities into a working product.
136691.
13670TRUE
136712.
13672FALSE
136733. 4.
136742.0
13675986 The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is
136761.
13677ambiguous
136782.
13679left-recursive
136803.
13681right-recursive
136824.
13683an operator-grammar
136843.0
13685987 The grammar S → aSa | bS | c is
136861.
13687LL(1) but not LR(1)
136882.
13689LR(1)but not LR(1)
136903.
13691Both LL(1)and LR(1)
136924.
13693Neither LL(1)nor LR(1)
136942.0
13695988 The Hardware mechanism that enables a device to notify the CPU is called
13696__________.
136971.
13698Polling
136992.
13700Interrupt
137013.
13702Systems Call
137034.
13704None of these
137052.0
13706S.NO. Questions Choices Answers
13707989 The high paging activity is called ________
137081.
13709Inter process communication
137102.
13711Thrashing
137123.
13713Context Switching
137144.
13715Working Set
137161.0
13717990 The IC 8237 is a
137181.
13719DMA Controller
137202.
13721Interrupt Controller
137223.
13723Keyboard controller
137244.
13725Serial Interface Controller
137263.0
13727991 The IC 8251 A has ---------------------many pins
137281.
1372924
137302.
1373128
137323.
1373340
137344.
1373530
137361.0
13737992 The IC 8254 has ---------------------many pins
137381.
1373924
137402.
1374128
137423.
1374334
137444.
1374540
137463.0
13747993 The IC 8254 has ----------------many 16 bit counters
137481.
137491
137502.
137512
137523.
137533
137544.
137554
137564.0
13757S.NO. Questions Choices Answers
13758994 The IC 8279 has ----------------------many pins
137591.
1376020
137612.
1376230
137633.
1376440
137654.
1376610
137671.0
13768995 The IC Number for USART is --------------------------
137691.
13770IC 8251A
137712.
13772IC8259
137733.
13774IC5255
137754.
13776IC 8254
137771.0
13778996 The idea of cache memory is based
137791.
13780on the property of locality of reference
137812.
13782on the heuristic 90-10 rule
137833.
13784on the fact that references generally tend to cluster
137854.
13786all of these
137874.0
13788997 The importance of software design can be summarized in a single word
137891.
13790accuracy
137912.
13792complexity
137933.
13794efficiency
137954.
13796quality
137973.0
13798998 The Incremental Model is a result of combination of elements of which two models?
137991.
13800Build & FIX Model & Waterfall Model
138012.
13802Linear Model & RAD Model
138033.
13804Linear Model & Prototyping Model
138054.
13806Waterfall Model & RAD Model
138072.0
13808S.NO. Questions Choices Answers
13809999 The incremental model of software development is
138101.
13811A reasonable approach when requirements are well defined.
138122.
13813A good approach when a working core product is required quickly.
138143.
13815The best approach to use for projects with large development
13816teams.
138174.
13818A revolutionary model that is not used for commercial products.
138192.0
138201000 The intel 8086 microprocessor is a _______ processor
138211.
138228 bit
138232.
1382416 bit
138253.
1382632 bit
138274.
138284bit
138292.0
138301001 The internal block diagram of 80286 contains ---- functional parts. 1.6 2.4 3.2 4.8 3.0
138311002 The interrupt cycle ends when the ........... instruction is executed 1.IRET 2.CALL 3.PUSH 4.POP 3.0
138321003 The intersection of CFL and regular language
138331.
13834Is always regular and context free
138352.
13836Is always regular
138373.
13838Is always context free
138394.
13840Need not be regular
138414.0
138421004 The IP is ________ bits in length
138431.
138448 bits
138452.
138464 bits
138473.
1384816 bits
138494.
1385032 bits
138513.0
138521005 The javascript statement a===b refers to
138531.
13854Both a and b are equal in value, type and reference address
138552.
13856Both a and b are equal in value
138573.
13858Both a and b are equal in value and type
138594.
13860There is no such statement
138611.0
13862S.NO. Questions Choices Answers
138631006 The kernel keeps track of the state of each task by using a data structure called __
138641.
13865Process control block
138662.
13867Process Status Word
138683.
13869Memory control block
138704.
13871None of these
138721.0
138731007
13874The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best
13875described as
138761.
13877Regular
138782.
13879context free
138803.
13881Recursive
138824.
13883Deterministic context free
138842.0
138851008
13886The language L= {0 21 | i≥0 } over the alphabet {0,1, 2} is:
138871.
13888not recursive
138892.
13890is recursive and is a deterministic CFL
138913.
13892is a regular language
138934.
13894is not a deterministic CFL but a CFL
138951.0
138961009 The language that the computer can understand and execute is called ______
138971.
13898Machine language
138992.
13900Application software
139013.
13902System program
139034.
13904None of these
139052.0
139061010 The language {a b C | m, n ≥ 1} is
139071.
13908Regular language
139092.
13910context free but not regular
139113.
13912context sensitive but not context free
139134.
13914type-0 but not context sensitive
139152.0
13916S.NO. Questions Choices Answers
13917i i
13918m n m+n
139191011
13920The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is
13921______________.
13922a*b*(ba)*a*
139231.
139242
139252.
139263
139273.
139284
139294.
139305
139312.0
139321012 The length property belongs to which of the following objects? 1.Window 2.Element 3.History 4.Document 4.0
139331013 The levels of hierarchy in inheritance helps to handle 1.flexibility 2.complexity 3.detailed information 4.security 2.0
139341014
13935The lexical analysis for a modern language such as Java needs the power of which one
13936of the following machine models in a necessary and sufficient sense?
139371.
13938Deterministic pushdown automata
139392.
13940Finite state automata
139413.
13942Non-deterministic pushdown automata
139434.
13944Turing machine
139453.0
139461015 The library function used to find the last occurrence of a character in a string is 1.strnstr() 2.laststr() 3.strrchr() 4.strstr() 1.0
139471016 The linear sequential model of software development is
139481.
13949A reasonable approach when requirements are well defined.
139502.
13951A good approach when a working program is required quickly.
139523.
13953The best approach to use for projects with large development
13954teams.
139554.
13956An old fashioned model that cannot be used in a modern context.
139573.0
139581017 The linear sequential model of software development is also known as the
139591.
13960Classical life cycle model
139612.
13962Spiral model
139633.
13964Waterfall model
139654.
13966Incremental Model
139671.0
139681018 The load instruction is mostly used to designate a transfer from memory to a processor
13969register known as____.
139701.
13971Accumulator
139722.
13973Instruction Register
139743.
13975Program counter
139764.
13977Memory address Register
139781.0
139791019 The main purpose of a data link content monitor is to
139801.detect problems in protocols 2.determine the type of switch used in
13981a data link 3.determine the flow of data 4.determine the type of
13982switching used in data link
139832.0
13984S.NO. Questions Choices Answers
139851020 The maximum number of superkeys for the relation schema R(E,F,G,H) with E as the
13986key is
139871.
139887
139892.
139908
139913.
139929
139934.
139946
139954.0
139961021 The maximum size of payload field in ethernet frame is
139971.
139981000 bytes
139992.
140001200 bytes
140013.
140021300 bytes
140034.
140041500 bytes
140052.0
140061022 The maximum window size for data transmission using the selective reject protocol with
14007n-bit frame sequence numbers is:
140081.
140092^n
140102.
140112^(n-1)
140123.
140132^n – 1
140144.
140152^(n-2)
140161.0
140171023 The MC 1488 is
140181.
14019TTL to RS 232C Level converter
140202.
14021RS-232 to TTL level converter
140223.
14023Bidirectional Level converter
140244.
14025Unidirectional level converter
140263.0
140271024 The mechanism that bring a page into memory only when it is needed is called ______
140281.
14029Segmentation
140302.
14031Fragmentation
140323.
14033Demand Paging
140344.
14035Page Replacement
140363.0
140371025 The members of a class, by default, are 1.private 2.protected 3.public 4.mandatory to specify 1.0
14038S.NO. Questions Choices Answers
140391026 The memory unit that communicates directly with the CPU is called the
140401.
14041main memory
140422.
14043Secondary memory
140443.
14045shared memory
140464.
14047auxiliary memory
140481.0
140491027 The microprocessor can read/write 16 bit data from or to ________
140501.
14051memory
140522.
14053I /O device
140543.
14055processor
140564.
14057register
140582.0
140591028
14060The microprocessor determines whether the specified condition exists or not by testing
14061the
14062______
140631.
14064carry flag
140652.
14066conditional flag
140673.
14068common flag
140694.
14070sign flag
140714.0
140721029 The minimum number of arithmetic operations required to evaluate the polynomial P(X)
14073= X^5 + 4X^3 + 6^X + 5 for a given value of X using only one temporary variable is.
140741.6 2.9 3.8 4.7 2.0
140751030 The minimum number of arithmetic operations required to evaluate the polynomial
14076P(X)=X^5+4X^3+6^X+5 for a given value of X using only one temporary variable.
140771.6 2.7 3.8 4.9 2.0
140781031 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 1.0
140791032
14080The MMU (Memory Management Unit) is a
140811.
14082Hardware
140832.
14084Software
140853.
14086Firmware
140874.
14088Malware
140892.0
140901033
14091The nature of collaboration is such that all system requirements are defined by
14092consensus of a committee of customers and developers.
140931.
14094TRUE
140952.
14096FALSE
140973. 4.
140984.0
140991034 The node type for document returns the value ---. 1.2 2.9 3.3 4.8 1.0
14100S.NO. Questions Choices Answers
141011035 The number of auxiliary memory required for a Push Down Machine (PDM) to behave
14102like a Finite State Machine (FSM) is
141031.
141040
141052.
141062
141073.
141084
141094.
141101
141113.0
141121036 The number of clock pulses needed to shift one byte of data from input to the output of a
141134-bit shift register is.
141141.10 2.12 3.16 4.32 3.0
141151037 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
141161038 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
141171039 The number of counters available in internal block diagram of 8253 is 1.2 2.1 3.3 4.4 2.0
141181040 The number of states in DFA is --------than the number of states in NFA for the same
14119Language.
141201.
14121Greater
141222.
14123less
141243.
14125greater equal
141264.
14127equal
141282.0
141291041 The number of tokens in the following C statement is
141301.
141313
141322.
1413310
141343.
1413526
141364.
1413721
141384.0
141391042 The operation of processing each element in the list is known as 1.Sorting 2.Merging 3.Inserting 4.Traversal 3.0
141401043 The other name for MODE 0 in 8253 timer is
141411.software triggered strobe 2.Programmable one shot 3.Interrupt on
14142terminal count 4.Square wave rate generator
141431.0
141441044 The physical layer concerns with
141451.
14146bit-by-bit delivery
141472.
14148process to process delivery
141493.
14150application to application delivery
141514.
14152Hop by hop delivery
141534.0
141541045 The physical layer is responsible for
141551.
14156line coding
141572.
14158channel coding
141593.
14160modulation
141614.
14162all of the mentioned
141631.0
14164S.NO. Questions Choices Answers
14165printf("i = %d, &i = %x", i, &i);
141661046 The physical layer translates logical communication requests from the ______ into
14167hardware specific operations.
141681.
14169data link layer
141702.
14171network layer
141723.
14173trasnport layer
141744.
14175application layer
141761.0
141771047 The pop() method of the array in javascript does which of the following task ?
141781.
14179decrements the total length by 1
141802.
14181increments the total length by 1
141823.
14183prints the first element but no effect on the length
141844.
14185don't return the value of deleted element
141861.0
141871048 The portion of physical layer that interfaces with the media access control sublayer is
14188called
141891.
14190physical signalling sublayer
141912.
14192physical data sublayer
141933.
14194physical address sublayer
141954.
14196none of the mentioned
141971.0
141981049 The postfix expression for * + a b - c d is? 1.ab + cd - * 2.ab + cd * - 3.ab + - cd * 4.ab cd + - * 3.0
141991050 The postfix form of the expression (A+ B)*(C*D- E)*F / G is
142001.AB + CD* E - *F *G / 2.AB + CD* E - F **G / 3.AB+ CD*E - FG /**
142014.AB + CDE * - * F *G /
142024.0
142031051 The preorder traversal sequence of a binary search tree is 30,20,10,15,25,23,39,35,42. Which one of the following is the postorder traversal sequence of the same tree?
142041.10,20,15,23,25,35,42,39,30 2.15,10,25,23,20,42,35,39,30
142053.15,20,10,23,25,42,35,39,30 4.15,10,23,25,20,35,42,39,30
142063.0
142071052 The process of retaining data for future use is called
142081.
14209reading
142102.
14211writing
142123.
14213storing
142144.
14215coding
142163.0
142171053
14218The project planner examines the statement of scope and extracts all important software
14219functions which is known as
142201.
14221Association
142222.
14223Decomposition
142243.
14225Planning process
142264.
14227ALL
142283.0
14229S.NO. Questions Choices Answers
142301054 The rapid application development model is
142311.
14232Another name for component-based development.
142332.
14234Another name for component-based development.
142353.
14236A high speed adaptation of the linear sequential model.
142374.
14238ALL
142394.0
142401055 The RDBMS terminology for a row is
142411.attribute
142422.relation
142433.degree
142444.tuple
142453.0
142461056 The recognizing capabilities of NDFSM and DFSM
142471.
14248may be different
142492.
14250must be different
142513.
14252must be same
142534.
14254none of the mentioned
142551.0
142561057 The relational model uses some unfamiliar terminology. A tuple is equivalence to a: 1.record 2.field 3.file 4.database 2.0
142571058 The removal of process from active contention of CPU and reintroduce them into
14258memory later is known as ____________
142591.
14260Interrupt
142612.
14262Swapping
142633.
14264Signal
142654.
14266Thread
142673.0
142681059 The restriction while using the binary search is ?
142691.List should be small in number 2.List should be large in number
142703.List should be sorted 4.No restriction
142712.0
142721060 The result evaluating the postfix expression (10 5 + 60 6 / * 8 –) is 1.284 2.142 3.213 4.71 4.0
142731061 The searching technique that takes O (1) time to find a data is 1.Binary Search 2.Linear Search 3.Tree Search 4.Hashing 3.0
142741062 The segment number S is legal if
142751.
14276S < STBR
142772.
14278S > STBR
142793.
14280S < STLR
142814.
14282S > STLR
142831.0
142841063 The simplest image processing technique is
142851.coordinates transformation 2.intensity transformation 3.spatial
14286transformation 4.domain transformation
142872.0
142881064 The situation when in a linked list START=NULL is 1.overflow 2.underflow 3.housefull 4.saturated 1.0
142891065 The smallest element of an array’s index is called its
142901.lower bound 2.range
14291D. extract 3.upper bound 4.ion
142923.0
14293S.NO. Questions Choices Answers
142941066 The smallest finite automation which accepts the language {x | length of x is divisible by
142953} has :
142961.
142972 states
142982.
142993 states
143003.
143014 states
143024.
143035 states
143043.0
143051067 The space factor when determining the efficiency of algorithm is measured by
143061.Counting the average memory needed by the algorithm 2.Counting
14307the minimum memory needed by the algorithm 3.Counting the
14308maximum memory needed by the algorithm 4.Counting the
14309maximum disk space needed by the algorithm
143104.0
143111068 The spiral model of software development
143121.
14313Ends with the delivery of the software product
143142.
14315Is not more chaotic than the incremental model
143163.Do not Include project risks evaluation during each iteration
143174.Includes feasibility risks
143182.0
143191069 The spiral model was originally proposed by
143201.
14321IBM
143222.
14323Barry Boehm
143243.
14325Pressman
143264.
14327Royce
143281.0
143291070 The SQL BETWEEN operator
143301.
14331Specifies a range to test
143322.
14333specifies between which tables the data is present
143343.
14335specifies the columns between which columns the data is present
143364.
14337None of the options
143383.0
143391071 The starting address for counter 0 of 8253 is 0038H, then port address for control word
14340register is
143411.44H 2.49H 3.42H 4.46H 1.0
143421072 The state diagram
143431.
14344depicts relationships between data objects
143452.
14346depicts functions that transform the data flow
143473.
14348indicates how data are transformed by the system
143494.
14350indicates system reactions to external events
143514.0
143521073 The status that cannot be operated by direct instructions is 1.Z 2.Cy 3.P 4.AC 4.0
143531074 The stream insertion operator should be overloaded as
143541.friend functions 2.member function 3.non member functions 4.static
14355functions
143564.0
143571075 The stream insertion operator should be overloaded as
143581.friend functions 2.member function 3.non member functions 4.static
14359functions
143601.0
143611076 The switching method fixes the path from source to destination is _________
143621.circuit switching 2.Message Switching 3.Packet switching 4.Frame
14363Relay
143642.0
143651077 The syntax of Eval is ___________
143661.[objectName.]eval(numeriC) 2.[objectName.]eval(string) 3.
14367[EvalName.]eval(string) 4.[EvalName.]eval(numeriC)
143684.0
14369S.NO. Questions Choices Answers
143701078 The system engineering process usually begins with the
143711.
14372detailed view
143732.
14374domain view
143753.
14376element view
143774.
14378world view
143791.0
143801079 The system specification describes the
143811.
14382Function, performance and constraints of a computer-based system
143832.
14384implementation of each allocated system
143853.
14386element software architecture
143874.time required for system simulation
143883.0
143891080 The tightest upper bound for the worst case performance of quicksort implemented on
14390an array of n elements by always chosing the pivot as the central element is
143911.T(n! logn) 2.O(n logn) 3.O(n^2) 4.O(n^3) 2.0
143921081 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) 4.0
143931082 The topology with highest reliability is ......................... 1.ring topology 2.star topology 3.bus topology 4.mesh topology 2.0
143941083
14395The total number of pins for the IC 8255 is
143961.
1439728
143982.
1439940
144003.
1440130
144024.
1440320
144043.0
144051084 The two statements that can be used to change the flow of control are
144061.switch and do-while 2.if and while 3.if and switch 4.break and
14407continue
144082.0
144091085 The UNION SQL clause can be used with…
144101.
14411none of the options
144122.
14413the SELECT clause only
144143.
14415the UPDATE clause only
144164.
14417the DELETE and UPDATE clauses
144183.0
144191086 The use of traceability tables helps to
144201.
14421debug programs following the detection of run-time errors
144222.
14423determine the performance of algorithm implementations
144243.
14425identify, control, and track requirements changes
144264.Analyze design changes
144273.0
144281087 The value in AL=11011010 after the operation of CBW, the result is
144291.AX=1101 1010 1111 1111 2.AX=1101 1010 0000 0000
14430. 3.AX=1111 1111 1101 1010 4.AX=0000 0000 1101 1010
144312.0
14432S.NO. Questions Choices Answers
144331088 The virtual file system provides us the following
144341.
14435Object oriented file implementation
144362.
14437Structured programming file implementation
144383.
14439Linked file allocation
144404.
14441Indexed file allocation
144423.0
144431089 The work of EU is ________
144441.
14445encoding
144462.
14447decoding
144483.
14449processing
144504.
14451calculations
144522.0
144531090 The work products produced during requirement elicitation will vary depending on the
144541.
14455size of the budget
144562.
14457size of the product being built
144583.
14459software process being used
144604.
14461stakeholders needs
144623.0
144631091 The worst case running time to search for an element in a balanced binary search tree
14464with n*2^n elements is
144651.theta(n log n) 2.theta(n*2^n) 3.theta(n) 4.theta(log n) 3.0
144661092 The worst case running time to search for an element in a balanced in a binary search
14467tree with n*2^n elements is
144681.theta(n log n) 2.theta(n*2^n) 3.theta(n) 4.theta(log n) 2.0
144691093
14470There are n stations in a slotted LAN. Each station attempts to transmit with a probability
14471p in each time slot. What is the probability that only one station transmits in a given time
14472slot?
144731.
14474(1-p)^(n-1)
144752.
14476np(1-p)^(n-1)
144773.
14478p(1-p)^(n-1)
144794.
144801-(1-p)^(n-1)
144813.0
144821094 There is no connection setup phase in __________ 1.Frame relay 2.Virtual Circuit Switching 3.Datagram 4.ATM 1.0
144831095 Thrashing occurs ________
144841.
14485when excessive swapping takes place
144862.
14487when you thrash your computer
144883.
14489whenever deadlock occurs
144904.
14491when no swapping takes place
144921.0
144931096 Thresholding function in contrast stretching creates
144941.binary image 2.high quality image 3.low quality image 4.enhanced
14495image
144962.0
144971097 To create an alias Objects have to be passed by 1.address 2.reference 3.value 4.field by field 2.0
144981098 To Delete an item from a Queue identify the correct set of statements
144991.Q[REAR] = item; REAR ++ 2.item = Q[FRONT]; FRONT++ 3.item =
14500Q[REAR]; FRONT ++ 4.item = Q[FRONT]; REAR ++
145012.0
14502S.NO. Questions Choices Answers
145031099 To determine the architectural style or combination of styles that best fits the proposed
14504system, requirements engineering is used to uncover
145051.
14506algorithmic complexity
145072.
14508characteristics and constraints
145093.
14510control and data
145114.
14512design patterns
145132.0
145141100
14515To interface memory with the microprocessor, connect register the lines of the address
14516bus
14517must be added to address lines of the _______ chip.
145181.
14519single
145202.
14521memory
145223.
14523multiple
145244.
14525triple
145261.0
145271101 To operate correctly, starting a ring counter requires
145281.presetting all the flip-flops 2.clearing one flip-flop and presetting all
14529the others 3.presetting one flip-flop and clearing all the others
145304.clearing all the flip-flops
145311.0
145321102
14533Today the increased power of the personal computer has brought about an
14534abandonment of the practice of team development of software
145351.
14536True
145372.
14538false
145393. 4.
145403.0
145411103 Trigger is a
145421.Statement that enables to start any DBMS 2.Statement that is
14543executed by the user when debugging an application program
145443.Statement that is executed automatically by the system as a side
14545effect of a modification to the database 4.Condition the system tests
14546for the validity of the database user
145473.0
145481104
14549Two computers C1 and C2 are configured as follows. C1 have IP address as
14550203.197.2.53 and netmask 255.255.128.0. C2 have IP address as 203.197.75.201 and
14551netmask 255.255.192.0. Which one of the following statements is true?
145521.
14553C1 and C2 both assume they are on the same network
145542.
14555C2 assumes C1 is on same network, but C1 assumes C2 is on a
14556different network
145573.
14558C1 assumes C2 is on same network, but C2 assumes C1 is on a
14559different network
145604.
14561C1 and C2 both assume they are on different networks.
145621.0
145631105
14564Two sets of functional dependencies E and F are equivalent if E+ = F+ .This statement
14565is
145661.
14567True
145682.
14569False
145703.
14571Cant Say
145724.
145732.0
145741106 Updating a database means
145751.deleting database 2.modifying or adding record occurrences
145763.revising the file structure 4.reorganizing the database
145773.0
14578S.NO. Questions Choices Answers
145791107 Usability questionnaires are most meaningful to the interface designers when
14580completed by
145811.
14582customers
145832.
14584experienced programmers
145853.
14586product users
145874.
14588project managers
145892.0
145901108 Using linked list node representation, inserting a node in general tree is performed
14591efficently
145921.not possible 2.by merging with an existing node 3.after introducing
14593a new link 4.after converting to binary tree
145942.0
145951109 Using the 8259A, the INT input of the 8086 can be expanded to accomodeate up to ------
14596--------- prioritized interrupt inputs
145971.60 2.64 3.16 4.32 2.0
145981110 Usually a pure virtual function
145991.Will be called only to delete an object 2.Is defined only in derived
14600class 3.Will never be called 4.Has complete function body
146013.0
146021111 Virtual memory is the portion of _______.
146031.
14604RAM
146052.
14606Cache Memory
146073.
14608Hard Disc
146094.
14610None of these
146111.0
146121112 Voice privacy in GSM cellular telephone protocol is provided by
146131.
14614A5/2 cipher
146152.
14616b5/4 cipher
146173.
14618b5/6 cipher
146194.
14620b5/8 cipher
146213.0
146221113 VOLATILE MEMORY IS ________________ ?
146231.COMPACT DISK 2.HARD DISK 3.RANDOM ACCESS MEMORY
146244.READ ONLY MEMORY
146251.0
146261114 What are the three Analysis models that depict software?
146271.
14628architecture, interface, component
146292.
14630cost, risk, schedule
146313.
14632Information, function, behavior
146334.
14634NONE
146351.0
146361115
14637What assess the risk and your plans for risk mitigation and revise these when you learn
14638more about the risk?
146391.
14640Risk monitoring
146412.
14642Risk planning
146433.
14644Risk analysis
146454.
14646Risk identification
146473.0
14648S.NO. Questions Choices Answers
146491116 What characteristic of RAM memory makes it not suitable for permanent storage?
146501.
14651too slow
146522.
14653unreliable
146543.
14655it is volatile
146564.
14657too bulky
146581.0
146591117 What do the 'c' and 'v' in argv stands for?
146601.'c' means argument count 'v' means argument vector 2.'c' means
14661argument count 'v' means argument vertex 3.'c' means argument
14662configuration 'v' means argument visibility 4.'c' means argument
14663control 'v' means argument vector
146642.0
146651118 What does /[^(]* regular expression indicate ?
146661.Match one or more characters that are not open paranthesis
146672.Match zero or more characters that are open paranthesis 3.Match
14668zero or more characters that are not open paranthesis 4.Match one
14669or more characters that are open paranthesis
146701.0
146711119 What does explode function in php do
146721.Used to convert a string to an array 2.Used to split a given string
14673into the number of chunks specified 3.Used to split a string by a
14674string 4.Used to split string into two equal halves
146752.0
146761120 What does microprocessor speed depends on 1.Clock 2.Address bus width 3.Data bus width 4.Size of register 1.0
146771121 What does parseFloat(9+10) evaluates to in JavaScript? 1.19 2.910 3.9109 4.91 2.0
146781122 What does the following declaration mean?
14679int (*ptr)[10];
146801.ptr is array of pointers to 10 integers 2.ptr is a pointer to an array of
1468110 integers 3.ptr is an array of 10 integers 4.ptr is an pointer to array
146823.0
146831123
14684What elements will the following script output?
14685<?php
14686$array = array (true => 'a', 1 => 'b');
14687var_dump ($array);
14688?>
146891.
146901 => 'b'
146912.
14692True => 'a', a => 'b'
146933.
14694NULL
146954.
146960 => 'a', 1 => 'b'
146973.0
146981124 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
146991125 What happens if no file path is given in include() function?
147001.PHP continues to execute the script. 2.Results in a fatal error
147013.Include_path is made use of 4.It haults the script.
147023.0
147031126 What is a Software ?
147041.
14705Software is set of programs
147062.
14707Software is documentation and configuration of data
147083.
14709Software is set of programs and Software is documentation and
14710configuration of data
147114.
14712Software is a set of documents.
147134.0
147141127 What is asynchronous counter.
147151.none of them 2.A master clock triggers all the flip-flops at a time
147163.all the flip-flop are combined to common clock 4.each flip-flop has
14717it own clock
147181.0
147191128 What is data encryption standard (DES)?
147201.
14721block cipher
147222.
14723stream cipher
147243.
14725bit cipher
147264.
14727none of the mentioned
147281.0
14729S.NO. Questions Choices Answers
147301129 What is interframe gap?
147311.
14732idle time between frames
147332.
14734idle time between frame bits
147353.
14736idle time between packets
147374.
14738none of the mentioned
147393.0
147401130 What is meant by parallel-loading the register?
147411.Shifting the data in all flip-flops simultaneously 2.Loading data in
14742two of the flip-flops 3.Loading data in all flip-flops at the same time
147434.Momentarily disabling the synchronous SET and RESET inputs
147442.0
147451131 What is the best case for linear search 1.O(n) 2.O(1) 3.O(log n) 4.O(2n) 3.0
147461132 What is the code to start displaying the time when document loads?
147471.onload = displayTime; 2.window. = displayTime; 3.window.onload
14748= displayTime; 4.window.onload = start;
147492.0
147501133 What is the condition for resetting(s=0) the S flag in status register?
147511.MSB of the result is One 2.MSB of the result is zero 3.LSB of the
14752result is one 4.LSB of the result is zero
147531.0
147541134 What is the correct CSS syntax for making all the elements bold?
147551.p {font-weight:bold;} 2.p style="text-size:bold" 3.p {text-size:bold}
147564.p style="font-size:bold">
147572.0
147581135 What is the correct way to connect to a MySQL database?
147591.mysqli_db(host,username,password,dbname);
147602.mysqli_connect(host,username,password,dbname);
147613.mysqli_open(host,username,password,dbname);
147624.
14763mysqli_connect(,,)
147643.0
147651136 What is the data structures used to perform recursion? 1.list 2.queue 3.stack 4.Tree 2.0
147661137 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
147671138 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 3.0
147681139 What is the difference between echo and print?
147691.They both behave the same. 2.Print can take multiple parameters
14770where as echo cannot 3.Echo can take multiple parameters where
14771as print cannot 4.Print is a function where as echo is not.
147723.0
147731140 What is the following style an example of? img[alt~="Pie"]
147741.Attribute Match 2.Exact Value Match 3.Contains Value Match
147754.Subcode Match
147762.0
147771141 What is the highest normal form level satisfied by the following table design? R=
14778{A1,A2,A3,A4,A4} F={A1-> A3, A3->A4}Key ={A1,A2}
147791.
147801 NF
147812.
147822 NF
147833.
147843 NF
147854.
14786BCNF
147872.0
147881142 What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar
14789with no epsilon- and unit-production (i.e., of type A -> Ñ” and A -> a) to parse a string with n tokens?
147901.
14791n/2
147922.
14793n-1
147943.
147952n-1
147964.
147972^n
147981.0
14799S.NO. Questions Choices Answers
148001143 What is the maximum size of data that the application layer can pass on to the TCP
14801layer below?
148021.
14803Any size
148042.
148052^16 bytes-size of TCP header
148063.
148072^16 bytes
148084.
148091500 bytes
148101.0
148111144 What is the minimum number of NAND gates required to implement A + AB` + AB`C? 1.0 2.1 3.2 4.3 2.0
148121145 What is the most essential purpose of paranthesis in regular expressions?
148131.Define pattern matching techniques 2.Define subpatterns within
14814the complete pattern 3.Define portion of strings in the regular
14815expression 4.All of the mentioned
148162.0
148171146 what is the need of segmenting the memory in 8086
148181.Increase the memory accessibility 2.Increase the memory
14819addressibility 3.easy to retrieve data 4.faster access
148203.0
148211147
14822What is the normal order of activities in which traditional software testing is
14823organized? a. integration testing b. system testing c. unit testing d.validation
14824testing
148251.
14826a, d, c, b
148272.
14828b, d, a, c
148293.
14830c, a, d, b
148314.
14832d, b, c, a
148331.0
148341148 What is the order of the stages in the waterfall mode?
148351.
14836Requirements Definition, System & Software Design,
14837Implementation & Unit Testing, Integration & System Testing,
14838Operation & Maintenance.
148392.
14840Requirements Definition, Integration & System Testing, System &
14841Software Design, Implementation & Unit Testing, Operation &
14842Maintenance.
148433.
14844System & Software Design, Requirements Definition, Operation &
14845Maintenance, Implementation & Unit Testing, Integration & System
14846Testing.
148474.
14848Implementation & Unit Testing, Requirements Definition, System &
14849Software Design, Integration & System Testing, Operation &
14850Maintenance.
148512.0
148521149 what is the output for the following function? LPAD(salary,10,'*')
148531.
1485410***24000
148552.
14856*****24000
148573.
1485824000*****
148594.
14860error
148611.0
14862S.NO. Questions Choices Answers
148631150
14864What is the output?
14865#include <stdio.h>
14866void main()
14867{
14868int a=3,b=2;
14869a=a==b==0;
14870printf("%d,%d",a,b);
14871}
148721.
148731,2
148742.
148753,2
148763.
148770,0
148784.
148792,3
148803.0
148811151 What is the purpose of $_SESSION[]?
148821.
14883Used to register a global variable
148842.
14885Used to initialize a session
148863.
14887Used to store variables of the current session
148884.
14889Used to initialize a cookie
148902.0
148911152 What is the result of the following code snippet? window.location === document.location 1.False 2.True 3.0 4.1 2.0
148921153 What is the strpos() function used for?
148931.Find the last occurrence of the string within a string 2.Find the first
14894occurrence of the string within a string 3.Find both last and first
14895occurence 4.Search for all occurrence within a string
148961.0
148971154 What is the time complexity for binary search 1.O(log n) 2.O(n^2) 3.O(1) 4.O(2n) 3.0
148981155 What is the time complexity for insertion sort 1.O(log n) 2.O(n) 3.O(n^2) 4.O(1) 4.0
148991156 What is the worst case for Selection sort 1.O(log n) 2.O(2n) 3.O(n) 4.O(n^2) 2.0
149001157 What is Wired Equivalent Privacy(WEP)?
149011.
14902security algorithm for ethernet
149032.
14904security algorithm for wireless networks
149053.
14906security algorithm for USB
149074.
14908None
149091.0
149101158 What is WPA?
149111.
14912wi-fi protected access
149132.
14914wired protected access
149153.
14916wired process access
149174.
14918wi-fi process access
149191.0
149201159 What is x+ mode in fopen() used for?
149211.
14922Read/Write. Creates a new file. Returns FALSE and an error if file
14923already exists
149242.
14925Write only. Creates a new file. Returns TRUE and an error if file
14926already exists
149273.
14928Read/Write. Opens and clears the contents of file
149294.
14930Write. Opens and clears the contents of file
149312.0
14932S.NO. Questions Choices Answers
149331160 What keyword covers unhandled possibilities? 1.other 2.default 3.contingency 4.all 1.0
149341161
14935What kind of schema it is?
14936Student(sid, sname, dob, address, pincode)
149371.Relaional
149382.Logical Schema
149393.Conceptual Schema
149404.External View
149411.0
149421162 What library do you need in order to process images?
149431.
14944GD library
149452.
14946ZIP library
149473.
14948Win32 API library
149494.
14950BOGUS library
149514.0
149521163
14953What type of declaration is this:
14954unsigned num;
149551.
14956num is unsigned integer
149572.
14958num is unsigned float
149593.
14960num is unsigned character
149614.
14962Invalid declaration
149634.0
149641164 What type of register would shift a complete binary number in one bit at a time and shift
14965all the stored bits out one bit at a time?
149661.PIPO 2.PISO 3.SIPO 4.SISO 2.0
149671165
14968What will be the output?
14969#include <stdio.h>
14970int main()
14971{
14972extern int ok;
14973printf("value of ok = %d",ok);
14974return 0;
14975}
14976extern int ok=1000;
149771.
14978Declaration Error
149792.
14980value of ok = 1000
149813.
14982value of ok = 0
149834.
14984Linking Error
149853.0
149861166 What will be the result of the expression 13 & 25 1.25 2.38 3.9 4.12 4.0
149871167 What will be the status of a computer during storage compaction
149881.
14989High paging activity
149902.
14991Thrasing happens
149923.
14993Working set model developed
149944.
14995It will sit idle
149963.0
149971168 What will happen if the first argument of open() is omitted?
149981.Error Page 2.Remains in the same page 3.about:blank 4.Open the
14999first page in the history
150001.0
15001S.NO. Questions Choices Answers
150021169
15003What will the following script output?
15004<?php
15005$array = array (1, 2, 3, 5, 8, 13, 21, 34, 55);
15006$sum = 0;
15007for ($i = 0; $i < 5; $i++) {
15008$sum += $array[$array[$i]];
15009}
15010echo $sum;
15011?>
150121.
1501378
150142.
1501519
150163.
15017NULL
150184.
150195
150202.0
150211170 What would be the output of the below code fragment? var a = ["s","a","v","e"];
15022document.write(a.join(""));
150231.Undefined 2.save 3.vase 4.S 1.0
150241171 When testing object-oriented software it is important to test each class operation
15025separately as part of the unit testing process.
150261.
15027true
150282.
15029false
150303. 4.
150311.0
150321172 When a new row is inserted the constraints that can be violated are
150331.
15034Primary Key constraint
150352.
15036Referential Integrity Constraint
150373.
15038all of the options
150394.
15040Domain Constraint
150413.0
150421173 When a single item that triggers other data flow along one of many paths of a data flow
15043diagram, ________ characterizes the information flow.
150441.
15045high coupling
150462.
15047poor modularity
150483.
15049transaction flow
150504.
15051transform flow
150521.0
150531174 When displaying a web page, the application layer uses the
150541.
15055HTTP protocol
150562.
15057FTP protocol
150583.
15059SMTP protocol
150604.
15061IMAP Protocol
150624.0
150631175
15064When operated in slave mode, the PIC outputs its type number only if the cascaded
15065address received on CAS0-CAS2 matches the address programmed in --------- bits D0-
15066D2
150671.ICW1 2.ICW2 3.ICW3 4.ICW4 4.0
150681176 When the overall flow in a segment of a data flow diagram is largely sequential and
15069follows straight-line paths, _________ is present.
150701.
15071low coupling
150722.
15073good modularity
150743.
15075transaction flow
150764.
15077transform flow
150783.0
150791177 When the pre-order and post-order traversal of a Binary Tree generates the same
15080output, the tree can have maximum
150811.Three nodes 2.Two nodes 3.One node 4.Any number of nodes 2.0
15082S.NO. Questions Choices Answers
150831178 When there are infinite distinguishable strings then there cannot be a -------------
150841.
15085automata
150862.
15087finite automata
150883.
15089regular expression
150904.
15091both finite automata and regular expression
150923.0
150931179 When there is an indefinite or an infinity value during an arithmetic value computation,
15094javascript
150951.
15096Prints an exception error
150972.
15098Prints an overflow error
150993.
15100Displays “Infinity”
151014.
15102Prints the value as such
151033.0
151041180 When used with the datalist element, what is the list attribute in HTML5 used to
15105accomplish?
151061.Local databases 2.Drop down lists 3.Autocompletion 4.Global
15107Databases
151082.0
151091181 When we concatenate two languages L1 and L2 recognized by machine M1 and M2 we
15110obtain a machine with final state same as that of __________________
151111.
15112M2
151132.
15114M1 and M2
151153.
15116M1
151174.
15118M1 or M2
151194.0
151201182
15121when you were asked to design a relation, you come across a situation, where passport
15122number is to be included for the people. All the students wont be having passport. So
15123what constraint you would be using?
151241.
15125Primary Key
151262.
15127Not Null
151283.
15129Default
151304.
15131Unique
151322.0
151331183 Which of the following is shared between all of the threads in a process? Assume a
15134kernel level thread implementation
151351.
15136Register values
151372.
15138File descriptors
151393.
15140Scheduler priority
151414.
15142Local variables
151431.0
151441184 Which buffer is a parallel to serial converter that receives a parallel byte for conversion
15145into a serial signal and further transmission onto the communication channel.
151461.Transmit buffer 2.Receive buffer 3.Data bus buffer 4.Modem
15147control
151483.0
15149S.NO. Questions Choices Answers
151501185 Which character function can be used to return a specified portion of a character string?
151511.
15152INSTR
151532.
15154SUBSTRING
151553.
15156SUBSTR
151574.
15158POS
151592.0
151601186 Which command we use to set an image on background?
151611.image-background:url('R4R_Logo.jpg') 2.backgroundimage:url('R4R_Logo.jpg')
151623.bg-image:url('R4R_Logo.jpg')
151634.background-image:href('R4R_Logo.jpg')
151643.0
151651187 Which Data structure is best suited for the UNDO operation in Windows 1.Both Stack and Queues 2.Queues 3.Stack 4.Arrays 1.0
151661188 Which database level is closest to the users?
151671.
15168External
151692.
15170Conceptual
151713.
15172Internal
151734.
15174Physical
151753.0
151761189 Which date function is used to obtain the date of next Wednesday
151771.
15178NEXT_DAY
151792.
15180LAST_DAY
151813.
15182NEXT_DATE
151834.
15184All of the options
151854.0
151861190
15187Which design model is analogous to the detailed drawings of the access points and
15188external utilities for a house?
151891.
15190Architectural design
151912.
15192Component-level design
151933.
15194Data design
151954.
15196Interface design
151973.0
151981191 Which directory implementation is used in most of the Operating Systems?
151991.
15200Single level directory structure
152012.
15202Two level directory structure
152033.
15204Tree directory structure
152054.
15206Acyclic directory structure
152074.0
15208S.NO. Questions Choices Answers
152091192 Which directory implementation method creates more dangling pointers?
152101.
15211Single level directories
152122.
15213Two level directories
152143.
15215Tree Structured Diretories
152164.
15217Acyclic graph directories
152184.0
152191193 Which element is used to draw graphics images on a web page? 1.script 2.audio 3.embed 4.canvas 2.0
152201194 Which granularity level of testing checks the behavior of module cooperation?
152211.
15222Unit Testing
152232.
15224Integration Testing
152253.
15226Acceptance Testing
152274.
15228Regression Testing
152294.0
152301195 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
152311196 Which Instruction word is used to specify the number of stop bits, data bits, parity bit and
15232the baud rate clock factor for the 8251A USART
152331.Mode 2.Command followed by Mode 3.Command 4.Mode
15234followed by command
152352.0
152361197 Which is a major problem with SQL?
152371.
15238SQL cannot support object-orientation
152392.
15240The same query can be written in many ways, each with vastly
15241different execution plans.
152423.
15243SQL syntax is too difficult for non-computer professionals to use
152444.
15245SQL creates excessive locks within the database
152463.0
152471198 Which is not related to deadlock avoidance?
152481.
15249Safe State
152502.
15251Unsafe State
152523.
15253Safe Sequence
152544.
15255Resource sequence
152564.0
152571199 Which is one of the most important stakeholder from the following ?
152581.
15259Entry level personnel
152602.
15261Middle level stakeholder
152623.
15263Managers
152644.
15265Users of the software
152663.0
15267S.NO. Questions Choices Answers
152681200 Which is the correct way to write a JavaScript array?
152691.
15270var txt = new Array(1:"tim",2:"kim",3:"jim")
152712.
15272var txt = new Array:1=("tim")2=("kim")3=("jim")
152733.
15274var txt = new Array("tim","kim","jim")
152754.
15276var txt = new Array="tim","kim","jim"
152771.0
152781201 Which is used to store critical pieces of data during subroutines and interrupts
152791.
15280Stack
152812.
15282Queue
152833.
15284Accumulator
152854.
15286Data register
152872.0
152881202 Which item is an example of a physical network address?
152891.IP address 2.MAC address 3.Workstation name
152904.www.proprofs.com
152913.0
152921203 Which JavaScript function is most useful for finding errors? 1.Confirm 2.Prompt 3.Debug 4.Alert 4.0
152931204 Which method bypasses the CPU for certain types of data transfer?
152941.
15295Software interrupts
152962.
15297Interrupt-driven I/O
152983.
15299Polled I/O
153004.
15301Direct memory access (DMA)
153021.0
153031205 Which method is used for loading the driver in Java JDBC.
153041.
15305getDriver() method
153062.
15307class.forName()
153083.
15309createStatement()
153104.
15311getConnection()
153123.0
153131206 Which method is used to search for a substring?
153141.
15315stringVariable.substring(subString)
153162.
15317stringVariable.find(subString)
153183.
15319stringVariable.indexOf(subString)
153204.
15321stringVariable.indexOf(charAt(0))
153223.0
15323S.NO. Questions Choices Answers
153241207 Which model can be selected if user is involved in all the phases of SDLC?
153251.
15326Waterfall Model
153272.
15328Prototyping Model
153293.
15330RAD Model
153314.
15332Prototyping Model and RAD model
153333.0
153341208 Which model depicts the profile of the end users of a computer system?
153351.
15336design model
153372.
15338implementation model
153393.
15340user model
153414.
15342client model
153432.0
153441209 Which multiple access technique is used by IEEE 802.11 standard for wireless LAN?
153451.
15346CDMA
153472.
15348CSMA/CA
153493.
15350ALOHA
153514.
15352CSMA/CD
153533.0
153541210 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
153551211 Which of the following (in file scope) leads to a compile-time error?
153561.const int a=90; 2.const int f1() { return 100; } 3.int f2() const { return
15357200; } 4.const int f3( const int i) { return 300;}
153583.0
153591212 Which of the following activities is not one of the four things that need to be
15360accomplished by the generic planning task set?
153611.
15362Develop overall project strategy
153632.
15364Identify the functionality to deliver in each software increment
153653.
15366Create a detailed schedule for the complete software project
153674.
15368Devise a means of tracking progress on a regular basis
153694.0
153701213
15371Which of the following addressing modes are suitable for program
15372relocation at run time?
153731. Absolute addressing
153742. Based addressing
153753. Relative addressing
153764. Indirect addressing
153771.
153781 and 4
153792.
153801 and 2
153813.
153822 and 3
153834.
153841,2 and 4
153853.0
153861214 Which of the following algorithm design technique is used in the quick sort algorithm?
153871.Greedy method 2.Backtracking 3.Divide and conquer 4.Dynamic
15388programming
153893.0
153901215 Which of the following algorithm is Minimum Spanning Tree in graph
153911.Dijiktra's algorithm 2.AVL Tree algorithm 3.Kruskal's algorithm
153924.Merge algorithm
153931.0
153941216 Which of the following algorithm is used to find the shortest path between two nodes in
15395graph
153961.Dijiktra's algorithm 2.Prim's algorithm 3.Kruskal's algorithm
153974.Merge algorithm
153983.0
15399S.NO. Questions Choices Answers
154001217
15401Which of the following are decidable?
15402I. Whether the intersection of two regular languages is infinite
15403II. Whether a given context-free language is regular
15404III. Whether two push-down automata accept the same language
15405IV. Whether a given grammar is context-free
154061.
15407I and II
154082.
15409I and IV
154103.
15411II and III
154124.
15413I and III
154141.0
154151218 Which of the following attribute is needed for file upload via form?
154161.
15417enctype='multipart/form-data'
154182.
15419enctype='singlepart/data'
154203.
15421enctype='file'
154224.
15423enctype='form-data/file'
154243.0
154251219 Which of the following can be a valid column name?
154261.
15427Column
154282.
154291966_Invoices
154303.
15431Catch_#22
154324.
15433#Invoices
154343.0
154351220 Which of the following can't be done with client-side JavaScript?
154361.Validating a form 2.Sending a form's contents by email 3.Storing
15437the form's contents to a database file on the server 4.Testing the form
154384.0
154391221 Which of the following case does not exist in complexity theory? 1.Average case 2.Worst case 3.Best case 4.Null case 2.0
154401222 Which of the following command words need to be programmed to operate a single PIC
15441in fully nested mode with an 8086 microprocessor
154421.ICW1 and ICW2 2.ICW1, ICW2 and ICW4 3.ICW2 and ICW3
154434.ICW1 and ICW4
154444.0
154451223 Which of the following correctly describes C++ language?
154461.Statically typed language 2.Dynamically typed language 3.Both
15447Statically and dynamically typed language 4.Type-less language
154484.0
154491224 Which of the following describes a handle (as applicable to LR-parsing) appropriately?
154501.
15451It is the position in a sentential form where the next shift or reduce
15452operation will occur
154532.
15454It is non-terminal whose production will be used for reduction in the
15455next step
154563.
15457It is a production that may be used for reduction in a future step
15458along with a position in the sentential form where the next shift or
15459reduce operation will occur
154604.
15461It is the production p that will be used for reduction in the next step
15462along with a position in the sentential form where the right hand side
15463of the production may be found
154644.0
154651225 Which of the following explains cookies nature? 1.Non Volatile 2.Volatile 3.Intransient 4.Transient 3.0
15466S.NO. Questions Choices Answers
154671226 Which of the following file access method needs a relative block number 'n'?
154681.
15469Contiguous allocation
154702.
15471Linked allocation
154723.
15473Direct access
154744.
15475Sequential access
154763.0
154771227 Which of the following function is used to terminate the script execution in PHP?
154781.
15479break()
154802.
15481quit()
154823.
15483die()
154844.
15485exit()
154862.0
154871228 Which of the following function sets first n characters of a string to a given character? 1.strset() 2.strnset() 3.strinit() 4.strcset() 1.0
154881229
15489Which of the following grammar rules violate the requirements of an operator grammar ? P, Q, R are
15490nonterminals, and r, s, t are terminals.
154911. P → Q R
154922. P → Q s R
154933. P → ε
154944. P → Q t R r
154951.
154961 and 3 only
154972.
154981 only
154993.
155002 and 3 only
155014.
155021,2,3 and 4 only
155031.0
155041230 which of the following intermediate language can be used in intermediate code
15505generation?
155061.Postfix notation and Three address code 2.Quadraples 3.Triples
155074.Infix notation and two address code
155083.0
155091231 Which of the following is a black box testing strategy?
155101.
15511All Statements Coverage
155122.
15513Control Structure Coverage
155143.
15515Cause-Effect Graphs
155164.
15517ALL
155184.0
155191232 Which of the following is a comparison operator in SQL?
155201.
15521=
155222.
15523LIKE
155243.
15525BETWEEN
155264.
15527all of the options
155282.0
15529S.NO. Questions Choices Answers
155301233
15531Which of the following is a dynamic model that shows how the system interacts with its
15532environment as it is used?
155331.
15534system context model
155352.
15536interaction model
155373.
15538environmental model
155394.
15540both system context and interaction
155412.0
155421234 Which of the following is a legal expression in SQL?
155431.
15544SELECT NULL FROM EMPLOYEE;
155452.
15546SELECT NAME FROM EMPLOYEE;
155473.
15548SELECT NAME FROM EMPLOYEE WHERE SALARY = NULL;
155494.
15550None of the options
155514.0
155521235 Which of the following is a problem of file management system?
155531.
15554difficult to update
155552.
15556lack of data independence
155573.
15558data redundancy
155594.
15560all options given
155614.0
155621236
15563Which of the following is a project scheduling method that can be applied to software
15564development?
155651.
15566PERT
155672.
15568CPM
155693.
15570CMM
155714.
15572both PERT and CPM
155731.0
155741237 Which of the following is a wrong example of network layer
155751.X.25 level 2-ISO 2.Source routing and Domains Naming Usenet
155763.X.25 packet land protocols (PLP-ISO) 4.Internet protocol (I/P)
15577ARPA NET
155782.0
155791238 which of the following is an incorrect definition inside a class ?
155801.void * operator new(size_t size) { } 2.void * operator new () { }
155813.void operator delete(void * ptr) { } 4.int operator ++() { }
155822.0
155831239 which of the following is an incorrect definition inside a class ?
155841.void * operator new(size_t size) { } 2.void * operator new () { }
155853.void operator delete(void * ptr) { } 4.int operator ++() { }
155861.0
155871240 Which of the following is false for cin?
155881.It is a class of which stream is an object. 2.Using cin, the data can
15589be read from user's terminal. 3.It represents standard input. 4.It is an
15590object of istream class.
155914.0
155921241 Which of the following is golden rule for interface design?
155931.
15594Place the user in control
155952.
15596Reduce the user’s memory load
155973.
15598Make the interface consistent
155994.
15600ALL
156013.0
15602S.NO. Questions Choices Answers
156031242 Which of the following is lowest in memory hierarchy?
156041.
15605Cache memory
156062.
15607Secondary memory
156083.
15609Registers
156104.
15611RAM
156124.0
156131243 Which of the following is not a binary operator in relational algebra?
156141.
15615Join
156162.
15617Semi-Join
156183.
15619Assignment
156204.
15621Project
156223.0
156231244 Which of the following is not a form of memory ?
156241.
15625Instruction cache
156262.
15627Instruction register
156283.
15629Instruction opcode
156304.
15631Translation-a-side buffer
156324.0
156331245 Which of the following is not a property of a transaction?
156341.
15635atomicity
156362.
15637consistency
156383.
15639dirty read
156404.
15641durability
156422.0
15643S.NO. Questions Choices Answers
156441246 Which of the following is not a SQA plan for a project?
156451.
15646evaluations to be performed
156472.
15648amount of technical work
156493.
15650audits and reviews to be performed
156514.
15652documents to be produced by the SQA group
156534.0
156541247 Which of the following is not a valid attribute of the INPUT tag? 1.TEXT 2.NAME 3.SIZE 4.MAXLENGTH 3.0
156551248 Which of the following is NOT a valid PHP comparison operator? 1.!= 2.>= 3.&&& 4.=== 4.0
156561249 Which of the following is not an example of infrastructure components that may need to
15657be integrated into the software architecture?
156581.
15659Communications components
156602.
15661Database components
156623.
15663Interface components
156644.
15665Memory management components
156662.0
156671250 Which of the following is not characteristics of a relational database model
156681.Complex logical relationships 2.Treelike structure 3.Tables
156694.Records
156704.0
156711251 Which of the following is not considered as a risk in project management?
156721.
15673Specification delays
156742.
15675Product competition
156763.
15677Testing
156784.
15679Staff turnover
156804.0
156811252 Which of the following is not hardware:
156821.
15683Magnetic tape
156842.
15685Printer
156863.
15687VDU terminal
156884.
15689Assembler
156903.0
156911253 Which of the following is not one of Hooker's core principles of software engineering
15692practice?
156931.
15694All design should be as simple as possible, but no simpler
156952.
15696A software system exists only to provide value to its users.
156973.
15698Pareto principle (20% of any product requires 80% of the effort)
156994.
15700Remember that you produce others will consume
157013.0
15702S.NO. Questions Choices Answers
157031254 Which of the following is not one of the principles of good coding?
157041.
15705Create unit tests before you begin coding
157062.
15707Create a visual layout that aids understanding
157083.
15709Keep variable names short so that code is compact
157104.
15711Write self-documenting code, not program documentation
157124.0
157131255 Which of the following is not possible using PHP?
157141.Deleting files from the server 2.Redirect a visitor to another page
157153.Set the value of the window statusbar 4.Obtain the IP address of a
15716Visitor
157174.0
157181256 Which of the following is not the attribute of FCB?
157191.
15720File permissions
157212.
15722Program Counter
157233.
15724Access Control List
157254.
15726Pointers to file control blocks
157274.0
157281257 Which of the following is not the characteristic of constructor?
157291.They should be declared in the public section.
15730. 2.They do not have return type. 3.They can not be inherited. 4.They
15731can be virtual.
157323.0
157331258 Which of the following is the best type of module cohesion?
157341.
15735Functional Cohesion
157362.
15737Temporal Cohesion
157383.
15739Functional Cohesion
157404.
15741Sequential Cohesion
157423.0
157431259 Which of the following is the worst type of module coupling?
157441.
15745Control Coupling
157462.
15747Stamp Coupling
157483.
15749External Coupling
157504.
15751Content Coupling
157521.0
157531260 Which of the following is TRUE?
157541.
15755Every subset of a regular set is regular.
157562.
15757Every finite subset of a non-regular set is regular.
157583.
15759Every finite subset of a non-regular set is regular.
157604.
15761Infinite union of finite sets is regular.
157621.0
15763S.NO. Questions Choices Answers
157641261 Which of the following is true?
157651.
15766The complement of a recursive language is recursive.
157672.
15768The complement of a recursively enumerable language is
15769recursively enumerable
157703.
15771The complement of a recursive language is either recursive or
15772recursively enumerable
157734.
15774The complement of a context-free language is context-free
157753.0
157761262 Which of the following is TRUE?
157771.
15778Every relation in 2NF is also in BCNF
157792.
15780A relation R is in 3NF if every non-prime attribute of R is fully
15781functionally dependent on every key of R
157823.
15783Every relation in BCNF is also in 3NF
157844.
15785No relation can be in both BCNF and 3NF
157862.0
157871263
15788Which of the following is true?
157891.
15790Segmentation is faster than paging
157912.
15792Paging is faster than segmentation
157933.
15794Pages are unequal sized pieces
157954.
15796Segments are equal sized pieces
157972.0
157981264 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
157991265 Which of the following is valid reason for collecting customer feedback concerning
15800delivered software?
158011.
15802Do not allows developers to make changes to the delivered
15803increment
158042.
15805Delivery schedule can be revised to reflect changes
158063.
15807Developers can not identify changes to incorporate into next
15808increment
158094.Delivery schedule can't be revised to reflect changes
158104.0
158111266 Which of the following is/are the DDL statements?
158121.
15813Create
158142.
15815Drop
158163.
15817Alter
158184.
15819All of the options
158202.0
15821S.NO. Questions Choices Answers
158221267
15823Which of the following languages are context-free?
15824L1 = {a b a b ⎪ m, n ≥ 1}
15825L2 = {a b a b ⎪ m, n ≥ 1}
15826L3 = {a b ⎪ m = 2n + 1}
158271.L1 and L2 only 2.
15828L1 and L3 only
158293.
15830L3 only
158314.
15832L1 only
158331.0
158341268 Which of the following memory allocation scheme suffers from External fragmentation?
158351.
15836Segmentation
158372.
15838Pure Demand Paging
158393.
15840swapping
158414.
15842paging
158434.0
158441269 Which of the following most certainly implies the need for an entire table to implement?
158451.
15846A binary relationship
158472.
15848A ternary relationship
158493.
15850A recursive relationship
158514.
15852An identifying relationship
158531.0
158541270 Which of the following name does not relate to stacks? 1.FIFO lists 2.LIFO list 3.Push-down lists 4.Piles 1.0
158551271 Which of the following operation is used if we are interested in only certain columns of a
15856table?
158571.
15858PROJECTION
158592.
15860SELECTION
158613.
15862UNION
158634.
15864JOIN
158654.0
158661272 Which of the following operator can be overloaded through friend function? 1.-> 2.= 3.( ) 4.* 3.0
158671273 Which of the following operators has an associativity from Right to Left? 1.+= 2.== 3.<< 4.<= 3.0
158681274
15869Which of the following pattern is the basis of interaction management in many webbased
15870systems?
158711.
15872architecture
158732.
15874repository pattern
158753.
15876model-view-controller
158774.
15878different operating system
158792.0
15880S.NO. Questions Choices Answers
15881m n n m
15882m n m n
15883m n
158841275 Which of the following problems is undecidable?
158851.
15886Membership problem for CFGs
158872.
15888Ambiguity problem for CFGs.
158893.
15890Finiteness problem for FSAs
158914.
15892Equivalence problem for FSAs.
158931.0
158941276 Which of the following problems is undecidable?
158951.
15896Deciding if a given context-free grammar is ambiguous.
158972.
15898Deciding if a given string is generated by a given context-free
15899grammar
159003.
15901Deciding if the language generated by a given context-free grammar
15902is empty
159034.
15904Deciding if the language generated by a given context-free grammar
15905is finite.
159061.0
159071277
15908Which of the following process is concerned with analyzing the costs and benefits of
15909proposed changes?
159101.
15911Change management
159122.
15913Version management
159143.
15915System building
159164.
15917Release management
159181.0
159191278 Which of the following property allows you to specify an element’s position with respect
15920to the browser window?
159211.relative 2.fixed 3.static 4.absolute 1.0
159221279
15923Which of the following risk is the failure of a purchased component to perform as
15924expected?
159251.
15926Product risk
159272.
15928Project risk
159293.
15930Business risk
159314.
15932Programming risk
159334.0
159341280
15935Which of the following risks are derived from the organizational environment where the
15936software is being developed?
159371.
15938People risks
159392.
15940Technology risks
159413.
15942Estimation risks
159434.
15944Organizational risks
159452.0
15946S.NO. Questions Choices Answers
159471281
15948Which of the following risks are derived from the software or hardware technologies that
15949are used to develop the system?
159501.
15951Managerial risks
159522.
15953Technology risks
159543.
15955Estimation risks
159564.
15957Organizational risks
159584.0
159591282 Which of the following statements about queues is incorrect?
159601.Queues are first-in, first-out (FIFO) data structures 2.Queues can
15961be implemented using arrays 3.Queues can be implemented using
15962linked lists 4.New nodes can only be added at the front of the queue
159631.0
159641283 Which of the following statements are true in c++?
159651.Class members are public by default. 2.Structures can not have
15966functions as members. 3.Classes can not have data as public
15967members. 4.Structures can have functions
159682.0
159691284
15970Which of the following statements are TRUE?
15971I. There exist parsing algorithms for some programming languages
15972whose complexities are less than O(n ).
15973II. A programming language which allows recursion can be implemented
15974with static storage allocation.
15975III. No L-attributed definition can be evaluated in The framework
15976of bottom-up parsing.
15977IV. Code improving transformations can be performed at both source
15978language and intermediate code level.
159791.
15980I and II
159812.
15982I and IV
159833.
15984III and IV
159854.
15986I, II and III
159871.0
159881285 Which of the following statements best describes the operation of a synchronous up-
15989/down-counter?
159901.In general, the counter can be reversed at any point in its counting
15991sequence. 2.The counter can be reversed, but must be reset before
15992counting in the other direction. 3.The counter can count in either
15993direction, but must continue in that direction once started. 4.The
15994count sequence cannot be reversed, once it has begun, without first
15995resetting the counter to zero.
159961.0
159971286 Which of the following statements explains portabililty in non-functional requirements?
159981.
15999It is a degree to which software running on one platform can easily
16000be converted to run on another platform.
160012.
16002It can be enhanced by using languages, OS’ and tools that are
16003universally available and standardized.
160043.
16005The ability of the system to behave consistently in a user-acceptable
16006manner when operating within the environment for which the system
16007was intended.
160084.
16009It is a degree to which software running on one platform can easily
16010be converted to run on another platform as well as It can be
16011enhanced by using languages, OS’ and tools that are universally
16012available and standardized.
160134.0
160141287 Which of the following statements is false?
160151.
16016Every NFA can be converted to an equivalent DFA
160172.
16018Every non-deterministic Turing machine can be converted to an
16019equivalent deterministic Turing machine
160203.
16021Every regular language is also a context-free language
160224.
16023Every subset of a recursively enumerable set is recursive
160243.0
16025S.NO. Questions Choices Answers
160263
160271288 Which of the following statements is NOT valid about operator overloading?
160281.Overloaded operator must have at least one operand of its class
16029type. 2.Only existing operators can be overloaded. 3.The overloaded
16030operators follow the syntax rules of the original operator. 4.The arity
16031of the operator can be changed
160324.0
160331289 Which of the following statements is NOT valid about operator overloading?
160341.Overloaded operator must have at least one operand of its class
16035type. 2.Only existing operators can be overloaded. 3.The overloaded
16036operators follow the syntax rules of the original operator. 4.The arity
16037of the operator can be changed
160384.0
160391290 Which of the following statements is true?
160401.An INPUT field of type password provides excellent security 2.An
16041INPUT field of type password provides a masked field but no real
16042security 3.A maximum length can not be set for a password field 4.A
16043password INPUT field can only be included in a FORM that uses the
16044get METHOD
160452.0
160461291 Which of the following statements is true?
160471.Quadraples have some disadvantages over triples notation for an
16048optimizing compiler 2.For optimizing compiler, moving a statement
16049that defines a temporary value requires us to change all references
16050to that statements. It is an overhead for triples notation 3.For
16051optimizing compiler, triples notation has important benefit where
16052statements are often moved around as it incurs no movements or
16053change 4.All the statements are false
160541.0
160551292
16056Which of the following statements is/are TRUE for an undirected graph?P:Number of
16057odd degree vertices is even,Q: Sum of degrees of all vertices is even
160581.P Only 2.Q Only 3.Both P and Q 4.Neither P nor Q 1.0
160591293 Which of the following statements is/are TRUE for an undirected graph?P:Number of
16060odd degree vertices is even,Q: Sum of degrees of all vertices is even
160611.P Only 2.Q Only 3.Both P and Q 4.Neither P nor Q 2.0
160621294 Which of the following strategies means that the impact of the risk will be reduced?
160631.
16064Avoidance strategies
160652.
16066Minimization strategies
160673.
16068Contingency plans
160694.
16070ALL
160714.0
160721295 Which of the following system calls results in the sending of SYN packets?
160731.
16074socket
160752.
16076bind
160773.
16078listen
160794.
16080connect
160811.0
160821296 Which of the following term is best defined by the statement “The creation of a new
16083codeline from a version in an existing codeline”?
160841.
16085Branching
160862.
16087Merging
160883.
16089Codeline
160904.
16091Mainline
160923.0
16093S.NO. Questions Choices Answers
160941297
16095Which of the following term is best defined by the statement: “Derive traceability
16096information to maximize information hiding in the design.”?
160971.
16098Underestimated development time
160992.
16100Organizational restructuring
161013.
16102Requirements changes
161034.
16104None
161051.0
161061298
16107Which of the following term is best defined by the statement: “The underlying technology
16108on which the system is built is superseded by new technology.”?
161091.
16110Technology change
161112.
16112Product competition
161133.
16114Requirements change
161154.
16116None
161173.0
161181299
16119Which of the following term is best defined by the statement: “There will be a change of
16120organizational management with different priorities.”?
161211.
16122Staff turnover
161232.
16124Technology change
161253.
16126Management change
161274.
16128Product competition
161294.0
161301300 Which of the following traits need to exist among the members of an agile software
16131team?
161321.
16133Competence
161342.
16135Decision-making ability
161363.
16137Mutual trust and respect
161384.
16139ALL
161404.0
161411301 Which of the following tree may have smaller elements in its left subtree and larger
16142element in its right subtree
161431.B+ Tree 2.AVL Tree 3.Binary tree 4.Binary search Tree 3.0
161441302 Which of the following ways below is correct to write a CSS?
161451.p {color:red;text-align:center}; 2.p {color:red;text-align:center} 3.p
16146{color:red;text-align:center;} 4.p (color:red;text-align:center;)
161472.0
161481303 Which of the following would cause quickest access
161491.
16150direct access from a magnetic tape
161512.
16152direct access from a hard disk
161533.
16154direct access from a floppy disk
161554.
16156direct access from a cassette tape
161573.0
16158S.NO. Questions Choices Answers
161591304
16160Which of the regular expressions given below represent the following DFA?
16161I) 0*1(1+00*1)*
16162II) 0*1*1+11*0*1
16163III) (0+1)*1
161641.
16165I and II only
161662.
16167I and III only
161683.
16169II and III only
161704.
16171I,II,III
161723.0
161731305 Which of these contains an executable statement?
161741.// var a = 0; // var b = 0; 2./* var a = 0; // var b = 0; */ 3./* var a = 0; */
16175var b = 0; 4.// var a = 0; /* var b = 0; */
161764.0
161771306 Which of these does not belong to the basic principles of good product design ?
161781.
16179Adequacy
161802.
16181Feasibility
161823.
16183Portability
161844.
16185Economy
161861.0
161871307 Which of these framework activities is not normally associated with the user interface
16188design processes?
161891.
16190cost estimation
161912.
16192interface construction
161933.
16194interface validation
161954.
16196user and task analysis
161973.0
161981308 Which of these is incorrect ?
161991.
16200Software engineering belongs to Computer science
162012.
16202Software engineering is a part of more general form of System
16203Engineering
162043.
16205Computer science belongs to Software engineering
162064.
16207Software engineering is concerned with the practicalities of
16208developing and delivering useful software
162094.0
162101309 Which of these is not an element of an object-oriented analysis model?
162111.
16212Behavioral elements
162132.
16214Class-based elements
162153.
16216Data elements
162174.
16218Scenario-based elements
162191.0
162201310 Which of these sets of HTML5 attributes can be used for form validation?
162211.required, pattern, min and max 2.auto, fixed, number 3.number,
16222text, currency 4.input, radio,checkbox
162233.0
162241311 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 4.0
162251312 Which one of the following is currently the most popular data model?
162261.Network Model
162272.Object Model 3.Notation Model
162284.Relational Model
162292.0
16230S.NO. Questions Choices Answers
162311313 Which one of the file allocation scheme cannot be adopted for dynamic storage
16232allocation
162331.
16234Linked allocation
162352.
16236Fixed Indexed allocation
162373.
16238Variable Indexed allocation
162394.
16240Contiguous allocation
162413.0
162421314 Which one of the following algorithm is not used in asymmetric-key cryptography?
162431.
16244RSA algorithm
162452.
16246diffie-hellman algorithm
162473.
16248electronic code book algorithm
162494.
16250ECC
162513.0
162521315 Which one of the following allows a user at one site to establish a connection to another
16253site and then pass keystrokes from local host to remote host?
162541.
16255HTTP
162562.
16257FTP
162583.
16259telnet
162604.
16261none of the mentioned
162621.0
162631316 Which one of the following correctly describes the meaning of 'namespace' feature in
16264C++?
162651.namespaces provide facilities for organizing the names in a
16266program to avoid name clashes 2.Namespaces refer to space
16267between the names in a program 3.Namespaces refer to the memory
16268space allocated for names used in a program 4.Namespaces refer to
16269the space for names.
162701.0
162711317 Which one of the following event is not possible in wireless LAN.
162721.
16273collision detection
162742.
16275Acknowledgement of data frames
162763.
16277multi-mode data transmission
162784.
16279none of the mentioned
162802.0
162811318 Which one of the following is a cryptographic protocol used to secure HTTP
16282connection?
162831.
16284stream control transmission protocol (SCTP)
162852.
16286transport layer security (TSL)
162873.
16288explicit congestion notification (ECN)
162894.
16290resource reservation protocol
162912.0
16292S.NO. Questions Choices Answers
162931319 Which one of the following is a requirement that fits in a developer’s module ?
162941.
16295Availability
162962.
16297Testability
162983.
16299Usability
163004.
16301Flexibility
163022.0
163031320 Which one of the following is an internet standard protocol for managing devices on IP
16304network?
163051.
16306dynamic host configuration protocol
163072.
16308simple network management protocol
163093.
16310internet message access protocol
163114.
16312media gateway protocol
163132.0
163141321 Which one of the following is FALSE?
163151.
16316A basic block is a sequence of instructions where control enters the
16317sequence at the beginning and exits at the end.
163182.
16319Available expression analysis can be used for common
16320subexpression elimination.
163213.
16322Live variable analysis can be used for dead code elimination.
163234.
16324x = 4 ∗ 5 => x = 20 is an example of common subexpression
16325elimination.
163264.0
163271322 Which one of the following is FALSE?
163281.
16329There is unique minimal DFA for every regular language
163302.
16331Every NFA can be converted to an equivalent PDA
163323.
16333Complement of every context-free language is recursive
163344.
16335Every nondeterministic PDA can be converted to an equivalent
16336deterministic PDA
163372.0
163381323 Which one of the following is not a step of requirement engineering?
163391.
16340Elicitation
163412.
16342Design a model
163433.
16344Analysis
163454.
16346Documentation
163474.0
16348S.NO. Questions Choices Answers
163491324 Which one of the following is not a windows file system?
163501.
16351FAT
163522.
16353NTFS
163543.
16355FAT32
163564.
16357EXT
163583.0
163591325 Which one of the following is not an application layer protocol?
163601.
16361media gateway protocol
163622.
16363dynamic host configuration protocol
163643.
16365resource reservation protocol
163664.
16367session initiation protocol
163683.0
163691326 Which one of the following is not correct?
163701.
16371application layer protocols are used by both source and destination
16372devices during a communication session
163732.
16374application layer protocols implemented on the source and
16375destination host must match
163763.
16377both the options
163784.
163794.0
163801327
16381Which one of the following is not the process of Deadlock Recovery?
163821.
16383Killing a process
163842.
16385Rollback to the previous state
163863.
16387Selecting a Victim
163884.
16389Delaying the process
163902.0
163911328 Which one of the following is not the responsibility of the DBA?
163921.provide security
163932.develop applications
163943.periodically tunes the database
163954.restores the system after a failure
163961.0
163971329
16398Which one of the following is the recurrence equation for the worst case time complexity
16399of the Quicksort algorithm for sorting n>=2 numbers? In the recurrence equations given
16400in the options below, c is a constant.
164011.T(n)=2T(n/2)+cn 2.T(n)=T(n–1)+T(0)+cn 3.T(n)=T(n/2)+cn
164024.T(n)=2T(n–2)+cn
164033.0
164041330 Which one of the following is the very first task executed by a session enabled page?
164051.Delete the previous session 2.Start a new session 3.Check
16406whether a valid session exists 4.Handle the session
164073.0
16408S.NO. Questions Choices Answers
164091331 Which one of the following is True at any valid state in shift-reduce parsing?
164101.
16411Viable prefixes appear only at the bottom of the stack and not inside
164122.
16413Viable prefixes appear only at the top of the stack and not inside
164143.
16415The stack contains only a set of viable prefixes
164164.
16417The stack never contains viable prefixes
164182.0
164191332 Which one of the following is used as the start frame delimeter in ethernet frame?
164201.
1642110101010
164222.
1642310101011
164243.
1642500000000
164264.
1642711111111
164283.0
164291333 Which one of the following languages over the alphabet {0,1} is described by the regular expression:
16430(0+1)*0(0+1)*0(0+1)*?
164311.
16432The set of all strings containing the substring 00.
164332.
16434The set of all strings containing at most two 0’s.
164353.
16436The set of all strings containing at least two 0’s.
164374.
16438The set of all strings that begin and end with either 0 or 1.
164394.0
164401334 Which one of the following models is not suitable for accommodating any change?
164411.
16442Build & Fix Model
164432.
16444Prototyping Model
164453.
16446RAD model
164474.
16448Waterfall Model
164494.0
164501335 Which one of the following modulation scheme is supported by WiMAX?
164511.
16452binary phase shift keying modulation
164532.
16454quadrature phase shift keying modulation
164553.
16456quadrature amplitude modulation
164574.
16458all of the mentioned
164591.0
16460S.NO. Questions Choices Answers
164611336 Which one of the following protocol delivers/stores mail to reciever server?
164621.
16463simple mail transfer protocol
164642.
16465post office protocol
164663.
16467internet mail access protocol
164684.
16469hypertext transfer protocol
1647014.0
164711337
16472Which one of the following regular expressions over {0, 1} denotes the set of all strings
16473not containing 100 as a substring (a) 0*(11)*0* (b) (0*1010)* (c) 0*1*010 (d) 0*
16474(10)*01*
164751.
16476a and b
164772.
16478b and c
164793.
16480only c
164814.
16482only b
164834.0
164841338 Which one of the following statements if FALSE?
164851.
16486Any relation with two attributes is in BCNF
164872.
16488A relation in which every key has only one attribute is in 2NF
164893.
16490A prime attribute can be transitively dependent on a key in a 3 NF
16491relation.
164924.
16493A prime attribute can be transitively dependent on a key in a BCNF
16494relation.
164952.0
164961339 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 4.0
164971340 Which property is used to obtain browser vendor and version information? 1.modal 2.version 3.browser 4.navigator 1.0
164981341 Which protocol is a signalling communication protocol used for controlling multimedia
16499communication sessions?
165001.
16501session initiation protocol
165022.
16503session modelling protocol
165043.
16505session maintenance protocol
165064.
16507none of the mentioned
165081.0
165091342 Which question no longer concerns the modern software engineer?
165101.
16511Why does computer hardware cost so much?
165122.
16513Why does software take a long time to finish?
165143.
16515Why does it cost so much to develop a piece of software?
165164.
16517Why can't software errors be removed from products prior to
16518delivery?
165192.0
165201343 Which searching technique is better, if unsorted array is given as input
165211.Radix search 2.Linear search 3.Binary search 4.Indexd sequential
16522search
165233.0
165241344 Which segments of a seven-segment display would be active to display the decimal
16525digit 2?
165261.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,
16527and f
165282.0
16529S.NO. Questions Choices Answers
165301345 Which SQL functions is used to count the number of rows in a SQL query?
165311.
16532Sum
165332.
16534Count
165353.
16536Max
165374.
16538ALL
165393.0
165401346 Which statement does not require semicolon?
165411.
16542goto xyz
165432.
16544int x = 20
165453.
16546#define MAX 100
165474.
16548do {... }while(count<=100)
165491.0
165501347 Which statement is true:
165511.Standard form must consists of minterms 2.All standard form are
16552canonical forms 3.Canonical form can consist of a term with a literal
16553missing 4.All canonical form are standard form
165543.0
165551348 Which transmission media has the highest transmission speed in a network?
165561.
16557coaxial cable
165582.
16559twisted pair cable
165603.
16561optical fiber
165624.
16563electrical cable
165642.0
165651349 Which of these is a stand alone tag?
165661.
16567form
165682.
16569frame
165703.
16571table
165724.
16573anchor
165742.0
165751350 While inserting the elements 71,65,84,69,67,83 in an empty binary search tree(BST)in
16576the sequence shown, the element in the lowest level is
165771.65 2.67 3.83 4.69 3.0
165781351 Why 'critical section' is not imposed on file systems instead 'file locks' when more than
16579one process tries to access the file?
165801.
16581Time consuming
165822.
16583Process entered in to critical section may close the file
165843.
16585we cannot satify the three conditions of mutual exclusion, progress
16586and bounded waiting
165874.
16588we cannot use semaphore
165891.0
16590S.NO. Questions Choices Answers
165911352 WiMAX MAC layer provides an interface between
165921.
16593higher transport layers and physical layer
165942.
16595application layer and network layer
165963.
16597data link layer and network layer
165984.
16599none of the mentioned
166002.0
166011353 WiMAX provides
166021.
16603simplex communication
166042.
16605half duplex communication
166063.
16607full duplex communication
166084.
16609none of the mentioned
166102.0
166111354 WiMAX stands for
166121.
16613wireless maximum communication
166142.
16615worldwide interoperability for microwave access
166163.
16617worldwide international standard for microwave access
166184.
16619none of the mentioned
166201.0
166211355 WiMAX uses the
166221.
16623orthogonal frequency division multiplexing
166242.
16625time division multiplexing
166263.
16627space division multiplexing
166284.
16629all of the mentioned
166304.0
166311356 Wireless transmission can be done via
166321.
16633radio waves
166342.
16635microwaves
166363.
16637infrared
166384.
16639all of the mentioned
166404.0
16641S.NO. Questions Choices Answers
166421357 Write Through technique is used in which memory for updating the data _____.
166431.
16644Virtual memory
166452.
16646Main memory
166473.
16648Auxiliary memory
166494.
16650Cache memory
166514.0
166521358 You can find the element you want to manipulate by ________ way?
166531.getElementById() 2.getElementsByTagName()
166543.getElementsByClassName() 4.All of the these
166553.0
166561359
16657You have an array of n elements, Suppose you implement quicksort by always choosing
16658the central element of the array as the pivot, Then the tightest upper bound for the worst
16659case performance is
166601.O(log n) 2.O(n) 3.O(n^2) 4.O(1) 4.0
166611360
16662You have to sort a list L consisting of a sorted list followed by a few “random”
16663elements.Which of the following sorting methods would be especially suitable for such a
16664task?
166651.Bubble sort 2.Selection sort 3.Quick sort 4.Insertion sort 1.0
166661361 You need to check the size of a file in PHP function. $size = X(filename); Which function
16667will suitably replace 'X'?
166681.
16669filesize
166702.
16671size
166723.
16673sizeofFile
166744.
16675getSize
166761.0
166771362 ‘Aging registers’ are _______.
166781.
16679Counters which indicate how long ago their associated pages have
16680been referenced.
166812.
16682Registers which keep track of when the program was last accessed
166833.
16684Counters to keep track of last accessed instruction
166854.
16686Counters to keep track of the latest data structures referred
16687S.NO. Questions Choices Answers