All Questions

14 Questions

0

Votes

0

Replies
Equivalance realtion
how to find the #Equicalance realtion possible in some given set.?

0

Votes

0

Replies
questions on Digital test
1.)what is the max number of bits required to represent (273)base8 in Binary? Team,iam not able to understand how the answer given for the above question is 9 bits. (273)Base8 ----> (187)Base 10. 187 as a number lies between 2^7(128) and 2^8(256) as the question asks for max shouldn't the number of bits be 8 (or) am i understanding the question wrong.... 2.)what is the Max value represented by a 5 digit number with base 7? Ans.) (ABCDE)base7 the values each of A,B,C,D,E can take is with in 0 to 6 as we want max hence all the five must be (66666)Base7 but given answer is (16806)Base7 where value of c is not with in (0-6) how is 16806 a valid number under Base7

1

Votes

0

Replies
operating system
The CDC 6600 computers could handle up to 10 I/O processes simultaneously using an interesting form of round-robin scheduling called processor sharing. A process switch occurred after each instruction, so instruction 1 came from process 1, instruction 2 came from process 2, etc. The process switching was done by special hardware, and the overhead was zero. If a process needed T sec to complete in the absence of competition, how much time would it need if processor sharing was used with n processes?

0

Votes

0

Replies
c programing
int incr (int i) { static int count = 0; count = count + i; return (count); } main () { int i, j; for (i = 0; i <= 4; i++) j = incr (i); }

0

Votes

0

Replies
EMAT in case of Page fault
As per GALVIN, To calculate Effective memory access time in case of page fault we used: EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time) My doubt is: In case of NO PAGE FAULT, why we considered only one memory access time . Why not TWO memory accesses, one for page table + one for accessing actual byte. ? That is: Why not this formula: EMAT= page fault rate*(page fault service time) + (1-page fault rate)* (2 * memory access time)

0

Votes

10

Replies
Digital Logic
what is the minimal expression of (x + x y^ + x y ^ z) ?

0

Votes

0

Replies
Memory management operating system
Locality of reference implies that the page reference being made by a process A) will always be to the page used in the previous page reference B) is likely to be to one of the pages used in the last few page references C) will always be to one of the pages existing in memory D) will always lead to a page fault

1

Votes

3

Replies
Locality of reference
Locality of reference implies that the page reference being made by a process A) will always be to the page used in the previous page reference B) is likely to be to one of the pages used in the last few page references C) will always be to one of the pages existing in memory D) will always lead to a page fault

3

Votes

6

Replies
ALGORITHM
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort? A) O(n) B) O(n Log n) C) O(n2) D) O(n!)

0

Votes

3

Replies
ALGORITHM
In a permutation a1.....an of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai > aj. What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of 1.....n with at most n inversions? A) ? (n2) B) ? (n log n) C) ? (n1.5) D) ? (n)

0

Votes

7

Replies
ALGORITHM
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false? A) Every minimum spanning tree of G must contain emin B) If emax is in a minimum spanning tree, then its removal must disconnect G C) No minimum spanning tree contains emax D) G has a unique minimum spanning tree

0

Votes

0

Replies
ALGORITHM
Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman code for the letter a, b, c, d, e, f?

2

Votes

0

Replies
ALGORITHM
Let T(n) be the function defined by T(1)= 1, T(n)= 2T (?n/2?) + ?n for n?2. Which of the following statement(s) is true? a. T(n) = O(?n) b. T(n) = O(n) c. T(n) = O(log n) d. None of the above

0

Votes

0

Replies
ALGORITHM
The time complexity of the following C function is (assume n > 0) int recursive (mt n) { if (n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }

"The Forum is to encourage students discussions. If you expect our mentors to resolve your doubts/queries please reach out to us by posting comments under the video lectures or sending us a mail on gatecse@appliedcourse.com. Our mentors will get back to you in 3-4 working hours."
(187)Base 10. 187 as a number lies between 2^7(128) and 2^8(256) as the question asks for max shouldn't the number of bits be 8 (or) am i understanding the question wrong.... 2.)what is the Max value represented by a 5 digit number with base 7? Ans.) (ABCDE)base7 the values each of A,B,C,D,E can take is with in 0 to 6 as we want max hence all the five must be (66666)Base7 but given answer is (16806)Base7 where value of c is not with in (0-6) how is 16806 a valid number under Base7 comment Posted On: Sep 23, 2019 15:43 PM
-->
© 2019 - All rights are reserved- AAIC Technologies pvt ltd