Register
Filter

Questions by mystylecse

1 votes
2 answers
1
Barc exam cse cut off 2017
Anyone have any idea about barc online exam cut off 2017
Anyone have any idea about barc online exam cut off 2017
1 votes
1 answer
2
Intrigated PHD After B.Tech using Gate Score
Do any one have any idea about Integrated PHD and Mtech after B.Tech using gate score? Which Institute provide I-phd and how much gate score is needed? Please help ?
Do any one have any idea about Integrated PHD and Mtech after B.Tech using gate score? Which Institute provide I-phd and how much gate score is needed?Please help ?
2 votes
0 answers
3
Stack and Queue
Which of the following are true? s1: A stack can be implemented by two queue. s2: A queue can be implemented by two stack.
Which of the following are true?s1: A stack can be implemented by two queue.s2: A queue can be implemented by two stack.
3 votes
1 answer
4
Regular Exp
which of the following regular exp represetn the set of all string over{0,1} ending with 00 1. (0+1)*00+ 2. 00+(0+1)+ +00 3. Both
which of the following regular exp represetn the set of all string over{0,1} ending with 001. (0+1)*00+ 2. 00+(0+1)+ +00 3. Both
1 votes
0 answers
5
Pipelining
Mov R1,R2 : R1<--R2 Add R2,R3 : R2<--R2+R3 Sub R3,R4 : R3<--R3-R4 Mul R1,R4 : R1<--R1*R4 Div R3,R4 : R3<--R3/R4 The program consist x WAW , y RAW, Z WAR dependecies then the value of x+2y+z is ......
Mov R1,R2 : R1< R2Add R2,R3 : R2< R2+R3Sub R3,R4 : R3< R3-R4Mul R1,R4 : R1< R1*R4Div R3,R4 : R3< R3/R4The program consist x WAW , y RAW, Z WAR dependecies then the value ...
1 votes
0 answers
6
Instructions set
A m/c has 32 bit instruction and 10 bit address. There are two types of instrucitons exists in m/c. One address instruction and two address instruction . Suppose the max number of two address instructions are x and max number of one address instructions are y . Then x+y = ?
A m/c has 32 bit instruction and 10 bit address. There are two types of instrucitons exists in m/c. One address instruction and two address instruction . Suppose the max ...
5 votes
1 answer
7
Time Complexity
function(n){ val=0; for( i=1 to n) { if(n<=10000) for(j=1 to n) for(k=1 to n) val = val+1; else for( j=1 to n) val = val +1; } } what may be the time complexity of the function? Please reply.
function(n){ val=0; for( i=1 to n) { if(n<=10000) for(j=1 to n) for(k=1 to n) val = val+1; else for( j=1 to n) val = val +1; } }what may be the time complexity of the fu...
0 votes
1 answer
9
BST search
Identify the correct sequence for searching 105 in a binary search tree? a. 500,250,190,220,150,120,105 b. 80,800,500,90,270,280,105 c. 20,30,80,200,90,120,105 d. 30,50,80,200,90,120,105 Plz help me.
Identify the correct sequence for searching 105 in a binary search tree?a. 500,250,190,220,150,120,105b. 80,800,500,90,270,280,105c. 20,30,80,200,90,120,105d. 30,50,80,20...
0 votes
1 answer
10
Merge Sort
The best case time complexity to merge two sorted file of size m and n is A. O(m) B. O(n) C. O(MIN{m,n}) D. O(m+n)
The best case time complexity to merge two sorted file of size m and n isA. O(m) B. O(n) C. O(MIN{m,n}) D. O(m+n)
0 votes
1 answer
11
Time complexity
An unsorted list contain log(n) (base 2) distinct elements. The time complexity to find an element in this list that is neither maximum nor minimum is?
An unsorted list contain log(n) (base 2) distinct elements. The time complexity to find an element in this list that is neither maximum nor minimum is?
0 votes
1 answer
12
No of BST
The number of distinct BSTs that can be drawn having the same inorder traversal of tree as 6,12,20,32,45 are........
The number of distinct BSTs that can be drawn having the same inorder traversal of tree as 6,12,20,32,45 are........
0 votes
1 answer
13
Prime Implicant
In getting the minimal expression for the function f(A,B,C,D) = sum(1,5,6,7,11,12,13,15) which of the following is no a prime implicant? A. ABC' (B). A'C'D (C) BD (D) A'BD
In getting the minimal expression for the function f(A,B,C,D) = sum(1,5,6,7,11,12,13,15) which of the following is no a prime implicant?A. ABC' (B). A'C'D (C) BD (D) ...
0 votes
1 answer
14
pipelining
Consider an instruction pipe containing 4 stages as follows: FI=100NS DI=150NS EI=300 NS WO=200 NS 1O instructions are exexuted in a pipe lining system. What is the speed up factor?
Consider an instruction pipe containing 4 stages as follows:FI=100NSDI=150NSEI=300 NSWO=200 NS1O instructions are exexuted in a pipe lining system. What is the speed up f...
0 votes
1 answer
15
4-way -tree
A full quaternary tree is a tree with every node having 0 or 4 children and all leafs are at same level. If there are n leaf nodes in a full quaternary tree at height h then how many node are present in the tree (root node a height 0)?(consider root as internal node) A.(n-1)/2 B. (n-1)/3 C. (n-1)/4 D. (n-1)/5
A full quaternary tree is a tree with every node having 0 or 4 children and all leafs are at same level. If there are n leaf nodes in a full quaternary tree at height h t...
0 votes
2 answers
16
Function
How many onto function are there from a set with 5 element to a set with 4 elements? A. 340 B. 240 C. 440 D. 540
How many onto function are there from a set with 5 element to a set with 4 elements?A. 340 B. 240 C. 440 D. 540
2 votes
2 answers
17
go-back-n
If sender window size is 75 and we are using Go back -N protocol then what will be sequence number required and what is the value of N? A. 0 to 75 and 76 B. 0 to 74 and 75 C. 0 to 75 and 74 D. 0 to 74 and 76
If sender window size is 75 and we are using Go back -N protocol then what will be sequence number required and what is the value of N?A. 0 to 75 and 76 B. 0 to 74 a...
0 votes
0 answers
18
Expectation
Let A[1:n] be an array such that A[i]=i . An algorithm randomly permutes the elements of A, call the resulting array A' . Let X denote the number of location such that A'[i]=i. What is expectation of X?
Let A[1:n] be an array such that A[i]=i . An algorithm randomly permutes the elements of A, call the resulting array A' . Let X denote the number of location such that A'...
1 votes
1 answer
19
set theory
How many minimum number must be chosen from a set {1,2,3,...8} such that at least 2 of them must have sum=9?
How many minimum number must be chosen from a set {1,2,3,...8} such that at least 2 of them must have sum=9?
Page: