It is actually a method for constructing codes with a minimum distance of

a. 2
b 64
c. 3
d 5

1 Answer

Answer :

c. 3

Related questions

Description : How many paths taken by movement of data in CU: a. 3 b 64 c. 5 d 2

Last Answer : d 2

Description : How many algorithm based on add/subtract and shift category: a. 2 b 64 ec. 8 d 6

Last Answer : ec. 8

Description : Thereis___ standard for preparing pseudocode instructions: a. No b 64 c. 2 d 6

Last Answer : a. No

Description : How many main sign number binary codes are used: a. 4 b 65 ce. 3 d. 6

Last Answer : ce. 3

Description : Which are the types of binary codes number: a. Sign magnitude b. —_1’s complement code c. 2’s complement code d. __ Allof these

Last Answer : c. 2’s complement code

Description : The complete set of op-codes for a particular microprocessor defines the_ set for that processor: a. Code b. Function c. Module d. Instruction

Last Answer : d. Instruction

Description : sare the codes that represent alphabetic characters, punctuation marks and other special characters: a. Alphanumeric codes b. ASCII codes c. EBCDIC codes d. All of these

Last Answer : a. Alphanumeric codes

Description : has the property that corrupting or garbling a code word will likely produce a bit string that is not a code word: a. Error deleting codes b. Error detecting codes c. Error string codes

Last Answer : b. Error detecting codes

Description : Hamming codes was developed in _ a 1953 b. 1950 c. 1945 d. 1956

Last Answer : b. 1950

Description : Mnemonic refers to. a Instructions b. Code c. Symbolic codes d Assembler

Last Answer : c. Symbolic codes

Description : Process of replacing the sequence of lines of codes is known as: a. Expanding die macro b. Expanding tri macro c. Tetra macro d. None of these

Last Answer : a. Expanding die macro

Description : Absolute entitiesare_ Ss whom value signify storage locations that are independent of resulting machine code: a. Numeric constants b. String constants c. Fixed addresses d. Operation codes e. Allofthese

Last Answer : e. Allofthese

Description : ___in all digital systems actually performs addition that can handle only two number at a time: a Register b. circuit c digital d. — Allof these

Last Answer : b. circuit

Description : In which addressing the operand is actually present in instruction: a. Immediate addressing b. Direct addressing 9 Register addressing a None of these

Last Answer : a. Immediate addressing

Description : The bit positionina can be numbered from 1 through 2h, a. Hamming code word b. Hamming distance word c. Both d. None of these

Last Answer : a. Hamming code word

Description : Which are the method for handling deadlocks. a. Deadlock prevention b. Deadlock avoidance c. Deadlock detection d. Allof these

Last Answer : d. Allof these

Description : A popular method knows as double-dabble method also knows as a. Divided-by-one method b. Divided-by-two method c. Both d. None of these

Last Answer : b. Divided-by-two method

Description : In this method, the decimal number is a. Repeatedly divided by 4 b. Repeatedly divided by 2 c. Repeatedly divided by 1 d. None of these

Last Answer : b. Repeatedly divided by 2

Description : The simple procedure istouse a. Binary-triplet method b. Decimal-triplet method c. Octal-triplet method d. __ Allof these

Last Answer : a. Binary-triplet method

Description : One way to convert from decimal to hexadecimalisthe a. Double dabble method b. Hex dabble method c. Binary dabble method d. __ Allof these

Last Answer : b. Hex dabble method

Description : Which is the method by which instructions are selected for execution: a. Instruction selection b. — Selection control c. Instraction sequencing d. All of these

Last Answer : c. Instraction sequencing

Description : The simplest method of controlling sequence of instruction execution is to have each instruction explicitly specify: a. The address of next instruction to be run b. Address of previous instruction c. Both a &b d. None of these

Last Answer : a. The address of next instruction to be run

Description : Which method is used to detect double errors and pinpoint erroneous bits. a. Even parity method b. Odd parity method c. Check sum method. d. All of these

