menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
User Subham Nagar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Quick search syntax
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
Recent Posts
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
hi this pdf have gate prevoius year questions or...
Thanks, dude for sharing your experience !! It...
Congratulations, at least you made it to the...
seems like you really enjoyed the process.......
I wrote an email to IISC regarding JEST 2021 but...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Answers by Subham Nagar
4
votes
1
GO2019-FLT1-25
Consider the function: int fun(int n) { if (n==4) return n; else return 2*fun(n+1); } A MOD-16 ripple counter is holding the count $(1001)_2.$ What will be the count after "$(\text{fun}(2)+15)_{10}$" clock pulses? $(1000)_2$ $(1010)_2$ $(1011)_2$ $(1101)_2$
Consider the function: int fun(int n) { if (n==4) return n; else return 2*fun(n+1); } A MOD-16 ripple counter is holding the count $(1001)_2.$ What will be the count after "$(\text{fun}(2)+15)_{10}$" clock pulses? $(1000)_2$ $(1010)_2$ $(1011)_2$ $(1101)_2$
answered
Dec 31, 2018
in
Digital Logic
291
views
go2019-flt1
digital-logic
ripple-counter-operation
data-structures
recursion
0
votes
2
made easy test series
answered
Dec 10, 2018
in
Compiler Design
89
views
0
votes
3
DRDO 2008
What is the maximum possible height of an AVL tree with 20 nodes?
What is the maximum possible height of an AVL tree with 20 nodes?
answered
Jul 25, 2018
in
DS
328
views
0
votes
4
self doubt
(11+1111)* minimized number of states ???
(11+1111)* minimized number of states ???
answered
Jul 25, 2018
in
Theory of Computation
82
views
theory-of-computation
0
votes
5
Entity relationship
Minimum number of tables required and explain how
Minimum number of tables required and explain how
answered
Jun 21, 2018
in
Databases
81
views
0
votes
6
For loop
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers One-third of the product of the $3$ consecutive integers One-sixth of the product of the $3$ consecutive integers None of the above
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers One-third of the product of the $3$ consecutive integers One-sixth of the product of the $3$ consecutive integers None of the above
answered
May 17, 2018
in
Algorithms
257
views
algorithms
0
votes
7
Fractional Knapsack
Is fractional Kanpsack or knapsack problem in our GATE 2019 Syllabus
Is fractional Kanpsack or knapsack problem in our GATE 2019 Syllabus
answered
May 15, 2018
in
Algorithms
194
views
knapsack
5
votes
8
No of states in Minimal DFA
Ques:- Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)? *[ Can anybody explain this as I am getting 8 states for this since remainders will be 8 (0,1,2,3,4,5,6,7). But the answer is 4].
Ques:- Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)? *[ Can anybody explain this as I am getting 8 states for this since remainders will be 8 (0,1,2,3,4,5,6,7). But the answer is 4].
answered
May 9, 2018
in
Theory of Computation
1.2k
views
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
0
votes
9
Minimization of dfa
Question 6.
Question 6.
answered
Apr 30, 2018
in
Theory of Computation
220
views
2
votes
10
How to solve #defined ?
What is the output of the following C program? #include<stdio.h> #define SQR(x) (x*x) int main() { int a; int b=4; a=SQR(b+2); printf("%d\n",a); return 0; } 14 36 18 20
What is the output of the following C program? #include<stdio.h> #define SQR(x) (x*x) int main() { int a; int b=4; a=SQR(b+2); printf("%d\n",a); return 0; } 14 36 18 20
answered
Mar 2, 2018
in
Programming
130
views
programming-in-c
1
vote
11
Single Static Assignment
The sum of least number of temporary variables and total variables required to create a three address code in single static assignment form for the expression a*b + c/d + e-f is .?? ( Can anyone explain how the answer is 16??? )
The sum of least number of temporary variables and total variables required to create a three address code in single static assignment form for the expression a*b + c/d + e-f is .?? ( Can anyone explain how the answer is 16??? )
answered
Jul 9, 2017
in
Compiler Design
206
views
...