Answer:
c) it will always return with an answer of 7 or fewer comparisons of data.
Explanation:
As maximum number of comparison in worst case for sorted binary search is log₂n, here n = 100, so maximum search is at least 6.6 which is approximately 7.
Answer:
b. foreign key
Explanation:
In the database world, a foreign key is a field on one table and a primary key for another table. The purpose of a foreign key is to provide linkages between two or more tables. Given two tables A and B, and making A the point of reference, a primary key is a field that is unique in A while a foreign key is unique in B.
On another hand, a composite primary key is a combination of two or more fields/columns on database table that can be used to uniquely identify each row in the table.
In the database lingua, what we have is a unique key not a distinct key, though the two words are similar in meaning.
A duplicate key is used when an information may be repeatedly entered on a table.
So the correct option is a foreign key.
Answer:
2 times as many items can be uniquely identified
Explanation:
Option 'C' is the answer. because
if we use 6 bit binary sequence
then
No. of Unique address will be = 2 ^ 6 = 64
as we increase the bit by 1. Now total bits are 7.
so
No. of Unique address for 7 bit Sequence = 2 ^ 7 = 128
So,
128 is double of 64, that is 2 times greater value than 64.
Answer:
In other words, the CSS rules can "cascade" in their order of precedence. Where the rules are located is one factor in the order of precedence. The location order of precedence is: browser default rules, external style sheet rules, embedded styles, and inline style rules.
Answer:
A
Explanation:
.
.stack 4096
ExitProcess PROTO, dwExitCode:DWORD
.data
Sun=0
Mon=1
Tue=2
Wed=3
Thu=4
Fri=5
Sat=6
warray BYTE Sun, Mon, Tue, Wed, Thu, Fri, Sat
INVOKE ExitProcess, 0
