Answer: I think it’s D
Explanation: the rest apply to the the rules of 1NF and 2NF
Answer:
Option(B) i.e., social engineering is the correct option to the question.
Explanation:
The following option is correct because social engineering is the type of attack in which the criminals tricks the computer users to disclose the confidential data or information. Criminals or hackers use this trick because by this they can easily take advantage of your confidential information or corporate secrets.
Answer:
30 units of Food A and 45 units of Food B are to be purchased to keep costs at the minimum $105.
Explanation:
X = Amount of food A
Y = Amount of food B
Z= 2X+Y..... minimum cost equation
50X + 20Y > 2400 .................Vitamins .......(1)
30X + 20Y > 1800 ...................Minerals.......(2)
10X + 40Y > 1200 .................Calories ..........(3)
X > 0
y > 0
X=30 and Y = 45
Z= 2(30) + 45 = $105
Answer:
Check the explanation
Explanation:
#!usr/bin/python
#FileName: sieve_once_again.py
#Python Version: 2.6.2
#Author: Rahul Raj
#Sat May 15 11:41:21 2010 IST
fi=0 #flag index for scaling with big numbers..
n=input('Prime Number(>2) Upto:')
s=range(3,n,2)
def next_non_zero():
"To find the first non zero element of the list s"
global fi,s
while True:
if s[fi]:return s[fi]
fi+=1
def sieve():
primelist=[2]
limit=(s[-1]-3)/2
largest=s[-1]
while True:
m=next_non_zero()
fi=s.index(m)
if m**2>largest:
primelist+=[prime for prime in s if prime] #appending rest of the non zero numbers
break
ind=(m*(m-1)/2)+s.index(m)
primelist.append(m)
while ind<=limit:
s[ind]=0
ind+=m
s[s.index(m)]=0
#print primelist
print 'Number of Primes upto %d: %d'%(n,len(primelist))
if __name__=='__main__':
sieve()
Answer:
(a) 1 to 8
(b) 1 to 6
Explanation:
A "leaf" is a node at the end of a binary tree (in other words, it has no "children"). All other nodes are "non-leaf" nodes.
The smallest number of leaves is 1. That would be a binary tree that's just a straight line; each node will have only 1 child, until you get to the last node (the leaf).
To find the largest number of leaves, we start drawing a full binary tree. A complete tree with 15 nodes has 7 non-leaf nodes and 8 leaf nodes. A full tree with 6 non-leaf nodes can have up to 6 leaf nodes.
