Questions by balchandar reddy san

0 votes

1 answer

1

Gate 2002 - ME
Which of the following functions is not differentiable in the domain $[-1,1]$ ? (a) $f(x) = x^2$ (b) $f(x) = x-1$ (c) $f(x) = 2$ (d) $f(x) = Maximum (x,-x)$

asked May 4 in Calculus | 79 views

0 votes

0 answers

2

IITG MTech DataScience
Did anyone receive call letter from IITG Datascience for Written test, the shortlist was announced and it is informed that call letter will be sent by 26th apr 12PM...anyone have any info?

asked Apr 27 in Written Exam | 133 views

0 votes

0 answers

3

BITS HD Exam Slot Query
The exam date for ME CSE is on 15th and 26th may, the slot booking will open on 4th may. My query is that whether slots for ME CSE will be there on both the dates (15th & 26th may) or only on any one particular day?

asked Apr 26 in Written Exam | 119 views

0 votes

1 answer

4

ME Mock 4
Consider a new sorting algorithm similar to the BubbleSort algorithm, called RumbleSort. Given an array as input, RumbleSort attempts to sort the array and produces a sorted array as output. Here's the pseudo-code for RumbleSort. With regards to the above RumbleSort ... algorithm will work correctly for a given input is $\mathcal Ο(n^2)$ Which of the above statements is/are true?

asked Jan 30 in Algorithms | 200 views

0 votes

0 answers

5

ME FLT5
Consider the following POSETs: Which of the above POSETs are isomorphic to (P (S), ⊆), where S = {a, b, c}?

asked Jan 30 in Set Theory & Algebra | 72 views

+1 vote

2 answers

6

ME FLT2
AVL tree is constructed by inserting the keys 2, 6, 1, 5, 3, 4, 7 in the given order. (Assume the tree is initially empty). Then the level order traversal of the above binary tree will be.. Answer given is: 3,2,5,1,4,6,7

asked Jan 28 in Programming | 77 views

0 votes

0 answers

7

ME FLT
Consider the following statements with respect to POSETs. I. Every non empty, finite POSET has at least one maximal and at least one minimal element. II. Every POSET has at most one greatest element and at most one least element. Which of the above statement(s) is/are true?

asked Jan 25 in Mathematical Logic | 32 views

0 votes

1 answer

8

CAO ME
Consider a pipeline processor with 5 stages, Instruction Fetch (IF). Instruction Decode and Operand Fetch (ID), Operation performed (OP). Data memory access (MA) and Write back (WB). The IF, ID, MA and WB stages takes 1 clock cycle each ... for MUL instruction. The minimum number of clock cycles are needed to complete following sequence of instruction if operand forwarding is used ________.

asked Jan 20 in CO and Architecture | 42 views

0 votes

0 answers

9

ME C programming
Let X be the number of times the comparison inside the while loop (i.e. m <= n ) is performed, when mystery(127, 255) is called. Then the value of X is, 125 65 64 66

asked Jan 20 in Programming | 88 views

0 votes

1 answer

10

Compiler Design
Type of ERROR

asked Jan 19 in Compiler Design | 91 views

0 votes

2 answers

11

ACE - Theory of computation
Regularity check

asked Jan 19 in Theory of Computation | 41 views

0 votes

1 answer

12

ME mock1
Consider a binary tree, where for every node P – Q ≤ 2, where P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such a binary tree of height h =4 will be 6 8 9 None of these

asked Jan 19 in Algorithms | 33 views

0 votes

0 answers

13

ME mock 1
In an enhanced CPU, the speed of a floating point operations has been increased by 30% and the speed of a fixed point operations has been increased by 20%. In the original design floating point operations used to take twice the time compared to fixed point ... number of floating point instructions to the number of fixed point instructions is 2 : 3 is ________. (Upto 2 decimal places)

asked Jan 19 in CO and Architecture | 48 views

0 votes

0 answers

14

ACE - OS
Operating systems: which of the following scenarios guarantees deadlock free execution?

asked Jan 18 in Operating System | 96 views

0 votes

0 answers

15

Made Easy Single Subject Test
A grammar that has no epsilon productions and also free from unit productions. The maximum number of reduce moves that can be taken during bottom-up evaluation of 25 token string by performing bottom-up parsers is _______

asked Jan 17 in Compiler Design | 57 views

0 votes

0 answers

16

Gate-2019
ER- no of tables?

asked Jan 10 in Databases | 136 views

0 votes

0 answers

17

Gate-2000
A relation R is defined on the set of integers as xRy iff (x+y) is even. Which of the following statements is true? A R is not an equivalence relation B R is an equivalence relation having 1 equivalence class C R is an equivalence relation having 2 equivalence classes D R is an equivalence relation having 3 equivalence classes Engineering Mathematics Sets and Relations

asked Jan 10 in Mathematical Logic | 55 views

0 votes

0 answers

18

ACE -19
Number of ER tables?

asked Jan 9 in Databases | 50 views

0 votes

1 answer

19

ACE 2019
Normal forms

asked Jan 9 in Databases | 39 views

0 votes

1 answer

20

Ace 2019
Dependency preserving/Lossless ?

asked Jan 9 in Databases | 87 views

0 votes

0 answers

21

Ace 2019
what does putchar(x&m) does in the question?

asked Jan 5 in Programming | 54 views