Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
amit166
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by amit166
0
votes
0
answers
1
#cpcb
Two relations A and B are stored as clustered sequential files on disk. Each block on disk can hold 100 records of either A or B. The relation A contains 1000 records and B contains 500 records. There is a memory buffer to hold only 1 block of each relation. The number of block transfers required to complete a nested loop join operation on these two tables is at least (in integer) _________.
Two relations A and B are stored as clustered sequential files on disk. Each block on disk can hold 100 records of either A or B. The relation A contains 1000 records and...
222
views
asked
Jun 30, 2023
Databases
databases
+
–
0
votes
3
answers
2
#CPCB
How many helloWorld lines are printed by the program: #include <stdio.h> #include <stdlib.h> void myFunc() { if (fork() == 0) { fork(); printf(“helloWorld\n”); exit(0); } return ; } int main(){ printf(“helloWorld\n”); myFunc(); printf(“helloWorld\n”); return 1; }
How many helloWorld lines are printed by the program:#include <stdio.h>#include <stdlib.h void myFunc(){ if (fork() == 0){ fork(); printf(“helloWorld\n”); exit(0); } ...
538
views
asked
Jun 30, 2023
Operating System
fork-system-call
+
–
0
votes
5
answers
3
#cpcb
Select the function(s) which is/are $O(n log n)$: $2n\log n+3n$ $10n\log n^2$ $1+\sqrt n$ $2n^2-3n$
Select the function(s) which is/are $O(n log n)$:$2n\log n+3n$$10n\log n^2$$1+\sqrt n$$2n^2-3n$
465
views
asked
Jun 30, 2023
Algorithms
algorithms
asymptotic-notation
+
–
0
votes
0
answers
4
#TIFR
Consider the language $L = \{a^i \$ a^j \$ b^k \$ | k ⩽ max(i, j), i, j, k ≥ 0\}$ over the alphabet $\sum = \{a, b, \$ \}$. The complement of the language L, that is, $\sum^* - \text{ L}$ is denoted by $L'$. Which of the following is ... d) $L$ is a context-free language and $L'$ is not a context-free language. (e) Neither is $L$ a context-free language nor is $L'$ a context-free language.
Consider the language $L = \{a^i \$ a^j \$ b^k \$ | k ⩽ max(i, j), i, j, k ≥ 0\}$ over the alphabet $\sum = \{a, b, \$ \}$. The complement of the language L, that is,...
351
views
asked
Feb 13, 2023
Theory of Computation
theory-of-computation
regular-language
context-free-language
+
–
0
votes
1
answer
5
#gate questions
which one true 1. Determining whether context-free grammar is un-decidable 2. Whether a given grammar is context-free is decidable
which one true1. Determining whether context-free grammar is un-decidable2. Whether a given grammar is context-free is decidable
340
views
asked
Jan 28, 2023
Theory of Computation
decidability
+
–
0
votes
0
answers
6
#testbook
238
views
asked
Jan 19, 2023
Computer Networks
testbook-test-series
+
–
1
votes
2
answers
7
#ACE acedmy test series
In a host size for PDU of network layer is 17076 bytes, MTU size for that network is 200 bytes and IPv4 header size is 20 bytes .find number of IP fragments
In a host size for PDU of network layer is 17076 bytes, MTU size for that network is 200 bytes and IPv4 header size is 20 bytes .find number of IP fragments
465
views
asked
Jan 5, 2023
Computer Networks
computer-networks
network-layer
ip-addressing
ace-test-series
+
–
1
votes
1
answer
8
#testbook
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
283
views
asked
Jan 5, 2023
Algorithms
testbook-test-series
+
–
0
votes
0
answers
9
#RPSC LECT.2011
A 2-byte data $d_{15}d_{14}...........d_{2}d_{1}d_{0}$ is transmitted from A to B .here d$_{0}$ represent LSB. if the transmitted value is 1947 and the received value is 1663, bits in error are. .$d_{7}d_{4}d_{3}d_{2}$ $d_{8}d_{5}d_{4}d_{2}$ $d_{7}d_{5}d_{3}d_{2}$ insufficient data to inter correct results.
A 2-byte data $d_{15}d_{14}...........d_{2}d_{1}d_{0}$ is transmitted from A to B .here d$_{0}$ represent LSB. if the transmitted value is 1947 and the received value is...
232
views
asked
Jan 2, 2023
Digital Logic
digital-circuits
+
–
0
votes
1
answer
10
uppcl 2021
what is the average-case time complexity for finding the height of the Binary tree.
what is the average-case time complexity for finding the height of the Binary tree.
591
views
asked
Jun 1, 2022
Programming in C
data-structures
binary-tree
time-complexity
+
–
0
votes
0
answers
11
#unversity exam
If there are ‘n’ processes in a system, with the time-quanta less than the CPU burst times of all these processes in a given round, then the number of preemptions is at least: (A) 2n (B) n (C) 2n–1 (D) n–1
If there are ‘n’ processes in a system, with the time-quanta less than the CPU burst times of allthese processes in a given round, then the number of preemptions is a...
319
views
asked
Jan 9, 2022
Operating System
operating-system
+
–
0
votes
4
answers
12
#university exam
What will be the complexity of merging two circular single linked list? You can consider the sizes of the linked lists are n1 and n2, respectively.
What will be the complexity of merging two circular single linked list? You can consider the sizes of the linked lists are n1 and n2, respectively.
484
views
asked
Jan 9, 2022
DS
linked-list
+
–
0
votes
0
answers
13
math book
$\int_{0}^{1}\tan^{-1} (1-\frac{1}{x})$ d(x) find
$\int_{0}^{1}\tan^{-1} (1-\frac{1}{x})$ d(x) find
329
views
asked
Sep 25, 2021
Calculus
integration
+
–
0
votes
2
answers
14
#automata
Is intersction of two languages is also a language of the same type? RE AND REC which languages is decidable and un undecidable
Is intersction of two languages is also a language of the same type? RE AND RECwhich languages is decidable and un undecidable
260
views
asked
Jan 31, 2019
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
15
#math
264
views
asked
Jan 30, 2019
Linear Algebra
engineering-mathematics
+
–
0
votes
2
answers
16
#GRAPH THEORY
A simple regular graph n vertices and 24 edges, find all possible values of n.
A simple regular graph n vertices and 24 edges, find all possible values of n.
2.6k
views
asked
Jan 29, 2019
Graph Theory
graph-theory
+
–
0
votes
1
answer
17
#avl tree
maximum and minimum height of the avl tree with 42 node
maximum and minimum height of the avl tree with 42 node
292
views
asked
Jan 27, 2019
0
votes
1
answer
18
#tree
formule for 1.number of binary tree 2.number of binary search tree 3.number labeled binary tree 4.number of unlabeled binary tree
formule for1.number of binary tree2.number of binary search tree3.number labeled binary tree4.number of unlabeled binary tree
176
views
asked
Jan 27, 2019
0
votes
0
answers
19
#india
138
views
asked
Jan 26, 2019
0
votes
0
answers
20
#AUTOMATA
L={${a^{n}b^{n}ca^{n}b^{n}| n>=0}$} L={${a^{n}b^{m}ca^{n}b^{m}| n>=0},m>=0$}
L={${a^{n}b^{n}ca^{n}b^{n}| n>=0}$}L={${a^{n}b^{m}ca^{n}b^{m}| n>=0},m>=0$}
349
views
asked
Jan 20, 2019
Theory of Computation
theory-of-computation
+
–
Page:
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register