881. Fractional knapsack n=4, profits=(10,10,12,18), weights=(2,4,6,9), capacity=15. Max profit = ___.

Discrete Structures and Optimization • Greedy Algorithms • JUNE 2014

882. Which special case in the simplex method does NOT require reformulation? Alternate optimality; infeasibility; unboundedness.

Discrete Structures and Optimization • Linear Programming • JUNE 2014

883. Which statements are NOT correct? i. 2’s-complement of 0 is 0. ii. MSB cannot express magnitude. iii. n-bit 2’s-comp has 2ⁿ⁻¹ positives, 2ⁿ⁻¹ negatives, 1 zero. iv. Significant bits are 1’s for positive and 0’s for negative.

Discrete Structures and Optimization • Number Representations • JUNE 2014

884. Cards to guarantee: i.two aces of two suits, ii.two aces, iii.two same rank, iv.two different ranks.

Discrete Structures and Optimization • Pigeonhole Principle • JUNE 2014

885. Evaluate truth of: I. (∃!x P(x))→∃xP(x); II. (∃!x ¬P(x))→¬∀xP(x).

Discrete Structures and Optimization • Predicate Logic • JUNE 2014

886. If F is self-dual (F(x)=¬F(¬x)), how many Boolean functions of n variables are self-dual?

Discrete Structures and Optimization • Self-Dual Functions • JUNE 2014

887. Initial BFS for the given transportation table (not shown) yields minimum cost = ___.

Discrete Structures and Optimization • Transportation Problem • JUNE 2014

888. Preemptive priority scheduling (dynamic): a=2 waiting, b=1 running, q=1; P1–P4 arrivals as given. Finish times P1,P2,P3,P4 =

Operating System • CPU Scheduling • JUNE 2014

889. After P1’s extra R1 & R3, the system is ___.

Operating System • Deadlock Avoidance • JUNE 2014

890. Match deadlock handling techniques: a.Timeout ordering protocol b.Prevention c.Detection d.Recovery → codes? (i) Timeout ordering (ii) Prevention (iii) Detection (iv) Recovery

Operating System • Deadlock Handling • JUNE 2014

891. Disk queue requests to cylinders [98,183,37,122,14,124,65,67], head at 53 moving toward 0. Total head movements for SSTF and SCAN =

Operating System • Disk Scheduling • JUNE 2014

892. Pages 0–7, frames=4. Reference string missing—cannot compute LRU vs Optimal faults.

Operating System • Disk Scheduling • JUNE 2014

893. Which is NOT true about disk-arm scheduling?

Operating System • Disk Scheduling • JUNE 2014

894. Match file allocation: a=Contiguous,b=Linked,c=Indexed,d=Multi-level indexed codes below.

Operating System • File Systems • JUNE 2014

895. Unix free disk blocks list is stored in the ___.

Operating System • File Systems • JUNE 2014

896. Space to store bitmap of 1.3 GB disk with 512 B blocks =

Operating System • File Systems: Bitmaps • JUNE 2014

897. Paged system: TLB hit 70%, TLB=30 ns, mem=100 ns. Effective access time = ___.

Operating System • Memory Management • JUNE 2014

898. On a uniprocessor with arrival rate λ=5/min and service time=6 s, CPU utilization ρ is:?

Operating System • Performance Modeling • JUNE 2014

899. Linux OS uses

Operating System • Process Scheduling • JUNE 2014

900. Match schedulers: a=ML feedback,b=FCFS,c=SPN,d=RR codes below.

Operating System • Scheduling • JUNE 2014