Recent questions

0 votes

0 answers

1

ME TEST
How is g(x) is many one ?

asked 3 minutes ago in Set Theory & Algebra by junaid ahmad Loyal (9.2k points) | 2 views

0 votes

0 answers

2

ACE Test Series

asked 38 minutes ago in Databases by ben10 (393 points) | 12 views

0 votes

0 answers

3

ER Diagram
How 1:1 cardinality with total participation of atleast 1 entity needs min no. of tables = 1 ? 1:1 with partial participation of both entities needs min no of tables = 2?

asked 38 minutes ago in Databases by Shamim Ahmed Active (1.1k points) | 6 views

0 votes

0 answers

4

Binomial distribution
Is there any relation between MEAN, VARIANCE and MODE for binomial distribution? Let, Mean = 8, variance = 6 for any binomial distribution. np = 8 and npq = 6 => q=$3/4$, p=$1/4$ Now is there any relation to find value of MODE ?

asked 1 hour ago in Mathematical Logic by shreyansh jain Active (1.1k points) | 7 views

0 votes

0 answers

5

gatebook test
Suppose the functions F and G can be computed in 8 and 3 nanoseconds by functional units UF and UG, respectively. Given three instances of UF and three instances of UG, it is required to implement the computation F(G(Xi)) for 1 ≤ i ≤ 13. A control Unit selects next task/s ... this computation is ( in nanoseconds): (A) 28 (B) 33 (C) 43 (D) 49 my answer is 43 but gatebook answer is 49.

asked 1 hour ago in CO & Architecture by sushmita Boss (15.5k points) | 10 views

0 votes

0 answers

6

gatebook COA test
Consider a program being run on a processor. A modification in processor design caused 30% of the program to speed up by ten times while three fourth of the remaining program has a speed up of 80 and 40% of the remaining part of the program performs poorer ... by 50%. The remaining program has a speedup of 1. The overall speedup of the program exact to two decimal places is:-

asked 1 hour ago in CO & Architecture by sushmita Boss (15.5k points) | 9 views

0 votes

1 answer

7

Pipeline
A pipelined Processor contains 5 instructions stages of execution times 120ns, 160ns, 105 ns, 135ns and 155ns with a register delay 10ns on each stage. What is the percentage of performance increased with 1000 instructions instead of 10 instructions

asked 2 hours ago in CO & Architecture by aditi19 Active (2.2k points) | 31 views

0 votes

0 answers

8

ACE Test Series
[closed]

asked 2 hours ago in Algorithms by ben10 (393 points) | 8 views

0 votes

0 answers

9

Direct Mapping and set associative Mapping

asked 2 hours ago in CO & Architecture by Shaik Masthan Boss (43.1k points) | 34 views

0 votes

0 answers

10

ME Test Series
Consider the following keys that are hashed into the hash table in the order given using the hash function $H(i) = (3i + 5) \ mod \ 11 $ 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 Where to handle the collision chaining is used, after ... all the above keys in table if 2 new keys inserted into table the what is the probability new items hashed into empty slot, (upto 2 decimal places)

asked 3 hours ago in DS by Shadan Karim (381 points) | 16 views

+1 vote

1 answer

11

How to solve such question
$ \quad \begin{bmatrix} 3 & 7.5 \\ -6 & 4.5 \end{bmatrix} \quad \begin{bmatrix} x \\y \end{bmatrix} \quad = \begin{bmatrix} 6 \\ -90 \end{bmatrix} \quad $ which of the following represent the solution of the system of ... 2, 3 Please enumerate the steps to solve this problem as I am looking for a procedure and want to learn this topic from this question possibly.

asked 3 hours ago in Linear Algebra by `JEET Active (2.3k points) | 22 views

0 votes

0 answers

12

ACE PreGate vs Made Easy CBT
I only want to appear for one Centre-based mock. I am in a dilemma between Ace PreGate vs Made Easy CBT2. Could anyone please help me decide?

asked 3 hours ago in GATE by dan31 (289 points) | 15 views

0 votes

1 answer

13

Gateforum Class Notes
Suppose we have a BST and we run a program on the BST with n leaf nodes and compute the value of a function $g(x)$ for each node in BST. If the cost of computing $g(x)$ is minimum of number of leaf node in left subtree and number of leaf node in right subtree. The worst case time complexity of the program is: $O(n)$ $O(nlog_2n)$ $O(n^2)^2$ $O(n^2log_2n)$

asked 4 hours ago in DS by Gupta731 Active (3k points) | 26 views

+1 vote

3 answers

14

TIFR2019-A-1

asked 4 hours ago in Others by Arjun Veteran (370k points) | 78 views

+1 vote

1 answer

15

TIFR2019-A-2

asked 4 hours ago in Others by Arjun Veteran (370k points) | 61 views

+1 vote

1 answer

16

TIFR2019-A-3

asked 4 hours ago in Others by Arjun Veteran (370k points) | 133 views

+1 vote

1 answer

17

TIFR2019-A-4

asked 4 hours ago in Others by Arjun Veteran (370k points) | 76 views

0 votes

2 answers

18

TIFR2019-A-5

asked 4 hours ago in Others by Arjun Veteran (370k points) | 82 views

0 votes

0 answers

19

TIFR2019-A-6

asked 4 hours ago in Others by Arjun Veteran (370k points) | 46 views

0 votes

1 answer

20

TIFR2019-A-7

asked 4 hours ago in Others by Arjun Veteran (370k points) | 47 views

0 votes

0 answers

21

TIFR2019-A-8

asked 4 hours ago in Others by Arjun Veteran (370k points) | 69 views

0 votes

0 answers

22

TIFR2019-A-9

asked 4 hours ago in Others by Arjun Veteran (370k points) | 31 views

0 votes

0 answers

23

TIFR2019-A-10

asked 4 hours ago in Others by Arjun Veteran (370k points) | 41 views

0 votes

1 answer

24

TIFR2019-A-11

asked 4 hours ago in Others by Arjun Veteran (370k points) | 64 views

0 votes

0 answers

25

TIFR2019-A-12

asked 4 hours ago in Others by Arjun Veteran (370k points) | 22 views

0 votes

0 answers

26

TIFR2019-A-13

asked 4 hours ago in Others by Arjun Veteran (370k points) | 21 views

0 votes

0 answers

27

TIFR2019-A-14

asked 4 hours ago in Others by Arjun Veteran (370k points) | 30 views

+2 votes

0 answers

28

TIFR2019-A-15

asked 4 hours ago in Others by Arjun Veteran (370k points) | 21 views

0 votes

1 answer

29

TIFR2019-B-1

asked 4 hours ago in Others by Arjun Veteran (370k points) | 40 views

+1 vote

1 answer

30

TIFR2019-B-2

asked 4 hours ago in Others by Arjun Veteran (370k points) | 49 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions

Recent Posts

Recent Blog Comments