Recent activity - GATE CSE Doubts

0 votes

0 answers

Probability NCERT Book Doubt
The probability of number of defectives in a lot is 35%. There are 4 items taken out with replacement. Find the probability that none of the items are defective?

commented 29 minutes ago in Probability by Dheera (7 points) | 7 views

0 votes

1 answer

MadeEasy Subject Wise OS
Consider the following code comprising of a swap function which is atomic. void swap(bool *a, bool *b){ bool temp; temp = *a; *a = *b; *b = temp; } bool lock = false void process(int i){ bool key; while(1){ // ... Bounded Waiting The code snippet solves the synchronization problem [According to me it should be bounded waiting but MadeEasy answer key says option (D)]

commented 32 minutes ago in Operating System by shashank023 (5 points) | 43 views

0 votes

0 answers

Test Series (Applied GATE)
I'm confused in this question. I used a scenario which violates ME in this code. Please correct me where I am doing wrong. CURRENTLY: Lock = 0. Process Pi just checked the while(key==True) <Pre-empt> then Process Pj came and executed the while ... =1 and lock=0 and it also enters CS. This scenario violates the condition of ME, please help me where I'm doing wrong.

asked 32 minutes ago in Operating System by arpit_18 (5 points) | 3 views

0 votes

0 answers

MadeEasy Subject Wise OS
In a demand paging system with a paging disk that has an average access and transfer time of 45 milliseconds. Address are mapped through a page table in main memory, with an access time of 75 micro-seconds per memory access. An associative memory (TLB) is added to ... getting page from memory and disk. so here Emat = (1-0.3)*75*10^-3 + 03*45 ms. Please someone verify.

asked 32 minutes ago in Operating System by shashank023 (5 points) | 4 views

0 votes

1 answer

Probability Binomial Distribution NCERT Doubt
In a hurdle race, a player has to cross 10 hurdles. The probability that he will clear each hurdle is 5/6 . What is the probability that he will knock down fewer than 2 hurdles?

commented 2 hours ago in Probability by Dheera (7 points) | 9 views

0 votes

0 answers

Applied Gate Database
Hi, I am kind of confused on how to proceed after finding the closures for {A, B, C, D} (Kind of using brute force to find all the required relations). Please provide in detail how you will be going to approach this.

asked 2 hours ago in Databases by badman (7 points) | 3 views

0 votes

2 answers

max-heap test
what is the level order traversal for an array of elements 20,15,21,31,16,18,19,40 .These elements are inserted into an empty max heap.

answered 3 hours ago in Algorithms by _sajalrai_ (337 points) | 13 views

0 votes

1 answer

GATE2002-16 https://gateoverflow.in/869/gate2002-16

answered 3 hours ago in Databases by zxy123 (2.2k points) | 6 views

+1 vote

1 answer

Probability ncert doubt
Find the probability that at most 2 heads and at most 2 tails occur when 4 coins are tossed simultaneously?

comment reshown 3 hours ago in Probability by Dheera (7 points) | 33 views

0 votes

0 answers

Made Easy test series
How to know through representation which one is LSB and which one is MSB

commented 3 hours ago in Digital Logic by zxy123 (2.2k points) | 7 views

0 votes

1 answer

#made-easy #serializability
consider the following schedule: S:W1(A) W2(B) W3(B) W4(B) The number of schedule which are view equal to s is _____. ans is 6 but i am getting 8 ans didn’t considers these two combinations: W2(B) W3(B) W4(B) W1(A) W3(B) W2(B) W4(B) W1(A) Is these two combinations can possible ?

answered 4 hours ago in Databases by zxy123 (2.2k points) | 9 views

0 votes

1 answer

Book Name 5th Edition Tanenbaum Wetherall
IP addresses are available starting at 201.16.0.0/16. Four organizations A, B, C & D request 300, 400, 200, and 500 addresses, respectively. For each of these, give the first IP address assigned, the last IP address assigned, and the mask in the w.x.y.z/s notation. (Assume classless addressing)

comment edited 4 hours ago in Computer Networks by zxy123 (2.2k points) | 25 views

0 votes

1 answer

#made-easy #database
statement:Relational calculus is equivalent to relational algebra. according to me above statement should correct but In ans it is given false.

commented 4 hours ago in Databases by zxy123 (2.2k points) | 12 views

+1 vote

1 answer

Applied Course
i am getting two different ans for this ques

commented 4 hours ago in Algorithms by zxy123 (2.2k points) | 26 views

0 votes

1 answer

Made Easy Test Series
The average successful search time taken by binary search on a sorted array of 10 items is ___________

commented 5 hours ago in DS by zxy123 (2.2k points) | 15 views

0 votes

1 answer

C- Programming Question on Pointers
What will be the output of the following program? #include "stdio.h" int main() { char a[] = { 'P', 'Q', 'R', 'S' }; char* p = &a[0]; *p++; printf("%c ", *++p); } According to my solution As we know that ... answer comes out to be Q , but when I ran the program, then it showed my R as the output. Can someone please help me with this?

commented 20 hours ago in Programming by Samarth Kejriwal (7 points) | 17 views

0 votes

1 answer

DBMS Self doubt Indexing
Can any one give an example of clustered vs non clustered index ?

commented 21 hours ago in Databases by Shivateja MST (39 points) | 27 views

0 votes

0 answers

Made Easy TextBook Counters Gate CS .#Self Doubt
Please provide detailed solution.

commented 22 hours ago in Digital Logic by zxy123 (2.2k points) | 21 views

0 votes

1 answer

#self-doubt #discrete-maths
can someone explains difference between equivalence classes and partitions. according to wiki Every element x of X is a member of the equivalence class [x]. Every two equivalence classes [x] and [y] are either equal or disjoint. ... below gate question https://gateoverflow.in/652/gate2000-2-5 they considers equivalence classes as partitions.Can someone explains why?

answered 22 hours ago in Set Theory & Algebra by zxy123 (2.2k points) | 15 views

+2 votes

1 answer

NLCIL2020(BASIC)
Q.1)which of the following is not considered as multivalued and composite attribute. a)AADHAR NUMBER b)Date of birth c)Age d)Address

