Register
Filter

Recent questions without a selected answer

618
views
2 answers
0 votes
Test Series
User Avatar
1.2k
views
1 answers
0 votes
K-map and don't cares
"once you have assumed a don't care as '1' u can't use the same don't care for grouping zeros and vice versa."is it correct or not??
User Avatar
203
views
0 answers
0 votes
SELF DOUBT
https://gateoverflow.in/3828/gate2005-it-66 WHAT IS THIS QUESTION TRYING TO SAY????
User Avatar
377
views
2 answers
0 votes
Test Series
User Avatar
388
views
1 answers
0 votes
Cross_Joins
What is CROSS JOIN with an empty table ??
User Avatar
1.1k
views
0 answers
0 votes
Semaphore bounded waiting
Does Semaphore satisfy bounded waiting? If so, how?
User Avatar
255
views
1 answers
0 votes
Gate Preparation
when any theory question is asked how to attempt them in Gate. Is it required to read the standard text books for these things to answer?
User Avatar
1.1k
views
1 answers
1 votes
Binary Search Tree
1) How many ways we can traverse 1,2,3,4 in BST?2) How many ways we can insert 1,2,3,4 in BST? ... both are different in calculation of BST?Why they are use different formula?
User Avatar
299
views
0 answers
0 votes
GO PDF
A NULL free LL(1) grammar is also SLR(1)WHY?
User Avatar
329
views
1 answers
0 votes
digital logic
Explain this question
User Avatar
511
views
3 answers
0 votes
doubt toc
wxw ;w,x belongs to {a,b}*this regular or dcfl or cfl??? somewhere it is written as regular but dontknow why??
User Avatar
1.7k
views
0 answers
0 votes
Heap Sorting
Consider a binary tree, where left and right subtreealready heapified. But we havenot done heapificationfor root yet. Then what is time complexity to convert it in a full heap tree? ... $\theta (n)$ $D)\text{None of these}$
User Avatar
632
views
0 answers
0 votes
Merge Sort (Code)
why this margeSort program showing time limit exceed ?#include <stdio.h> #include <stdlib.h> #include <time.h> void fillArray(int array[], int n) { time_t t; time( ... n \n Time taken for sorting: %f seconds\n\n",cpu_time_used); return 0; }
User Avatar
936
views
0 answers
0 votes
Memory Hierarchy
if simply the access time of level-1 meomry and level-2 memory is given and hit ratio is given then for average time access what should be the approach? should i go for hierarchical or simultaneous access?
User Avatar
134
views
0 answers
0 votes
self doubt
Q. The part of the operating system manages the essential peripherals , such as keyboard , screen , disk drives , and parallel and serial ports . options A . ... B. Secondary I/O System C. Peripherals I/O System D. Marginal I/O System
User Avatar
414
views
1 answers
0 votes
Carry look ahead adder
User Avatar
456
views
1 answers
0 votes
Self doubt
Q. This comprises the detailed Machine language necessary to control a specific device and is controlled by the operating system is... options A. Driver B. utility program C. virtual memory D. peripheral device explain properly
User Avatar
626
views
1 answers
0 votes
Nested quantifiers
Let domain be set of all fruits.Represent the following English statement into logic.1)There are exactly 2 apple.S1:∃x∃y[A(x)⋀A(y)⋀(x≠y)⋀∀z(A(z)→ ... S1↔S2 ?If yes then how can u convert S2 into S1 using negating quantifier predicates
User Avatar
142
views
0 answers
0 votes
Eigen vector
User Avatar
313
views
1 answers
0 votes
SELF DOUBT DCFL
SUPPOSE WE HAVE A SITUATION IN BETWEEN LIKE THIS (DCFL) INTERSECTION (REGULAR LANG)..............................SITUATION 1NOW WE CAN WRITE DCFL ... UNDER REGULAR INTERSECTION HENCE DCFL ...........WHY THIS CONTRADICTION IS ARISING??????
User Avatar
457
views
0 answers
0 votes
Process Scheduling
printf("Hello");if(!fork())printf("World");
User Avatar
680
views
4 answers
1 votes
MadeEasy Test Series: Computer Networks - Network Security
DH key exchange algorithm is used to establish a session between sender and receiver with n=23 and g=5. The sender's secret key is 6 and the receiver's ... the receiver and sender? Please explain with solution P.S: Answer is given as 2
User Avatar
1.5k
views
1 answers
2 votes
closure properties of cfl
cfl are closed undera) min b)max c)half d)alt e)none of thesecfl are not closed under initl/acycleset diffeence
User Avatar
534
views
0 answers
0 votes
multi dimensional array
Let A be a two-dimensional array declared as follows: A: array[1..23][1..19] of integer; Assuming that each integer takes one memory location, the array is stored ... the location. Find out the address of the address of the element A[i][j].
User Avatar
215
views
0 answers
0 votes
Eigen vector
User Avatar
765
views
2 answers
0 votes
Self Doubt in checking whether a language is regular or not
Is there any way to check whether a language is regular or not without using Pumping lemma?
User Avatar
1.7k
views
1 answers
0 votes
Toc book
A good book of TOC for GATE ??
User Avatar
240
views
0 answers
0 votes
Eigen vector
Is it true that if we have 3 distinct eigen vectors x,y and z than x,y and z would respectively be orthogonal to each other .Please elaborate
User Avatar
378
views
1 answers
0 votes
Graph theory
In tree for every pair of vertices u!=v in G their is exactly 1 path from u to v .Please help me to prove this
User Avatar
682
views
0 answers
1 votes
C programming
Consider 2 cases:1. Call by value result2. Call by referenceint x = 10 ;main ( ){P(x); printf (x);}P ( int a){If ( a ≤ 40 ){a = a ... to actual.Any example in which these 2 will differ in output(especially in case of function calls)?
User Avatar
Page: