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 Prateek.py
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Prateek.py
5
answers
1
GATE CSE 2015 Set 3 | Question: 4
Consider the equality $\displaystyle{\sum_{i=0}^n} i^3 = X$ and the following choices for $X$: $\Theta(n^4)$ $\Theta(n^5)$ $O(n^5)$ $\Omega(n^3)$ The equality above remains correct if $X$ is replaced by Only I Only II I or III or IV but not II II or III or IV but not I
commented
in
Algorithms
Jan 19
12.5k
views
gatecse-2015-set3
algorithms
asymptotic-notations
normal
7
answers
2
GATE CSE 2012 | Question: 46
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially ...
commented
in
Theory of Computation
Dec 1, 2022
10.6k
views
gatecse-2012
theory-of-computation
finite-automata
normal
8
answers
3
GATE CSE 2003 | Question: 40
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-degree of $G$ cannot be $3$ $4$ $5$ $6$
commented
in
Graph Theory
Jan 20, 2021
12.3k
views
gatecse-2003
graph-theory
normal
degree-of-graph
11
answers
4
GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$
commented
in
Theory of Computation
Dec 25, 2020
10.0k
views
gatecse-2008
theory-of-computation
finite-automata
normal
4
answers
5
GATE IT 2005 | Question: 37
Consider the non-deterministic finite automaton (NFA) shown in the figure. State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ as the only accepting state be $L1$. Similarly, let the language accepted by the NFA with $Z$ as ... statements about $L1$ and $L2$ is TRUE? $L1 = L2$ $L1 \subset L2$ $L2 \subset L1$ None of the above
commented
in
Theory of Computation
Dec 24, 2020
12.7k
views
gateit-2005
theory-of-computation
finite-automata
normal
5
answers
6
GATE CSE 2004 | Question: 55
The routing table of a router is shown below: ... $192.12.17.10$ respectively? Eth$1$ and Eth$2$ Eth$0$ and Eth$2$ Eth$0$ and Eth$3$ Eth$1$ and Eth$3$
commented
in
Computer Networks
Nov 15, 2020
12.6k
views
gatecse-2004
computer-networks
subnetting
normal
3
answers
7
GATE CSE 2016 Set 1 | Question: 47
Consider a computer system with $40$-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires $48$ bits, then the size of the per-process page table is __________ megabytes.
commented
in
Operating System
Oct 16, 2020
10.4k
views
gatecse-2016-set1
operating-system
virtual-memory
easy
numerical-answers
4
answers
8
GATE CSE 1999 | Question: 20-b
Consider the following solution to the producer-consumer problem using a buffer of size 1. Assume that the initial value of count is 0. Also assume that the testing of count and assignment to count are atomic operations. Producer: Repeat Produce an ... item; Forever; Show that in this solution it is possible that both the processes are sleeping at the same time.
commented
in
Operating System
Sep 22, 2020
2.6k
views
gate1999
operating-system
process-synchronization
normal
descriptive
2
answers
9
GATE CSE 1991 | Question: 11,a
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] ... j; flag [i] := false non-critical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.
comment edited
in
Operating System
Sep 22, 2020
3.2k
views
gate1991
process-synchronization
normal
operating-system
descriptive
2
answers
10
GATE CSE 1988 | Question: 10iib
Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ ... until false Determine of the above solution is correct. If it is incorrect, demonstrate with an example how it violates the conditions.
commented
in
Operating System
Sep 18, 2020
2.5k
views
gate1988
descriptive
operating-system
process-synchronization
7
answers
11
GATE CSE 2017 Set 2 | Question: 43
Consider the following snippet of a C program. Assume that swap $(\&x, \&y)$ exchanges the content of $x$ and $y$: int main () { int array[] = {3, 5, 1, 4, 6, 2}; int done =0; int i; while (done==0) { done =1; for (i=0; i<=4; i ... i-1]) { swap(&array[i], &array[i-1]); done =0; } } } printf( %d , array[3]); } The output of the program is _______
commented
in
Programming
Jul 12, 2020
13.4k
views
gatecse-2017-set2
programming
algorithms
numerical-answers
identify-function
6
answers
12
GATE CSE 2002 | Question: 1.5
In the worst case, the number of comparisons needed to search a single linked list of length $n$ for a given element is $\log n$ $\frac{n}{2}$ $\log_2 {n} - 1$ $n$
commented
in
DS
Jul 10, 2020
13.4k
views
gatecse-2002
easy
data-structures
linked-list
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
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.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...