Contents
- 1 Computer Science Questions and Answers – Theory-based
- 1.0.1 1. The Gray code for the binary number 10111 is
- 1.0.2 2. The total number of a child process of the following code?
- 1.0.3 3. Which technique is based on Divide & Conquer rule ?
- 1.0.4 4. Go Back N ARQ window size?
- 1.0.5 5. Which is not an application layer?
- 1.0.6 6. Which Statement is False?
- 1.0.7 7. Which statement is False?
- 1.0.8 8. Push down automata used by
- 1.0.9 9. Lexical Analyzer is :
- 1.0.10 10. Which is compiled language?
Computer Science Questions and Answers – Theory-based
1. The Gray code for the binary number 10111 is
a) 10101
b) 11100
c) 00011
d) 00101
2. The total number of a child process of the following code?
for (i=0;i<5;i++)
fork();a) 31 b) 32 c) 2^n -2 d) 30
3. Which technique is based on Divide & Conquer rule ?
a) Merge sort
b) Quick sort
c) Insertion sort
d) Both a & b
4. Go Back N ARQ window size?
a) Ws = 2^n-1 b) Ws = 2^n-2
c) Ws = 2^n d) Ws = n-1
5. Which is not an application layer?
a) DNS & HTTP b) SMTP & POP
c) IMAP & FTP d) HTTP & UDP
6. Which Statement is False?
a) No. of port in Mesh Topology = (n-1) * n
b) No. of port in BUS Topology = 1
c) No. of ports in Ring Topology = 1*n
d) No. of ports in Star Topology = 1*n
7. Which statement is False?
a) Regular language accept by FInite Automata
b) CFL is accept by PDA
c) CSL is accept by LBA
d) RL is accept by TM
8. Push down automata used by
a) Lexical Analsyis
b) Syntax Analysis
c) Code Optimization
d) Code Generation
9. Lexical Analyzer is :
a) Second phase of compiler
b) First phase of compiler
c) Last phase of Compiler
10. Which is compiled language?
a) C & C++
b) Java & Python
c) R & Python
Read it – For programming MCQ