GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS): Questions 938 - 942 of 3196
Choose Programs:
🎓 Study Material (1190 Notes): 2024-2025 Syllabus
Rs. 1000.00 -OR-
3 Year Validity (Multiple Devices)
Topic-wise Notes & SampleDetails
🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)
Rs. 650.00 -OR-
3 Year Validity (Multiple Devices)
CoverageDetailsSample Explanation
Help me Choose & Register (Watch Video) Already Subscribed?
Question 938
Appeared in Year: 2017
Question MCQ▾
The first order logic (FOL) statement is equivalent to which of the following? (January Paper III)
Choices
Choice (4) | Response | |
---|---|---|
a. | ||
b. | ||
c. | ||
d. |
Question 939
Appeared in Year: 2017
Question MCQ▾
Dijkstra՚s algorithm is based on (January Paper III)
Choices
Choice (4) | Response | |
---|---|---|
a. | Divide and conquer paradigm | |
b. | Dynamic programming | |
c. | Backtracking paradigm | |
d. | Greedy Approach |
Question 940
Appeared in Year: 2016
Question MCQ▾
The following numbers are inserted into an empty binary search tree in the given order:
What is the height of the binary search tree? (November Paper II)
Choices
Choice (4) | Response | |
---|---|---|
a. | 5 | |
b. | 3 | |
c. | 4 | |
d. | 6 |
Question 941
Appeared in Year: 2017
Question MCQ▾
In a paging system, it takes 30 ns to search translation Look-a-side Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70% , the effective memory access time is: (January paper II)
Choices
Choice (4) | Response | |
---|---|---|
a. | 120ns | |
b. | 84ns | |
c. | 48ns | |
d. | 147ns |
Question 942
Appeared in Year: 2014
Question MCQ▾
Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is:
The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages) : (June paper III)
Choices
Choice (4) | Response | |
---|---|---|
a. | ||
b. | ||
c. | ||
d. |