# Recent questions tagged ugcnetjune2016iii

1 vote
1
A triangulation of a polygon is a set of $T$ chords that divide the polygon into disjoint triangles. Every triangulation of $n$ vertex convex polygon has ____ chords and divides the polygon into ____ triangles $n-2, n-1$ $n-3, n-2$ $n-1, n$ $n-2, n-2$
2
Suppose that we have numbers between 1 and 1,000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? 925, 221, 912, 245, 899, 259, 363, 364 3, 400, 388, 220, 267, 383, 382, 279, 364 926, 203, 912, 241, 913, 246, 364 3, 253, 402, 399, 331, 345, 398, 364
1 vote
3
Match the following: a. Huffman code i. $O(n^2)$ b. Optical Polygon Triangulation ii. $\theta(n^2)$ c. Activity selection problem iii. $O(nlgn)$ d. Quicksort iv. $\theta(n)$ a-i, b-ii, c-iv, d-iii a-i, b-iv, c-ii, d-iii a-iii, b-ii, c-iv, d-i a-iii, b-iv, c-ii, d-i
4
Which one of the following array represents a binary max-heap? [26, 13, 17, 14, 11, 9, 15] [26, 15, 14, 17, 11, 9, 13] [26, 15, 17, 14, 11, 9, 13] [26, 15, 13, 14, 11, 9, 17]
5
Let $A[1,...,n]$ be an array of n distinct numbers. If $i<j$ and $A[i]>A[j]$, then the pair $(i,j)$ is called an inversion of $A$. What is the expected number of inversions in any permutation on $n$ elements? $\theta(n)$ $\theta(lgn)$ $\theta(nlgn)$ $\theta(n^2)$
6
The number of different binary trees with 6 nodes is 6 42 132 256
7
Encrypt the plain text message "EXTRANET" usig Transposition cipher technique with the following key: 3 5 2 1 4 (Cipher text) 1 2 3 4 5 P(lain text) Using 'Z' as bogus character TAXERTZENZ EXTRANETZZ EZXZTRZANZET EXTZRANZETZ
8
Assume that we need to download text documents at the rate of 100 pages per minute. A page is in average of 24 lines with 80 characters in each line requires 8 bits. Then the required bit rate of the channel is 1.636 Kbps 1.636 Mbps 3.272 Mbps 3.272 Kbps
1 vote
9
Match the following: a. Line coding i. A technique to change analog signal to digital data b. Block coding ii. Provides synchronization without increasing number of bits c. Scrambling iii. Process of converting digital data to digital signal d. Pulse code modulation iv. provides redundancy to ensure synchronization and inherits ... iii, b-iv, c-ii, d-i a-i, b-iii, c-ii, d-iv a-ii, b-i, c-iv, d-iii
1 vote
10
Given the following statements: Frequency Division Multiplexing is a technique that can be applied when a bandwidth of a link is greater than combined bandwidth of signals to be transmitted Wavelength Division Multiplexing (WDM) is an analogue multiplexing technique to combine optical signals WDM is a digital ... and d are false a, b, and d are false; c is true a, b, and d are true; c is false
1 vote
11
The symmetric differences of two sets $S_1$ and $S_2$ is defined as: $S_1 \oplus S_2 =\{x \mid x \in S_1 \text{ or } x \in S_2, \text{ but x is not in both } S_1 \text{ and } S_2 \}$ The nor of two languages is ... difference The family of regular languages are closed under both symmetric difference and nor The family of regular languages are not closed under both symmetric difference and nor
1 vote
12
Match the following types of variables with the corresponding programming languages: a. Static variable i. Local variables in Pascal b. Stack dynamic ii. All variables in APL c. Explicit heap dynamic iii. Fortran 77 d. Implicit heap dynamic iv. All objects in JAVA a-i, b-iii, c-iv, d-ii a-iv, b-i, c-iii, d-ii a-iii, b-i, c-iv, d-ii a-ii, b-i, c-iii, d-iv
1 vote
13
Given the following statements: To implement Abstract Data Type, a programming language require a syntactic unit to encapsulate type definition To implement ADT, a programming language requires some primitive operations that are built in the language processor C++, Ada, Java 5.0, C#2005 provide support for ... are false a, b are true, c is false a is true, b and c are false a, b and c are true
14
Which of the following statements is/are correct with reference to curve generation? Hermite curves are generated using the concepts of interpolation Bezier curves are generated using the concepts of approximation The Bezier curve lies entirely within the convex hull of its control points The degree ... number of control points I, II and IV only II and III only I and II only I, II and III only
1 vote
15
Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further Sh$_x$ and Sh$_y$ are shearing factors in x and y directions. If we perform the y direction shear relative to x=s$_{ref}$ then the transformed point is given by $x’=x+Sh_x.(y-y_{ref}); y’=y$ $x’=x; y’=y.Sh_x$ $x’=x; y’=Sh_y(x-x_{ref})+y$ $x’=Sh_y.y; y’=y.(x-x_{ref})$
16
Which of the following is a sequential circuit? Multiplexer Decoder Full adder Counter
17
Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower rectangular corner at (-5, 1) and upper right-hand corner at (3, 7). Consider the following three lines for clipping with the given ... EF: E(-2,3) and F(1,2) Which of the following lines is/are candidate for clipping? AB DC EF AB and CD
18
Consider the following ORACLE relations: R(A, B, C)={<1, 2, 3>, <1, 2, 0>, <1, 3, 1>, <6, 2, 3>, <1, 4, 2>, <3, 1, 4>} S(B, C, D)={<2, 3, 7>, <1, 4, 5>, <1, 2, 3>, <2, 3, 4>, <3, 1, 4>} Consider teh following two SQL queries: SQ$_1$; SELECT R.B, AVG ... D)>1; If M is the number of tuples returned by SQ$_1$ and If N is the number of tuples returned by SQ$_2$ then M=4, N=2 M=5, N=3 M=2, N=2 M=3, N=3
1 vote
19
Which of the following statements is true? $D_1$: The decomposition of the schema R(A, B, C) into R$_1$(A,B) and R$_2$(A,C) is always lossless $D_2$: The decomposition of the schema R(A, B, C, D, E) having AD $\rightarrow$ B, C $\rightarrow$ DE, B $\rightarrow$ ... $_2$(A, C, C, D, E) is lossless Both $D_1$ and $D_2$ Neither $D_1$ nor $D_2$ Only $D_1$ Only $D_2$
20
Consider teh relations $R(A, B)$ and $S(B, C)$ and the following four relational algebra queries over R ans S $\pi_{A, B} (R \bowtie S)$ $R \bowtie \pi_B(S)$ $R \cap (\pi_A(R) \times \pi_B (S))$ $\Pi_{A. R. B} (R \times S)$ where $R.B$ refers to ... determine that: I, III and IV are the same query II, III and IV are the same query I, II and IV are the same query I, II and III are the same query
21
A point P(5,1) is rotated by 90$^o$ about a pivot point (2,2). What is the coordinate of new transformed point P'? (3,5) (5,3) (2,4) (1,5)
22
In perspective projection, if a line segment joining a point which lies in front of the viewer to a point in back of the viewer is projected to a broken line of infinte extent. This is known as ____ View confusion Vanishing point Topological distortion Perspective foreshortening
1 vote
23
A Pure ALOHA Network transmits 200 bit frames using a shared channel with 200 kbps bandwidth . If the system (all stations put together) produces 500 frames per sec , then the throughput of the system is 0.384 0.184 0.286 0.586
1 vote
24
A software program that infers and manipulates existing knowledge in order to generate new knowledge is known as: Data Dictionary Reference Mechanism Inference Engine Control Strategy
25
Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning? $I$ $HI$ $CHI$ $GHI$
1 vote
26
Which of the following information about the UNIX file system is not correct? Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks An i-node contains accounting information as well as enough information to ... disk blocks that holds the file's data Each i-node is 256-bytes long All the files and directories are stored in data blocks
27
Consider the following ORACLE relations: R(A, B, C)={<1, 2, 3>, <1, 2, 0>, <1, 3, 1>, <6, 2, 3>, <1, 4, 2>, <3, 1, 4>} S(B, C, D)={<2, 3, 7>, <1, 4, 5>, <1, 2, 3>, <2, 3, 4>, <3, 1, 4>} Consider teh following two SQL queries: SQ$_1$; SELECT R.B, AVG ... D)>1; If M is the number of tuples returned by SQ$_1$ and If N is the number of tuples returned by SQ$_2$ then M=4, N=2 M=5, N=3 M=2, N=2 M=3, N=3
Consider the statement "Either $-2 \leq x \leq -1 \text{ or } 1 \leq x \leq 2$" The negation of this statement is x<-2 or 2<x or -1<x<1 x<-2 or 2<x -1<x<1 x $\leq$ -2 or 2 $\leq$ x or -1<x<1