Register
Filter

Answers by A_i_$_h

2 votes
2
Matrices - LU Decompostion
Is LU Decomposition possible for every matrix ?
Is LU Decomposition possible for every matrix ?
0 votes
3
A memory leak happens when
A memory leak happens when a) a program allocates memory in heap but forgets to deallocate it b) when an un-assigned pointer is used is freed using free function c) when realloc() is called on a pointer that is not allocated d) A program allocates memory in stack
A memory leak happens whena) a program allocates memory in heap but forgets to deallocate itb) when an un-assigned pointer is used is freed using free functionc) when rea...
1 votes
4
#testbook testseries
0 votes
5
online source
Que. The result of the UNION operation between R1 and R2 is a relation that includes a. all the tuples of R1 b. all the tuples of R2 c. all the tuples of R1 and R2 d. all the tuples of R1 and R2 which have common columns Answer given is d. Shouldn't it be c???
Que.The result of the UNION operation between R1 and R2 is a relation that includesa.all the tuples of R1b.all the tuples of R2c.all the tuples of R1 and R2d.all the tupl...
0 votes
8
deadlock
process maximum demand currently holds p1 70 45 p2 60 40 p3 60 x p4 40 y if a system has total of 150 units of resource then identify which of the following values of X and Y the above system will be in sage state? A x=40,Y=20 B X=30 ,Y =20 C X=50 Y=10 D X=20 Y=30
processmaximum demandcurrently holdsp17045p26040p360xp440yif a system has total of 150 units of resource then identify which of the following values of X and Y the above ...
0 votes
11
C programming
#include<stdio.h> int main() { int a=10,b=20,c=30; c==a==b; Printf("%d%d%d",a,b,c); return0;}
#include<stdio.h>int main(){ int a=10,b=20,c=30;c==a==b;Printf("%d%d%d",a,b,c);return0;}
1 votes
12
what is meant by disk block address
what is meant by disk block address ??
what is meant by disk block address ??
0 votes
13
Mathematical Logic question
Which among them are valid? How to approach such questions ?
Which among them are valid?How to approach such questions ?
0 votes
14
Bucket sort
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets? 2. Bucket sort is always NOT inplace.Is this correct?
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets?2. Bucket sort is always NOT inplace.Is this correct...
0 votes
15
permutation and combination
How many sets of three integers between 1 and 20 are possible if no two consecutive integers are to be in a set?
How many sets of three integers between 1 and 20 are possible if no two consecutiveintegers are to be in a set?
5 votes
16
#TOC Identify Class of Language
$L = \{w \mid w ∈ {a,b}, n_a(w) \geq n_b(w)+1\}$ $L = \{a^ib^j \mid i ≠ 2j+1\}$ $L = \{a^mb^n \mid m=2n+1\}$ NOTE: 1 - DCFL, 2 - DCFL, 3 -DCFL, but need a proper reason!
$L = \{w \mid w ∈ {a,b}, n_a(w) \geq n_b(w)+1\}$$L = \{a^ib^j \mid i ≠ 2j+1\}$$L = \{a^mb^n \mid m=2n+1\}$NOTE: 1 - DCFL, 2 - DCFL, 3 -DCFL, but need a proper reason!...
3 votes
19
Bit rate vs Baud rate
Pick the correct statement A. Bit rate can never be less than Baud rate B. Baud rate can never be less than Bit rate C. Bit rate and Baud rate are always samr. D. None of the above
Pick the correct statement A. Bit rate can never be less than Baud rateB. Baud rate can never be less than Bit rateC. Bit rate and Baud rate are always samr.D. None of th...
0 votes
20
doubt
what should be the minimum number of comparisons required to find the minimum and maximum of 100 numbers ?
what should be the minimum number of comparisons required to find the minimum and maximum of 100 numbers ?
1 votes
22
parsing
S---->AaAb /BbBa A---->epsilon B------->epsilon check whether grammar is LL(1),LR(0) OR SLR(1)
S >AaAb /BbBaA >epsilonB ->epsiloncheck whether grammar is LL(1),LR(0) OR SLR(1)
0 votes
24
parsing
S---->AaAb /BbBa A---->epsilon B------->epsilon check whether grammar is LL(1),LR(0) OR SLR(1)
S >AaAb /BbBaA >epsilonB ->epsiloncheck whether grammar is LL(1),LR(0) OR SLR(1)
3 votes
26
UGC NET CSE | December 2009 | Part 2 | Question: 36
In the process management Round-robin method is essentially the pre-emptive version of _________ (A) FILO (B) FIFO (C) SSF (D) Longest time first
In the process management Round-robin method is essentially the pre-emptive version of _________(A) FILO(B) FIFO(C) SSF(D) Longest time first
0 votes
30
Page Table is divided into 8K pages and each page contain 2k entries.
Page Table is divided into 8K pages and each page contain 2k entries. Page table entry size is 4 bytes and page size is 1 K words Q find out a)Logical address b)no of pages in LAS c)1st level page table size d)2nd level page table size
Page Table is divided into 8K pages and each page contain 2k entries. Page table entry size is 4 bytes and page size is 1 K wordsQ find outa)Logical addressb)no of pages ...
Page: