A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table: using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table: 

image

using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

by

1 Answer

Answer :

(D) 2,24,000 bits 
by

Related questions

Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Description : Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Last Answer : (C) 76/30

A device is sending out data at the rate of 2000 bps. How long does it take to send a file of 1,00,000 characters ? (A) 50 (B) 200 (C) 400 (D) 800

Description : A device is sending out data at the rate of 2000 bps. How long does it take to send a file of 1,00,000 characters ? (A) 50 (B) 200 (C) 400 (D) 800

Last Answer : (C) 400 Explanation: 1,00,000 characters = 1,00,000 x 8 bits = 8,00,000 bits 8,00,000 bits/2000 bps = 400 seconds

Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Description : Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Last Answer : (B) 1.75 bits per symbol

The basic idea behind Huffman coding is to A. compress data by using fewer bits to encode fewer frequently occuring characters B. compress data by using fewer bits to encode more frequently occuring characters C. compress data by using more bits to encode more frequently occuring characters D. expand data by using fewer bits to encode more frequently occuring characters

Description : The basic idea behind Huffman coding is to A. compress data by using fewer bits to encode fewer frequently occuring characters B. compress data by using fewer bits to encode more ... frequently occuring characters D. expand data by using fewer bits to encode more frequently occuring characters

Last Answer : B. compress data by using fewer bits to encode more frequently occuring characters

The basic idea behind Huffman coding is to a. compress data by using fewer bits to encode fewer frequently occuring characters b. compress data by using fewer bits to encode more frequently occuring characters c. compress data by using more bits to encode more frequently occuring characters d. expand data by using fewer bits to encode more frequently occuring characters

Description : The basic idea behind Huffman coding is to a. compress data by using fewer bits to encode fewer frequently occuring characters b. compress data by using fewer bits to encode more ... frequently occuring characters d. expand data by using fewer bits to encode more frequently occuring characters

Last Answer : b. compress data by using fewer bits to encode more frequently occuring characters

An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are carried by each signal element ? (A) 0.336 bits/baud (B) 3 bits/baud (C) 120,00,000 bits/baud (D) None of the above

Description : An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are carried by each signal element ? (A) 0.336 bits/baud (B) 3 bits/baud (C) 120,00,000 bits/baud (D) None of the above

Last Answer : (B) 3 bits/baud

A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is A. 8.0 bit B. 2.0 bit C. 1.9 bit D. 2.1 bit

Description : A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is A. 8.0 bit B. 2.0 bit C. 1.9 bit D. 2.1 bit

Last Answer : C. 1.9 bit

A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is a. 8.0 bit b. 2.0 bit c. 1.9 bit d. 2.1 bit

Description : A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is a. 8.0 bit b. 2.0 bit c. 1.9 bit d. 2.1 bit

Last Answer : c. 1.9 bit

A Huffman encoder takes a set of characters with fixed length and produces a set of characters of A. fixed length B. constant length C. random length D. variable length

Description : A Huffman encoder takes a set of characters with fixed length and produces a set of characters of A. fixed length B. constant length C. random length D. variable length

Last Answer : D. variable length

How do you calculate the number of bits of a body of text in ASCII? A. Number of characters * 7 B. Number of characters (including spaces) *7 C. bits in Huffman * 7 D. bits in Huffman / 7

Description : How do you calculate the number of bits of a body of text in ASCII? A. Number of characters * 7 B. Number of characters (including spaces) *7 C. bits in Huffman * 7 D. bits in Huffman / 7

Last Answer : B. Number of characters (including spaces) *7

Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ................ (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Description : Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ... ...... (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Last Answer : Answer: Marks given to all

The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Description : The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Last Answer : (C) 16 bits Explanation: VirtualAddress = 32 bits PageSize = 4KB = 12 bits therefore : VPNTag = 20 bits, OffsetTag = 12 bits TLBEntryLength = VPNTag = 20 bits TotalTLBEntries = 64, 4-way implies ... therefore : TLBIndex = 4 bits TLBTag = TLBEntryLength - TLBIndex = 20 - 4 = 16 bits

The IEEE-754 double-precision format to represent floating point numbers, has a length of ........... bits. (A) 16 (B) 32 (C) 48 (D) 64

Description : The IEEE-754 double-precision format to represent floating point numbers, has a length of ........... bits. (A) 16 (B) 32 (C) 48 (D) 64

Last Answer : (D) 64

A device is sending out data at the rate of 2000 bps. How long does it take to send a file of 1,00,000 characters ? a. 50 b. 200 c. 400 d. 800

Description : A device is sending out data at the rate of 2000 bps. How long does it take to send a file of 1,00,000 characters ? a. 50 b. 200 c. 400 d. 800

Last Answer : c. 400

Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s.b. 2 c. 2.5 d. 5

Description : Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s. b. 2 c. 2.5 d. 5

Last Answer : b. 2

Which formula shows how to work out the percentage a file has been compressed by? A. bits in (Huffman *7) /100 B. bits in ASCii - bits in Huffman C. difference in bits / bits in ASCII * 100

Description : Which formula shows how to work out the percentage a file has been compressed by? A. bits in (Huffman *7) /100 B. bits in ASCii - bits in Huffman C. difference in bits / bits in ASCII * 100

Last Answer : C. difference in bits / bits in ASCII * 100

Given code word 1110001010 is to be transmitted with even parity check bit. The encoded word to be transmitted for this code is (A) 11100010101 (B) 11100010100 (C) 1110001010 (D) 111000101

Description : Given code word 1110001010 is to be transmitted with even parity check bit. The encoded word to be transmitted for this code is (A) 11100010101 (B) 11100010100 (C) 1110001010 (D) 111000101

Last Answer : (A) 11100010101 

A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Description : Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used ... and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Last Answer : (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.

The value of postfix expression: 8 3 4 + - 3 8 2 / + * 2 $ 3+ is (A) 17 (B) 131 (C) 64 (D) 52

Description : The value of postfix expression: 8 3 4 + - 3 8 2 / + * 2 $ 3+ is (A) 17 (B) 131 (C) 64 (D) 52

Last Answer : (D) 52

IPv4 and IPv6 are addresses used to identify computers on the internet. Find the correct statement out of the following: (A) Number of bits required for IPv4 address is more than number of bits required for IPv6 address. (B) Number of bits required for IPv4 address is same as number of bits required for IPv6 address. (C) Number of bits required for IPv4 address is less than number of bits required for IPv6 address. (D) Number of bits required for IPv4 address is 64.

Description : IPv4 and IPv6 are addresses used to identify computers on the internet. Find the correct statement out of the following: (A) Number of bits required for IPv4 address is more than number of bits required for ... of bits required for IPv6 address. (D) Number of bits required for IPv4 address is 64. 

Last Answer : (C) Number of bits required for IPv4 address is less than number of bits required for IPv6 address.

Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is assumed that each sample requires 8 bits? (A) 32 kbps (B) 64 kbps (C) 128 kbps (D) 256 kbps

Description : Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it ... sample requires 8 bits? (A) 32 kbps (B) 64 kbps (C) 128 kbps (D) 256 kbps

Last Answer : (C) 128 kbps

If link transmits 4000 frames per second and each slot has 8 bits, the transmission rate of circuit of this TDM is ............... (A) 64 Kbps (B) 32 Mbps (C) 32 Kbps (D) 64 Mbps

Description : If link transmits 4000 frames per second and each slot has 8 bits, the transmission rate of circuit of this TDM is ............... (A) 64 Kbps (B) 32 Mbps (C) 32 Kbps (D) 64 Mbps

Last Answer : (C) 32 Kbps

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Description : A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Last Answer : (3) 15 and 14

A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Description : A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Last Answer : Answer: D Explanation: in 1ms : refresh = 32 times Memory cycle = 1ms/250ns = 106ns/250ns = 4000 times Therefore, % of refresh time = (32 x 100ns)/(4000 x 250ns) = 3200ns/1000000 x 100% = 0.32%

River Alaknanda forms confluences (Prayags) in Uttrakhand. Match the codes given in Figure with Table (Prayags) and select the correct answer using the code given below. Figure Table (Pr ayags) D A L A K N A N D A C B A I. Karn Prayag II. Rudra Prayag III. Nand Prayag IV. Vishnu Prayag

Description : River Alaknanda forms confluences (Prayags) in Uttrakhand. Match the codes given in Figure with Table (Prayags) and select the correct answer using the code given below. Figure Table (Pr ayags) D A L A K N A N D A C B A I. Karn Prayag II. Rudra Prayag III. Nand Prayag IV. Vishnu Prayag

Last Answer : (1) A-II, B-I, C-III, D-IV

A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network ? (A) 2 Mbps (B) 60 Mbps (C) 120 Mbps (D) 10 Mbps

Description : A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network ? (A) 2 Mbps (B) 60 Mbps (C) 120 Mbps (D) 10 Mbps

Last Answer : (A) 2 Mbps Explanation: In data transmission, throughput is the amount of data moved successfully from one place to another in a given period of time, and typically measured in bits per second (bps), ... second (Mbps) or gigabits per second (Gbps). Here, Throughput = 15000 x 8000/60 = 2 Mbps 

A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network ? (A) 1 Mbps (B) 2 Mbps (C) 10 Mbps (D) 12 Mbps

Description : A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network ? (A) 1 Mbps (B) 2 Mbps (C) 10 Mbps (D) 12 Mbps

Last Answer : (B) 2 Mbps

The average age of K and L is 48 years. If M replaced K, the average age would be 40 and if M replaced L, the average would be 44. What are the ages of K,L,M repectively? A) 58, 46, 22 B) 32, 44, 36 C) 52,44,36 D) 56, 22,38

Description :  The average age of K and L is 48 years. If M replaced K, the average age would be 40 and if M replaced L, the average would be 44. What are the ages of K,L,M repectively? A) 58, 46, 22 B) 32, 44, 36 C) 52,44,36 D) 56, 22,38

Last Answer : Answer: C)  Total age of K& L = 48*2 = 96 yrs----->1 Total age of L& M = 40*2 = 80yrs----->2 Total age of K& M = 44*2 = 88 yrs----->3 from 1, 2, 3 K+L+M =132---->4 from 1 & 4, M= 36 from 2 & 4, K=52 from 3 & 4, L=44 Hence the required answer is 52,44,36 

5, 8, 12, 18, 24, 30, 36, 42, ____ a) 52 b) 46 c) 48 d) 54 e) 56

Description : 5, 8, 12, 18, 24, 30, 36, 42, ____ a) 52 b) 46 c) 48 d) 54 e) 56

Last Answer : Each term in the series is the addition of successive prime numbers. Like Prime numbers are2, 3, 5, 7, 11, 13, 17, 19, 23, 29 and so on. So first term is addition of (2 + 3). Ie 5, then second term is (3 + 5) ie ... +17)ie. 30, then (17+19)ie.36, then (19+23)ie., 42, then (23+29)i.e. 52. Answer: a)

Which of the following herbicides will be tightly bound to the soil? a). Trifluralin KOC(mL/g)= 7000 b). Paraquat KOC(mL/g)= 10,00,000 c). Glyphosate KOC(mL/g)= 24,000 d). Alachlor KOC(mL/g)= 124

Description : Which of the following herbicides will be tightly bound to the soil? a). Trifluralin KOC(mL/g)= 7000 b). Paraquat KOC(mL/g)= 10,00,000 c). Glyphosate KOC(mL/g)= 24,000 d). Alachlor KOC(mL/g)= 124

