Video

Amazing !! I really enjoyed watching this lecture and the previous lecturer hopefully rest of the course like this ..

Stupid students.

sir can you explain what is the resource or example of it and a instance when you say 1 resource with 12 instance in safe state example i know the deadlock happen when one or more process waiting each other but they wait in cpu or on the i/o queue also i know there is only cpu or even 2 in dual but how can get 12 instances thanks in advance you make a great course and waiting course for computer arcthicutre and internal of dbms

So fibonacci is also exponential if referred to input size since it's input is just a number, even with dynamic programming?

Thank You so much, sir. You have taught us such a really conceptual course with excellence. Hats off to you.

the greatest algorithms course that I had seem! Thank you professor for sharing this videos!

Question about E_TM example. Basically in S, we run R( M1(w) ) but we do not explicitly write it?

Who learns from these lectures like me in 2024? Thank you professor for sharing knowledge. I really appreciate it ❤.

❤ love all your videos. Thank you for sharing. I'm watching from France 🇫🇷

this is a gem With examples it helps a lot keep uploading other lectures professor

Is it the same content compared to this course czcams.com/video/3v6Li2A0mvI/video.html

I want to really thank you from the bottom of my heart for this series. My last required glass for graduation is Algos and it’s infamous for being the worst CS class in my university. I have struggled so much that I have failed the class twice and whenever I went to lecture I would be confused and wouldn’t understand a thing. However, your series is a godsend and I finally notice progress in my understanding of the subject. I really appreciate you making sure your students grasp the prerequisites of algos such as asymptomatic analysis and explaining it in a clear manner. P.S: I can’t donate much but if you have some website or donation link please share it. It’s the least I can do in exchange for saving my academic career.

The great lecture I evern found for compiler design in CZcams. Thanks.

Really exceptional lectures. I really enjoy them. Thank you for sharing. :)

Really enjoyed the lecture series. Thanks a lot

دكتورنا المحترم مكتوب ع موقع الجامعه انو هاي القائمه فيها Advanced Algorithm Design and Analysis وينهم الفيديوهات واذا موجودين من اي فيديو ل اي فيديو وشكرا

waoowwwww

Perfectly explained. Thank you

That's so much clear.. Thanks boss.

Thats so funny because I have also thought about computer science not being a "meaty science". I always thought that computer science is a good complement to other sciences (bio, chem, EE, ect) but not strong by itself. Maybe as yourself, this course will change my mind.

wow, thank you Professor

Thank you Sir for you videos. I am following 2 of your courses. The Compiler and Computation theory. I like the way you explain and teach.

I wish there was more elaboration on the reasoning behind the name. Like, why having only one variable at the left side makes this "context free"?

The question raised at 16:15 was never answered (the video was cut later). I'm very interested of what the answer was.

Such a marvelous course! Enjoyed every second!

4:40 You're saying each thread has its own stack and register. I understand having its own stack, as it's a software concept we (programmers) invented. But, how can each thread have its own register? Isn't that a hardware thing? Do modern CPUs come with these capabilities or did we create programatic abstractions to create the "illusion" of having multiple registers?

33:30 I'm curious, how do we know how is Windows' kernel structured given it's closed source?

شكرا دكتور

This course was truly amazing! I enjoyed every second of it. Thank you very much for taking the time to record it and upload it!

At 7:03, you're saying that type conversion doesn't belong to scanning. I thought that Float would have a different regex than Integer. Isn't that the case? If so, wouldn't that mean that it's part of the scanning process technically?

I'm wondering how can you differentiate between a letter that belongs to a category and a letter that needs a special treatment. For instance, let's say the state was "f". In the line where we do `cat = CatTbl[char]`, how would I know that this is part of a "[a-Z]" group or an F that's for instance part of the keyword "for"? I guess the categorization table would need to exclude any letter that needs a special treatment from the categories? So an F would be always mapped individually and never to Letter?

Thanks for the lecture Dr. Shobaki. I have a question: Wouldn't be First+(B' -> ∈) = {∈, eof, b}? For the example in 11:16 is irrelevant but I want to be sure

Your lectures are stunning, Dr. Ghassan, you deserve more views

When you said the class will use geometric series, did you mean the topics will be from calculus series?

I typically don't engage much with channels; I usually just watch videos and have-not subscribed. However, your Productive lecture not only inspired me a lot but also made me appreciate your teaching style. I'm not just learning about the operating system; I'm also learning Your teaching style. Best Content of OS on CZcams.

great

Solid gold

good

Thank you very much Dr. Ghassan

thank you for all the lectures. I was like "oh my, I'm understanding these" throughout the whole lecture series. You really are a valuable teacher

Amazing, prof. I wish there has a DS course

ربنا يجعله فى ميزان حسناتك يا دكتور يا ريت حضرتك اى كورس تشرحه تسجله لينا

أنت عظيم.... تحية لك ولكل اهل الاردن

الله يعطيك العافيه 🙏✨

Seems the 42 videos do not cover the whole book. Are there lecture PDFs?

loved the "tallest people" analogy 🔥

this lecture reminded me of the similar concept covered in the theory of computation playlist. 😌😌😌😌😌😌

INFO FOR FUTURE VIEWERS. In my opinion, after this you can check out the functional programming playlist as it contains the last 3 lectures of the CSC135 course.

good

This video was sadly really hard to watch due to that guy.