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 aambazinga
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by aambazinga
0
votes
1
answer
1
ME MOCK 2: COA
which addressing mode is faster and why? indirect or relative?
asked
in
CO and Architecture
Jan 10, 2019
724
views
co-and-architecture
0
votes
0
answers
2
made easy mock1
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring } number of states in the minimal DFA of L’ is? i’m getting 3. please confirm if you are getting 3 or 4.
asked
in
Theory of Computation
Jan 8, 2019
910
views
theory-of-computation
finite-automata
0
votes
1
answer
3
made easy mock1
TRUE/FALSE: statement 1: secondary index may or may not be dense. statement 2: disk is considered as the maximum size of virtual memory.
asked
in
Databases
Jan 8, 2019
303
views
file-indexing
virtual-memory
0
votes
1
answer
4
ME FT: computer networks
A large number of consecutive IP address are available starting at 198.16.0.0. Suppose that four organizations, A, B, C, and D, request 4000, 2000, 4000, and 8000 addresses, respectively, and in that order. what is the correct mask for the organization castle? given answer: 198.16.24.0/20 my answer: 198.16.32.0/20 please correct me if my answer is wrong
asked
in
Computer Networks
Dec 27, 2018
801
views
computer-networks
classless-addressing
0
votes
0
answers
5
ME FT test: Algorithms
Let an array A has n elements, where each element is a natural number. it is known that the array A has exactly r number of inversions. now every element int he array is made negative. then the time complexity of the most efficient algorithms which ... asked the number of inversions, answer would be O(1). please give your approach, and what do you think answer should be?
asked
in
Algorithms
Dec 27, 2018
280
views
algorithms
time-complexity
0
votes
0
answers
6
demand paging
In a swapping system with variable partitions, segments have probability -s/10 distribution ( e / 10) where s is the segment size in kilobytes. Holes -h/5 have probability distribution ( e / 5) where h is the hole size in kilobytes. What is the ... .html i'm stuck at how average segment segment size and average hole size is calculated? please comment if you have got any insight.
asked
in
Operating System
Dec 25, 2018
217
views
operating-system
demand-paging
2
votes
1
answer
7
self doubt Deadlock
is there deadlock in the concurrent execution of two thread given below? void laurel() { lock_acquire(mutex); /* do something */ lock_acquire(file1); /* write to file 1 */ lock_acquire(file2); /* write to file 2 */ lock_release(file1); lock_release(mutex); ... (file1); lock_release(mutex); } i'm not getting any deadlock. please comment below if you find any. *Idon't have answer.
asked
in
Operating System
Dec 24, 2018
571
views
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
0
votes
0
answers
8
self doubt
Peterson’s Solution meets all three requirements; solves the critical section problem for two processes Can be extended to n processes by pairwise mutual exclusion – too costly what does pairwise mutual exclusion meant here? ref:- http://cse.iitkgp.ac.in/~agupta/OS/IPC.pdf page#20
asked
in
Operating System
Dec 24, 2018
181
views
operating-system
0
votes
0
answers
9
GATE-2018 modified question
Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, ... , 199), and 256 sectors per track (numbered as 0, 1, ... , 255). The following 6 disk requests of the form [sector ... question.. My Bad), and i was unable to decide as whether to overlap the different latencies, or calculate them individually, and add them up.
asked
in
Operating System
Dec 23, 2018
284
views
operating-system
0
votes
0
answers
10
Self-doubt
We know that Long Term Scheduler controls the degree of multiprogramming. But can we say that Medium Term Scheduler also controls the degree of multiprogramming. See these lines from galvin book. Some operating systems, such as time-sharing systems, may introduce an ... MTS is said to be reducing the degree of multiprogramming. so reducing is also a way of controlling. isn't it?
asked
in
Operating System
Dec 16, 2018
806
views
operating-system
2
votes
1
answer
11
MadeEasy Test Series: Algorithms - Sorting
An array of size n is known to be sorted except for the 1st k elements and the last k elements, where k is a constant. which of the following algorithm is the best choice for sorting the array A? Quick Sort or Insertion Sort? given answer is the insertion ... k), and it will take O(klogk) in average case and O(k^2) in the worst case. what's wrong in that?
asked
in
Algorithms
Dec 15, 2018
681
views
made-easy-test-series
algorithms
sorting
1
vote
0
answers
12
speedup
An application program is executed on a nine-computer cluster. A benchmark program took time T on this cluster. Further, it was found that 25% of T was time in which the application was running simultaneously on all nine computers.The remaining time, the ... the percentage of code that has been parallelized (programmed or compiled so as to use the cluster mode) in the preceding program
asked
in
CO and Architecture
Dec 11, 2018
558
views
co-and-architecture
speedup
william-stallings-book-question
0
votes
0
answers
13
william stallings I/O
a system employing interrupt-driven I/O for a particular device that transfers data at an average of 8 KB/s on a continuous basis. a. Assume that interrupt processing takes about 100 s (i.e., the time to jump to the interrupt service routine (ISR), ... getting 216/500 and 188/500 respectively. please check it. (i've taken K=1000 instead of 1024 for simplicity of calculation).
asked
in
CO and Architecture
Dec 9, 2018
794
views
co-and-architecture
dma
–1
vote
1
answer
14
test series
Consider the given below languages L1 and L2. L1= {pnqmrmsn | m,n ≥ 0} L2= {pnqnrmsm | m,n ≥ 0} Select the correct statement about, L such that L= (L1 U L2 ) – (L1 ꓵ L2 ) 1. L is CFL but not DCFL 2. L is regular 3. L is CSL but not CFL 4. L is DCFL but not regular i know that L is representing the EX-OR of L1 and L2, couldn't visualize as how it will be cfl. please help.
asked
in
Theory of Computation
Nov 9, 2018
431
views
test-series
theory-of-computation
1
vote
1
answer
15
transport layer
what happens when a host receives a TCP segment whose port number or source IP address do not match with any of the ongoing sockets in the host? one of the answer i think is an ICMP destination unreachable message will be transmitted. but could it be a ... listening to that port?(in case of no ongoing port of the number). how the answer would change in case of UDP connection.
asked
in
Computer Networks
Oct 25, 2018
321
views
transport-layer
sockets
0
votes
0
answers
16
MadeEasy Test Series: Probability
Consider Ramesh purchase a product of Patanjali. The manual on it states that the lifetime T of product is defined as the amount of time (in years) the product works properly until it breaks down, satisfy following equation: The probability that it breaks down in 3rd year is ... 22 - 0.23) Solution : 0.22 (0.22 - 0.23) i'm getting 0.134. what would be the answer?.
asked
in
Probability
Oct 24, 2018
160
views
probability
made-easy-test-series
1
vote
0
answers
17
test series
Question: 11 Consider the following ORACLE relations: One (x, y) = {<2, 5>, <1, 6>, <1, 6>, <1, 6>, <4, 8>, <4, 8>} Two (x, y) = {<2, 55>, <1, 1>, <4, 4>, <1, ... 1 respectively i'm not getting the second query. what does except all will make a difference from except? according to me both will give the same answer. please explain.
asked
in
Databases
Oct 24, 2018
680
views
databases
sql
1
vote
0
answers
18
Test Series
Consider a relation R(A, B) that contains r tuples, and a relation S(B, C) that contains s tuples; assume r > 0 and s > 0. Make no assumptions about keys. For the following relational algebra expression, in terms of r and s the minimum and ... result? given answer is: minimum:0, maximum: min(r,s) according to me: minimum:0, maximum: r please give answer with proper explanation.
asked
in
Databases
Oct 24, 2018
579
views
databases
relational-algebra
0
votes
0
answers
19
undecidability
Writes Non Blank: Given a turing machine T, does it ever writes a non-blank symbol on its tape, when started with a blank tape. how the above problem is solvable? somewhere i got this explanation: Let the machine only writes blank symbol. Then ... is a non-trivial property of turing machine and every non trivial property of turing machine is undecidable, so this is also undecidable.
asked
in
Theory of Computation
Sep 21, 2018
332
views
theory-of-computation
decidability
rice-theorem
turing-machine
0
votes
2
answers
20
countability
whether the given sets countable or uncountable? 1. the set of all finite partitions of N 2. the set of all non-increasing functions from N to N. 3. the set of all non-decreasing functions from N to N. here, N is natural numbers. please give answer with proper explanation, as i already have one word answer for all of the problems above.
asked
in
Theory of Computation
Sep 20, 2018
519
views
theory-of-computation
countable-uncountable-set
Page:
1
2
next »
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
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
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
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Sorry to break the news, but: I see a few flaws...
bhai mujhe bhi bula lo australia......mai bhi...
I see no inspiration here. Not everyone is...
Yaa toa intentionally bohot jyada sahi time kiya...
Man, I feel you! I left my job to do gate this...