#1
29th November 2014, 08:23 AM
| |||
| |||
Computer Science Papers
I am looking for previous year question papers of GATE Computer Science so please provide me the same for preparation?
|
#2
29th November 2014, 12:13 PM
| |||
| |||
Re: Computer Science Papers
Here I am providing you previous year question papers for preparation of GATE Computer Science. GATE Computer Science Engineering Papers: 1 The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node? A) 24 B) 25 C) 26 D) 27 Answer : (C) 2 The Boolean function x, y, + xy + x, y A) x, + y, B) x + y C) x + y, D) x, + y Answer : (D) 3 In an MxN matrix such that all non-zero entries are covered in a rows and b columns. Then the maximum number of non-zero entries, such that no two are on the same row or column, is A) £ a + b B) £ max {a, b} C) £ min {M-a, N-b} D) £ min {a, b} Answer : (A) 4 The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies: A) name, courseNo -> grade B) rollNo, courseNo -> grade C) name -> rollNo D) rollNo -> name The highest normal form of this relation scheme is Answer : (A) 5 The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by A) the instruction set architecture B) page size C) physical memory size D) number of processes in memory Answer : (D) 6 Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of G is 8. Then, the size of the maximum independent set of G is A) 12 B) 8 C) Less than 8 D) More than 12 Answer : (A) 7 What does the following algorithm approximate? (Assume m > 1, Î > 0). x = m; y-i; while (x - y > Î) { x = (x + y) / 2 ; y = m/x ; } print (x) ; A) log m B) m2 C) m1/2 D) m1/3 Answer : (C) 8 Consider the following C program main () { int x, y, m, n ; scanf ("%d %d", &x, &y); / * Assume x > 0 and y > 0 * / m = x; n = y ; while ( m ! = n) { if (m > n) m = m — n; else n = n - m ; } printf("%d",n); } The program computes A) x + y, using repeated subtraction B) x mod y using repeated subtraction C) the greatest common divisor of x and y D) the least common multiple of x and y Answer : (C) 9 The best data structure to check whether an arithmetic expression has balanced parentheses is a A) queue B) stack C) tree D) list Answer : (B) 10 A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8,5,3,2 Two new elements 1 and 7 are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is A) 10,8,7,5,3,2,1 B) 10,8,7,2,3,1,5 C) 10,8,7,1,2,3,5 D) 10,8,7,3,2,1,5 Answer : (D) 11 An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be A) 255.255.0.0 B) 255.255.64.0 C) 255.255.128.0 D) 255.255.252.0 Answer : (D) 12 Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 ms. The minimum frame size is: A) 94 B) 416 C) 464 D) 512 Answer : (C) 13 The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? A) 2 B) 3 C) 4 D) 6 Answer : (B) 14 Consider the following C function: int f (int n) { static int i = 1; if (n >= 5) return n; n = n + i; i ++; return f (n); } The value returned by f(1) is A) 5 B) 6 C) 7 D) 8 Answer : (C) 15 The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by A) the instruction set architecture B) page size C) physical memory size D) number of processes in memory Answer : (D) Detailed previous year question papers of GATE Computer Science: |
#3
22nd May 2015, 11:00 AM
| |||
| |||
Re: Computer Science Papers
Hey, I want to get Computer Science paper of the UGC NET exam will you provide me the sample Computer Science paper of the UGC NET exam?
|
#4
22nd May 2015, 11:03 AM
| |||
| |||
Re: Computer Science Papers
As you want I am here providing you sample Computer Science paper of the UGC NET exam. Sample paper : 1. Infrared signals can be used for short range communication in a closed area using _______ propagation. (A) ground (B) sky (C) line of sight (D) space 2. A bridge has access to _______ address in the same network. (A) Physical (B) Network (C) Datalink (D) Application 3. The minimum frame length for 10 Mbps Ethernet is _______ bytes and maximum is _______ bytes. (A) 64 & 128 (B) 128 & 1518 (C) 1518 & 3036 (D) 64 & 1518 4. The bit rate of a signal is 3000 bps. If each signal unit carries 6 bits, the baud rate of the signal is _______. (A) 500 baud/sec (B) 1000 baud/sec (C) 3000 baud/sec (D) 18000 baud/sec. 7. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ? (A) Removing left recursion alone (B) Removing the grammar alone (C) Removing left recursion and factoring the grammar (D) None of the above 8. A shift reduce parser suffers from (A) shift reduce conflict only (B) reduce reduce conflict only (C) both shift reduce conflict and reduce reduce conflict (D) shift handle and reduce handle conflicts 15. Regression testing is primarily related to (A) Functional testing (B) Development testing (C) Data flow testing (D) Maintenance testing 16. How many different truth tables of the compound propositions are there that involve the propositions p & q ? (A) 2 (B) 4 (C) 8 (D) 16 Computer Science paper of the UGC NET exam |
|