Previous Year Questions

Q396 MCQ CUET-PG COMPUTER SCIENCE (MCA) Easy 4 Marks 2022

Operating Systems → OS basics

Which of the following storage hardwares can be used as a back-up device? A. HDD B. ROM C. RAM D. Cache E. Magnetic Tape

Choose One:

A) Only A, B and C

B) Only B, C and D

C) Only A and E

D) Only A, C and E

Q397 MCQ GATE CS Medium 2 Marks 2020

ALGO → Graph Traversal

Let G=(V,E) be a directed, weighted graph with weight function w:E \rightarrow \mathbb{R}. For some function f:V \rightarrow \mathbb{R}, for each edge (u,v) \in E, define w'(u,v) as w(u,v) + f(u) - f(v). Which one of the options completes the following sentence so that it is TRUE? 'The shortest paths in G under w are shortest paths under w' too,'

Choose One:

A) for every f:V \rightarrow \mathbb{R}

B) if and only if \forall u \in V, f(u) is positive

C) if and only if \forall u \in V, f(u) is negative

D) if and only if f(u) is the distance from s to u in the graph obtained by adding a new vertex s to G and edges of zero weight from s to every vertex of G

Q398 MCQ GATE CS Medium 1 Mark 2020

ALGO → Asymptotic Notations

For parameters a and b, both of which are \omega(1), T(n) = T(n^(1/a)) + 1, and T(b) = 1. Then T(n) is

Choose One:

A) \Theta(log_a log_b n)

B) \Theta(log_ab n)

C) \Theta(log_b log_a n)

D) \Theta(log_2 log_2 n)

Q399 MCQ GATE CS Medium 2 Marks 2020

ALGO → Greedy Algorithms

Let G=(V,E) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighted edge (u,v) in V x V is added to G. The worst case time complexity of determining if T is still an MST of the resultant graph is

Choose One:

A) \Theta(|E|+|V|)

B) \Theta(|E||V|)

C) \Theta(|E|log|V|)

D) \Theta(|V|)

Q400 NAT GATE CS Easy 2 Marks 2020

ALGO → Greedy Algorithms

Consider a graph G=(V,E) where V = \{v_1, v_2, ..., v_{100}\}, E = \{(v_i, v_j) | 1 \le i < j \le 100\}, and weight of the edge (v_i, v_j) is |i - j|. The weight of minimum spanning tree of G is

PYQBOOK

Filter Questions

Which of the following storage hardwares can be used as a back-up device? A. HDD B. ROM C. RAM D. Cache E. Magnetic Tape

Choose One:

Choose One:

For parameters a and b, both of which are \omega(1), T(n) = T(n^(1/a)) + 1, and T(b) = 1. Then T(n) is

Choose One:

Let G=(V,E) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighted edge (u,v) in V x V is added to G. The worst case time complexity of determining if T is still an MST of the resultant graph is

Choose One:

Consider a graph G=(V,E) where V = \{v_1, v_2, ..., v_{100}\}, E = \{(v_i, v_j) | 1 \le i < j \le 100\}, and weight of the edge (v_i, v_j) is |i - j|. The weight of minimum spanning tree of G is

Enter Numerical Answer: