Register
Filter

Questions by manisha11

0 votes
1 answer
31
Self Doubt
If the jobs are non-premptive, then the avg waiting and avg response time will be the same? w.r.t any scheduling algo?
If the jobs are non-premptive, then the avg waiting and avg response time will be the same? w.r.t any scheduling algo?
0 votes
0 answers
32
Self doubt
Consider the processes P1, P2, P3 arrived in the sequence P2, P3, P1 and the burst time of the processes are 3, 3, 24 respectively. What is the average TAT? (a) 30 (b) 20 (c) 40 (d) 35
Consider the processes P1, P2, P3 arrived in the sequence P2, P3, P1 and the burst time of theprocesses are 3, 3, 24 respectively. What is the average TAT?(a) 30 (b) 20(c...
0 votes
3 answers
33
Self Doubt
Degree of multiprogramming is controlled by Long-term scheduler? Why? It just moves jobs from Secondary Memory to MM?
Degree of multiprogramming is controlled by Long-term scheduler?Why?It just moves jobs from Secondary Memory to MM?
2 votes
1 answer
34
Programming
Declare an array of N pointers to functions returning pointers to functions returning pointers to characters? A) (char*) (*ptr[N])( ) (B) (char*(*)) (*ptr[N])( ) (C) (char*(*)( )) (*ptr[N])( ) (D) (char*(*)( )) (*ptr[N])
Declare an array of N pointers to functions returning pointers to functions returning pointers to characters?A) (char*) (*ptr[N])( )(B) (char*(*)) (*ptr[N])( )(C) (char*(...
1 votes
0 answers
36
Programming C
#include <stdio.h> char *someFun1() { char temp[] = "string"; return temp; } char *someFun2() { char temp[] = {'s','t','r','i','g'}; return temp; } int main() { puts(someFun1()); puts(someFun2()); } Please explain the output?
#include <stdio.h>char *someFun1() { char temp[] = "string"; return temp; }char *someFun2() { char temp[] = {'s','t','r','i','g'};return temp;} int main() { p...
2 votes
2 answers
37
Computer programming
#include <stdio.h> struct p { unsigned int x : 1; unsigned int y : 1; }; int main() { struct p p; p.x = 1; p.y = 2; printf("%d\n", p.y); } Why output is 0?
#include <stdio.h struct p { unsigned int x : 1; unsigned int y : 1; };int main() { struct p p; p.x = 1; p.y = 2; printf("%d\n", p.y); } Why output is 0?
0 votes
1 answer
38
c programming
struct marks{ int p:3; int c:3; int m:2; }; void main(){ struct marks s={2,-6,5}; printf("%d %d %d",s.p,s.c,s.m); } Please explain why result is 221
struct marks{int p:3; int c:3; int m:2; };void main(){struct marks s={2,-6,5};printf("%d %d %d",s.p,s.c,s.m); } Please explain why result is 221
0 votes
0 answers
40
TOC, REL
Set of all languages that are not Recursively Enumerable is uncountable. This is true. WHY?
Set of all languages that are not Recursively Enumerable is uncountable.This is true. WHY?
2 votes
1 answer
41
Sets ,DM
Let P ( S ) denotes the power set of the set S, the dual of the lattice ( P(S), ⊆ ) is a) Doesn't’t exist b) ( P(S), ⊆ ) c) ( P(S), ⊇ ) d) ( S,⊇)
Let P ( S ) denotes the power set of the set S, the dual of the lattice ( P(S), ⊆ ) is a) Doesn't’t exist b) ( P(S), ⊆ ) c) ( P(S), ⊇ ) d) ( S,⊇)
1 votes
1 answer
42
TOC, RL
Consider the following S1: Pumping lemma is used to prove, that particular language is not regular S2: For all DCFL there exist LR(k) grammar but LL(k) may not exist. Which of the above statements are true? (a) Only S1 (b) Only S2 (c) Only S1 and S2 (d) None of these
Consider the followingS1: Pumping lemma is used to prove, that particular language is not regularS2: For all DCFL there exist LR(k) grammar but LL(k) may not exist.Which ...
1 votes
2 answers
43
TOC, RL
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true? S1: Language L is regular. S2: Complement of L is CFL. S3: Complement of L is CSL. S4: Reversal of L is CFL.
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true?S1: Langua...
Page: