The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
Recent activity by balchandar reddy san
User balchandar reddy san
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User balchandar reddy san
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
Made Easy Test Series:DSArray
Consider the integer array $A\left [ 1.........100,1.......100 \right ]$ in which the elements are stored in $Z$ representation. An example of a $5\times 5$ array in $Z$ representation is shown below: If the base address of $A$ is ... $A$ is stored in Row Major Order, then the address corresponding to $A\left [ 100 \right ]\left [ 55 \right ]$ is ________________
commented
May 4
in
Programming

84
views
madeeasytestseries
datastructure
0
answers
2
Made Easy Test Series:ProgrammingFunction Call
Consider the following program: void A(int n){ printf("*"); if(n>1){ A(n/4); A(n/4); A(n/4); A(n/4); } } Let $X$ be number of asterisks printed by above function when $n=1024.$ Then the value of $X$ will be ____________ How ans will be $\frac{4^{k+1}1}{3}$ , where $k=5?$ .
commented
May 4
in
Programming

96
views
madeeasytestseries
programming
programminginc
1
answer
3
Gate 2002  ME
Which of the following functions is not differentiable in the domain $[1,1]$ ? (a) $f(x) = x^2$ (b) $f(x) = x1$ (c) $f(x) = 2$ (d) $f(x) = Maximum (x,x)$
asked
May 4
in
Calculus

79
views
engineeringmathematics
usergate2002
usermod
calculus
differentiability
1
answer
4
Made Easy Test Series : Compiler Design
Consider the following CFG: $S\rightarrow Aa\mid ca$ $A\rightarrow c\mid d$ How many conflict occur in $CLR\left ( 1 \right )$ Parsing construction ? I think $LR\left ( 0 \right )$ there is $1$ conflict, but in $SLR\left ( 1 \right )orCLR\left ( 1 \right )$ there won’t be any conflict. Someone verify it.
commented
Apr 29
in
Compiler Design

68
views
compilerdesign
madeeasytestseries
1
answer
5
Allen Career Institute: Discrete Math
Let $f : A \rightarrow B$ be a bijection and let $E,F$ be subjects of $A$, Now, we consider the following statements about the function $f :$ $P : f(E \cup F) = f (E) \cup f(F)$ ... None of $P$ and $Q$ is correct I thought $Q$ is true, but answer is both true. Is both true because of bijective function or ans given incorrect?
commented
Apr 27
in
Set Theory & Algebra

56
views
discretemathematics
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
Apr 27
in
Numerical Ability

34
views
0
answers
7
Made easy Test series
Rajesh traveled from home to school at 30 miles per hour. Then he returned home at 40 miles per hour, and he finally went back to school at 60 miles per hour, all along the same route. What was his average speed for the entire trip,in miles per hour?
commented
Apr 27
in
Numerical Ability

35
views
0
answers
8
IITG MTech DataScience
Did anyone receive call letter from IITG Datascience for Written test, the shortlist was announced and it is informed that call letter will be sent by 26th apr 12PM...anyone have any info?
asked
Apr 27
in
Written Exam

134
views
admissions
gettingtoiits
general
0
answers
9
BITS HD Exam Slot Query
The exam date for ME CSE is on 15th and 26th may, the slot booking will open on 4th may. My query is that whether slots for ME CSE will be there on both the dates (15th & 26th may) or only on any one particular day?
asked
Apr 26
in
Written Exam

119
views
bits
bitshd
1
answer
10
Self doubt
What is the admission procedure of iiitBangalore? Do they conduct interviews?
commented
Mar 2
in
IIITs

285
views
0
answers
11
#gate2019
I am getting around 67.33 marks. What all options will be available for me? I want to join in good IITs will I get them? I am even ready to drop an year and try again for good IITs ? Will I get good IITs if I do well in interviews?
commented
Mar 2
in
IISc/IITs

236
views
careeradvice
1
answer
12
Should I apply for IIIT H ? GATE 2019 Marks 60 OBC NCL
Rank Estimate 800  994 Current Rank 800 / 31715 Expected Score 707.52 My Marks 60 Category: OBC  NCL College Predictor says that i can get IIT G/R/H and Top NITs also, I just want to know should i apply for IIIT H also ? I don' ... don't know if my Rank is stable right now or it will further go down from here. Do i still have chance in IITs ?
commented
Mar 2
in
IISc/IITs

