In Activity-Selection problem, each activity i has a start time si and a finish time fi where si≤fi. Activities i and j are compatible if: (A) si≥fj (B) sj≥fi (C) si≥fj or sj≥fi (D) si≥fj and sj≥fi

1 Answer

Answer :

(C) si≥fj or sj≥fi 

Related questions

Description : State True or False. i) Master Development Plan basically is a schedule of various applications to be comprised. ii) It consists of start and finish dates of a system analysis, design implementation and maintenance activities. ... B) i-False, ii-True C) i-True, ii-False D) i-False, ii-False

Last Answer : A) i-True, ii-True

Description :  During a new project planning process to sequence activities, the project  manager, Nate, decides to use the precedence diagraming method to show the  identified activity dependencies. Which of the following logical ... -finish c. Finish-to-finish d. Start-to-start e. All of these answers

Last Answer : b. Start-to-finish

Description : Which one from the following is highly associated activity of project planning? (A) Keep track of the project progress. (B) Compare actual and planned progress and costs (C) Identify the activities, milestones and deliverables produced by a project (D) Both (B) and (C)

Last Answer : (C) Identify the activities, milestones and deliverables produced by a project

Description : ……………….. level is where the model becomes compatible executable code A) Abstract level B) Application level C) Implementation level D) All of the above

Last Answer : C) Implementation level

Description : For an activity in a CPM analysis, the early Finish time is 13 and the late Finish time  is 13. Duration of activity is 6. Which of the following statements is true?  A.The early start is 6 B. ... of the activity is 13  C.The slack of this activity is 13  D.The activity is on the critical path

Last Answer : D.The activity is on the critical path

Description : Free float for any activity is defined as the difference between A. its earliest finish time and earliest start time for its successor activity B. its latest start time and earliest start time ... its successor activity D. its earliest finish time and latest start time for its successor activity

Last Answer : A. its earliest finish time and earliest start time for its successor activity

Description : Select the incorrect statement. (A) Earliest start of an activity is the early event time of the node it leaves. (B) Latest finish of an activity is the late event time of the node it enters. (C) Latest start of an activity is its latest finish minus its duration. (D) None of the above

Last Answer : (D) None of the above

Description : Pick up the incorrect statement from the following: (A) The difference between the earliest start time and latest finish time of any activity, is the maximum time available for the activity (B) The ... start time and earliest start time of an activity, is called total float (D) None of thes

Last Answer : (D) None of these

Description : Total float for any activity is defined as the difference between (A) Its latest finish time and earliest start time for its successor activity (B) Its latest start time and earliest start ... earliest finish time (D) Its earliest finish time and earliest start time for its successor activity

Last Answer : (B) Its latest start time and earliest start time

Description : Pick up the correct statement from the following: (A) The duration between the earliest start time of the preceding event and latest finish time of the succeeding event, is called 'float' (B) ... C) The difference between total float and free float, is called interfering float (D) All the above

Last Answer : (D) All the above

Description : The EST + activity duration = .............................. a. Earliest Finish Time b. Latest Start Time c. Latest Finish Time d. None of these

Last Answer : a. Earliest Finish Time

Description : ..................... is the duration by which an activity can be delayed without delaying the completion of the project. a. Earliest Start Time b. Earliest Finish Time c. Latest Start Time d. Latest Finish Time

Last Answer : c. Latest Start Time

Description : Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue ... . (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Last Answer : (D) Both S1 and S2 are correct.

Description : . A schedule activity may begin 10 days before the predecessor activity finishes. This is an example of: A. Finish-to-Start B. Start-to-Finish C. Start-to-Start D. Finish-to-Finish

Last Answer : A. Finish-to-Start

Description : A schedule activity may begin 10 days before the predecessor activity finishes. This is an  example of: A. Finish-to-Start B. Start-to-Finish C. Start-to-Start D. Finish-to-Finish

Last Answer : A. Finish-to-Start

Description : At the completion of the forward and backward passes, the slack for an activity is given by the a. Difference between early start and early finish b. Difference between early start and ... c. Difference between latest start and early finish d. Difference between latest start and latest finish

Last Answer : c. Difference between latest start and early finish

Description : Select the correct statement. (A) Activity arrows in a CPM network are drawn to scale (B) The tail of an arrow represents the finish of an activity (C) Arrow bead represents the start of an activity (D) None of the above

Last Answer : (D) None of the above

Description : Select the incorrect statement. (A) Start float and finish float are always equal. (B) Total float can be either start float or finish float. (C) Start float and finish float need not be equal. (D) Start float and finish float are the differences between activity times and not event times.

Last Answer : (C) Start float and finish float need not be equal.

Description : Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? a) Insertion sort b) Quick sort c) Merge sort d) Selection sort

Last Answer : d) Selection sort

Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Last Answer : d) Heap sort

Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Last Answer : (C) Radix sort

