Cs502 31 January 12 mcqs on p, np etc Subjective Draw graph from adj matrix Find variable length code Huffman tree given Common problem in communication links and circuit Where clique cover problem arises Kruskal SE mst banao Matrix multiplication P, np np-hard , np-complete examples ========= Today CS502 ppr Timing: 11:30 MCQS from prim's algorithm, dijkstra algorithm, spanning tree, DFS , greedy algorithm, questions Dijkstra algorithm.. find cost of graph .. Define acyclic graph Cyclic graph 2 basic case according to floyd warshall algorithm explain krny thy =========== Today C ppr Timing: 11:30 MCQS from prim's algorithm, dijkstra algorithm, spanning tree, DFS , greedy algorithm, questions Dijkstra algorithm.. find cost of graph .. Define acyclic graph Cyclic graph 2 basic case according to floyd warshall algorithm explain krny thy =========== Cs502 ka Paper 7:45 Mostly MCQ NP or P waly or MCQ 3 problem S502of NP, P , Dijkstra's Algorithm is k MCQ, Greedy tree is ka Long or MCQ ========= ``` *Cs 502* ``` *Mcqs* from *past files* and *handouts* *Questions from topic:* Dijsktra algorithm Huffman encoding Np problem Polymomial time algorithm Pseudo code or dijkstra Chain matrix Adjacency matrix and list ======= CS502 ka paper conceptual tha. MCQ's bi conceptual thy, mcqs mix thy all chapter sy, last chapter sy 3-4 mcqs thy Dijkarta algo ki correctness Kruskal algo working define krni thi dynamic problem coin change method given graph ka MST bana tha using 9 prims algo Adjancency martix ko list main convert krna tha DFS timestapms ko define krna tha palne-sweep sy aik question tha =========== Cs502 Subjective K Liye "kst learning" channel ki playlist dkh lain or objective K Liye Junaid ki file read kr lain paper 💯 Ho jye ga Chapter 8 most important for subjective.. ....iska hr topic short long and mcqs sb main tha