The Good Bad Tendency table is a chart that collects what was done well, what was done poorly, and the exam tendencies immediately after taking an exam during preparation and the exam itself. Through this table, you can maintain what was done well, improve what was done poorly, and better prepare for the next exam by understanding the exam tendencies.
Below is the table for Yonsei University undergraduate exams.
GBT Table of Yonsei Univ. SIT
Term
Class Name
Cheat sheet
Study plan
Good
Bad
Tendency
Exam date
Exam note
Professor
Last edited time
2-1-Midterm
- Making single A4 cheat sheet
- Going over all the slides
- It takes much more time about 6 hours to solve all hw. Start earlier.
# Review
It was very easy and took just 50 mins.
# Problems
1. Simple closed loop system with proportional controller K. Do Routh array to make the system stable and get inequation of K
2. Complex multiple loop system. Get TF w.r.t R and W. Check e_ss when R is step or ramp. And express the system Type
3. Simple TF. Get constants K when overshoot is 0
4. Simple L(s). Drawing Root Locus.
Jiwon Seo
Oct 25, 2025 11:59 AM
2-1-Final
D-2:
- Review mid-term scope (30M)
- Making cheat sheet 65%, 5H
D-1:
- Making cheat sheet, 3H
D-0:
- Solving hw problem one more time: 5H
# Review
Harder than middle term exam but it was okay
# Problems
1. Calculate overshoot, settling time, rising time of the given simple feedback block diagram.
2. With dynamic compensation, make the system stable and draw root locus.
3.
4. Design control law and full-order estimator with 4 by 4 matrix state variable.
5. Design reduced-order estimator with matlab code.
Dec 13, 2025 17:00
- The entire scope
- Two double-sided cheat sheets are allowed.
- Need calculator
Jiwon Seo
Dec 11, 2025 04:21 AM
2-1-Midterm
- Must go over hw process. Didn’t solve problem…
- Look over entire problems quickly and distribute time properly. The last problem was the hardest. But exhausted time to front part.
- FOCUS and solve as possible as quickly. I was too loose.
# Review
5 and 6 was difficult. Should look the actual mechanism.
# Problems
1. Tell the procedure of process context switching
2. Tell the method of system calling ⇒ It was exactly same as hw1
3. 🤨 The difference between process and thread
4. Tell the process life cycle
5. 😭 Calculate the size of entire page table size when 5 process occupies half of the possible memory
6. 😭 The final TLB status with actual VA. Have to use LRU manually
Oct 21, 2025 10:00
Songkuk Kim
Oct 25, 2025 12:15 PM
2-1-Final
D-4: 1/5 slide, 1H 30M
D-1:
- making cheat sheet, 10H
- Memorize codes 4H
D-0: Memorize code again, 1H
- Look over entire problems quickly and distribute time properly. The last problem was the hardest. But exhausted time to front part.
- FOCUS and solve as possible as quickly.
- Memorize homework code and the entire process as well
# Review
I finished the test just in time. It was not that hard. But I should have looked at the implementation process in my homework more closely."
# Problems
1. What is the condition of the deadlock? And how can you resolve deadlock?
2. 🤨 Make lock free linked list with CAS
3. Make unbounded buffer with semaphore
4. What is the advantage of file system which can use single 4KB block or eight 512byte blocks either? And how can you implement that file system?
5. 😅 What is the maximum file size when there are 8KB single block and inode file system which uses 12 direct blocks, single, double, and triple indirect blocks. The length of pointer which point to block is 4byte.
6. The FAT of all the files look like below. Explain each directories content. And draw the FAT.
music: 0, 3, 5
BestPart.mp3: 2, 1
Softly.mp3: 7, 6
7. What is the difference of
copy(/songs/a.mp3, /music/) and mov(/songs/a.mp3, /music/) ? Explain the entire processes in detail.
8. (Project 2-3) How can you make memory management on the xv6. Each process should have limits.
9. (Project 2-2) How can you make lottery scheduling on the xv6? Specify what you should modify and how you should modify.Dec 16, 2025 10:00
Songkuk Kim
Dec 12, 2025 02:15 PM
2-1-Midterm
- Check the calculating and processes again and again until exam ends completely. There was misconception at prob 1
# Review
It was quite easy.
# Problems
1. ⚠️ CNN. Stride 3, RGB filter size 5x5, 1 conv layer, 1 MLP. What is the number of weights for 20-class classification?
2. Explain transformer self-attention. Calculate the number of weights. D_k 25, input embedding 10, output embedding 20
3. Write and explain Adam Python code
4. Explain the benefits of depthwise separable convolution with examples
5. Add one residual connection to MLP, compare gradients, and explain why it's used
Jongseok Lee
Oct 25, 2025 12:30 PM
2-1-Final
D-2: making cheat sheet (5H)
D-1: making cheat sheet (5H), memorizing equations(3H)
D-0: look over (10M)
- Memorizing hw code was absolutely important
- Just memorizing equations which is very specific processes in some models was not helpful. I should have focused more on main comcept and stem of subject.
# Review
It was not that hard.
# Problems
1. In object detection, calculate AP given founded bound boxes.
2. Calculate bilinear interpolation and transposed convolution. Can you make the result of transposed conv same as bilinear? Prove mathematically don’t show just examples.
3. Explain the whole processes of self-supervised learning when you use rotation prediction to do pretext task and then use it to classify images.
4. How can you do video classification with 2D CNN and 3d conv? Explain each methods and compare both way’s pros and cons.
5. ⚠️Complete the python code of self attention. (It was hw2)
Dec 11, 2025 10:00
- After the mid-term
- No cheat sheet
- No calculator
Jongseok Lee
Dec 11, 2025 03:08 AM
2-1-Midterm
- Should look slide more and the context and explanation is important
# Review
There was so many problems and no time. Quite hard.
# Problems
1. 😆 z-transforms and inverse z-transforms. DTFT and IDTFT
2. 🤨 Why is periodic?
3. 🤨 Why should we do oversampling?
4. 🤨 Making one sample delay system with only cascade & parallel diagram
Changhyun Kim
Oct 25, 2025 12:34 PM
2-1-Final
D-1: Making cheat sheet 55% (6H 40M)
D-0:
Making cheat sheet 100% (5H)
Memorizing contrnts (1H)
Solving homework again (1H)
It didn’t include programming hw problem. I saved the time.
# Review
Normal difficulty. Many problems were originated form slides.
# Problems
1. Explain the difference between linear phase filter and nonlinear phase filter in terms of group delay, signal shape, etc.
2. Do all-pass decomposition of this system into minimum phase and all pass phase.
3. Show this system into difference equation and sketch amplitude response. Explain where does this filter uses. (Notch filter)
4. Sketch transposed form signal flow diagram of
5. Explain the implement method of impulse invariance and bilinear transformation. And what is the pros and cons for each method?
6.(a). is . Make ideal low pass filter as in z domain.
6.(b). Rectangular window, … (I don’t remeber)
7. Write down DFT and IDFT formula with twiddle factor.
8. Draw FFT butterfly diagram. What is the calculating complexity of FFT?
9.(a). In this spectrogram, what is the real world frequency of continuous noise? ()
9.(b). Show the edge enhancing impluse response in image processing.
‣
- After the mid-term
- No cheat sheet
- No calculator
Changhyun Kim
Dec 19, 2025 12:20 AM
2-1-Midterm
- Forgot to write down max cdf, pdf
# Review
2 was 8APSK
I didn’t learn average rate but how can I solve 3???
# Problems
1. and → error probability of system and when
2. 8PSK CFM, d_min, specific coordinate → CFM, Ideal constellation with 8 points
3. 🤨 average rate with nominal SNR
4. BPSK error probability
5. digital communication block diagram, convolution vs correlation, 😭max adding CDF, PDF
- Pizza!!
Me: 93
Avg: 75.8(140)
Max: 101
Min: 34
Std: 20.9
Chan-Byoung Chae
Oct 27, 2025 02:55 PM
2-1-Final
- Making cheat sheet D-1, D-0, 15H
- TA’s session was actually very important.
- I should have known anything I don’t know even professor didn’t explained in detail.
# Review
There were total 20 sub questions.
Professor didn’t include problems he said they would; instead, he included many questions he hadn’t explained in detail. TA’s session contents were important.
# Problems
1.(a). What is the actual reason of ISI?
1.(b) How can you resolve ISI problem with SVD? Draw its block diagram.
1.(c) How can you resolve ISI problem with OFDM? Draw its block diagram.
2.(a). What is the entropy of Gaussian distripution?
2.(b). What is the entropy of uniform distribution?
2.(c). Prove capacity equation using mutual information
3.(a)~(c) What is the array gain, diversity gain, alamouti, MRC
4.~5. What is MLD, Zero forcing, MMSE method and how can you implement it?
6.(a). [Non sense] 아빠 방이 너무 추워요. / 모서리에 가 있으렴. / 왜요? / (blank) ⇒ 모서리는 90도 니까.
6.(b). How did you implement CP-OFDM in your homework?
6.(c). What is difference between ZF and MLD?
6.(d). original = 10dbi. If the power is increased by 100 times, what is the power? ⇒ 40dbi
Dec 18, 2025 20:30
- Crib sheet only one side
- Entire scope
- Pizza!!
Me: 107
Avg: 90.7(150)
Max: 137
Min: 23
Std: 34.4
Chan-Byoung Chae
Dec 14, 2025 03:17 AM
How to prepare exam
Before entering classes
- If you have online courses, set video opening time at the calendar.
- Do homework as soon as possible.
During class
- Record all the classes.
- Write down all speakings of professor.
During exam period
- Make AI transcript and read it multiple times. Do not just read it but explain each contents in your mind for every script page. (D-7~)
- Make one side a4 cheat sheet. (D-2, D-1)
- Solve and all the homework again. (D-1)
- Use AI tool actively when can’t understand anything.
- As a result you need two days of buffer
- TA’s session is really important. Note all the contents and concentrate on that topics.
On the day of test
- Don’t forget your pencil case, calculator, allowed chaet sheet, tablet, practice paper
- Be at the test site in advance.
- Look up all the problems quickly.
- Solve each problem as fast as you can.
- Skip and solve the next problem when you don’t know how to solve.
After finishing test
- Note GBT table.









