Dark Mode

Recent questions tagged ugcnetcse-june2013-paper3

1 vote

1 answer

1

UGC NET CSE | June 2013 | Part 3 | Question: 75
Consider a single perception with weights as given in the following figure: and $f(t)$ is defined as $f(t) \bigg\{ 1, t>0 \: 0, t \leq 0$ The above perception can solve OR problem AND problem XOR problem All of the above

go_editor asked in Others Jul 19, 2016

3.4k views

1 vote

1 answer

2

UGC NET CSE | June 2013 | Part 3 | Question: 74
If A and B are two fuzzy sets with membership functions $\mu _A (x)=\{0.6,0.5,0.1,0.7,0.8\}$ $\mu_B(x)=\{0.9, 0.2, 0.6, 0.8, 0.5\}$ Then the value of $\mu_{\overline{A \cup B} }(x)$ will be $\{0.9, 0.5, 0.6, 0.8, 0.8\}$ $\{0.6, 0.2, 0.1, 0.7, 0.5 \}$ $\{0.1, 0.5, 0.4, 0.2, 0.2\}$ $\{0.1, 0.5, 0.4, 0.2, 0.3 \}$

go_editor asked in Others Jul 19, 2016

11.2k views

2 votes

1 answer

3

UGC NET CSE | June 2013 | Part 3 | Question: 73
A fuzzy set A on R is ______ iff $A(\lambda x_1 + (1- \lambda)x_2) \geq min [A(x_1), A(x_2)]$ for all $x_1, x_2 \in R$ and all $\lambda \in [0,1]$ where minimum denotes the minimum operator. Support $\alpha$ - cut Convex Concave

go_editor asked in Others Jul 19, 2016

2.7k views

3 votes

2 answers

4

UGC NET CSE | June 2013 | Part 3 | Question: 72
Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation? Semantic network Frames Scripts Conceptual Dependency

go_editor asked in Data Mining and Warehousing Jul 19, 2016

12.5k views

2 votes

1 answer

5

UGC NET CSE | June 2013 | Part 3 | Question: 71
The map colouring problem can be solved using which of the following technique? Means-end analysis Constraint satisfaction AO* search Breadth first search

go_editor asked in Artificial Intelligence Jul 19, 2016

3.1k views

2 votes

2 answers

6

UGC NET CSE | June 2013 | Part 3 | Question: 70
Given two jugs of capacities 5 litres and 3 litres with no measuring marks on them. Then the minimum number of states to measure 4 litres of water will be 3 4 5 7

go_editor asked in Verbal Aptitude Jul 19, 2016

1.7k views

6 votes

3 answers

7

UGC NET CSE | June 2013 | Part 3 | Question: 69
If we convert $\exists u \forall v \forall x \exists y (P(f(u), v, x, y) \rightarrow Q(u,v,y))$ to $\forall v \forall x (P(f(a), v, x, g(v,x)) \rightarrow Q(a,v,g(v,x)))$. This process is known as Simplification Unification Skolemization Resolution

go_editor asked in Mathematical Logic Jul 19, 2016

2.3k views

3 votes

3 answers

8

UGC NET CSE | June 2013 | Part 3 | Question: 68
Which one of the following is not an informed search technique? Hill climbing search Best first search A* search Depth first search

go_editor asked in Algorithms Jul 19, 2016

5.1k views

3 votes

0 answers

9

UGC NET CSE | June 2013 | Part 3 | Question: 67
Which one of the following is the correct implementation of the meta-predicate “not” in PROLOG (Here G represents a goal)? not(G):- !, call(G), fail. not(G). not(G):- call(G), !, fail. not(G). not(G):- call(G), fail, !, not(G). not(G):- call(G), !, fail.not(G):- !.

go_editor asked in Artificial Intelligence Jul 19, 2016

1.2k views

2 votes

2 answers

10

UGC NET CSE | June 2013 | Part 3 | Question: 66
The versions of windows operating system like Windows XP and Window Vista uses following file system: FAT-16 FAT-32 NTFS (NT File System) All of the above

go_editor asked in Operating System Jul 19, 2016

2.0k views

3 votes

2 answers

11

UGC NET CSE | June 2013 | Part 3 | Question: 63
Working set model is used in memory management to implement the concept of Swapping Principal of Locality Segmentation Thrashing

go_editor asked in Operating System Jul 19, 2016

2.9k views

5 votes

1 answer

12

UGC NET CSE | June 2013 | Part 3 | Question: 61
An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of ... safe and State 2 is unsafe Both State 1 and State 2 are safe Both State 1 and State 2 are unsafe

go_editor asked in Operating System Jul 19, 2016

4.9k views

4 votes

2 answers

13

UGC NET CSE | June 2013 | Part 3 | Question: 60
Suppose $\text{S}$ and $\text{Q}$ are two semaphores initialized to $1.\;\text{P1}$ and $\text{P2}$ ... Their execution may sometimes lead to an undesirable situation called Starvation Race condition Multithreading Deadlock

go_editor asked in Operating System Jul 18, 2016

6.0k views

3 votes

1 answer

14

UGC NET CSE | June 2013 | Part 3 | Question: 59
A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that the page interrupt occurs when a new page is brought in the main memory, ... number of page interrupts in FIFO and LRU page replacement algorithms are 9 and 7 7 and 6 9 and 8 8 and 6

go_editor asked in Operating System Jul 18, 2016

2.6k views

2 votes

2 answers

15

UGC NET CSE | June 2013 | Part 3 | Question: 58
Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored): Process A B C D Arrival time 0 1 2 3 CPU Cycle 8 4 9 5 The average turnaround time of these processes will be 19.25 milliseconds 18.25 milliseconds 19.5 milliseconds 18.5 milliseconds

