Deck 9: Strings and Arrays Assessment

Full screen (f)
exit full mode
Question
Binary search uses a divide and conquer strategy.
Use Space or
up arrow
down arrow
to flip the card.
Question
The CMPSW instruction uses memory pointed to by EDI as the source operand.
Question
array[EDX+ESI] is an example of a base-index-displacement operand.
Question
The CLD instruction causes the ESI and EDI registers to be increased in value by the MOVSB instruction.
Question
The Str_compare procedure returns no value in the EAX register.Instead,it sets the Carry and Zero flags.
Question
The REPNZ CMPSB instruction pair will execute as long as the byte pointed to by ESI is not equal to the byte pointed to by EDI.
Question
The REPNE prefix repeats an instruction while the Zero flag is set,and ECX is greater than zero.
Question
The LODSD instruction loads a doubleword from the memory location addressed by ESI.
Question
The Str_trim procedure has a second parameter that holds the character to be trimmed from the end of the string.
Question
The EDX and ECX registers can be combined in a based-indexed operand.
Question
The MOVSW instruction copies a word from the location addressed by ESI to the location addressed by EDI.
Question
In 64-bit mode,operands that use register indexes must use 64-bit registers.You can use both base-index operands and base-index-displacement operands.
Question
When calling Str_compare in the Irvine32 library,you can pass arguments to it in 32-bit registers.
Question
On the first pass through an array of N items,the inner loop of a bubble sort executes N  1 times.
Question
If an O(n2)sorting algorithm requires 0.2 seconds to sort an array of 1,000 elements,it will require 200 seconds to sort 10,000 elements.
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/15
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 9: Strings and Arrays Assessment
1
Binary search uses a divide and conquer strategy.
True
2
The CMPSW instruction uses memory pointed to by EDI as the source operand.
False
3
array[EDX+ESI] is an example of a base-index-displacement operand.
True
4
The CLD instruction causes the ESI and EDI registers to be increased in value by the MOVSB instruction.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
5
The Str_compare procedure returns no value in the EAX register.Instead,it sets the Carry and Zero flags.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
6
The REPNZ CMPSB instruction pair will execute as long as the byte pointed to by ESI is not equal to the byte pointed to by EDI.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
7
The REPNE prefix repeats an instruction while the Zero flag is set,and ECX is greater than zero.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
8
The LODSD instruction loads a doubleword from the memory location addressed by ESI.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
9
The Str_trim procedure has a second parameter that holds the character to be trimmed from the end of the string.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
10
The EDX and ECX registers can be combined in a based-indexed operand.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
11
The MOVSW instruction copies a word from the location addressed by ESI to the location addressed by EDI.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
12
In 64-bit mode,operands that use register indexes must use 64-bit registers.You can use both base-index operands and base-index-displacement operands.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
13
When calling Str_compare in the Irvine32 library,you can pass arguments to it in 32-bit registers.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
14
On the first pass through an array of N items,the inner loop of a bubble sort executes N  1 times.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
15
If an O(n2)sorting algorithm requires 0.2 seconds to sort an array of 1,000 elements,it will require 200 seconds to sort 10,000 elements.
Unlock Deck
Unlock for access to all 15 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 15 flashcards in this deck.