Following questions have been asked in GATE 1) An undirected graph G(V, E) contains n ( n > 2 ) nodes named v1 , v2 ,….vn. Two nodes vi , vj are connected if and only if 0 < |i – j| <= 2. Each edge (vi, vj ) is […]
1) A program P reads in 500 integers in the range [0..100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies? (a) An array of 50 numbers (b) An array of […]
1) Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort? (A) O(log n) (B) O(n) (C) O(n log n) (D) O(n^2) Answer (B) 2) Consider the following operation along with Enqueue and Dequeue operations on […]
FOLLOWING QUESTIONS ASKED IN GATE 1) Let P be a QuickSort Program to sort numbers in ascending order using the first element as pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4, 1, 5, 3, 2} […]
Following questions have been asked in GATE CS 2014 exam. 1) The number of distinct minimum spanning trees for the weighted graph below is ____ Answer: 6 Highlighted (in green) are the edges picked to make a MST. In the right side of MST, we could either pick edge ‘a’ […]
DATA STRUCTURE AND ALGO SET 1 DATA STRUCTURE AND ALGORITHMS MCQ GATE NET SET 1(a) DATA STRUCTURE AND ALGORITHMS MCQ GATE NET SET 1(b) DATA STRUCTURE AND ALGORITHMS MCQ GATE NET SET 2(a) DATA STRUCTURE AND ALGO SET 2 DATA STRUCTURE AND ALGO SET 3 DATA STRUCTURE AND ALGO SET […]
Q.1 Which of the following relational algebra operations do not require the participating tables to be union-compatible? (A) Union (B) Intersection (C) Difference (D) Join Ans: (D) Q.2 Which of the following is not a property of transactions? (A) Atomicity (B) Concurrency (C) Isolation (D) Durability Ans: (B) […]
1. In the relational modes, cardinality is termed as: (A) Number of (B) Number of attributes. (C) Number of tables. (D) Number of constraints. Ans: A 2 . Relational calculus is a (A)Procedural […]
Q.1 Which of the following relational algebra operations do not require the participating tables to be union-compatible? (A) Union (B) Intersection (C) Difference (D) Join Ans: (D) Q.2 Which of the following is not a property of transactions? (A) Atomicity (B) Concurrency […]
81. A data dictionary does not provide information about A. Where data is located B. who owns it C. size of disk storage device D. How the data is used Ans Correct Answer is C 82. Data item characteristics that are important in data management include A. […]
