Name of the University : University of Hyderabad
Exam : Entrance Examinations
Paper: Ph.D.Computer Science
Document Type : Model Question Paper
Year : 2016
Website : http://igmlnet.uohyd.ac.in:8000/question-papers.htm#Ph_D_-_Programs_
Download Model/Sample Question Paper :
2010 : https://www.pdfquestion.in/uploads/11500-Computer2010.pdf
2011 : https://www.pdfquestion.in/uploads/11500-Computer2011.pdf
2012 : https://www.pdfquestion.in/uploads/11500-Computer2012.pdf
2013 : https://www.pdfquestion.in/uploads/11500-Computer2013.pdf
2014 : https://www.pdfquestion.in/uploads/11500-Computer2014.pdf
2015 : https://www.pdfquestion.in/uploads/11500-Computer2015.pdf
2016 : https://www.pdfquestion.in/uploads/11500Computer2016.pdf
Ph.D.Computer Science Question Paper :
Time : 2 Hours
Maximum Marks : 75
Instructions :
1. Write your Hall Ticket Number in the box above and on the OMR Answer Sheet.
2. This test is for 2 hours duration carrying 75 marks.
Related : University of Hyderabad Entrance Exam Ph.D. Communication Sample Question Paper : www.pdfquestion.in/11492.html
3. All Answers should be marked clearly in the OMR answer sheet.
4. Every correct answer get 1 (ONR) mark. There is negative marking of 0.33 marks for every wrong answer’
5. Do all the rough work only in the pages provided in the question booklet, nowhere else.
6. Use of non-programmable calculator and log-tables is allowed.
7. Hand over the OMR answer sheet to the Invigilator before leaving the examination hall.
1. Which of the following protocols has all of the properties :
(i) imposing restrictions on the order of items being accessed,
(ii) ensuring serviceability without the requirement of two phase locking, and
(iii) additionally ensuring deadlock freedom.
A. Three phase locking
B. Time stamp ordering
C. Graph based locking
D. Strict two phase locking
2. The property which ensures “once a transaction completes successfully, the changes it has made to databases persist, even if there are subsequent failures” is called
A. Atomicity
B. Consistency
C. Isolation
D. Durability
3. Which of the following is an index mechanism, where an index record appears for only some of the search key values?
A. Dense index
B. Sparse index
C. multi-level index
D. None of these
4. In the context of databases SET concept is used in
A. Relational Model
B. Network Model
C. Hierarchical Model
D. Physical Model
5. Databases that store information about the states of real world along with timeline are
A. Temporal databases
B, Mobile data bases
C. Multimedia databases
D. Spatial databases
7. The condition – ,there are no non-trivial functional dependencies of attributes on anything other than a super set of a candidate key”, is both necessary and sufficient for a database to be in
A. 2″d Normal form
B. 3″d Normal form
C. PJNF
D. BCNF
9. In a University, 7232 students have taken a course in Spanish, 879 have taken a course in French and 114 have taken a course in Russian. Further, 103 have taken course in both Spanish and French, 23 have taken in course both Spanish and Russian, and 14 have taken course in both French and Russian, If 2092 students have taken at ]east one of Spanish, french and Russian, how many students have taken a course in all three languages
A.7
B. 14
C. 23
D. 103
10. Which of the following declarations are legal ?
I. int a=0, b=1 , c=2 int array[3]={a,b,c};
IL int size = 3;int array size];
III. int size = 3;int array size]= {1,2,3};
IV. AII of the above
A. II and III
B. I only
C.IV
D. I and II
16. In the following program which segment is the variable ‘p’ to be stored ?
#include <stdio.h>
int main O{
char ch = ‘a’; p = & a;
pri.ntf (“o|c”, *p) ;
return 0;
)
A. Code/text segment
B. Data segment
C. Stack segment
D. BSS segment
17. Which of the following is a bottom-up approach to design a database by examining relationships among attributes ?
A. Functional dependency
B. Database modelling
C. Normalization
D. Decomposition
18. Emp narne,street,city,state,pincode)is a schema. For any pin code, there is only one city and state. AIso for a given street, city and state, there is just one pin code. In normalization terms, emp is a relation in
A. 1NF oniy
B. 2NF and hence in lNF
C. 3NF.and hence also in 2NF and 1NF
D. BCNF and hence also in 3NF and 2NF and lNF
19. Which of the following is not associated with transaction processing
A. Conforming an action or triggering response
B. Producing detail summary or exception report
C. Recording a business activity
D. Maintaining a data
20. The statement, Insert Into Instructor Values is of type ?
A. Query
B. DML
C. Relational
D. DDL
21. The data models defined by a ANSI-SPARC database architecture are
A. Conceptual, physical and internal
B. Conceptual, view and external
C. Logical, physical and internal
D. Logical, physical, view
22. In a connected planar graph, every vertex has degree 3 and every region has degree 5 or 6. Let P be the number of regions with degree 5. Then P equals to
A. 12
B. 10
c. 11
D. 13
23. In a graph G, if the set of edges incident on each vertex of G is a cut-set, then the graph G is
A. separable
B. nonseparablc
C. connected
D. Eulerian
24. The number of cut-vertices in a tree with n vertices and rn leaves is
A. n+m
B. n
C. M
D) n-m
25. Which of the following can be sequences of degree of vertices in a simple connected graph with 6 vertices.
A. 5,4,4,3,2,L
B. 5,4,4,3,2,2
c. 5,4,4,3,2,0
D. 7,5,1,4,2,2