Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Ravi Raja
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Ravi Raja
1
vote
1
Os TLB question
How they calculated time for number of levels?
answered
in
Operating System
Dec 16, 2018
1.2k
views
operating-system
translation-lookaside-buffer
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?
answered
in
Algorithms
Oct 10, 2018
979
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...
answered
in
Operating System
Oct 10, 2018
1.6k
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 ??
answered
in
Algorithms
Aug 28, 2018
379
views
algorithms
asymptotic-notations
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; }
answered
in
Programming
Aug 28, 2018
410
views
programming-in-c
pointers
array
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 ?
answered
in
Programming
Jan 14, 2018
822
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?
answered
in
Compiler Design
Jan 2, 2018
564
views
compiler-design
parsing
lr-parser
numerical-answers
made-easy-test-series
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
IIITA M.TECH IT COMPLETE EXPLANATION FROM ADMISSION TO PLACEMENT
GO Classes NIELIT Test Series For 2023
Interview Experience : MTech Research(Machine Learning) at IIT Mandi
DRDO Scientist -B
ISRO Scientist-B 2023
Subjects
All categories
General Aptitude
(2.8k)
Engineering Mathematics
(9.8k)
Digital Logic
(3.4k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.4k)
Others
(2.5k)
Admissions
(667)
Exam Queries
(1.0k)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(867)
Recent Blog Comments
This story is same like my tier 3 college btech...
@Nikhil_dhamaHi , now i am in 2nd semester...
You can attempt now:...
where is the free test link ? how i can attempt...
Left with 10days, nothing heard back from them,...