The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent activity by Shaik Masthan
User Shaik Masthan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Shaik Masthan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
about array size
#include <stdio.h> // Note that arr[] for fun is just a pointer even if square // brackets are used void fun(char arr[]) // SAME AS void fun(int *arr) { unsigned int n = sizeof(arr)/sizeof(arr[0]); printf("\nArray size inside fun() is ... ********** output is confusing : need explaination how is it happening Array size inside main() is 6 Array size inside fun() is 8
commented
12 hours
ago
in
Programming

9
views
0
answers
2
Allen Career Institute: Algorithm
Which of the following is /are TRUE ? S1 : $n^{a} . n^{b} = 0$((n^{a})^{b})$ for any a, b > 1 S2 : $(n^{a})^{b} = 0$((n^{a})^{b})$ for any a, b > 1 (1) Both S1 and S2 (2) S1 Only (3) S2 Only (4) Neither S1 nor S2
commented
1 day
ago
in
Algorithms

32
views
algorithms
0
answers
3
Ullman(Second Edition) Exercise 4.2.3. Question (a) (page no207)
Design grammar for the language set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1 is this correct? S>A  01S A>1AS  ε
commented
1 day
ago
in
Compiler Design

5
views
theoryofcomputation
compilerdesign
contextfreegrammars
0
answers
4
Madeeasy Test Series
Three peoples have 32,72,and 98, respectively. If they pool their money then redistribute it among themselves. What is the maximum possible value for the median amount of money?
commented
1 day
ago
in
Numerical Ability

9
views
numericalability
1
answer
5
Aptitude
Ramon wants to cut a rectangular board into identical squares pieces. If the board is 18 inches by 30 inches, what is the least number of square pieces he can cut without wasting any of the board? Ans given is 15
answered
1 day
ago
in
Numerical Ability

11
views
0
answers
6
Permutation
Find the no. of permutations of the letters of the word ‘REMAINS’ such that the vowels always occur in odd places?
commented
1 day
ago
in
Numerical Ability

7
views
0
answers
7
Doubt Related to Gate200583a
https://gateoverflow.in/1405/gate200583a In above question can some one explain how Follow of E → E+E & E→ E * E calculated I am attaching image for reference.
commented
1 day
ago
in
Compiler Design

10
views
0
answers
8
Time complexity
Is this the correct way to solve ? Q) int algorithm(int n) { int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorithm(n/2)+algorithm(n/2)*algorithm(n/2) }
commented
3 days
ago
in
Algorithms

65
views
timecomplexity
algorithms
recurrence
2
answers
9
GATE201915
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$ ? $3$ $5$ $9$ $24$
commented
3 days
ago
in
Theory of Computation

2.5k
views
gate2019
theoryofcomputation
pumpinglemma
0
answers
10
I want to buy go pdf hardcopy for gate 2020,how can i get that
commented
3 days
ago
in
Others

29
views
0
answers
11
Data Structure and Algorithm for Gate by Narasimha Karumanchi# Algorithm Introduction#
commented
5 days
ago
in
Algorithms

41
views
algorithms
complexityanalysis
1
answer
12
Kenneth Rosen Edition 7th Exercise 1.4 Question 8 (Page No. 53)
Translate these statements into English, where $R(x)$ is “$x$ is a rabbit” and $H(x)$ is “$x$ hops” and the domain consists of all animals. $\forall x (R(x) \rightarrow H(x))$ $\forall x (R(x) \wedge H(x))$ $\exists x (R(x) \rightarrow H(x))$ $\exists x (R(x) \wedge H(x))$
commented
5 days
ago
in
Mathematical Logic

23
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
1
answer
13
Self doubt
I have a confusion regarding the array implementation of binary tree ,i.e what are the index locations of the left child of a node whether it is 2i+1 or 2i and same for right child ,can anyone explain?
commented
6 days
ago
in
DS

