Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
adeemajain
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by adeemajain
2
answers
1
GATE CSE 1999 | Question: 1.12
A sorting technique is called stable if it takes $O (n \log n)$ time it maintains the relative order of occurrence of non-distinct elements it uses divide and conquer paradigm it takes $O(n)$ space
A sorting technique is called stable ifit takes $O (n \log n)$ timeit maintains the relative order of occurrence of non-distinct elementsit uses divide and conquer paradi...
9.2k
views
commented
Feb 9, 2021
Algorithms
gate1999
algorithms
sorting
easy
+
–
5
answers
2
GATE CSE 1996 | Question: 26
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below: ... of less than $100 nsec$? What is the average access time achieved using the chosen sizes of level $1$ and level $2$ memories?
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below:$$\overset{ \text {Level $1$ (Cache memory)} \\ \text{Access time = ...
14.9k
views
commented
Dec 16, 2019
CO and Architecture
gate1996
co-and-architecture
cache-memory
normal
+
–
2
answers
3
GATE CSE 1998 | Question: 17
Calculate the total time required to read 35 sectors on a 2-sided floppy disk. Assume that each track has 8 sectors and the track-to-track step time is 8 milliseconds. The first sector to be read is sector 3 on track 10. Assume that the diskette ... sectored and the controller has a 1-sector buffer. The diskette spins at 300 RPM and initially, the head is on track 10.
Calculate the total time required to read 35 sectors on a 2-sided floppy disk. Assume that each track has 8 sectors and the track-to-track step time is 8 milliseconds. Th...
2.9k
views
commented
Dec 7, 2019
Operating System
gate1998
operating-system
disk
normal
numerical-answers
out-of-syllabus-now
+
–
3
answers
4
GATE CSE 1999 | Question: 22-b
Consider the set of relations EMP (Employee-no. Dept-no, Employee-name, Salary) DEPT (Dept-no. Dept-name, Location) Write an SQL query to: Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000
Consider the set of relationsEMP (Employee-no. Dept-no, Employee-name, Salary)DEPT (Dept-no. Dept-name, Location)Write an SQL query to:Calculate, for each department numb...
1.8k
views
answered
Nov 20, 2019
Databases
gate1999
databases
sql
descriptive
easy
+
–
1
answer
5
Regular language or Not
I have a set of languages. which is needed to be categorized as regular or not regular languages...Here i have mentioned some of them please help me to understand which are regular and which are not regular with the proper explanation... 1: {ww/ w ∈ {a, b }* } 2: {ww/ w ∈ {a, b }+ } 3 ... 8: {ww^R/ w∈ {a, b}+ ,w^R is reverse of w } 9: {ww^R/ w∈ {a, b}* ,w^R is reverse of w }
I have a set of languages. which is needed to be categorized as regular or not regular languages...Here i have mentioned some of them please help me to understand which a...
2.5k
views
answered
Nov 12, 2019
4
answers
6
GATE CSE 2019 | Question: 5
Let $U = \{1, 2, \dots , n\}$ Let $A=\{(x, X) \mid x \in X, X \subseteq U \}$. Consider the following two statements on $\mid A \mid$. $\mid A \mid = n2^{n-1}$ $\mid A \mid = \Sigma_{k=1}^{n} k \begin{pmatrix} n \\ k \end{pmatrix}$ Which of the above statements is/are TRUE? Only I Only II Both I and II Neither I nor II
Let $U = \{1, 2, \dots , n\}$ Let $A=\{(x, X) \mid x \in X, X \subseteq U \}$. Consider the following two statements on $\mid A \mid$.$\mid A \mid = n2^{n-1}$$\mid A \mi...
11.3k
views
commented
Feb 7, 2019
Combinatory
gatecse-2019
engineering-mathematics
discrete-mathematics
combinatory
1-mark
+
–
1
answer
7
#address lines
Memory=1GB 16 bit processor System is byte addressable How many address lines required? I think 30 should be the ans as though processor is of 16bit but system is byte addressable so it can address only 1 byte using 1 line. Please clarify.
Memory=1GB16 bit processorSystem is byte addressableHow many address lines required?I think 30 should be the ans as though processor is of 16bit but system is byte addre...
317
views
asked
Jan 29, 2019
CO and Architecture
co-and-architecture
+
–
1
answer
8
confusion
Bias formula for floating point representation is 2^k-1 bias formula for IEEE floating point representation is 2^(k-1)-1 Is it right????
Bias formula for floating point representation is 2^k-1bias formula for IEEE floating point representation is 2^(k-1)-1 Is it right????
635
views
answered
Jan 28, 2019
Digital Logic
digital-logic
floating-point-representation
doubt
+
–
1
answer
9
ds and programming
when i printing x it is giving 0 but when comparing x with 5 ,it executing else part ,means condition fail ,why ?? #include <stdio.h> int main(void) { int x; if(x=(printf("Hello")) != 5) printf("Hello"); else printf("World \n"); printf("%d \n",x); return 0; } https://ideone.com/NJSj2i
when i printing x it is giving 0 but when comparing x with 5 ,it executing else part ,means condition fail ,why ??#include <stdio.h int main(void) { int x; if(x=(printf("...
393
views
answered
Jan 28, 2019
Programming in C
data-structures
programming-in-c
output
+
–
5
answers
10
MadeEasy Subject Test 2019: Compiler Design - Lexical Analysis
2.5k
views
commented
Jan 25, 2019
Compiler Design
made-easy-test-series
lexical-analysis
+
–
0
answers
11
Theory of Computation : Turing Machine
Correct ans is Type - 0. My doubt is LBA is also TM and LBA belongs to type - 1 then why ans is not type - 1
Correct ans is Type - 0. My doubt is LBA is also TM and LBA belongs to type - 1 then why ans is not type - 1
268
views
commented
Jan 25, 2019
Theory of Computation
theory-of-computation
turing-machine
grammar
+
–
2
answers
12
GATE Overflow | Mathematics | Test 1 | Question: 19
A group has 11 elements. The number of proper sub-groups it can have is 0 11 5 4
A group has 11 elements. The number of proper sub-groups it can have is0 11 5 4
714
views
commented
Jan 24, 2019
Set Theory & Algebra
go-mathematics-1
set-theory
group-theory
+
–
0
answers
13
Graph theory
whenever cut edges exist, cut vertices also exist because at least one vertex of a cut edge is a cut vertex. I think this is wrong as this statemnt is nit valid for graph with 2 nodes and 1 edge Someone please confirm
whenever cut edges exist, cut vertices also exist because at least one vertex of a cut edge is a cut vertex.I think this is wrong as this statemnt is nit valid for graph...
208
views
commented
Jan 19, 2019
0
answers
14
#Os #Average access time
Someone please give the formula for average memory access time when there is Tlb, cache memory and pagefault all 3 things are considered. Because i m confuse in few things like that whether pagefault is considered in case of tlb hit or not... ?
Someone please give the formula for average memory access time when there is Tlb, cache memory and pagefault all 3 things are considered. Because i m confuse in few thin...
333
views
asked
Jan 17, 2019
1
answer
15
Dma bus time
Cycle steal mode
Cycle steal mode
756
views
answered
Jan 13, 2019
CO and Architecture
dma
co-and-architecture
normal
+
–
1
answer
16
Integration
How to solve it?
How to solve it?
431
views
answered
Jan 11, 2019
1
answer
17
self doubt about dijkistra algorithm negative cycle
Will dijkistra fail if a graph has negative weight cycle which is unreachable from source????
Will dijkistra fail if a graph has negative weight cycle which is unreachable from source????
260
views
asked
Nov 17, 2018
Algorithms
dijkstras-algorithm
+
–
1
answer
18
Self Doubt
What is the minimum and maximum number of comparisons required to merge two lists of size m and n ?
What is the minimum and maximum number of comparisons required to merge two lists of size m and n ?
473
views
answered
Nov 11, 2018
Algorithms
merging
+
–
3
answers
19
Test by Bikram | Databases | Test 2 | Question: 26
Assume that a data file contains $2000$ records that are ordered by a key attribute $K$ , and a primary index on attribute $K$ is built. The size of key is $5B$ and block pointer is $5B$. Each block of the system is of ... storing meta data). The total number of disk accesses required to fetch the record using the index (in average case) is _____.
Assume that a data file contains $2000$ records that are ordered by a key attribute $K$ , and a primary index on attribute $K$ is built.The size of key is $5B$ and block ...
908
views
commented
Oct 9, 2018
Databases
tbb-dbms-2
numerical-answers
databases
file-organization
indexing
+
–
2
answers
20
GATE Overflow | Data Structures | Test 1 | Question: 25
Consider the following nested representation of Binary Trees. $(ABC)$ indicates $B$ and $C$ are left and right subtrees of node $A$ respectively. Note that $B$ and $C$ may be NULL or further nested. Which of the following representation is not a valid Binary tree? (1 2 3) (1 (2 3 4) (5 6 7)) (1 (1 (1 1 1) (1 1 1)) (1 1 1)) (1 (2 3) 4)
Consider the following nested representation of Binary Trees.$(ABC)$ indicates $B$ and $C$ are left and right subtrees of node $A$ respectively. Note that $B$ and $C$ may...
466
views
answered
Oct 8, 2018
DS
go-ds-1
data-structures
binary-tree
+
–
1
answer
21
relation algebra doubt(korth 6th edition chapter 6)
consider the schema (1) employee("person_name",street,city) (2)works("person_name",company_name,salary) (3)company("company_name",city) (4)manages("person_name",manager_name) {" " ... employees whose employees earn a higher salary on average,than the average salary at first bank corporation.
consider the schema (1) employee("person_name",street,city) (2)works("person_name",company_name,salary) ...
300
views
answered
Sep 11, 2018
7
answers
22
GATE Overflow | Programming | Test 1 | Question: 3
What will be the output of the following code? #include <stdio.h> #include <string.h> int main() { char string[] = "Hello"; if(sizeof(string) <= strlen(string)) printf("1"); printf("0"); } ______
What will be the output of the following code?#include <stdio.h #include <string.h int main() { char string[] = "Hello"; if(sizeof(string) <= strlen(string)) printf("1");...
1.8k
views
answered
Sep 6, 2018
Programming in C
go-programming-1
programming-in-c
programming
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register