Back to Browse

GRE Computer Science Question 62

1.9K views
Apr 4, 2012
3:40

62. The Fibonacci sequence Fn is defined by F1 1, F2 1, and Fn Fn 2 Fn 1 for all integers n 3. What is the minimal number of D flip-flops required (along with combinational logic) to design a counter circuit that outputs the first seven Fibonacci numbers (i.e., F1 through F7 ) and then wraps around? (A) 3 (B) 4 (C) 5 (D) 6 (E) 7

Download

0 formats

No download links available.

GRE Computer Science Question 62 | NatokHD