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 31
Page 2
... needed to swap the contents of two variables is ( a ) 1 ( b ) 2 7. The purpose of the following program fragment ( c ) 3 ( d ) 0 b b : b b b where s , bare two integers is to ( a ) transfer the contents of a to b ( b ) transfer the ...
... needed to swap the contents of two variables is ( a ) 1 ( b ) 2 7. The purpose of the following program fragment ( c ) 3 ( d ) 0 b b : b b b where s , bare two integers is to ( a ) transfer the contents of a to b ( b ) transfer the ...
Page 23
... needed will be proportional to the size of the data ( b ) execution will be faster ( c ) swapping process becomes easier and faster ( d ) none of the above 158. The statement int ** a ; ( a ) is illegal ( b ) is legal but meaningless ...
... needed will be proportional to the size of the data ( b ) execution will be faster ( c ) swapping process becomes easier and faster ( d ) none of the above 158. The statement int ** a ; ( a ) is illegal ( b ) is legal but meaningless ...
Page 29
... needed storage will be ( a ) 22.5 ( b ) 2.5 204. Bit field ( a ) is a field having many sub - fields ( d ) 12.5 ( b ) is a structure declaring the sizes of the members in terms of bits ( c ) is a member of a structure whose size is ...
... needed storage will be ( a ) 22.5 ( b ) 2.5 204. Bit field ( a ) is a field having many sub - fields ( d ) 12.5 ( b ) is a structure declaring the sizes of the members in terms of bits ( c ) is a member of a structure whose size is ...
Page 30
... needed for v is ( a ) 1 word ( b ) 2 words ( a ) 3 words ( b ) 4 words * 212 . The above declaration is ( a ) syntactically correct ( b ) semantically correct ( d ) none of the above ( c ) a misuse of bit - fields 213. Which of the ...
... needed for v is ( a ) 1 word ( b ) 2 words ( a ) 3 words ( b ) 4 words * 212 . The above declaration is ( a ) syntactically correct ( b ) semantically correct ( d ) none of the above ( c ) a misuse of bit - fields 213. Which of the ...
Page 41
... needed . So , this is indeed a misuse of bit - fields . ( 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 ...
... needed . So , this is indeed a misuse of bit - fields . ( 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 ...
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