If Any request contact us :techtanu17@gmail.com << Catch on Facebook << If any link broken, Plz tell. we try to fix them.

Thursday 11 July 2013

DECEMBER 2009 PAPER II SOLVED PART-1

UGC NET JUNE 2013 SYLLABUS, MODEL PAPER/ PREVIOUS YEARS SOLVED QUESTION PAPERS.
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
COMPUTER BASIC QUESTIONS FOR BANK EXAM, HTAT, CTAT, TAT, UGC-NET, INTERVIEW AND OTHER EXAM'S, WHERE BASIC QUESTION'S ARE REQUIRED.
 

1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is ________________.
(i) Commutative 

(ii) transitive 
(iii) implicative 
(iv) equivalence

(A) (i) and (ii) 

(B) (iii) 
(C) (i),(ii),(iii) and (iv) 
(D) None of these


2. Circle has ________
(A) No vertices 

(B) only 1 vertex 
(C) vertices 
(D) None of these


8. The highest noise margin is offered by
(A) BICMOS 

(B) TTL 
(C) ECL
(D) CMOS


9. The answer of the operation (10111)2 * (1110)2 in hex equivalence is
(A) 150 

(B) 241 
(C) 142
(D) 101011110

10. How many ‘1’ are present in the binary representation of
3 X 512 + 7 X 64 + 5 X 8 + 3

(A) 8 

(B) 9 
(C) 10 
(D) 11

11. Recursive functions are executed in a
(A) First in first out order (B) Last in first out order
(C ) Parallel fashion (D) Load Balancing


12. What would be the output of the following program, if run from the commandline as “myprog 1 2 3”?
main(int argc,char *argv[])
{
int i;
i=argv[1]+argv[2]+argv[3];
printf(“%d”,i);
}

(A) 123 

(B) 6 
(C) Error 
(D) “123”


 13. A _______________ is a special method used to initialize the instance variable of a class.
(A) Member function 

(B) Destructor 
(C) Constructor
(D) structure


14. Encapsulation is
(A) Dynamic binding
(B) A mechanism to associate the code and data
(C ) Data abstraction
(D ) Creating new class



15. Which of the statements are true?
I. Function overloading is done at compile time.
II. Protected members are accessible to the member of a derived class.
III. A derived class inherits constructors and destructors
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.

(A) I,II,III 

(B) II,III,V
(C) III,IV,V 
(D) I,II,IV


16. The E-R model is expressed in terms of
I. Entities
II. The relationship among entitites
III. The attributes of the entities.
IV. Functional relationship.

(A) I,II 

(B) I,II, IV 
(C) II,II,IV 
(D) I,II,IV


17. Specialization is ________________process.
(A) top-down 

(B) bottom up
(C ) both (A) and (B)

 (D) none of these


 18. Match the following:
(1) Determinants                     (a) No attributes
(2) Candidate key                   (b) Uniquely identified a row
(3) Non-redundancy                 (c ) A constraint between two attributes
(4) Functional dependency     (d) Group of attributes on the left hand side of arrow
of function dependency

(A) 1 – d, 2 – b, 3 – a, 4 – c
(B) 2 – d, 3 – a, 1- b, 4 – c
(C) 4 – a, 3 – b, 2 – c, 1 – d
(D) 3 – a, 4 – b, 1 – c, 2 – d


 

19. A function that has no partial functional dependencies is in _____________ form.
(A) 3 NF

 (B) 2 NF 
(C) 4 NF 
(D) BCNF

 
 
20. Which of the following statement is wrong?
I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.

 
(A) I ,II,III 

(B) II,III,IV 
(C) III,IV,V 
(D) II,IV,V


21. If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in a tree?
(A) It is an odd number.
(B) It is an even number.
(C ) It cannot be equal to the number of leaves.
(D ) It is always greater than twice the number of leaves.


 
 
22. The number of edges in a complete graph of n vertices is
(A) n 

(B) n(n-1)/2 
(C ) n(n+1)/2 
(D) n2/2


23. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car can’t leave until all the cars in front of it have left. Is the parking lot more like
(A) An array

 (B) A stack
 (C) A queue 
(D) A linked list


24. With regard to linked list, which of the following statement is false ?
(A) An algorithm to search for an element in a singly linked list requires O(n) operations in the worst case.
(B) An algorithm for deleting the first element in a singly linked list requires o(n) operations in the worst case.
(C ). An algorithm for finding the maximum value in a circular linked list requires o(n) operations.
(D ). An algorithm for deleting the middle node of a circular linked list requires o(n) operations.



25. A hash function f defined as f(key)=key mod 7, with linear probing used to resolve collisions. Insert the keys 37,38,72,48,98 and 11 into the table indexed from 0 to 6. What will be the location of 11?
(A) 3

 (B) 4 
(C ) 5 
(D) 6


 IF YOU FIND ANY ANS WRONG,COMMENT ME,SO THAT I RIGHT THAT ANSWER.
THANKS


0 comments:

Post a Comment