Last Answer : c. Check sum method.

Description : The method of writing symbol to indicate a provided computational process is called as a: a. Programming language b. Random transfer language c. Register transfer language d. Arithmetic transfer language

Last Answer : a. Programming language

Description : On what method search in cache memory used by the system. a. Cache directing b. Cache mapping c. Cache controlling d. Cache invalidation

Last Answer : b. Cache mapping

Description : Which is a method of decomposing a sequential process into sub operations: a. Pipeline b. CISC c. RISC d. Database

Last Answer : a. Pipeline

Description : which correctly shows the result of the third step when constructing a line through P parallel to L using method 1?

Last Answer : A, B, C, p, d, m

Description : 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

Last Answer : (D) 2,24,000 bits 

Description : 0,1,2 ,3 ,4,5,6 ,7,8 and 9 numerals are called: a. Arabic numerals b. String numerals c. Digit numerals d. None of these

Last Answer : a. Arabic numerals

Description : How many system of arithmetic, which are often used in digital system. a. 5 b. 6 Cc. 3 d 4

Last Answer : d 4

Description : How many types of addition in the 2’s complement system. a. 3 b 4 c. 5 d. 6

Last Answer : b 4

Description : How many main approaches to algorithm for division: a 2 b 3 Cc. 4 d 5

Last Answer : a 2

Description : How many parts of floating point representation of a number consists. a. 4 b 2 Cc. 3 d 5

Last Answer : b 2

Description : How many parts of memory bus: a 2 b 3 c. 5 d. 6

Last Answer : a 2

Description : CP/CMS assembly language was written in ___assembler. a. $/340 b. S-350 c. $/320 d. 5/860

Last Answer : d. 5/860

Description : How many modes the address in control memory are divided. a 2 b 3 c. 5 d 7

Last Answer : a 2

Description : There are how many register groups in control memory: a 3 b 5 c. 6 d 8

Last Answer : b 5

Description : How many bits of OPR select one of the operations in the ALU: a. 2 b 3 Cc. 4 dad 5

Last Answer : dad 5

Description : emaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value: a. Mutex b. Mutual Cc. Memory d. __ Allof these

Last Answer : Mutex

Description : Which section is basically a sequence of instruction with a clear indication of beginning and end for updating shared variables. a. Racing section b. Critical section c. d. Both None of thes

Last Answer : . Critical sectio

Description : In which section only one process is allowed to access the shared variable and all other have to wait. a. Critical section b. Racing section Cc. Entry section d. Remainder section

Last Answer : . Critical section

Description : hich section is the remaining part of a process’s code: a. Racing section b. Critical section Cc. Entry section d. Reminder secti

Last Answer : b. Entry section

Description : Which are the characteristics of deadlocks. a. Mutual exclusion b. Hold and wait Cc. No pre-emption d. = Circular wait e. Allof these

Last Answer : e. Allof these

Description : How many events concerning RAG can occur in a system: a. 1 b 2 c. 3 d 4

Last Answer : c. 3

Description : Which are the events concerning RAG can occur in a system: a. Request for a resource b. Allocation of a resource c. Release of resource d. Allof these

Last Answer : d. Allof these

Description : How many methods for handling deadlocks: a. 1 b 2 c. 3 d 4

Last Answer : c. 3

Description : How many condition that should be met in order to produce a deadlock. a. 2 b 4 Cc. 6 d 8

Last Answer : b 4

Description : Which are the condition that should be met in order to produce a deadlock. a. Mutual exclusion b. Hold and Wait Cc. No preemption d. Circular wait e. Allofthese

Last Answer : e. Allofthese

Description : In protocol each process can make a request onlyinan a. Increasing order b. Decreasing order c. Botha &b d. None of these

Last Answer : a. Increasing order

Description : Which state refers to a state that is not safe not necessarily a deadlocked state. a. Safe state b. Unsafe state c. Botha &b d. None of these

Last Answer : b. Unsafe state