Відео

I think you are the jesus christ of computer science. Thank you sir.

북딱

Thanks

do we need to proof all of them.. or just one to say that this a correct code PLEAASE ANSWER ME !!!!!!!

first comment

Great video

Thank you, Dr. @andyguna, for sharing these videos. Any chance some of the videos that are private in this list could be made accessible if possible? Thank you!

asshole

Thank you sir, awesome! You study us a topic and jump to another topic which is not on the same subject matter. Please sir continue a particular computer science subject like T.O.C, artificial intelligence, software engineering, as your teaching is precise to understand. Thank you sir very much

This the is the BEST video I HAVE EVER SEEN ON THIS CONCEPT. THANKYOU

you can find mergesort in this collection - www.cubits.ai/collections/25

Looks like someone forgot to press record for that merge sort session😞😞

You access the complete curated course with questions from cubits.ai that includes search, transcripts, quizzes and Q&A www.cubits.ai/collections/48/?key=53afdd93-c4c3-4879-8237-c05c415b61f2 limited free access code: RLKOwR6c

Why take the substring from [1...j]? Why not [0...j] @ ua-cam.com/video/hBXzOq_1yRk/v-deo.html

You made it sir! I think there is no simpler way to instruct. Please use your great knowledge and skill to take the noise apart from the voice for the next video using SVD 😁

excellent explanation! very enlightening, I think I should transfer my tuition fee to here, uhahaha

Its great to see you posting again! Its been too long Andy. I look forward to seeing what you get up to in the future professor!

where is mergesort?

will not work with hoare partitioning (not sure why!?!) When I use hoare partitioning i get an unsorted k sized sub-array, and i need to sort this sub-range from 0 to k - 1 to get the Kth smallest. Now if the array has duplicates, we cannot use quick-select to get the kth, as there may be a duplicate at that location.

Is there any converter which converts DFA to Source code ?

This was very helpful, thank you very much!

NOW I CAN SOLVE ALL 15 GATE PREVIOUS YEAR QUESTIONS ON LOOP INVARIANTS

Sir, when you will be live again to bring computer science lectures

So good :) I had no idea that I would enjoy this stuff so much

This is one of the best video for actual kmp explanation

I followed everything up until 8:23. What method was used to conclude that K' is equivalent to K+6i+3? More so wanting to know why it was set up to be equivalent in the form of K = K'?

Isnt i<=x an easier Loop invariant?

thank you i have a test tomorrow

The textual representation should be a regular expression. In your example, the regular expression should be (n+a+o)* nano (n+a+o)*

Great concise lecture series!

We are developing a complete set of videos as a supplement to discrete structures for Computer Science students. You can access all the videos (when completed this summer) from CUvids (labs.cuvids.io/app/course/29/). The videos are under development but you can subscribe now to be notified when they are ready. You can also find other computer science related videos such as machine learning and NLP at www.cubits.ai/

ua-cam.com/video/OWKnwR1rkGI/v-deo.html There is a error here 2 and 7 needs to be swapped before exchanging 16 and 8 So the array should look like: 16 7 8 2 | 25 32 8 7 2 | 16 25 32 7 2 | 8 16 25 32 2 | 7 8 16 25 32 The elements shown after | are the ones already sorted.

Great great

Is this topic can be made as minimum easy so we can understand it fully..... Tough Machine Learning. only 20% I understand from this video even that already learn in my academic course....

Awesome 👍👍👍

more videos at cuvids.io

more free videos can be found at cuvids.io

More videos can be found at cuvids.io

ua-cam.com/video/o6uUYbDp51k/v-deo.html 41 and 13 has to be swapped

You can find many other high quality videos from Princeton University at cuvids.io/app/

You can find studio produced videos by top experts in Computer Science at Princeton University developed cuvids.io

who else is here because their professor is dogshit at teaching

You can find a lot of new videos on data structures and algorithms at cuvids.io

See the new Princeton University based curated video platform for really great videos on programming, data structures and algorithms - cuvids.io

See the new Princeton University based curated video platform for really great videos on programming, data structures and algorithms - cuvids.io

See the new Princeton University based curated video platform for really great videos on programming, data structures and algorithms - cuvids.io

See the new Princeton University based curated video platform for really great videos on programming, data structures and algorithms and more - www.cubits.ai/collections/