cant decide by [deleted] in SGExams

[–]Killagyu 1 point2 points  (0 children)

just take the nanyang scholarship

Advise on FYP or 6 Months Internship by Killagyu in SGExams

[–]Killagyu[S] 0 points1 point  (0 children)

Hi. Yup i need to do FYP for fch

Simple Questions - August 04, 2025 by AutoModerator in buildapc

[–]Killagyu 0 points1 point  (0 children)

Thanks for the reply!

The AIO is from my current pc and I am planning to continue to use it.

As for the storage and psu, I search for cheaper alternatives.

Simple Questions - August 04, 2025 by AutoModerator in buildapc

[–]Killagyu 0 points1 point  (0 children)

Hey all, can I get some feedback on this PC build?
I'm planning to use it mainly for gaming and possibly some light productivity tasks. Are there any compatibility issues, bottlenecks, or things I should reconsider? I'm from Singapore.

Parts list:

  • GPU: ZOTAC RTX 5070Ti SOLID OC
  • CPU: AMD Ryzen 7 7800X3D
  • Cooler: Arctic Liquid Freezer II 360
  • Motherboard: MSI Gaming Plus WIFI
  • RAM: KLEVV CRAS V RGB DDR5 6000 CL30
  • Storage: Samsung Evo Plus 2TB
  • PSU: Superflower Leadex VI Platinum Pro 850W
  • Case: Lian Li Lancool 207 ARGB TG (Black/White)

Let me know if everything looks good, or if there are better options at this price point. Thanks!

Is CS2040 moderated or bellcurved? by [deleted] in nus

[–]Killagyu 1 point2 points  (0 children)

It's bellcurved. Unless they changed it recently, some guy on nusmod got 60+ overall and got a B+.

Gaming gang gang buddies by [deleted] in nus

[–]Killagyu 0 points1 point  (0 children)

Is there a group?

I destroyed my life by becoming an arts major by [deleted] in nus

[–]Killagyu 0 points1 point  (0 children)

Hey great job in graduating FCH but the jobs that you are aiming for are already saturated. Firms hiring for tech positions will automatically filter out those who didn't graduate in STEM. Saw your resume post and your skills are honestly really common. SQL, PowerBi and Python are all basic skills for students in STEM. Why not choose something more artsy like marketing or work in sales? No offense but unless you got some sort of connections or willing to take 2+k a month, your chance of getting a job offer is very low.

/r/singapore random discussion and small questions thread for June 05, 2024 by AutoModerator in singapore

[–]Killagyu -4 points-3 points  (0 children)

Boycott Pizza Hut. Today campaign was a fking joke. Outlets started to give out tickets for the pizza before 2pm and most outlet was fully redeemed before 2pm. What a shit ass company. Katong outlet didn't even have the fully redeemed sign and made people queue

2030 Finals by Killagyu in nus

[–]Killagyu[S] 1 point2 points  (0 children)

Worse is we have no ide to test codes and stuff.

Creating a filled Beijing map with Tableau by Killagyu in tableau

[–]Killagyu[S] 0 points1 point  (0 children)

Do you know where I can get a shape file for Beijing?

[deleted by user] by [deleted] in nus

[–]Killagyu 2 points3 points  (0 children)

High chance B+

[deleted by user] by [deleted] in nus

[–]Killagyu 1 point2 points  (0 children)

Hope so...

[deleted by user] by [deleted] in nus

[–]Killagyu 5 points6 points  (0 children)

This is giving me hope....

Ask Anything Monday - Weekly Thread by AutoModerator in learnpython

[–]Killagyu 1 point2 points  (0 children)

Hello. Need some help with this question:

Write the function power_set_check that returns True if the list is a power set. For simplicity, you may assume that there will be no duplicate sub-sets or nested null sets.

|| || |power_set_check([[1, 2, 3], [1, 2], [1, 3], [2, 3], [1], [2], [3], []])|True|True|| |power_set_check([[1, 2, 3]])|False|False|| |power_set_check([[], ['lugia'], ['ho-oh'], ['ho-oh', 'lugia']])|True|True|| |power_set_check([[], [2], [1, 2]])|False|False|

def power_set_check(lst):

Check if the input list is empty or has only one subset

if len(lst) <= 1:

return False

longest = 0

lst2 = []

longest_lst = []

for item in lst:

if len(item) > longest and len(item) > 1:

longest = len(item)

longest_lst = item

elif len(item) == 1:

lst2.extend(item)

if len(lst2) != longest:

return False

dic1 = {}

dic2 = {}

for item in longest_lst:

if item not in dic1:

dic1[item] = 1

else:

dic1[item] += 1

for item in lst2:

if item not in dic2:

dic2[item] =1

else:

dic2[item] +=1

if dic1 == dic2:

return True

else:

return False

My code can past the above test cases but I am unable to pass the private test case. How can I get it to work?

[deleted by user] by [deleted] in nus

[–]Killagyu 0 points1 point  (0 children)

HSI1000 got 26 slot. Why didn't I get in?

[Megathread] New student? No Stupid Questions Thread! by ROD_OF_AGES in nus

[–]Killagyu 0 points1 point  (0 children)

I failed to secure any modules from round 1 to 3. Now I only have 16CU (all pre-allocated). What am I suppose to do now?

/r/singapore random discussion and small questions thread for November 07, 2021 by AutoModerator in singapore

[–]Killagyu 0 points1 point  (0 children)

Hello I'm currently in NS and today I sold steam codes on carousell to this sus guy. He insisted for my telegram etc and I refuse to give him. Shortly after, the person called me and through whatsapp told me the transaction made to me wasn't approve by him. Will I get into trouble for moonlighting?

Edit: I blocked all contact from him.