answered 22 hours ago in Databases by zxy123 (2.2k points) | 13 views

0 votes

1 answer

Made Easy TextBook Assignments Counters #self doubt

answered 23 hours ago in Digital Logic by zxy123 (2.2k points) | 16 views

0 votes

1 answer

sorting -algorithms
Best and worst Time complexity for number of inversion using merge sort VS number of inversion using insertion sort

answered 1 day ago in Algorithms by zxy123 (2.2k points) | 8 views

0 votes

0 answers

Gate Applied Course Topic Wise Computer Network
Sentinel framing uses a one-bit pattern to designate the start of a frame, another bit pattern to designate the end of a frame and a bit-stuffing rule to prevent these two special patterns from occurring in the payload of the packet. The ... What bit pattern is there in start and end of the frame. 001110, 001111 00111, 01111 011101, 001111 0011, 01111

commented 1 day ago in Computer Networks by Nitinkumar.097 (13 points) | 28 views

0 votes

0 answers

Applied gate course Test series
A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no repeaters. The signal speed in the cable is 2 x 10^8 m/sec. The frame size for this network is 10000 bits. What is the total time ... to send this frame completely where the number of collisions occurs on an average is eccentricity e ?[ Take the floor value of the result]

commented 1 day ago in Computer Networks by Nitinkumar.097 (13 points) | 15 views

+1 vote

1 answer

NLCIL2020(basic)
Q.1) which of the following represent $ab^{*}+b^{*}$ a)starting with “a” and followed by “b”. b)having “a”s but not “b”s. c)having no “a”s but only “b”s. d)b starting with an a having no other “a”s or “a”s but only “b”s.

commented 1 day ago in Theory of Computation by vatsan (5 points) | 25 views

0 votes

0 answers

Made Easy Test Series 2021
Let N station share 40kbps of a pure aloha channel.Frame size is 512 bits which are sent at every 40 seconds. The maximum value of N is _______

asked 1 day ago in Computer Networks by Veda Pradhan (11 points) | 6 views

0 votes

1 answer

Regular or not
$L1 = {a^{m^{m}}}$ m>=1 regular or not? $L2 = {a^{m^{n}}}$ m,n>=1 regular or not?

answer selected 1 day ago in Theory of Computation by Shashank Rustagi (715 points) | 35 views

0 votes

1 answer

Made Easy Test Series 2020 - FLT 4 (BASIC)
What is the meaning of the overlapped here? i didnt get this one. Please give solution

