November 6, 2023

Transactions

Question 13 Consider the following database schedule with two transactions, T1 and T2. S = r2(X); r1(X); r2(Y); w1(X); r1(Y); w2(X); a1; a2 where ri(Z) denotes […]
November 6, 2023

Data-Interpretation

Question 50 The table shows the number of people in different age groups who responded to a survey about their favourite style of music. Use this […]
November 6, 2023

Database-Management-System

Question 443 In a system for a restaurant, the main scenario for placing order is given below: (a) Customer reads menu (b) Customer places an order […]
November 7, 2023

Question 7452 – Theory-of-Computation

Define the language INFINITEDFA ≡ {A|A is a DFA and L(A) is an infinite language}, where A denotes the description of the deterministic finite automata (DFA). […]
November 7, 2023

GATE 1996

Question 19 A critical section is a program segment A which should run in a certain specified amount of time B which avoids deadlocks C where […]
November 7, 2023

Question 1925 – Nielit STA 17-12-2017

The automaton which allows transformation to a new state without consuming any input symbols: Correct Answer: C Question 3 Explanation:  → NFA-l or e-NFA is an […]
November 7, 2023

UGC NET CS 2004 Dec-Paper-2

Question 1 AVA=A is called : A Identity law B De Morgan’​ s law C Idempotent law D Complement law Engineering-MathematicsPropositional-Logic Question 1 Explanation:  → ​ […]
November 7, 2023

UGC NET CS 2004 Dec-Paper-2

Question 9 Essential hazards may occur in : A Combinational logic circuits B Synchronous sequential logic circuits C Asynchronous sequential logic circuits working in the fundamental […]
November 7, 2023

UGC NET CS 2004 Dec-Paper-2

Question 6 An example of a binary number which is equal to its 2​ ’s complement is : A 1100 B 1001 C 1000 D 1111 […]
November 7, 2023

UGC NET CS 2004 Dec-Paper-2

Question 3 The context-free languages are closed for : (i) Intersection (ii) Union (iii) Complementation (iv) Kleene Star then A (i) and (iv) B (i) and […]
November 7, 2023

Question 9590 – P-NP

Ram and Shyam have been asked to show that a certain problem Π is NP-complete. Ram shows a polynomial time reduction from the 3-SAT problem to […]