search
Log In

Recent questions tagged ugcnetjuly2018ii

0 votes
4 answers
1
Can anyone solve the following recurrence relation problem which was asked in this year Ugc net paper 2
asked Aug 18, 2018 in DS Ammu9682 2.1k views
0 votes
2 answers
2
The definitions in an XML document are said to be ______ when the tagging system ans definitions in the DTD are all in compliance well-formed reasonable valid logical
asked Jul 13, 2018 in Web Technologies Pooja Khatri 1.1k views
1 vote
1 answer
3
Consider the JavaScript Code: var y= 12 function f() { var y= 6 ; alert (this.y); function g() {alert (y); } g(); } f(); If $M$ is the number of alert dialog boxes generated by this JavaScript code and D1, D2, $\dots$, $D_M$ represents the content displayed in the each ... displays 6 ; D2 displays 12 ; D3 displays 6 M=2; D1 displays 6 ; D2 displays 12 . M=3; D1 displays 12 ; D2 displays 6
asked Jul 13, 2018 in Web Technologies Pooja Khatri 1.4k views
1 vote
3 answers
4
What is the output of the following JAVA program? class simple { public static void main(String[ ] args) { simple obj = new simple(); obj.start(); } void start() { long [] P = {3, 4, 5}; long [] Q = method (P); System.out.print (P[0] + P[1] +P[2]+”:”); System.out.print (Q[0] + Q[1] + Q[2]); } long [ ] method (long [ ] R) { R[1] = 7; return R; } } //end of class 12:15 15:12 12:12 15:15
asked Jul 13, 2018 in Java Pooja Khatri 1.2k views
0 votes
2 answers
5
What is the output of the following C' program? (Assuming little - endian representation of multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory address.) #include<stdio.h> #include<stdlib.h> /* Assume short int occupies two bytes of storage */ int main () { union saving { short int ... 0], m.two[1], m.one); }/* end of main */ 5, 2, 1282 5, 2, 52 5, 2, 25 5, 2, 517
asked Jul 13, 2018 in Programming and DS Pooja Khatri 1.5k views
1 vote
3 answers
6
Given below are three implementations of the swap() function in C++: a b c void swap (int a, int b) { int temp; temp=a; a=b; b=temp; } int main() { int p=0, q=1; swap(p, q); } void swap (int &a, int &b) { int temp; temp=a; a=b; b=temp; } int main() ... p=0, q=1; swap(&p, &q); } Which of these would actually swap the contents of the two integer variables p and q? a only b only c only b and c only
asked Jul 13, 2018 in Object Oriented Programming Pooja Khatri 1.7k views
0 votes
3 answers
7
In Java, which of the following statements is/are TRUE? S1: The final' keyword applied to a class definition prevents the class form being extended through derivation S2: A class can only inherit one class but can implement multiple interfaces S3: Java permits a class to replace the ... . It is called method overloading Code: S1 and S2 only S1 and S3 only S2 and S3 only All of S1, S2 and S3
asked Jul 13, 2018 in Object Oriented Programming Pooja Khatri 570 views
0 votes
1 answer
8
Which of the following statements is/are true? P: C programming language has a weak type system with static types. Q: Java programming language has a string type system with static types Code: P only Q only Both P and Q Neither P nor Q
asked Jul 13, 2018 in Programming Pooja Khatri 681 views
1 vote
2 answers
9
A graphic display system has a frame buffer that is 640 pixels high ans 1 bit of color depth. If the access time for each pixel on the average is 200 nanoseconds, then the refresh rate of this frame buffer is approximately: 16 frames per second 19 frames per second 21 frames per second 23 frames per second
asked Jul 13, 2018 in Computer Graphics Pooja Khatri 3.5k views
0 votes
1 answer
10
Which of the following statements is/are True regarding the solution of the visibility problem in 3D graphics? S1: The painter's algorithm sorts polygons by depth and then paints (scan - converts) each Polygon on to the screen starting with the most nearest polygon S2: Backface Culling refers to eliminating geometry with backfacing normals S1 only S2 only Both S1 and S2 Neither S1 nor S2
asked Jul 13, 2018 in Computer Graphics Pooja Khatri 1.1k views
2 votes
2 answers
11
Consider the matrix $M=\begin{bmatrix} 2 & 0 & 2 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{bmatrix}$ representing a set of planar (2D) geometric transformations in homogeneous coordinates. Which of the following statements about the matrix M is True? M represents first, a ... 1) followed by shearing of parameters (-1,1) M represents first, a shearing of parameters (-1, 1) followed by scaling of vector (3,1)
asked Jul 13, 2018 in Computer Graphics Pooja Khatri 2.2k views
0 votes
2 answers
12
Assume the following regarding the development of a software system P: Estimated lines of codes P : 33, 480 LOC Average productivity for P : 620 LOC per person -month Number of software developers : 6 Average salary of a software developer : INR 50, 000 per month If E, D and C are the estimated development ... respectively, then (E, D, C) = ______ (48, 8, 24) (54, 9, 27) (60, 10, 30) (42, 7, 21)
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 1.4k views
1 vote
2 answers
13
Match the following in Software Engineering: List - I List - II Product Complexity Software Requirements Definition Structured System Analysis Software Design Coupling and Cohesion Validation Technique Symbolic Execution Software Cost Estimation a-ii; b-iii; c-iv; d-i a-iii; b-i; c-iv; d-ii a-iv; b-i; c-ii; d-iii a-iii; b-iv; c-i; d-ii
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 1.4k views
0 votes
3 answers
14
Which one of the following is not typically provided by Source Code Management Software? Synchronization Versioning and Revision history Syntax highlighting Project forking
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 497 views
0 votes
2 answers
15
A software system crashed 20 times in the year 2017 and for each crash, it took 2 minutes to restart. Approximately, what was the software availability in that year? 96.9924% 97.9924% 98.9924% 99.9924%
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 613 views
0 votes
3 answers
16
Match the 5 CMM Maturity levels/CMMI staged representations in List - I with their characterizations in List - II: List - I List - II Initial Processes are improved quantitatively and continually Repeatable The plan for a project comes from a template for plans Defined The plan uses processes that can be measured quantitatively ... -v; e-iii a-v; b-iv; c-ii; d-iii; e-i a-iv; b-v; c-ii; d-iii; e-i
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 708 views
0 votes
2 answers
17
Coupling is a measure of the strength of the interconnections between software modules. Which of the following are correct statements with respect to module coupling? P: Common coupling occurs when one module controls the flow of another module by passing it information on what to do Q: In data coupling, ... and use only parts of it. Code: P and Q only P and R only Q and R only All of P, Q and R
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 1.1k views
0 votes
1 answer
18
A software design pattern often used to restrict access to an object is adapter decorator delegation proxy
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 316 views
0 votes
2 answers
19
Reasons to re-engineer a software include: P: Allow legacy software to quickly adapt to the changing requirements Q: Upgrade to newer technologies/platforms/paradigm (for example, object-oriented) R: Improve software maintainability S: Allow change in the functionality and architecture of the software Code: P, R and S only P and R only P, Q and S only P, Q and R only
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 579 views
2 votes
2 answers
20
Which of the following is not a key strategy followed by the clean room approach to software development? Formal specification Dynamic verification Incremental development Statistical testing of the system
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 912 views
0 votes
3 answers
21
Which of the following statements is/are True? P: Refactoring is the process of changing a software system in such a way that it does not alter the external behavior of the code yet improves the internal architecture Q: An example of refactoring is adding new features to satisfy a customer requirement discovered after a project is shipped Code: P only Q only Both P and Q Neither P nor Q
asked Jul 13, 2018 in IS&Software Engineering Pooja Khatri 907 views
0 votes
1 answer
22
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is $\theta \: (lg \: m)$ $\theta \: (m)$ $\theta \: (mlg \: m)$ $\theta \: (lglg \: m)$
asked Jul 13, 2018 in Algorithms Pooja Khatri 558 views
0 votes
2 answers
23
Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are ______ and _____ respectively (Root is at level 0). 3, 14 3, 10 4, 14 4, 10
asked Jul 13, 2018 in DS Pooja Khatri 922 views
0 votes
1 answer
24
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18? 3 4 5 6
asked Jul 13, 2018 in DS Pooja Khatri 1.4k views
0 votes
2 answers
25
Which of the following algorithms solves the single-source shortest paths? Prim's algorithm Floys-Warshall algorithm Johnson's algorithm Dijkstra's algorithm
asked Jul 13, 2018 in DS Pooja Khatri 986 views
0 votes
1 answer
26
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding will have the average length of 2.4 1.87 3.0 2.15
asked Jul 13, 2018 in Probability Pooja Khatri 947 views
0 votes
3 answers
27
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves: cannot have more than 37 nodes has exactly 37 nodes has exactly 35 nodes cannot have more than 35 nodes
asked Jul 13, 2018 in DS Pooja Khatri 1k views
0 votes
1 answer
28
Match the following with respect to algorithm paradigms: List - I List - II (a) The 8-Queen's problem (i) Dynamic programming (b) Single-Source shortest paths (ii) Divide and conquer (c) STRASSEN's Matrix multiplication (iii) Greedy approach (d) Optimal binary search trees (iv) Backtracking ... -iii, d-ii a-iv; b-iii, c-i, d-ii a-iii; b-iv, c-ii, d-i a-iv; b-iii, c-ii, d-i
asked Jul 13, 2018 in Algorithms Pooja Khatri 833 views
1 vote
2 answers
29
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number): 45 72 360 450
asked Jul 13, 2018 in DS Pooja Khatri 4.6k views
0 votes
1 answer
30
Consider a Boolean function of 'n' variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is Logarithmic Linear Quadratic Exponential
asked Jul 13, 2018 in Algorithms Pooja Khatri 465 views
...