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 Kabir5454
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Kabir5454
1
answer
1
ISI 2020 | PCB Mathematics | Question: 6
Find all possible integers $n$ for which $n^{2}+20 n+15$ is a perfect square.
commented
in
Others
3 hours
ago
21
views
isi2020-pcb-mathematics
0
answers
2
Zeal Test
Question : Consider a system with 20 bit physical address and direct mapped cache with 64 blocks and block size of 16 bytes To what block number does byte address 1200 mapped??
closed
in
CO and Architecture
5 hours
ago
18
views
zeal
cache-memory
direct-mapping
1
answer
3
Self Doubt
Is the diagonalization language (Ld) countable?
answer edited
in
Theory of Computation
1 day
ago
148
views
theory-of-computation
self-doubt
1
answer
4
unacademy test series
A shopkeeper claims to sell rice at cost price. He uses a false weight with the intention of selling rice at 20% profit. After selling rice to the customer, he realises that the customer has paid 15% less than what he should have paid. What is the actual profit percentage made by the shopkeeper? a)2%gain b)12%gain c)4% gain d)5% gain
commented
in
Quantitative Aptitude
1 day
ago
35
views
general-aptitude
quantitative-aptitude
profit-loss
test-series
0
answers
5
unacademy test series
In a car race, Car X beats Car Y by $45$ km, Car Y beats Car Z by $50$ km, and Car X beats Car Z by $90$ km. The distance (in m) over which the race has been conducted is: 550000 475000 500000 450000
commented
in
Quantitative Aptitude
2 days
ago
50
views
quantitative-aptitude
speed-time-distance
test-series
2
answers
6
maths probability
A dice is tossed seven times. What is the probability that all six faces appear at least once?
commented
in
Probability
3 days
ago
111
views
probability
1
answer
7
Recursion
#include <stdio.h> int fun(int num){ while(num>0) { num=num*fun(num-1); } return num; } int main() { int x=fun(8); printf("%d",x); return 0; } Hello Folks, I have a doubt related to the above snippet of code. Why does the output of the above code be 0? Kindly help me with a detailed explanation.
commented
in
Programming
4 days
ago
62
views
recursion
programming
programming-in-c
0
answers
8
MADEEASYWORKBOOK 2019
Suppose Host A sends over a TCP connection to Host B one segment sequence number 38 and 4 bytes of data.What will be acknowledgements number for subsequent segment. 38 39 42 54
commented
in
Computer Networks
5 days
ago
51
views
made-easy-booklet
0
answers
9
cache memory
Consider a cache organization employing a line of 64B and main memory that requires 40ns to transfer a 2B word. What is the minimum average number of times a cache line must be made dirty for write-back policy to be more efficient than write though policy, for any line which is written at-least-once
comment edited
in
CO and Architecture
6 days
ago
58
views
co-and-architecture
cache-memory
numerical-answers
0
answers
10
CMI2022-A: 6
The Telvio mobile service provider allows each customer to choose a part of their $10$- digit mobile number when getting a new connection. The first two digits of the number are fixed by the company based on the customer's region. The customer can choose the last four digits as they wish. The ... when read from left to right? $\frac{1}{4}$ $\frac{1}{16}$ $\frac{1}{24}$ $\frac{1}{32}$
commented
in
Others
Aug 11
28
views
cmi2022
2
answers
11
GO Classes 2023 | Weekly Quiz 4 | Question: 7
If $x, y, z,$ and $w$ are declared as integer variables, which of the following expressions are $\text{NOT}$ valid in $C$? $x + 5 = y + z$ $x = y = z + w$ $x = ( z - y ) == w$ $w = x != y\; \&\&\; z$
answer edited
in
Programming
Aug 11
231
views
goclasses_wq4
goclasses
programming
programming-in-c
1-mark
0
answers
12
Database: Minimum number of tuples
Consider a relation schema r(A, B, C). Number of elements in domain of attributes A, B and C are 4, 10 and 17 respectively. “ Minimum ” number of tuples possible in an instance of relation r is ________.
commented
in
Databases
Aug 11
38
views
databases
relations
1
answer
13
Madeeasy Test Series
A hash table of size 10 using open addressing with linear probing and hash function is h(k)= (k)mod10 , where k is key value , initially table is empty . Following keys are inserted into table in given order . 44,87,43,68,30,20,67 How many number of probes required to insert 17 in table after inserting above keys?
commented
in
Algorithms
Aug 10
166
views
algorithms
made-easy-test-series
hashing
linear-probing
0
answers
14
Self Doubt
S:- R1(x) R1(y) W1(x) R2(z) R2(y) W3(y) R2(y) Schedule is view Serializable or not ?
commented
in
Databases
Aug 10
55
views
databases
self-doubt
view-serializable
1
answer
15
In a pipelined architecture Static branch prediction is used with branch taken assumption. Assume that 30% of the instructions executed for a program are branch instructions. Each stage has 2 nsec delay. Average Execution time(in nsec) if 80 % of the instructions are taken?
edited
in
CO and Architecture
Aug 9
58
views
co-and-architecture
pipelining
1
answer
16
Made easy || Database
Consider a relation schema r(A, B, C, D, E, F) and attribute A is element of every candidate key of r. Maximum number of possible candidate keys of r is ________.
commented
in
Databases
Aug 9
98
views
made-easy-test-series
databases
candidate-key
0
answers
17
Computer Networks
In the given solution , while calculating transmission time why 8 is not multiplied i.e. Length = 2000Byte = 2000 * 8 bits formula is not used.
commented
in
Computer Networks
Aug 9
60
views
computer-networks
ace-test-series
sliding-window
1
answer
18
NPTEL Assignment
In how many ways can the word ‘DOCUMENTATION’ be arranged so that all the consonants come together.
commented
in
Combinatory
Aug 9
92
views
2
answers
19
GO Classes Scholarship 2023 | Test | Question: 9
Consider the following graph $\text{G:}$ Let $\text{M, C, I, S, B, E}$ be the Matching number, chromatic number, independence number, Clique number, Vertex cover number, and edge cover number, respectively of $\text{G}.$ What is $\text{M+C+I+S+B+E}?$
commented
in
Graph Theory
Aug 8
162
views
goclasses-scholarship-test1
numerical-answers
goclasses
graph-theory
graph-connectivity
vertex-cover
2-marks
1
answer
20
data structure and algorithms -- linked list -- size of a node
as we allocate the space for node in linked list using malloc() so how many bytes malloc allocate for the 1 node i.e. actual value of malloc allocates in ram like i write this code. so what is size of a node of linked ... node *)malloc(sizeof(struct node)); printf("%d",sizeof(struct node)); } what the printf prints and why ?
commented
in
Programming
Aug 8
132
views
data-structures
linked-list
algorithms
sorting
2
answers
21
Gateforum Test Series: Graph Theory - Graph Matching
commented
in
Graph Theory
Aug 8
528
views
gateforum-test-series
discrete-mathematics
graph-theory
graph-matching
3
answers
22
GO Classes Scholarship 2023 | Test | Question: 2
Let $\text{S}$ be the set of all bit-strings of length $7 .$ We define a relation $\mathrm{R}$ on the set $\mathrm{S}$ by the rule that $x\mathrm{R}y$ iff $x$ and $y$ ... such that $\forall j \neq i, x_{j}=y_{j}$ and $x_{i} \neq y_{i}$. What is the cardinality of relation $\mathrm{R}$?
commented
in
Set Theory & Algebra
Aug 8
321
views
goclasses-scholarship-test1
numerical-answers
goclasses
set-theory&algebra
relations
2-marks
3
answers
23
GO Classes Scholarship 2023 | Test | Question: 17
Consider the following pair of mutually recursive functions. int f(int n){ if (n==0) return 1; return f(n-1)+g(n-1); } int g(int n){ if (n==0) return 1; return g(n-1) - f(n); } Which of the following is/are will evaluate to TRUE? $f(2) == g(0)$ $g(2)+f(1) == 0$ $g(4)+g(1) == 0$ $f(3)+f(0) == 0$
commented
in
Programming
Aug 7
160
views
goclasses-scholarship-test1
goclasses
programming
programming-in-c
functions
recursion
multiple-selects
2-marks
1
answer
24
Test Series 2022
Please explain Ans is 22
commented
in
Databases
Aug 7
48
views
candidate-key
1
answer
25
Recursive function
Consider the following recursive function which is used by dynamic programming. T(n) = { 0; if n<1 1; if n=1 T(n-1)+T(n-2)+1; if n>1} Assume for every function call T(i) it checks the table first , if it's value is already ... value of 'n' so that overflow cannot occur . ( Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)
commented
in
Programming
Aug 6
88
views
recursion
dynamic-programming
2
answers
26
Made easy || Operating system
While of the following is incorrect? (a) if a system uses preemptive CPU scheduler then deadlock is not possible in system (b) Deadlock state is an unsafe state. (c) If a system has total ordering of all resource types ... disabled) therefore deadlock should not possible in preemptive scheduling then how can this statement could be incorrect. please clarify the doubt
commented
in
Operating System
Aug 5
90
views
operating-system
made-easy-test-series
deadlock-prevention-avoidance-detection
0
answers
27
TOC doubt
How a language which is not recursively enumerable is uncountable,because as we know every language is a subset of sigma(input alphabet) star which is known to be countable? Please explain I am getting confused in this.
commented
in
Theory of Computation
Aug 5
42
views
0
answers
28
Maths for natural science
Determine the domain of the function $f(x)=\left | x \right |+1$
retagged
in
Calculus
Aug 5
46
views
calculus
functions
4
answers
29
GATE IT 2005 | Question: 4
Let $L$ be a regular language and $M$ be a context-free language, both over the alphabet $Σ$. Let $L^c$ and $M^c$ denote the complements of $L$ and $M$ ... TRUE? It is necessarily regular but not necessarily context-free. It is necessarily context-free. It is necessarily non-regular. None of the above
commented
in
Theory of Computation
Aug 4
5.8k
views
gateit-2005
theory-of-computation
normal
identify-class-language
7
answers
30
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
commented
in
Combinatory
Aug 1
10.3k
views
gatecse-2020
numerical-answers
combinatory
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Delhi Subordinate Services Selection Board
IIT GATE Admission Online Form 2023
All about M.Tech. and Research Admissions at IITP
IIT JAM Admission Online Form 2023
All about M.Tech. and Research Admissions at IITGn
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.4k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.3k)
Admissions
(644)
Exam Queries
(836)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent Blog Comments
The spreadsheet is up to date.
Can somebody give the details of how many topic...
@kabir5454 Anyway you should not be looking for...
General boys be like " Hum kya kare ab parhai...
14 backlogs to top 100