Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User suchithreddy
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by suchithreddy
2
answers
1
UGC NET CSE | June 2019 | Part 2 | Question: 97
Consider the following: Evolution Selection Reproduction Mutation Which of the following are found in genetic algorithms? b, c and d only b and d only a, b, c and d a, b and d only
commented
in
Artificial Intelligence
Mar 27, 2020
6.3k
views
ugcnetcse-june2019-paper2
artificial-intelligence
genetic-algorithms
1
answer
2
ISRO2012-ECE 8085 processor
The complement Accumulator (CMA) instruction in $8085$ processor on execution affects Zero flag Sign flag Overflow flag none of the above
commented
in
CO and Architecture
Mar 18, 2020
1.2k
views
isro2012-ece
isro-ece
co-and-architecture
8085-microprocessor
6
answers
3
GATE CSE 2000 | Question: 6
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertices are adjacent iff the symmetric difference of the corresponding sets has ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?
commented
in
Set Theory & Algebra
Jan 2, 2020
6.4k
views
gatecse-2000
set-theory&algebra
normal
descriptive
set-theory
5
answers
4
GATE CSE 2018 | Question: 21
Consider the following $\text{C}$ program: #include<stdio.h> int counter=0; int calc (int a, int b) { int c; counter++; if(b==3) return (a*a*a); else { c = calc(a, b/3); return (c*c*c); } } int main() { calc(4, 81); printf("%d", counter); } The output of this program is ______.
commented
in
Programming in C
Dec 28, 2019
10.9k
views
gatecse-2018
programming-in-c
numerical-answers
recursion
programming
1-mark
2
answers
5
GATE CSE 2010 | Question: 9
The Boolean expression of the output $f$ of the multiplexer shown below is $\overline {P \oplus Q \oplus R}$ $P \oplus Q \oplus R$ $P+Q+R$ $\overline{P+Q+R}$
commented
in
Digital Logic
Dec 19, 2019
8.9k
views
gatecse-2010
digital-logic
circuit-output
easy
9
answers
6
GATE CSE 2014 Set 3 | Question: 25
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram ... $\text{ii}$ only $\text{ii}$ and $\text{iii}$ only $\text{i, ii}$ and $\text{iii}$
commented
in
Computer Networks
Dec 1, 2019
16.4k
views
gatecse-2014-set3
computer-networks
ip-packet
normal
7
answers
7
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
commented
in
Algorithms
Nov 17, 2019
36.4k
views
gatecse-2008
normal
algorithms
time-complexity
4
answers
8
GATE CSE 2001 | Question: 1.14
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort? $O(n)$ $O(n \log n)$ $O(n^2)$ $O(n!)$
commented
in
Algorithms
Nov 11, 2019
13.6k
views
gatecse-2001
algorithms
sorting
time-complexity
easy
7
answers
9
GATE CSE 2010 | Question: 37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$
commented
in
Compiler Design
Oct 20, 2019
21.8k
views
gatecse-2010
compiler-design
target-code-generation
register-allocation
normal
2
answers
10
GATE CSE 1997 | Question: 1.8
A language $L$ allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is true? A compiler using static memory allocation can be written for $L$ A compiler ... $L$; an interpreter must be used A compiler using dynamic memory allocation can be written for $L$ None of the above
commented
in
Compiler Design
Oct 19, 2019
4.7k
views
gate1997
compiler-design
easy
runtime-environment
1
answer
11
GATE2018 ME-2: GA-5
The value of the expression $\dfrac{1}{1+ \log_u \: vw} + \dfrac{1}{1+ \log_v \: wu} + \dfrac{1}{1+\log_w uv}$ is _______ $-1$ $0$ $1$ $3$
commented
in
Quantitative Aptitude
Oct 14, 2019
3.2k
views
gate2018-me-2
general-aptitude
quantitative-aptitude
logarithms
1
answer
12
GATE2019 CE-1: GA-3
On a horizontal ground, the base of a straight ladder is $6$ m away from the base of a vertical pole. The ladder makes an angle of $45^{\circ}$ to the horizontal. If the ladder is resting at a point located at one-fifth of the height of the pole from the bottom, the height of the pole is ______ meters. $15$ $25$ $30$ $35$
commented
in
Quantitative Aptitude
Oct 13, 2019
1.3k
views
gate2019-ce-1
general-aptitude
quantitative-aptitude
geometry
3
answers
13
GATE2018 ME-2: GA-4
The perimeters of a circle, a square and an equilateral triangle are equal. Which one of the following statements is true? The circle has the largest area The square has the largest area The equilateral triangle has the largest area All the three shapes have the same area
commented
in
Quantitative Aptitude
Oct 13, 2019
2.6k
views
gate2018-me-2
general-aptitude
quantitative-aptitude
geometry
easy
5
answers
14
GATE CSE 2014 Set 2 | Question: 43
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block ... size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty
commented
in
CO and Architecture
Oct 5, 2019
20.9k
views
gatecse-2014-set2
co-and-architecture
cache-memory
normal
3
answers
15
GATE CSE 2001 | Question: 20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
comment edited
in
Operating System
Sep 21, 2019
10.9k
views
gatecse-2001
operating-system
disk
normal
descriptive
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...