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 eyeamgj
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by eyeamgj
1
answer
1
UGC NET CSE | December 2006 | Part 2 | Question: 8
A sum of products expression can be implemented with __________ logic gates. AND−OR NAND−OR AND−NOT OR−AND
answered
in
Digital Logic
May 17, 2023
1.6k
views
ugcnetcse-dec2006-paper2
digital-logic
1
answer
2
UGC NET CSE | December 2006 | Part 2 | Question: 9
The characteristic equation of the $\text{D}$ flip-flop is : $\text{Q=D}$ $\text{Q=1}$ $\text{Q=0}$
answered
in
Digital Logic
May 17, 2023
724
views
ugcnetcse-dec2006-paper2
2
answers
3
Cormen 2nd edition Exercise 11.2-1
Suppose we use a hash function h to hash n distinct keys into an array T of length m. Assuming simple uniform hashing, what is the expected number of collisions?
commented
in
Algorithms
Jan 12, 2021
7.8k
views
algorithms
hashing
expectation
2
answers
4
GATE CSE 1996 | Question: 14
A two dimensional array $A[1..n][1..n]$ of integers is partially sorted if $\forall i, j\in [1..n-1], A[i][j] < A[i][j+1] \text{ and } A[i][j] < A[i+1][j]$ The smallest item in the array is at $A[i][j]$ where $i=\_\_$ and $j=\_\_$. The smallest ... if A[i+1][j] < A[i][j] ___ then begin A[i][j]:=A[i+1][j]; i:=i+1; end else begin _____ end A[i][j]:= ____ end
commented
in
Algorithms
Jan 10, 2021
5.6k
views
gate1996
algorithms
sorting
normal
descriptive
4
answers
5
GATE CSE 2014 Set 2 | Question: 40
Consider the following function. double f(double x){ if( abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x); } Give a value $q$ (to $2$ decimals) such that $f(q)$ will return $q$:_____.
commented
in
Programming in C
Jan 7, 2021
16.3k
views
gatecse-2014-set2
programming
recursion
numerical-answers
normal
3
answers
6
TIFR CSE 2010 | Part B | Question: 23
Suppose you are given $n$ numbers and you sort them in descending order as follows: First find the maximum. Remove this element from the list and find the maximum of the remaining elements, remove this element, and so on, until all elements are exhausted. How many comparisons ... $O\left ( n^{1.5} \right )$ but not better.
commented
in
Algorithms
Oct 6, 2020
4.8k
views
tifr2010
algorithms
time-complexity
sorting
3
answers
7
CMI2011-B-06a
Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We want to sort these disks in decreasing order according to their diameter so that the ... or $\text{chapatis}$ between two big spoons and flipping the stack.) Give an algorithm for sorting the disks using this operation.
commented
in
Algorithms
Sep 26, 2020
1.7k
views
cmi2011
descriptive
algorithms
sorting
3
answers
8
GATE CSE 1994 | Question: 27
Draw a precedence graph for the following sequential code. The statements are numbered from $S_1$ to $S_6$ $S_1$ read n $S_2$ i := 1 $S_3$ if i > n next $S_4$ a(i) := i+1 $S_5$ i := i+1 $S_6$ next : write a(i) Can this graph be converted to a concurrent program using parbegin-parend construct only?
commented
in
Operating System
May 19, 2020
5.9k
views
gate1994
operating-system
process-synchronization
normal
descriptive
6
answers
9
ISRO2011-10
Below is the precedence graph for a set of tasks to be executed on a parallel processing system $S$. What is the efficiency of this precedence graph on $S$ if each of the tasks $T_1, \dots, T_8$ takes the same time and the system $S$ has five processors? $25\%$ $40\%$ $50\%$ $90\%$
commented
in
Operating System
Jan 8, 2020
6.8k
views
isro2011
operating-system
process-synchronization
2
answers
10
GATE CSE 1991 | Question: 14,c
Consider the binary tree in the figure below: Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the structures. What is the worst-case time complexity of your procedure?
commented
in
DS
Dec 12, 2019
2.9k
views
gate1991
normal
data-structures
binary-tree
time-complexity
descriptive
3
answers
11
GATE CSE 2000 | Question: 15
Suppose you are given arrays $p [1......N]$ and $q [1......N]$ both uninitialized, that is, each location may contain an arbitrary value), and a variable count, initialized to $0$. Consider the following procedures $set$ and $is\_set$: set(i) { count ... $set(i)$ has not been called for some $i$, then regardless of what $p[i]$ contains, $is\_set(i)$ will return false.
commented
in
DS
Dec 12, 2019
4.7k
views
gatecse-2000
data-structures
array
easy
descriptive
7
answers
12
GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
commented
in
Operating System
Nov 20, 2019
29.4k
views
gatecse-2012
operating-system
process-synchronization
normal
1
answer
13
Made Easy Test Series:Programming & DS
Suppose a queue $Q$ and two stacks $S_{1}$ and $S_{2}$ as given below. void enqueue(Q,x){ push(S1,x); } void dequeue(Q,x){ if(stack-empty(S2))then if(stack-empty(S1))then{ print("Q is empty"); return; } else while ... $Enqueue(4),Enqueue(3),Enqueue(2),Dequeue, Enqueue(6),Dequeue,Dequeue, Dequeue,Enqueue(5)$ Please tell value of X and Y are u getting
commented
in
Programming in C
Nov 10, 2019
486
views
made-easy-test-series
programming
5
answers
14
GATE CSE 2001 | Question: 2.8
Consider the following circuit with initial state $Q_0 = Q_1 = 0$. The D Flip-flops are positive edged triggered and have set up times 20 nanosecond and hold times $0.$ Consider the following timing diagrams of X and C. The clock period of $C \geq 40$ nanosecond. Which one is the correct plot of Y?
commented
in
Digital Logic
Oct 5, 2019
21.1k
views
gatecse-2001
digital-logic
circuit-output
normal
1
answer
15
GATE IT 2004 | Question: 46
If we use internal data forwarding to speed up the performance of a CPU (R1, R2 and R3 are registers and M[100] is a memory reference), then the sequence of operations R1 → M[100] M[100] → R2 M[100] → R3 can be replaced by R1 → R3 R2 → M[100] M[100] → R2 R1 → R2 R1 → R3 R1 → M[100] R2 → R3 R1 → R2 R1 → R3 R1 → M[100]
commented
in
CO and Architecture
Oct 3, 2019
6.8k
views
gateit-2004
co-and-architecture
machine-instruction
easy
6
answers
16
GATE CSE 2019 | Question: GA-6
The police arrested four criminals - $P, Q, R$ and $S.$ The criminals knew each other. They made the following statements: $P$ says Q committed the crime. $Q$ says S committed the crime. $R$ says I did not do it. $S$ says What Q ... the arrested four committed the crime and only one of the statements made above is true. Who committed the crime? $P$ $R$ $S$ $Q$
commented
in
Verbal Aptitude
Sep 4, 2019
12.2k
views
gatecse-2019
verbal-aptitude
verbal-reasoning
2-marks
8
answers
17
GATE CSE 2004 | Question: 57
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The TCP layer prefixes $20$ byte header to the message. This passes through an intermediate network $B$ ... overheads. $325.5$ $\text{Kbps}$ $354.5$ $\text{Kbps}$ $409.6$ $\text{Kbps}$ $512.0$ $\text{Kbps}$
commented
in
Computer Networks
Aug 19, 2019
18.7k
views
gatecse-2004
computer-networks
ip-addressing
tcp
normal
1
answer
18
Self doubt - Programming
X=2; Y=++x * ++x * ++x ; Printf("%d",Y); In the above question, we have to use the final value of x or it will be evaluated seperately and then multiplied. Ex: Y= 3*4*5; or Y=5*5*5;
commented
in
Programming in C
Apr 11, 2019
576
views
self-doubt
programming-in-c
output
0
answers
19
self doubt
https://gateoverflow.in/86225/gate1990-13b for part a i think O(n^2) becz every tym we need to traverse whole chain.. ?
commented
in
Algorithms
Feb 15, 2019
347
views
0
answers
20
Made Easy Mock
In the given network system, station A needs to send a payload of 1600B from its network layer to station B. If fragmentation is done, then the actual data size to be transmitted is?
commented
in
Computer Networks
Jan 18, 2019
1.1k
views
0
answers
21
madeeasy test series
answer given as 255.255.255.254 how it is correct please check??
commented
in
Computer Networks
Jan 17, 2019
357
views
0
answers
22
#madeeasy
A group G having O(G)= 200 is known to be cyclic with g being one of its generator.It is given that O(g^x)=100 for some x€Z. Then value of x is?
commented
in
Mathematical Logic
Jan 17, 2019
732
views
0
answers
23
madeeasy test series
doubt with the semicolon after for loop and if ….……..please check the question
asked
in
Programming in C
Jan 17, 2019
179
views
0
answers
24
SELF DOUBT ANTISYMMETRIC PROPERTY
((X,Y):X DIVIDED BY Y ) IS A RELATION . IS IT ANTISYMMETRIC??
commented
in
Set Theory & Algebra
Jan 16, 2019
287
views
0
answers
25
madeeasy test series
this is a c function which adds the newly created node at the end(tail) of link list . this node is pointed by q and next of this node is already null. struct *node *add(struct node*head ,struct node *q) the number of ways to fill the boxes so function ... while how second is true becz when on;ly one node in list then second will fail ..answer is given as 1 and 2 are true .
commented
in
Computer Networks
Jan 15, 2019
264
views
0
answers
26
madeeasy test series
a group of n stations share a 100kbps pure aloha channel .each station outputs a 1000B frame on average every 50 sec . the maximum value of N? answer given as 920 but i am getting 115 please check
commented
in
Computer Networks
Jan 15, 2019
504
views
0
answers
27
character pointer
Let p be character pointer, consider the following statement p[i]=*(p+i) i[p]=*(i+p) p+i=&(i[p]) how many are true ??
commented
in
Programming in C
Jan 14, 2019
556
views
programming-in-c
0
answers
28
self doubt booth algorithm
https://gateoverflow.in/3352/gate2008-it-42 somewhere i saw 1 ->0 as 0 and somewhere as -1. which is actual process?
commented
in
Digital Logic
Jan 12, 2019
383
views
1
answer
29
MADEEASY TEST SERIES
WHICH OF THE FOLLOWING IS NOT A VALID DESCRIPTION OF THE INPUT ALPHABET SET? ANSWER IS GIVEN AS {01,110,NULL} WITH A EXPLAINATION THAT ALPHABET CANNOT CONTAIN NULL . NOW I HAVE A QUESTIONN REGARDING THAT {0,1,01 } IS NOT ALPHABET WHY ? AND {01,10} IS ALPHABET WHY ?? ... ? AS I KNOW FOR {0,1,01} IS WHEN WE WRITE 01 WE CANT DIFFERENTIATE IT IS FROMM 0 AND 1 OR 01?? RIGHT??
commented
in
Theory of Computation
Jan 11, 2019
847
views
1
answer
30
MadeEasy Test Series: CO & Architecture - Cache Memory
A : LRU replacement policy is not applicable to direct mapped caches B : A unique memory page is associated with every cache page in direct mapped caches Options: 1) Both True 2) Both False 3) A is True and B is false 4) B is True and A is false
commented
in
CO and Architecture
Jan 11, 2019
2.2k
views
made-easy-test-series
co-and-architecture
cache-memory
direct-mapping
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
(683)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation