UGC NET JUNE 2005 SOLVED PAPERII PART-1

2013-05-31T22:13:00.001-07:00

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.Which of the following is not true ?
(A) Power of deterministic automata is equivalent to power of non-deterministic automata.
(B) Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata.
(C) Power of deterministic turing machine is equivalent to power of non-deterministic
turing machine.
(D) All the above

2.Identify the language which is not context - free.
(A)L5{?w w Rw e{?}* }
(B) L5{anbn|n ??0 }
(C)L5{?w ww e{?}* }
(D) L5{anbm cm dn | n, m??0 }

5.Minimum number of individual shoes to be picked up from a dark room ( containing
10 pair of shoes) if we have to get atleast one proper pair :
(A) 2
(B) 20
(C) 11
(D) None of these

6.(101011)25(53)b, then b is equal to :
(A) 4
(B) 8
(C) 10
(D) 16

7.The logic expression x y z1x y z1x y z1x y z reduces to :
(A) x z
(B) x y z
(C) y
(D) y z

8.Which of the following logic has the maximum fan out ?
(A) RTL
(B) ECL
(C) N MOS
(D) C MOS

9.Which of the following binary number is the same as its 2s complement :
(A) 1010
(B) 0101
(C) 1000
(D) 1001

10.Identify the logic function performed by the circuit shown

(A) Exclusive-OR
(B) AND
(C) Exclusive-NOR
(D) NOR

11.After 3 calls of the c function bug ( ) below, the values of i and j will be :
int j = 1;
bug ( )
{ Static int i = 0; int j = 0;
i++; j++;
return (i) ; }
(A) i = 0, j = 0
(B) i = 3, j = 3
(C) i = 3, j = 0
(D) i = 3, j = 1

12.Find the output of the following C code :
Main ( )
{ int x = 20, y = 35;
x = y++ + x++;
y = ++y + ++x;
printf (%d, %d\n, x, y); }
(A) 55, 93
(B) 53, 97
(C) 56, 95
(D) 57, 94

13.The data hiding is taken care by :
(A) Abstraction
(B) Encapsulation
(C) Modularity
(D) Inheritance

14.If a data-item is declared as a protected access specifier then it can be accessed :
(A) Anywhere in the program
(B) By the base and derived classes
(C) Only by base class
(D) Only by derived class

15.
Main ( )
{ char *str = abcde;
printf (%c, *str);
printf (%c, *str++);
printf (%c, *(str++));
printf (%s, str);}

The output of the above C code will be :
(A) a a c b c d e
(C) a a b c d e
(B) a a c c c d e
(D) None of these

16.An Entity - relationship diagram is a tool to represent :
(A) Data model
(B) Process model
(C) Event model
(D) Customer model

17.Which of the following tools is not required during system analysis phase of system
development Life cycle ?
(A) CASE Tool
(B) RAD Tool
(C) Reverse engineering tool
(D) None

18.A black hole in a DFD is a :
(A) A data store with no in bound flows
(B) A data store with only in bound flows
(C) A data store with more than one in bound flow
(D) None of these.

19.Multi-valued dependency among attribute is checked at which level ?
(A) 2 NF
(B) 3 NF
(C) 4 NF
(D) 5 NF

20.A WINDOW into a portion of a data base is :
(A) Schema
(B) View
(C) Query
(D) Data Dictionary

21.What is the time required to insert an element in a stack with linked implementation ?
(A) O (log2n)
(B) O (n)
(C) O (n log2n)
(D) O (1)

22.Which of the following statement is false ?
(A) Every tree is a bipertite graph
(B) A tree contains a cycle
(C) A tree with n nodes contains n-1 edges
(D) A tree is a connected graph

23. In the balanced binary tree given below, how many nodes will become unbalanced
when a node is inserted as a child of the node g ?

(A) 1
(B) 3
(C) 7
(D) 8

24.If the postfix form of a string is ABC12D*, the actual string is :
(A) (A2(B1C))*D
(B) ((A2B)1C)*D
(C) ((A1B)2C)*D
(D) (A1(B2C))*D

25.The algorithm that will efficiently sort an array that is nearly sorted except for the
interchange of some adjacent pairs of numbers like : { 1, 3, 2, 5, 4, 6} is :
(A) Quick sort
(B) Bubble sort
(C) Merge sort
(D) Selection sort

GOTO JUNE 2005 PART-2

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

try post

2013-05-05T02:17:00.000-07:00

TRY GOOGLE DOC

dotcomshare

UGC NET JUNE 2005 SOLVED PAPERII PART-1

try post