Recent questions tagged ugcnetjune2015iii

1
The unix command: $vi file1 file2 Edits file1 and stores the contents of file1 in file2 Both files i.e., file1 and file2 can be edited using 'ex' command to travel between the files Both files can be edited using 'mv' command to move between the files Edits file1 first, saves it and then edits file2 2 votes 1 answer 2 WOW32 is a Win 32 API library for creating processes and threads Special kind of file system to the NT name space Kernel-mode objects accessible through Win 32 API Special execution environment used to run 16 bit Windows applications on 32-bit machines 3 votes 1 answer 3 Match the following for unix system calls: List-I List-II a. exec i. Creates new process b. brk ii. Invokes another program overlaying memory space with a copy of an executable file c. wait iii. To increase or decrease the size of data region d. fork iv. A process synchronizes with termination of child process ... , d-i a-iii, b-ii, c-iv, d-i a-iv, b-iii, c-ii, d-i a-iv, b-iii, c-i, d-ii 4 votes 3 answers 4 Suppose the function y and a fuzzy integer number around - 4 for x are given as$y=(x-3)^2 + 2$. Around - 4 ={(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively. Then f(Around-4) is given by {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)} {(2, 0.6), (3, 1), (6, 1), (11, 0.3)} {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)} {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)} 4 votes 1 answer 5 Let A and B be two fuzzy integers defined as: A={(1.0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)} B={(10, 0.5), (11, 1), (12, 0.5)} Using fuzzy arithmetic operation given by$\mu_{A+B^{(Z)}} = \underset{x+y=z}{\oplus} (\mu_A (x) \otimes \mu_B(y))f(A+B)$... 15, 1), (16, 0.5), (17, 0.2)} {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)} 3 votes 1 answer 6 Consider the two class classification task that consists of the following points: Class$C_1$: [1 1.5] [1 -1.5] Class$C_2$: [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by:$x_1+x_2+1.5=0x_1+x_2-1.5=0x_1+1.5=0x_1-1.5=0$2 votes 1 answer 7 Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution S3: If ... the two problems are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3 3 votes 3 answers 8 Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution 3 votes 1 answer 9 In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of rows or columns rows + columns rows + columns -1 rows + columns +1 3 votes 1 answer 10 In a binary Hamming Code the number of check digits is r then number of message digits is equal to$2^r-12^r-r-12^r-r+12^r+r-1$3 votes 2 answers 11 The redundancy in images stems from pixel decolleration pixel colleration pixel quantization image size 2 votes 2 answers 12 Given the symbols A, B, C, D, E, F, G and H with the probabilities$\frac{1}{30}, \frac{1}{30}, \frac{1}{30}, \frac{2}{30}, \frac{3}{30}, \frac{5}{30}, \frac{5}{30}$and$\frac{12}{30}$respectively. The average Huffman code size in bits per symbol is$\frac{67}{30}\frac{70}{34}\frac{76}{30}\frac{78}{30}$3 votes 4 answers 13 Given the following grammars:$G_1S \rightarrow AB \mid aaBA \rightarrow aA \mid \epsilonB \rightarrow bB \mid \epsilonG_2$:$S \rightarrow A \mid BA \rightarrow a A b \mid abB \rightarrow abB \mid \epsilon$Which of the ... grammars$G_1$is unambiguous and$G_2$is ambiguous grammars both$G_1$and$G_2$are ambiguous grammars both$G_1$and$G_2$are unambiguous grammars 2 votes 2 answers 14 Given the following two statements:$S_1$: If$L_1$and$L_2$are recursively enumerable languages over$|Sigma$, then$L_1 \cup \L_2$and$L_1 \cap L_2$are also recursively enumerable.$S_2$: The set of recursively enumerable languages is countable. Which of the following is true ...$S_1$is not correct and$S_2$is correct Both$S_1$and$S_2$are not correct Both$S_1$and$S_2$are correct 3 votes 2 answers 15 A context free grammar for$L=\{w \mid n_0 (w) > n_1 (w)\}$is given by:$S \rightarrow 0 \mid 0S \mid 1 S SS \rightarrow 0 S \mid 1 S \mid 0 S S \mid 1 S S \mid 0 \mid 1S \rightarrow 0 \mid 0 S \mid 1 S S \mid S 1 S \mid S S 1S \rightarrow 0 S \mid 1 S \mid 0 \mid 1$2 votes 2 answers 16 Match the following: List-I List-II a. Joint Application Design (JAD) i. Delivers functionality in rapid iteration measured in weeks and needs frequent communication, development, testing and delivery b. Computer Aided Software Engineering ii. Reusable applications generally with one specific function. It is closely linked with ... b-iii, c-i, d-ii a-iii, b-iv, c-i, d-ii a-iii, b-i, c-iv, d-ii 3 votes 1 answer 17 Match the following with respect to heuristic search techniques: List-I List-II a. Steepest accent Hill Climbing i. Keeps track of all partial paths which can be candidate for further exploration b. Branch - and - bound ii. Discover problem state(s) that satisfy a set of constraints c. Constraint satisfaction iii. Detects ... ii a-iv, b-i, c-ii, d-iii a-iii, b-iv, c-i, d-ii a-iv, b-ii, c-i, d-iii 3 votes 1 answer 18 Which of the following statements is true for Branch-and-Bound search? Underestimates of remaining distance may cause deviation from optimal path Overestimates can't cause right path to be overlooked Dynamic programming principle can be used to discard redundant partial paths All of the above 5 votes 2 answers 19 In propositional language$P \leftrightarrow Q$is equivalent to (where$\sim$denotes NOT)$\sim (P \vee Q) \wedge \sim (Q \vee P)(\sim P \vee Q) \wedge (\sim Q \vee P)(P \vee Q) \wedge (Q \vee P)\sim (P \vee Q) \rightarrow \sim (Q \vee P)\$
20
Match the following knowledge representation techniques with their applications: List-I List-II a. Frames i. Pictorial representation of objects, their attributes and relationships b. Conceptual dependencies ii. To describe real world stereotype events c. Associative networks iii. Record like structures for grouping closely related ... iv, c-ii, d-i a-iv, b-iii, c-i, d-ii a-iv, b-iii, c-ii, d-i
21
Match the following: List-I List-II a. Intelligence i. Contextual, tacit, transfer needs learning b. Knowledge ii. Scattered facts, easily transferrable c. Information iii. Judgemental d. Data iv. Codifiable, endorsed with relevance and purpose ... iv, d-i a-iii, b-i, c-iv, d-ii a-i, b-ii, c-iii, d-iv a-i, b-iii, c-iv, d-ii
22
A unix file may be of the type Regular file Directory file Device file Any one of the above
23
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy Index Linked Contiguous Bit Map
24
Dining Philosopher's problem is a Producer - consumer problem Classical IPC problem Starvation problem Synchronization primitive
25
What is the most appropriate function of Memory Management Unit (MMU)? It is an associative memory to store TLB It is a technique of supporting multiprogramming by creating dynamic partitions It is a chip to map virtual address to physical address It is an algorithm to allocate and deallocate main memory to a process
26
Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? Queues have different priorities Each queue may have different scheduling algorithm Processes are permanently assigned to a queue This algorithm can be configured to match a specific system under design
27
Match the following for operating system techniques with the most appropriate advantage: List-I List-II a. Spooling i. Allows several jobs in memory to improve CPU utilization b. Multiprogramming ii. Access to shared resources among geographically dispersed computers in a transparent way c. Time sharing iii. Overlapping I/O and ... iii, b-i, c-iv, d-ii a-iv, b-iii, c-ii, d-i a-ii, b-iii, c-iv, d-i