GATE CSE topic:computer-science PYQs & Answers — Page 37

Questions 361–370 of 975. Imported answers require independent review unless marked reviewed.

The chromatic number of a graph is the minimum number of colours used in a proper coloring of the graph. Let

be any graph with

vertices and chromatic number

. Which of the following statements is/are always TRUE?

Your answerSelect all correct options. You can choose more than one.

contains a complete subgraph with

vertices

contains an independent set of size at least

contains at least

edges

contains a vertex of degree at least

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let G be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in G has even weight. Which of the following statements is/are TRUE for every such graph G?

Your answerSelect all correct options. You can choose more than one.

All edges in G have even weight

All edges in G have even weight OR all edges in G have odd weight

In each cycle C in G, all edges in C have even weight

In each cycle C in G, either all edges in C have even weight OR all edges in C have odd weight

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the operators ◊ and □ defined by

, for positive integers. Which of the following statements is/are TRUE?

Your answerSelect all correct options. You can choose more than one.

Operator ◊ obeys the associative law

Operator □ obeys the associative law

Operator ◊ over the operator □ obeys the distributive law

Operator □ over the operator ◊ obeys the distributive law

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a context-free grammar G with the following 3 rules.

S → aS, S → aSbS, S → c

Let w ∈ L(G). Let n_a(w), n_b(w), n_c(w) denote the number of times a, b, c occur in w, respectively. Which of the following statements is/are TRUE?

Your answerSelect all correct options. You can choose more than one.

n_a(w) ≥ n_b(w)

n_a(w) > n_c(w) − 2

n_c(w) = n_b(w) + 1

n_c(w) = n_b(w) * 2

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider two set-associative cache memory architectures: WB, which uses the write back policy, and WT, which uses the write through policy. Both of them use the LRU (Least Recently Used) block replacement policy. The cache memory is connected to the main memory. Which of the following statements is/are TRUE?

Your answerSelect all correct options. You can choose more than one.

A read miss in WB never evicts a dirty block

A read miss in WT never triggers a write back operation of a cache block to main memory

A write hit in WB can modify the value of the dirty bit of a cache block

A write miss in WT always writes the victim cache block to main memory before loading the missed block to the cache

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a disk with the following specifications: rotation speed of 6000 RPM, average seek time of 5 milliseconds, 500 sectors/track, 512-byte sectors. A file has content stored in 3000 sectors located randomly on the disk. Assuming average rotational latency, the total time (in seconds, rounded off to 2 decimal places) to read the entire file from the disk is ________

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a 512 GB hard disk with 32 storage surfaces. There are 4096 sectors per track and each sector holds 1024 bytes of data. The number of cylinders in the hard disk is ________

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a TCP connection operating at a point of time with the congestion window of size 12 MSS (Maximum Segment Size), when a timeout occurs due to packet loss. Assuming that all the segments transmitted in the next two RTTs (Round Trip Time) are acknowledged correctly, the congestion window size (in MSS) during the third RTT will be ________

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

The baseline execution time of a program on a 2 GHz single core machine is 100 nanoseconds (ns). The code corresponding to 90% of the execution time can be fully parallelized. The overhead for using an additional core is 10 ns when running on a multicore system. Assume that all cores in the multicore system run their share of the parallelized code for an equal amount of time.

The number of cores that minimize the execution time of the program is ________

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider an Ethernet segment with a transmission speed of 10⁸ bits/sec and a maximum segment length of 500 meters. If the speed of propagation of the signal in the medium is 2×10⁸ meters/sec, then the minimum frame size (in bits) required for collision detection is ________

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE CSE topic:computer-science PYQs

Question 51

Question 51

Question 52

Question 52

Question 53

Question 53

Question 54

Question 54

Question 55

Question 55