38
views
datastructure
1
answer
14
assignment
Following C program is written to find the pairs of elements in an array whose sum is 9. The for loop will iterate over the array of size 7. The program will print the correct pairs (whose sum is 9) on iteration number a' and b'. What are the values of a' and b'? Note: for 1st iteration, i=0. For 2nd ... sum = 9; int A[7]={1,4,3,3,5,2,6}; pair(A,7,sum); } 1. 5,7 2. 2,5 3. 4,6 4. 2,3
commented
Mar 16
in
Programming

50
views
programminginc
1
answer
15
GATE201934
Consider the following sets: S1: Set of all recursively enumerable languages over the alphabet $\{0, 1\}$ S2: Set of all syntactically valid C programs S3: Set of all languages over the alphabet $\{0,1\}$ S4; Set of all nonregular languages over the alphabet $\{ 0,1 \}$ Which of the above sets are uncountable? S1 and S2 S3 and S4 S2 and S3 S1 and S4
answer edited
Mar 14
in
Theory of Computation

1.8k
views
gate2019
theoryofcomputation
countableset
0
answers
16
DBMS SUBJECT TEST
Let Depositor and Lender be relational schemas such that Depositor = {a/c number, cname , balance, branch} and Lender ={loan_number ,cname, amount , branch}. Now consider the following queries on the database : Query 1 : ( t  ∃D ∈Depositor ( t ... cname where D.cname = L.cname(Containing duplicates) PS: I'll merge this with the original question when my doubts are cleared
commented
Mar 14
in
Databases

57
views
databases
query
tuplerelationalcalculus
1
answer
17
Gateforum Test Series: Programming & DS  Programming In C
Can anyone explain how will the second parameter gets passed ?
commented
Mar 14
in
Programming

87
views
gateforumtestseries
programming
programminginc
0
answers
18
#TOC what is the minimum pumping length of this regular language?
commented
Mar 13
in
Theory of Computation

65
views
pumpinglemma
theoryofcomputation
finiteautomata
1
answer
19
UGCNETDEC2018II46
Consider the following pseudocode fragment, where $m$ is a nonnegative integer that has been initialized: $p=0$ $k=0$ while $(k<m) $p=p+2^k$ $ ... $p=2^k1$ and $0 \leq k \leq m$ $p=2^{k+1}1$ and $0 \leq k \leq m$
commented
Mar 13
in
Others

58
views
ugcnetdec2018ii
13
answers
20
GATE200715,ISRO201626
Consider the following segment of Ccode: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
commented
Mar 13
in
Algorithms

8.2k
views
gate2007
algorithms
timecomplexity
normal
isro2016
1
answer
21
NTA NET DEC 2018
commented
Mar 13
in
CO & Architecture

31
views
#computerarchitecture
0
answers
22
NTA NET DEC 2018
closed
Mar 13
in
Algorithms

31
views
#secondsmallest
#worstcase
#algorithms
2
answers
23
NTA NET DEC 2018
closed
Mar 13
in
Algorithms

32
views
#recurrencerelations
#algorithms
1
answer
24
NTA NET DEC 2018
closed
Mar 13
in
Digital Logic

33
views
#booleanalgebra
#digitallogic
0
answers
25
Type Checking( Compiler )
When exactly is type checking done during compilation phase ?? Some resources are saying there r during semantic analysis phase while other r saying there r done syntax analysis phase !! My question is if they are done in tandem with syntax analysis phase !!!
commented
Mar 13
in
Compiler Design

38
views
1
answer
26
Made Easy Workbook
Suppose that you are running Dijkstra’s algorithm on the edgeweighted diagram below, starting from vertex A. The Table gives ‘Distance’ and ‘Parent’ entry of each vertex after vertex E has been deleted from the priority queue and relaxed. Vertex Distance Parent A 0 Null B 2 A C 13 F D 23 A E 11 F F 7 B G 36 F H 19 E What could be the possible value of expression x+y?
commented
Mar 11
in
Algorithms

60
views
algorithms
graphalgorithms
dijkstrasalgorithm
1
answer
27
Banker Algo(ACE)
Banker algorithm is used by OS to avoid the deadlock. Following table shows the current allocation and maximum demand by process $P_{1}$,$P_{2}$,$P_{3}$ and $P_{4}$ for the instances $A,B,C$ Process Max Demand (A,B,C) Current Allocation(A,B,C) $P_{1}$ ... of $A,B,C$ respectively Req2: $P_{4}$ requests $1,0,1$ of $A,B,C$ respectively Which of these two requests will be granted?
commented
Mar 11
in
Operating System

93
views
operatingsystem
bankersalgorithm
1
answer
28
Ace Test Series: Operating System  Fork()
answer selected
Mar 11
in
Operating System

202
views
operatingsystem
fork
acetestseries
11
answers
29
GATE2017214
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking $printxy(1,1)$ is: $0, 0$ $0, 1$ $1, 0$ $1, 1$
comment moved
Mar 9
in
Programming

2.3k
views
gate20172
programminginc
1
answer
30
CFG Doubt
what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in w how to approach this?
commented
Mar 9
in
Theory of Computation

109
views
contextfreelanguage
theoryofcomputation
contextfreegrammars
1
answer
31
Virtual Memory
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by Instruction Set Architecture page size physical memory size number of processes in memory Why the answer for the above question is “ISA” ?? Please explain the concept behind it
answer selected
Mar 9
in
Operating System

27
views
virtualmemory
memorymanagement
1
answer
32
Selfdoubt
What is the use of reset input in the counters?
commented
Mar 8
in
Digital Logic

42
views
0
answers
33
#PSU Possibility
I got 56 marks in gate 2019. I belong to st category. Can i get any psu? My predicted gate score according to go is 665
commented
Mar 8
in
Job Queries

68
views
0
answers
34
RDMS table
How many minimum Relations required from the following ER Diagram which are satisfy 4 NF?
comment moved
Mar 7
in
Databases

26
views
erdiagram
ertorelational
0
answers
35
ACE Test Series: Programming in C
What will be output of the program? int d=0; int f(int a,int b){ int c; d++; if(b==3) return a*a*a; else{ c=f(a,b/3); return(c*c*c); } } int main(){ printf("%d",f(4,81)); return 0; }
comment moved
Mar 6
in
Programming

115
views
programminginc
1
answer
36
Rosen,Ch:9,Ex:9.3,Q10
answer selected
Mar 5
in
Set Theory & Algebra

56
views
1
answer
37
Rosen ch:9, Ex:9.1, Qn.46
answer selected
Mar 5
in
Mathematical Logic

49
views
1
answer
38
Testbook Test series
Which is Regular considering the following sets : L$_1$={a$^p$b$^q$  p+q ≥ 10$^6$} L$_2$={a$^m$b$^n$  m−n ≥ 10$^6$} Note that p, q, m and n can only belong to set ℕ. Both L1 and L2 are Regular L1 is Regular L2 is Not Neither L1 nor L2 Regular L2 is Regular L1 is not
edited
Mar 2
in
Theory of Computation

73
views
theoryofcomputation
regularlanguages
nonregularlanguages
0
answers
39
Lattice (ACE)
Let $A=\left \{ 1,2,3 \right \}$. A relation $R$ on $A\times A$ is defined by $\left ( a,b \right )R\left ( c,d \right )\Leftrightarrow \left ( “a\leq c “and” b\leq d “\right )$ S1:$R$ partial order S2: The poset $\left [ A\times A:R \right ]$ is a lattice Among S1 and S2 which one is true?
comment moved
Mar 1
in
Set Theory & Algebra

160
views
lattice
discretemathematics
1
answer
40
Programming doubt(ACE)
void print(int i){ static int x=4; if(i!=0){ print(x); } printf("%d",x); } What will be output printed for print(10)? Will it print value as call by value or call by reference?
comment edited
Mar 1
in
Programming

53
views
programminginc
output
programming
48,720
questions
52,807
answers
183,452
comments
68,471
users