About Me


Im A CS Freshmen Hopefully going to Graduate in 2024

Im Going to Study Abroad in My Third Year in CMUQ

Resume

Calender

Linkedin

Skills


10

HTML5

0

CSS3

0

jQuery

30

WordPress

40

Photoshop

10

Illustrator

Portfolio


Some Stats


310

Happy Clients

4700

Hours of Work

30

Awards Won

8

Years of Experience

HomeWorks


  • Feb 2013
    -
    Present

    Randy

    Who is Randy?

    A Carnegie Mellon University alumnus, Randy co-founded the Entertainment Technology Centre and led researchers who created Alice, a revolutionary way to teach computer programming.

  • Nov 2011
    -
    Jan 2013

    Creative Agency

    What was he known for?

    Professor Randy Is Known for the Alice project, it had proven benefits to help students get more engaged in computer science. He was also know for The entertainment Technology Centre

  • Dec 2009
    -
    May 2011

    Creative Agency

    5 Things I Liked

    I love how he talks about the importance of balancing out work and life. I like the part where he talks about "Effective vs Efficient" Reinforce behaviour you want to be repeated Never break a promise, renegotiate the deadline. Procrastination is the thief of time

NP Problem


  • 2010
    -
    2011

    Design University

    What is a decision problem? & What does it mean for a decision problem to be decidable?

    A decision problem can simply be simply defined as problems where the otputs are either a yes or no. - The problem is called decidable if there is an algorithm that solves the problem in a Limited amount of Steps

  • 2007
    -
    2010

    Design University

    What does it mean for a decision problem to be efficiently decidable? & What is the “P versus NP” question, intuitively?

    A decision problem is considred effectivley solvabale if A is a repeated set. - These issues remain (now denoted to as NP class issues), which we can test easily as plausible remedies (us guess). Yet we don't have a problem-solving algorithm. The concern is that NP problems should be easily fixed

  • 2004
    -
    2007

    School Name

    If you resolve the P versus NP question, how much richer will you be?

    The famous problem with P versus NP. If you can verify or disprove the cryptically short equation, you will be richer in a million dollars — and maybe even richer in billions of dollars, depending on your scruples. The value of P versus NP lies primarily in its computational consequences

New HW


Leave me a message