Recent questions tagged gatecse-2004

59 votes
4 answers
2
26 votes
5 answers
4
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2.$$\begin{array}{|ll|ll|}\hline \rlap{\textbf{Group 1}} & & \rlap{...
25 votes
4 answers
7
The language $\left\{a^mb^nc^{m+n} \mid m, n \geq1\right\}$ isregularcontext-free but not regularcontext-sensitive but not context freetype-0 but not context sensitive
38 votes
4 answers
8
47 votes
7 answers
10
The recurrence equation$ T(1) = 1$$T(n) = 2T(n-1) + n, n \geq 2$evaluates to$2^{n+1} - n - 2$$2^n - n$$2^{n+1} - 2n - 2$$2^n + n $
31 votes
6 answers
11
37 votes
7 answers
17
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is$2$$3$$4$$5$
35 votes
4 answers
18
40 votes
4 answers
22
The following is the incomplete operation table of a $4-$element group.$$\begin{array}{|l|l|l|l|l|} \hline \textbf{*} & \textbf{e}& \textbf{a} &\textbf{b} & \textbf{c}\\\...
28 votes
4 answers
23
How many solutions does the following system of linear equations have?$-x + 5y = -1$$x - y = 2$$x + 3y = 3$infinitely manytwo distinct solutionsuniquenone
32 votes
5 answers
24
27 votes
5 answers
28
Let $A = 1111 1010$ and $B = 0000 1010$ be two $8-bit$ $2’s$ complement numbers. Their product in $2’s$ complement is$1100 0100$$1001 1100$$1010 0101$$1101 0101$