Lecture 15 of COMP1927 "Computing 2 - Data Structures and Algorithms" the second semester course taken by first year undergraduates (computer scientists, computer engineers, software engineers, bioinformatic engineers) at UNSW
Thanks for your explamation. I just started my Master and this lecture is a perfect way to recall some of the basics (and to see some differences between C and C++). I really like this lecture, though the other one with the talks about Ethics and Professionalism is even better : )
by my first point i meant it is interesting to notice that even tho dynamically allocated structures might use memory more sensibly we can't escape that a push() call, like malloc(), might fail for lack of memory under *any* implementation. this conflicts with the traditional way we expect push to work in an unbounded stack.
so when we design an ADT we have to think carefully about responsibilities and decide who (ADT/Client) has to deal with this problem and how.
luckily i found these video.
MrPEDOCTOR 2 months ago
A noisy class but suddenly quiets at his command. Great mentor!
jhamien920 3 months ago
49:25 haaaaa and the laugh!!!! evil laugh rofl.
Penzziphotography 4 months ago
ms in electrical can any one tell requirement i wanna apply ? gpa?
coolbuddy613 6 months ago
You're too nice a teacher...I'd just flunk any lazy fools that don't want to actually practice
Vindignatio 7 months ago in playlist COMP1927 Data Structures and Algorithms - Richard Buckland
that's deeply clear and updated...! i'm joshua student from DR congo in South Africa
i found this lecture very scientific
koolmax11 11 months ago
@akinsurance You mean (x == y[3]) :P
sondreixixv 1 year ago
This lecture "freezes" at a critical point at (x=y[3])
akinsurance 1 year ago
Thanks for your explamation. I just started my Master and this lecture is a perfect way to recall some of the basics (and to see some differences between C and C++). I really like this lecture, though the other one with the talks about Ethics and Professionalism is even better : )
Nikolas
TheFooTheBar 2 years ago
by my first point i meant it is interesting to notice that even tho dynamically allocated structures might use memory more sensibly we can't escape that a push() call, like malloc(), might fail for lack of memory under *any* implementation. this conflicts with the traditional way we expect push to work in an unbounded stack.
so when we design an ADT we have to think carefully about responsibilities and decide who (ADT/Client) has to deal with this problem and how.
best regards,
richard
BucklandRichard 2 years ago