Dark Mode

Recent questions without answers

0 votes

0 answers

15841

page faults
By incresing the page size..page fault inscreases as the number of frames decreases and also page fault may decreases due to spatial locality.. Then How to decide about page faults...

vaishali jhalani asked in Operating System Nov 28, 2016

by vaishali jhalani

796 views

0 votes

0 answers

15842

page size
For disks..it is much faster to transfer one large page of data than two or more smaller pages containing the same amount of data. But transfer time should be proportional to page size.. Please explain!!

vaishali jhalani asked in Operating System Nov 28, 2016

by vaishali jhalani

282 views

0 votes

0 answers

15843

databases
what is exact answer?200 or 202 bez above condition satisfy 0 to 100 two times means 202. or no record selected when 0<=0. plz clear me..

dileswar sahu asked in Databases Nov 27, 2016

by dileswar sahu

227 views

0 votes

0 answers

15844

database
The union join is equivalent to a full outer join on the false condition-that is,where the inner join is empty. How this statement is TRUE?plz someone explain with example.... I have doubt that, compatible of union join is no. of column should be same & their domain ... in full outer join whith false statement=R FULL OUTER JOIN S=6 attributes A,B,C,D,E,F then how both are same?????

dileswar sahu asked in Databases Nov 27, 2016

by dileswar sahu

219 views

1 vote

0 answers

15845

MadeEasy Test Series: CO & Architecture - Cache Memory

Hradesh patel asked in CO and Architecture Nov 27, 2016

by Hradesh patel

274 views

0 votes

0 answers

15846

Self Made
Are questions regarding number of RAM chips, ROM chips there in syllabus, or have they been removed from the new syllabus??

Samujjal Das asked in CO and Architecture Nov 27, 2016

by Samujjal Das

202 views

0 votes

0 answers

15847

RAJESHWAR YADAV asked in Theory of Computation Nov 27, 2016

by RAJESHWAR YADAV

200 views

0 votes

0 answers

15848

Doubt
Code for Producer: while (true) { /* produce an item in nextProduced */ while (counter == BUFFER.SIZE) ; /* do nothing */ wait(mutex); buffer[in] = nextProduced; in = (in + 1) % BUFFER-SIZE; counter++; signal(mutex); } Code for consumer ... BUFFER_SIZE; counter--; signal(mutex); } Can this be an alternative solution for bound buffer problem(where only one semaphore is used instead of three)?

Shreya Roy asked in Operating System Nov 27, 2016

698 views

0 votes

0 answers

15849

group thery
consider a set of all (M*N) matrices with their elements as real number(rationla or real or complex number) is: a. infinite abelian group b. semigroup but not monoid c.group but not monoid d.none

Hira Thakur asked in Set Theory & Algebra Nov 27, 2016

365 views

0 votes

0 answers

15850

doubt
can derived attribute be derived from more than one entitiy or from different entity????

shefaligups11 Gups asked in Databases Nov 27, 2016

by shefaligups11 Gups

307 views

0 votes

0 answers

15851

self doubt
I have confusion between the various terms used for the efficiency and throughput for in GBN, SR and SnW protocol. Sometimes line utilization is considered as efficiency and sometimes throughput..What are all the synonyms for both efficiency and throughput..??

iita asked in Computer Networks Nov 27, 2016

by iita

228 views

0 votes

0 answers

15852

ace test OS
In a 32-bit address system , two level paging system contains page entries of size 4KB each. If page table is split into small tables containing 4096 page entries. The number of bits required ti index the outer page table is_______

iita asked in Operating System Nov 27, 2016

by iita

358 views

0 votes

0 answers

15853

conceptual doubt
In B+ trees, are cousins alo treated as siblings?? I mean the adjacent nodes are considered siblings even if they dont have same parents?? While reading deletion algorithm in B+ tree i got confused and in one video it was taught that adjacent ones are siblings in B+ trees so that we can always merge and dstribute from them Can anyone clear it??

sushmita asked in Databases Nov 27, 2016

355 views

3 votes

0 answers

15854

GATE CSE 1990 | Question: 15b
Complete the following production rules which generate the language:$L= \left\{a^{n} b^{n} c^{n}\mid a, b, c \in \Sigma \right\}$ where variables $R$ and $Q$ ... $Q \rightarrow R'c$ $cR' \rightarrow ...$ $bR' \rightarrow ...$ $aR' \rightarrow a...$

makhdoom ghaya asked in Theory of Computation Nov 26, 2016

by makhdoom ghaya

699 views

0 votes

0 answers

15855

Set theory
consider A={1,2,3,...........n} how many number of multisets are possible for A: 1:n^2 2:2^n 3:n^n 4;none

Hira Thakur asked in Set Theory & Algebra Nov 26, 2016

205 views

1 vote

0 answers

15856

Test by Bikram | Data Structures | Test 2 | Question: 24
The following sequence of operation is performed on stack : push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop. The sequence of popped out values are? 2,1,2,2,1 2,1,2,2,2 2,2,1,1,2 2,2,1,2,2

Bikram asked in Programming in C Nov 26, 2016

by Bikram

452 views

0 votes

0 answers

15857

