GATE 2011 CSE Computer Science and information technology

[Q1 – Q25 carry ONE mark each ]

Q1➡ | Compiler Design
In a compiler, keywords of a language are recognized during
i ➥ Parsing of the program
ii ➥ The code generation
iii ➥ The lexical analysis of the program
iv ➥ Dataflow analysis

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Compiler Phases Help-Line

Q2➡ | Computer Network
A layer-4 firewall (a device that can look at all protocol headers up to the transport layer) CANNOT
i ➥ block entire HTTP traffic during 9:00PM and 5:00AM
ii ➥ block all ICMP traffic
iii ➥ stop incoming traffic from a specific IP address but allow outgoing traffic to the same IP address
iv ➥ block TCP traffic from a specific user on a multi-user system during 9:00PM and 5:00AM

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTube Firewall Help-Line

Q3➡ | Engineering Mathematics
If two fair coins are flipped and at least one of the outcomes is known to be a head, what is the probability that both outcomes are heads?
i ➥ 1/3
ii ➥ 1/4
iii ➥ 1/2
iv ➥ 2/3

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Probability Help-Line

Q4➡ | Computer Network
Consider different activities related to email:

m1: Send an email from a mail client to a mail server
m2: Download an email from mailbox server to a mail client
m3: Checking email in a web browser

Which is the application level protocol used in each activity?
i ➥ m1: HTTP m2: SMTP m3: POP
ii ➥ m1: SMTP m2: FTP m3: HTTP
iii ➥ m1: SMTP m2: POP m3: HTTP
iv ➥ m1: POP m2: SMTP m3: IMAP

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Application Layer ProtocolHelp-Line

Q5➡ | Software Engineering
A company needs to develop a strategy for software product development for which it has a choice of two programming languages L1 and L2. The number of lines of code (LOC) developed using L2 is estimated to be twice the LOC developed with Ll. The product will have to be maintained for five years. Various parameters for the company are given in the table below.


Total cost of the project includes cost of development and maintenance. What is the LOC for L1 for which the cost of the project using L1 is equal to the cost of the project using L2?
i ➥ 4000
ii ➥ 5000
iii ➥ 4333
iv ➥ 4667

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube LOC Help-Line

Q6➡ | Operating Systems
Let the time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes be t2. Which of the following is TRUE?
i ➥ (t1) > (t2)
ii ➥ (t1) = (t2)
iii ➥ (t1) < (t2)
iv ➥ Nothing can be said about the relation between t1 and t2

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Context Switching Help-Line

Q7➡ | Software Engineering
A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic COCOMO model. The multiplicative factor for this model is given as 2.8 for the software development on embedded systems, while the exponentiation factor is given as 1.20. What is the estimated effort in person-months?
i ➥ 234.25
ii ➥ 932.50
iii ➥ 287.80
iv ➥ 122.40

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube COCOMO Model Help-Line

Q8➡ | Theory of Computation
Which of the following pairs have DIFFERENT expressive power?
i ➥ Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA)
ii ➥ Deterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA)
iii ➥ Deterministic single-tape Turning machine and Non-deterministic single tape Turning machine
iv ➥ Single-tape Turning machine and multi-tape Turning machine

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Expressive Power Help-Line

Q9➡ | HTML
HTML (Hyper Text Markup Language) has language elements which permit certain actions other than describing the structure of the web document. Which one of the following actions is NOT supported by pure HTML (without any server or client side scripting) pages?
i ➥ Embed web objects from different sites into the same page
ii ➥ Refresh the page automatically after a specified interval
iii ➥ Automatically redirect to another page upon download
iv ➥ Display the client time as part of the page

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTube HTML Help-Line

Q10➡ | Software Engineering
Which of the following is NOT desired in a good Software Requirement Specifications (SRS) document?
i ➥ Functional Requirements
ii ➥ Non-Functional Requirements
iii ➥ Goals of Implementation
iv ➥ Algorithms for Software Implementation

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion Explanation On YouTubeSRS Help-Line

