0 votes
3 answers
2
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); } ...
0 votes
5 answers
3
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$
0 votes
1 answer
5
which one true1. Determining whether context-free grammar is un-decidable2. Whether a given grammar is context-free is decidable
0 votes
0 answers
6
1 votes
2 answers
7
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
1 votes
1 answer
8
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$
0 votes
1 answer
10
what is the average-case time complexity for finding the height of the Binary tree.
0 votes
0 answers
11
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...
0 votes
4 answers
12
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.
0 votes
0 answers
13
$\int_{0}^{1}\tan^{-1} (1-\frac{1}{x})$ d(x) find
0 votes
2 answers
14
Is intersction of two languages is also a language of the same type? RE AND RECwhich languages is decidable and un undecidable
0 votes
0 answers
15
0 votes
2 answers
16
A simple regular graph n vertices and 24 edges, find all possible values of n.
0 votes
1 answer
17
maximum and minimum height of the avl tree with 42 node
0 votes
1 answer
18
formule for1.number of binary tree2.number of binary search tree3.number labeled binary tree4.number of unlabeled binary tree
0 votes
0 answers
19
0 votes
0 answers
20
L={${a^{n}b^{n}ca^{n}b^{n}| n>=0}$}L={${a^{n}b^{m}ca^{n}b^{m}| n>=0},m>=0$}