Joint Entrance Examination

Graduate Aptitude Test in Engineering

Strength of Materials Or Solid Mechanics

Structural Analysis

Construction Material and Management

Reinforced Cement Concrete

Steel Structures

Geotechnical Engineering

Fluid Mechanics and Hydraulic Machines

Hydrology

Irrigation

Geomatics Engineering Or Surveying

Environmental Engineering

Transportation Engineering

Engineering Mathematics

General Aptitude

1

Consider a simple checkpointing protocol and the following set of operations in the log.

(start, $$T4$$); (write, $$T4, y, 2, 3$$); (start, $$T1$$); (commit, $$T4$$); (write, $$T1, z, 5, 7$$);

(checkpoint);

(start, $$T2$$); (write, $$T2, x, 1, 9$$); (commit, $$T2$$); (start, $$T3$$), (write, $$T3, z, 7, 2$$);

If a crash happens now and the system tries to recovver using both undo and redo operations, what are the contents of the undo list and the redo list?

A

Undo: $$T3,T1;$$ Redo: $$T2$$

B

Undo: $$T3,T1;\,{\mathop{\rm Re}\nolimits} do:T2,T4$$

C

Undo: none; Redo: $$T2,T4,T3,T1$$

D

Undo: $$T3,T1,T4;\,\,$$ Redo : $$T2$$

2

Consider two relations $${R_1}\left( {A,B} \right)$$ with the tuples $$(1,5), (3,7)$$ and $${R_2}\left( {A,C} \right) = \left( {1,7} \right),\left( {4,9} \right).$$

Assume that $$R(A,B,C)$$ is the full natural outer join of $${R_1}$$ and $${R_2}$$. Consider the following tuples of the form $$(A,B,C): a = (1,5,null),$$ $$b = (1,null,7),$$ $$c = (3, null, 9),$$ $$d = (4,7,null),$$ $$e = (1,5,7),$$ $$f = (3,7,null),$$ $$g = (4,null,9).$$ Which one of the following statements is correct?

Assume that $$R(A,B,C)$$ is the full natural outer join of $${R_1}$$ and $${R_2}$$. Consider the following tuples of the form $$(A,B,C): a = (1,5,null),$$ $$b = (1,null,7),$$ $$c = (3, null, 9),$$ $$d = (4,7,null),$$ $$e = (1,5,7),$$ $$f = (3,7,null),$$ $$g = (4,null,9).$$ Which one of the following statements is correct?

A

$$R$$ contains $$a, b, e, f, g$$ but not $$c, d.$$

B

$$R$$ contains all of $$a, b, c, d, e, f, g.$$

C

$$R$$ contains $$e, f, g$$ but not $$a, b.$$

D

$$R$$ contains $$e$$ but not $$f, g.$$

3

The minimum number of $$JK$$ flip-flops required to construct a synchronous counter with the count sequence $$\left( {0,0,1,1,2,2,3,3,0,0,...} \right)$$ is ____________.

Your Input ________

Correct Answer is **3**

4

The number of min-terms after minimizing the following Boolean expression is _______________ .
$$$\left[ {D' + AB' + A'C + AC'D + A'C'D} \right]'$$$

Your Input ________

Correct Answer is **1**

Subject Name | Total Questions |
---|---|

Algorithms | 5 |

Compiler Design | 3 |

Computer Networks | 6 |

Computer Organization | 4 |

Data Structures | 3 |

Database Management System | 4 |

Digital Logic | 3 |

Discrete Mathematics | 12 |

Operating Systems | 4 |

Programming Languages | 3 |

Software Engineering | 3 |

Theory of Computation | 4 |

Web Technologies | 1 |

GATE CSE 2021 Set 2

GATE CSE 2021 Set 1

GATE CSE 2020

GATE CSE 2019

GATE CSE 2018

GATE CSE 2017 Set 2

GATE CSE 2017 Set 1

GATE CSE 2016 Set 2

GATE CSE 2016 Set 1

GATE CSE 2015 Set 3

GATE CSE 2015 Set 2

GATE CSE 2015 Set 1

GATE CSE 2014 Set 2

GATE CSE 2014 Set 3

GATE CSE 2014 Set 1

GATE CSE 2013

GATE CSE 2012

GATE CSE 2011

GATE CSE 2010

GATE CSE 2009

GATE CSE 2008

GATE CSE 2007

GATE CSE 2006

GATE CSE 2005

GATE CSE 2004

GATE CSE 2003

GATE CSE 2002

GATE CSE 2001

GATE CSE 2000

GATE CSE 1999

GATE CSE 1998

GATE CSE 1997

GATE CSE 1996

GATE CSE 1995

GATE CSE 1994

GATE CSE 1993

GATE CSE 1992

GATE CSE 1991

GATE CSE 1990

GATE CSE 1989

GATE CSE 1988

GATE CSE 1987