Last Answer : b). Paraquat KOC(mL/g)= 10,00,000

To pump water from a water reservoir 3 m deep and maximum water level at 135 m, a pump is installed to lift water up to R.L. 175 m at a constant rate of 36,00,000 litres per hour. If the length of the pipe is 1506 m and f = 0.01, ignoring other minor losses and assuming the economical diameter from Lea's formula D = 1.2 Q, the water horse power of the pump is (A) 400 (B) 450 (C) 500(D) 600

Description : To pump water from a water reservoir 3 m deep and maximum water level at 135 m, a pump is  installed to lift water up to R.L. 175 m at a constant rate of 36,00,000 litres per hour. If the length  of the ... the water horse power of the pump is  (A) 400  (B) 450  (C) 500 (D) 600

Last Answer : (D) 600

Avinash, Bala and Chandran invested Rs.45,000/-, Rs. 70, 000/- and Rs. 90,000/- respectively to start a business. At the end of two years, they earned a profit of Rs.1,64,000/-. What will be Bala’s share in the profit? a) Rs.56, 000/- b) Rs.46, 000/- c) Rs. 50, 000/- d) Rs.75, 000/- e) None of these

Description : Avinash, Bala and Chandran invested Rs.45,000/-, Rs. 70, 000/- and Rs. 90,000/- respectively to start a business. At the end of two years, they earned a profit of Rs.1,64,000/-. What will be Bala’s share in the profit? a) Rs.56, 000/- b) Rs.46, 000/- c) Rs. 50, 000/- d) Rs.75, 000/- e) None of these

Last Answer : Profit sharing ratio of Avinash,Bala & Chandran = 45000 : 70000 : 90,000 = 45 : 70 : 90 = 9 : 14 : 18 Bala's share of profit after two year =Rs.164000 × 14 × 41 = Rs. 4000 ×14 = Rs. 56000 Answer: a)

Fact-less fact table in a data warehouse contains (A) only measures (B) only dimensions (C) keys and measures (D) only surrogate keys

Description : Fact-less fact table in a data warehouse contains (A) only measures (B) only dimensions (C) keys and measures (D) only surrogate keys

Last Answer : (D) only surrogate keys

Which of the following property/ies a Group G must hold, in order to be an Abelian group? (a) The distributive property (b) The commutative property (c) The symmetric property Codes: (A) (a) and (b) (B) (b) and (c) (C) (a) only (D) (b) only

Description : Which of the following property/ies a Group G must hold, in order to be an Abelian group? (a) The distributive property (b) The commutative property (c) The symmetric property Codes: (A) (a) and (b) (B) (b) and (c) (C) (a) only (D) (b) only

Last Answer : Answer: D

A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in response to a request? (Note that the speed of light in air is 3,00,000 km/second). (A) 133.33 m sec (B) 266.67 m sec (C) 400.00 m sec (D) 533.33 m sec

Description : A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in response to a request? (Note that the speed of light in air is 3,00,000 km/second). (A) 133.33 m sec (B) 266.67 m sec (C) 400.00 m sec (D) 533.33 m sec

Last Answer : (D) 533.33 m sec Explanation: The request has to go up and down, and the response has to go up and down. The total path length traversed is thus 160.000 km. The speed of light in air and vacuum is 300,000 km/sec, so the propagation delay alone is 160,000/300,000 sec or about 533 msec. 

A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68