go_editor asked in Operating System Jul 18, 2016

3.8k views

3 votes

2 answers

16

UGC NET CSE | June 2013 | Part 3 | Question: 57
If f(x, y) is a digital image, then x, y and amplitude values of f are Finite Infinite Neither finite nor infinite None of the above

go_editor asked in Computer Graphics Jul 18, 2016

2.5k views

2 votes

1 answer

17

UGC NET CSE | June 2013 | Part 3 | Question: 56
The number of distinct binary images which can be generated from a given binary image of right M $\times$ N are M+N M $\times$ N 2$^{M+N}$ 2$^{MN}$

go_editor asked in Computer Graphics Jul 18, 2016

1.5k views

3 votes

3 answers

18

UGC NET CSE | June 2013 | Part 3 | Question: 54
Hamming distance between 100101000110 and 110111101101 is 3 4 5 6

go_editor asked in Computer Networks Jul 18, 2016

5.1k views

2 votes

1 answer

19

UGC NET CSE | June 2013 | Part 3 | Question: 53
Binary symmetric channel uses Half duplex protocol Full duplex protocol Bit oriented protocol None of the above

go_editor asked in Computer Networks Jul 18, 2016

2.0k views

3 votes

2 answers

20

UGC NET CSE | June 2013 | Part 3 | Question: 52
Match the following $:$ ... $\text{a-iii, b-iv, c-i, d-ii}$ $\text{a-iv, b-ii, c-iii, d-i}$

go_editor asked in Programming in C Jul 18, 2016

3.2k views

1 vote

2 answers

21

UGC NET CSE | June 2013 | Part 3 | Question: 51
Trace the error: void main() { int *b, &a; *b=20; printf(“%d, %d”, a, *b) } No error Logical error Syntax error Semantic error

go_editor asked in Programming and DS Jul 18, 2016

1.2k views

3 votes

1 answer

22

UGC NET CSE | June 2013 | Part 3 | Question: 50
What will be the output of the following segment of the program? main() { char *s=”hello world”; int i=7; printf(“%, *s, i, s); } syntax error hello w hello o world

go_editor asked in Programming in C Jul 17, 2016

1.7k views

3 votes

2 answers

23

UGC NET CSE | June 2013 | Part 3 | Question: 49
Suppose you want to delete the name that occurs before ‘Vivek’ in an alphabetical listing. Which one of the following data structures shall be most efficient for this operation? Circular linked list Doubly linked list Linked list Dequeue

go_editor asked in DS Jul 17, 2016

2.4k views

3 votes

2 answers

24

UGC NET CSE | June 2013 | Part 3 | Question: 47
Match the following: a. Foreign keys i. Domain constraint b. Private key ii. Referential integrity c. Event control action model iii. Encryption d. Data security iv. Trigger a-iii, b-ii, c-i, d-iv a-ii, b-i, c-iv, d-iii a-iii, b-iv, c-i, d-ii a-i, b-ii, c-iii, d-iv

go_editor asked in Databases Jul 17, 2016

1.8k views

2 votes

1 answer

25

UGC NET CSE | June 2013 | Part 3 | Question: 46
Match the following $:$ ... $\text{a-iii, b-iv, c-i, d-ii}$ $\text{a-i, b-ii, c-iii, d-iv}$

go_editor asked in Digital Logic Jul 17, 2016

1.6k views

2 votes

1 answer

26

UGC NET CSE | June 2013 | Part 3 | Question: 45
The simplified function in product of sums of Boolean function $F(W, X, Y, Z) = \Sigma(0,1, 2, 5, 8, 9, 10)$ is $(W’+X’)(Y’+Z’)(X’+Z)$ $(W’+X’)(Y’+Z’)(X’+Z’)$ $(W’+X’)(Y’+Z)(X’+Z)$ $(W’+X’)(Y+Z’)(X’+Z)$

go_editor asked in Digital Logic Jul 17, 2016

4.6k views

2 votes

3 answers

27

UGC NET CSE | June 2013 | Part 3 | Question: 44
Interrupt which arises from illegal or erroneous use of an instruction or data is Software interrupt Internal interrupt External interrupt None of the above

go_editor asked in CO and Architecture Jul 17, 2016

3.0k views

2 votes

1 answer

28

UGC NET CSE | June 2013 | Part 3 | Question: 43
What is not a p typical program control instruction? MR JMP SHL TST

go_editor asked in CO and Architecture Jul 17, 2016

2.3k views

2 votes

2 answers

29

UGC NET CSE | June 2013 | Part 3 | Question: 42
Computers can have instruction formats with only two address and three address instructions only one address and two address instructions only one address, two address and three address instructions zero address, one address, two address and three address instructions

go_editor asked in CO and Architecture Jul 17, 2016

1.8k views

4 votes

1 answer

30

UGC NET CSE | June 2013 | Part 3 | Question: 41
Which of the following is not an addressing mode? Register indirect Autoincrement Relative indexed Immediate operand

go_editor asked in CO and Architecture Jul 17, 2016

2.7k views

Page:

1
2
3
next »

Recent questions tagged ugcnetcse-june2013-paper3