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 lokeshsolanki17
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by lokeshsolanki17
6
answers
1
GATE CSE 2000 | Question: 1.20, ISRO2008-47
Which of the following need not necessarily be saved on a context switch between processes? General purpose registers Translation look-aside buffer Program counter All of the above
answered
in
Operating System
May 30, 2020
11.9k
views
gatecse-2000
operating-system
easy
isro2008
context-switch
3
answers
2
GATE CSE 1999 | Question: 2.12
Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$? Saving current register values and restoring saved register values for process $B$. Changing address translation tables. Swapping out the memory image of process $A$ to the disk. Invalidating the translation look-aside buffer.
commented
in
Operating System
May 30, 2020
27.5k
views
gate1999
operating-system
context-switch
normal
6
answers
3
GATE CSE 1994 | Question: 1.23
Consider the following two functions: $g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n > 10,000 \end{cases}$ $g_2(n) = \begin{cases} n \text{ for } 0 \leq n \leq 100 \\ n^3 \text{ for } n > 100 \end{cases}$ Which of the ... $g_1(n) \text{ is } O(n^3)$ $g_2(n) \text{ is } O(g_1(n))$ $g_2(n) \text{ is } O(n)$
commented
in
Algorithms
May 10, 2020
15.5k
views
gate1994
algorithms
asymptotic-notation
normal
multiple-selects
10
answers
4
GATE CSE 2006 | Question: 54
Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a_{i}+a_{i+1}+\dots+a_{j}=b_{i}+b_{i+1}+\dots+b_{j}$ ... time in the key comparison mode Takes $\Theta (n)$ time and space Takes $O(\sqrt n)$ time only if the sum of the $2n$ elements is an even number
commented
in
Algorithms
May 10, 2020
28.6k
views
gatecse-2006
algorithms
normal
algorithm-design
time-complexity
1
answer
5
Asymptotic Notation
Given h(n) < f(n) < g(n). statement 1: h(n)=O(f(n)); g(n)=Ω(f(n)) Statement 1 is True / False?
commented
in
Algorithms
Apr 29, 2020
897
views
asymptotic-notation
algorithms
time-complexity
growth-rate
3
answers
6
Asymptotic Notation theta property
If $T1(n) = \Theta(f(n))$ & $T2(n) = \Theta(f(n))$ Then, Is $T1(n) + T2(n) = O(f(n))$ If yes, then how?
answered
in
Algorithms
Apr 29, 2020
2.2k
views
asymptotic-notation
algorithms
time-complexity
growth-rate
1
answer
7
Propositional Equivalences
Which of the following are true : 1. $\forall x (P(x) \Leftrightarrow Q(x) ) \rightarrow (\forall x P(x) \Leftrightarrow \forall x Q(x))$ 2. $\forall x (P(x) \Leftrightarrow Q(x) ) \leftarrow (\forall x P(x) \Leftrightarrow \forall x Q(x))$ ... $\exists x (P(x) \Leftrightarrow Q(x) ) \Leftrightarrow (\exists x P(x) \Leftrightarrow \exists x Q(x))$
asked
in
Mathematical Logic
Jun 10, 2018
530
views
1
answer
8
expanding opcode technique
Can someone suggest a good video or link for ""expanding opcode technique""
answered
in
CO and Architecture
May 29, 2018
1.6k
views
1
answer
9
WBUT 2011
Construct a NFA for $r=(11+0)^*(00+1)^*$
answered
in
Theory of Computation
May 28, 2018
412
views
finite-automata
regular-expression
theory-of-computation
1
answer
10
operating system (deadlock)
The time complexity of banker's algorithm to avoid deadlock having $n$ processes and $m$ resources is?
commented
in
Operating System
May 28, 2018
4.2k
views
operating-system
bankers-algorithm
deadlock-prevention-avoidance-detection
3
answers
11
Graph theory | Graph Theory
A simple non directed graph contains $21$ edges, $3$ vertices of degree $4$ and the other vertices are of degree $2$.Then the number of vertices in the graph is? $8$ $13$ $18$ $21$
answered
in
Study Resources
May 28, 2018
25.2k
views
graph-theory
discrete-mathematics
engineering-mathematics
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...