menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
User Ravi Raja
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
GO Book for GATECSE 2022
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Exact tag match
Recent Posts
GATE 2021 AIR 26 journey and some useful tips
A Short Guide to GATE
Seeking DRDO Scientist B previous year papers
STRATEGY TO EFFECTIVELY CREATE SHORT & MICRO NOTES FOR GATE EXAM AND BEST REVISION STRATEGY BY AIR-"152"
My Video Experience AIR-152 GATE_CS(Some More motivation)!!!!!!
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3.1k)
Programming and DS
(5.2k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Follow @gateoverflow
GATE Overflow
Recent Blog Comments
Thanks bro :) It has been quite the...
Wow! Awesome! Congratulations brother
It's one of the top University in Canada.
Hi falgun09, If you don't mind me asking, which...
That's great!
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Answers by Ravi Raja
1
vote
1
Os TLB question
How they calculated time for number of levels?
How they calculated time for number of levels?
answered
Dec 16, 2018
in
Operating System
799
views
operating-system
tlb
paging
2
votes
2
Find total number of comparisons needed
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
answered
Oct 10, 2018
in
Algorithms
451
views
algorithms
normal
sorting
3
votes
3
GALVIN(NINTH INDIAN EDITION)-CHAPTER 1(SECTION 1.5.1)
The hardware allows privileged instruction to be executed only in kernel mode. if an attempt to execute a privileged instruction in user mode, the hardware does not execute the instruction but rather treat it as illegal and traps it to ... privileged instruction. how can it be then executed if the system is not in kernel mode? please clarify...
The hardware allows privileged instruction to be executed only in kernel mode. if an attempt to execute a privileged instruction in user mode, the hardware does not execute the instruction but rather treat it as illegal and traps it to the operating system. The instruction to ... is itself a privileged instruction. how can it be then executed if the system is not in kernel mode? please clarify...
answered
Oct 10, 2018
in
Operating System
902
views
operating-system
process
0
votes
4
Big oh
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??
answered
Aug 28, 2018
in
Algorithms
105
views
1
vote
5
array long with pointers
give the complete solution with explanation int main() { int arr [2] [2] [2] = {10,2,3,4,5,6,7,8}; int *p, *q; p = &arr[1] [1] [1]; q = (int*) arr; printf("%d ,%d \n",*p ,*q); return 0; }
give the complete solution with explanation int main() { int arr [2] [2] [2] = {10,2,3,4,5,6,7,8}; int *p, *q; p = &arr[1] [1] [1]; q = (int*) arr; printf("%d ,%d \n",*p ,*q); return 0; }
answered
Aug 28, 2018
in
Programming
238
views
programming-in-c
pointers
arrays
3
votes
6
Number of Binary tree
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ?
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ?
answered
Jan 14, 2018
in
Programming
507
views
tree-traversal
binary-tree
0
votes
7
made easy
Q9-Consider the following grammar: S → aPbSQ | a Q → t | ε P → r The number of states will reduce when a LALR(1) parse is computed out of CLR(1) parser for the above grammar _____. made easy solution my solution please correct me if i wrong no of state is reduce =6?
Q9-Consider the following grammar: S → aPbSQ | a Q → t | ε P → r The number of states will reduce when a LALR(1) parse is computed out of CLR(1) parser for the above grammar _____. made easy solution my solution please correct me if i wrong no of state is reduce =6?
answered
Jan 2, 2018
in
Compiler Design
308
views
...