- 54
- 421 611
Guru Vidya
เข้าร่วมเมื่อ 6 ส.ค. 2018
DBMS05 Conflict Serializability using Precedence Graph SPPU Example
Conflict Serializability using Precedence Graph SPPU Example
มุมมอง: 10
วีดีโอ
DBMS07 View Equivalent and View Serailizable Schedule SPPU Example
มุมมอง 812 ชั่วโมงที่ผ่านมา
DBMS07 View Equivalent and View Serailizable Schedule SPPU Example
DBMS03 Consistent and Inconsistent Schedules
มุมมอง 2612 ชั่วโมงที่ผ่านมา
DBMS03 Consistent and Inconsistent Schedules
DBMS04 Conflict Serializability SPPU Example
มุมมอง 1312 ชั่วโมงที่ผ่านมา
DBMS04 Conflict Serializability SPPU Example
DBMS02 Transactions Serial Schedule and Concurrent Schedule
มุมมอง 2812 ชั่วโมงที่ผ่านมา
DBMS02 Transactions Serial Schedule and Concurrent Schedule
DBMS01 View Serializable and conflict equivalent Schedule SPPU example
มุมมอง 12421 ชั่วโมงที่ผ่านมา
View Serializable and conflict equivalent Schedule example
DS02 B Tree Elements insertion
มุมมอง 4214 วันที่ผ่านมา
• Construct a B-Tree of order 3 for following data: 50, 30, 21, 90, 10, 13, 20, 70, 25, 92, 80.
DS01 Inserting nodes in B Tree
มุมมอง 2614 วันที่ผ่านมา
Construct B-tree of order 4 by inserting the following data one at a time. 20, 10, 30, 15, 12, 40, 50
DM12 Simple path and simple circuit in a graph
มุมมอง 2221 วันที่ผ่านมา
Simple path and simple circuit in a graph
DM10 Graph Adjacency List, Adjacency Matrix and Incidence Matrix
มุมมอง 6621 วันที่ผ่านมา
Difference between Adjacency List, Adjacency Matrix and Incidence Matrix
DM09 Graph Theorem Examples
มุมมอง 3521 วันที่ผ่านมา
State whether it is possible to construct a graph with 7 nodes and 14 edges.
DM07 Theorem complete graph with n vertices
มุมมอง 3221 วันที่ผ่านมา
DM07 Theorem complete graph with n vertices
DM06 Types of Graphs: Complete graph, graph cycles and wheels
มุมมอง 7021 วันที่ผ่านมา
DM06 Types of Graphs: Complete graph, graph cycles and wheels
DM05 Indegree and outdegree for directed Graph
มุมมอง 13221 วันที่ผ่านมา
DM05 Indegree and outdegree for directed Graph
DM03 Graph Adjacent vertices, Degree of a vertex for Undirected graph
มุมมอง 8621 วันที่ผ่านมา
DM03 Graph Adjacent vertices, Degree of a vertex for Undirected graph
DM02 Types of Graphs Simple,multigraphs,loops,Psuedograph
มุมมอง 15121 วันที่ผ่านมา
DM02 Types of Graphs Simple,multigraphs,loops,Psuedograph
DM01 Basics of graph, vertices and edges
มุมมอง 29721 วันที่ผ่านมา
DM01 Basics of graph, vertices and edges
W/L Ratio Calculation for CMOS Logic PUN PDN Total Area on Chip VLSI WIDTH to Length Ratio SPPU
มุมมอง 3.6Kปีที่แล้ว
W/L Ratio Calculation for CMOS Logic PUN PDN Total Area on Chip VLSI WIDTH to Length Ratio SPPU
CMOS LOGIC DESIGN IMPLEMENTATION for Boolean Expression Logic by using PMOS and NMOS PUN PDN
มุมมอง 507ปีที่แล้ว
CMOS LOGIC DESIGN IMPLEMENTATION for Boolean Expression Logic by using PMOS and NMOS PUN PDN
Stick Diagram for 2 Input NAND gate in CMOS LOGIC VLSI
มุมมอง 1.2Kปีที่แล้ว
Stick Diagram for 2 Input NAND gate in CMOS LOGIC VLSI
Eulers Path/Eulers Diagram for CMOS Logic in VLSI
มุมมอง 159ปีที่แล้ว
Eulers Path/Eulers Diagram for CMOS Logic in VLSI
VHDL FIFO 16X8 MEMORY IMPLEMENTATION AND SIMULATION IN ISE
มุมมอง 182ปีที่แล้ว
VHDL FIFO 16X8 MEMORY IMPLEMENTATION AND SIMULATION IN ISE
VHDL 4 BIT ALU IMPLEMENTATION AND SIMULATION IN ISE
มุมมอง 2.5Kปีที่แล้ว
VHDL 4 BIT ALU IMPLEMENTATION AND SIMULATION IN ISE
IoT09: IoT Security Vulnerabilities and Security Requirements
มุมมอง 3.6K4 ปีที่แล้ว
IoT09: IoT Security Vulnerabilities and Security Requirements
Better better than my teacher she is not able to teach anything she's so mad I hate her just wasting our precious time
sorry sir, but your video is difficult to understand the concept please make it simple.
Hey Thank you for this!
Bhai english si nahi a te to hindi correct boal lo
Thank you so much😘😘.From Vietnam😘
Thank you very much ! =] , God bless ! ,
This is the first good explanation I see. Thank you.
Helpful
Thank you for such a nice and crisp explaination!
You're welcome, pls subscribe
thanks
You're welcome, pls subscribe
thank you. very easy to understand.
You're welcome, pls subscribe
Thank you 🙏 I have seen many videos trying to explain the idea, but following your simple solution I now understand it better than ever!
You're welcome, pls subscribe
this helped me a lot! thank you
You're welcome, pls subscribe
thanku
You're welcome, pls subscribe
thanks ...
You're welcome, pls subscribe
Thank you so much clear explanation
You're welcome, pls subscribe
sir can we use one time figure instead drawing it again and again
Drawing it again and again will tell you which link is available and which is blocked....this is useful to find max flow
🎉🎉nice explanation
You're welcome, pls subscribe
thanks
hats off
You're welcome, pls subscribe
3 hours looking for someone to explain me this on youtube and you did this perfectly in 11', thanks bro
You're welcome, pls subscribe
Wrong you didnt take backward edges into account
No backward edge here ....all leading to sink Z
I didn't get the min cut part!
I'm getting 14 how he got 13 out of nowhere 😢
Bro continues to save. Thank you.
sir why are you taking 3(multiply) in (w/L)PUN ??
Width of PMOS (PUN) is 3 times width of NMOS (PDN).length is same for both so overall W/L is 3
@@guruvidya7339 Width of PMOS is 2.5 times that of NMOS, right??
@@abelxoxoyes but Ideally it is considered as 3 times for calculation
bhai tune mera kaam bahuat aasan kar diya thank you bhai
you are the only one , who cleared it to me , thanks sir
thanks
Very nice and confident explanation
Thanks ❤
Thank you from core of my heart. I really mean it. You saved me from taking retake on my Data and Analysis Algorithm
Thank youuuu
Good explanation
Sir is multiplication factor value 3 is same for all design or different
Yes for all PUN
Nice Sir 😊
Why you left the b-e remove block 10:29 explain
Sir please share the link of xilinx 14.7
www.xilinx.com/support/download/index.html/content/xilinx/en/downloadNav/vivado-design-tools/archive-ise.html
bht dhannebaad bhaiiya, love from Pakistan <3
thank you brother
i am confused max flow min cut and ford Fulkerson algorithm is same ??
Thank you sir you saved me
Flow sabse smallest number hotah hai yeh nahi bata saktah tha kya pura dimag kharab ho raha mera etna der sein
for max flow, doesn't the order in which you choose the paths affect the outcome?
You can choose any order.....answer would be correct
I don’t want to attend my lecture after this video
Well 3 is less then 6 why are you calling it "Max " ?
because 3 is maximum capacity that link can hold.....not the 6......because 6 cant flow through link having capacity 03
thank you for the explanation
This is awesome
Short and simple ❤️
Very good explanation 😀
Your videos are really helpful.. keep it up sir👏
Thank u bro