Dark Mode

Questions by shaz

2 votes

0 answers

1

the number of digits in 2^64
If log 2= 0.30103, the number of digits in 2^64 is : a.18 b.19 c.20 d.21

asked in Quantitative Aptitude Feb 23, 2019

2.4k views

2 votes

1 answer

2

2018 PGEE SAMPLE Paper : Q4
All shirts are T-shirts with buttons. No yellow T-shirt has buttons. No shirt is yellow. If the first two statements are true, the third statement is (A) True (B) False (C) Uncertain

asked in Analytical Aptitude Feb 20, 2019

1.9k views

0 votes

1 answer

3

2018_pgee_sample question 1
Three cards are chosen at random from a pack of 52 cards. In how many ways this can be done if all the three cards are of different types? (A) 4 × 13^3 (B) 13 × 12 × 11 (C) 53C13 (D) (3 × 13) / (12 × 11)

asked in Quantitative Aptitude Feb 20, 2019

2.1k views

1 vote

1 answer

4

Letters in boxes - combinations
Q .) The number of ways can 5 letter be put in 3 boxes A, B,C such that A has at least 2 letters. My approach: Number of ways to choose 2 letters out of 5 is 5C2. And for each such combination the remaining 3 letter have 3 choice. Therefore 5C2 * 3^3, but this is incorrect. Please point out the fault in my understanding and also the correct way to solve it

asked in Combinatory Jan 31, 2019

587 views

3 votes

1 answer

5

MadeEasy CBT Test 2019: Operating System - Process Syncronization
Consider the below code for synchronizing the classical readers and writers. int rc = 0; int c = 0; Semaphore mutex =1; Semaphore db =1; void Reader(void) { L1: down (mutex): if (c ! = 0 && rc! = 0) { up ... the database at the same time. c) more than one writers can access the database at the same time. d) None of these.

asked in Operating System Jan 16, 2019

790 views

0 votes

0 answers

6

No of subsequence
I understand that number of subsequences for a string of length n is 2^n when we don’t have any repetition. What is the number of “unique” subsequence when we have repetitions. As in the string : aabbbccddd

asked in Algorithms Jan 8, 2019

818 views

0 votes

0 answers

7

MadeEasy Full Length Test: Combinatory - Recurrence
What’s the trick to do it under 2 min here?

asked in Combinatory Dec 31, 2018

1.2k views

0 votes

2 answers

8

AAI JE (IT) 2018 - Q74
How are 2 memory access required here? Only R3 contains a memory address which will be accessed for the operand.

asked in CO and Architecture Dec 13, 2018

711 views

0 votes

0 answers

9

++ operator
#include<stdio.h> int main() { int i = 5; int a = ++i + ++i + ++i + ++i; printf("%d",a); return 0; } How is the output 31? and not 30? Shouldn’t it be 6+7+8+9?

asked in Programming in C Dec 13, 2018

373 views

0 votes

0 answers

10

Self doubt- why isn't -ve int converted to 2's complement when storing in unsigned int.
How is the output still -4? when we are storing it in an unsigned int here shouldn’t it be converted to 2’s complement and then the absolute value of it be the result? int main() { unsigned int num = -4; printf("%d", num); return 0; }

asked in Programming in C Dec 13, 2018

317 views

1 vote

1 answer

11

AAI JE (IT) 2019 Q-30
Can someone solve this and tell how it’s 160.

asked in Combinatory Dec 12, 2018

293 views

1 vote

1 answer

12

Floating Point Arithmetic - Stallings 7th edition Question - 9.22
Assume that the exponent e is constrained to lie in the range 0 <= e <= X with a bias of q, that the base is b, and that the significand is p digits in length. a. What are the largest and ... that can be written? b. What are the largest and smallest positive values that can be written as normalized floating-point numbers?

asked in CO and Architecture Jul 23, 2018

1.0k views

0 votes

1 answer

13

BCD SUM CORRECTION
Q) Let the binary sum after BCD addition is stored in K, Z8, Z4, Z2, and Z1. Then the condition for a correction and output carry can be expressed as C = A) K + Z8 Z4 + Z8 Z2 B) K + Z8 Z4 + Z4 Z2 C) K + Z8 Z2 + Z8 Z1 D) K + Z4 Z2 + Z2 Z1

asked in CO and Architecture Jul 22, 2018

1.4k views