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 sripo
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sripo
3
answers
1
GATE CSE 2016 Set 1 | Question: 15
Consider the following C program. # include <stdio.h> void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a = 2016, b=0, c= 4, d = 42; mystery (&a, &b); if (a < c) mystery (&c, &a); mystery (&a, &d); printf("%d\n", a); } The output of the program is _________.
commented
in
Programming in C
Nov 29, 2019
17.9k
views
gatecse-2016-set1
programming-in-c
easy
numerical-answers
parameter-passing
1
answer
2
Eligibility of UGC-NET
What is the eligibility criteria for UGC-NET? I have just completed my bachelors in 2018 am I eligible to answer this exam?
answer selected
in
CBSE/UGC NET
May 14, 2019
485
views
ugcnet
1
answer
3
JEST Sample Question 1-a
Let a and b be positive integers such that a > b and a^ 2 − b^ 2 is a prime number. Then a^2 − b^ 2 is equal to (A) a − b (B) a + b (C) a × b (D) none of the above
asked
in
Set Theory & Algebra
Feb 15, 2019
542
views
jest
discrete-mathematics
set-theory&algebra
1
answer
4
JEST Sample Question 1-b
When is the following statement true? (A ∪ B) ∩ C = A ∩ C (A) If Ā ∩ B ∩ C = φ (B) If A ∩ B ∩ C = φ (C) always (D) never
asked
in
Set Theory & Algebra
Feb 15, 2019
794
views
jest
discrete-mathematics
set-theory&algebra
2
answers
5
JEST Sample Question 1-d
T (n) = T (n/2) + 2; T (1) = 1 When n is a power of 2, the correct expression for T (n) is: (A) 2(log n + 1) (B) 2 log n (C) log n + 1 (D)2 log n + 1
asked
in
Algorithms
Feb 15, 2019
512
views
jest
algorithms
recurrence-relation
1
answer
6
JEST Sample Question 1-c
If a fair die (with 6 faces) is cast twice, what is the probability that the two numbers obtained differ by 2? (A) 1/12 (B) 1/6 (C) 2/9 (D) 1/2
asked
in
Probability
Feb 15, 2019
661
views
jest
probability
discrete-mathematics
1
answer
7
JEST Sample Question-2
Consider the following function, defined by a recursive program: function AP(x,y: integer) returns integer; {if {x = 0 then return y+1} else if { y = 0 then return AP(x-1,1)} else return AP(x-1, AP(x,y-1)) } (a) Show that on all nonnegative arguments x and y, the function AP terminates. (b) Show that for any x, AP(x, y) > y.
asked
in
Programming in C
Feb 15, 2019
960
views
jest
programming-in-c
1
answer
8
JEST Sample Question-4
A tournament is a directed graph in which there is exactly one directed edge between every pair of vertices. Let Tn be a tournament on n vertices. (a) Use induction to prove the following statement: Tn has a directed hamiltonian path (a directed ... or a simple description of the steps in the algorithm, will suffice. What is the worst case time complexity of your algorithm?
asked
in
Algorithms
Feb 15, 2019
795
views
jest
algorithms
time-complexity
0
answers
9
JEST Sample Question-6
Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is denying this. They decide to settle this by an actual trial; if, within n coin tosses, ... demonstrated. What happens for larger values of n? Is it true that P (n) only increases with n? Justify your answer.
asked
in
Probability
Feb 15, 2019
338
views
jest
engineering-mathematics
probability
1
answer
10
JEST Sample Question-5
Describe two different data structures to represent a graph. For each such representation, specify a simple property about the graph that can be more efficiently checked in that representation than in the other representation. Indicate the worst case time required for verifying both of your properties in either representation.
asked
in
Algorithms
Feb 15, 2019
711
views
jest
algorithms
time-complexity
0
answers
11
JEST Sample Question-7
Consider the following program: function mu(a,b:integer) returns integer; var i,y: integer; begin ---------P---------- i = 0; y = 0; while (i < a) do begin --------Q------------ y := y + b ; i = i + 1 end return y end Write a condition P such that the program terminates, and a condition Q which is true whenever program execution reaches the place marked Q above.
asked
in
Programming in C
Feb 15, 2019
465
views
jest
programming-in-c
1
answer
12
Jest Exam sample question-3
How many subsets of even cardinality does an n-element set have ? Justify answer. Please give a proof if possible.This is part of subjective JEST paper.
asked
in
Set Theory & Algebra
Feb 15, 2019
418
views
jest
set-theory&algebra
discrete-mathematics
1
answer
13
MadeEasy Test Series: Computer Networks -Sliding Window
I am unable to understand their explanation,can anyone explain it in a better way?
commented
in
Computer Networks
Feb 14, 2019
587
views
computer-networks
sliding-window
go-back-n
made-easy-test-series
2
answers
14
Test Series For Gate 2020
Which are the best Test-Series for gate 2020.In terms of quality of question and for practice purposes. Just solving PYQ’s is it enough?
comment edited
in
GATE
Feb 9, 2019
4.2k
views
gate-preparation
1
answer
15
ACE TEST SERIES
is there is easy way to find no of candidate key in these type of questions.
commented
in
Databases
Jan 31, 2019
737
views
databases
0
answers
16
Jest Exam
please give answer or name a book from where i can access Describe two different data structures to represent a graph. For each such representa- tion, specify a simple property about the graph that can be more efficiently checked in that representation than in the other representation. Indicate the worst case time required for verifying both of your properties in either representation.
commented
in
Written Exam
Jan 30, 2019
359
views
jest
4
answers
17
GATE CSE 1998 | Question: 2.5
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
commented
in
Theory of Computation
Jan 29, 2019
17.3k
views
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
1
answer
18
NIELIT 2018-28
For the function $(z) = \frac{1}{z^2(e^z-1)}, z=0$ is a pole of order: $1$ $2$ $3$ None of these
commented
in
Others
Jan 28, 2019
1.7k
views
nielit-2018
non-gate
complex-number
1
answer
19
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 14
Which of the below relations does hold TRUE regarding GRAMMARS? $LL(1) \subset SLR(1) \subset LR(1)$ $SLR(1) \subset \epsilon-\text{free}\; LL(1) \subset LR(1)$ $\epsilon-\text{free}\;LL(1) \subset SLR(1) \subset LR(1)$ $LL(1) \subset SLR(1) = LR(1)$
commented
in
Compiler Design
Jan 27, 2019
1.2k
views
go-cd-1
6
answers
20
GATE CSE 2018 | Question: GA-4
What would be the smallest natural number which when divided either by $20$ or by $42$ or by $76$ leaves a remainder of $7$ in each case? $3047$ $6047$ $7987$ $63847$
commented
in
Quantitative Aptitude
Jan 22, 2019
6.5k
views
gatecse-2018
quantitative-aptitude
factors
1-mark
1
answer
21
Computer science gate psu
Which one test series should I purchase for that it will help me all types of computer science related exam like:: PSU,NVS,KVS,CIL,CRIS,BEL,BARC,ISRO ,IBPS SO,SBI SO . ....
answered
in
GATE
Jan 18, 2019
942
views
gate-preparation
isro-preparation
1
answer
22
GATE CSE 2011 | Question: 11
A computer handles several interrupt sources of which of the following are relevant for this question. Interrupt from CPU temperature sensor (raises interrupt if CPU temperature is too high) Interrupt from Mouse (raises Interrupt if the ... the HIGHEST priority? Interrupt from Hard Disk Interrupt from Mouse Interrupt from Keyboard Interrupt from CPU temperature sensor
commented
in
Operating System
Jan 16, 2019
9.5k
views
gatecse-2011
operating-system
interrupts
normal
4
answers
23
GATE CSE 2011 | Question: 65
A container originally contains $10$ litres of pure spirit. From this container, $1$ litre of spirit replaced with $1$ litre of water. Subsequently, $1$ litre of the mixture is again replaced with $1$ litre of water and this process is repeated one more time. How much spirit is now left in the container? $7.58$ litres $7.84$ litres $7$ litres $7.29$ litres
commented
in
Quantitative Aptitude
Jan 16, 2019
11.0k
views
gatecse-2011
quantitative-aptitude
normal
numerical-computation
5
answers
24
How many Binary Search Trees are possible for a labelled nodes?
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just $1$?
asked
in
DS
Jan 16, 2019
6.8k
views
data-structures
binary-search-tree
2
answers
25
GATE CSE 2011 | Question: 63
The variable cost $(V)$ of manufacturing a product varies according to the equation $V=4q$, where $q$ is the quantity produced. The fixed cost $(F)$ of production of same product reduces with $q$ according to the equation $F=\dfrac{100}{q}$. How many units should be produced to minimize the total cost $(V+F)$? $5$ $4$ $7$ $6$
answered
in
Quantitative Aptitude
Jan 16, 2019
4.8k
views
gatecse-2011
quantitative-aptitude
cost-market-price
normal
0
answers
26
#madeeasy test series
What is the good score in full length test series advance in madeeasy ??
commented
in
Study Resources
Jan 16, 2019
2.1k
views
0
answers
27
Gate Preparation in the last 18 days from Now
I have completed some amount of syllabus,I have takes some tests also,I haven't solved all the PYQ's of the GO book.My FLT scores are very poor.I have realized that my ability to take stress is poor one bad score and the time I take to recover ... as I wake up late. I just feel that Gate exam is not my cup of tea and I am wasting my time on it.
commented
in
GATE
Jan 15, 2019
807
views
gate-preparation
0
answers
28
CPU scheduling
How we can solve this question?
commented
in
Operating System
Jan 7, 2019
292
views
0
answers
29
Language accepted by this Turing Machine
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
asked
in
Theory of Computation
Jan 5, 2019
538
views
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
regular-expression
1
answer
30
MadeEasy Subject Test 2019: Theory Of Computation - Regular Languages
Can anyone explain how S2 is false,I did not understand their logic.
commented
in
Theory of Computation
Jan 1, 2019
653
views
regular-expression
theory-of-computation
finite-automata
regular-language
expression
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
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:...