Відео

❤

Thank you bhai great explanation, but please use hindi language as well during the time of question explanation and answer explanatiom. Because people from belongs to north india he/she more comfortable with hindi language so please use hindi language as well. Thank you for making such grear video.

Wrong answer dear 64, correct answer is 35

Nonsence man

Muh se gutka nikal ke bola kr bhai tu

Good one

Tatti explanation......

2:54 projection eliminates duplicacy so it will be 1 only once

Thank you

Last option is wrong, if we consider tree where d is added after c, so when we visited vertex a-c-d and want to visit b from d Parents of d and b are different But They both r in leaf node So option c true

Thank You so much sir

Good job❤

Your explanations are very clear. Thank you!

Correct ans. Is D

Very nicely explained !!

totally bullshit.correct ans is 7!/4!*3!=35

Super 👍

How Calculate extarnal fragmentation

Woow thank you for explaining this question, so smoothly ❤

You're wrong..... right answer is B

Wrong explanation

poor explanation

Thanks bro, I was solving PYQ and I marked rear node but in answer key of the book it was C. I started looking for answers. I found yours thanks!

How 7 can lost? Why 7 can lost

nice explanation

Bro can you let me know minimum number of tables for c,d

Totally wrong solution? How can you run P1 and P2 more than 1 times without while loop

wow descent explanation

kuch bhi

Tum Gadhe ho Kya ,km se km gyaan dene se Phle seekh to lo. Kya time pass karaate ho ok-ok Bol ke.

Good explanation sir ji❤

but how 😂

Its wrong....plz dont provide wrong solutions

are u sure this is right ?

Nice

Sir they asking Many to one supporting relation for the weak entity here you given weak entity as answer but still suporting then dimond with double border

N=1 was given not S

❤

Kindly explain clearly, nowadays msq are asked then how are you suppose to eliminate

Very helpful 😃

Thanks ❤

The option is correct, but the solution is wrong. If you are telling that option 'A' is wrong, then two processes can never enter critical section at the same time. For Option A) Theoretically this may be true, but practically it can't be true. [Explanation] Let's suppose the size of unsigned integer on your machine is 4 Byte(32 bit) then the max integer value it can store is ((2^32) - 1). If first process checks while condition it will store the value 0+1 = 1 to L because of "Fetch_And_Add" then enters Critical Section without executing "while" body. Now if every next process, only enters to "while" body by executing condition and then preempts just before executing its body, then the L will get values like 1, 2, 3, 4, 5, 6, and when it reaches (2^32) - 1 then next process (2^32th process) will try to store value 2^32 which is 1 greater than your machine can store in L. So, L can overflow and because of this L will get the value 0 by 2^32th process, that means it can also enter critical section. Now 1st process and 2^32th process is inside critical section at the same time (2 process in cs). As we know that having 2^32 processes is not practical. So, this option can't be true. For Option B) True [Explanation] Let's suppose if: 1) Process P1 enters C.S and preempts. Now the value of L is 1. 2) Process P2 enters while loop but preempts before executing its body. Now the value of L is 2 3) Process P1 leaves C.S. Now the value of L is 0. -> Preempts and Scheduled P2 4) Process P2 executes its next line that is L = 1 and then preempts, Now the value of L is 1 => At this point no process is inside the Critical Section and the value of L is 1. So, no process can enter Critical Section now. Every process will get stuck in while loop. It means deadlock. As we can see critical section is free(lock is available) but no one can enter critical section because L is non-zero(Showing Lock is not available). Option C and D are clearly false.

1 to the power any number 1 only, so option B is not correct, option A is correct.

Nice explanation,, thanks 🙏

If option has like course ids in which all female students are not enrolled?? Will it be correct.

Consider the following sequence of instructions, which is to be a 5 stage pipeline: IF, ID, OF, EX and WB. Each stage takes one cycle instruction. Total cycles require to execute this sequence ? ADD R2, R1, R0 MUL R4, R3, R2 SUB R6, R5, R4 ADD R6, R7, R8 MUL R7, R1, R2 SUB R1, R3, R4 Sir can you make a table for this one to get clear idea of total cycle needed ?

Kindly explain clearly

thanks for this question

A depth-first search is performed on a directed acyclic graph. Let d[u] denote the time at which vertex u is visited for the first time and f[u] the time at which the dfs call to the vertex u terminates. Which of the following statements is always true for all edges (u, v) in the graph ? (A) d[u] < d[v] (B) d[u] < f[v] (C) flu] < f[v] (D) f[u] > f[v] can you solve this question please ? if you solve it please comment it here i will get notified

take 104