Register
Filter

Recent questions without a selected answer

282
views
2 answers
0 votes
ACE volume 1
which of the following is not a strict schedule?A) R1(A),R2(A),W1(A),Abort1,W2(A),Commit2B) R1(A),R2(A),W1(A),Commit1,W2(A),Abort2C) R1(A),R2(A),W2(A),Commit2,W1(A),Commit1D) R1(A),W2(A),W1(A),Commit1,W2(A),Commit2
User Avatar
280
views
1 answers
0 votes
Give the output
int P=O;for(i=0;i<2n;i++){For(j=1;j<=n;j++){ If(j<i)P=P+1;}}Printf("%d",P);What is the output in terms of n:a. (4n^2-n)/2b. (3n^2-n)/2c. (n^2-4n)/2d.(n^2-3n)/2
User Avatar
151
views
0 answers
0 votes
Self doubt
What is edge disjoint spanning trees?
User Avatar
2.2k
views
1 answers
0 votes
SELF DOUBT OS MADEEASY TEST SERIES
CONSIDER A SYSTEM USING PAGING AND SEGMENTATION .THE VIRTUAL ADDRESS SPACE CONSIST OF UP TO 8 SEGMENTS AND EACH SEGMENT IS 229 BYTE ... IN THE VIRTUAL ADDRESS SPECIFY THE PAGE NUMBER?A)4 bitsb)5 bitsc)16 bitsd)21 bits
User Avatar
416
views
1 answers
0 votes
#Test series
User Avatar
422
views
1 answers
0 votes
conflict euivalence
S1=2RB 1RA 1WB 2WAS2=1RA 2RB 1WB 2WAare these schedules are conflict equivalent or not?as by swapping the orders of first two non conflicting pair operations(1RA ... of conflictions pairs is not same in s1 and s2. pls explain???
User Avatar
575
views
1 answers
0 votes
Pointers in C
What is a variable pointer? please note the question is not asking about pointer variables, but the specific term.
User Avatar
2.1k
views
1 answers
3 votes
Ace Algorithms
Leading element in an array of n elements is the element which occurs more than n/2 times in the array.a) What is the time complexity to find whether a ... to find whether leading element exists or not in an unsorted array of n elements?
User Avatar
443
views
0 answers
0 votes
ECIL GET or IIIT Allahaad IT?
I am selected for ECIL Graduate Engineer trainee position, and I have also joined M.tech IT at IIIT Allahabad, which one should I choose?
User Avatar
547
views
1 answers
0 votes
Cache Capacity
if in a question it ask for cache capacity the is it calculated by follwing...cache capacity=cache size+ tag memory size+dirty bitcache capacity=tag bits * no. of cache lineswhich one is correct?
User Avatar
248
views
0 answers
0 votes
test series
Consider a system with cycles per instruction (CPI) is 1.0 when all memory accesses hit in the cache. The only data accesses are loads and stores, and these ... 4%, how much faster would the computer be if all instructions were cache hits?
User Avatar
418
views
2 answers
0 votes
Chip Select
Ans. C
User Avatar
866
views
1 answers
1 votes
MadeEasy Workbook: Computer Networks - Network Flow
If two stations A and B uses copper twisted pair cable having capacity 200 bits/sec. if A transmitted 20 frames to B each of size 50 bits, Assume RTT is ... ) required to transmit the single frame from A to B if pipelining has been used?
User Avatar
1.6k
views
1 answers
0 votes
Multilevel Cache Access time
Ans. A
User Avatar
1.1k
views
0 answers
1 votes
Signed 2's complement Exponent
User Avatar
562
views
0 answers
1 votes
Gate 2013
A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base ... galvin and tannenbaum Can anyone suggest a book where i'll find this concept.
User Avatar
357
views
0 answers
0 votes
increment in array
What is the output of this code in c?int main(){static int a[][2][3]={0,1,2,3,4,5,6,7,8,9,10,11,12};int i=-1;int d;d=a[i++][++i][++i]; printf("%d",d); return 0;} how did 2 come as the answer? please explain,thanks.
User Avatar
343
views
0 answers
0 votes
cloud computing
In distributed computing, each processor has its own local memory.
User Avatar
516
views
1 answers
0 votes
madeeasy test series os
Q1: SAFE OR NOT??i have doubt with the answer given becz i am getting safe for question 1 and unsafe for question 2 but opposite answer is given in test series/.
User Avatar
366
views
0 answers
0 votes
nptel
Match the following: List – I 1. Data link layer 2. Network layer 3. Transport layer 4. Presentation layer List – II i. Encryption ii. Connection control iii. Routing iv. Framing
User Avatar
190
views
0 answers
1 votes
made easy test series
Consider A' is a set containing n elements. A subset P' of A' is chosen at random. The set A' is reconstructed by replacing the elements of A'. A ... chosen at random. What is the probability that P' and Q' have no common element?
User Avatar
1.9k
views
1 answers
0 votes
DEADLOCK TRUE OR FALSE
A) DEADLOCK CAN BE PREVENTED BY NOT ALLOWING ANY PROCESS TO REQUEST FOR RESOURCE WHEN IT ENTERS A CRITICAL SECTION.(TRUE OR FALSE)B) DEADLOCK AVOIDANCE SCHEME ... REQUEST AND USE DURING ITS LIFE TIME(TRUE OR FALSE)ALSO PROVIDE SOME REASON
User Avatar
635
views
1 answers
0 votes
MadeEasy Test Series: General Aptitude - Verbal Ability
Consider there are two tribes living on the Island: Knights and knaves. Knights always tell truth while Knaves always tells lie. Suppose we counter two random people A and B, ... is Knavec.) Both A and B are Knightd.) Both A and B are Knave
User Avatar
757
views
1 answers
0 votes
Made Easy Algorithms
How to calculate the time complexity for finding repeated elements in an array of n elements using linear search and binary search?
User Avatar
508
views
1 answers
0 votes
TOC SELF DOUBT
THE MINIMAL FINITE AUTOMATA THE STRING IN R=0*1*______STATES.
User Avatar
366
views
1 answers
0 votes
Made Easy algorithms
Given an array of n elements, two elements in the array a[i] and a[j] are said to be inverse only if a[i]>a[j] && i<j. What is the time complexity required to find ... the given array using merge sort?a) O(n)b) O(n2)c) O(nlogn)d) O(logn)
User Avatar
1.1k
views
1 answers
1 votes
Made Easy algorithms
After applying few passes of quick sort on a given array, the following output was obtained:1,10,5,8,25,44,55,30,70Then how many pivot elements are there in the above output?
User Avatar
943
views
1 answers
3 votes
Data Structure
Which data structure is most efficient to find the top 10 largest items out of 1 million items stored in file? The answer given is Min-heap anybody please explain?
User Avatar
529
views
0 answers
0 votes
self doubt _counting semaphore
Semaphore Implementationtypedef struct {int value;struct process *list;} semaphore;Each semaphore has an integer value and a list of processes list. Whena process must ... such thing will happen,please tell me where i am making mistake ?
User Avatar
Page: