Q3➡| Computer-Organization Which of the following in 8085 microprocessor performs HL = HL + DE ?
A ➥ DAD D
B ➥ DAD H
C ➥ DAD B
D ➥ DAD SP
Show Answer With Best Explanation
Answer: A Explanation: Upload Soon
Q4➡| Computer-Organization The register that stores all interrupt requests is:
A ➥ Interrupt mask register
B ➥ Interrupt service register
C ➥ Interrupt request register
D ➥ Status register
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q5➡|Computer-Organization The_______addressing mode is similar to register indirect addressing mode, except that an offset is added to the contents of the register. The offset and register are specified in the instruction.
A ➥ Base indexed
B ➥ Base indexed plus displacement
C ➥ Indexed
D ➥ Displacement
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q6➡| Computer-Organization In________ method, the word is written to the block in both the cache and main memory, in parallel.
A ➥ Write through
B ➥ Write back
C ➥ Write protected
D ➥ Direct mapping
Show Answer With Best Explanation
Answer: A Explanation: Upload Soon
Q7➡|Database-Management-System Which of the following statements concerning Object-Oriented databases is FALSE?
A ➥ Objects in an object-oriented database contain not only data but also methods for processing the data.
B ➥ Object-oriented databases store computational instructions in the same place as the data.
C ➥ Object-oriented databases are more adept at handling structured (analytical) data than relational databases.
D ➥ Object-oriented databases store more types of data than relational databases and access that data faster.
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q8➡|Database-Management-System In distributed databases, location transparency allows for database users, programmers and administrators to treat the data as if it is at one location. A SQL query with location transparency needs to specify:
A ➥ Inheritances
B ➥ Fragments
C ➥ Locations
D ➥ Local formats
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q9➡| Database-Management-System Consider the relations R(A, B) and S(B, C) and the following four relational algebra queries over R and S: I. ΠA, B (R ⨝ S) II. R ⨝ ΠB(S) III. R ∩ (ΠA(R) × ΠB(S)) IV. ΠA, R.B (R × S) where R⋅B refers to the column B in table R. One can determine that:
A ➥ I, III and IV are the same query.
B ➥ II, III and IV are the same query.
C ➥ I, II and IV are the same query.
D ➥ I, II and III are the same query.
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q10➡| Database-Management-System Which of the following statements is TRUE? D1 : The decomposition of the schema R(A, B, C) into R1(A, B) and R2 (A, C) is always lossless. D2 : The decomposition of the schema R(A, B, C, D, E) having AD → B, C → DE, B → AE and AE → C, into R1 (A, B, D) and R2 (A, C, D, E) is lossless.
A ➥ Both D1 and D2
B ➥ Neither D1 nor D2
C ➥ Only D1
D ➥ Only D2
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q11➡| Database-Management-System 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 the following two SQL queries SQ1 and SQ2 : SQ1 : SELECT R⋅B, AVG (S⋅B) FROM R, S WHERE R⋅A = S⋅C AND S⋅D < 7 GROUP BY R⋅B; SQ2 : SELECT DISTINCT S⋅B, MIN (S⋅C) FROM S GROUP BY S⋅B HAVING COUNT (DISTINCT S⋅D) > 1; If M is the number of tuples returned by SQ1 and N is the number of tuples returned by SQ2 then
A ➥ M = 4, N = 2
B ➥ M = 5, N = 3
C ➥ M = 2, N = 2
D ➥ M = 3, N = 3
Show Answer With Best Explanation
Answer: A Explanation: Upload Soon
Q12➡| Database-Management-System Semi-join strategies are techniques for query processing in distributed database system. Which of the following is a semi-join technique ?
A ➥ Only the joining attributes are sent from one site to another and then all of the rows are returned.
B ➥ All of the attributes are sent from one site to another and then only the required rows are returned.
C ➥ Only the joining attributes are sent from one site to another and then only the required rows are returned.
D ➥ Only the joining attributes are sent from one site to another and then only the required rows are returned.
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q13➡|Computer-Graphics Consider the Breshenham’s circle generation algorithm for plotting a circle with centre (0, 0) and radius ‘r’ units in first quadrant. If the current point is (xi , yi+1 ) and decision parameter is pi then what will be the next point (xi+1 , yi+1) and updated decision parameter pi+1 for pi≥0?
A ➥
B ➥
C ➥
D ➥
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q14➡|Computer-Graphics A point P(5, 1) is rotated by 90° about a pivot point (2, 2). What is the coordinate of new transformed point P′ ?
A ➥ (3, 5)
B ➥ (5, 3)
C ➥ (2, 4)
D ➥ (1, 5)
Show Answer With Best Explanation
Answer: A Explanation: Upload Soon
Q15➡|Computer-Graphics 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 a lower left-hand corner at (– 5, 1) and upper right-hand corner at (3, 7). Consider the following three lines for clipping with the given endpoint coordinates: Line AB : A (– 6, 2) and B (–1, 8) Line CD : C (– 1, 5) and D (4, 8) Line EF : E (–2, 3) and F (1, 2) Which of the following line(s) is/are candidate for clipping?
A ➥ AB
B ➥ CD
C ➥ EF
D ➥ AB and CD
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q16➡| Computer-Graphics 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 infinite extent. This is known as______.
A ➥ View confusion
B ➥ Vanishing point
C ➥ Topological distortion
D ➥ Perspective foreshortening
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q17➡| Computer-Graphics Let us consider that the original point is (x, y) and new transformed point is (x′, y′). Further, Shx and Shy are shearing factors in the x and y directions. If we perform the y-direction shear relative to x = xref then the transformed point is given by_____.
A ➥ x′ = x + Shx ⋅ (y – yref) y′ = y
B ➥ x′ = x y′ = y ⋅ Shx
C ➥ x′ = x y′ = Shy (x – xref) + y
D ➥ x′ = Shy ⋅ y y′ = y ⋅ (x – xref)
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q18➡| Computer-Graphics Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The Bezier curve lies entirely within the convex hull of its control points. IV. The degree of Bezier curve does not depend on the number of control points.
A ➥ I, II and IV only
B ➥ II and III only
C ➥ I and II only
D ➥ I, II and III only
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q19➡| Programming-in-c++ Given the following statements: (1) To implement Abstract Data Type, a programming language require a syntactic unit to encapsulate type definition. (2) To implement ADT, a programming language requires some primitive operations that are built in the language processor. (3) C++, Ada, Java 5.0, C#2005 provide support for parameterised ADT. Which one of the following options is correct ?
A ➥ (1), (2) and (3) are false.
B ➥ (1) and (2) are true; (3) is false.
C ➥ (1) is true; (2) and (3) are false.
D ➥ (1), (2) and (3) are true.
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q20➡|Programming
A ➥ (a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)
B ➥ (a)-(iv), (b)-(i), (c)-(iii), (d)-(ii)
C ➥ (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)
D ➥ (a)-(ii), (b)-(i), (c)-(iii), (d)-(iv)
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q21➡| Operating-Systems Which of the following is false regarding the evaluation of computer programming languages ?
A ➥ Application oriented features
B ➥ Efficiency and Readability
C ➥ Software development
D ➥ Hardware maintenance cost
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q22➡| Set-Theory Which of the following is correct?
A ➥ The family of regular languages is closed under symmetric difference but not closed under nor.
B ➥ The family of regular languages is closed under nor but not closed under symmetric difference.
C ➥ The family of regular languages are closed under both symmetric difference and nor.
D ➥ The family of regular languages are not closed under both symmetric difference and nor.
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q23➡| Theory-of-Computation The regular expression for the complement of the language L = {anbm|n ≥ 4, m ≤ 3} is:
A ➥ (λ + a + aa + aaa) b* + a* bbbb* + (a + b)* ba(a + b)*
B ➥ (λ + a + aa + aaa) b* + a* bbbbb* + (a + b)* ab(a + b)*
C ➥ (λ + a + aa + aaa) + a* bbbbb* + (a + b)* ab(a + b)*
D ➥ (λ + a + aa + aaa)b* + a* bbbbb* + (a + b)* ba(a + b)*
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q24➡| Theory-of-Computation Consider the following two languages : L1 = {0i1j| gcd (i, j) = 1} L2 is any subset of 0*. Which of the following is correct ?
A ➥ L1 is regular and L2* is not regular
B ➥ L1 is not regular and L2* is regular
C ➥ Both L1 and L2* are regular languages
D ➥ Both L1 and L2* are not regular languages
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q25➡|Computer-Networks If link transmits 4000 frames per second and each slot has 8 bits, the transmission rate of circuit of this TDM is ____________.
A ➥ 64 Kbps
B ➥ 32 Mbps
C ➥ 32 Kbps
D ➥ 64 Mbps
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q26➡|Computer-Networks Given the following statements: (1) Frequency Division Multiplexing(FDM) is a technique that can be applied when the bandwidth of a link is greater than combined bandwidth of signals to be transmitted. (2) Wavelength Division Multiplexing (WDM) is an analog multiplexing Technique to combine optical signals. (3) WDM is a Digital Multiplexing Technique. (4) TDM is a Digital Multiplexing Technique. Which of the following is correct?
A ➥ (1), (2), (3) and (4) are true.
B ➥ (1), (2), (3) and (4) are false.
C ➥ (1), (2) and (4) are false; (3) is true.
D ➥ (1), (2) and (4) are True; (3) is false.
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q27➡| Computer-Networks 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 second, then the throughput of the system is____________.
A ➥ 0.384
B ➥ 0.184
C ➥ 0.286
D ➥ 0.586
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q28➡|Data-Communication Match the following:
A ➥ (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
B ➥ (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
C ➥ (a)-(i), (b)-(iii), (c)-(ii), (iv)-(iv)
D ➥ (a)-(ii), (b)-(i), (c)-(iv), (d)-(iii)
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q29➡| Computer-Networks Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is_____.
A ➥ 1.636 Kbps
B ➥ 1.636 Mbps
C ➥ 3.272 Mbps
D ➥ 3.272 Kbps
Show Answer With Best Explanation
Answer: (MARKS TO ALL) Explanation: Upload Soon
Q30➡|Network-Security Encrypt the plain text Message “EXTRANET” using Transposition cipher technique with the following key: Using ‘Z’ as bogus character.
A ➥ TAXERTZENZ
B ➥ EXTRANETZZ
C ➥ EZXZTRZANZET
D ➥ EXTZRANZETZ
Show Answer With Best Explanation
Answer: A Explanation: Upload Soon
Q31➡| Data-Structures The number of different binary trees with 6 nodes is __________.
A ➥ 6
B ➥ 42
C ➥ 132
D ➥ 256
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q32➡|Array 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 ?
A ➥ θ(n)
B ➥ θ(lgn)
C ➥ θ(nlgn)
D ➥ θ(n2)
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q33➡|Data-Structures Which one of the following arrays represents a binary max-heap?
A ➥ [26, 13, 17, 14, 11, 9, 15]
B ➥ [26, 15, 14, 17, 11, 9, 13]
C ➥ [26, 15, 17, 14, 11, 9, 13]
D ➥ [26, 15, 13, 14, 11, 9, 17]
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q34➡|Data-Structures
A ➥ (a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)
B ➥ (a)-(i), (b)-(iv), (c)-(ii), (d)-(iii)
C ➥ (a)-(iii), (b)-(ii), (c)-(iv), (d)-(i)
D ➥ (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q35➡| Data-Structures 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 ?
A ➥ 925, 221, 912, 245, 899, 259, 363, 364
B ➥ 3, 400, 388, 220, 267, 383, 382, 279, 364
C ➥ 926, 203, 912, 241, 913, 246, 364
D ➥ 3, 253, 402, 399, 331, 345, 398, 364
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q36➡|Computer-Graphics 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.
A ➥ n – 2, n – 1
B ➥ n – 3, n – 2
C ➥ n – 1, n
D ➥ n – 2, n – 2
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q37➡| OOPS Implicit return type of a class constructor is:
A ➥ not of class type itself
B ➥ class type itself
C ➥ a destructor of class type
D ➥ a destructor not of class type
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q38➡| OOPS It is possible to define a class within a class termed as nested class. There are ______ types of nested classes.
A ➥ 2
B ➥ 3
C ➥ 4
D ➥ 5
Show Answer With Best Explanation
Answer: A Explanation: Upload Soon
Q39➡| OOPS Which of the following statements is correct?
A ➥ Aggregation is a strong type of association between two classes with full ownership
B ➥ Aggregation is a strong type of association between two classes with partial ownership.
C ➥ Aggregation is a weak type of association between two classes with partial ownership.
D ➥ Aggregation is a weak type of association between two classes with full ownership.
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q40➡| OOPS Which of the following statements is correct?
A ➥Every class containing abstract method must not be declared abstract.
B ➥ Abstract class cannot be directly initiated with ‘new’ operator.
C ➥Abstract class cannot be initiated.
D ➥Abstract class contains definition of implementation.
Show Answer With Best Explanation
Answer: B AND C (MARKS TO ALL) Explanation: Upload Soon
Q41➡|HTML Which of the following statements is not correct?
A ➥ HTML is not screen precise formatting language.
B ➥ HTML does not specify a logic.
C ➥ DHTML is used for developing highly interactive web pages.
D ➥ HTML is a programming language.
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q42➡|OOPS When one object reference variable is assigned to another object reference variable then
A ➥ a copy of the object is created.
B ➥ a copy of the reference is created.
C ➥ a copy of the reference is not created.
D ➥ it is illegal to assign one object reference variable to another object reference variable.
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q43➡| Software-Engineering A server crashes on average once in 30 days, that is, the Mean Time Between Failures (MTBF) is 30 days. When this happens, it takes 12 hours to reboot it, that is, the Mean Time to Repair (MTTR) is 12 hours. The availability of server with these reliability data values is approximately :
A ➥ 96.3%
B ➥ 97.3%
C ➥ 98.3%
D ➥ 99.3%
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q44➡| Software-Engineering Match the software maintenance activities in List – I to its meaning in List – II.
A ➥ I-(b), II-(d), III-(c), IV-(a)
B ➥ I-(b), II-(c), III-(d), IV-(a)
C ➥ I-(c), II-(b), III-(d), IV-(a)
D ➥ I-(a), II-(d), III-(b), IV-(c)
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q45➡| Software-Engineering Match each application/software design concept in List – I to its definition in List – II.
A ➥ I-(b), II-(a), III-(d), IV-(c)
B ➥ I-(b), II-(d), III-(a), IV-(b)
C ➥ I-(d), II-(c), III-(b), IV-(a)
D ➥ I-(d), II-(a), III-(c), IV-(b)
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q46➡|Software-Engineering Software safety is quality assurance activity that focuses on hazards that
A ➥ affect the reliability of a software component.
B ➥ may cause an entire system to fail.
C ➥ may result from user input errors.
D ➥ prevent profitable marketing of the final product.
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q47➡| Software-Engineering Which of the following sets represent five stages defined by Capability Maturity Model (CMM) in increasing order of maturity ?
A ➥ Initial, Defined, Repeatable, Managed, Optimized.
B ➥ Initial, Repeatable, Defined, Managed, Optimized.
C ➥ Initial, Defined, Managed, Repeatable, Optimized.
D ➥ Initial, Repeatable, Managed, Defined, Optimized.
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q48➡|Software-Engineering The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to complete the project using the effort formula of basic COCOMO given below : E = a(KLOC)b Assume that the values of a and b are 2.5 and 1.0 respectively.
A ➥ 25 person months
B ➥ 75 person months
C ➥ 62.5 person months
D ➥ 72.5 person months
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q49➡|Operating-Systems In UNIX, processes that have finished execution but have not yet had their status collected are known as____.
A ➥ Sleeping processes
B ➥ Stopped processes
C ➥ Zombie processes
D ➥ Orphan processes
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q50➡|Operating-Systems In Unix operating system, when a process creates a new process using the fork () system call, which of the following state is shared between the parent process and child process?
A ➥ Heap
B ➥ Stack
C ➥ Shared memory segments
D ➥ Both Heap and Stack
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q51➡|Operating-Systems Which of the following information about the UNIX file system is not correct?
A ➥ Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks.
B ➥ An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data.
C ➥ Each i-node is 256-bytes long.
D ➥ All the files and directories are stored in data blocks.
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q52➡| Operating-Systems Which of the following options with reference to UNIX operating system is not correct?
A ➥ INT signal is sent by the terminal driver when one types <Control-C> and it is a request to terminate the current operation.
B ➥ TERM is a request to terminate execution completely. The receiving process will clean up its state and exit.
C ➥ QUIT is similar to TERM, except that it defaults to producing a core dump if not caught.
D ➥ KILL is a blockable signal.
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q53➡| Computer-Organization A multicomputer with 256 CPUs is organized as 16 × 16 grid. What is the worst case delay (in hops) that a message might have to take ?
A ➥ 16
B ➥ 15
C ➥ 32
D ➥ 30
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q54➡|Operating-Systems Suppose that the time to do a null remote procedure call (RPC) (i.e. 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs ?
A ➥ 49 msec
B ➥ 80 msec
C ➥ 48 msec
D ➥ 100 msec
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q55➡| Theory-of-Computation Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has _ equivalence classes.
A ➥ 2
B ➥ 4
C ➥ 5
D ➥ 6
Show Answer With Best Explanation
Answer: A Explanation: Upload Soon
Q56➡|Theory-of-Computation Let L = {0n1n|n ≥ 0} be a context free language. Which of the following is correct ?
A ➥ L is context free and Lk is not context free for any k ≥ 1.
B ➥ L is not context free and Lk is not context free for any k ≥ 1.
C ➥ Both L and Lk is for any k ≥ 1 are context free.
D ➥ Both L and Lk is for any k ≥ 1 are not context free.
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q57➡| Theory-of-Computation Given a Turing Machine M = ({q0, q1, q2, q3}, {a, b}, {a, b, B}, δ, B, {q3}) Where δ is a transition function defined as δ(q0, a) = (q1, a, R) δ(q1, b) = (q2, b, R) δ(q2, a) = (q2, a, R) δ(q3, b) = (q3, b, R) The language L(M) accepted by the Turing Machine is given as:
A ➥ aa*b
B ➥ abab
C ➥ aba*b
D ➥ aba*
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q58➡|Data-Communication Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I (x; y) is the information transmission. Which of the following does not define the channel capacity of a discrete memoryless channel ?
A ➥ max I(x; y) p(x)
B ➥ max [H(y) – H(y|x)] p(x)
C ➥ max [H(x) – H(x|y)] p(x)
D ➥ max H(x|y) p(x)
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q59➡|Probability Consider a source with symbols A, B, C, D with probability 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information ?
A ➥ 2 bits per symbol
B ➥ 1.75 bits per symbol
C ➥ 1.50 bits per symbol
D ➥ 1.25 bits per symbol
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q60➡|Image-Processing Which of the following is used for the boundary representation of an image object?
A ➥ Quad Tree
B ➥ Projections
C ➥ Run length coding
D ➥ Chain codes
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q61➡| The region of feasible solution of a linear programming problem has a _ property in geometry, provided the feasible solution of the problem exists.
A ➥ concavity
B ➥ convexity
C ➥ quadratic
D ➥ polyhedron
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q62➡| Consider the following statements: (1) Revised simplex method requires lesser computations than the simplex method. (2) Revised simplex method automatically generates the inverse of the current basis matrix. (3) Less number of entries are needed in each table of revised simplex method than usual simplex method. Which of these statements are correct?
A ➥ (1) and (2) only
B ➥ (1) and (3) only
C ➥ (2) and (3) only
D ➥ (1), (2) and (3)
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q63➡| The following transportation problem: is The above solution of a given transportation problem is:
A ➥ infeasible solution
B ➥ optimum solution
C ➥ non-optimum solution
D ➥ unbounded solution
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q64➡|Artificial-intelligence Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe X to elements of universe Z using max-min composition is given by
A ➥
B ➥
C ➥
D ➥
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q65➡| Artificial-intelligence Compute the value of adding the following two fuzzy integers : A = {(0.3, 1), (0.6, 2), (1, 3), (0.7, 4), (0.2, 5)} B = {(0.5, 11), (1, 12), (0.5, 13)} Where fuzzy addition is defined as μA+B (z)= max (min (μA(x), μB(x))) x + y= z Then, f (A + B) is equal to
Q66➡|Artificial-intelligence A perceptron has input weights W1 = – 3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2 ?
A ➥ – 2.65
B ➥ – 2.30
C ➥ 0
D ➥ 1
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q67➡|UNIX What is the function of following UNIX command ? WC – l <a> b&
A ➥ It runs the word count program to count the number of lines in its input, a, writing the result to b, as a foreground process.
B ➥ It runs the word count program to count the number of lines in its input, a, writing the result to b, but does it in the background.
C ➥ It counts the errors during the execution of a process, a, and puts the result in process b.
D ➥ It copies the ‘T’ numbers of lines of program from file, a, and stores in file b.
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q68➡|UNIX Which of the following statements is not correct with reference to cron daemon in UNIX O.S. ?
A ➥ The cron daemon is the standard tool for running commands on a predetermined schedule.
B ➥ It starts when the system boots and runs as long as the system is up.
C ➥ Cron reads configuration files that contain list of command lines and the times at which they invoked.
D ➥ Crontab for individual users are not stored.
Show Answer With Best Explanation
Answer: D Explanation: Upload Soon
Q69➡| Unix In Unix, files can be protected by assigning each one a 9-bit mode called rights bits. Now, consider the following two statements: I. A mode of 641 (octal) means that the owner can read and write the file, other members of the owner’s group can read it, and users can execute only. II. A mode of 100 (octal) allows the owner to execute the file, but prohibits all other access. Which of the following options is correct with reference to the above statements ?
A ➥ Only I is correct.
B ➥ Only II is correct.
C ➥ Both I and II are correct.
D ➥ Both I and II are incorrect.
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q70➡|Programming Consider the statement, “Either – 2 ≤ x ≤ – 1 or 1 ≤ x ≤ 2” The negation of this statement is
A ➥ x < – 2 or 2 < x or – 1 < x < 1
B ➥ x < – 2 or 2 < x
C ➥ – 1 < x < 1
D ➥ x ≤ – 2 or 2 < x or – 1 < x < 1
Show Answer With Best Explanation
Answer: A Explanation: Upload Soon
Q71➡|DBMS Which of the following is characteristic of an MIS?
A ➥ Provides guidance in identifying problems, finding and evaluating alternative solutions, and selecting or comparing alternatives.
B ➥ Draws on diverse yet predictable data resources to aggregate and summarize data.
C ➥ High volume, data capture focus.
D ➥ Has as its goal the efficiency of data movement and processing and interfacing different TPS.
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q72➡| AI How does randomized hill-climbing choose the next move each time?
A ➥ It generates a random move from the moveset, and accepts this move.
B ➥ It generates a random move from the whole state space, and accepts this move.
C ➥ It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function.
D ➥ It generates a random move from the whole state space, and accepts this move only if this move improves the evaluation function.
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q73➡| AI 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 ?
A ➥ I
B ➥ HI
C ➥ CHI
D ➥ GHI
Show Answer With Best Explanation
Answer: B Explanation: Upload Soon
Q74➡| AI Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state which of the following state cannot be reached?
A ➥
B ➥
C ➥
D ➥
Show Answer With Best Explanation
Answer: C Explanation: Upload Soon
Q75➡| A software program that infers and manipulates existing knowledge in order to generate new knowledge is known as
UGC NET CSA Previous Year Solution Paper-III-Aug-2016
