Skip to main content

Something

Todai Entrance Exam: Subject 2009 – Problem 2

October 5, 2019October 5, 2019 vynguyen Leave a comment

(1) & (2) (4) & (5) a: 000, b: 101, c: 001, d: 110, e: 010    

Read More

Todai Entrance Exam: Subject 2013 – Problem 2

September 28, 2019September 28, 2019 vynguyen Leave a comment

(1) “A sequential circuit is an interconnection of flip-flops and gates.”. Reference: Page 28 of Computer System Architecture (3rd Edition) by M. Morris R. Mano. (2) Reference: MOD Counters and Subject 2017 – Problem 2. It seems like a mod- counter is a counter with flip-flops. And it seems to me that D-flip-flops cannot be used […]

Read More

Todai Entrance Exam: Subject 2017 – Problem 2

September 27, 2019September 27, 2019 vynguyen 1 Comment

Reference: Page 24 and Page 51 of Computer System Architecture (3rd Edition) by M. Morris R. Mano. (1) Asynchronous counter (see clock ripple) (2) Synchronous counter (pay attention to AND gates) (3) Reference: Page 11 and Page 30 of Computer System Architecture (3rd Edition) by M. Morris R. Mano. Larger 5 & 6-variable Karnaugh Maps. […]

Read More

Todai Entrance Exam: Subject 2009 – Problem 1

August 11, 2019August 11, 2019 vynguyen Leave a comment

(1) Reference (F-matrix):https://kats.issp.u-tokyo.ac.jp/kats/circuit4/doc/presen/circuit_2.pdf     (2)     (3) This is an open circuit so (reference: wikipedia & mit courseware).     (4)     (5)    

Read More

Todai Entrance Exam: Subject 2010 – Problem 3

August 11, 2019August 11, 2019 vynguyen Leave a comment

(1) Skip (2)     A worst-case example:     (3) Reference: 3 & 4 & 5. It is possible to implement path compression and reduce the number of loop iterations in the “find” function. However, a linear tree is still built (and broken after one reference from lower-level nodes) and union by rank is […]

Read More

Todai Entrance Exam: Subject 2010 – Problem 1

August 10, 2019August 10, 2019 vynguyen Leave a comment

(1)         (2) We see that:     So: (3) (4) When the input signal is amplified into a wider range, its overall shape is less likely heavily distorted by the noise. It makes the input signal to be more tolerant against noise in communication. Reference: see slide 12-14.

Read More

Todai Entrance Exam: Subject 2011 – Problem 3

August 10, 2019August 10, 2019 vynguyen Leave a comment

(1) The variable is not resetted to when we start counting a new . Add right after the line to correct the code. (2) merge(L1, L2) { for (word1, freq1) in L1 { for (word2, freq2) in L2 { if (word1 is word2) { output_pair(word1, freq1 + freq2) break } } } } (3) We […]

Read More

Todai Entrance Exam: Subject 2011 – Problem 1

August 10, 2019August 10, 2019 vynguyen Leave a comment

(1) There is a short-cut at the ammeter position (reference), so:     (2) 2R (3) (reference). (4) (reference). (5) In Figure 1:     In Figure 2:     (6) An error on a resistor of the first circuit will affect the value of only one bit, the current value is guaranteed to be […]

Read More

Todai Entrance Exam: Subject 2013 – Problem 3

August 10, 2019August 10, 2019 vynguyen Leave a comment

(1) Skip. (2) The adjacency matrix representation uses 36 memory units. The adjacency list representation uses 20 memory units. Therefore, the adjacency matrix representation uses more memory space than the list representation. (3) Let be the number of edges. The adjacency matrix representation uses memory units while the adjacency list representation uses memory units ( […]

Read More

Todai Entrance Exam: Subject 2012 – Problem 1

August 9, 2019August 9, 2019 vynguyen 1 Comment

(1) I make a reference to the previous problem:     (2)     (3) From (2), together with (Laplace transform of unit step function):             If : is oscillatory. If : is critical. If : is non-oscillatory because is always a real number with zero imaginary part (). (4) […]

Read More

Posts navigation

1 2 … 16 Older posts

Archives

  • October 2019
  • September 2019
  • August 2019
  • July 2019
  • June 2019
  • May 2019
  • April 2019
  • March 2019
  • February 2019
  • April 2018
  • March 2018
  • October 2017
  • June 2017
  • March 2017
  • February 2017
  • December 2016
  • November 2016
  • October 2016
  • September 2016
  • August 2016
  • July 2016
  • June 2016
  • May 2016
  • April 2016
  • March 2016
  • February 2016
  • January 2016
  • December 2015
  • November 2015
  • October 2015
  • July 2015

Meta

  • Log in
sparkling Theme by Colorlib Powered by WordPress