GATE CSE 1991 PYQ

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Kruskal's algorithm for finding a minimum spanning tree of a weighted graph G with n vertices a

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Indicate all the true statements from the following:

Choose the correct alternatives (more than one may be correct ) and write the corresponding letters only A "link editor" is a program that:

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: The TRAP interrupts mechanism of the 8085 microprocessor:

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: The advantages of CMOS technology over a MOS is:

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Advantage of synchronous sequential circuits over asynchronous ones is:

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: If , and are propositional formulae such that and are both tautologies, then which of the follo

Choose the correct alternatives (more than one can be correct) and write the corresponding letters only: Indicate all the false statements from the statements given below:

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: The total size of address space in a virtual memory system is limited by:

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Consider the following Pascal function: Function X(M:integer):integer; Var i:integer; Begin i :

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: The following sequence of operations is performed on a stack: PUSH (10), PUSH (20), POP, PUSH (

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following is the strongest correct statement about a finite language over some fin

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only. Let be three regular expressions. Which one of the following is true?