GATE CS question library
Practise GATE CS Computer Science previous year questions free. Browse by subject, syllabus topic, year and question type, with answers and available solutions.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
9 on this page
The set is a group under multiplication modulo . The inverses of and are respectively:
Let be a simple graph with vertices and edges. The size of the minimum vertex cover of G is . Then, the size of the maximum independent set of is:
Let be the continuous probability density function of a random variable , the probability that , is :
Let be a simple connected planar graph with vertices and edges. Then, the number of faces in the planar embedding of the graph is:
Let and be non-empty sets and let and Which one of the following is TRUE?
The following is the Hasse diagram of the poset The poset is :
Suppose there are sorted lists of elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure)
Consider the following circuit involving a positive edge triggered D FF. Consider the following timing diagram. Let represents the logic level on the line in the -th clock period. Let represent the complement of . The correct output sequence on over the clock periods through is:
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); } Let be the values printed by the parent process and be the values printed by the child process. Which one of the following is TRUE?
