วีดีโอ

hello can you upload answers of january to april session also

Suggest courses that i should cover

Kisi ka certificate or result aya h kya? Jinhone offline exam dia h

Pyqs.??

Bro please reply, is the exam in the format of mcq's , or on the programming questions too ?

previous yr papers

Kya practice programming assingement submit karna compulsory hi,???

Admit card???? Guys

will there be programming questions in the final exam, like the programming assignments?

Got hall ticket ?

5+ wrong answers bro 😕

bro what about practice programming assignments, should we submit those too??

Thankyou brother

thankyou sheku bhai

thank you🙂

Link For Programming Assignments : github.com/NPTEL-Programming-Solutions/NPTEL

tqs bro

Link For Programming Assignments : github.com/NPTEL-Programming-Solutions/NPTEL

Bro in week 9 your 2 answer was wrong😢 But Thanks🎉

tq bro

Link For Programming Assignments : github.com/NPTEL-Programming-Solutions/NPTEL

tqs

there is no week 9 in git hub link?

Very very thanks you sir 🔥😎🔥

THANKYOU SHEKU BHAI, PAPER BHI AAP HI DE ANA MERA.....

Thankyou SHEKU BHAI for the solutions, paper bhi nikalwa dena

💯💯

Link For Programming Assignments : github.com/NPTEL-Programming-Solutions/NPTEL

8 th is memory analysis

Super!!! ❣

Link For Programming Assignments : github.com/NPTEL-Programming-Solutions/NPTEL

bro i got different question 2nd one You are given an undirected graph of n vertices numbered from 0 to n - 1 and m edges between them. Each edge of the graph is weighted, each weight is a positive integer. You are given the list of edges along with their weights, but the list is damaged: some of the weights read as 0. If an edge has 0 weight, it means the information about its original weight is lost. You want the length of the shortest path between vertices s and t in the graph to be exactly L. Is it possible to restore some or all of the missing weights to make this happen? Input The first line contains five integers n, m, L, s, t (2 ≤ n ≤ 1000,  1 ≤ m ≤ 10000,  1 ≤ L ≤ 10^9,  0 ≤ s, t ≤ n - 1,  s ≠ t) - the number of vertices, number of edges, the desired length of shortest path, starting vertex and ending vertex respectively. Then, m lines describing the edges of the graph follow. i-th of them contains three integers, ui, vi, wi (0 ≤ ui, vi ≤ n - 1,  ui ≠ vi,  0 ≤ wi ≤ 10^9). ui and vi denote the endpoints of the edge and wi denotes its weight. If wi is equal to 0 then the weight of the corresponding edge was erased. It is guaranteed that there is at most one edge between any pair of vertices. Output Print "NO" (without quotes) if it's not possible to assign the missing weights to achieve the desired effect. Otherwise, print "YES". Examples input 5 5 13 0 4 0 1 5 2 1 2 3 2 3 1 4 0 4 3 4 output YES input 2 1 2390 0 1 0 1 0 output YES input 2 1 99 1 0 0 1 101 output NO

Thanks bro

Big thankyou brother , you are a great help

Thankyou bro you are a life saver

Link For Programming Assignments : github.com/NPTEL-Programming-Solutions/NPTEL

There is a mistake : correct answer for question 2 in quiz is option (b) A B C G E D F H

Re-Check question 2 and 8 in quiz

Tq bro

Link For Programming Assignments : github.com/NPTEL-Programming-Solutions/NPTEL

Bro please post week 4 quiz assignment and programming assignments. You have been very helpful. Thank you so much.

Ans for question 9 is wrong it should be "always choose the event whose end_time is the earliest "

Some of the answers were wrong in the week 1 quiz

I feel the answer to the last question is 15

Good job, Please post Week 2 Assignment 2, as today is last day.

Great work bhai 👍👍👍

Do you have any peer group who is active in programming, i have just completed my dsa course buy looking for peer group who can actively participating in contest and doing programming. I could say, I'm at average level

how hard the final exam was? I want to make sure I'm really prepared. Any advice on what to focus on?

Nice work keep uploading love it bro

Good work😂