Dark Mode

Answers by rajoramanoj

5 votes

1

TIFR CSE 2017 | Part B | Question: 1
A vertex colouring with three colours of a graph $G=(V, E)$ is a mapping $c: V \rightarrow \{R, G, B\}$ so that adjacent vertices receive distinct colours. Consider the following undirected graph. How many vertex colouring with three colours does this graph have? $3^9$ $6^3$ $3 \times 2^8$ $27$ $24$

answered in Graph Theory Dec 23, 2017

3.1k views

0 votes

2

breadth first search
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is

answered in Programming Oct 19, 2017

1.9k views

3 votes

3

Merge sort
True or False Merge sort on Linked list takes O(nlogn)

answered in DS Oct 10, 2017

1.2k views

2 votes

4

compiler-design -tokens

answered in Compiler Design Oct 7, 2017

751 views

0 votes

5

SIMPLIFICATION OF CFG

answered in Theory of Computation Oct 6, 2017

7.6k views

0 votes

6

disk scheduling
In disk scheduling if header movement direction is not given then which way to move? Please provide any link or source in support of your answer. Thanks

answered in Operating System Oct 3, 2017

1.9k views

1 vote

7

data structure
what is the average number of probes in linear probing if load factor is 0.1

answered in DS Oct 3, 2017

146 views

1 vote

8

Ace Test Series: Databases - Database Normalization

answered in Databases Oct 2, 2017

751 views

0 votes

9

Bit Stuffing
Answer is 4 or 6 ?

answered in Computer Networks Oct 1, 2017

750 views

1 vote

10

Exam queries
Can I crack gate if I start my preparation from today(01/10/17)? If yes then for how much time I should study in a day? I want to score around 60. On which subject I should focus mostly? I know I don't have time to read books so any reference to material will be appreciated.

answered in GATE Oct 1, 2017

311 views

0 votes

11

CFL Language
For A, B ⊆ Σ*, define A/B = {x ∈ Σ* | ∃y ∈ B, xy ∈ A} If L is a CFL and R is regular, then L/R is (A) Regular (B) CFL but not regular (C) Recursive but not CFL (D) None of the above

answered in Theory of Computation Oct 1, 2017

269 views

1 vote

12

Pumping Lemma
Could we say that Pumping lemma is generally used to prove whether given grammar is not regular.

answered in Theory of Computation Sep 30, 2017

1.1k views

1 vote

13

location-of-element-using-row-major-order
https://gateoverflow.in/32836/location-of-element-using-row-major-order A[5.....15,-8.....8] is A[11][17] and we are supposed to find A[8][5] - Row Major Order Base Address:800, each element occupies 4 memory cells, then ... mine and i know by application for formula, we can arrive at the answer, but i need to understand what im doing wrong here Thanks

answered in DS Sep 28, 2017

999 views

0 votes

14

CN ARQ Protocol
True / False? Selective repeat ARQ requires more number of bits in sequence number as compared to Go Back n ARQ.

answered in Computer Networks Sep 27, 2017

1.3k views

0 votes

15

MadeEasy Subject Test: Theory of Computation - Finite Automata
What is the answer for following question.

answered in Theory of Computation Sep 23, 2017

814 views

0 votes

16

Identify the language
L1 = {anbmcnd2n n $\geq$ 0, m $>$ 0} L2 = {anb2ncm | 0 $\leq$ n $\leq$ m} L1 is given as a CFL and L2 a CSL Explain how.

answered in Theory of Computation Sep 22, 2017

163 views

0 votes

17

self doubt
Is decomposition to BCNF ALWAYS POSSIBLE ?? can we decompose a relation to BCNF ALWAYS OR ARE THERE RELATIONS WHICH CANNOT BE DECOMPOSED TO BCNF ?

answered in Databases Sep 8, 2017

111 views

0 votes

18

Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ? It is true or false Please ans explain in detail.

answered in Compiler Design Sep 6, 2017

426 views

2 votes

19

How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip

answered in CO and Architecture Sep 6, 2017

4.0k views

0 votes

20

Self_doubt
How computation actually occurs in these type of questions? For ex: If I declare a=10,b=20 and pass them f(a-b,a*2,b-a); Where f has signature like f(int *p,int *q,int *r).How actually things works out if i manipulate are there any temprary variables involved?

answered in Programming Sep 5, 2017

131 views

8 votes

21

Register spilling
Please someone explain me what is Register Spilling by giving example

answered in CO and Architecture Sep 5, 2017

3.3k views

0 votes

22

No of Super key possible
$R=(A,B,C,D)$ Candidate key $(AB,DB)$ How many super key possible?

answered in Databases Sep 5, 2017

464 views

1 vote

23

No. of super key
$R=(A,B,C,D,F,H)$ Candidate key$=(AEH, BEH, DEH)$ How many super key possible?

answered in Databases Sep 5, 2017

361 views

4 votes

24

please solve this Q
Q. Which of the following parameter is not included in the activation record of recursive function call? 1.Local variables of function 2.Return value of function 3. Global variables of program 4.Access link

answered in Compiler Design Sep 5, 2017

3.9k views

0 votes

25

Number of Memory Access in Fetch and Execute State in Instruction Cycles
Consider a 32 bit hypothetical processor used to execute the following programme segement INST // MEANING // SIZE(IN WORDS) MOV R0, @3000 // R0 <- M[[3000]] // 2 MOV R1, [2000] // R1 ... executinion time of the program? Determine the number of memory referneces required in Instruction Fetch Phase and Execution Phase state.

answered in CO and Architecture Sep 5, 2017

1.8k views

0 votes

26

gate level minimization
prove that x'y+xy'+xy=x+y

answered in Digital Logic Sep 5, 2017

352 views

0 votes

27

NPTEL
Which of the following is not a cause of transaction failure? 1. System Crash 2. Deadlock 3. Exception 4. All of the above are causes of transaction failures

answered in Databases Sep 4, 2017

849 views

0 votes

28

Self Doubt
Primary key is subset or proper subset of superkey ?

answered in Databases Sep 4, 2017

327 views

0 votes

29

functional dependency
Let the relation R(X, Y, Z, A, B) with given functional dependencies X -> YZ Z -> A A -> B AZ -> X The number of super keys possible__________ ? Please answer with an explanation.

answered in Databases Sep 4, 2017

763 views

Page:

1
2
3
next »