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
Answers by eyeamgj
0
votes
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
0
votes
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
1
vote
3
Testbook test series
answered
in
Computer Networks
Oct 3, 2018
232
views
computer-networks
0
votes
4
algorithm
A new algorithm MaxPack for optimally packing furniture in a transportation container claims to have worst case complexity O(n2 log n), where n is the number of items to be packed. From this, we can conclude that: 1.For every sufficiently large n, for every input ... large n, there is an input of size n for which MaxPack requires time proportional to n2 log n. which option is correct?
answered
in
Algorithms
Sep 12, 2018
479
views
time-complexity
0
votes
5
Self doubt
How to solve the question involving the calculation of safe sequence when the resource allocation graph is given instead of the table. Eg. In the question below..What should be the approach to solve the question??? Plzz explain..
answered
in
Operating System
Aug 21, 2018
601
views
operating-system
deadlock-prevention-avoidance-detection
0
votes
6
Madeeasy_OperatingSystem_subjectTest
Shaik Masthan please explain me ..thank you
answered
in
Operating System
Aug 19, 2018
126
views
3
votes
7
Time Complexity
What will be TC here? Ans given $O(n^{2})$ , while I am getting $O(n)$
answered
in
Algorithms
Aug 18, 2018
1.0k
views
time-complexity
algorithms
test-series
2
votes
8
Engineering mathematics
if the sum of the diagonal elements of a 2x2 matrix is (-6) then the maximum possible value of determinant of the matrix is
answered
in
Linear Algebra
Aug 9, 2018
2.1k
views
0
votes
9
selfdoubt os
answered
in
Operating System
Jul 7, 2018
449
views
1
vote
10
MadeEasy Subject Test 2019: Algorithms - Sorting
Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst case using an efficient algorithm are
answered
in
Algorithms
Jun 24, 2018
2.3k
views
made-easy-test-series
algorithms
sorting
merge-sort
1
vote
11
Scheduling algorithms
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin timesharing method. Which out of the following quantum times is the best value for small response times, ... processes have a short runtime, e.g. less than 10ms ? a)TQ=15ms b)TQ=40ms c)TQ=50ms D)TQ=45ms
answered
in
Operating System
Jun 21, 2018
3.1k
views
1
vote
12
Binary search
Given a sorted array of n elements where other than one element x every other elenent repeat two times then how much time will it take to find position of x
answered
in
Algorithms
Jun 16, 2018
943
views
sorting
time-complexity
0
votes
13
gate preparation
other than last year questions, what are the other sources to prepare for gate cs?
answered
in
GATE
Jun 15, 2018
182
views
0
votes
14
Directed Acyclic Graph
Question.Construct the Dag for the following Assume that + is left associative? a)a+b+(a+b) b)a+b+a+b c)a+a+(a+a+a+(a+a+a+a)) Please give the Answer to these questions?????
answered
in
Compiler Design
Jun 13, 2018
9.3k
views
compiler-design
code-optimization
directed-acyclic-graph
0
votes
15
TURING MACHINE
WHATS THE MAIN DIFFERENCE between RECURSIVELY ENUMARABLE but not RECUSIVE and NOT RECURSIVELY ENUMARABLE??????/ PLZ help me out with this
answered
in
Theory of Computation
Jun 1, 2018
337
views
0
votes
16
Decidable
1)Let G be CFG. Whether L(G) is CFL. Q)Is it decidable or not? 2)Let G be CFG and unambiguous. Whether L(G) is CFL. Q)Is it decidable or not?
answered
in
Theory of Computation
Jun 1, 2018
2.0k
views
decidability
theory-of-computation
turing-machine
0
votes
17
Made easy test
Consider the rank of matrix $'A'$ of size $(m \times n)$ is $"m-1"$. Then, which of the following is true? $AA^T$ will be invertible. $A$ have $"m-1"$ linearly independent rows and $"m-1"$ linearly ... $"n"$ linearly independent columns. $A$ will have $"m-1"$ linearly independent rows and $"n-1"$ independent columns.
answered
in
Linear Algebra
May 31, 2018
1.3k
views
engineering-mathematics
linear-algebra
matrix
1
vote
18
GATE CSE 2013 | Question: 34
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, increments by one, stores it to memory, and then terminates. Each of the ... initialized to two. What is the maximum possible value of $x$ after all processes complete execution? $-2$ $-1$ $1$ $2$
answered
in
Operating System
May 30, 2018
22.1k
views
gatecse-2013
operating-system
process-synchronization
normal
0
votes
19
Made easy test series
Please explain this???
answered
in
Theory of Computation
May 30, 2018
452
views
1
vote
20
Admission related
I gave gate 2018 and got 2262 rank(43.33 marks)) .Is there any chance for me to get I to NITs for mtech now....
answered
in
Written Exam
May 25, 2018
439
views
1
vote
21
C variable declaration
What is the output of below code? #include<stdio.h> Int check(int); Int main() { Int k=35,z; z=check(k); printf("z=%d\n",z); return 0; } int check(int m) { int m; if(m>40) return (!m++); else return (!++m); }
answered
in
Programming in C
May 21, 2018
975
views
programming-in-c
2
votes
22
JNU exam
If R be an equivalence relation on the set, A={6,7,8,9,10} defined by, R={(6,6),(7,7),(8,8),(9,9),(10,10),(6,7),(7,6),(8,9),(9,8),(9,10),(10,9),(8,10),(10,8)}, its partitions are a) {{6},{7},{8,9},{10}} b) {{6,7,8},{9,10}} c) {{6},{7,8},{9,10}} d) {{6,7},{8,9,10}}
answered
in
Set Theory & Algebra
May 14, 2018
320
views
0
votes
23
Why b is not decrementing ?
main() { int a = 1; int b = 1; int c = a || b--; printf("a = %d b=%d\n",a,b); return 0; }
answered
in
Programming in C
May 14, 2018
310
views
programming-in-c
0
votes
24
UGC NET CSE | December 2015 | Part 2 | Question: 39
An ideal sort is an in-place-sort whose additional space requirement is O (log$_2$ n) O (nlog$_2$ n) O (1) O (n)
answered
in
Algorithms
May 10, 2018
2.2k
views
ugcnetcse-dec2015-paper2
algorithms
sorting
space-complexity
0
votes
25
MY DOUBT: Worst case space complexity of Quick sort (NOT FOR A STRAIGHT ANSWER)
First read it properly. I am not asking a specific question about space complexity. Question: What is worst case space complexity of quick sort? Everywhere it is showing O(logn). My understanding about it: I know that Quick ... done by ratio 1:n-1 which is worst case, wouldn't it be requesting for O(n) stack records?
answered
in
DS
Apr 21, 2018
2.4k
views
algorithms
sorting
data-structures
space-complexity
1
vote
26
#Graph Theory #Algorithms Self Doubt about Dense Graphs.
Please give some example regarding number of edges in dense graph is - |E| < |V2| I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
answered
in
Algorithms
Apr 21, 2018
722
views
algorithms
graph-algorithm
time-complexity
0
votes
27
Suppose A is connected to B via an intermediate router R ?
The link A-R is instantaneous , but the R->B link transmits only 1 packet each second , one at a time . Assume A sends to B using sliding window protocol with window size =4 , For time t=2 , state what packets arrive ... what are the packets present in the queue at R ? In this case , what is the transmission time and propogation delay ?
answered
in
Computer Networks
Apr 21, 2018
1.8k
views
computer-networks
sliding-window
–1
vote
28
Static Variable C Program
Q1) #include<stdio.h> static int i; static int i = 27; static int i; int main() { static int i; printf("%d",i); return 0; } A) 27 B) 0 C) No Output D)None of the these Q2) #include<stdio.h> static int i; static int i = 27 ... 0; } A) 27 B) 0 C) No Output D)None of the these @Arjun Sir please explain deeply, How to store the static variable in memory?
answered
in
Programming in C
Apr 21, 2018
1.4k
views
programming-in-c
2
votes
29
what are the possible sets of sequence numbers inside the sender's window at time t in Go Back N ?
Consider GBN with sender's window size of n . Suppose that at time t , the next in order packet the receiver is expecting has a sequence number of 'k' . Assume that the medium does not reorder ... possible sets of sequence numbers at time t . Assume the sender already received ACK for k-1 packets .
answered
in
Computer Networks
Apr 20, 2018
1.7k
views
computer-networks
go-back-n
sliding-window
0
votes
30
Demand Paging
Consider a system where main memory access time is 10 msec and page fault service time is 200 msec. The TLB is added to improve the performance and the 80% references are found in the TLB and that of the remaining 10% cause page fault. The TLB access time and page table access time are ... . I am evaluating as follows, Where am I doing wrong? EMAT=0.8*(10)+0.2[0.9*10 + 0.1*(10+200)]
answered
in
Operating System
Apr 20, 2018
378
views
Page:
1
2
next »
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