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 vijaycs
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by vijaycs
0
votes
0
answers
1
Made-Easy | Synchronization
How option B would confirm - Bounded waiting.??
asked
in
Operating System
Jan 26, 2017
627
views
made-easy-test-series
process-synchronization
7
votes
1
answer
2
Self Doubt | Modulus Counter
Q1. How many flip-flops are required to construct mod 4 counter? Ans - 2 right ? Alway it should be 2 or it may not be 2. Q2 . If We want to design a synchronous counter that counts the sequence 0−1−0−2−0−3 and then repeats. A) What ... design-modulo-272-counter https://gateoverflow.in/82111/is-bcd-or-mod-10-counter-are-same https://gateoverflow.in/39670/gate-2016-1-8
asked
in
Digital Logic
Nov 22, 2016
1.5k
views
digital-logic
digital-counter
flip-flop
4
votes
1
answer
3
MadeEasy Test Series: Combinatory - Pigeonhole Principle
A community of 5 members is to be formed out of 10 people. The names are written in chits of paper and put into 6 boxes. So how many chits will go into the same box? Anyone, please make me understand this question.
asked
in
Combinatory
Nov 1, 2016
2.9k
views
made-easy-test-series
engineering-mathematics
discrete-mathematics
pigeonhole-principle
17
votes
1
answer
4
Self - doubt | How to avoid committing mistakes in the paper?
All the respected members, I need your valuable suggestion on how to solve questions during the exam so that we can avoid making more no of mistakes. Types of mistakes I commit - 1. Sometimes, I do not have sufficient ... you have overcome this problem. @Arjun sir, @Digvijay sir, @Kapil, @Habib, @Manojk .. and all other members too.
asked
in
Revision
Oct 22, 2016
2.3k
views
preparation
study-resources
4
votes
3
answers
5
Gate cse facebook group doubt
What is the time complexity of the following code snippet? sum=0; for(i=0;i<=n;i++) { for(j=1;j<=i;j++) { if(j%i==0) { for(k=0;k<=n;k++) { sum=sum+k; } } } }
asked
in
Programming in C
Sep 29, 2016
1.2k
views
time-complexity
programming-in-c
5
votes
2
answers
6
User|Kernel threads
Assume that process A has 3 user level threads and process B has 4 kernel-level threads. Consider while process A is running in CPU, process B is waiting in ready queue. If one of the thread in A is blocked then find status of A threads and B threads? A. ... A threads are blocked and B threads are not blocked. C. All B threads are blocked and A threads are not blocked. D. None.
asked
in
Operating System
Sep 20, 2016
1.7k
views
threads
process
6
votes
1
answer
7
Synchronization | Self-Doubt
1. Does starvation freedom imply bounded- waiting ? 2. Does bounded- waiting imply starvation freedom ? Explain with example.
asked
in
Operating System
Sep 19, 2016
2.1k
views
process-synchronization
deadlock-prevention-avoidance-detection
2
votes
2
answers
8
Self-Doubt
char buffer[6]=”hello”; char *prt1=buffer -1; /* undefined behavior */ char *ptr2 = buffer +5; /*Ok, pointing to the ‘\0’ inside the array */ char *ptr3 = buffer +6; /* OK, pointing to just beyond */ char *ptr4 = buffer +7; /* undefined behavior */ Please clear last two line.. and why 2nd last is not undefined behavior.
asked
in
Programming in C
Sep 4, 2016
740
views
programming-in-c
5
votes
1
answer
9
Maximum And Minimun
There are n distinct numbers are given not in sorted order. How much time it will take to select a number say k which is neither k-th minimum nor k-th maximum. A. O$(n)$ B. O$(1)$ C. O$(k)$ D. O$(k\log k)$.
asked
in
Algorithms
Aug 22, 2016
1.4k
views
algorithms
sorting
1
vote
2
answers
10
Propositional Logic | Self doubt
Please give one example of each following logic in english sentence - 1. ($\forall$xP(x) -> $\exists$xQ(x)) == $\exists$x(P(x) -> Q(x)) 2. ($\exists$xP(x) -> $\forall$xQ(x)) -> $\forall$x(P(x) -> Q(x)) 3. $\forall$x(P(x) -> R) -> ($\exists$xP(x) -> R)
asked
in
Mathematical Logic
Aug 19, 2016
1.4k
views
mathematical-logic
first-order-logic
1
vote
1
answer
11
Number of ways to put N indistinct objects into M indistinct boxes
asked
in
Others
Aug 8, 2016
733
views
combinatory
1
vote
2
answers
12
TestBook Test Series: Algorithms - Time Complexity
On which of the following recurrence relation Masters theorem can not be applied ? A. T(n)= 2T(n/2) + n (log n). B. T(n) = T(n/2) + 1. C. T(n) = 8T(n/2) + (log n). D. T(n) = 7(T(n/4) + n2.
asked
in
Algorithms
Jul 11, 2016
1.9k
views
testbook-test-series
algorithms
time-complexity
master-theorem
2
votes
4
answers
13
TestBook Test Series: Theory Of Computation - Finite Automata
The minimum number of states in a DFA that recognizes the language L = (000 + 0000)* over the alphabet {0}.
asked
in
Theory of Computation
Jul 10, 2016
1.0k
views
testbook-test-series
theory-of-computation
finite-automata
minimal-state-automata
2
votes
1
answer
14
Minimum number of nodes in a full binary tree with height 3?
asked
in
DS
May 25, 2016
12.7k
views
binary-tree
1
vote
2
answers
15
B. Math. 2005
Let S = { (a1 , a2 , a3 ) | 0 $\leq$ ai $\leq$ 9 and a1 + a2 + a3 is divisible by 3}. Then the number of elements in S is 327 333 334 336
asked
in
Quantitative Aptitude
Mar 23, 2016
564
views
quantitative-aptitude
0
votes
1
answer
16
B.Math. 2005
Let $0 < \theta < \pi$. The area of the triangle in the plane formed by the vertices $(-1,0), (1,0), (\cos\theta, \sin\theta)$ is not more than $1$ can be more than $1$ but not more than $2$ can be more than $2$ but not more than $\pi$ can be more than $\pi$ but not more than $2\pi$
asked
in
Quantitative Aptitude
Mar 23, 2016
300
views
quantitative-aptitude
geometry
0
votes
1
answer
17
The sum of all integers from 1 to 1000 that are divisible by 2 or 5 but not divisible by 4 equals
The sum of all integers from 1 to 1000 that are divisible by 2 or 5 but not divisible by 4 equals 175000 225500 149500 124000
asked
in
Quantitative Aptitude
Mar 22, 2016
1.2k
views
1
vote
1
answer
18
B.Stat. 2005
If $\sqrt{3}$ + 1 is a root of equation 3 x$^{3}$ + ax$^{2}$ + bx + 12 = 0 where a and b are rational numbers, then b is equal to -6 2 6 10
asked
in
Quantitative Aptitude
Mar 22, 2016
456
views
quantitative-aptitude
quadratic-equations
normal
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:...