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 88
Page 13
... given matrix x ( c ) doesn't alter the matrix x ( b ) makes the given matrix x , symmetric ( d ) none of the above 94. Which of the following features of C is meant to provide reliable access to special memory locations ? ( a ) ...
... given matrix x ( c ) doesn't alter the matrix x ( b ) makes the given matrix x , symmetric ( d ) none of the above 94. Which of the following features of C is meant to provide reliable access to special memory locations ? ( a ) ...
Page 15
... given below int hh — 16 ; stalic char wer [ } " NO SUBSTITUTE FOR HARD WORK " ; 107. printf ( " % 10.5s " , wer ) ; outputs ( a ) NO SU ( b ) NO SUBSTIT ( c ) NO SU ( d ) UTE F 108. printf ( " % - 10.5s " , wer ) ; outputs ( a ) NO SU ...
... given below int hh — 16 ; stalic char wer [ } " NO SUBSTITUTE FOR HARD WORK " ; 107. printf ( " % 10.5s " , wer ) ; outputs ( a ) NO SU ( b ) NO SUBSTIT ( c ) NO SU ( d ) UTE F 108. printf ( " % - 10.5s " , wer ) ; outputs ( a ) NO SU ...
Page 18
... given as arguments . Which of the following statements finds the largest of three given numbers ? ( a ) max ( max ( a , b ) , max ( a , ( b ) max ( a , max ( a , c ) ) c ) ) ( c ) max ( max ( a , b ) , max ( b , c ) ) ( d ) max ( b ...
... given as arguments . Which of the following statements finds the largest of three given numbers ? ( a ) max ( max ( a , b ) , max ( a , ( b ) max ( a , max ( a , c ) ) c ) ) ( c ) max ( max ( a , b ) , max ( b , c ) ) ( d ) max ( b ...
Page 27
... given file exists or not 192. If a file is opened in w + mode then ( a ) appending is possible ( b ) reading is possible ( c ) writing is possible ( d ) after write operation reading is possible without closing and re - opening . 193 ...
... given file exists or not 192. If a file is opened in w + mode then ( a ) appending is possible ( b ) reading is possible ( c ) writing is possible ( d ) after write operation reading is possible without closing and re - opening . 193 ...
Page 28
... given file exists or not . ( d ) needs 3 arguments 194. The statement Eseek ( fp , 0L , 0 ) ; 0 ) ; if syntactically correct , means ( a ) fp is a file pointer ( b ) position the read - write - head at the start of the file ( c ) ...
... given file exists or not . ( d ) needs 3 arguments 194. The statement Eseek ( fp , 0L , 0 ) ; 0 ) ; if syntactically correct , means ( a ) fp is a file pointer ( b ) position the read - write - head at the start of the file ( c ) ...
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