483
views
0
answers
13
admission_query
I scored 52.67 marks(Score 632)! Do I have any option? Is there any chance of admission in Bits or IIITB or IIITA?
commented
Feb 22
in
NITs

331
views
nit
admissions
bits
0
answers
14
Gate 2019 score
GATE2019 I am getting 71 marks in gate 2019 as per gateoverflow predictor and i think this time number candidates who are getting good score are more compare to last year. So which iit i can get into. Please be specific . I am from general category.
commented
Feb 14
in
GATE

4.8k
views
admission
0
answers
15
Bits HD 2018
How is BITS,Goa M.E CSE in terms of placements....I got Bits GOA in 1st iteration,do i have a chance of getting Pilani campus.in further iterations?....i had 126 marks
commented
Feb 14
in
Other Colleges

1.3k
views
bits
admissions
gate2018admissions
0
answers
16
gate admission
My Gate 2019 expected score is 47 is there any possibility i could get good college for m.tech . i have already taken edu loan for my bachelors didnt have any job. so any suggestion please thank you
commented
Feb 12
in
Written Exam

247
views
10
answers
17
GATE201950
What is the minimum number of $2$input NOR gates required to implement a $4$ variable function expressed in sumofminterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
commented
Feb 5
in
Digital Logic

6.1k
views
gate2019
numericalanswers
digitallogic
canonicalnormalform
1
answer
18
GATE 2019
commented
Feb 4
in
Programming

424
views
2
answers
19
Gate 2019: Subnet Mask
A network with three hosts M, N and P have IP address 194.56.10.2, 194.56.10.5 and 194.56.10.6 and their subnet mask is 255.255.255.252. Which of the following will be in a same subnet? (a) All three will be in same subnet (b) M and N (c) N and P (d) All will be in different subnet
commented
Feb 4
in
Computer Networks

412
views
2
answers
20
gate 2019
What is the answer for number of dfa states question,based on composition function?
commented
Feb 4
in
Theory of Computation

508
views
2
answers
21
Gate 2019
What is the for the question where two statements were given as: S1: matrix A is invertible S2:A=0?
commented
Feb 4
in
Set Theory & Algebra

303
views
0
answers
22
Can Merge Sort Time Complexity be O(n^2) in any condition?
commented
Feb 1
in
Algorithms

166
views
algorithms
timecomplexity
sorting
1
answer
23
ME Mock 4
Consider a new sorting algorithm similar to the BubbleSort algorithm, called RumbleSort. Given an array as input, RumbleSort attempts to sort the array and produces a sorted array as output. Here's the pseudocode for RumbleSort. With regards to the above RumbleSort ... algorithm will work correctly for a given input is $\mathcal Ο(n^2)$ Which of the above statements is/are true?
answer selected
Jan 31
in
Algorithms

203
views
timecomplexity
algorithms
sorting
1
answer
24
Letters in boxes  combinations
Q .) The number of ways can 5 letter be put in 3 boxes A, B,C such that A has at least 2 letters. My approach: Number of ways to choose 2 letters out of 5 is 5C2. And for each such combination the remaining 3 letter have 3 choice. Therefore 5C2 * 3^3, but this is incorrect. Please point out the fault in my understanding and also the correct way to solve it
commented
Jan 31
in
Combinatory

77
views
permutationandcombination
2
answers
25
ME MOCK 4
Consider the following function: void madeeasy (int n) { if (n < 0) return; else { printf(n); madeeasy ( n); madeeasy (n  ); printf(n); } } The sum of all values printed by madeeasy (5)_______ (I am getting 12 but given answer is 52)
commented
Jan 31
in
Programming

272
views
programminginc
recursion
2
answers
26
#automata
Is intersction of two languages is also a language of the same type? RE AND REC which languages is decidable and un undecidable
commented
Jan 31
in
Theory of Computation

37
views
theoryofcomputation
1
answer
27
Test series
Consider a system with main memory access time is 150ns and page fault service time is 5 microsecond if onepage fault generated for every 10^3 memory access then what is effective memory access time(in ns)?? The answer given is 154.85 and the answer I am getting is 4850.15 please verify someone
answered
Jan 31
in
CO and Architecture

