Is a storyboard an example of an implemation tool?

Since the rules cannot address all circumstances, the Code includes a conceptual framework approach for members to use to evalua

Veseljchak [2.6K]

Answer:

more than one safeguard may be necessary.

Explanation:

The conceptual framework can be used to developed as well as construct through a process of the qualitative analysis. The approach includes the in the frameworks for identifying and evaluating the threats to compliance with the rules.

But since the rules formed cannot always address all the circumstances, the Code includes to evaluate the threats to the compliance of more than one safeguards that are necessary.

8 0

3 years ago

A DFA is equivalent in power to an NFA. True False

sattari [20]

Answer: True

Explanation:

Yes, the given statement is true that a DFA is equivalent to NFA in terms of power. For any type of NFA we can easily build an equal DFA so, the NFA are not much powerful as compared to DFA. Both NFA and DFA are characterized by a similar type of class.

DFA is a special case of NFA and They both defined in the same class of language. Each condition in the DFA get summarized by all the condition that the NFA has itself.

4 0

2 years ago

Create a new file that builds a shopping list from a user. There should be a input query that asks the user to list an item and

levacccp [35]

Answer:

Check the output

Explanation:

# -*- coding: utf-8 -*-

"""

Created on Thu Apr 12 00:39:11 2018

author:

"""

stocks ={

"tomato soup": 20,

"cheese": 8,

"bread": 6,

"milk": 8,

"butter": 7,

"coffee": 8,

"ice cream": 5,

"orange juice": 12,

"bacon": 6,

"tortilla chips": 14,

"ramen": 24 }

prices ={

"tomato soup": 1.85,

"cheese": 3.99,

"bread": 2.50,

"milk": 3.59,

"butter": 1.99,

"coffee": 5.99,

"ice cream": 2.99,

"orange juice": 2.50,

"bacon": 5.49,

"tortilla chips": 3.00,

"ramen": 0.99 }

def grocery_cost(item_list,quantity_list):

totalcost = 0

for i in range(len(item_list)):

totalcost=totalcost+(quantity_list[i]*prices[item_list[i]])

return totalcost

def stock(item):

print("Number of itmes present in the stock:",stocks[item])

print("Welcome to the on-line grocery store!!")

print("Items that are available for purchase:")

for key in stocks.keys():

print(key)

#chosen foods

print("Enter the item with quantity or Enter 'Q' when you are done")

item_list=[]

quantity_list=[]

while True:

item=input('Enter the item name: ')

if item=='Q' or item=='q':

break

item_list.append(item)

while True:

quan=int(input('Enter the number of item: '))

if stocks[item] >=quan:

quantity_list.append(quan)

break

else:

stock(item)

print('Your requirement is higher than stock available. Please enter again!!')

print("\nTotal cost:", "$",grocery_cost(item_list,quantity_list))

Kindly check the output in the attached image below.

7 0

3 years ago

What is the value of y when this code executes?

Cerrena [4.2K]

Answer:

The operation of 6*x only executes if x is greater or equal to 0, since x=-10 and -10 is less than 0, the operation does not execute. For this reason, the value of y using this code is None.

Explanation:

In python a function is defined with the syntaxis:

def function(x):

the operation to execute (x)

value to return

In this case, the function is foo and the parameter is x:

def foo(x):

if x>= 0:

return 6*x

The code starts by assigning a value to x. Then, the code asks if the value of x is grater or equal to 0, if this condition is meet, then the code returns the value of 6 times x, if not, then the code does not return a value. In this case, x is -10 and this value is not grater or equal to 0. Given that the condition is not met, then the code stops executing and the value of y is none.

4 0

2 years ago

A direct-mapped cache holds 64KB of useful data (not including tag or control bits). Assuming that the block size is 32-byte and

Cerrena [4.2K]

Answer:

A) Number of bits for byte = 6 bits

B) number of bits for index = 17 bits

C) number of bits for tag = 15 bits

Explanation:

Given data :

cache size = 64 kB

block size = 32 -byte

block address = 32 -bit

number of blocks in cache memory

cache size / block size = 64 kb / 32 b = 2^11 hence the number of blocks in cache memory = 11 bits = block offset

A) Number of bits for byte

$log _{2} (6)^2$ = 6 bits

B) number of bits for index

block offset + byte number

= 11 + 6 = 17 bits

c ) number of bits for tag

= 32 - number of bits for index

= 32 - 17 = 15 bits

5 0

3 years ago