Register
Filter

Answers by eyeamgj

0 votes
1
UGC NET CSE | December 2006 | Part 2 | Question: 8
A sum of products expression can be implemented with __________ logic gates. AND−OR NAND−OR AND−NOT OR−AND
A sum of products expression can be implemented with __________ logic gates.AND−ORNAND−ORAND−NOTOR−AND
0 votes
2
UGC NET CSE | December 2006 | Part 2 | Question: 9
The characteristic equation of the $\text{D}$ flip-flop is : $\text{Q=D}$ $\text{Q=1}$ $\text{Q=0}$
The characteristic equation of the $\text{D}$ flip-flop is : $\text{Q=D}$$\text{Q=1}$$\text{Q=0}$
1 votes
3
Testbook test series
0 votes
5
Self doubt
How to solve the question involving the calculation of safe sequence when the resource allocation graph is given instead of the table. Eg. In the question below..What should be the approach to solve the question??? Plzz explain..
How to solve the question involving the calculation of safe sequence when the resource allocation graph is given instead of the table. Eg. In the question below..What sho...
0 votes
6
Madeeasy_OperatingSystem_subjectTest
Shaik Masthan please explain me ..thank you
Shaik Masthanplease explain me ..thank you
3 votes
7
Time Complexity
What will be TC here? Ans given $O(n^{2})$ , while I am getting $O(n)$
What will be TC here?Ans given $O(n^{2})$ , while I am getting $O(n)$
2 votes
8
Engineering mathematics
if the sum of the diagonal elements of a 2x2 matrix is (-6) then the maximum possible value of determinant of the matrix is
if the sum of the diagonal elements of a 2x2 matrix is (-6) then the maximum possible value of determinant of the matrix is
0 votes
9
selfdoubt os
1 votes
10
MadeEasy Subject Test 2019: Algorithms - Sorting
Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst case using an efficient algorithm are
Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst ca...
1 votes
12
Binary search
Given a sorted array of n elements where other than one element x every other elenent repeat two times then how much time will it take to find position of x
Given a sorted array of n elements where other than one element x every other elenent repeat two times then how much time will it take to find position of x
0 votes
13
gate preparation
other than last year questions, what are the other sources to prepare for gate cs?
other than last year questions, what are the other sources to prepare for gate cs?
0 votes
14
Directed Acyclic Graph
Question.Construct the Dag for the following Assume that + is left associative? a)a+b+(a+b) b)a+b+a+b c)a+a+(a+a+a+(a+a+a+a)) Please give the Answer to these questions?????
Question.Construct the Dag for the following Assume that + is left associative?a)a+b+(a+b)b)a+b+a+bc)a+a+(a+a+a+(a+a+a+a))Please give the Answer to these questions?????
0 votes
15
TURING MACHINE
WHATS THE MAIN DIFFERENCE between RECURSIVELY ENUMARABLE but not RECUSIVE and NOT RECURSIVELY ENUMARABLE??????/ PLZ help me out with this
WHATS THE MAIN DIFFERENCE between RECURSIVELY ENUMARABLE but not RECUSIVEand NOT RECURSIVELY ENUMARABLE??????/PLZ help me out with this
0 votes
16
Decidable
1)Let G be CFG. Whether L(G) is CFL. Q)Is it decidable or not? 2)Let G be CFG and unambiguous. Whether L(G) is CFL. Q)Is it decidable or not?
1)Let G be CFG. Whether L(G) is CFL.Q)Is it decidable or not?2)Let G be CFG and unambiguous. Whether L(G) is CFL.Q)Is it decidable or not?
0 votes
19
Made easy test series
Please explain this???
Please explain this???
1 votes
20
Admission related
I gave gate 2018 and got 2262 rank(43.33 marks)) .Is there any chance for me to get I to NITs for mtech now....
I gave gate 2018 and got 2262 rank(43.33 marks)) .Is there any chance for me to get I to NITs for mtech now....
1 votes
21
C variable declaration
What is the output of below code? #include<stdio.h> Int check(int); Int main() { Int k=35,z; z=check(k); printf("z=%d\n",z); return 0; } int check(int m) { int m; if(m>40) return (!m++); else return (!++m); }
What is the output of below code?#include<stdio.h Int check(int); Int main() { Int k=35,z; z=check(k); printf("z=%d\n",z); return 0; } int check(int m) { int m; if(m>40) ...
2 votes
22
JNU exam
If R be an equivalence relation on the set, A={6,7,8,9,10} defined by, R={(6,6),(7,7),(8,8),(9,9),(10,10),(6,7),(7,6),(8,9),(9,8),(9,10),(10,9),(8,10),(10,8)}, its partitions are a) {{6},{7},{8,9},{10}} b) {{6,7,8},{9,10}} c) {{6},{7,8},{9,10}} d) {{6,7},{8,9,10}}
If R be an equivalence relation on the set, A={6,7,8,9,10} defined by, R={(6,6),(7,7),(8,8),(9,9),(10,10),(6,7),(7,6),(8,9),(9,8),(9,10),(10,9),(8,10),(10,8)}, its partit...
0 votes
23
Why b is not decrementing ?
main() { int a = 1; int b = 1; int c = a || b--; printf("a = %d b=%d\n",a,b); return 0; }
main(){int a = 1; int b = 1; int c = a || b ; printf("a = %d b=%d\n",a,b); return 0;}
1 votes
26
#Graph Theory #Algorithms Self Doubt about Dense Graphs.
Please give some example regarding number of edges in dense graph is - |E| < |V2| I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
Please give some example regarding number of edges in dense graph is - |E| < |V2|I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
Page: