Computer Science Engineering (CSE)

  • a)
    32
  • b)
    50
  • c)
    52
  • d)
    100
  • e)
    None of the above
Correct answer is option 'B'. Can you explain this answer?

ARNAB SAHA answered  •  1 hour ago
x>=4 and y>=4 , So we can take both x =5 & y = 5
x+y >= 10 => Satisfied , 5+5 = 10
2x + 3y >= 20. Satisfied.
This is infact minimum value.
Other options =>
4,4 => x+y constraint fail
4,5 => x+y fail
6,4 => Still giving 52 as sum which is more than 50 !,  This can not  be answer.
7,3 => 49+9 > 58 > 50.

In questions 2.1 to 2.10 below, each blank (___) is to be suitably filled in. 
    Correct answer is '1'. Can you explain this answer?

    YAGYESH SHARMA answered  •  1 hour ago
    Use LH rule:
    First Derivative: [x(ex) + (ex-1) - 2(sinx)]/[xsinx + (1 - cosx)]
    Second Derivative: [xex + ex + ex - 2cosx]/[{xcosx + sinx + sinx]
    Third Derivative: [xex + ex + ex + ex + 2sinx]/[-xsinx + cosx + cosx + cosx]
    Put x = 0: [0+1+1+1+0]/[0+1+1+1] = 3/3 = 1.

    Let π be a problem that belongs to the class NP. Then which one of the following is TRUE?
    • a)
      There is no polynomial time algorithm for πA
    • b)
      If πA can be solved deterministically in polynomial time, then P = NP
    • c)
      If πA is NP-hard, then it is NP-complete
    • d)
      πA may be undecidable
    Correct answer is option 'C'. Can you explain this answer?

    ASHISH RAJ answered  •  1 hour ago
    it is given that πA ∈ NP
    ∴ If πA is NP-hard, and since it is given that πA ∈ NP , this means that πA is NP-complete
    ∴ choice (c) is correct.
    Notice that choice (a) is incorrect since as P ∈ NP, some NP problems are actually P and hence polynomial time algorithm can exist for these.
    Choice (b) is incorrect since, If πA can be solved deterministicaily in polynomial time, it does not generate that P=NP, unless of-course it is additionally known that πA is NP-complete.
    Choice (d) is incorrect since,
    All problems belonging to P or NP have to be decidable.

    Choose the correct statements:
    • a)
      Enum variables can be assigned new values.
    • b)
      Enum variables can be compared.
    • c)
      Use of enumeration enhances the logical clarity of a program, Although it does not increase the power of C.
    • d)
      All of the above
    Correct answer is option 'D'. Can you explain this answer?

    AMAN KARAKOTI answered  •  1 hour ago
    Enum variable type is a special flavor of a long type variable with an enum, we can specify a number of valid values for that variable and descripted constant names for the values of the enum. These values are used instead of constant. Enum variable can be declared. The advantage of enum is it provide logical clarity of a program.

    Algorithm design technique used in quicksort algorithm is
    • a)
      Dynamic programming
    • b)
      Backtracking
    • c)
      Divide and conquer
    • d)
      Greedy method
    Correct answer is option 'C'. Can you explain this answer?

    TARUSH TIWARI answered  •  1 hour ago
    Quick sort algorithm is based on divide an conquer approach.
    Since we conquer the array by dividing it one the basis of pivot elements till the sorted array is obtained

    Which of the following is not true?
    • a)
      Any LL grammar is unambiguous.
    • b)
      DCFL’s are never inherently ambiguous.
    • c)
      If G is an LR(k) grammar, then L(G) is a DCFL.
    • d)
      All CFL’s which are not DCFL’s are ambiguous.
    Correct answer is option 'D'. Can you explain this answer?

    PRAKHAR AGRAWAL answered  •  12 hours ago
    • Every LL grammar must be unambiguous but every unambiguous need not be LL grammar.
    • Ambiguity in language starts from CFL. So, DCFL cannot be inherently ambiguous.
    • if G is an LR(K) grammar, then L{G) is a DCFL.
    • Every CFL’s which are not DCFL need not be ambiguous.

    Consider the following set of languages:

    Which of the above language is not context free?
    • a)
      L1 and L3
    • b)
      L2 and L3
    • c)
      L1 and L2
    • d)
      All L1, L2 and L3.
    Correct answer is option 'C'. Can you explain this answer?

    DILPREET SINGH answered  •  12 hours ago

    In L1 n = m2 cannot be checkes in stack as m2 is a nonlinear function.
    Hence it is not CFL.
    L2 requires 2 comparisons on number as itself 
    ⇒ Number of a’s = number of b’s and number of c’s. This cannot be done by single stack
    L3 requires 2 comparisons, but only one at a time is required.
    ⇒ Number of a’s = number of b’s and number of c’s = number of d/’s. This can be done in single stack.

     Let m, n be positive integers. Define Q(m, n) as
    Then Q(m, 3) is (a div b, gives the quotient when a is divided by b)
    • a)
      a constant
    • b)
      p x (m mod 3)
    • c)
      p x ( m div 3)
    • d)
      3 x p
    Correct answer is option 'C'. Can you explain this answer?

    NISHA KUMARI answered  •  12 hours ago
    Two cases: Q(m, 3)
    (i) m ≥ n : here m ≥ 3 
    For

    ∵ Since 3 is divide by 3 only 1 time = 0 + P= P.
    So this recursive program generate P, m/n times until m < n.
    So, Q(m, 3) = Px(m div 3)

    In an E-R diagram ellipses represent
    • a)
      Entity sets
    • b)
      Relationship among entity sets
    • c)
      Attributes
    • d)
      Link between attributes and entity sets
    Correct answer is option 'C'. Can you explain this answer?

    SUNITA KUMARI answered  •  12 hours ago
    In a E-R diagram, a rectangle represents entity set, relationship among entity set are represented by diamond box. Attributes are represented by ellipse and the link between attributes and entity set are represented by straight lines.

    The relational algebra expression equivalent to the following expression:
     is:
    • a)
    • b)
    • c)
    • d)
    Correct answer is option 'B'. Can you explain this answer?

    MONIKA TEMPTA answered  •  12 hours ago
    The expression

    can be represented in relational algebra as

    It says that select those rows from relation r where A = 10 union where B = 20.
    Hence option (b) is correct.

    Peterson’s algorithm is the solution of which of the following problem.
    • a)
      Deadlock
    • b)
      Mutual exclusion
    • c)
      Trashing
    • d)
      Paging
    Correct answer is option 'B'. Can you explain this answer?

    KAJAL PAWAN answered  •  yesterday
    Peterson's algorithm restricts process entry. It ensures that the concurrent processes will enter alternatively into critical section. So, also solving problem of mutual exclusion.

    With the help of which of the following relations operation set we can perform division on relations?
    • a)
      {π, x, -}
    • b)
    • c)
      {x,-}
    • d)
      {x}
    Correct answer is option 'A'. Can you explain this answer?

    NISHA KUMARI answered  •  yesterday
    With the help of {π, x, -} we can perform division operation.
    Note: Division operator produces a relation R(X) that includes all tuples t[x] in R(z) that appear in R in combination with every tuple from R2y) when Z = X ∪ Y.

    The default subnet mask for a Class B network can be
    • a)
      255.255.255.0
    • b)
      255.255.0.0
    • c)
      255.255.192.0
    • d)
      255.0.0.0
    Correct answer is option 'B'. Can you explain this answer?

    SHILPA VERMA answered  •  yesterday
    If IP address is AND with subnet mask result will network address.
    Default subnet mask:
    Class A = 255.0.0.0
    Class B = 255.255.0.0
    Class C = 255.255.255.0

    Brouter
    • a)
      Is a type of bridge
    • b)
      Works at all the layers Of OS I model
    • c)
      Is able to bridge those protocols that are not routable
    • d)
      None of these
    Correct answer is option 'C'. Can you explain this answer?

    PUJA RANI answered  •  yesterday
    Brouter is a device, which is combination of functionality of bridge and router. So, it works till network layer and is able to bridge those protocol that are not routable.

    Which of the following error detection method consists of just one redundant bit per data unit?
    • a)
      Checksum
    • b)
      LRC
    • c)
      CRC
    • d)
      VRC
    Correct answer is option 'D'. Can you explain this answer?

    MANISHA DEVI answered  •  yesterday
    Vertical redundancy check (VRC), often called a parity check. In this, a redundant bit, called parity bit, is appended to every data unit so that total number of 1 ’s in unit becomes even (including the parity bit).

    Which of the following page replacement algorithms suffers from Belady’s anomaly?
    • a)
      Shortest job first
    • b)
      Round robin
    • c)
      First-come-first-serve
    • d)
      Elevator
    Correct answer is option 'C'. Can you explain this answer?

    KIRAN THAKUR answered  •  yesterday
    There are two types of page replacement algorithm mainly stack based and non-stack based, it is observed that algorithms which follows the latter one suffers from Belady’s anomaly. FIFO suffers from Belady's anomaly.

    Cache memory enhances
    • a)
      Memory capacity
    Correct answer is option ''. Can you explain this answer?

    SUMAN KUMARI answered  •  yesterday
    Cache memory is very small as compared to SM and MM. It stores the data according to principle of locality. As it is on the top most level in the memory hierarchy if data is found in cache the access time is negligible. Hence it enhances effective access time.

    The difference between the compound and simple interest on a certain sum for 2 years at the rate of 8% per annum is Rs.80,What is the sum?
    • a)
      11,880
    • b)
      12,500
    • c)
      13,250
    • d)
      14,270
    Correct answer is option 'B'. Can you explain this answer?

    BINTA BALA answered  •  yesterday
    Difference in simple and compound interest at the end of 2 years occurs because there is interest on first year interest. So Difference = P×(R100)2P×(R100)2
    ⇒ 80 = P×(8100)2P×(8100)2
    ⇒ P=80×(1008)2P=80×(1008)2 = 12,500

    The information about an array that is used in a program wiil be stored in
    • a)
      Symbol table
    • b)
      Activation record
    • c)
      System table
    • d)
      Dope vector
    Correct answer is option 'D'. Can you explain this answer?

    SHWETA DEVI answered  •  yesterday
    A dope vector is a data structure used to hold information about a data objects eg. an array, especially layout of array’s memory. It contain information such as rank of an array, type of elements of array etc.

    Fetching relevant content for you
    Ask a question