Sunday, 30 April 2017

UGC NET Computer Science Questions Paper II June 2008 - Part 3

21.       Which of the following data structures is most efficient in terms of both space and time to reverse a string of characters?
(A) Linked list
(B) Stack
(C) Array
(D) Tree
Answer: B
22.       Which of the following can be the sequence of nodes examined in a binary search tree while searching for key 98?
(A) 100, 50, 75, 60, 98
(B) 100, 120, 90, 95, 98
(C) 200, 70, 100, 95, 98
(D) 75, 150, 90, 80, 98
Answer: C
23.       Which of the following is true for a sorted list with ‘n’ elements?
(A) Insertion in a sorted array takes constant time.
(B) Insertion in a sorted linear linked list takes constant time.
(C) Searching for a key in a sorted array can be done in O(log n) time.
(D) Searching for a key in a sorted linear linked list can be done in O(log n) time.
Answer: C
24.       Files that are related to input/output and are used to model serial I/O devices such as terminals, printers and networks are called :
(A) regular files           
(B) character special files
(C) directories
(D) block special files
Answer: D
25.       An example of a possible file attribute is:
(A) minimum size
(B) permanent flag
(C) archive flag
(D) EBCDIC flag
Answer: C
26.       The ATM cells are ................ bytes long.
(A) 48
(B) 53
(C) 64
(D) 69
Answer: B
27.       For slotted ALOHA, the maximum channel utilization is :
(A) 100%
(B) 50%
(C) 36%
(D) 18%
Answer: C
28.       For a channel of 3 KHz bandwidth and signal to noise ratio of 30 dB, the maximum data rate is:
(A) 3000 bps
(B) 6000 bps
(C) 15000 bps
(D) 30000 bps
Answer: D
29.       An example of a public key encryption algorithm is:
(A) Caesar cipher algorithm 
(B) DES algorithm
(C) AES algorithm                  
(D) Knapsack algorithm
Answer: D
30.    With reference to hierarchical routing, the optimum number of levels for an m router subnet is:
(A) m2   
(B) m                 
(C) ln m
(D) √m
Answer: C

Friday, 28 April 2017

UGC NET Computer Science Questions Paper II December 2008 - Part 5

41.       In which of the following, ready to execute processes must be present in RAM?
(A) multiprocessing
(B) multiprogramming
(C) multitasking
(D) all of the above
Answer: D
42.       If the executing program size is greater than the existing RAM of a computer, it is still possible to execute the program if the OS supports:
(A) multitasking
(B) virtual memory
(C) paging system
(D) none of the above
Answer: B
43.       Software Quality Assurance(SQA) encompasses:
(A) verification                                     
(B) validation
(C) both verification and validation 
(D) none of the above
Answer: C
44.       Which level is called as “defined” in capability maturity model?
(A) level 0
(B) level 3
(C) level 4
(D) level 1
Answer: B
45.       COCOMO model is used for:
(A) product quality estimation          
(B) product complexity estimation
(C) product cost estimation               
(D) all of the above
Answer: C
46.       Font sizes are usually expressed in points. One point is:
(A) 0.0069 inch
(B) 0.0138 inch
(C) 0.0207 inch
(D) 0.0276 inch
Answer: B
47.       Assertion (A): Cellular telephone systems can handle a multitude of users.
Reasoning (R): Cellular telephone systems permit extensive frequency reuse in a small local area.
(A) Both (A) and (R) are true and (R) is the correct explanation for (A)
(B) Both (A) and (R) are true but (R) is not the correct explanation
(C) (A) is true but (R) is false
(D) (A) is false but (R) is true
Answer: A
48.       E-commerce involves:
(A) Electronic Data Interchange      
(B) Electronic mail
(C) Electronic Bulletin Boards         
(D) All of the above
Answer: D
49.       An example of a data mining algorithm which uses squared error score function is:
(A) CART algorithm                
(B) back propagation algorithm
(C) a priority algorithm                       
(D) vector space algorithm
Answer: B
50.    (I) Each object in the active directory of windows 2000 has an access control list.
(II) The scheme is a blueprint of all objects in the domain of windows 2000.
Which of the following is true?
(A) only (I)                    
(B) only (II)
(C) both (I) and (II)      
(D) none of the above
Answer: C

Wednesday, 26 April 2017

UGC NET Computer Science Questions Paper II December 2008 - Part 4

