CS502 IMPORTANT MCQ’S FINAL TERM 23/24

Title: The Importance of Past Papers in Preparing for Final Exams in Virtual University

Introduction: Preparing for final exams in a virtual university can be a challenging task, but one of the best ways to ensure success is by using past papers. In this article, we’ll explore the importance of past papers in preparing for final exams in a virtual university.

1. Familiarize Yourself with Exam Structure One of the benefits of using past papers is that they give you an idea of the exam structure. By reviewing past papers, you can identify the types of questions that are asked and the format of the exam.
2. Identify Important Topics and Concepts Reviewing past papers can help you identify important topics and concepts that are likely to be tested on the final exam. This can help you focus your study efforts and avoid wasting time on irrelevant material.
3. Practice Time Management Past papers can also help you practice time management. By simulating the exam environment, you can get a sense of how long you should spend on each question and ensure that you have enough time to complete the entire exam.
4. Test Your Understanding Taking past papers under exam conditions can help you test your understanding of the material. By attempting the questions, you can identify areas where you need more practice and improve your understanding of the topics.
5. Build Confidence Practicing with past papers can also help build confidence. By familiarizing yourself with the exam format and testing your understanding of the material, you can enter the exam with more confidence and reduce test anxiety.
6. Improve Exam Performance Finally, using past papers can help you improve your exam performance. By identifying important topics, practicing time management, and testing your understanding, you can maximize your chances of success on the final exam.

84

---

Created on February 22, 2023 By Dilawar

CS502 IMPORTANT MCQ'S FINAL TERM 23/24

1 / 20

What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?

log (V)

V.V

E.E

log (E)

2 / 20

The ________ given by DFS allow us to determine whether the graph contains any cycles.

Order

Time stamps

BFS traversing

Topological sort

3 / 20

In Kruskal's algorithm, the next edge is added to viable set A, if its adding does not induce a cycle.

True

False

4 / 20

Cross edge is :

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

(u, v) where u and v are not ancestor or descendent of one another

(u, v) where u and v are either ancestor or descendent of one another

5 / 20

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few edges.

True

False

6 / 20

Kruskal’s algorithm works by adding vertices in increasing order of weight (lightest edge first).

True

False

7 / 20

If u and v are mutually reachable in G, then in the graph formed by reversing all the edges, these vertices are not reachable.

True

False

8 / 20

Equivalence relation partitions the vertices into _________ classes of mutually reachable vertices and these are the strong components

Also Read:  CS706 Final Term Past Paper 2022

Variance

Equivalence

Non equivalence

Non classes

9 / 20

You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T

? (V + E)

? (V E)

? (V)

? (V^2)

10 / 20

In Prim's algorithm, we start with the root vertex r; it can be any vertex.

True

False

11 / 20

Timestamp structure of __________ is used in determining the strong components of a digraph

DFS

BFS

Both DFS & BFS

None

12 / 20

Which is true statement in the following.

Kruskal algorithm is multiple source technique for finding MST.

Kruskal’s algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)

Both of above

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges

13 / 20

Networks are complete in the sense that it is possible from any location in the network to reach any other location in the digraph

True

False

14 / 20

Networks are ________ in the sense that it is possible from any location in the network to reach any other location in the digraph

Incomplete

Not graphs

Complete

Transportation

15 / 20

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Divide-and-Conquer Technique

Greedy Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

16 / 20

The tricky part of the __________ algorithm is how to detect whether the addition of an edge will create a cycle in viable set A.

Also Read:  BIO502 FINAL TERM PAPERS 2023 + LIVE MCQ'S

Kruskal's

Prim's

Both

Both

17 / 20

Back edge is:

(u, v) where v is an ancestor of u in the tree

(u,v) where u is an ancesstor of v in the tree

(u, v) where v is an predcessor of u in the tree

None of above

18 / 20

In Prim's algorithm, at any time, the subset of edges A forms a single _________.

Vertex

Forest

Tree

Graph

19 / 20

In Timestamped DFS-cycles lemma, if edge (u, v) is a back edge, then _________

f[u] > f[v]

f[u] < f[v]

f[u] = f[v]

f[u] geqslant f[v]

20 / 20

A free tree with n vertices have exactly ________ edges

n

n + 1

n - 1

1

Your score is

The average score is 57%

LinkedIn Facebook Twitter VKontakte

0%

Restart quiz

Conclusion: In conclusion, past papers are a valuable resource for preparing for final exams in a virtual university. By familiarizing yourself with the exam structure, identifying important topics and concepts, practicing time management, testing your understanding, building confidence, and improving exam performance, you can increase your chances of success and achieve the grades you desire. So, make sure to use past papers as a key component of your exam preparation strategy.

cs502,cs502 final term preparation,cs502 final term,cs502 short lectures,cs502 important topics 2022,cs502 final term preparation 2022,cs502 midterm preparation,final term preparation in vu cs502,virtual university cs502 final term preparation,cs502 final,cs502 final term important topics,cs502 current paper,cs502 final term exams,cs502 current paper 2022,cs502 quiz,cs502 quiz 3,cs502 midterm important topics,cs502 finalterm preparation 2022