Recent questions tagged ugcnetjune2015ii

1 vote
1
Which of the following is not valid with reference to Message Passing Interface(MPI)? MPI can run on any hardware platform The programming model is a distributed memory model All parallelism is implicit MPI- Comm - Size returns the total number of MPI processes in specified communication
2
Which of the following statements is false about weak entity set? Weak entities can be deleted automatically when their strong entity is deleted Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the ... included Tuples in a weak entity set are not partitioned according to their relationship with tuples with a strong entity set
3
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time? Selection sort Bubble sort Radix sort Insertion sort
4
Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? The PVM communication model provides asynchronous blocking send, asynchronous blocking receive, amd non-blocking receive function Message buffers are allocated dynamically The PVM communication model assumes that ... is no limit to the size or number of such messages In PVM model, the message order is not preserved
5
In the case of parallelization, Amdahl's law states that if $P$ is the proportion of a program that can be made parallel and $(1-P)$ is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using $N$ processors is: $\dfrac{1}{(1-P)+N.P} \\$ $\dfrac{1}{(N-1)P+P} \\$ $\dfrac{1}{(1-P)+\frac{P}{N}} \\$ $\dfrac{1}{P+\frac{(1-P)}{N}}$
1 vote
6
Which one from the following is highly associated activity of project planning? Keep track of the progress Compare the actual and planned progress and costs Identify the activities, milestones and deliverables produced by a project Both B and C
7
Cohesion is an extension of: Abstraction concept Refinment concept Information hiding concept Modularity
1 vote
8
Which process model is also called as classic life cycle model? Waterfall model RAD model Prototyping model Incremental model
9
Which of the testing strategy requirements established during requirements analysis are validated against developed software? validation testing integration testing regression testing system testing
10
Match the following: ... $a-ii, b-i, c-iv, d-iii$ $a-iv, b-ii, c-iii, d-i$ $a-iii, b-i, c-iv, d-ii$
1 vote
11
What does the following command do? grep -vn "abc" x It will print all of the lines in the file x that match the search string "abc" It will print all of the lines in file x that do not match the search string "abc" It will print the total number of lines in ... x that match the search string "abc" It will print the specific line numbers of the file x in which there is a match for string "abc"
12
A LRU page replacement is used with $4$ page frames and eight pages. How many page faults will occur with the reference string $0172327103$ if the four frames are initially empty? $6$ $7$ $5$ $8$
13
Let $P-i$ and $P_j$ two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes $p_i$ and $P_j$ which of the conditions are not true? $R(P_i) \cap W(P_j) = \Phi$ $W(P_i) \cap R(P_j) = \Phi$ $R(P_i) \cap R(P_j) = \Phi$ $W(P_i) \cap W(P_j) = \Phi$
14
A disk drive has $100$ cylinders, numbered $0$ to $99$. Disk requests come to the disk driver for cylinders $12, 26, 24, 4, 42, 8$ and $50$ in that order. The driver is currently serving a request at a cylinder $24$. A seek takes $6$ msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? $0.984$ sec $0.396$ sec $0.738$ sec $0.42$ sec
15
Which phase of compiler generates stream of atoms? Syntax Analysis Lexical Analysis Code Generation Code Optimization
1 vote
16
Which one of the following is false? LALR parser is Bottom-Up parser A parsing algorithm which performs a left to right scanning and a right most deviation is RL($1$) LR parser is Bottom-Up parser In LL($1$), the $1$ indicates that there is a one symbol look-ahead
1 vote
17
If all the production rules have single non-terminal symbol on the left side, the grammar defined is: Context free grammar Context sensitive grammar Unrestricted grammar Phase grammar
1 vote
18
The translator which performs macro calls expansion is called Macro processor Micro pre-processor Macro pre-processor Dynamic linker
1 vote
19
Match the following: ... $a-iii, b-iv, c-ii, d-i$ $a-iv, b-i, c-iii, d-ii$ $a-iv, b-iii, c-ii, d-ii$
1 vote
20
Which of the following is/are restriction(s) in classless addressing? The number of addresses needs to be a power of $2$ The mask needs to be included in the address to define the block The starting address must be divisible by the number of addresses in the block All of the above
21
What is the size of the 'total length' field in $IPv4$ diagram? $4$ bits $8$ bits $16$ bits $32$ bits
1 vote
22
Which of the following is not associated with the session layer? Dialog control Token management Semantics of the information transmitted synchronization
1 vote
23
Match the following port numbers with their uses: ... $a-iv, b-i, c-ii, d-iii$ $a-ii, b-i, c-iv, d-iii$ $a-ii, b-iv, c-iii, d-i$ $a-ii, b-iv, c-i, d-iii$
1 vote
24
Which of the following protocols is an application layer protocol that establishes, manages and terminates multimedia sessions? Session Maintenance Protocol Real-time Streaming Protocol Real-time Transport Control Protocol Session Initiation Protocol
25
To determine the efficiency of an algorithm the time factor is measured by Counting micro seconds Counting number of key operations Counting number of statements Counting kilobytes of algorithm
26
The average case occurs in Linear Search Algorithm when The item to be searched is in some where middle of the Array The item to be searched is not in the array The item to be searched is in the last of t he array The item to be searched is either in the last or not in the array
27
Level order Traversal of a rooted Tree can be done by starting from root and performing: Breadth First Search Depth First Search Root Search Deep Search