Which algorithm is a divided and conquer algorithm that is asymptotically faster: a. Simple algorithm b. Specific algorithm c. Strassen algorithm d. Addition algorithm

Which algorithm is a divided and conquer algorithm that is asymptotically faster:

a. Simple algorithm
b. Specific algorithm
c. Strassen algorithm
d. Addition algorithm
by

1 Answer

Answer :

c. Strassen algorithm
by

Related questions

Which algorithm is used for matrix multiplication: a. Simple algorithm b. Specific algorithm c. Strassen algorithm d. Addition algorithm

Description : Which algorithm is used for matrix multiplication: a. Simple algorithm b. Specific algorithm c. Strassen algorithm d. Addition algorithm

Last Answer : c. Strassen algorithm

Which algorithm is named after Volker Strassen: a. Strassen algorithm b. = Matrix algorithm c. Both d. None of these

Description : Which algorithm is named after Volker Strassen: a. Strassen algorithm b. = Matrix algorithm c. Both d. None of these

Last Answer : a. Strassen algorithm

Strassen algorithm was publishedin a 1967 b. 1969 c. 1987 d. 1980

Description : Strassen algorithm was publishedin a 1967 b. 1969 c. 1987 d. 1980

Last Answer : b. 1969

Which algorithm is used to find GCD of two integers. a. Multiplication algorithm b. Division algorithm c. Addition algorithm d. Simple algorithm

Description : Which algorithm is used to find GCD of two integers. a. Multiplication algorithm b. Division algorithm c. Addition algorithm d. Simple algorithm

Last Answer : b. Division algorithm

Which algorithm is used as a general variant of a theorems, in the domain of integral numbers: a. Multiplication algorithm c. Addition algorithm d. Simple algorithm

Description : Which algorithm is used as a general variant of a theorems, in the domain of integral numbers: a. Multiplication algorithm c. Addition algorithm d. Simple algorithm

Last Answer : c. Addition algorithm

Which algorithm are used depending on the size of the numbers: a. Simple algorithm b. Specific algorithm c. Both d. None of these

Description : Which algorithm are used depending on the size of the numbers: a. Simple algorithm b. Specific algorithm c. Both d. None of these

Last Answer : b. Specific algorithm

Which is an algorithm or techniques used to multiply two numbers. a. Addition algorithm b. Subtraction algorithm c. Multiplication algorithm d. __ Allof these

Description : Which is an algorithm or techniques used to multiply two numbers. a. Addition algorithm b. Subtraction algorithm c. Multiplication algorithm d. __ Allof these

Last Answer : c. Multiplication algorithm

Which algorithm includes repeated addition of two predetermined values A and S to a product P and then performs a rightward arithmetic shift on P. 49 50. 51. 52. 53. 54. 55. a. Booth’s algorithm b. Usual algorithm c. Multiplication algorithm d. None of these

Description : Which algorithm includes repeated addition of two predetermined values A and S to a product P and then performs a rightward arithmetic shift on P. a. Booth’s algorithm b. Usual algorithm c. Multiplication algorithm d. None of these

Last Answer : a. Booth’s algorithm

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

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

Last Answer : a 2

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

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

Last Answer : ec. 8

Which are the algorithm based on add/subtract and shift category: a. Restoring division b. Non-restoring division c. SRT division d. Allofthese

Description : Which are the algorithm based on add/subtract and shift category: a. Restoring division b. Non-restoring division c. SRT division d. Allofthese

Last Answer : d. Allofthese

___uses various symbols to represent function within program and is __ _representation: a. Flowchart, pictorial b. Algorithm, pictorial c. Pictorial, flowchart d. None of these

Description : ___uses various symbols to represent function within program and is __ _representation: a. Flowchart, pictorial b. Algorithm, pictorial c. Pictorial, flowchart d. None of these

Last Answer : a. Flowchart, pictorial

Avoid crossing flow lines. a. Flowchart b. Algorithm c. Botha &b d. None of these

Description : Avoid crossing flow lines. a. Flowchart b. Algorithm c. Botha &b d. None of these

Last Answer : a. Flowchart

is useful to prepare detailed program documentation: a. Flowchart b. Algorithm c. Botha &b d. None of these

Description : is useful to prepare detailed program documentation: a. Flowchart b. Algorithm c. Botha &b d. None of these

Last Answer : a. Flowchart

Which addition is performed in the same manner as decimal addition: a. Binary b. Decimal c. Both d. None of these

