# Recent questions tagged ugcnetjune2013iii

1 vote
1
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
1 vote
2
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 \}$
3
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
4
Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation? Semantic network Frames Scripts Conceptual Dependency
5
The map colouring problem can be solved using which of the following technique? Means-end analysis Constraint satisfaction AO* search Breadth first search
6
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
7
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
8
Which one of the following is not an informed search technique? Hill climbing search Best first search A* search Depth first search
9
Which one of the following is the correct implementation of the meta-predicate &ldquo;not&rdquo; 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):- !.
10
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
11
Working set model is used in memory management to implement the concept of Swapping Principal of Locality Segmentation Thrashing
12
An operating system using banker&rsquo;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 allocation of devices as follows: State 1 ... State 1 is safe and State 2 is unsafe Both State 1 and State 2 are safe Both State 1 and State 2 are unsafe
13
Suppose S and Q are two semaphores initialized to 1. P1 and P2 are two processes which are sharing resources. P1 has statements wait(S); wait(Q); critical-section 1; signal(S); signal(Q); P2 has statements wait(Q); wait(S); critical-section 2; signal(Q); signal(S); Their execution may sometimes lead to an undesirable situation called Starvation Race condition Multithreading Deadlock
14
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, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are 9 and 7 7 and 6 9 and 8 8 and 6
15
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
16
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
17
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}$
18
Hamming distance between 100101000110 and 110111101101 is 3 4 5 6
19
Binary symmetric channel uses Half duplex protocol Full duplex protocol Bit oriented protocol None of the above
20
Match the following: a. calloc( ) i. Frees previously modified b. free( ) ii. Modifies previously allocated space c. malloc( ) iii. Allocates space for array d. realloc( ) iv. Allocates requested size of space a-iii, b-i, c-iv, d-ii a-iii, b-ii, c-i, d-iv a-iii, b-iv, c-i, d-ii a-iv, b-ii, c-iii, d-i
1 vote
21
Trace the error: void main() { int *b, &a; *b=20; printf(&ldquo;%d, %d&rdquo;, a, *b) } No error Logical error Syntax error Semantic error
22
What will be the output of the following segment of the program? main() { char *s=&rdquo;hello world&rdquo;; int i=7; printf(&ldquo;%, *s, i, s); } syntax error hello w hello o world
23
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
24
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
25
Match the following: a. TTL i. High component density b. ECL ii. Low power consumption c. MOS iii. Evaluation of "diode-transistor-logic" d. CMOS iv. High speed digital circuits a-iii, b-ii, c-i, d-iv a-i, b-iv, c-iii, d-ii a-iii, b-iv, c-i, d-ii a-i, b-ii, c-iii, d-iv
26
The simplified function in product of sums of Boolean function $F(W, X, Y, Z) = \Sigma(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)$
27
Interrupt which arises from illegal or erroneous use of an instruction or data is Software interrupt Internal interrupt External interrupt None of the above