Q11➡ | Computer Organization
A computer handles several interrupt sources of which the following are relevant for this question.
. Interrupt from CPU temperature sensor (raises interrupt if CPU temperature is too high)
. Interrupt from Mouse(raises interrupt if the mouse is moved or a button is pressed)
. Interrupt from Keyboard(raises interrupt when a key is pressed or released)
. Interrupt from Hard Disk(raises interrupt when a disk read is completed)
Which one of these will be handled at the HIGHEST priority?
i ➥ Interrupt from Hard Dist
ii ➥ Interrupt from Mouse
iii ➥ Interrupt from Keyboard
iv ➥ Interrupt from CPU temperature sensor

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion Explanation On YouTube Interrupt Help-Line

Q12➡ | Database Management System
Consider a relational table with a single record for each registered student with the following attributes.
Registration_Num: Unique registration number of each registered student
UID: Unique identity number, unique at the national level for each citizen
BankAccount_Num: Unique account number at the bank. A student can have multiple accounts or join accounts. This attribute stores the primary account number.
Name: Name of the student
Hostel_Room: Room number of the hostel
Which one of the following option is INCORRECT?
i ➥ BankAccount_Num is a candidate key
ii ➥ Registration_Num can be a primary key
iii ➥ UID is a candidate key if all students are from the same country
iv ➥ If S is a superkey such that S∩UID is NULL then S∪UID is also a superkey

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion Explanation On YouTube Keys Help-Line

Q13➡ | Digital Logic Design
Which one of the following circuits is NOT equivalent to a 2-input XNOR (exclusive NOR) gate?
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion Explanation On YouTubeLogic Gates Help-Line

Q14➡ | Digital Logic Design
The simplified SOP (sum of product) form of the boolean expression
(P + Q’ + R’) . (P + Q’ +R) . (P + Q + R’)
i ➥ (P’.Q + R’)
ii ➥ (P+Q’.R’)
iii ➥ (P’.Q + R)
iv ➥ (P.Q + R)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeBoolean ExpressionHelp-Line

Q15➡ | Digital Logic Design
The minimum number of D flip-flops needed to design a mod-258 counter is
i ➥ 9
ii ➥ 8
iii ➥ 512
iv ➥ 258

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSequential Circuits Help-Line

Q16➡ | Operating Systems
A thread is usually defined as a “light weight process” because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the following is TRUE?
i ➥ On per-thread basis, the OS maintains only CPU register state
ii ➥ The OS does not maintain a separate stack for each thread
iii ➥ On per-thread basis, the OS does not maintain virtual memory state
iv ➥ On per thread basis, the OS maintains only scheduling and accounting information

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeThreads Help-Line

Q17➡ | Engineering Mathematics
K4 and Q3 are graphs with the following structures.

Which one of the following statement is TRUE in relation to these graphs?
i ➥ K4 is planar while Q3 is not
ii ➥ Both K4 and Q3 are planar
iii ➥ Q3 is planar while K4 is not
iv ➥ Neither K4 not Q3 is planar

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeGraph Theory Help-Line

Q18➡ | Engineering Mathematics
If the difference between the expectation of the square of a random variable (E[X2]) and the square of the expectation of the random variable (E[X])2 is denoted by R, then
i ➥ R = 0
ii ➥ R < 0
iii ➥ R ≥ 0
iv ➥ R > 0

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProbability Help-Line

Q19➡ | Compiler Design
The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?
i ➥ Finite state automata
ii ➥ Deterministic pushdown automata
iii ➥ Non-Deterministic pushdown automata
iv ➥ Turing machine

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCompilers Help-Line

Q20➡ | Operating Systems
Let the page fault service time to 10 ms in a computer with average memory access time being 20 ns. If one page fault is generated for every 106 memory accesses, what is the effective access time for the memory?
i ➥ 21 ns
ii ➥ 30 ns
iii ➥ 23 ns
iv ➥ 35 ns

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeMemory ManagementHelp-Line

Q21➡ | Computer Organization
Consider a hypothetical processor with an instruction of type LW R1, 20 (R2), which during execution reads a 32-bit word from memory and stores it in a 32-bit register R1. The effective address of the memory location is obtained by the addition of constant 20 and the contents of register R2. Which of the following best reflects the addressing mode implemented by this instruction for the operand memory?
i ➥ Immediate Addressing
ii ➥ Register Addressing
iii ➥ Register Indirect Scaled Addressing
iv ➥ Base Indexed Addressing

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeMachine InstructionsHelp-Line