Description : What is the difference between selection sort and bubble sort?

Last Answer : A: In selection sort, successive rounds are executed to select the element which is required to be placed in their sorted position, whereas, in bubble sort, every consecutive pairs of elements are compared ... element at every pass, whereas, in bubble sort we get the largest element in every pass.

Description : Which of the following operation is used if we are interested in only certain columns of a table? (A) PROJECTION (B) SELECTION (C) UNION (D) JOIN

Last Answer : (A) PROJECTION

Description : ‘AS’ clause is used in SQL for (A) Selection operation. (B) Rename operation. (C) Join operation. (D) Projection operation.

Last Answer : (B) Rename operation.

Description : Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Last Answer : b) Selection sort

Description : Which of the following algorithm pays the least attention to the ordering of the elements in the input list? a) Insertion sort b) Selection sort c) Quick sort d) None

Last Answer : b) Selection sort

Description : If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Last Answer : a) Insertion sort

Description : Which of the following is not an in-place sorting algorithm? a) Selection sort b) Heap sort c) Quick sort d) Merge sort

Last Answer : merge sort

Description : Which of the following is a stable sorting algorithm? a) Merge sort b) Typical in-place quick sort c) Heap sort d) Selection sort

Last Answer : a) Merge sort

Description : Which of the following is not a stable sorting algorithm? a) Insertion sort b) Selection sort c) Bubble sort d) Merge sort

Last Answer : b) Selection sort

Description : You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort

Last Answer : (D) Insertion sort

Description : .................. allows selection of the relevant information necessary for the data warehouse. (A) The Top-Down View (B) Data Warehouse View (C) Data source View (D) Business Query View 

Last Answer : Answer: A

Description : The unit of heat transfer co-efficient in SI unit is (A) J/M2°K (B) W/m2°K (C) W/m°K (D) J/m°K

Last Answer : (B) W/m2°K

Description : The SI unit of pressure  a. Pa  b. N  c. J  d. None of the above

Last Answer : Pa

Description : What is the SI unit of specific heat capacity?  A. J/kg  B. J/kg °F ∙  C. J/kg °C ∙  D. J/°C

Last Answer : J/kg °C

Description : Finish the sequence: J F M A M J J A S O N _. What letter goes in the space? -Riddles

Last Answer : The letter D because the letters are the first letters of months: January February March April May June July August September November So the D would be December.

Description : What is the output of the following code? a={1:"A",2:"B",3:"C"} for i,j in a.items(): print(i,j,end=" ") a) 1 A 2 B 3 C b) 1 2 3 c) A B C d) 1:”A” 2:”B” 3:”C”

Last Answer : a) 1 A 2 B 3 C

Description : A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is  P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Last Answer : (A) Pi || Pj for all i ≠ j Explanation: Bernstein's Condition: 1. If process Pi writes to a memory cell Mi, then no process Pj can read the cell Mi. 2. If process Pi read from a memory ... Mi. 3. If process Pi writes to a memory cell Mi, then no process Pj can write to the cell Mi.

Description : How many times the word 'print' shall be printed by the following program segment? for(i=1, i≤2, i++) for(j=1, j≤2, j++) for(k=1, k≤2, k++) printf("print/n") (A) 1 (B) 3 (C) 6 (D) 8

Last Answer : (D) 8

Description : Give the number of principal vanishing point(s) along with their direction for the standard perspective transformation: (A) Only one in the direction K (B) Two in the directions I and J (C) Three in the directions I, J and K (D) Only two in the directions J and K 

Last Answer : (A) Only one in the direction K

Description : Given that x=7.5, j=-1.0, n=1.0, m=2.0 the value of --x+j == x>n>=m is: (A) 0 (B) 1 (C) 2 (D) 3

Last Answer : (A) 0 

Description : In a positive-edge-triggered JK flip-flop, if J and K both are high then the output will be ............. on the rising edge of the clock. (A) No change (B) Set (C) Reset (D) Toggle

Last Answer : (D) Toggle 

Description : Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is (A) 726 (B) 796 (C) 506 (D) 616

Last Answer : (D) 616

Description : Independent float is the amount of time by which:  A. Start of the activity can be delayed without affecting the EST of subsequent  activity  B. reduces the float of subsequent ... without affecting EST  D. completion of an activity can be delayed beyond earliest possible finishing time

Last Answer : A. Start of the activity can be delayed without affecting the EST of subsequent  activity

Description : The time by which activity completion time can be delayed without affecting the start of succeeding activities, is known as (A) Duration (B) Total float (C) Free float (D) Interfering float

Last Answer : (C) Free float

Description : This activity is undertaken once the development activities start? A. Project Planning B. Project Monitoring and Control C. Project size estimation D. Project cost estimation

Last Answer : B. Project Monitoring and Control