UGC NET Computer Science Question Solution Paper JUNE-2020
Q1➡|Software Engineering A company has a choice of two language L1 and L2 to develop a software for their client. Number of LOC required to develop an application in L2 is thrice the LOC in language L1. Also, software has to be maintained for the next 10 years. Various parameters for two languages are given below to decide which language should be preferred for development. PARAMETER L1 L2 Man-year needed for development LOC/1000 LOC/1000 Development cost Rs.70, 000 Rs.90, 000 Cost of Maintenance per year Rs.1, 00,000 Rs.40, 000 Total cost of the project includes the cost of development and maintenance. What is the LOC for L1for which cost of developing the software with both languages must be the same?
i ➥ 2000
ii ➥ 5000
iii➥ 3000
iv ➥ 6000
Show Answer With Best Explanation
Answer: iii Solution: It is given that number of LOC required to develop an application in L2 is thrice the LOC in language L1. Suppose, Number of LOC required in L1 = x so, Number of LOC required in L2 = 3x Cost of developing the software = (Number of LOC / Man-year needed for development) * Development cost + Maintenance Time *Cost of Maintenance per year & condition is that cost of developing the software with both languages must be the same. => Cost of developing the software in L1 = Cost of developing the software in L2 => (x /1000)* 70,000 + 101,00,000 = (3x /1000) 90,000 + 10*40,000 => 70x + 10,00,000 = 270x + 4,00,000 => 200x = 6,00,000 => x = 3000
Q3➡| Operating System Suppose you have a Linux file system where the block size is 2K bytes, a disk address is 32 bits, and i-node contains the disk addresses of the first 12 direct blocks of file, a single indirect block, and a double indirect block. Approximately, what is the largest file that can be represented by an i-node?
Q6➡|Theory of Computation Consider the following languages:
i ➥ L1 and L2 only
ii ➥ L1 and L3 only
iii ➥L1 only
iv ➥ None of these
Show Answer With Best Explanation
Answer: IV Explanation: Since, Regular Language doesn’t have memory .So, it doesn’t have capacity to hold anything.
In L1, in order to calculate aźZ we have to first calculate zz & store the value in memory then need to calculate power of a. but we already known that Regular Language doesn’t have capacity to hold anything. So, L1 is not regular language.
In L2, again we have to calculate zź , then store it & then need to find power of a. So, L2 is also not regular language.
In L3, we have to compare first ω with second ω. But, Regular Language doesn’t have capacity to compare two string. So L3 is also not regular language.
Q7➡| Software Engineering Arrange the following types of Cohesion from best to worst type. A) Logical Cohesion B) Sequential Cohesion C) Communication Cohesion D) Temporal Cohesion E) Procedural Cohesion Choose the correct answer from the options given below:
i ➥ A➡ D➡ E➡ C➡ B
ii ➥ A ➡ E ➡ D ➡ C ➡ B
iii ➥ B ➡ E ➡ C ➡ D ➡ A
iv ➥ B ➡ C ➡ E ➡ D ➡ A
Show Answer With Best Explanation
Answer: IV Explanation: Cohesion refers to the degree to which the elements inside a module belong together.
Q8➡| Artificial Intelligence Consider the statement below. A person who is radical (R) is electable (E) if he/she is conservative (C), but otherwise is not electable. Few probable logical assertions of the above sentence are given below. (A) (R∧E)⇔C (B) R→(E↔C) (C) R⇒((C⇒E)∨¬E) (D) (¬R∨¬E∨C)∧(¬R∨¬C∨E) Which of the above logical assertions are true? Choose the correct answer from the options given below:
i ➥ (B) only
ii ➥ (C) only
iii ➥ (A) and (C) only
iv ➥ (B) and (D) only
Show Answer With Best Explanation
Answer: IV Explanation: (A) (R ∧ E) ⇔ C It is not equivalent to above statement. It says that all conservative(C) are Radical(R) and Electable (E). (B) R ⇒ (E ⇔C) It is equivalent to above statement. It says that if all person are Radical(R) then they are Electable (E) if And only if they are Conservative (C). (C) R ⇒ ((C⇒E) v ¬E) R ⇒ (¬C v E v ¬E ) It is tautology, That is it is true in all condition because E is in both form (Normal Form & Complemented Form) (D) (¬R v ¬E v C) ∧ (¬R v ¬ C v E) (¬R v E ⇒C) ∧ (¬R v C ⇒E) ¬R v ((E ⇒C) ∧ (C ⇒E)) ¬R v (E ⇔C) R ⇒ (E ⇔C) It is equivalent to above statement. It says that if all person are Radical(R) then they are Electable (E) if And only if they are Conservative (C).
Q10➡ | Database Management System Simplified expression/s for following Boolean function F(A,B,C,D)=Σ(0,1,2,3,6,12,13,14,15) is/are A) A’B’+AB+A’C’D’ B) A’B’+AB+A’CD’ C) A’B’+AB+BC’D’ D) A’B’+AB+BCD’
Choose the correct answer from the options given below:
i ➥ (A) only
ii ➥ (B) only
iii ➥ (A) and (B) only
iv ➥ (B) and (D) only
Show Answer With Best Explanation
Answer: IV Explanation: Two K-maps can be constructed from given Boolean Function: F(A,B,C,D)=Σ(0,1,2,3,6,12,13,14,15)
Boolean Expression of K-maps are: (A’B’ + AB + A’CD’) and (A’B’ + AB + BCD’) So, Option(IV) is correct.
Q11➡ | Computer Network Given below are two statements: Statement I: In Caesar Cipher each letter of Plain text is replaced by another letter for encryption. Statement II: Diffie-Hellman algorithm is used for exchange of secret key.
In the light of the above statements, choose the correct answer from the options given below:
i ➥Both Statement I and Statement II are true
ii ➥ Both Statement I and Statement II are false
iii ➥ Statement I is correct but Statement II is false
iv ➥Statement I is incorrect but Statement II is true
Q12➡|Computer Architecture Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is 80%, and it takes 15 nanoseconds to search the TLB, and 150 nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds?
i➥ 185
ii ➥ 195
iii ➥205
iv ➥ 175
Show Answer With Best Explanation
Answer: II Explanation: It is given that, hit ratio = 0.8 or 80% , memory access time = 150 ns, TLB access time = 15ns, Miss ratio = 1- hit ratio = 1 – 0.8 = 0.2
Effective memory access time = hit ratio (memory access time + TLB access time) + miss ratio (2memory access time + TLB access time) = 0.8(150 + 15) + 0.2* (2150 + 15) = 0.8 165 + 0.2 * 315 = 132 + 63 = 195 ns
Q13➡|Computer Architecture A non-pipeline system takes 50ns to process a task. The same task can be processed in a six-segment pipeline with a clock cycle of 10ns. Determine approximately the speedup ratio of the pipeline for 500 tasks.
i➥ 6
ii ➥ 4.95
iii ➥5.7
iv ➥ 5.5
Show Answer With Best Explanation
Answer: II Explanation: Time required to execute 500 tasks without pipeline = 500* 50 = 25000 ns Time required to execute 500 tasks with 6-stages pipeline = Time taken by 1st task + Time taken by remaining 499 tasks = 1 x 6 clock cycles + 499 x 1 clock cycle = 6 clock time + 499 clock time = 6* 10 + 499* 10 = 60 + 4990 = 5050ns
Q14➡|Engineering Mathematics Given below are two statements: Statement I: 5 divides n5-n whenever n is a nonnegative integer. Statement II: 6 divides n3-n whenever n is a nonnegative integer.
In the light of the above statements, choose the correct answer from the options given below
i➥ Both Statement I and Statement II are correct
ii ➥ Both Statement I and Statement II are incorrect
iii ➥Statement I is correct but Statement II is incorrect
iv ➥ Statement I is incorrect but Statement II is correct
Show Answer With Best Explanation
Answer: I Explanation: Statement I: n5 – n Example : Take n = 2 , 25- 2 = 32 – 2 = 30 , which is divided by 5. Take n = 3 , 35 – 3 = 243 – 3 = 240 , which is divided by 5. Statement I is true. Statement II: n3 – n Example : Take n = 2 , 23- 2 = 8 – 2 = 6 , which is divided by 6. Take n = 3 , 33 – 3 = 27 – 3 = 24 , which is divided by 6. Statement II is true.
Q15➡| Operating System Which of the following cloud concept/s is/are related to pooling and sharing of resources? A) Virtual Memory B) Service C) Virtualization Choose the correct answer from the options given below:
i➥ (C) only
ii➥ (A) and (B) only
iii➥ (A) only
iv➥ (B) only
Show Answer With Best Explanation
Answer: A Explanation: Virtualization is related to pooling and sharing in a cloud concept. Through this, the resources are shared. Through this type of computation, it is possible to run applications and services on a common distributed network.
Q16➡ | Computer Network Using ‘RSA’ public key cryptosystem, if p=3, q=11 and d=7, find the value of e and encrypt the number ’19’?
i ➥ 20,19
ii ➥ 33,11
iii ➥ 3,28
iv ➥ 77,28
Show Answer With Best Explanation
Answer: III Explanation: RSA key Generation Algorithm: 1) Select 2 primes p & q such that p!= q. 2) Calculate n = p*q. 3) Calculate ϕ(n) = (p-1)*(q-1) 4) Select e such that 1< e< ϕ (n) & gcd (e, ϕ(n)) == 1 5) Calculate d , e*d mod ϕ(n) ==1 6) Public key = (e , n) Private key = d 7) Return public key(e,n) & private key(d,n)
Calculate Ciphertext & Plaintext using key e and d: Ciphertext = (Plaintext)e mod n Plaintext = (Ciphertext)d mod n
Calculation, 1) Two prime numbers p =3 , q=11 2) Calculate n = p*q = 3*11 = 33 3) Calculate ϕ(n) = (p-1)*(q-1) = (3-1)*(11-1) = 2*10=20 4) Calculate d , =>e*d mod ϕ(n) ==1 =>e*7 mod 20 ==1 => 3*7 mod 20 ==1 {if we take value of e is 3 , then reminder will be 1} 5) public key (e) = 3
Now, Calculate Ciphertext using key : Ciphertext = (Plaintext)e mod n = 193 mod 33 =28
Q17➡|Theory of Computation Consider the following regular expressions: a) r=a(b+a)* b) s=a(a+b)* c) t=aa*b Choose the correct answer from the options given below based on the relation between the languages generated by the regular expressions above:
i ➥ L(r)⊆L(s)⊆L(t)
ii ➥ L(r)⊇L(s)⊇L(t)
iii ➥ L(r)⊇L(t)⊇L(s)
iv ➥ L(s)⊇L(t)⊇L(r)
Show Answer With Best Explanation
Answer: II Explanation: R = {a, ab, aa, aba, aaa, aab, abb…….} S = {a, aa, ab, aab, aaa, abb, aba…….} T = {ab, aab, aaab, …………………………} If you notice then r ⊇ s ⊇ t
Q18➡ | Computer Network Firewall is a device that filters access to the protected network from the outside network. Firewall can filter the packets on the basis of (A) Source IP address (B) Destination IP Address (C) TCP Source Port (D) UDP Source Port (E) TCP Destination Port
Choose the correct answer from the options given below:
Q19➡| Operating System Assuming that the system call fork () never fails, consider the following C programs P1 and P2 executed on a UNIX/ Linux system: Statement I: P1 displays “Happy” 8 times. Statement II: P2 displays “Happy” 12 times. In the light of the above statements, choose the correct answer from the options given below:
i ➥ Both Statement I and Statement II are true
ii ➥ Both Statement I and Statement II are false
iii ➥ Statement I is correct but Statement II is false
iv ➥ Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer: III Explanation: Fork is the primary method of process creation on Unix-like operating systems. Fork system call is used for creating a new process, which is called child process, which runs concurrently with the process that makes the fork() call (parent process).When fork() is called, parent & child process is run concurrently & complete program is executed for both parent process & child process. For P1:
Q20➡|Computer Architecture Consider a machine with a byte addressable main memory of 216 bytes and block size of 8 bytes. Assume that a direct mapped cache consisting of 32 lines is used with this machine. How many bits will be there in Tag, line and word field of format of main memory addresses?
i➥ 8,5,3
ii ➥ 8,6,2
iii ➥7,5,4
iv ➥ 7,6,3
Show Answer With Best Explanation
Answer: I Explanation: Direct mapped cache: In a direct-mapped cache structure, the cache is organized into multiple set with a single cache line per set. Based on the address of the memory block, it can only occupy a single cache line. The cache can be framed as a (n*1) column matrix.
Main memory offset In above, Main memory size = 216 B Block size = 8 B = 23 B , Block offset = 3 Cache line = 32 B = 25 B, Cache line offset = 5
Q21➡|Data Structure Let G be a simple undirected graph, TD be a DFS tree on G, and TB be the BFS tree on G. Consider the following statements. Statement I: No edge of G is a cross with respect to TD Statement II: For every edge (u,v) of G, if u is at depth i and v is at depth j in TB then |i-j|=1
In the light of the above statements, choose the correct answer from the options given below:
i➥Both Statement I and Statement II are true
ii ➥ Both Statement I and Statement II are false
iii ➥Statement I is correct but Statement II is false
iv ➥ Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer: III Explanation: Statement I: True. TD be a DFS tree on G, & there is no edge cross with respect to any Tree but can have cross in directed graphs. Statement II: False. This is not always correct.
Q23➡ | Digital Logic Design What kind of clauses are available in conjunctive normal form?
i ➥ Disjunction of literals
ii ➥ Disjunction of variables
iii ➥ Conjunction of literals
iv ➥ Conjunction of variables
Show Answer With Best Explanation
Answer: I Explanation: Conjunctive normal form(CNF) or clausal normal form is a conjunction of one or more than one clauses, where a clause is a disjunction of literals; or it is a product of sums or an AND of ORs. These are in conjunctive normal form: • (A + B’ + C’) . (D’ + E + F) • (A + B ) . (C) • (A + B ) • (A)
Confusing Point: Literals vs variables Suppose, we have a function F(A,B) The variables of function are: A, B The literals of function are: A, A’, B, B’ (a literal is a variable either in complemented form or uncomplemented form)
Q24➡|Engineering Mathematics Find the lexicographic ordering of the bit strings given below based on the ordering 0 < 1. A) 001 B) 010 C) 011 D) 0001 E) 0101 Choose the correct answer from the options given below:
i➥001<010<011<0001<0101
ii ➥ 0001<001<010<0101<011
iii ➥0001<0101<001<010<011
iv ➥ 001<010<0001<0101<011
Show Answer With Best Explanation
Answer: II Explanation: Lexicographically means sorting in natural order, dictionary order. The lexicographic order of the given bit strings will be: 0001<001<010<0101<011 Take 0001 & 001 for comparing. Compare each bit of 1st string with the corresponding bit of 2nd string. It is clear that 0001< 001.
Q25➡|Computer Architecture Given below are two statements: Statement I: hardwired control unit can be optimized to produce fast mode of operation. Statement II: Indirect addressing mode needs two memory references to fetch the operand.
In the light of the above statements, choose the correct answers from the options given below
i➥ Both Statement I and Statement II are true
ii ➥ Both Statement I and Statement II are false
iii ➥Statement I is correct but Statement II is false
iv ➥ Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer: I Explanation: Statement I:hardwired control unit can be optimized to produce fast modes of operations. hardwired control unit can be uses a large number of registers and because of that it is costly. hardwired control unit Instruction size in the Hardwired unit is fixed. hardwired control unit has a small number of addressing modes. Statement(I) is True Statement II:Indirect addressing mode needs two memory references to fetch the operand. In indirect addressing mode, instructions contain the address of an operand where operand is actually present. It requires two memory access to fetch the operand. Example: LOAD R1, @300 The address part of an instruction contains 300. Now the control go at address 300 to find the address of an operand. The address of an operand in this example is 500. The operand found at loaction 500. Indirect Addreesing need two memory reference, one for to find address of an operand & another one for operand itself. Statement(I) is True
Q26➡| Artificial Intelligence Given below are two statements: Statement I: A genetic algorithm is a stochastic hill climbing search in which a large population of states is maintained. Statement II: In a nondeterministic environment, agents can apply AND-OR search to generate containing plans that reach the goal regardless of which outcomes occur during execution. In the light of the above statements, choose the correct answers from the options given below.
i ➥ Both Statement I and Statement II are true
ii ➥ Both Statement I and Statement II are false
iii ➥ Statement I is correct but Statement II is false
iv ➥ Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer: I Explanation: Statement I: Stochastic Hill-climbing as a core Method for Evaluating Genetic Algorithms Stochastic Hill-climbing maintains a vast population of states. next new states are created by mutation and crossover, which put together pairs of states from the population.
Hence Statement I is correct. Statement II: contingent solutions to nondeterministic problems By constructing search trees AI agents use AND-OR search tree in non-deterministic environments to initiate contingent plans that achieve the destination (Target/Goal) regardless of which outcomes occur during execution.
Hence Statement II is also correct. Important points for your exam AND-OR search trees: By constructing search trees we find contingent solutions to nondeterministic problems OR nodes: in deterministic environment, we call nodes OR nodes when the only branching is initiate by the agent’s own choices OR NODE in each state. AND nodes: In a non-deterministic environment, we call nodes OR nodes when branching is initiate by the environment’s choice of outcome for each action. So the Correct Answer is Option (I).
Q27➡| Engineering Mathematics Match List I with List II let R1 = {(1,1), (2,2), (3,3)} and R2 = {(1,1), (1,2), (1,3), (1,4)} Choose the correct answer from the options given below:
i ➥ A-I, B-II, C-IV, D-III
ii ➥ A-I, B-IV, C-III, D-II
iii ➥ A-I, B-III, C-II, D-IV
iv ➥ A-I, B-IV, C-II, D-III
Show Answer With Best Explanation
Answer: IV Explanation: Union(U): In set theory, the union (denoted by ∪) of a collection of sets is the set of all elements in the collection.It is one of the fundamental operations through which sets can be combined and related to each other. R1 U R2 = {(1,1), (1,2), (1,3), (1,4), (2,2), (3,3)}
Set difference: Set difference is the set of all elements in R1 that are not in R2. R1 – R2 = {(2,2), (3,3)} R2 – R1 = {(1,2), (1,3), (1,4)}
Intersection: Intersection is the set containing all elements of A that also belong to B (or equivalently, all elements of B that also belong to A). R1∩R2 = {(1,1)}
Q28➡| Programming Consider the following pseudo-code fragment, where a and b are integer variables that have been initialized: /* Pre-conditions: (a>1 ∧ a<b) */ / *Assume that overflow never occurs */ int x=0; int p=1; while ( p<b) { p=p*a; x=x+1; } When the while loop terminates, what will be the value of x in terms of a and b?
Q29➡| Artificial Intelligence Which of the following statements are true? A) Minimax search is breadth-first; it processes all the nodes at a level before moving to a node in the next level. B) The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined. C) The alpha-beta search algorithm computes the same optimal moves as the minimax algorithm. D) Optimal play in games of imperfect information does not require reasoning about the current and future belief states of each player. Choose the correct answer from the options given below:
A – (A) and (C) only
B – (A) and (D) only
C – (B) and (C) only
D – (C) and (D) only
Show Answer With Best Explanation
Answer: C
Q30➡|Computer Architecture Match list I and List II Choose the correct answer from the options given below:
Q32➡|Data Structure Which among the following statement(s) is (are) true? A) A hash function takes a message of arbitrary length and generates a fixed length code. B) A hash function takes a message of fixed length and generates a code of variables. C) A hash function may give the same value for distinct messages.
Choose the correct answer from the options given below:
Q33➡|Software Engineering To create an object-behavioral model, the analyst performs the following steps: (A) Evaluates all use-cases (B) Build state transition diagram for the system (C) Reviews the object behavior model to verify accuracy and consistency (D) Identify events that do not derive the interaction sequence. Choose the correct answer from the options given below:
Q34➡| Operating System Consider a hypothetical machine with 3 pages of physical memory, 5 pages of virtual memory, and < A,B,C,D,A,B,E,A,B,C,D,E,B,A,B> as the stream of page reference by an application. if P and Q are the number of page faults that the application would incur with FIFO and LRU page replacement algorithms respectively, then (P,Q)=_________(Assuming enough space for storing 3 page frames)
Q35➡| Artificial Intelligence Which of the following statements are true? A) A sentence α entails another sentence ßifß is true in few words where α is true. B) Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form. C) Sound inference algorithms derive all sentences that are entailed. D) Propositional logic does not scale to environments of unbounded size. Choose the correct answer from the options given below:
Q36➡| Software Engineering A Software project was estimated at 864 Function Points. A six person team will be assigned to a project consisting of a requirement gathering person, one designer, two programmers and two testers. The salary of the designer is ₹70,000 per month, requirement gatherer is ₹50,000 per month, programmer is ₹60,000 per month and a tester is ₹60,000 per month. Average productivity for the team is 12 FP per person month. Which of the following represents the projected cost of the project?
i ➥ ₹33,20,000
ii ➥ ₹43,20,000
iii ➥ ₹33,10,000
iv ➥ ₹22,10,000
Show Answer With Best Explanation
Answer – B Explanation– Given that , –> Total Function points = 864 FP –> Team = 6 person –> Average Function points= 12 FP per person month. –> projected cost =? we have to first calculate in how many month a team will completed their task ,then calculate what is the cost of the project? In a 6 member team, –> one person is Requirement gatherer –> one person is Designer –> two person is Programmers –> two person is Testers
Q37➡|Computer Architecture Arrange the following types of machine in descending order of complexity. (A) SISD (B) MIMD (C) SIMD Choose the correct answer from the options given below:
Q38➡|Discrete Mathematics Consider the following statements: A) Any tree is 2-colorable B) A graph G has no cycles of even length if it is bipartite C) A graph G is 2-colorable if is bipartite D) A graph G can be colored with d+1 colors if d is the maximum degree of any vertex in the graph G E) A graph G can be colored with O(log|v|) colors if it has O(|v|) edges.
Choose the correct answer from the options given below:
Q39➡|Computer Graphics Given below are different properties of 3D projections from A.D. Identify the correct order on the basis of property true of (i) a perspective projection only (ii) an orthographic projection only (iii) both orthographic and projective transformations and (iv) neither orthographic nor projective transformation, respectively.
(A) Straight lines are mapped to straight lines. (B) Distance and angles are (in general) preserved. (C) Far away objects appear the same size as closer ones. (D) Requires homogeneous coordinates in order for it to be encoded into linear transformation. Choose the correct answer from the options given below:
Q40➡|Computer Architecture Which of the following statements with respect to K-segment pipelining are true? A) Maximum speedup that a pipeline can provide is k theoretically. B) It is impossible to achieve maximum speedup k in the k-segment pipeline. C) All segments in the pipeline take the same time in computation.
Choose the correct answer from the options given below:
Consider the undirected graph below: Using Prim’s algorithm to construct a minimum spanning tree starting with node a, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?
i ➥ (a,b), (a,h), (g,h), (f,g), (c,f), (c,i), (c,d), (d,e)
ii ➥ (a,b), (b,h), (g,h), (g,i), (c,i), (c,f), (c,d), (d,e)
iii ➥ (a,b), (b,c), (c,i), (c,f), (f,g), (g,h), (c,d), (d,e)
iv ➥ (a,b), (g,h), (g,f), (c,f), (c,i), (f,e), (b,c), (d,e)
Q44➡|Software Engineering Modifying the software by restructuring is called.
i ➥ Adaptive maintenance
ii ➥ Corrective maintenance
iii ➥ Perfective maintenance
iv➥ Preventive maintenance
Show Answer With Best Explanation
Answer: III Explanation: There are four types of software maintenance: • Corrective Software Maintenance • Adaptive Software Maintenance • Perfective Software Maintenance • Preventive Software Maintenance Corrective Software Maintenance: Corrective maintenance deals with the repair of faults or defects found in day-today system functions. A defect can result due to errors in software design, logic and coding.
Adaptive Software Maintenance: Adaptive maintenance is concerned with the change in the software that takes place to make the software adaptable to new environment such as to run the software on a new operating system.
Perfective Software Maintenance: Perfective maintenance is concerned with the change in the software that occurs while adding new functionalities in the software.Modifying the software by restructuring is called preventive software maintenance.
Preventive Software Maintenance: Preventive maintenance involves implementing changes to prevent the occurrence of errors.
Q45➡|Computer Architecture Which of the following statements with respect to the multiprocessor system are true? A) Multiprocessor system is controlled by one operating system. B) In a Multiprocessor system, multiple computers are connected by means of communication lines. C) Multiprocessor system is classified as multiple instruction streams and multiple data stream systems.
Choose the correct answer from the options given below
i➥ (A) only
ii ➥ (A) and (B) Only
iii ➥(A) and (C) only
iv ➥ (B) and (C) only
Show Answer With Best Explanation
Answer: III Explanation:
Multiprocessor System: a multiprocessor is a computer system having two or more processing units (multiple processors) each sharing main memory and peripherals, in order to simultaneously process programs. (A) True : Multiprocessor system is controlled by one operating system. (B) False: In a Multiprocessor system, single computer (or Operating system) have multiple processor. (C) True: Multiprocessor system is classified as multiple instruction streams and multiple data stream systems.
Q46➡|Digital Logic Design What is the radix of the numbers if the solution to the quadratic equation x2-10x+26=0 is x=4 and x=7?
i➥ 8
ii➥ 9
iii➥ 10
iv➥ 11
Show Answer With Best Explanation
Answer: IV Explanation: As we know, If equation ,a2 + bx + c = 0 then sum of roots = -b/a & product of roots = c/a. Given, Equation x2-10x+26=0 and roots are 4 & 7. By Comparing both equation, we got value of a = 1, b = -10 , c = 26. Then, Sum of roots = -b/a -> 4b + 7b = -(-10)/1 => -> (10)b = 4b + 7b convert into base 10 -> b = 4+7 -> b = 11 (it implies 11 is the radix of the number) or Product of roots = c/a ->4b * 7b = 26/1 -> (26)b = 4b * 7b convert into base 10 -> 2b + 6 = 4* 7 ->2b = 22 -> b = 11(it implies 11 is the radix of the number)
Q47➡|Computer Architecture The following program is stored in the memory unit of the basic computer. What is the content of the accumulator after the execution of the program? (All location numbers listed below are in hexadecimal)
Choose the correct answer from the options given below:
i ➥ A-I, B-III, C-IV, D-II
ii ➥ A-III, B-I, C-IV, D-II
iii ➥ A-III, B-I, C-II, D-IV
iv ➥ A-I, B-III, C-II, D-IV
Show Answer With Best Explanation
Answer: III Explanation: Topological sort of DAG takes (V+E) time. Bellman ford single source shortest path takes O(VE) time Floyd Warshall’s all pair shortest path algorithm takes O(V3) time. Kruskal’s algorithm: Sorted edges will take O(ElogV) and unsorted edges will take O(ElogE)
Q50➡| Artificial Intelligence Given below are two statements: If two variables V1and V2 are used for clustering, then consider the following statements for k means clustering with k=3 Statement I: If V1 and V2 have correlation of 1 the cluster centroid will be in straight line. Statement II: If V1 and V2 have correlation of 0 the cluster centroid will be in straight line. In the light of the above statements, choose the correct answer from the options given below
i ➥ Both Statement I and Statement II are true
ii ➥ Both Statement I and Statement II are false
iii ➥ Statement I is correct but Statement II is false
iv ➥ Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer: III Explanation: If the correlation between the variables V1 and V2 is 1, then all the data points will be in a straight line. Hence, all the three cluster centroids will form a straight line as well.
Q54➡|Discrete Mathematics Let) G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a vertex j if and only if either j=i+1 or j=3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is ___________.
i➥23
ii ➥ 99
iii ➥4
iv ➥ 7
Show Answer With Best Explanation
Answer: IV Explanation: Edge set consists of edge from i to j , if and only if either j=i+1 or j=3i since, we to find the minimum number of edge from vertex 1 to vertex 100.so, we have to think about how we can reach an edge 100 from an edge 1 with minimum path. 1 ->3 ->9 -> 10 -> 11 -> 33 -> 99 -> 100. We need minimum 7 edges.
Q56➡ | Computer Network Protocols in which the sender sends one frame and then waits for an acknowledgement before proceeding for the next frame are called as___.
Q57➡ | Computer Graphics Given below are two statements: Statement I: Bezier curves are curves that interpolate all of their control points Statement II: A cubic bezier curve has four control points. In the light of the above statements, choose the correct answer from the options given below
i ➥ Both statement I and Statement II are true
ii ➥ Both Statement I and Statement II are false
iii ➥ Statement I is correct but Statement II is false
iv ➥ Statement I is incorrect but Statement II is true
Q58➡| Discrete Mathematics If f(x) = x is my friend, and p(x) = x is perfect then correct logical translation of the statement “some of my friends are not perfect” is__________.
i ➥ ∀ (f(x) ∧ ¬ p(x))
ii ➥ ∃ (f(x) ∧ ¬ p(x))
iii ➥ ¬ (f(x) ∧ ¬ p(x))
iv ➥ ∃ ( ¬ f(x) ∧ ¬ p(x))
Show Answer With Best Explanation
Answer: II Explanation: It is given that, f(x)=x is my friend p(x) = x is perfect statement: some of my friends are not perfect. There exist is used for ‘some’. Outer most part contains ∃x. In statement , condition is ‘not perfect’ . so, we get ^ p(x). Finally we get, ∃x(f(x)∧⌐p(x))
Q59➡|Software Engineering Software reliability is described with respect to (A) Execution Time (B) Calendar Time (C) Clock Time Choose the correct answer from the options given below: Suppose you are compiling on a machine with 1-byte chars, 2-byte shorts, 4-byte ints, and 8-byte doubles, and with alignment rules that require the address of every primitive data element to be integer multiple of the element’s size. Suppose further that the compiler is not permitted to reorder fields; padding is used to ensure alignment. How much space will be consumed by the following array? struct { short s; char c; short t; char d; double r; int i; }A[10]; /10 element array of struct/
Q60➡| Data Structure Suppose you are compiling on a machine with 1-byte chars, 2-byte shorts, 4-byte ints, and 8-byte doubles, and with alignment rules that require the address of every primitive data element to be integer multiple of the element’s size. Suppose further that the compiler is not permitted to reorder fields; padding is used to ensure alignment. How much space will be consumed by the following array? struct { short s; char c; short t; char d; double r; int i; }A[10]; /10 element array of struct/
Question 62 Let L1 and L2 be languages over Σ =(a,b) represented by the regular expressions (a* + b)* and (a+b)* respectively. Which of the following is true with respect to the two languages?
A – L1 ⊂ L2
B – L2 ⊂ L1
C – L1 = L2
D – L1 ∩ L2 = ɸ
Show Answer With Best Explanation
Answer : C Explanation: L1 = (a* + b)* = {€, a, b, aa, ab, ba, bb…..} (generate all string possible over alphabet a,b) L2 = (a + b)* = {€, a, b, aa, ab, ba, bb…..} (generate all string possible over alphabet a,b) L1 ==L2 (a+ b)* = (b+a)* = (a*+b)* = (a+b*)* = a*(ba*)* = b*(ab*)*
Question 63 In the context of concurrency control, a given pair of operations in a schedule is called conflict schedule if (A) At level one of the operations is write operations (B) Both the operations are performed on the same data item. (C) Both the operations are performed by different transactions. (D) Both the operations are performed on different data items Choose the correct answer from the options given below:
A – (A) and (B) only
B – (A), (B) and (C) only
C – (A), (C) and (D) only
D – (C) and (D) only
Show Answer With Best Explanation
Answer : B
Question 64 Which of the following grammars is (are) ambiguous? (A) s → ss | asb | bsa | λ (B) s → asbs | bsas | λ (C) s → aAB A → bBb B → A | λ where λ denotes empty string Choose the correct answer from the options given below:
Question 65 The period of a signal is 100ms. then the frequency of this signal in kilohertz is __?
A – 10
B – 10-1
C – 10-2
D – 10-3
Show Answer With Best Explanation
Answer : c Explanation: Period = 100 ms = 100*10-3 = 10-1s Frequency = 1 / period = 1 / 100*10-3 = (1 / 10-1) Hz = (1 /10-1 * 103) KHz = 1 / 10-2 KHz =10-2KHz
Question 66 Match List I with List II: LR: Regular languages, LCF: Context free language, LREC: Recursive language, LRE: Recursively enumerable language.
A – A-II, B-III, C-I
B – A-III, B-I, C-II
C – A-I, B-II, C-III
D – A-II, B-I, C-III
Show Answer With Best Explanation
Answer : C
Question 67 Consider a relational schema S=(U,V,W,X,Y,Z) on which the following functional dependence hold: { U → V, VW → X, Y → W, X → U} Which are the candidate keys among following options?
A – UY, VY
B – UY, VY, XY
C – UYZ, VYZ, VWZ
D – UYZ, VYZ, XYZ
Show Answer With Best Explanation
Answer : D Explanation: A candidate key is a key through which we can find other attribute uniquely. Let’s take an example UYZ , to check whether it is candidate key or not, we have to find the closure set of Attribute UYZ. Closure set of Attribute: The set of attributes that are functionally dependent on attribute A is called closure set of attribute A. Its is denoted by A+. (UYZ)+= {U,Y,Z,V,W,X} Attribute U,Y,Z can be directly found by UYZ itself. A) (UY)+ = {U, V, W, X, Y} , it is not a candidate key , because we cann’t find all the attribute using it. (VY)+ = {V, Y, W, X, U}, it is not a candidate key. B) (UY)+ = not a candidate key. (VY)+ = not a candidate key. (XY)+ = {X, Y, U,V, W} , not a candidate key . C) (UYZ)+= {U,Y,Z,V,W,X} , it is a candidate key. (VYZ)+ = { V, Y, W, X, U, Z}, it is a candidate key. (VWZ)+= {V, W,Z, X, U} , it is not candidate key. D) (UYZ)+= {U, Y, Z, V, W, X} , it is a candidate key. E) (VYZ)+ = {V, Y, Z, X, U, W}, it is a candidate key. F) (XYZ)+ = {X, Y, Z, U, W, V}, it is a candidate key.
Question 68 A complete n-ary tree is a tree in which nodes have children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L=41, and I=10, what is the value of n?
A – 3
B – 4
C – 5
D – 6
Show Answer With Best Explanation
Answer : C Explanation: L = (n-1) * I + 1 where, L = Leaf Node, I = Internal Node, n = n-arry Tree L = (n-1)*I +1 41 = (n-1) * 10 +1 41 = 10n -10 +1 10n = 50 n = 5
Question 69 In HTML, < map > tag is used for
A – Defining a path between two nodes in an image
B – Defining clickable region in an image
C – Highlighting an area in an image
D – Defining the site-map of a web-site
Show Answer With Best Explanation
Answer : B Explanation: The tag is used to define an image map. An image map is an image with clickable areas.
Question 70 Consider a code with only four valid code words: 0000000000, 0000011111, 1111100000, and 1111111111. This code has distance 5. If the code word arrived is 0000000111 then the original code word must be __.
A – 0000011111
B – 0000000000
C – 1111100000
D – 1111111111
Show Answer With Best Explanation
Answer : A correcting t-bit error hamming distance should be 2t+1. So, 2t + 1 = 5 t = 2 It means the hamming distance between the code-word 0000000111 and give option should be of 2-bits.
Q71➡ | Computer Graphics Concerning phong shading and gouraud shading in a 3D scene, which of the following statements are true? (A) Gouraud shading requires more computation than phong shading (B) Gouraud shading linearly interpolates the color of an interior pixel from the color at the vertices. (C) Phong shading interpolates over the normal vectors specified at the vertices. Choose the correct answer from the options given below:
i ➥ (A) and (B) only
ii ➥ (A) and (C) only
iii ➥ (B) and (C) only
iv ➥ (A), (B) and (C)
Show Answer With Best Explanation
Answer : III Explanation:
Q72➡ |Discrete Math How many ways are there to pack six copies of the same book into four identical boxes, where a box can contain as many as six books?
i ➥ 4
ii ➥ 6
iii ➥ 7
iv ➥ 9
9
Show Answer With Best Explanation
Answer : D Explanation:
Question 73 Consider L=L1 ∩ L2 where L1 = {0m 1m 20n 1n | m,n ≥0} L2 = {0m 1n 2k | m,n,k ≥0} Then, the language L is
A – Recursively enumerable but not context free
B – Regular
C – Context free but not regular
D – Not recursive
Show Answer With Best Explanation
Answer : C Explanation: L1 = {0m 1m 20n 1n | m,n ≥0} L2 = {0m 1n 2k | m,n,k ≥0} L = L1 ∩ L2 = 0m1m 2 | m >= 0} it is clearly not regular, because regular language doesn’t have capacity to count (or store) anything. Here 0’s followed by equal number of 1’s & context free language have capacity to do this. It is context free language but not regular.
Q74➡ | Computer Graphics The context of 3D Computer graphics, which of the following statements is/are correct? A) Under perspective projection, each set of parallel lines in the object do not stay parallel in the image (except those that are parallel to the view plane to start with). B) Applying a perspective transformation in the graphics pipeline to a vertex involves dividing by its ‘z’ coordinate. C) Perspective transformation is a linear transformation. Choose the correct answer from the options given below:
i ➥ (A) and (B) only
ii ➥ (A) and (C) only
iii ➥ (B) and (C) only
iv ➥ (A), (B) and (C)
Show Answer With Best Explanation
Answer : A Explanation:
Question 75 Consider the following properties: A. Reflexive B. Antisymmetric C. Symmetric Let A = {a, b, c, d, e, f, g} and R = {(a,a), (b,b), (c,d), (c,g), (d,g), (e,e), (f,f), (g,g)} be a relation on A. Which of the following property (properties) is (are) satisfied by the relation R?
A – Only A
B – Only C
C – Both A and B
D – B and not A
Show Answer With Best Explanation
Answer : D Explanation:
Question 76 In a binary max heap containing n numbers, the smallest element can be found in_____ time.
A – O(n)
B – O(log2 n)
C – O(1)
D – O(log2 log2 n)
Show Answer With Best Explanation
Answer : a Explanation: In a binary MAX heap , smallest value of heap will always be present at the last level of heap, we have to search all the element to reach at last level. Since heap is using linear search , so time complexity to find smallest element from MAX heap is O(n).
Question 77
A – A-I, B-IV, C-III, D-II
B – A-I, B-II, C-III, D-IV
C – A-II, B-I, C-III, D-IV
D – A-II, B-IV, C-III, D-I
Show Answer With Best Explanation
Answer : A Explanation: Branch-and-bound Keeps track of all partial paths which can be a candidate for further exploration. Steepest-ascent hill climbing Considers all moves from current state and selects the best move. Constraint satisfaction Discovers problem state(s) that satisfy a set of constraints. Means-end-analysis Detects difference between current state and goal state.
Question 78 The number of positive integers not exceeding 100 that are either odd or the square of an integer is _.
A – 63
B – 59
C – 55
D – 50
Show Answer With Best Explanation
Answer : C
Question 79➡ |Computer Network Post office protocol (POP) is a message access protocol which is used to extract messages for clients. In this regard, which of the following are true? A) POP has two modes, Delete mode and keep B) In Delete mode, mail is deleted from mailbox after each retrieval C) In Delete mode, mail is deleted from the mailbox before each retrieval. D) In keep mode, mail is deleted before retrieval. E) In keep mode, mail remains in the mailbox after retrieval.
Choose the correct answer from the options given below:
i ➥(A) and (B) only
ii ➥ (A), (D) and (E) only
iii ➥(A), (B), (C) and (D) only
iv ➥(A), (B) and (E) only
Show Answer With Best Explanation
Answer: IV Explanation:
POP has two modes: i)Delete Mode – A mail is deleted from the mailbox on the mail server after successful retrieval. (Delete after reading) ii)Keep Mode – A mail remains in the mailbox on the mail server after successful retrieval. (Store even after reading)
Question 80 Given below are two statements: Statement I: Quality control involves the series of inspections, reviews and tests used throughout the software process, to ensure each work product meets the requirements placed upon it. Statement II: Quality assurance consists of auditing and reporting functions of management. In the light of the above statements, choose the correct answer from the option given below
A – Both Statement I and Statement II are true
B – Both Statement I and Statement II are false
C – Statement I is correct but Statement II is false
D – Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer : A Explanation:
Question 81 Which of the following statements regarding XML is/are TRUE? (A) XML is a set of tags designed to tell browsers how to display text and images in a web page. (B) XML defines a syntax for representing data, but the meaning of data varies from application to application. (C) < Letter >, < LETTER > and < letter > are three different tags in XML Choose the correct answer from the options given below:
A – (A) and (B) only
B – (A) and (C) only
C – (B) and (C) only
D – (A), (B) and (C)
Show Answer With Best Explanation
Answer : C Explanation: • XML is mainly focused on transfer of data while HTML is mainly focused on presentation of data. • XML is focused on what data is while HTML is focused on how data looks. • XML is Case sensitive while HTML is Case insensitive. A) FALSE: HTML is a set of tags designed to tell browsers how to display text and images in a web page. B) TRUE: XML defines a syntax for representing data, but the meaning of data varies from application to application. C) TRUE: < Letter >, < LETTER > and < letter > are three different tags in XML. Because XML is case sensitive.
Question 82 Which of the following is/are behavioral testing technique(s)? (A) Equivalence Partitioning (B) Graph-Based Testing Method (C) Boundary Value Analysis (D) Data flow Testing (E) Loop Testing Choose the correct answer from the options given below:
A – (B) and (D) only
B – (A), (B) and (C) only
C – (D) and (E) only
D – (A), (C) and (E) only
Show Answer With Best Explanation
Answer : B Explanation: Behavioral testing technique: Equivalence Class Partitioning Boundary Value Analysis Cause-Effect Graphing Graph-Based Testing Method Orthogonal Arrays Testing
Question 83 Which of the following is NOT true in problem solving in artificial intelligence?
A – Implements heuristic search techniques
B – Solution steps are not explicit
C – Knowledge is imprecise
D – it works on or implements repetition mechanism
Show Answer With Best Explanation
Answer : D
Question 84 Given below are two statements: Statement I: The problem “Is L1 ∧ L2=Ø?” is undecidable for context sensitive languages L1 and L2. Statement II: The problem “Is W ∈ L?”is decidable for context sensitive language L, (where W is a string). In the light of the above statements, choose the correct answer from the options given below
A – Both Statement I and Statement II are true
B – Both Statement I and Statement II are false
C – Statement I is correct but Statement II is false
D – Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer : A
Question 85 Consider a disk system having 60 cylinders. Disk requests are received by a disk drive for cylinders 10, 22, 20, 2, 40, 6 and 38, in that order. Assuming the disk head is currently at cylinder 20, what is the time taken to satisfy all the requests if it takes 2 milliseconds to move from one cylinder to adjacent one and Shortest Seek Time First (SSTF) algorithm is used?
A – 240 milliseconds
B – 96 milliseconds
C – 120 milliseconds
D – 112 milliseconds
Show Answer With Best Explanation
Answer : C
Question 86 Which of the following are applications of symbol table? A) Storage allocation B) Checking type compatibility C) Suppressing duplicate error messages Choose the correct answer from the options given below:
A – (A) and (B) only
B – (A) and (C) only
C – (B) and (C) only
D – (A), (B) and (C) only
Show Answer With Best Explanation
Answer : D Explanation: All the are applications of symbol table: Storage allocation Checking type compatibility Suppressing duplicate error messages
Question 87 Let G1 and G2 be arbitrary context free languages and R an arbitrary regular language. Consider the following problems: A) Is L(G1)=L(G2)? B) Is L(G2)≤L(G1)? C) Is L(G1)=R? Which of the problems are undecidable? Choose the correct answer from the options given below:
A – (A) only
B – (B) only
C – (A) and (B) only
D – (A), (B) and (C)
Show Answer With Best Explanation
Answer : D
Question 88 If algorithm A and another algorithm B take log2(n) and √n microseconds, respectively, to solve a problem, then the largest size n of a problem these algorithms can solve, respectively, in one second are______ and __.
A – 210^6 and 106
B – 210^6 and 1012
C – 210^6 and 6 x 106
D – 210^6 and 6 x 1012
Show Answer With Best Explanation
Answer : B
Question 89 The running time of an algorithm is O(g(n)) if and only if
A – its worst-case running time is O(g(n)) and its best-case running time is (g(n))(O=big O)
B – its worst-case running time is Ω(g(n)) and its best-case running time is O(g(n))(O=big O)
C – O(g(n))=Ω(g(n))(O=big O)
D – O(g(n)) ∩ ω(g(n))is non-empty set, (o=small o)
Show Answer With Best Explanation
Answer : A Explanation: Worst case: bigOh (O) is used to represent worst case running time or upper bound. Average case : bigThega(Θ) is used to represent average case running time or average bound. Best case : bigOmega(Ω) is used to represent best case running time or lower bound. Diagram of all these three.
Question 90 Which of the following is not an intermediate code form?
A – Syntax trees
B – Three address codes
C – Quadruples
D – Post fix Notation
Show Answer With Best Explanation
Answer : C according to UGC option C is correct but it is Not sure .
Question 91 Comprehension:Question 91-95 concerns a disk with a sector size of 512 bytes, 2000 tracks per surface. 50 sectors per track, five double-sided platters, and average seek time of 10 milliseconds. Ques -91: If one track of data can be transferred per revolution, then what is the data transfer rate?
A – 2,850 KBytes/second
B – 4,500 KBytes/second
C – 5,700 KBytes/second
D – 2,250 KBytes/second
Show Answer With Best Explanation
Answer : D
Question 92 Question 91-95 concerns a disk with a sector size of 512 bytes, 2000 tracks per surface. 50 sectors per track, five double-sided platters, and average seek time of 10 milliseconds. Ques-92: Given below are two statements: Statement I: The disk has a total number of 2000 cylinders. Statement II: 51200 bytes is not a valid block size for the disk. In the light of the above statements, choose the correct answer from the options given below:
A – Both Statement I and Statement II are true
B – Both Statement I and Statement II are false
C – Statement I is correct but Statement II is false
D – Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer : A
Question 93 Comprehension: Question 91-95 concerns a disk with a sector size of 512 bytes, 2000 tracks per surface. 50 sectors per track, five double-sided platters, and average seek time of 10 milliseconds. Ques-93: If T is the capacity of a track in bytes, and S is the capacity of each surface in bytes, then (T,S) = __.
A – (50 K, 50000 K)
B – (50 K, 50000 K)
C – (25 K, 50000 K)
D – (40 K, 36000 K)
Show Answer With Best Explanation
Answer : C
Question 94 Comprehension: Question 91-95 concerns a disk with a sector size of 512 bytes, 2000 tracks per surface. 50 sectors per track, five double-sided platters, and average seek time of 10 milliseconds. Ques-94: What is the capacity of the disk, in bytes?
A – 25,000 K
B – 500,000 K
C – 250,000 K
D – 50,000 K
Show Answer With Best Explanation
Answer : B
Question 95 Comprehension: Question 91-95 concerns a disk with a sector size of 512 bytes, 2000 tracks per surface. 50 sectors per track, five double-sided platters, and average seek time of 10 milliseconds. Ques-95: If the disk platters rotate at 5400 rpm (revolutions per minute), then approximately what is the maximum rotational delay?
A – 0.011 seconds
B – 0.11 seconds
C – 0.0011 seconds
D – 1.1seconds
Show Answer With Best Explanation
Answer : A
Question 96
A – Both Statement I and Statement II are true
B – Both Statement I and Statement II are true
C – Statement I is correct but Statement II is false
D – Statement I is incorrect but Statement II is true
Show Answer With Best Explanation
Answer : C Explanation: 3 tables
Question 97 Ques – 97: On the basis of above given table structures, retrieve the distinct employee ID (EMPID) of all employees of university who are working on project No. 20, 30 and 40.
A – SELECT EMPID FROM PROJECTWORK WHERE PROJNO=(20,30,40);
B – SELECT EMPID FROM PROJECTWORK WHERE PROJNO IN (20,30,40);
C – SELECT DISTINCT EMPID FROM PROJECTWORK WHERE PROJNO IN (20,30,40);
D – SELECT DISTINCT EMPID FROM PROJECTWORK WHERE PROJNO=20,30,40;
