Dark Mode

Recent questions without answers

0 votes

0 answers

15661

Made Easy
according to me answer is coming as:(3n^2 + n)/2 for first n times, sum of first n natural numbers will come, and after n times i will always be greater than n, so 1 will be added n times in every iteration of i. so, n^2 + n(n+1)/2 should be the answer. Please correct me if I am commiting some mistake.

Lucky sunda asked in Algorithms Dec 15, 2016

121 views

0 votes

0 answers

15662

GATE CSE 1989 | Question: 12b
Consider a database with the following three relations: CREDITS (STUDENT; COURSE) OFFERS (TEACHER; COURSE) BELONGS (TEACHER; DEPARTMENT) Given below is a code in query language QUEL. Describe in one English sentence the query posed by the given QUEL program. range of s is ... range of e2 is LIST2 range of e3 is LIST3 retrieve(E1.I) where e1.I=e2.I and where e1.I=e3.I

makhdoom ghaya asked in Databases Dec 15, 2016

by makhdoom ghaya

515 views

1 vote

0 answers

15663

MadeEasy Test Series: Computer Networks - Access Control Methods

Rajesh Raj asked in Computer Networks Dec 15, 2016

315 views

0 votes

0 answers

15664

Maths easy
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3, 4, 5, 6} and X ∩ Y = φ ________.

thor asked in Mathematical Logic Dec 15, 2016

by thor

381 views

1 vote

0 answers

15665

ACE TEST SERIES

santhoshdevulapally asked in Algorithms Dec 15, 2016

by santhoshdevulapally

303 views

0 votes

0 answers

15666

turing machines
what is the difference between a turing machine and real-world computers? do turing machines use stack ??please tell about the memory of turing machines

Akriti sood asked in Theory of Computation Dec 15, 2016

225 views

0 votes

0 answers

15667

Hradesh patel asked in Algorithms Dec 14, 2016

by Hradesh patel

190 views

0 votes

0 answers

15668

MST-2
#plz check??

Hradesh patel asked in Algorithms Dec 14, 2016

by Hradesh patel

185 views

0 votes

0 answers

15669

MST-2
#plz check??

Hradesh patel asked in Algorithms Dec 14, 2016

by Hradesh patel

393 views

0 votes

0 answers

15670

correction used in BCD code
What is the correction used in BCD addition if the sum falls in invalid zone. 3 6 10 No correction please explain this question.

Akriti sood asked in Digital Logic Dec 14, 2016

1.3k views

0 votes

0 answers

15671

full adder
Can anyone explain me this theory with an example(from the third line)...??

Anmol Verma asked in Digital Logic Dec 14, 2016

809 views

3 votes

0 answers

15672

decidability
Is equality problem for DCFL is decidable if yes then how to prove?

vaishali jhalani asked in Theory of Computation Dec 14, 2016

by vaishali jhalani

1.0k views

0 votes

0 answers

15673

Relation
Which of the following is/are true ? A. $\text{R}$ is a reflexive relation on a set $\text{A}$, then $\text{R}^{n}$ is reflexive for all $n\geq0$ B. Relation $\text{R}$ on set $A$ is reflexive if and only if inverse relation $R^{-1}$ is reflexive. C Relation $\text{R}$ on set ... $M_{S\circ R} = M_R \; \odot M_S$ where $\odot$ is boolean product.

dd asked in Set Theory & Algebra Dec 14, 2016

by dd

300 views

0 votes

0 answers

15674

Equivalence relation
True / false ? a. Partitions formed from congruence classes modulo $6$ ... $R_4$ creates refinement partitions with respect to the partitions of $R_3$.

dd asked in Set Theory & Algebra Dec 14, 2016

by dd

501 views

0 votes

0 answers

15675

stuck at 0
Given circuit needs to be tested whether it has stuck-at-0 problem or not at pointed place in the diagram. How many number of test vectors can confirm the problem exists or not? 3 9

Akriti sood asked in Digital Logic Dec 14, 2016

292 views

0 votes

0 answers

15676

Galvin
I was reading operating system book and it is given as follows: "A mutex lock has a boolean variable available whose value indicates if the lock is available or not. The definition of acquire is as follows: acquire() { while (!available) ; /* ... completed execution of acquire) and therefore P1 will not get a chance to execute and therfore deadlock. What am I missing? Please explain.

Shivam Chauhan asked in Operating System Dec 14, 2016

by Shivam Chauhan

376 views

0 votes

0 answers

15677

Gate 2006
Qus 1 Qus 2

Vasu_gate2017 asked in Linear Algebra Dec 14, 2016

by Vasu_gate2017

230 views

0 votes

0 answers

15678

Interview: Explain why FTP does not have a message format.
Interview question Why FTP does not have a message format.

sh!va asked in Computer Networks Dec 14, 2016

by sh!va

1.1k views

0 votes

0 answers

15679

ME TEst series
What does simultaneous mean here?

rahul sharma 5 asked in Algorithms Dec 13, 2016

by rahul sharma 5

298 views

0 votes

0 answers

15680

databases
The following key values are inserted into a B+ - tree in which order of the internal nodes is 4, and that of the leaf nodes is 3, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the order of leaf ... 29, 38, 45, 55, 60, 68 The maximum number of times leaf nodes would get split up as a result of these insertions is ______.

dileswar sahu asked in Databases Dec 13, 2016

by dileswar sahu

192 views

1 vote

0 answers

15681

Decidability+TM
I dont get how the first is decidable and I have no idea about other two. Detailed explanation would be helpful

Rahul Jain25 asked in Theory of Computation Dec 13, 2016

by Rahul Jain25

231 views

0 votes

0 answers

15682

Question regarding complexity classes
Hello My doubt is regarding the complexity classes. They have been excluded from algorithm syllabus. Also i did not find any mention of it in automata theory. Can you tell me how much to study from this topic?.. I saw theoretical mcq questions in various test series. Please guide me on what to study in this topic.

Tridhara Chakrabarti asked in Others Dec 13, 2016

by Tridhara Chakrabarti

275 views

0 votes

0 answers

15683

Ace test series
A DRAM chip is designed with capacity of 512MBytes with row size of 32 bits each, one refresh operation takes one nanosecond time.Total refresh time to refresh the DRAM chip once is _______________ milliseconds. My answer is 134.22 milliseconds while the answer given is 128 milliseconds.

sourojit asked in CO and Architecture Dec 13, 2016

266 views

0 votes

0 answers

15684

DBMS question
Consider the relation having tuples 200, 300 and 100 respectively. The number of tuples in relation are ______. My approach=min(100,200,300)=100

Paras Nath asked in Databases Dec 13, 2016

289 views

1 vote

0 answers

15685

Aptitude
The monthly rainfall chart based on 50 years of rainfall in Agra is shown in the following figure. Which of the following are true? (k percentile is the value such that k percent of the data fall below that value) (i) On average, it rains more in July than in December (ii) Every year, the amount of ... mm of rainfall (A) (i) and (ii) (B) (i) and (iii) (C) (ii) and (iii) (D) (iii) and (iv)

srestha asked in Quantitative Aptitude Dec 13, 2016

251 views

0 votes

0 answers

15686

Akanksha Kesarwani asked in Databases Dec 13, 2016

by Akanksha Kesarwani

135 views

0 votes

0 answers

15687

#co-cache
i'm getting 37.2 =37 but given 32 ...

papesh asked in CO and Architecture Dec 13, 2016

by papesh

209 views

1 vote

0 answers

15688

Not an advantage of star topolgy

Sanjay Sharma asked in Computer Networks Dec 13, 2016

by Sanjay Sharma

168 views

0 votes

0 answers

15689

ME FLT-1 Q-10
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na? my ans.0.6 made easy ans:0.81

Nishant Arora asked in Mathematical Logic Dec 13, 2016

by Nishant Arora

386 views

0 votes

0 answers

15690

Algorithm Time complexity
Given two sorted arrays of n elements with distinct integers.How much time it will take to find middle of union if these two arrays.? Can be done in logn but how?

rahul sharma 5 asked in Algorithms Dec 13, 2016

by rahul sharma 5

518 views

Page:

« prev
1
...
518
519
520
521
522
523
524
525
526
527
528
...
591
next »

Recent questions without answers