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 36
Page 2
... input , then the following program fragment char x , y , printf ( " % d " , scanf ( " % c % c % c " , & x , ky , & z ) ) ; results in ( a ) a syntax error ( c ) segmentation violation * 14 . Consider the statements putchar ( getchar ...
... input , then the following program fragment char x , y , printf ( " % d " , scanf ( " % c % c % c " , & x , ky , & z ) ) ; results in ( a ) a syntax error ( c ) segmentation violation * 14 . Consider the statements putchar ( getchar ...
Page 3
Second Edition Timothy J Williams. If b is the input , the output will be ( a ) an error message ( c ) ab ( b ) this can't be the input ( d ) a b 15. Let a , b be two positive integers . Which of the following options correctly relates ...
Second Edition Timothy J Williams. If b is the input , the output will be ( a ) an error message ( c ) ab ( b ) this can't be the input ( d ) a b 15. Let a , b be two positive integers . Which of the following options correctly relates ...
Page 18
... input data * 128 . The following program main ( ) ( int a = 4 ; } change ( a ) ; printf ( " % d " , a ) ; change ( a ) int a ; { printf ( " % d " , ++ a ) ; } outputs ( a ) 55 ( b ) 45 ( c ) 54 ( d ) 44 129. Choose the best answer ...
... input data * 128 . The following program main ( ) ( int a = 4 ; } change ( a ) ; printf ( " % d " , a ) ; change ( a ) int a ; { printf ( " % d " , ++ a ) ; } outputs ( a ) 55 ( b ) 45 ( c ) 54 ( d ) 44 129. Choose the best answer ...
Page 24
... input , the output will be ( b ) abc ( a ) abcd 171. For the previous problem the function calls change ( x ) ; and change ( ptr ) ; ( a ) serves the same purpose ( c ) both the calls are illegal ( c ) efg ( d ) garbage ( b ) the second ...
... input , the output will be ( b ) abc ( a ) abcd 171. For the previous problem the function calls change ( x ) ; and change ( ptr ) ; ( a ) serves the same purpose ( c ) both the calls are illegal ( c ) efg ( d ) garbage ( b ) the second ...
Page 32
... input bits are 1 and 17 ( a ) or ( b ) 0xff3a ( b ) and 229. Preprocessing is typically done ( c ) exclusive or ( a ) either before or at the beginning of the compilation process ( b ) after compilation but before execution ( c ) after ...
... input bits are 1 and 17 ( a ) or ( b ) 0xff3a ( b ) and 229. Preprocessing is typically done ( c ) exclusive or ( a ) either before or at the beginning of the compilation process ( b ) after compilation but before execution ( c ) after ...
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