Description : A computer program selects an integer in the set {k : 1 ≤ k ≤ 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout atleast once ? (A) 0.5 (B) 0.704 (C) 0.632121 (D) 0.68

Last Answer : (C) 0.632121

If X is a binary number which is power of 2, then the value of X&(X-1) is: (1) 11....11 (2) 00.....00 (3) 100.....0 (4) 000.....1

Description : If X is a binary number which is power of 2, then the value of X&(X-1) is: (1) 11....11 (2) 00.....00 (3) 100.....0 (4) 000.....1

Last Answer : Answer: 2

A source code whose average word length approaches the fundamental limit set by the entropy of a discrete memoryless source. A. Prefix code B. Huffman code C. Entropy code D. Source code

Description : A source code whose average word length approaches the fundamental limit set by the entropy of a discrete memoryless source. A. Prefix code B. Huffman code C. Entropy code D. Source code

Last Answer : B. Huffman code

Average length of Extended Huffman code is upper bounded by : a. R b. R+1 c. R-1 d. R+1/n

Description : Average length of Extended Huffman code is upper bounded by : a. R b. R+1 c. R-1 d. R+1/n

Last Answer : d. R+1/n

.................. address use 7 bits for the <network> and 24 bits for the <host> portion of the IP address. A) Class A B) Class B C) Class C D) Class D

Description : .................. address use 7 bits for the and 24 bits for the portion of the IP address. A) Class A B) Class B C) Class C D) Class D

Last Answer : A) Class A

The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01

Description : The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01

Last Answer : (C) (1 + 01)* (1 + 01) 

Which of the following is/are correct with reference to Abstract class and interface ? (a) A class can inherit only one Abstract class but may inherit several interfaces. (b) An Abstract class can provide complete and default code but an interface has no code. Codes : (A) (a) is true (B) (b) is true (C) Both (a) and (b) are true (D) Neither (a) nor (b) is true

Description : Which of the following is/are correct with reference to Abstract class and interface ? (a) A class can inherit only one Abstract class but may inherit several interfaces. (b) An Abstract class can provide complete and default ... true (C) Both (a) and (b) are true (D) Neither (a) nor (b) is true

Last Answer : Answer: C

An artist makes an RGB raster image in which each pixel color is encoded with 12-bits --- 4 bits each for red, green and blue.Which of the following correctly shows the hexadecimal value for Red as a 12-bit representation A. F00 B. 00F C. FF00 D. FF0000

Description : An artist makes an RGB raster image in which each pixel color is encoded with 12-bits --- 4 bits each for red, green and blue.Which of the following correctly shows the hexadecimal value for Red as a 12-bit representation A. F00 B. 00F C. FF00 D. FF0000

Last Answer : D. FF0000

Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: (1) (1+x) is factor of G(x) (2) (1-x) is factor of G(x) (3) (1+x2) is factor of G(x) (4) x is factor of G(x)

Description : Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: (1) (1+x) is factor of G(x) (2) (1-x) is factor of G(x) (3) (1+x2) is factor of G(x) (4) x is factor of G(x)

Last Answer : (1+x) is factor of G(x)

Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error? a. G(x) contains more than two terms b. G(x) does not divide 1+x^k, for any k not exceeding the frame length c. 1+x is a factor of G(x) d. G(x) has an odd number of terms

Description : Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error? a. G(x) contains more than two terms b. G(x) does ... exceeding the frame length c. 1+x is a factor of G(x) d. G(x) has an odd number of terms

Last Answer : c. 1+x is a factor of G(x)

The following data, relates to manufacturing company for the year 2006-07– Net Profit as per P & L A/c–Rs. 2,40,000; Depreciation–Rs. 80,000; Goodwill written-off– Rs. 40,000, Profit on Sale of Fixed Assets–Rs. 16,000, Proposed Dividend–Rs. 96,000. The fund from operation would be– (A) Rs. 4,40,000 (B) Rs. 4,00,000 (C) Rs. 6,40,000 (D) None of the above

Description : The following data, relates to manufacturing company for the year 2006-07- Net Profit as per P & L A/c-Rs. 2,40,000; Depreciation-Rs. 80,000; Goodwill written-off- Rs. 40,000, Profit on Sale of Fixed Assets-Rs. 16,000, ... ) Rs. 4,40,000 (B) Rs. 4,00,000 (C) Rs. 6,40,000 (D) None of the above

Last Answer : Answer: None of the above

A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB