Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by bhuv
1
answer
1
Time complexity
Which one is larger $O(√n)$ or $O(log n)$ ?
Which one is larger $O(√n)$ or $O(log n)$ ?
321
views
commented
Jul 27, 2018
Algorithms
asymptotic-notation
time-complexity
+
–
1
answer
2
GALVIN(NINTH INDIAN EDITION)-CHAPTER 1(SECTION 1.5.1)
The hardware allows privileged instruction to be executed only in kernel mode. if an attempt to execute a privileged instruction in user mode, the hardware does not execute the instruction but rather treat it as illegal and traps it to ... privileged instruction. how can it be then executed if the system is not in kernel mode? please clarify...
The hardware allows privileged instruction to be executed only in kernel mode. if an attempt to execute a privileged instruction in user mode, the hardware does not execu...
1.9k
views
commented
Jul 10, 2018
Operating System
operating-system
process
+
–
0
answers
3
Self Doubt
Why only hexadecimal number system is used in MAC address in an NIC card and other number system ain't ?
Why only hexadecimal number system is used in MAC address in an NIC card and other number system ain't ?
511
views
commented
Jul 4, 2018
Computer Networks
computer-networks
ethernet
+
–
1
answer
4
Asymptotic time complexity to add a node at the end of singly linked list.
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? (a) O(1) (b) O(n) (c) θ (n) (d) θ (1) Confused between option (b) and (c) .
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?(a) O(1) (b...
21.1k
views
commented
Jul 4, 2018
DS
data-structures
linked-list
time-complexity
+
–
1
answer
5
Entriies in s stack are "ordered".
Entries in a stack are "ordered". What is the meaning of this statement?
Entries in a stack are "ordered". What is the meaning of this statement?
2.8k
views
commented
Jul 4, 2018
DS
data-structures
stack
+
–
2
answers
6
GATE CSE 1996 | Question: 18
Consider the following program that attempts to locate an element $x$ in an array $a[ ]$ using binary search. Assume $N > 1$. The program is erroneous. Under what conditions does the program fail? var i,j,k: integer; x: integer; a: array; [1..N] of ... ; if (a[k] = x) then writeln ('x is in the array') else writeln ('x is not in the array') end;
Consider the following program that attempts to locate an element $x$ in an array $a[ ]$ using binary search. Assume $N 1$. The program is erroneous. Under what conditio...
3.5k
views
commented
Jun 26, 2018
Algorithms
gate1996
algorithms
searching
normal
descriptive
+
–
2
answers
7
Multidimensional Pointer Arithmetic
int main() { char arr[5][7][6]; char (*p)[5][7][6] = &arr; /* Hint: &arr - is of type const pointer to an array of 5 two dimensional arrays of size [7][6] */ printf("%d\n", (& ... 42 210 Questn) Can anyone please explain how output is calculated in all the printf statements and what difference 'unsigned' is making to the output.
int main(){ char arr[5][7][6]; char (*p)[5][7][6] = &arr; /* Hint: &arr - is of type const pointer to an array of 5 two dimensional arrays of size [7][6] ...
1.7k
views
commented
Jun 26, 2018
Programming in C
programming-in-c
array
+
–
12
answers
8
GATE CSE 2005 | Question: 70
Consider a disk drive with the following specifications: $16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is operated in cycle stealing mode whereby whenever one $4$ byte word is ready it is sent ... $40$ nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is: $10$ $25$ $40$ $50$
Consider a disk drive with the following specifications:$16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is op...
65.5k
views
commented
Jun 25, 2018
CO and Architecture
gatecse-2005
co-and-architecture
disk
normal
dma
+
–
1
answer
9
CONTEXT SWITCHING
Assume that current cpu burst of the lone process spans more than one time-slice of the round-robin algorithm. My reasoning is as below The steps that may take place when a timer interrupt occurs in a typical case are 1. Interrupt occurs. 2. Switch to kernel ... both thread are of same process .. so dont save (dont even flush) TLB and Cache at the time of Context switching..
Assume that current cpu burst of the lone process spans more than one time-slice of the round-robin algorithm.My reasoning is as belowThe steps that may take place when a...
3.0k
views
commented
Jun 22, 2018
1
answer
10
OS Kernel
Please explain each point. My assumptions are; 1.kernel must save the register values.It should be FALSE as it can be the case if the process is terminated.Thus, no need to save. 2.kernel must close the files. Explain this point in both the cases(the ... has not dealt with registers earlier.Thus, no need to restore. 4.kernel must save the content of memory onto disk. Explain this too.
Please explain each point.My assumptions are;1.kernel must save the register values.It should be FALSE as it can be the case if the process is terminated.Thus, no need to...
1.3k
views
commented
Jun 21, 2018
Operating System
operating-system
kernel
process
+
–
1
answer
11
Minimum DFA Construction
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states. But I am getting many more states. Could someone please provide a diagram that involves only 12 states?
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states....
993
views
commented
Jun 14, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
+
–
2
answers
12
JK Flip Flop - Unused States
1.3k
views
commented
Jun 14, 2018
Digital Logic
digital-logic
flip-flop
+
–
2
answers
13
GATE Suitability Test | Test 1 | Question: 4
Ram while writing his C code used char mydata[1000] instead of int mydata[1000]. All the test cases were successful but the code failed during production despite all paths in the program being covered by the test cases. What could be the ... same The array numbers used for testing were small Size of int and char happened to be same on the test machine
Ram while writing his C code used char mydata[1000] instead of int mydata[1000]. All the test cases were successful but the code failed during production despite all path...
626
views
commented
Jun 13, 2018
Programming in C
gate-suitability-test-1
programming-in-c
+
–
2
answers
14
Sheldon ross -Conditional probability
668
views
commented
Jun 12, 2018
Mathematical Logic
sheldon-ross
probability
+
–
1
answer
15
Parse tree
Consider the following grammar $S \rightarrow SS/Sa/aS/a$ Construct Parse Tree for $w=aaaa$ as many as possible? How many parse trees are possible?
Consider the following grammar$S \rightarrow SS/Sa/aS/a$Construct Parse Tree for $w=aaaa$ as many as possible? How many parse trees are possible?
794
views
commented
Jun 12, 2018
Compiler Design
compiler-design
parsing
+
–
3
answers
16
what is true about the syntax directed translation scheme given below :
S->aSb { S.c=S.c+2 } S->bSa { S.c=S.c+2 } S->epsilon {S.c=0 } 1. Equal no of a's and b's . 2. No of a's or no of b's in a given string . 3. No of a's and no of b's in a given string .. 4. None of these . According to me , it should be total no of a's and no of b's .
S->aSb { S.c=S.c+2 }S->bSa { S.c=S.c+2 }S->epsilon {S.c=0 } 1. Equal no of a's and b's .2. No of a's or no of b's in a given string .3. No of a's and no of b's in a given...
3.2k
views
commented
Jun 12, 2018
Compiler Design
compiler-design
syntax-directed-translation
+
–
3
answers
17
GATE CSE 1987 | Question: 1-xv
In a circular linked list organization, insertion of a record involves modification of One pointer. Two pointers. Multiple pointers. No pointer.
In a circular linked list organization, insertion of a record involves modification ofOne pointer.Two pointers.Multiple pointers.No pointer.
14.3k
views
commented
Jun 12, 2018
DS
gate1987
data-structures
linked-list
+
–
4
answers
18
GATE CSE 1999 | Question: 19
A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both virtual and physical address spaces contain $2^{16}$ bytes each. The virtual address space is divided into $8$ non-overlapping equal ... in page table entry for storing the aging information for the page? Assume that the page size is $512$ bytes.
A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both virtual and physical address spaces contain $2^{1...
25.6k
views
commented
Jun 11, 2018
Operating System
gate1999
operating-system
virtual-memory
normal
descriptive
+
–
7
answers
19
GATE CSE 2003 | Question: 32
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable) $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$ $(∀x)[α] ⇒ (∃x)[α ∧ β]$ $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$ $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable)$((∀x)[α] ⇒ (∀x...
16.9k
views
commented
Jun 11, 2018
Mathematical Logic
gatecse-2003
mathematical-logic
first-order-logic
normal
+
–
1
answer
20
Constant Pointer
Please tell me about all the variations of these above types of questions that can be asked?
Please tell me about all the variations of these above types of questions that can be asked?
765
views
answered
May 5, 2018
Programming in C
programming-in-c
+
–
1
answer
21
Not From any book
What's the basic difference between hardware and software solutions for critical section problem? Why are they called hardware or software solution?
What's the basic difference between hardware and software solutions for critical section problem? Why are they called hardware or software solution?
1.6k
views
commented
May 5, 2018
1
answer
22
TOC Push down automata
Can we put simultanously Two symbols in stack in one of the video on youtube it is showing that we can put two a's on to the stack I'm not finding it correct plzz calrify my doubt it on place of one a we are putting two a's one extra a is ... because any how 1 b is poping out 1 a then no.of b's will be fine but what about one extra which has been take out
Can we put simultanously Two symbols in stack in one of the video on youtube it is showing that we can put two a's on to the stack I'm not finding it correct plzz calrify...
499
views
answered
May 5, 2018
4
answers
23
Programming - pointer
Assume sizeof an integer and a pointer is 4 byte. Output? #include<stdio.h> #define R 10 #define C 20 int main() { int *p[R][C]; printf("%d",sizeof(*p)); printf("%d",sizeof(p)); return 0; }
Assume sizeof an integer and a pointer is 4 byte. Output?#include<stdio.h #define R 10 #define C 20 int main() { int *p[R][C]; printf("%d",sizeof(*p)); printf("%d",sizeof...
4.4k
views
commented
Apr 10, 2018
Programming in C
programming-in-c
output
programming
+
–
2
answers
24
Gate probability
A party of n persons take their seats at random at a round table,then the probability that two specified person do not sit together is $\left(\dfrac{2}{n-1}\right)$ $\left(\dfrac{n-3}{n-1}\right)$ $\left(\dfrac{n-2}{n-1}\right)$ $\left(\dfrac{1}{n-1}\right)$
A party of n persons take their seats at random at a round table,then the probability that two specified person do not sit together is$\left(\dfrac{2}{n-1}\right)$$\left(...
2.7k
views
commented
Mar 30, 2018
Probability
probability
+
–
2
answers
25
GATE CSE 1991 | Question: 16,a
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's.$
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's....
6.5k
views
commented
Feb 22, 2018
Combinatory
gate1991
combinatory
normal
descriptive
catalan-number
+
–
0
answers
26
Heap Smallest Element
My question is in Question like find 5th Smallest element in a heap: It requires O(logn) time if we do only Delete operation 5 Times.But what if the array contains no 5th smallest element say our array contain [1,1,1,1,1,1,1,1,1,1] now ... need to do extract min operation n number of times which would give nlogn time? Plz Clear my doubt https://gateoverflow.in/1110/gate2003-23
My question is in Question like find 5th Smallest element in a heap:It requires O(logn) time if we do only Delete operation 5 Times.But what if the array contains no 5th ...
800
views
commented
Feb 18, 2018
Algorithms
binary-heap
algorithms
+
–
1
answer
27
Binary Tree
I have doubt when its asked to know number of labelled and unlabelled binary tree : For labelled = (On basis of labelling) T(n) = 2nCn/(n+1) * n! For unlabelled = (On Basis of Geometric Sturucture) T(n) = (2n)Cn/n+1 Right? What if its Asked for BST what will be the answer in both the above cases and Why?
I have doubt when its asked to know number of labelled and unlabelled binary tree :For labelled = (On basis of labelling)T(n) = 2nCn/(n+1) * n!For unlabelled = (On Basis ...
866
views
commented
Feb 17, 2018
DS
data-structures
binary-tree
+
–
4
answers
28
Kenneth Rosen Edition 7 Exercise 1.4 Question 5 (Page No. 53)
Let $P(x)$ be the statement “x spends more than five hours every weekday in class.” where the domain for x consists of all students. Express each of these qualifications in English. $\exists x P(x)$ $\forall x P(x)$ $\exists x \sim p(x)$ $\forall x \sim P(x)$
Let $P(x)$ be the statement “x spends more than five hours every weekday in class.” where the domain for x consists of all students. Express each of these qualificati...
4.7k
views
commented
Feb 13, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
+
–
0
answers
29
Prepration Strategy
Hello! I'm an MCA student and I'm looking forward to GATE-2020 Can someone tell me how should I start my preparation with college studies? How should I plan strategy? how should I manage study hours?etc.
Hello!I'm an MCA student and I'm looking forward to GATE-2020Can someone tell me how should I start my preparation with college studies?How should I plan strategy?how sho...
288
views
commented
Feb 13, 2018
5
answers
30
GATE CSE 1989 | Question: 14a
Symbolize the expression "Every mother loves her children" in predicate logic.
Symbolize the expression "Every mother loves her children" in predicate logic.
6.0k
views
commented
Feb 2, 2018
Mathematical Logic
gate1989
descriptive
first-order-logic
mathematical-logic
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register