To keep costs at a minimum and decrease the completion time by 1-1/2 days, Networks, Inc.should crash activity(ies):
Answer(s): A
The critical (longest) path is A-D-E, which has an expected time of 13 days (5.5 + 7.5). However, to decrease the project's completion time by 1.5 days, paths A-B-C-E (4.5 + 1.0 + 6.5 = 12 days) and A-B-D-E (4.5 + .5 + 7.5= 12.5 days) as well as A-D-E must also be shortened. Hence, A-D-E must be reduced by 1.5 days. A-B-C-E by .5 day, and A-B-D-E by 1.0 day. The only way to decrease A-D-E by 1.5 days is to crash activity AD (5.5 expected time - 4.0 crash time = 1.5 days). Crashing DE results in a 1.0-day saving (7.5-6.5) only. Crashing AB is the efficient way to reduce both A-B-C-E and A-B-D-E by the desired amount of time because it is part of both paths. The incremental cost of crashing AB is US $1,000 (US $4,000 crash cost - US $3,000 normal cost) to shorten the completion time by 1.0 day (4.5 - 3.5). The alternatives for decreasing both A-B-C-E and A-B-D-E are more costly.
When making a cost-time trade-off in CPM analysis, the first activity that should be crashed is the activity:
Answer(s): D
When making a cost-time trade-off, the first activity to be crashed (have its completion time accelerated) is one on the critical path. To select an activity on another path would not reduce the total time of completion. The initial activity chosen should be the one with the completion time that can be accelerated at the lowest possible cost per unit of time saved.
In PERT, slack is the:
Slack is the amount of time that commencement of an activity can be delayed without forcing a delay of the entire project.
The network below describes the interrelationships of several activities necessary to complete a project. The arrows represent the activities. The numbers between the arrows indicate the number of months to complete each activity.The shortest time to complete the project is:
Answer(s): C
The critical (longest) path through the network from node (A) to node (F) is path A-C-D-F. All other paths are shorter than path A-C-D-F, so the activities along those paths can be completed before the activities along path A-C-D-F. Thus, the shortest time to complete the project is 8 months (3 + 3 + 2).
A shortest-route algorithm is used in network models to:
Answer(s): B
Network models are used to solve managerial problems pertaining to project scheduling, information systems design, and transportation systems design. Networks consisting of nodes and arcs may be created to represent in graphic form problems related to transportation, assignment, and transshipment. The shortest-route, minimal spanning tree, and maximal flow problems are other applications of network models. A shortest-route algorithm minimizes total travel time from one site to each of the other sites in a transportation system.
Post your Comments and Discuss IIA IIA-CIA-PART3-3P exam dumps with other Community members:
ElastiCache for Redis
S3 Object Lock
S3
SFTP
AWS Transfer Family
Amazon SQS
API Gateway
Lambda
usage plan
AWS WAF
Amazon ECS
Application Load Balancer
AWS Global Accelerator
Network Load Balancer
EC2
Auto Scaling group
CloudFront
ALB
AWS PrivateLink
CRR
SSE-S3
Athena
SSE-KMS
RDS Custom for Oracle
s3:GetObject
Amazon OpenSearch Service
CloudWatch Logs
Kinesis Data Firehose
Kinesis
S3 bucket
SQS
AWS Lambda
AWS Secrets Manager
AWS Systems Manager OpsCenter
secretsmanager:GetSecretValue
seq
for h in {1..254}
for h in $(seq 1 254); do
Kinesis Data Streams
Amazon Redshift
secrets:GetSecretValue
aws:PrincipalOrgID
"aws:PrincipalOrgID": "o-1234567890"
Azure Bot Service
Microsoft.Network/applicationSecurityGroups
Microsoft.Network/bastions
Microsoft.Network
COPY INTO
SELECT
COPY INTO @stage/path/file.csv FROM (SELECT col1, col2 FROM my_table WHERE date >= '2024-01-01') FILE_FORMAT=(TYPE=CSV);
Users
External collaboration settings
zone
subinterfaces