Q22➡ | Programming
What does the following fragment of C-program print?
i ➥ GATE2011
ii ➥ E2011
iii ➥ 2011
iv ➥ 011

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProgram Help-Line

Q23➡ | Data Structures
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeHeap Tree Help-Line

Q24➡ | Theory of Computation
Let P be a regular language and Q be a context-free language such that Q ⊆ P. (For example, let P be the language represented by the regular expression p*q* and Q be [pnqn | n ∈ N]). Then which of the following is ALWAYS regular?
i ➥ P ∩ Q
ii ➥ P – Q
iii ➥ Σ* – P
iv ➥ Σ* – Q

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Regular Language Help-Line

Q25➡ | Theory of Computation
An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0:n-1] is given below. Let Li denote the length of the longest monotonically increasing sequence starting at index i in the array
Initialize Ln-1=1.
For all i such that 0≤i≤n-2

Finally the length of the longest monotonically increasing sequence is Max(L0, L1, …, Ln-1).
Which of the following statements is TRUE?
i ➥ The algorithm uses dynamic programming paradigm
ii ➥ The algorithm has a linear complexity and uses branch and bound paradigm
iii ➥ The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm
iv ➥ The algorithm uses divide and conquer paradigm

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Dynamic Programming Help-Line

[Q26 – Q55 carry TWO mark each ]

Q26➡ | Theory of Computation
Consider the languages L1,L2 and L3 as given below.
L1 = {0p1q | p,q∈N},
L2 = {0p1q | p,q∈N and p=q} and
L3 = {0p1q0r | p,q,r∈N and p=q=r}.
Which of the following statements is NOT TRUE?
i ➥ Push Down Automate (PDA) can be used to recognize L1 and L2
ii ➥ L1 is a regular language
iii ➥ All the three languages are context free
iv ➥ Turing machines can be used to recognize all the languages

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Language Help-Line

Q27➡ | Compiler Design
Consider two binary operators ‘↑’ and ‘↓’ with the precedence of operator ↓ being lower than that of the operator ↑. Operator ↑ is right associative while operator ↓, is left associative. Which one of the following represents the parse tree for expression (7↓3↑4↑3↓2)?
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Precedence and AssociativityHelp-Line

Q28➡ | Computer Organization
On a non-pipelined sequential processor, a program segment, which is a part of the interrupt service routine, is given to transfer 500 bytes from an I/O device to memory.
Initialize the address register
Initialize the count to 500


LOOP: Load a byte from device
Store in memory at address given by address register
Increment the address register
Decrement the count
If count != 0 go to LOOP


Assume that each statement in this program is equivalent to machine instruction which takes one clock cycle to execute if it is a non-load/store instruction. The load-store instructions take two clock cycles to execute.

The designer of the system also has an alternate approach of using DMA controller to implement the same transfer. The DMA controller requires 20 clock cycles for initialization and other overheads. Each DMA transfer cycle takes two clock cycles to transfer one byte of data from the device to the memory.
What is the approximate speedup when the DMA controller based design is used in place of the interrupt driven program based input-output?
i ➥ 3.4
ii ➥ 4.4
iii ➥ 5.1
iv ➥ 6.7

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeDMA Help-Line

Q29➡ | Data Structures
We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?
i ➥ 0
ii ➥ 1
iii ➥ n!
iv ➥

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeBinary Trees Help-Line

Q30➡ | Engineering Mathematics
Which one of the following options is CORRECT given three positive integers x,y and z, and a predicate

P(x) = ¬(x=1)∧∀y(∃z(x=y*z) ⇒ (y=x)∨(y=1))
i ➥ P(x) being true means that x is a prime number
ii ➥ P(x) being true means that x is a number other than 1
iii ➥ P(x) is always true irrespective of the value of x
iv ➥ P(x) being true means that x has exactly two factors other than 1 and x

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Propositional Logic Help-Line

