GATE CSE 1990 PYQ

Choose the correct alternatives (More than one may be correct). The complexity of comparision based sorting algorithms is:

Choose the correct alternatives (More than one may be correct). Indicate which of the following statements are true: A relational database which is in 3NF may still have undesirable data redundancy be

Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function Y, implemented by the circui

Choose the correct alternatives (More than one may be correct). The number of ways in which 5 A's, 5 B's and 5 C's can be arranged in a row is:

Choose the correct alternatives (More than one may be correct). A graph is planar if and only if,

Choose the correct alternatives (More than one may be correct). Indicate which of the following well-formed formulae are valid:

Choose the correct alternatives (More than one may be correct). The number of rooted binary trees with n nodes is,

Choose the correct alternatives (More than one may be correct). The total external path length, EPL, of a binary tree with n external nodes is, , where is the path length of external node w),

Choose the correct alternatives (More than one may be correct). Recursive languages are:

Choose the correct alternatives (More than one may be correct). Let and be regular sets defined over the alphabet Then:

Choose the correct alternatives (More than one may be correct). It is undecidable whether: