Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Tesla!
1
votes
41
Memory managment
Difference between static memory allocation and dynamic memory allocation.(Need concept clearing explanation)
Difference between static memory allocation and dynamic memory allocation.(Need concept clearing explanation)
541
views
answered
Mar 1, 2018
Programming in C
memory
memory-management
programming-in-c
+
–
4
votes
42
Peter Linz Edition 4 Exercise 1.2 Question 18 (Page No. 29)
Assume $\sum = \left \{ a,b \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) = n_{b}\left ( w \right ) + 1 \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) > n_{b}\left ( w \right ) \right \}$ ...
Assume $\sum = \left \{ a,b \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) = n_{b}\left ( w \right ) + 1 \right \}$$L = \left \{ w : n_{a}\left ( w \right ) n_{b}\...
1.2k
views
answered
Feb 27, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
grammar
+
–
1
votes
43
Web-Probability
A candidate is selected for interview of management trainees for $3$ companies. For the first company, there are $12$ candidates, for the second there are $15$ candidates and for the third, there are $10$ candidates. Find the probability that ... will be selected in each of the interviews, and all candidates appearing for the interview have an equal probability of getting selected.
A candidate is selected for interview of management trainees for $3$ companies.For the first company, there are $12$ candidates, for the second there are $15$ candidates ...
669
views
answered
Feb 27, 2018
Probability
probability
engineering-mathematics
+
–
1
votes
44
Rosen Ex1.1 Q No. 45
Each inhabitant of a remote village always tells the truth or always lies. A villager will only give a "Yes" or a "No" response to a question a tourist asks. Suppose you are a tourist visiting this area and come to a fork in the ... A villager is standing at the fork in the road. What one question can you ask the villager to determine which branch to take?
Each inhabitant of a remote village always tells the truth or always lies. A villager will only give a "Yes" or a "No" response to a question a tourist asks. Suppose you ...
659
views
answered
Feb 26, 2018
Mathematical Logic
discrete-mathematics
mathematical-logic
puzzle
+
–
1
votes
45
JEST Exam
Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is denying this.They decide to settle this by an actual trial; if within n coin tosses, no two ... has been demonstrated. What happens for larger values of n? Is it true that P(n) only increases with n? Justify your answer.
Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is de...
982
views
answered
Feb 17, 2018
Probability
jest
+
–
0
votes
46
how to solve
496
views
answered
Feb 15, 2018
3
votes
47
GATE CSE 2018 | Question: 47
Consider the following undirected graph $G$: Choose a value for $x$ that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $G$ for this value of $x$ is ____.
Consider the following undirected graph $G$:Choose a value for $x$ that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $...
17.7k
views
answered
Feb 14, 2018
Algorithms
gatecse-2018
algorithms
graph-algorithms
minimum-spanning-tree
numerical-answers
2-marks
+
–
4
votes
48
Complement of CFL
How to prove that $\text{"complement of L }= \{WW^R \mid W \in \{a,b\}^*\} \text{ is CFL}" $?
How to prove that $\text{"complement of L }= \{WW^R \mid W \in \{a,b\}^*\} \text{ is CFL}" $?
5.2k
views
answered
Feb 14, 2018
Theory of Computation
context-free-language
theory-of-computation
+
–
4
votes
49
time complexity
let $S$ be a String containing either $0$ or $1$ .further there are no two consecutive $0s$ in $S$. No of solution on an input size $S(N)$ is bounded by $O(n^2)$ $O(nlogn)$ $O(2^n)$ $O(n)$
let $S$ be a String containing either $0$ or $1$ .further there are no two consecutive $0s$ in $S$. No of solution on an input size $S(N)$ is bounded by$O(n^2)$$O(nlogn)$...
602
views
answered
Feb 13, 2018
Algorithms
algorithms
time-complexity
+
–
0
votes
50
operating system
Context switching time in FCFS scheduling algorithm have less than equal to Round-Robin. explain this statement
Context switching time in FCFS scheduling algorithm have less than equal to Round-Robin.explain this statement
1.1k
views
answered
Feb 7, 2018
0
votes
51
CMI2017-B-1
Let $Σ = \{a, b, c\}$. Let Leven be the set of all even length strings in $Σ^*$ $(a)$ Construct a deterministic finite state automaton for $L_{even}$. $(b$) We consider an operation $Erase_{ab}$ that takes as input a string $w \in Σ^*$ and erases all occurrences of the ... $L:$ $Erase_{ab}(L)$:= $\{ Erase_{ab}(w)\ |\ w\in L\}$ Show that $Erase_{ab}(L_{even}$) is a regular language.
Let $Σ = \{a, b, c\}$. Let Leven be the set of all even length strings in $Σ^*$$(a)$ Construct a deterministic finite state automaton for $L_{even}$.$(b$) We consider a...
486
views
answered
Feb 5, 2018
Theory of Computation
cmi2017
theory-of-computation
finite-automata
+
–
0
votes
52
CMI2017-B-4
In a party there are $2n$ participants, where $n$ is a positive integer. Some participants shake hands with other participants. It is known that there are no three participants who have shaken hands with each other. Prove that the total number of handshakes is not more than $n^2.$
In a party there are $2n$ participants, where $n$ is a positive integer. Some participants shake hands with other participants. It is known that there are no three partic...
1.0k
views
answered
Feb 5, 2018
Combinatory
cmi2017
engineering-mathematics
discrete-mathematics
combinatory
descriptive
+
–
7
votes
53
CMI2017-A-02
An FM radio channel has a repository of $10$ songs. Each day, the channel plays $3$ distinct songs that are chosen randomly from the repository. Mary decides to tune in to the radio channel on the weekend after her exams. What is the probability that no song gets repeated during ...
An FM radio channel has a repository of $10$ songs. Each day, the channel plays $3$ distinct songs that are chosen randomly from the repository.Mary decides to tune in to...
1.1k
views
answered
Feb 5, 2018
Probability
cmi2017
engineering-mathematics
probability
+
–
1
votes
54
CMI2017-A-04
City authorities are concerned about traffic accidents on major roads. They would like to have ambulances stationed at road intersections to quickly reach the scene of any accident along these roads. To minimize response time, ambulances are to be located at ... number of edges. Find a spanning tree with minimum cost. Find a minimal coloring. Find a minimum size vertex cover.
City authorities are concerned about traffic accidents on major roads. They would like to have ambulances stationed at road intersections to quickly reach the scene of an...
1.0k
views
answered
Feb 5, 2018
Graph Theory
cmi2017
graph-connectivity
easy
+
–
1
votes
55
CMI2017-A-09
Suppose we constructed the binary search tree shown below by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations or other manipulations. Which of the following assertions about the order of elements in the input sequence $cannot$ be ... came after $12$ and $29$ came before $42$. $3$ came before $14$ and $16$ came before $28$.
Suppose we constructed the binary search tree shown below by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations...
791
views
answered
Feb 5, 2018
DS
cmi2017
data-structures
binary-search-tree
+
–
3
votes
56
CMI2017-A-10
We have constructed a polynomial time reduction from problem $A$ to problem $B$. Which of the following is a valid inference? If the best algorithm for $B$ takes exponential time, then there is no polynomial time algorithm for $A$ ... don't know whether there is a polynomial time algorithm for $B$, then there cannot be a polynomial time algorithm for $A$.
We have constructed a polynomial time reduction from problem $A$ to problem $B$. Which of the following is a valid inference?If the best algorithm for $B$ takes exponenti...
2.3k
views
answered
Feb 5, 2018
Algorithms
cmi2017
algorithms
reduction
p-np-npc-nph
+
–
1
votes
57
Gate_2018_Mock
How to find eigen value in this type of matrix?
How to find eigen value in this type of matrix?
262
views
answered
Jan 30, 2018
Mathematical Logic
engineering-mathematics
+
–
0
votes
58
MadeEasy Test Series 2018: Programming & DS - Recursion
672
views
answered
Jan 28, 2018
Algorithms
programming
recursion
made-easy-test-series
+
–
1
votes
59
Co doubt
A register to register machine support two address one address and zero address instruction. Instruction register size is 24bits and register set size is 480. If there are 48 two address instruction and 2048 zero address instruction then what is the maximum possible number of one address instruction?
A register to register machine support two address one address and zero address instruction. Instruction register size is 24bits and register set size is 480.If there are...
1.7k
views
answered
Jan 23, 2018
CO and Architecture
co-and-architecture
testbook-mock-test
+
–
2
votes
60
Paging OS
Consider a byte addressable virtual memory system with 34-bit addresses where the first 23 bits are used as a page number, and the last 11 bits is the offset. Suppose the system using two-level paging, with first n bits (n>11) of the address used as an index into the first-level page ... question) Thanks in advance Options 224 / 2(34-n) 2(34-n-11) x 211 224 /2(34-n-11) 2(n-11) x 211
Consider a byte addressable virtual memory system with 34-bit addresses where the first 23 bits are used as a page number, and the last 11 bits is the offset. Suppose the...
1.0k
views
answered
Jan 23, 2018
Operating System
paging
operating-system
+
–
1
votes
61
MadeEasy Test Series 2018: Operating System - Page Replacement
Consider a computer system having 20 physical page frames numbered from 1 to 20 which are initially empty. Now, a program accesses the pages numbered 1, 2 ..........100 twice. The number of page fault generated by optimal page replacement policy is __________.
Consider a computer system having 20 physical page frames numbered from 1 to 20 which are initially empty. Now, a program accesses the pages numbered 1, 2 ..........100 t...
1.2k
views
answered
Jan 23, 2018
Operating System
operating-system
page-replacement
made-easy-test-series
+
–
0
votes
62
BFS- No of Teversals
How to solve these kind of questions?
How to solve these kind of questions?
919
views
answered
Jan 17, 2018
DS
breadth-first-search
algorithms
data-structures
graph-algorithms
+
–
0
votes
63
MadeEasy Test Series 2018: Compiler Design - Grammar
I'm getting 4, can someone verify
I'm getting 4, can someone verify
655
views
answered
Jan 10, 2018
Compiler Design
compiler-design
grammar
made-easy-test-series
madeeasy-testseries-2018
+
–
2
votes
64
MadeEasy Test Series 2018: Computer Networks - Lan Technologies
Here i'm not able to get after how much time X and Y will face first collision
Here i'm not able to get after how much time X and Y will face first collision
969
views
answered
Jan 10, 2018
Computer Networks
computer-networks
lan-technologies
made-easy-test-series
madeeasy-testseries-2018
+
–
0
votes
65
remove recursion
which one is coorect option c or d??
which one is coorect option c or d??
286
views
answered
Jan 7, 2018
0
votes
66
testbook
i dont understand the solution! can anyone elaborate?
i dont understand the solution! can anyone elaborate?
175
views
answered
Jan 7, 2018
2
votes
67
Max heap no. of interchange required
906
views
answered
Jan 7, 2018
DS
data-structures
binary-heap
+
–
2
votes
68
DMA module
A DMA module is transferring characters to memory using cycle stealing, from a device transmitting at 12800 bits per second.The processor is fetching instructions at the rate of 2MIPS. By how much % the processor be slowed down due to DMA activity?
A DMA module is transferring characters to memory using cycle stealing, from a device transmitting at 12800 bits per second.The processor is fetching instructions at the ...
1.8k
views
answered
Jan 2, 2018
3
votes
69
Cache size
If a 16 – way set associative cache is made up of 64 bit words, 16 words per line and 8192 sets, how big is the cache in mega bytes?
If a 16 – way set associative cache is made up of 64 bit words, 16 words per line and 8192 sets, how big is the cache in mega bytes?
4.4k
views
answered
Dec 31, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
1
votes
70
Determinent of matrix
800
views
answered
Dec 27, 2017
Linear Algebra
matrix
engineering-mathematics
+
–
Page:
« prev
1
2
3
4
5
6
7
...
9
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register