Description : Which addition is performed in the same manner as decimal addition: a. Binary b. Decimal c. Both d. None of these

Last Answer : a. Binary

___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

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

Which machine can perform addition operation in less than 1 ms: a. Digital machine b. Electronic machine c. Both d. None of these

Description : Which machine can perform addition operation in less than 1 ms: a. Digital machine b. Electronic machine c. Both d. None of these

Last Answer : a. Digital machine

is the inverse operation of addition: a. Addition b. Multiply c. Subtraction d. Divide

Description : is the inverse operation of addition: a. Addition b. Multiply c. Subtraction d. Divide

Last Answer : c. Subtraction

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

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

Last Answer : b 4

Which are the types of addition in the 2’s complement system: a. Both number positive b. A Positive number and a smaller negative number c. Anegative number and a smaller positive number

Description : Which are the types of addition in the 2’s complement system: a. Both number positive b. A Positive number and a smaller negative number c. Anegative number and a smaller positive number

Last Answer : b. A Positive number and a smaller negative number

Which operations are used for addition, subtraction, increment, decrement and complement function: a. Bus b. Memory transfer c. Arithmetic operation d. Allof these

Description : Which operations are used for addition, subtraction, increment, decrement and complement function: a. Bus b. Memory transfer c. Arithmetic operation d. Allof these

Last Answer : d. Allof these

In arithmetic operation numbers of register and the circuits for addition at a. ALU b. MAR c. Both d. None

Description : In arithmetic operation numbers of register and the circuits for addition at a. ALU b. MAR c. Both d. None

Last Answer : a. ALU

which are arithmetic operation are. Addition oS Subtraction Multiplication Division All of these None of these

Description : which are arithmetic operation are. Addition oS Subtraction Multiplication Division All of these None of these

Last Answer : All of these

Which approach is to pretend that a pure divide and conquer algorithm will work? a) Goal independence b) Subgoal independence c) Both Goal & Subgoal independence d) None of the mentioned

Description : Which approach is to pretend that a pure divide and conquer algorithm will work? a) Goal independence b) Subgoal independence c) Both Goal & Subgoal independence d) None of the mentioned

Last Answer : b) Subgoal independence

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Description : Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Last Answer : 3

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

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

Which instruction are arranged as per the protocols of memory reference format of the input file in a simple ASCII sequence of integers between the range O to 99 separated by spaces without formatted text and symbols: a. Memory reference instruction b. Memory reference format c. Both d. None of these

Description : Which instruction are arranged as per the protocols of memory reference format of the input file in a simple ASCII sequence of integers between the range O to 99 separated by spaces without formatted text ... : a. Memory reference instruction b. Memory reference format c. Both d. None of these

Last Answer : a. Memory reference instruction

following are structured programs written in simple structures. a Sequence b. Selection c. Iteration d. All of these

Description : following are structured programs written in simple structures. a Sequence b. Selection c. Iteration d. All of these

Last Answer : d. All of these

Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))

Description : Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))

Last Answer : (D) θ(f(n) + g(n)) = max(f(n), g(n))

Which of the following is asymptotically smaller? (A) lg(lg*n) (B) lg*(lg n) (C) lg(n!) (D) lg*(n!)

Description : Which of the following is asymptotically smaller? (A) lg(lg*n) (B) lg*(lg n) (C) lg(n!) (D) lg*(n!)

Last Answer : (A) lg(lg*n) 

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

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

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

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

__is divided into a number of fields and is represented as a sequence of bits: a. instruction b. — instruction set c. instruction code d. parity code

Description : __is divided into a number of fields and is represented as a sequence of bits: a. instruction b. — instruction set c. instruction code d. parity code

Last Answer : a. instruction

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

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

Last Answer : a 2

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

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

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

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

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

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

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

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

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

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

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

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

Last Answer : c. 3

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

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

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

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

Last Answer : c. 3

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

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

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

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

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

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

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

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

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

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

a direct arrow is drawn from the process to the resource rectangle to represent each pending resource request: a. TS b. SP Cc. CCR d. RAG

Description : a direct arrow is drawn from the process to the resource rectangle to represent each pending resource request: a. TS b. SP Cc. CCR d. RAG

Last Answer : d. RAG

The attributes of a file are. a. Name b. Identifier c. Types d. Location e. Size f. Protection g. Time, date and user identification h. Allof these

Description : The attributes of a file are. a. Name b. Identifier c. Types d. Location e. Size f. Protection g. Time, date and user identification h. Allof these

Last Answer : h. Allof these