26
views
3
answers
28
MadeEasy Subject Test 2019: Combinatory  Permutations And Combinations
Q.The number of ways, we can arrange 5 books in 3 shelves ________.
commented
Jan 31
in
Combinatory

421
views
discretemathematics
permutationandcombination
madeeasytestseries2019
madeeasytestseries
0
answers
29
database
Q: Primary indexing can be sparse or dense? Q: Clustering indexing can be sparse or dense? Q: secondary indexing can be sparse or dense?
comment edited
Jan 30
in
Databases

26
views
1
answer
30
MadeEasy Test Series 2019: CO & Architecture Cache Memory
Consider a nway cache with 'x blocks of 64 words each. The main memory of the system is having 8 million words. Size of the tag field is 16 bits and additional memory required for tags is 1024 bytes. What will be the values of n and x respectively? Answer 256 512
answered
Jan 30
in
CO and Architecture

227
views
coandarchitecture
cachememory
madeeasytestseries2019
madeeasytestseries
0
answers
31
ME FLT5
Consider the following POSETs: Which of the above POSETs are isomorphic to (P (S), ⊆), where S = {a, b, c}?
asked
Jan 30
in
Set Theory & Algebra

73
views
engineeringmathematics
0
answers
32
Made easy
I am having difficulty in finding the type of errors like if given a statement, if I have to tell which type of error it is ( syntax or semantic). Can anyone help me with it,explain it to me in a simple language by giving examples.
comment edited
Jan 29
in
Compiler Design

61
views
compilerdesign
compilationphases
1
answer
33
MadeEasy Test Series 2019: CO & Architecture  Cache Memory
A CPU cache is organized into 2 level cache L1 and L2 The penalty for L1 cache miss and L2 cache miss are 60 and 30 respectively for 1200 memory references The hit time of L1 and L2 are 5 and 10 clock cycles and penalty for L2 cache miss to main memory is 70 clock cycles. The average memory access time will be
answered
Jan 29
in
CO and Architecture

208
views
coandarchitecture
cachememory
madeeasytestseries2019
madeeasytestseries
2
answers
34
MadeEasy Test Series
What is the number of seven digit integers possible with sum of the digits equal to 11 and formed by using the digits 1, 2 and 3 only?
answered
Jan 29
in
Combinatory

112
views
2
answers
35
ME FLT2
AVL tree is constructed by inserting the keys 2, 6, 1, 5, 3, 4, 7 in the given order. (Assume the tree is initially empty). Then the level order traversal of the above binary tree will be.. Answer given is: 3,2,5,1,4,6,7
edited
Jan 29
in
Programming

77
views
datastructure
2
answers
36
ER Diagrams  Minimum Number of Tables required
How many minimum number of tables needed for this Quaternary Relationship?
comment reshown
Jan 28
in
Databases

384
views
databases
erdiagram
ertorelational
relational
0
answers
37
#DBMS
What are the parameters or procedure to follow to find out minimum no. of tables for given ER Diagram type of questions?
comment edited
Jan 28
in
Databases

81
views
databases
sql
erdiagram
erdiagram
0
answers
38
made easy cbt2
consider the following relational schema R(A,B,C,D,E,F,G) AB>C,BC>A,AC>B,B>D,D>E how many minimum relations required to decompose R into BCNF which satisfy lossless and FDP decomposition? initially i got 4 relation as R1(A,B,C) R2(D,E) R3(B,D) R4(A,B,F,G) but in R1 and R2 there is no common attribute, hence it will not be lossless??am i correct
comment edited
Jan 28
in
Databases

80
views
1
answer
39
Testbook Test Series: Operating System  File System
A file system with 300 GB uses a file descriptor with 8 direct block address. 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 256 Bytes and the size of each disk block address is 16 Bytes. The maximum possible file size in this file system is? The answer given was 70KB. Thanks!
answered
Jan 28
in
Operating System

88
views
operatingsystem
filesystem
testbooktestseries
2
answers
40
GOCompiler1: Parsing5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is present in a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar
comment edited
Jan 27
in
Compiler Design

204
views
go2019cd1
parsing
lrparser
50,645
questions
56,614
answers
195,893
comments
102,327
users