Well most word processing softwares allow you to do many things to a document, if you use google documents or microsoft word i'm pretty sure you can do all of those things
Answer:
a) AL will contains 0011 1100
Explanation:
In assembly language, shifting bits in registers is a common and important practice. One of the shifting operations is the SHR AL, x where the x specifies that the bits be shifted to the right by x places.
SHR AL, 2 therefore means that the bits contained in the AL should be shifted to the right by two (2) places.
For example, if the AL contains binary 1000 1111, the SHR AL, 2 operation will cause the following to happen
Original bit => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
Shift once to the right => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | (0) |
Shift once to the right => | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | (0) | (0) |
Notice;
(i) that there are two shifts - one at a time.
(ii) that the bits in bold face are the bits in the AL after the shift. Those that in regular face are those in the carry flag.
(iii) that the new bits added to the AL after a shift are the ones in bracket. They are always set to 0.
There are four types of operator in QBASIC. They are Arithmetic operators,relational operators,logical operators and sting operator .a. arithmetic operators. Arithmetic operators are used to preform mathematical calculations like addition, subtraction, division, multiplication and exponential
Answer:
Question was incomplete and continued the question
For each of the following scenarios, which of these choices would be best? Explain your answer.
BST
Sorted Array
Un-sorted Array
a) The records are guaranteed to arrive already sorted from lowest to highest (i.e., whenever a record is inserted, its key value will always be greater than that of the last record inserted). A total of 1000 inserts will be interspersed with 1000 searches.
b) The records arrive with values having a uniform random distribution (so the BST is likely to be well balanced). 1,000,000 insertions are performed, followed by 10 searches.
Explanation:
Answer for a: Un-sorted array or Un-sorted linked list : as mentioned in the question itself that the records are arriving in the sorted order and search will not be O(log n) and insert will be not be O(n).
Answer for b : Un-sorted array or Un-sorted linkedlist : Number of the items to be inserted is already known which is 1,000,000 but it is very high and at the same time search is low. Unsorted array or Unsorted linked list will be best option here.
