701. If F and G are n-variable Boolean functions, which holds?

Discrete Structures and Optimization • Boolean Algebra • SEPT 2013

702. Match identities to names: (a) idempotent; (b) identity; (c) dominance; (d) absorption. Order a–d → iii, ii, iv, i.

Discrete Structures and Optimization • Boolean Identities • SEPT 2013

703. Number of 8-bit strings beginning with either 111 or 101 = _____.

Discrete Structures and Optimization • Combinatorics • SEPT 2013

704. Count triples (i,j,k) from 1..30 where (i+j+k)%3==0. Output?

Discrete Structures and Optimization • Counting Techniques • SEPT 2013

705. A simple graph on n vertices is guaranteed connected if it has how many edges?

Discrete Structures and Optimization • Extremal Graph Theory • SEPT 2013

706. Ways to paint 12 offices with 3 green,2 pink,2 yellow, rest white = ___.

Discrete Structures and Optimization • Permutations with Repetition • SEPT 2013

707. Express ∃!x P(x) using ∀,∃, logical ops.

Discrete Structures and Optimization • Predicate Logic • SEPT 2013

708. Which logic circuit is shown by an XOR gate symbol with a bubble?

Discrete Structures and Optimization • Boolean algebra • SEPT 2013

709. Correct predicate for “Every natural number has one successor”?

Discrete Structures and Optimization • Predicate logic • SEPT 2013

710. Minimum people for ≥50% chance two share a birthday is at least ________

Discrete Structures and Optimization • Probability • SEPT 2013

711. If an artificial variable remains in basic column of optimal simplex, solution is ________

Discrete Structures and Optimization • Simplex method • SEPT 2013

712. RR scheduling of A,B,C,D,E bursts6,1,2,1,5 (1 ms slice) yields avg turnaround ________

Operating System • CPU Scheduling • SEPT 2013

713. With 10 resources and P,Q,R max8/7/5, alloc4/1/3, requests: P+2, Q+2, R+2. Safe request(s) are ________

Operating System • Deadlock Avoidance • SEPT 2013

714. Given I/O requests [65,80,110,100,175], head at 65 moving up at t=160, using SSTF and LOOK, seek times are:

Operating System • Disk scheduling • SEPT 2013

715. Unix with 12 direct, 1 indirect, 1 double-indirect pointers, block=256B, addr=2B. Max file size = ?

Operating System • File systems • SEPT 2013

716. Match: (a) Dangling ptr (b) Page fault (c) List repr (d) Toss-immediate — (i) Buffer-repl (ii) Variable-length records (iii) Object identifier (iv) Pointer swizzling

Operating System • Memory management • SEPT 2013

717. Portion of Windows 2000 that isn’t portable is ________

Operating System • OS Architecture • SEPT 2013

718. Match Windows OS layers: (a) HAL (b) Kernel (c) Executive (d) Win32 subsystem — (i)… (iv)…

Operating System • OS Architecture • SEPT 2013

719. 3-frame memory, ref string 5,4,3,2,1,4,3,5,4,3,4,1,4. FIFO and second-chance page faults are ________

Operating System • Page Replacement • SEPT 2013

720. Which is not true of distributed systems?

Operating System • Principles • SEPT 2013