December 2015 - Paper 2

1. Home
2. UGC NET Computer Science Solved Papers
3. December 2015
4. Paper 2

31:  

................. system is market oriented and is used for data analysis by knowledge workers including Managers, Executives and Analysts.

A.	OLTP
B.	OLAP
C.	Data System
D.	Market System
	Answer Report Discuss
	Option: B Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

32:  

.................. allows selection of the relevant information necessary for the data warehouse.

A.	The Top-Down View
B.	Data Warehouse View
C.	Data source View
D.	Business Query View
	Answer Report Discuss
	Option: A Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

33:  

The hash function used in double hashing is of the form:

A.	h(k, i)=(h 1 (k)+h 2 (k)+i)mod m
B.	h(k, i)=(h 1 (k)+h 2 (k)-i)mod m
C.	h(k, i)=(h 1 (k)+ih 2 (k))mod m
D.	h(k, i)=(h 1 (k)-ih 2 (k))mod m
	Answer Report Discuss
	Option: C Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

34:  

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.

It shows which of the following depth first forest?

A.	{a,b,e} {c,d,f,g,h}
B.	{a,b,e} {c,d,h} {f,g}
C.	{a,b,e} {f,g} {c,d} {h}
D.	{a,b,c,d} {e,f,g} {h}
	Answer Report Discuss
	Option: C Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

35:  

The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is:

A.	θ(log n  h*t)
B.	θ(log t  n*h)
C.	θ(log h  n)
D.	θ(log t  n)
	Answer Report Discuss
	Option: D Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

• «
• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• »