31.       Aggregation is:
(A) an abstraction through which relationships are treated as lower level entities
(B) an abstraction through which relationships are treated as higher level entities
(C) an abstraction through which relationships are not treated at all as entities
(D) none of the above
Answer: B
32.       Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 form a decomposition of R. Then the decomposition is a lossless join decomposition of R provided that:
(A) R1∩R2→R1 is in F+
(B) R1∩R2→R2 is in F+
(C) both R1∩R2→R1 and R1∩R2→R2 functional dependencies are in F+
(D) at least one from R1∩R2→R1 and R1∩R2→R2 is in F+
Answer: D
33.       In a heap, every element is …………… of all the elements in the subtree.
(A) maximum
(B) minimum
(C) sum
(D) product
Answer: A
34.       If (rear==maxsize-1) rear=0; else rear=rear+1; is required in:
(A) circular queue
(B) linear queue
(C) stack
(D) deque
Answer: D
Explanation:
A double-ended queue (dequeue, often abbreviated to deque) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list.
35.       A high performance switching and multiplexing technology that utilizes fixed length packets to carry different types of traffic is:
(A) ATM
(B) ADSL
(C) SONET
(D) None of the above
Answer: A
36.       A conventional LAN bridge specifies only the functions of OSI:
(A) layers 1 and 2
(B) layers 1 through 3
(C) all layers
(D) none of the above
Answer: A
37.       An assembly program contains:
(A) imperative and declarative statements
(B) imperative and assembler directives
(C) imperative and declarative statements as well as assembler directives
(D) declarative statements and assembler directives
Answer: C
38.       In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register?
(A) absolute mode
(B) immediate mode
(C) indirect mode
(D) index mode
Answer: D
39.       Which of the following are Assembler Directives?
(i) EQU
(ii) ORIGIN
(iii) START
(iv) END
(A) (ii), (iii) and (iv)      
(B) (i), (iii) and (iv)
(C) (iii) and (iv)                        
(D) (i), (ii), (iii) and (iv)
Answer: D
40.    Which of the following OS treats hardware as a file system?
(A) UNIX
(B) DOS
(C) Windows NT
(D) None of the above
Answer: A

Monday, 24 April 2017

UGC NET Computer Science Questions Paper II December 2008 - Part 3

21.       N processes are waiting for I/O. A process spends a fraction p of its time in I/O wait state. The CPU utilization is given by:
(A) 1-p-N
(B) 1-pN 
(C) pN    
(D) p-N
Answer: B
Explanation:
According to the probabilistic model, if a process spends a fraction p of its time in I/O wait state, and if there are N processes in memory, then the CPU utilization is given by 1-pN
22.       If holes are half as large as processes, the fraction of memory wasted in holes is:
(A) 2/3
(B) 1/2   
(C) 1/3
(D) 1/5
Answer: D
23.       An example of a non pre-emptive scheduling algorithm is:
(A) Round Robin        
(B) Priority Scheduling
(C) Shortest job first   
(D) 2 level scheduling
Answer: C
24.       An example of distributed OS is:
(A) Amoeba
(B) UNIX
(C) MS-DOS
(D) MULTICS
Answer: A
25.       Which one of the following describes correctly a static variable?
(A) It cannot be initialized
(B) It is initialized once at the commencement of execution and cannot be changed at run time
(C) It retains its value during the life of the program
(D) None of the above
Answer: C
26.       The output of the program code
main()
{
int x=0;
while (x<=10)
for(;;)
if(++x%10==0)
break;
printf(“x=%d”,x);
}
is :
(A) x=1
(B) compilation error
(C) x=20
(D) none of the above
Answer: C
Explanation:
Since the value of x initially is 0, the while condition would be true and the for loop would start executing. The if statement condition would be checked, since ++x would become 1 and 1%10 is not equal to 0, break will not be executed. Since for is infinite x value will go on increasing. Once the value of x reaches 9, ++x would become 10 and 10%10==0 and so break would be executed.
So control will come out of the innermost loop and would go to the outer loop. Since the value of x is 10, the while loop again executed, once again the for loop would start its execution. Once the value of x reaches 20, 20%10 will be equal to 0 and again break will be executed and control would go to the outer for loop.
When the condition is checked for while (x<=10), it is false as the value of x is 20 and so it comes out of the while loop and the printf statement gets executed, printing the value of 20.
27.       A copy constructor is invoked when:
(A) a function returns by value        
(B) an argument is passed by value
(C) a function returns by reference 
(D) none of the above
Answer: B
28.       When a language has the capability to produce new data types, it is said to be:
(A) extensible
(B) encapsulated
(C) overloaded
(D) none of the above
Answer: A
29.       How many constructors can a class have?
(A) zero
(B) 1
(C) 2
(D) any number
Answer: D
30.    An entity has:
(i) a set of properties
(ii) a set of properties and values for all the properties
(iii) a set of properties and the values for some set of properties may non-uniquely identify an entity
(iv) a set of properties and the values for some set of properties may uniquely identify an entity
Which of the above are valid?
(A) (i) only
(B) (ii) only       
(C) (iii) only
(D) (iv) only
Answer: D

Wednesday, 15 March 2017

GATE Computer Science Solved Paper 2017 Session II - Part 5

41.       Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M.
Which of the following decision problems are undecidable?
I. Given a regular expression R and a string w, is w ϵ L(R)?
II. Given a context-free grammar G, is L(G) = Φ?
III. Given a context-free grammar G, is L(G) = ∑* for some alphabet ∑?
IV. Given a Turing machine M and a string w, is w ϵ L(M)?
(A) I and IV only
(B) II and III only
(C) II, III and IV only
(D) III and IV only
Answer: D
42.       The next state table of a 2-bit saturating up-counter is given below.
The counter is built as a synchronous sequential circuit using T flip-flops. The expressions for T1 and T0 are
Answer: B
43.       Consider the following snippet of a C program. Assume that swap (& x, & y) exchanges the contents of x and y.
int main() {
int array[] = {3, 5, 1, 4, 6, 2);
int done = 0;
int i;
while (done == 0) {
done = 1;
for (i=0; i<=4; i++) {
if (array[i] < array[i+1]) {
swap(&array[i], &array[i+1]);
done = 0;
}
}
for (i=5; i>=1; i--) {
if (array[i] > array[i-1]) {
swap(&array[i], &array[i-1]);
done = 0;
}
}
}
printf (“%d”, array[3]);
}
The output of the program is ...................
Answer: 3.0
44.       Two transactions T1 and T2 are given as
T1: r1(X)w1(X)r1(Y)w1(Y)
T2: r2(Y)w2(Y)r2(Z)w2(Z)
where ri(V) denotes a read operation by transaction Ti on a variable V and wi(V) denotes a write operation by transaction Ti on a variable V. The total number of conflict serializable schedules that can be formed by T1 and T2 is ...............
Answer: 54.0
45.       The read access times and the hit ratios for different caches in a memory hierarchy are as given below.
The read access time of main memory is 90 nanoseconds. Assume that the caches use the referred-word-first read policy and the write back policy. Assume that all the caches are direct mapped caches. Assume that the dirty bit is always 0 for all the blocks in the caches. In execution of a program, 60% of memory reads are for instruction fetch and 40% are for memory operand fetch. The average read access time in nanoseconds (up to 2 decimal places) is ..................
Answer: 4.72

46.       Consider the following database table named top_scorer.
Consider the following SQL query:
SELECT ta.player FROM top scorer AS ta
WHERE ta.goals > ALL (SELECT tb.goals
FROM top_scorer AS tb
WHERE tb.country = ‘Spain’)
AND ta.goals >ANY(SELECT tc.goals
FROM top_scorer AS tc
WHERE tc.country = ‘Germany’)
The number of tuples returned by the above SQL query is ...............
Answer: 7.0
47.       If the ordinary generating function of a sequence
then a3-a0 is equal to ....................
Answer: 15.0
48.       If a random variable X has a Poisson distribution with mean 5, then the expectation E[(X+2)2] equals ................
Answer: 54.0
49.       In a B+ tree, if the search-key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then the maximum order of the B+ tree is ...................
Answer: 52.0
50.    A message is made up entirely of characters from the set X={P,Q,R,S,T}. The table of probabilities for each of the characters is shown below:
If a message of 100 characters over X is encoded using Huffman coding, then the expected length of the encoded message in bits is ..............
Answer: 225.0
51.    Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time.
The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is ................
Answer: 29.0
52.    If the characteristic polynomial of a 3 x 3 matrix M over R (the set of real numbers) is λ3-4λ2+aλ+30, a ϵ R, and one eigen value of M is 2, then the largest among the absolute values of the eigen values of M is .................
Answer: 5.0
53.    Consider a machine with a byte addressable main memory of 232 bytes divided into blocks of size 32 bytes. Assume that a direct mapped cache having 512 cache lines is used with this machine. The size of the tag field in bits is .............
Answer: 18.0
54.    Consider the following C Program.
#include<stdio.h>
int main() {
int m = 10;
int n, n1;
n = ++m;
n1=m++;
n--;
--n1;
n-=n1;
printf(“%d”, n);
return 0;
}
The output of the program is ..................
Answer: 0
55.    Consider the following C Program.
#include<stdio.h>
#include<string.h>
int main() {
char* c = “GATECSIT2017”;
char* p = c;
printf(“%d”, (int)strlen(c+2[p]-6[p]-1));
return 0;
}
The output of the program is .................
Answer: 2.0

Pages   2   3   4   5