Test by Bikram | Data Structures | Test 2 | Question: 26
Suppose letters a,b,c,d,e,f have probabilities ½, ¼, 1/8, 1/16, 1/32, 1/32. Which of the following is the Huffman code for the letters a,b,c,d,e,f. 0, 10, 110, 1110, 11110, 11111 11, 10, 01, 001, 0001, 0000 11, 10, 011, 010, 001, 000 110, 100, 010, 000, 001, 111

Bikram asked in Programming in C Nov 26, 2016

by Bikram

387 views

1 vote

0 answers

15858

Test by Bikram | Data Structures | Test 2 | Question: 8
Consider following Scenario - The five items : P,Q,R,S and T are inserted into stack A one after other starting from T in reverse order The stack is popped three times and each element is inserted into another stack B. Then two ... pushed back onto the stack A. What are the topmost elements of stack A and Stack B respectively? RP QR QP RQ

Bikram asked in Programming in C Nov 26, 2016

by Bikram

401 views

1 vote

0 answers

15859

Find output
void foo(int x) { if(x > 0) { foo(--x); printf("%d",x++); foo(--x); } } What will the output when the above function is called as foo(3) ? Please provide recursion tree or stack diagram whichever you use to answer. Edit :: How would the answer change if it was void foo(int x) { if(x > 0) { foo(--x); printf("%d",x); foo(--x); } }

thor asked in Programming in C Nov 26, 2016

by thor

647 views

4 votes

0 answers

15860

computer organization Morris Mano NUmerical 3 address,2 address ,1 address , zero address instruction

LavTheRawkstar asked in CO and Architecture Nov 26, 2016

by LavTheRawkstar

5.1k views

0 votes

0 answers

15861

Arnabi asked in Operating System Nov 26, 2016

by Arnabi

195 views

3 votes

0 answers

15862

Test by Bikram | Computer Networks | Test 1 | Question: 9
Internet address always have at least: A country name or organization type Internet service provider's name Name of organization Name of individual Type of organization ii, iii,iv i, iii i,ii,iii ii,iii,iv,v

Bikram asked in Computer Networks Nov 26, 2016

by Bikram

591 views

0 votes

0 answers

15863

Test by Bikram | Theory of Computation | Test 1 | Question: 24
By reading any string, which of the following is possible for a Turing Machine? TM halts in Final State TM halts in Non Final State TM enters into Infinite Loop All of these

Bikram asked in Theory of Computation Nov 26, 2016

by Bikram

174 views

3 votes

0 answers

15864

Test by Bikram | Theory of Computation | Test 1 | Question: 5
If a language L1 is polynomially reduced to the language L2 and L2 is polynomially reduced to the language L1, then which of the following cannot be TRUE? L1 is decidable and L2 is undecidable. L1 is regular and L2 is CFL. L1 is recursive and L2 is recursively enumerable. L1 is decidable and L2 is decidable.

Bikram asked in Theory of Computation Nov 26, 2016

by Bikram

802 views

1 vote

0 answers

15865

GATE CSE 1990 | Question: 14
The following algorithm (written in pseudo-pascal) work on an undirected graph $G$ program Explore (G) procedure Visit (u) begin if Adj (u) is not empty {comment:Adj (u) is the list of edges incident to u} then begin Select an edge from ... that each vertex can be accessed and removed from LIST in constant time. Also, show that all edges of the graph are traversed.

makhdoom ghaya asked in Algorithms Nov 25, 2016

by makhdoom ghaya

638 views

1 vote

0 answers

15866

MadeEasy Test Series: Operating System - Process Schedule

Arnabi asked in Operating System Nov 25, 2016

by Arnabi

356 views

3 votes

0 answers

15867

ISRO-2013-52 - Need clarfication
Suppose we have variable logical records of lengths of 55 bytes, 1010 bytes and 2525 bytes while the physical block size in disk is 1515 bytes. What is the maximum and minimum fragmentation seen in bytes? 2525 and 55 1515 and 55 1515 and ... mentioned that we have 2 blocks. All those who is supporting answer D uses 2 blocks. Some please give the concrete solution.

cse7 asked in Operating System Nov 25, 2016

by cse7

1.1k views

2 votes

0 answers

15868

Test by Bikram | Compiler Design | Test 1 | Question: 27
$\textbf{goto}$ function of LR class of grammar is represented as: Deterministic Finite Automata transitions Non-deterministic Finite Automata transitions PDA transitions Parsing table

Bikram asked in Compiler Design Nov 25, 2016

by Bikram

480 views

1 vote

0 answers

15869

GATE CSE 1990 | Question: 12a
Consider the following instance of the $0 -1$ Knapsack problem: $\max\; 6X_{1} + 11X_{2} + 16X_{3} + 21X_{4} + 26X_{5}$ Subject to $4X_{1} + 8X_{2} + 12X_{3} + 16X_{4} + 20 X_{5} < 32$ and $X_{i}=0$ ... nodes in the tree in the order in which they are expanded and for each node show the bound on the partial solutions and the decision which leads to that node.

makhdoom ghaya asked in Algorithms Nov 25, 2016

by makhdoom ghaya

1.0k views

0 votes

0 answers

15870

operating sys
A process P has three sections namely text, heap and stack and if the size of the page table is 2 MB then on an average, amount of unused page space per process is: (in MB)

focus _GATE asked in Unknown Category Nov 25, 2016

193 views

Page:

« prev
1
...
524
525
526
527
528
529
530
531
532
533
534
...
591
next »

Recent questions without answers