commented 1 day ago in CO & Architecture by prajjwalsingh_11 (15 points) | 31 views

0 votes

0 answers

TIFR 2018 From System Science
Let G=(V,E)G=(V,E) be a DIRECTED graph, where each edge ee has a positive weight ω(e),ω(e), and all vertices can be reached from vertex s.s. For each vertex v,v, let ϕ(v)ϕ(v) be the length of the shortest path from ss to v.v. Let G′=(V,E)G′=(V, ... If PP is NOT a shortest path in G,G, then ω′(P)<2 ω(P).ω′(P)<2 ω(P). All of the above options are necessarily TRUE.

asked 1 day ago in Algorithms by Rishabh Mondal (5 points) | 10 views

0 votes

1 answer

Applied Subject Wise
https://drive.google.com/file/d/1u7M2dlAzxFIuRKlRadhsSFtf0hAVOKRi/view?usp=sharing : for clear photo here they considerd the memory as word addressable and no of add feild bits =log2(128k) but here https://csedoubts.gateoverflow.in/21470/made-easy-test-series they have calculate the memory size log2(64K*2B) what is right??

commented 1 day ago in CO & Architecture by _sajalrai_ (337 points) | 20 views

0 votes

1 answer

Made easy test series
Consider the type addressable memory unit of a computer has 64 K words of 16 bit each. The computer has an instruction format with 4 fields namely opcode, mode field specify 9-addressing modes, register address field with 50 registers and a memory address field. If an instruction is 32 bits long then the number of different instructions are _____. [closed]

commented 2 days ago in CO & Architecture by Ashutosh777 (267 points) | 87 views

0 votes

0 answers

NIELIT 2020 PAPER
. Consider the following C program segment. while (first <= last) { if (array [middle] < search) first middle +1; else if (array [middle] = = search) found = True; else last = middle - 1; middle = (first + last)/2; } if (first < last) not Present = True; The cyclomatic complexity of the program segment is A. 3 B. 4 C. 5 D. 6

commented 2 days ago in IS&Software Engineering by _sajalrai_ (337 points) | 13 views

+2 votes

1 answer

NLCIL2020(PSU)
Q.1) what is minimum number of NAND gate require to implement the function$A^{'}C^{'}+B^{'}C^{'}+CD$.there is only 2-input NAND gate available.

answer edited 2 days ago in Digital Logic by _sajalrai_ (337 points) | 32 views

+2 votes

1 answer

Made Easy Subjectwise
can someone tell what can be the minimum value of count variable???

commented 2 days ago in Operating System by Ashutosh777 (267 points) | 35 views

+2 votes

2 answers

GateBook Test Series(Synchronization and Deadlock)

answer selected 2 days ago in Operating System by Deterministic (23 points) | 60 views

0 votes

0 answers

Made Easy Text Book Counters 2018 Delay of ripple counter and synchronous counter

asked 2 days ago in Digital Logic by ayusha5312 (21 points) | 6 views

0 votes

0 answers

Made Easy Text Book Counters 2018 Delay of ripple counter and synchronous counter

asked 2 days ago in Digital Logic by ayusha5312 (21 points) | 7 views

+1 vote

1 answer

GateBook OS test series
G Suppose a system in which there are two types of processes, type A and type B processes. All processes of type A execute the same code, and all processes of type B execute the same code. The code for each process type is shown below. A Processes B ... of AABAB. S2 : It is possible for processes to finish in the order AABBA. Which of the above statement(s) is/are CORRECT ?

commented 2 days ago in Operating System by Deepakk Poonia (Dee) (1.4k points) | 20 views

+3 votes

1 answer

Gateoverflow test series question.
Assume that the propagation delay in each gate in a 16-bit ripple carry adder (made of AND, OR, and NOT gates only with up to 3 inputs) is 1 ns. Time taken in nanoseconds to perform a 16-bit addition is _______. Given answer is 33 nanoseconds. How to solve this question?

commented 2 days ago in Digital Logic by _sajalrai_ (337 points) | 52 views

0 votes

0 answers

MadeEasy-TESTseries
I am getting 1.15 as a answer? is the given answer to this correct?

asked 3 days ago in CO & Architecture by Sinchit (17 points) | 14 views

To see more, click for the full list of questions or popular tags.

Recent activity

8,677 questions

2,878 answers

13,798 comments

95,575 users