Register
Filter

Answers by Rupendra Choudhary

557
views
1 votes
c input output problem
int A(int m,int n){ if(!m) return n+1; if(!n) return A(m-1,1); return A(m-1,A(m,n-1));}int main(){ printf("A(1,2)=%d",A(1,2)); }what will be the outp...
15.4k
views
21 votes
GATE CSE 2006 | Question: 36
Given two three bit numbers $a_{2}a_{1}a_{0}$ and $b_{2}b_{1}b_{0}$ and $c$ the carry in, the function that represents the carry generate function when these two numbers ...
367
views
0 votes
peter linz excercise
497
views
0 votes
Modified form of gate - 2000 , ISRO 2015
#include<stdio.h struct { short x[5]; union { float y; long z; }u; }t; int main() { printf("short=%d\n",sizeof(short)); printf("float=%d\n",sizeof(float)); printf("long=%...
1.9k
views
0 votes
Selection sort and Insertion sort
Selection sort is an example of ____(I)_______ and insertion sort is an example of __(II)______.a) I- Greedy, II- Brute Forceb) I- Brute Force II- Divide and conquerc) I-...
1.2k
views
0 votes
Gate-Verbal
can anyone tell me how to i prepare my verbal ability for gate .plz suggest me source of reading verbal ability.
930
views
1 votes
galvin
when and why are segmentation and paging sometimes combined into one scheme?
253
views
0 votes
CN by Andrew S. Tanenbaum
how can I design 6 subnets for any given IP i.e. how many bits are required and how it will be done?
1.2k
views
0 votes
DBMS Doubt - Normalization
Does any normal form impose the condition "every non-key should depend upon every key"?
375
views
0 votes
What is the value of the following recurrences?
1 :- T(n) = T(n-2) + n22 :- T(n) = 4T(n/3) + nlgn3 :- T(n) = 3T(n/3 - 2) + n/2
3.4k
views
0 votes
All gate cse Standard books
I find it difficult to read standard books. I understand the concepts by watching videos and solving GATE Questions. Should i jump to questions in standard books directly...
465
views
2 votes
ACE Practice Test question
An electronic assembly consists of two sub systems say A and B from previous testing procedures , the following probability are assumed to be known,P(A fails) = 0.2P(B fa...
1.3k
views
0 votes
MadeEasy Workbook: Digital Logic - Number Representation
From the 7 symbols (0-6) how many different codes we can construct?(a) 8! (b) 8(c) 7! (d) 7 provide an explanation, answer is (a)
3.7k
views
0 votes
ISRO 2011-ECE Digital Logic
In a JK Flipflop we have J= Q' and K=1. assuming that the flipflop was initially cleared and clocked for 6 pulses, the sequence at the Q output will bea) 010000b) 011001...
15.3k
views
39 votes
GATE CSE 2011 | Question: 15
The minimum number of $\text{D}$ flip-flops needed to design a mod-258 counter is98512258
31.0k
views
1 votes
GATE CSE 2010 | Question: 32
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$$10$, $11$, $...
975
views
0 votes
Minimal DFA
$$\begin{align*} \large\color{green}{L_1 = L\left ( a^{*}bb \right ) \cup L\left ( ab^{*}ba \right ) } \\ \end{align*}$$Minimal DFA for $L_1$
841
views
0 votes
Ace Test Series: Theory Of Computation - Finite Automata
Simple question. However the question mention MFA or minimal Finite Automation. So can i take NFA as it has 3 states. DFA has four ( 1 extra for the dead state);
394
views
0 votes
NFA doubt
I have a doubt regarding NFAConsider So this NFA will accept strings like b,ab. But what if a string aba comes? Will it be accepted? The question I have is that with 'ab'...
295
views
0 votes
TestBook
How to interpret the transitions? I interpreted as L={a*}
1.7k
views
0 votes
Non deterministic PDA
Can the NPDA constructed to accept L, such that L = L1 U L2 , L1 = {1n 0n | n 0} and L2 = {0n 12n | n 0} be drawn like this?This is an informal representation of NPDA. ...
432
views
0 votes
finite language, cfl
Is {a^nb^n|n>0} a finite language?
6.8k
views
0 votes
GATE CSE 2002 | Question: 1.16
Sign extension is a step in floating point multiplicationsigned $16$ bit integer additionarithmetic left shiftconverting a signed integer from one size to another
384
views
0 votes
NET 2011- Flag bits
List – I List – II(Flags) (Bit Position)(a) Sign flag (i) 4th bit(b) Parity (ii) 6th bit(c) Zero ...
2.7k
views
0 votes
Standard books PDF.
Anyone is having standard book for coa hamachare 7 edition pls share link.
329
views
0 votes
#gate18
From where I can get deep concepts of computer networks...for GATE as beginner..
1.1k
views
1 votes
Implicants and prime implicants
For F(x,y,z)=$\sum (1,3,4,5)$ , what is the number of implicants and prime implicants?
3.5k
views
0 votes
Which of the following features cannot be captured by CFG?
Which of the following features cannot be captured by CFG? Syntax of if - then – else statements Whether a variable is declared before its use Syntax of recursive pr...
Page: