search
Log In

Recent questions tagged bad-question

3 votes
2 answers
1
Which of the following is not a monotonically increasing grammar? (A) Context-sensitive grammar (B) Unrestricted grammar (C) Regular grammar (D) Context-free grammar
asked Jul 20 in Theory of Computation Sanjay Sharma 370 views
0 votes
0 answers
2
–2 votes
0 answers
3
plzzz explain how this code is executed
asked Apr 8, 2019 in Programming saket nandan 108 views
0 votes
0 answers
4
Is 10% general reservation criteria will be available during admission in iits??
asked Mar 14, 2019 in Written Exam mradul 223 views
–1 vote
0 answers
5
If a processor has 64 address lines and 8 data lines. Then find maximum number of opcodes generated by processor. a)6 b)9 c)3 d)8
asked Feb 24, 2019 in CO and Architecture Abhisek Tiwari 4 249 views
2 votes
1 answer
7
If Irreflexive relation are represented as directed graphs, then the partitions of an equivalence relation manifest in the form of ______ A) Strongly connected component B) Unilaterally connected component C) Clique D) None of these
asked Oct 6, 2018 in Set Theory & Algebra Lakshman Patel RJIT 323 views
0 votes
1 answer
8
The largest value that can be represented by IEEE 754 double precision floating point format (for implicit number) is (approximately)___ A)2^1022 B)2^1023 C)2^1024 D)2^1021
asked Aug 29, 2018 in CO and Architecture talha hashim 106 views
–1 vote
0 answers
9
asked May 15, 2018 in Programming saumya mishra 60 views
0 votes
2 answers
10
0 votes
1 answer
11
2 votes
0 answers
12
I am not able to solve this question. Please provide solution. Or is this question incorrect? Answer was given as (C)
asked Jan 25, 2018 in CO and Architecture Asim Abbas 190 views
1 vote
1 answer
13
Consider the following C program: The output of the program if dynamic programming is used ____
asked Jan 21, 2018 in Programming mohitbawankar 431 views
0 votes
1 answer
14
asked Dec 14, 2017 in Programming VS 215 views
0 votes
1 answer
17
n=3 a[++n]=n++ Output : a[4]=4. How? Please explain it
asked Dec 4, 2017 in Programming Harikesh Kumar 137 views
0 votes
0 answers
18
–1 vote
1 answer
19
Which of the following is valid first order formula?
asked Nov 21, 2017 in Mathematical Logic Saikat Dutta 114 views
1 vote
0 answers
20
Consider following reference string 7,0,1,2,0,3,0,4,2,3,0,3,2 Consider FIFO page replacement policy is used with 3 Page Frames. If memory access time is 50ns, then what is EAT?
asked Nov 21, 2017 in Operating System Vasu_gate2017 148 views
1 vote
0 answers
21
#include <stdio.h> main() { int a,b,c; int count = 1; for (b=c=10;a="- FIGURE?, UMKC,XYZHello Folks,\ TFy!QJu ROo TNn(ROo)SLq SLq ULo+\ UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^\ NBELPeHBFHT}TnALVlBLOFAkHFOuFETp\ HCStHAUFAgcEAelclcn^r^r\\tZvYxXy\ T|S~Pn SPm SOn TNn ULo0ULo#ULo-W\ Hq!WFs XDt!" [b+++21]; ) for(; a-- > 64 ; ) putchar ( ++c=='Z' ? c = c/ 9:33^b&1); return 0; } can any one explain this code
asked Nov 21, 2017 in Programming saipriyab 90 views
–1 vote
1 answer
22
TLB lookup time ($t_h$) = 20 ns TLB hit ratio ($h_t$) = 99% Memory access time ($t_s$) = 100ns Page fault rate ($h_p$) = 0.05% Swap page time (in or out) ($t_p$) = 5000,000 ns What is the effective access time (EAT) if we assume that all pages currently in main memory are dirty? 1. 5118.91 ns 2. 51.21 ns 3. 5120.9 ns 4. None of the above.
asked Nov 16, 2017 in Operating System Hemant Parihar 547 views
0 votes
0 answers
23
6 votes
3 answers
24
Which of the following statements is/are TRUE? I. The time complexity of recurrence relation A(n) = 3A(n/2)+ n2 is asymptotically faster than T(n) = 4T(n/2)+ n2. II. The time complexity of recurrence relation A(n) = 512 A(n/2) + O(n50) is asymptotically faster than T(n) = 7T(n-53) + O(1), T(0) = 1. Please explain what is mean by asymptotically faster?
asked Nov 12, 2017 in Algorithms garg div 324 views
1 vote
1 answer
25
asked Nov 10, 2017 in Programming shefali1 94 views
0 votes
1 answer
26
Explain the behaviour of following code: int main() { int *j=0; { int i=10; j=&i; } printf("%d",*j); } a. output is 10. j pointed to address of i, so it was not freed. b. output may be 10 or garbage in given execution c. output is 10. i becomes invisible outside of its block scope, but lives as long as function scope d. output is 0.
asked Nov 9, 2017 in Algorithms targate2018 68 views
0 votes
0 answers
27
0 votes
0 answers
28
Consider a system with two level paging applicable .The page table is divided into 8k pages each of size 16 KB. The Memory is byte addressable . if physical address is 128 MB which is divided into 4 KB frames. The page table entry size of outer page table is 32 bits ... in innerpage table is 64 bits. what will be the size of inner and Outer page table... 32kb,128kb 32kb,32kb 128kb,128kb 128kb,32kb
asked Nov 5, 2017 in Operating System Surya Dhanraj 249 views
0 votes
1 answer
30
Consider the following program segment int main() { char *str = "GATECS"; printf("%d", madeeasy(str)); return 0; } int madeeasy(int *p1) { int *p2 = p1; while(*++p1); return p1-p2; } The out of above program will be ________. Assume that the object of data type int occupies 2 bytes.
asked Oct 30, 2017 in Programming Aibi 199 views
...