Q31➡ | Engineering Mathematics
Given i=√-1, what will be the evaluation of the definite integral
i ➥ 0
ii ➥ 2
iii ➥ -i
iv ➥ i

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTube Calculus Help-Line

Q32➡ | Database Management System
Consider a database table T containing two columns X and Y each of type integer. After the creation of the table, one record (X=1, Y=1) is inserted in the table.
Let MX and My denote the respective maximum values of X and Y among all records in the table at any point in time. Using MX and MY, new records are inserted in the table 128 times with X and Y values being MX+1, 2*MY+1 respectively. It may be noted that each time after the insertion, values of MX and MY change.
What will be the output of the following SQL query after the steps mentioned above are carried out?
SELECT Y FROM T WHERE X=7;
i ➥ 127
ii ➥ 255
iii ➥ 129
iv ➥ 257

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSQL Help-Line

Q33➡ | Engineering Mathematics
Consider a finite sequence of random values X = [x1, x2, …, xn]. Let μx be the mean and σx be the standard deviation of X. Let another finite sequence Y of equal length be derived from this as yi = a * xi + b, where a and b are positive constants. Let μy be the mean and σy be the standard deviation of this sequence. Which one of the following statements is INCORRECT?
i ➥ Index position of mode of X in X is the same as the index position of mode of Y in Y.
ii ➥ Index position of median of X in X is the same as the index position of median of Y in Y.
iii ➥ μy = aμx + b
iv ➥ σy = aσx + b

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProbability Help-Line

Q34➡ | Engineering Mathematics
A deck of 5 cards (each carrying a distinct number from 1 to 5) is shuffled thoroughly. Two cards are then removed one at a time from the deck. What is the probability that the two cards are selected with the number on the first card being one higher than the number on the second.
i ➥ 1/5
ii ➥ 4/25
iii ➥ 1/4
iv ➥ 2/5

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Probability Help-Line

Q35➡ | Operating Systems
Consider the following table of arrival time and burst time for three processes P0, P1 and P2.

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?
i ➥ 5.0 ms
ii ➥ 4.33 ms
iii ➥ 6.33 ms
iv ➥ 7.33 ms

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Process SchedulingHelp-Line

Q36➡ | Comiler Design
Consider evaluating the following expression tree on a machine with load-store architecture in which memory can be accessed only through load and store instructions. The variables a, b, c, d and e initially stored in memory. The binary operators used in this expression tree can be evaluate by the machine only when the operands are in registers. The instructions produce results only in a register. If no intermediate results can be stored in memory, what is the minimum number of registers needed to evaluate this expression?
i ➥ 2
ii ➥ 9
iii ➥ 5
iv ➥ 3

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTube Register Allocation Help-Line

Q37➡ | Algorithms
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
f1(n)=2n
f2(n)=n3/2
f3(n)=n log2 n
f4(n)=nlog2n
i ➥ f3, f2, f4, f1
ii ➥ f3, f2, f1, f4
iii ➥ f2, f3, f1, f4
iv ➥ f2, f3, f4, f1

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Asymptotic ComplexityHelp-Line

Q38➡ | Algorithms
Four matrices M1, M2, M3 and M4 of dimensions p x q, q x r, r x s and s x t respectively can be multiplied is several ways with different number of total scalar multiplications. For example, when multiplied as ((M1 X M2) X (M3 X M4)), the total number of multiplications is pqr + rst + prt. When multiplied as (((M1 X M2) X M3) X M4), the total number of scalar multiplications is pqr + prs + pst.

If p = 10, q = 100, r = 20, s = 5 and t = 80, then the number of scalar multiplications needed is:
i ➥ 248000
ii ➥ 44000
iii ➥ 19000
iv ➥ 25000

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeDynamic ProgrammingHelp-Line

Q39➡ | Database Management Systems
Consider a relational table r with sufficient number of records, having attributes A1, A2,…, An and let 1≤p≤n. Two queries Q1 and Q2 are given below.
Q1: πA1,…,ApAp=c(r)) where c is a constant
Q2: πA1,…,Apc1≤Ap≤c2(r)) where c1 and c2 is a constants
The database can be configured to do ordered indexing on Ap or hashing on Ap. Which of the following statements is TRUE?
i ➥ Ordered indexing will always outperform hashing for both queries
ii ➥ Hashing will always outperform ordered indexing for both queries
iii ➥ Hashing will outperform ordered indexing on Q1, but not on Q2
iv ➥ Hashing will outperform ordered indexing on Q2, but not on Q1.

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeRelational Algebra Help-Line

Q40➡ | Engineering Mathematics
Consider the matrix as given below.

Which one of the following provides the CORRECT values of eigenvalues of the matrix?
i ➥ 1, 4, 3
ii ➥ 3, 7, 3
iii ➥ 7, 3, 2
iv ➥ 1, 2, 3

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLinear Algebra Help-Line

Q41➡ | Computer Organization
Consider an instruction pipeline with four stages (S1, S2, S3 and S4) each with combinational circuit only. The pipeline registers are required between each stage and at the end of the last stage. Delays for the stages and for the pipeline registers are as given in the figure:

What is the approximate speed up of the pipeline in steady state under ideal conditions when compared to the corresponding non-pipeline implementation?
i ➥ 4.0
ii ➥ 2.5
iii ➥ 1.1
iv ➥ 3.0

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeInstruction PipeliningHelp-Line

Q42➡ | Theory of Computation
Definition of a language L with alphabet {a} is given as following.
L = {ank| k>0, and n is a positive integer constant}
What is the minimum number of states needed in a DFA to recognize L?
i ➥ k+1
ii ➥ n+1
iii ➥ 2n+1
iv ➥ 2k+1

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeFinite Automata Help-Line

Q43➡ | Computer Organization
An 8KB direct-mapped write-back cache is organized as multiple blocks, each of size 32-bytes. The processor generates 32-bit addresses. The cache controller maintains the tag information for each cache block comprising of the following.
1 Valid bit
1 Modified bit
As many bits as the minimum needed to identify the memory block mapped in the cache.

What is the total size of memory needed at the cache controller to store meta-data (tags) for the cache?
i ➥ 4864 bits
ii ➥ 6144 bits
iii ➥ 6656 bits
iv ➥ 5376 bits

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCache Memory Help-Line

Q44➡ | Computer Organization
An application loads 100 libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as 10 ms. Rotational speed of disk is 6000 rpm. If all 100 libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected).
i ➥ 0.50 s
ii ➥ 1.50 s
iii ➥ 1.25 s
iv ➥ 1.00 s

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSecondary Storage Help-Line

Q45➡ | Theory of Computation
A deterministic finite automation (DFA) D with alphabet Σ={a,b} is given below.

Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Finite Automata Help-Line

Q46➡ | Database Management Systems
Database table by name Loan_Records is given below.

What is the output of the following SQL query?
SELECT Count(*) FROM
(
(SELECT Borrower, Bank_Manager FROM Loan_Records) AS S
NATURAL JOIN
(SELECT Bank_Manager, Loan_Amount FROM Loan_Records) AS T
);
i ➥ 3
ii ➥ 9
iii ➥ 5
iv ➥ 6

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSQL Help-Line

Q47➡ | Software Engineering
The following is the comment written for a C function
/* This function computes the roots of a quadratic equation a.x^2 + b.x + c = . The function stores two real roots in *root1 and *root2 and returns the status of validity of roots. It handles four different kinds of cases.
(i) When coefficient a is zero irrespective of discriminant
(ii) When discreminant is positive
(iii) When discriminant is zero
(iv) When discriminant is negative.
Only in case (ii) and (iii) the stored roots are valid. Otherwise 0 is stored in roots. The function returns 0 when the roots are valid and -1 otherwise. The function also ensures root1 >= root2 int get_QuadRoots( float a, float b, float c, float *root1, float *root2);

*/

A software test engineer is assigned the job of doing black box testing. He comes up with the following test cases, many of which are redundant.

Which one of the following option provide the set of non-redundant tests using equivalence class partitioning approach from input perspective for black box testing?
i ➥ T1, T2, T3, T6
ii ➥ T1, T3, T4, T5
iii ➥ T2, T4, T5, T6
iv ➥ T2, T3, T4, T5

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSoftware Testing Help-Line

