Given the set of keys ( 40, 80, 35, 90, 45, 50, 70 ), which
Given the set of keys ( 40, 80, 35, 90, 45, 50, 70 ), which of the following represents a heap ? ( Each pair of parentheses indicate nodes at one level, left child first)
Given the set of keys ( 40, 80, 35, 90, 45, 50, 70 ), which of the following represents a heap ? ( Each pair of parentheses indicate nodes at one level, left child first)
Engineering Mathematics, Mathematical Logic, PGCET CSE Exam (Karnataka) 2011, Solved, Technical Aptitude
Which of the following respectively represent commutative law, associative law and distributive law ?
Akilesh Kharvi ? Dec 8 '2016 at 19:23
Answer: III, I, II
Explanation:
1. a+b= b+a Commutative Law of Addition
2. (a + b)+c =a+ (b + c) Associative Law of Addition
3. a(b + c) = a • b+a • c Distributive Law
4. ab= ba Commutative Law of Multiplication
5. (ab)c = a(bc) Associative Law of Multiplication
6. a+0 = 0 +a =a Zero Property
Match the implementations of Table X with the addressing modes of Table Y :
Look at the logic circuit below :
Match List-X with List-Y :
Which of the following statements is false ?
Nithin K ? Dec 7 '2016 at 23:23
Answer: Packct switching results in less variation in delay than circuit switching
Explanation:
Packet-switched networks move data in separate, small packets — based on the destination address in each packet. When received, packets are reassembled in the proper sequence to make up the message.
Packet swiching, delay variation is more because of the store and forward mechanism.
The basic principle behind timing attacks on networks is
Nithin K ? Dec 7 '2016 at 23:21
Answer: to guess from the time taken to decrypt the message
Explanation:
In cryptography, a timing attack is a side channel attack in which the attacker attempts to compromise a cryptosystem by analyzing the time taken to execute cryptographic algorithms.
This method allows extraction of an algorithm’s secret, such as a master key, if the algorithm’s execution time depends on a user input and this secret.