MCQs in Computer Science: Second EditionThis book is designed for Computer Science students taking their GATE, GRE and other competitive examinations, e.g. examinations for Public Sector Undertakings and placement examinations for software firms. It can also act as a powerful self-evaluation tool for the students of Computer Science and Engineering, MCA, B.Sc.(Computer Science), BCA and PGDCA. Updated With:
Key Features:
|
From inside the book
Results 1-5 of 15
Page 37
... Refer Qn . 7 . 11. In signed magnitude form , one bit is dedicated to store the sign . ( e.g .. 1 for negative and 0 . otherwise ) . Only the remaining 15 bits are available to store the magnitude . Hence the answer . 12. Any function ...
... Refer Qn . 7 . 11. In signed magnitude form , one bit is dedicated to store the sign . ( e.g .. 1 for negative and 0 . otherwise ) . Only the remaining 15 bits are available to store the magnitude . Hence the answer . 12. Any function ...
Page 38
... an integer as a character , only the last 8 bits will be considered the rest chopped off . So , in this case the ASCII ... Refer Qn . 67 . 69. printf ( " az " ) prints az and Materiał chroniony prawem autorskim 38 MCQs in Computer Science.
... an integer as a character , only the last 8 bits will be considered the rest chopped off . So , in this case the ASCII ... Refer Qn . 67 . 69. printf ( " az " ) prints az and Materiał chroniony prawem autorskim 38 MCQs in Computer Science.
Page 39
... an infinite loop . The output will be az2byaz2by . 82. Refer Qn . 69 · Here the else clause will be executed . Since 2 0 is false , four4 will be printed . 83. The else clause has no brackets i.e. , { and } . This means the else clause ...
... an infinite loop . The output will be az2byaz2by . 82. Refer Qn . 69 · Here the else clause will be executed . Since 2 0 is false , four4 will be printed . 83. The else clause has no brackets i.e. , { and } . This means the else clause ...
Page 40
... ( Refer Qn . 128 ) 119. This involves recursion main ( ) calling itself . So , it keeps on printing tim 120. Since Madam is the required output , the function first ( ) , should print ' a ' , call the function second ( ) that prints the ...
... ( Refer Qn . 128 ) 119. This involves recursion main ( ) calling itself . So , it keeps on printing tim 120. Since Madam is the required output , the function first ( ) , should print ' a ' , call the function second ( ) that prints the ...
Page 41
... ( Refer Qn . 211 ) 217. Use of functions involves storing the current contents and branching to its starting address . These things add to the execution time . On the other hand , macro substitution increases the code size . This is of ...
... ( Refer Qn . 211 ) 217. Use of functions involves storing the current contents and branching to its starting address . These things add to the execution time . On the other hand , macro substitution increases the code size . This is of ...
Contents
1 | |
43 | |
Principles of Programming Languages | 76 |
Mathematical Foundations of Computer Science | 96 |
Operating Systems | 131 |
Automata Theory | 146 |
Principles of Compiler Design | 158 |
Computer Organization 171 | 173 |
Computer Graphics | 224 |
System Software | 235 |
Database Management Systems | 242 |
Object Oriented Programming Using C++ | 250 |
Computer Networks | 264 |
Software Engineering | 272 |
SQLPLUS SQL PLSQL Forms and Reports 279 | 278 |
Computer Science Question Paper for GATE 2005 | 315 |
Data Structures | 203 |
Other editions - View all
Common terms and phrases
a.out algorithm argument array assembly language B.OrderNum bits Boolean bytes char character chmod Choose the correct command compiler complement Consider the following contents correct answer correct statements declaration defined digits disk displayed DUAL equation equivalence relation error message evaluated execution file descriptor following program fragment following program main fork FORTRAN function garbage given grammar graph Hence the answer i-node implementation input Insertion sort instruction integer kernel language loop machine macro malloc matrix maximum Mealy machine memory minimum number mode needed nodes NULL odd number operands operating system option output page faults paise parameters PL/SQL pointer printf prints putchar query recursive Refer Qn regular expression roots shell script SIGINT sort SQL*Plus stack string symbols system calls termination tree true UNIX unsigned variable zero