Time Left - 15:00 mins
Mission NIELIT Subjects Revision Test-3 (CN & TOC )
Attempt now to get your rank among 487 students!
Question 1
Which one of the following is not a client server application?
Question 2
Match the following:
Question 3
A RTT for a transmission is 200 microsec, bandwidth is 20 Mbps, window size is 100bits. Find the throughput in SWP.
Question 4
Determine the classof the classful IP address 32.46.7.3
Question 5
Which algorithm is mainly used in military applications to send and receive messages.
Question 6
TCP tries to
Question 7
Which one of the following socket API functions converts an unconnected active TCP socket into a passive socket?
Question 8
An IP machine Q has a path to another IP machine H via three IP routers R1, R2, and R3.
Q—R1—R2—R3—H
H acts as an HTTP server, and Q connects to H via HTTP and downloads a file. Session layer encryption is used, with DES as the shared key encryption protocol. Consider the following four pieces of information:
[I1] The URL of the file downloaded by Q
[I2] The TCP port numbers at Q and H
[I3] The IP addresses of Q and H
[I4] The link layer addresses of Q and H
Which of I1, I2, I3, and I4 can an intruder learn through sniffing at R2 alone?
Q—R1—R2—R3—H
H acts as an HTTP server, and Q connects to H via HTTP and downloads a file. Session layer encryption is used, with DES as the shared key encryption protocol. Consider the following four pieces of information:
[I1] The URL of the file downloaded by Q
[I2] The TCP port numbers at Q and H
[I3] The IP addresses of Q and H
[I4] The link layer addresses of Q and H
Which of I1, I2, I3, and I4 can an intruder learn through sniffing at R2 alone?
Question 9
Consider the grammar G:
S → aA⎪ε
A → aSbb
The language generated by G is ______
Question 10
Which of the following language is CFL?
Question 11
Which of the following is a regular language.
Question 12
Consider the following FSM.
Find the number of strings of length 5 accepted by the above machine.
Find the number of strings of length 5 accepted by the above machine.
Question 13
When does a PDA behaves like a Turing machine ?
Question 14
Which among the following is the only difference between Turing Machine and Finite Automaton ?
Question 15
Let G1, G2 be context-free grammars. Then L(G1) ∩ L(G2) = ∅
- 487 attempts
- 1 upvote
- 3 comments
Tags :
GATE & PSU CSMock TestsMay 18GATE & PSU CS