Option A. TRUE Option B. FALSE Option C. Option D. True Answer B
Option A. TRUE Option B. FALSE Option C. Option D. True Answer A
What will be the output of the following Python code?
x = ['ab', 'cd'] for i in x: x.append(i.upper()) print(x)
Option A. [‘AB’, ‘CD’] Option B. [‘ab’, ‘cd’, ‘AB’, ‘CD’] Option C. [‘ab’, ‘cd’] Option D. none of the mentioned True Answer D
Option A. Which directly understood by a computer Option B. Which needs to be translated Option C. Which uses mnemonics Option D. In which programs are written first. True Answer A
Option A. Abacus Option B. Clock Option C. calculator Option D. None of these. True Answer A
Abacus, plural abaci or abacuses, calculating device, probably of Babylonian origin, that was long important in commerce. It is the ancestor of the modern calculating machine and computer.
Option A. yes Option B. no Option C. machine dependent Option D. none of the mentioned True Answer A
>>> a={i: 'A' + str(i) for i in range(5)}
>>> a
Option A. An exception is thrown Option B. {0: ‘A0’, 1: ‘A1’, 2: ‘A2’, 3: ‘A3’, 4: ‘A4’} Option C. {0: ‘A’, 1: ‘A’, 2: ‘A’, 3: ‘A’, 4: ‘A’} Option D. {0: ‘0’, 1: ‘1’, 2: ‘2’, 3: ‘3’, 4: ‘4’} True Answer D
Option A. 3 Option B. 4 Option C. 5 Option D. 6 True Answer D
r = e – v + 2 for bound + non bound r = e – v + 2 – 1 for bounded r = 15 – 10 + 2 – 1 r = 6
Which one of the following problems is undecidable?
Option A. Deciding if a given context-free grammar is ambiguous. Option B. Deciding if a given string is generated by a given context-free grammar. Option C. Deciding if the language generated by a given context-free grammar is empty. Option D. Deciding if the language generated by a given context-free grammar is finite. True Answer A
There were algorithms to find the membership of CFG (using CYK algorithm) and finiteness of CFG (using CNF graph) and emptiness. But there is no algorithm for ambiguity of CFG, so it is undecidable.
Option A. Machine Language. Option B. Application Software. Option C. System Program. Option D. Assembly language. True Answer A
Option A. XML Format Option B. ASCII Format Option C. SDF Format Option D. PDF Format True Answer A
Option A. Margin Option B. Header Option C. Orientation Option D. Gutter True Answer A
Option A. Slide Transition Option B. Slide Design Option C. Animation Objects Option D. Animation Scheme True Answer A
Language is defined by the grammar: Language is defined by the grammar: Consider the following statements: P: is regular Q: L2 is regular Which one of the following is TRUE?
Option A. Both P and Q are true Option B. P is true and Q is false Option C. P is false and Q is true Option D. Both P and Q are false True Answer C
CFL but not regular
Option A. 0 Option B. 1 Option C. 5 Option D. 10 True Answer B
One (1) is a default value for Step value in Fill Series
Option A. Value of elements in array Option B. First element of the array Option C. Base address of the array Option D. Address of the last element of array True Answer C
Option A. Pageup Option B. Pagedown Option C. Ctrl + Down Arrow Option D. End Key True Answer B
Option A. Credit card Option B. NEFT Option C. Cheque Option D. All of the above True Answer A
Option A. Windows 98 Option B. MS DOS Option C. Windows XP Option D. Windows NT True Answer B
Option A. Bjarne Stroustrup Option B. James A. Gosling Option C. Dennis Ritchie Option D. Dr. E.F. Codd True Answer C
C programming language was developed in 1972 by Dennis Ritchie at bell laboratories of AT&T (American Telephone & Telegraph), located in the U.S.A. Dennis Ritchie is known as the founder of the c language. It was developed to overcome the problems of previous languages such as B, BCPL, etc.