Monoalphabetic Substitution Cipher: It also known as substitution cipher. Replacement of alphabets or digits are fixed for each letter. For example: Plain text : nikhilarora Cipher text: OJLIMBSPSB In the above example, the value of ‘a’ is fixed for every time as ‘B’ and every alphabet is fixed for separate […]
Basic Terms to be used : plaintext – It is a kind of original message ciphertext – It is a type of coded message cipher – An algorithm to be performed for transforming plaintext/ciphertext. key – The information used in cipher known only to sender and receiver. encipher (encrypt) – […]
we will discuss this topic with help of one question asked in CBSE NET JAN 2017 PAPER 3 QUESTION: An analog signal has a bit rate of 8000 bps and a baud rate of 1000. Then analog signal has ………….. signal elements and carry ………… data elements in each signal. […]
This question asked in JAN 2017 PAPER 3 Question 28: In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is …… (1) 2 bytes (2) 1 […]
Sliding Window: In sliding window method, Sender can sent multiple frames at a time before needing an acknowledgment from receiver’s side. The maximum window size for data transmission using the selective reject protocol with n-bit frame sequence numbers is 2^(n-1) The maximum window size for data transmission using the SR […]
Transportation problem is very well known problem which is asked in CBSE NET exam. Computer students are very worry about this subject because Operational research is not computer subject but simple trick can make your task easy. let’s see Transportation problem deals with supply of product is available and destinations […]
This question asked in june 2005 paper in UGC NET Question 5: Minimum number of individual shoes to be picked up from a dark room (containing 10 pair of shoes) if we have to get atleast one proper pair: Answer: firstly, write given data Which is present in the question. […]
Splay tree: Splay tree is very efficient tree . Splay Tree is like Binary Search Tree. It is also a self – adjusted tree in which every operation on an element rearrange the tree so that the element is placed at the root position of the tree. Splay tree operations take […]
1. Commutative Laws: For any two finite sets A and B; (i) A U B = B U A (ii) A ∩ B = B ∩ A 2. Associative Laws: For any three finite sets A, B and C; (i) (A U B) U C = A U (B U […]
This question asked in GATE 1997 subject: Electronics Q6. Given √(224)r= (13)r The value of the radix r is: (a) 10 (b) 8 (c) 5 (d) 6 ANSWER: Firstly , what is given in the question √(224)r= (13)r Squaring both […]
