1. What is the complement of the language accepted by the NFA shown below? Assume Σ = {a} and is the
empty string
empty string
2. The protocol data unit (PDU) for the application layer in the Internet stack is
(A) Segment
(B) Datagram
(C) Message
(D) Frame
(B) Datagram
(C) Message
(D) Frame
3. A process executes the code
Fork ();
Fork ();
Fork ();
The total number of child processes created is
(A) 3
(B) 4
(C) 7
(D) 8
Fork ();
Fork ();
Fork ();
The total number of child processes created is
(A) 3
(B) 4
(C) 7
(D) 8
4. The decimal value 0.5 in IEEE single precision floating point representation has
(A) Fraction bits of 000…000 and exponent value of 0
(B) Fraction bits of 000…000 and exponents value of -1
(C) Fraction bits of 000…000 and exponents value of -1
(D) No exact representation
(A) Fraction bits of 000…000 and exponent value of 0
(B) Fraction bits of 000…000 and exponents value of -1
(C) Fraction bits of 000…000 and exponents value of -1
(D) No exact representation
5. The worst case running time to search for an element in a balanced in a binary search tree with v2”
elements is
(A) Θ(n log n)
(B) Θ (n2n)
(C) Θ (n)
(D) Θ (log n)
elements is
(A) Θ(n log n)
(B) Θ (n2n)
(C) Θ (n)
(D) Θ (log n)
All the Best!!!
Related Posts:
- Financial assistance
- Employment opportunities in IITM CSE Department
- IITM Financial Assistance for MTech Programmes
- GATE Information Technology Syllabus
- GATE Question of the Day – General Aptitude and Mathematics Question
- GATE Computer Science Syllabus
- Financial assistance for M.Tech.Programmes
- GATE Question of the Day – General Aptitude Question
- PSU Recruitment through GATE Exam Score
- GATE Exam Preparation
No comments:
Post a Comment