Recent activity by SKP / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 2016 Set 1 | Question: 18
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$

Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s?$(0+1 )^ *001...

20.8k views

commented Sep 3, 2018

4 answers

2

Kenneth Rosen Edition 7 Exercise 6.1 Question 22 (Page No. 396)
How many positive integers less than $1000$ are divisible by $7?$ are divisible by $7$ but not by $11?$ are divisible by both $7$ and $11?$ are divisible by either $7$ or $11?$ are divisible by exactly one of $7$ and $11?$ are divisible by neither $7$ nor $11? $ have distinct digits? have distinct digits and are even?

How many positive integers less than $1000$are divisible by $7?$are divisible by $7$ but not by $11?$ are divisible by both $7$ and $11?$ are divisible by either $7$ or $...

6.3k views

answered Sep 7, 2017

1 answer

3

Test by Bikram | Programming | Test 2 | Question: 26
What is the output of the below mentioned code snippet? #include <stdio.h> int main() { int i=10; static int x=i; if(x==i) printf("Equal"); else if(x>i) printf("Greater"); else printf("Lesser"); return 0; } Equal Greater Lesser Compilation Error

What is the output of the below mentioned code snippet?#include <stdio.h int main() { int i=10; static int x=i; if(x==i) printf("Equal"); else if(x>i) printf("Greater"); ...

769 views

commented Jul 31, 2017

2 answers

4

Test by Bikram | Programming | Test 2 | Question: 16
What will be the output of this program ? #define square(x) x*x main() { int z; z = 25/square(5); printf("%d",z); }

What will be the output of this program ?#define square(x) x*x main() { int z; z = 25/square(5); printf("%d",z); }

379 views

commented Jul 31, 2017

2 answers

5

Test by Bikram | Programming | Test 2 | Question: 12
What is the output of the following program? #include <stdio.h> void f(char**); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void f(char **p) { char *t; t = (p += sizeof(int))[-1]; printf("%s\n", t); } ab cd ef gh

What is the output of the following program?#include <stdio.h void f(char ); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void...

734 views

commented Jul 31, 2017

1 answer

6

Test by Bikram | Data Structures | Test 2 | Question: 27
Which one of the following is the tightest upper bound that represents the time complexity of inserting an element into a binary search tree of n nodes? O(1) O(n log n) O(n) O(log n)

Which one of the following is the tightest upper bound that represents the time complexity of inserting an element into a binary search tree of n nodes?O(1)O(n log n)O(n)...

739 views

commented Jul 22, 2017

1 answer

7

Test by Bikram | Data Structures | Test 2 | Question: 23
A function f is defined on stack of integer satisfies the following properties . f(empty) = 0 and f( PUSH(S,i) ) = max (f(S),0) + i for all stacks S and integer i. If a stack S contains the integers 2, -3, 2, -1, 2 in order from bottom to top , Then what is f(S)? 6 4 3 2

A function f is defined on stack of integer satisfies the following properties .f(empty) = 0 and f( PUSH(S,i) ) = max (f(S),0) + i for all stacks S and integer i.If a s...

694 views

answered Jul 20, 2017

2 answers

8

GATE Overflow | Data Structures | Test 1 | Question: 17
In a class examination marks was out of 100 and there were only 1 or 2 mark questions with total 70 questions and pass mark being 36. In order to find the most repeating total mark among passed students, the appropriate data ... An array of 100 numbers An array of 70 numbers An array of 65 numbers A dynamically allocated array of 100 numbers

In a class examination marks was out of 100 and there were only 1 or 2 mark questions with total 70 questions and pass mark being 36. In order to find the most repeating ...

536 views

commented Jul 18, 2017

4 answers

9

GATE IT 2007 | Question: 3, UGCNET-June2012-III: 34
Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u$ has weight 53 and the shortest path from $s$ to $v$ has weight 65. Which one of the ... $(u,v) \leq 12$ Weight $(u,v) = 12$ Weight $(u,v) \geq 12$ Weight $(u,v) > 12$

Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u...

11.5k views

commented Jun 23, 2017

1 answer

10

Write through vs Write back cache
Consider the following statements S1 : The number of lines contained in a set associative cache can be calculated from the number of bits in the memory address, the number of bits assigned to the tag, the number of bits assigned to the word id ( ... traffic compared to Write back Which of the following statements is/are true? S1 S2 Both S1 and S2 None of the above

Consider the following statementsS1 : The number of lines contained in a set associative cache can be calculated from the number of bits in the memory address, the number...

2.0k views

answered Jan 17, 2017

12 answers

11

GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.

Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Simi...

35.0k views

commented Jan 13, 2017

0 answers

12

Iso-morphic || Non-Isomorphic Graphs
The Number of Non-Isomorphic simple graphs upto 5 Nodes is _______

The Number of Non-Isomorphic simple graphs upto 5 Nodes is _______

1.3k views

commented Dec 2, 2016

4 answers

13

GATE CSE 2014 Set 2 | Question: 26
Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is $10^6$ bytes / sec. A user on host $A$ sends a file of size $10^3$ bytes to host $B$ through routers $R1$ and $R2$ in three different ways. ... . Which one of the following is CORRECT? $T1<T2<T3$ $T1>T2>T3$ $T2=T3, T3<T1$ $T1=T3, T3> T2$

Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is $10^6$ bytes / sec. A user on host $A$ sends a file of size ...

19.3k views

commented Nov 4, 2016

6 answers

14

GATE2014 AE: GA-7
Anuj, Bhola, Chandan, Dilip, Eswar and Faisal live on different floors in a six-storeyed building (the ground floor is numbered $1$, the floor above it $2$, and so on) Anuj lives on an even-numbered floor, Bhola does not live on an odd numbered floor. Chandan does not live on ...

Anuj, Bhola, Chandan, Dilip, Eswar and Faisal live on different floors in a six-storeyed building (the ground floor is numbered $1$, the floor above it $2$, and so on) An...

2.5k views

answered Oct 30, 2016

3 answers

15

GATE CSE 2016 Set 1 | Question: 15
Consider the following C program. # include <stdio.h> void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a = 2016, b=0, c= 4, d = 42; mystery (&a, &b); if (a < c) mystery (&c, &a); mystery (&a, &d); printf("%d\n", a); } The output of the program is _________.

Consider the following C program.# include <stdio.h void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a...

18.2k views

commented Sep 11, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true