Q48➡ | Programming
Common Data for Questions 48 and 49 :
Consider the following recursive C function that takes two arguments.

What is the return value of the function foo when it is called as foo(345, 10) ?
i ➥ 345
ii ➥ 12
iii ➥ 5
iv ➥ 3

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProgram Help-Line

Q49➡ | Programming
Common Data for Questions 48 and 49 :
Consider the following recursive C function that takes two arguments.

What is the return value of the function foo when it is called as foo(513,2)?
i ➥ 9
ii ➥ 8
iii ➥ 5
iv ➥ 2

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProgram Help-Line

Q50➡ | Digital Logic Design
Common Data for Questions 50 and 51:
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration.

If at some instance prior to the occurrence of the clock edge, P, Q and R have a value 0, 1 and 0 respectively, what shall be the value of PQR after the clock edge?
i ➥ 000
ii ➥ 001
iii ➥ 010
iv ➥ 011

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSequential Circuits Help-Line

Q51➡ | Digital Logic Design
Common Data for Questions 50 and 51:
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration.

If all the flip-flops were reset to O at power on, what is the total number of distinct outputs (states) represented by PQR generated by the counter?
i ➥ 3
ii ➥ 4
iii ➥ 5
iv ➥ 6

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSequential Circuits Help-Line

Q52➡ | Computer Network
Statement for Linked Answer Questions 52 and 53:

Consider a network with five nodes, N1 to N5 as shown below.

The network uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as following.

N1:(0,1,7,8,4)
N2:(1,0,6,7,3)
N3:(7,6,0,2,6)
N4:(8,7,2,0,4)
N5:(4,3,6,4,0)

Each distance vector is the distance of the best known path at the instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectors.
The cost of link N2-N3 reduces to 2(in both directions). After the next round of updates, what will be the new distance vector at node, N3.
i ➥ (3, 2, 0, 2, 5)
ii ➥ (3, 2, 0, 2, 6)
iii ➥ (7, 2, 0, 2, 5)
iv ➥ (7, 2, 0, 2, 6)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Routing Protocol Help-Line

Q53➡ | Computer Network
Statement for Linked Answer Questions 52 and 53:

Consider a network with five nodes, N1 to N5 as shown below.

The network uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as following.

N1:(0,1,7,8,4)
N2:(1,0,6,7,3)
N3:(7,6,0,2,6)
N4:(8,7,2,0,4)
N5:(4,3,6,4,0)

Each distance vector is the distance of the best known path at the instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectors.
After the update in the previous question, the link N1-N2 goes down. N2 will reflect this change immediately in its distance vector as cost, infinite. After the NEXT ROUND of update, what will be cost to N1 in the distance vector of N3?
i ➥ 3
ii ➥ 9
iii ➥ 10
iv ➥

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Routing Protocol Help-Line

Q54➡ | Algorithms
Statement for Linked Answer Questions 54 and 55:

An undirected graph G(V, E) contains n (n > 2) nodes named v1, v2, ….vn. Two nodes vi , vj are connected if and only if 0 < |i – j| ≤ 2. Each edge (vi, vj) is assigned a weight i + j. A sample graph with n = 4 is shown below.

What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes?
i ➥ (1/12) (11n2-5n)
ii ➥ n2 – n + 1
iii ➥ 6n – 11
iv ➥ 2n + 1

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Minimum Spanning TreeHelp-Line

Q55➡ | Algorithms
Statement for Linked Answer Questions 54 and 55:

An undirected graph G(V, E) contains n (n > 2) nodes named v1, v2, ….vn. Two nodes vi , vj are connected if and only if 0 < |i – j| ≤ 2. Each edge (vi, vj) is assigned a weight i + j. A sample graph with n = 4 is shown below.

The length of the path from v5 to v6 in the MST of previous question with n =10 is
i ➥ 11
ii ➥ 25
iii ➥ 31
iv ➥ 41

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Minimum Spanning TreeHelp-Line

error: Content is protected !!
Open chat
1
Hi,how Can We Help You ?