GATE Computer Science: Questions 851 - 857 of 913
Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.
Rs. 450.00 or
Question number: 851
Question
Parsing is also known for
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | Semantic analysis |
|
| b. | lexical analysis |
|
| c. | Syntax analysis |
|
| d. | All of the above |
|
Question number: 852
» Information Systems and Software Engineering » Process Life Cycle
Question
Software Engineering is a discipline that integrates ________ for the development of computer software.
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | Methods |
|
| b. | Process |
|
| c. | data |
|
| d. | Both a. and b. are correct |
|
Question number: 853
» Programming and Data Structures » Queues
Question
What is a queue?
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | Sequential organization of data |
|
| b. | Only data |
|
| c. | Random organization of data |
|
| d. | All of the above |
|
Question number: 854
» Operating System » Memory Management and Virtual Memory
Question
Demand paged memory allocation
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | allows deadlock tube detected in paging schemes |
|
| b. | allows the virtual address space to be independent of the physical memory |
|
| c. | is present only in Windows NT |
|
| d. | allows the virtual address space to be a multiple of the physical memory size |
|
Question number: 855
» Computer Networks » LAN Technologies (Ethernet, Token Ring)
Question
Two popular LAN technologies are Local Talk and:
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | Ethernet |
|
| b. | Windows NT Server |
|
| c. | Netware |
|
| d. | None of the above |
|
Question number: 856
» Algorithms » Basic Concepts of Complexity Classes P, NP, NP-Hard, NP-Complete
Question
NP-complete and in P respectively
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | Undecidable and NP-complete respectively |
|
| b. | NP - complete |
|
| c. | The problems 3-SAT and 2-SAT are |
|
| d. | in P |
|
Question number: 857
» Operating System » CPU Scheduling
Question
FIFO scheduling is …………………. .
Choices
| Choice (4) | Response | |
|---|---|---|
| a. | Preemptive scheduling |
|
| b. | Non-preemptive scheduling |
|
| c. | scheduling |
|
| d. | None of the above |
|