Відео

Absolutely. Should be posted in the next few days

That is correct.

@@erbcomputerscience Thanks a lot for the overall clarification on evidence doc! Hope you would bring out some more tips and tricks related to P4.

Glad you found it helpful!

Another full P4 walkthrough is on the way! Make sure to stay tuned as it should be posted in the next few days.

@@erbcomputerscience You're the best!

Just created another video since we were off today for the hurricane off the west coast here of FL in the U.S. Here is the link that covers a circular queue as well as how to use the evidence document. Hope it is helpful! ua-cam.com/video/pR9DRcG5NWM/v-deo.html

Yes. I will make a video in the next couple of days for you. I'll make sure you'll be ready and confident on how to do it on exam day. Just out of curiosity, you don't have a teacher but you guys still have the class at your school?

Here you go. Hope you find it helpful! ua-cam.com/video/pR9DRcG5NWM/v-deo.html

Thanks a lot

Here is the newest P3 walkthrough just uploaded: ua-cam.com/video/gPzgZ81h3pU/v-deo.html Hope it helps!

You're welcome. Glad it helped!

They are in the syllabus. Random Files do not show up on Paper 4 (because these are binary files) and only text files will show up on Paper 4. They could show up however on Paper 3. I will make a video (it will be sometime this week) going over random files and include some questions that could show up. I will also make a separate video on programming a dictionary so we can see it in action. I am thinking I can have both of those up by sometime this week? Sound good?

@@erbcomputerscience That's amazing thank you sir you're the best

Here is your dictionary video. Hope it helps! ua-cam.com/video/57nybipQMME/v-deo.html I will film the random files video later this weekend.

It does include containment and aggregation. I will get a video ready soon to cover both of these concepts. I am glad the videos are helpful!

Hoping for a video drop soon as exam's right around the corner. Thanks a lot

I'll try to get it up as quickly as possible. It will definitely be in the next few days if not later today. I'll let you know when it's posted and send you the link.

I thought containment is a concept more relevant to windows form

@@lovejoykufa6476 What do you mean by windows form?

You are welcome!

Glad they help!

Great question! The direction does not matter. They just want to see if you know it loops.

Absolutely. This is a great idea. It'll be up in the next couple of days. I'm just curious, are you testing in October of this year?

@@erbcomputerscience Yes sir, p4 is on 30 oct. Thanks

@@reflectmirror6371 I am currently making your video now. I saw your question about checking if a variable is a string and there is no method for that. What we can use though is a for loop that isolates each character and then uses the .isLetter method of the character class. I will put that in the video. The video will encompass multiple topics but I will put the string manipulation at the front for you so you don't have to search for it. Should be up in the next couple of days.

Not sure how I could remake those videos and make them better. It is impossible to display multiple pages at a time in a video without having the text very small. Is there a question you have where I can clarify something about trace tables for you? Do you have a question about SQL that I could clarify something?

You're welcome. Hope it helps!

There's definitely more on the way throughout the year. In the mean time you can check out the Paper 4 playlist which has lots of content that could show up on Paper 4. Computer Science 9618 Paper 4 Topics: ua-cam.com/play/PLaxAmCZMlFC2nrMaNcBUk4r1XeB9ouCZi.html

A great book that covers every topic is the Cambridge approved textbook. The ISBN number is 978-1-5104-5759-1. Hope this helps

I can do that and it sounds like a great idea. I will include how Cambridge tests this as well. I'll try to do it later this afternoon and if not by today, then within the next couple days.

Glad you found it helpful!

You're welcome! Hope it's helpful.

I just finished it up. Hope you find it helpful: ua-cam.com/video/oohxeQcMYGQ/v-deo.html

Do you think it will reappear in oct nov

I don't think so but it is possible. I think we will most likely see a stack with some type of search - either a recursive binary search which I have not seen in a couple years or a linear search. This of course is just a guess and I could be way off.

Glad you find the videos helpful!

Glad you find the content helpful! Glad you learned about LDX. We'll definitely leave it for any future students!

I'm glad you found it helpful!

Good morning. I do have both those videos. Let me know if I can clarify anything for you and I will be more than happy to. Here are the videos: Normalization ua-cam.com/video/EjyigAQyOus/v-deo.html ua-cam.com/video/q3FSWCoH7jA/v-deo.html Declarative Programming ua-cam.com/video/LlQmWR-If98/v-deo.html ua-cam.com/video/P-pVV2iKhqk/v-deo.html

You're welcome! Glad to hear they help!

This is variant 1 and the one I intended to do. If you would like variant 2 I can do that a little later in a couple or so weeks. These take a long time to do though. I don't mind making them, just finding the time is difficult at the start of the school year.

@@erbcomputerscience you ever do them in python?

@@erbcomputerscience i can understand but still thanks by the way i really appreciate it at least im learning something

​@@thabii.nGood afternoon. I have kicked around the idea and would like to, but I unfortunately just do not have the time. I'll tell you what I can do for you - pick any question from a P4 test (any variant) and I'll make a video doing it in Python for you if you would like. I have a couple other videos to do first (ones for my classes at school, not for UA-cam) and then I can do yours. Is that something you'd be interested in?

@@shaneerb6741 yes definitely, 2024 M/J variant 42 would be much appreciated, thank youu

I'm not sure what you are referring to? Edit: Are you referring to how much time students have on the exam? If so, they have more than 1 hour and 45 minutes. Students on paper 4 have 2.5 hours.

​@erbcomputerscience Sorry to confuse, in class you said an hour and 45 minutes was the cutoff or #3 would be rerecorded.

Ah I see now. Yeah that was the cutoff but I just couldn't get it under. I could if I cut off explaining code, but that wouldn't be beneficial to anyone who needs help with P4.

I haven't forgotten. I will be working on it this week. My students come back to school starting tomorrow so it's going to be a hectic week. This past week I've been getting stuff ready for them and my classroom. Should be up by the weekend.

Great news! I have finished recording it! My voice is completely shredded from all the talking this week with my students returning, but I have pushed through for you to get you this Paper 4. It is rendering now and I will check back in with the link as soon as I get it uploaded which will be done shortly.

Here it is: ua-cam.com/video/J3fcE3PUGIM/v-deo.html It should finish being processed soon. I hope you find it helpful!

@@erbcomputerscience Thanks boss.

Glad to hear it!

Good afternoon. That is a great question. A stack can be used by implementing it using a 1D array. Because it is a stack we should be using the stack pointers to keep track of the values in the stack and not specifically the index of the array even though the pointer points to a specific index. Also, if we look at the question for part d step 3: "depending on the user's choice call PopVowel() or PopConsonant()... If we look back into when we wrote these functions it mentions returning a string. Because we are returning a string we aren't able to return the index number. This question (for part d) requires us to use the functions PopVowel() and PopConsonant() dependent upon the user's choice. Could you check the index - technically speaking you could however Cambridge would not award you points because you are checking the index of the array instead of using the pointer that is used in the functions. Hope this helps. Let me know if you have any more questions!

@@erbcomputerscience Understood. Thanks

Good afternoon. I saw you request and recorded the video today. It updates the classic snake game which includes how to use a main menu and how to record the high score. Hope this helps! ua-cam.com/video/EVdVRoMlgZM/v-deo.html

@@erbcomputerscience Sir! You rock!! And this fast! :D

Good evening. I am sorry to hear it is not working. 9 times out of 10 when an error is occurring there is a curly brace out of place. For the error word it says invalid word, are you loading 2 files? There should be 1 file that loads the wordle words and another file that loads all 5 letter words. For example, if I have a file that loads a Wordle word, let's say it is "World" and I guess the word "Wrung" which is not inside the wordle file, it will say it is not a valid word. So make sure you are loading both files, not just 1. It sounds like 1 of 2 things and this is my guess: 1. The word you are typing in is not the word that is being stored in the string. Create a messagebox that outputs the built word when you hit enter and see if it matches what you type in. I am thinking the index is off by 1. 2. Make sure you have converted all the words to uppercase or the word you type in to lowercase. Choose one and make sure it is the same throughout. For example, "KAYAK" is not the same as "kayak". If it is saying it is an invalid word, go in and open the text file and see if that word is inside the file. For example, if you type "Witch" and it says not valid, I would open the file and search for that word. (Hit Ctrl+F to search so you don't have to scroll) Not sure why the backspace wouldn't be working. It is not a PC issue. Does your backspace key work on other programs? I know it sounds silly to ask, but we want to make sure the key actually works. Make sure you are also updating where you are in the word when using backspace. Those are my suggestions, please let me know if you are still having issues and I will do my best to help you.

@@erbcomputerscience Thank you for the help! The problem was in the file! I had only few words in both of the lists. So I loaded 936 5 letter words on both list, and now it works! Even backspace lol

Reading, writing and appending text files are on the 9618 curriculum. It is a question that could show up on Paper 2 and students often have to work with one on Paper 4. Is deleting a line of text on the curriculum? No. However, Cambridge often writes questions where students have to problem solve and use tools as a work around and I could see them asking a question like this in the near future.

@@erbcomputerscience fair enough. earned yourself a sub. keep it up brother

I think there will definitely be working with a text file, specifically reading from it and doing something with the data. That could be a bubble sort, insertion sort, implementing a queue, stack or even object oriented programming. Speaking of OOP those questions are very common and worth a huge amount of points. For OOP you'll need to be familiar with set and get methods, constructors, inheritance and polymorphism as well as creating an array of objects. Will it be as hard as May/June exams. It will be on the same level, but the more prepared you are the more manageable it becomes. OOP is almost certain. 1 of the 4 ADTs is also almost certain - stack, queue, linked list or binary tree. I imagine there will also be some type of search - linear or binary. Make sure you know how to do a recursive binary search because I doubt a standard binary search is what Cambridge is going to ask for. If you are feeling stressed keep in mind that November is still over 3 months away and that is plenty of time to get ready. My advice is to start where you are weakest and study that. After a week you'll see growth and you'll no longer be weak in that topic. Go through and find where you are weakest again and focus on that topic. Remember, these tests are hard but not impossible. Lots of students before you have done it and lots after you will do it. You can do this! Believe in yourself, invest time in yourself and you'll come out the other side with smiles. Please let me know if you have any questions and I'll do my best to help you out. I would say good luck, but it seems you won't need it! Go conquer that test!

@@erbcomputerscience Thank you, sir 🙏. I've been studying diligently every day, but as the exams are getting closer, I'm starting to feel quite stressed about all the subjects. I'm studying Computer Science, Maths, Accounting, and two AS levels-General Paper and French. While I feel confident about most of the papers, I'm particularly worried about P4.

Hello sir could you do a walkthrough on 9618 mj 41 22 question 1 specifically

Good morning. That is a typo on my part. It should've been ByRef ArrayNodes() As Integer so the data types match. By not doing this the parameter becomes an object data type. The code works, but it should be coded out correctly as you noted. It is always best practice to declare a data type for any parameter. I apologize for the oversight and thank you for pointing it out. Please let me know if you have any other questions. Have a great day!

What are you expecting for the upcoming nov oct exams for p4 . Binary tree or linked list you think so?? Am asking because syllabus has been updated and these has been a quite since they appear in p4 0:51

??

@SahilBheekharry I am thinking a linked list because I haven't seen that on the exam in a while but I would be ready for both just in case. In being ready for the binary tree I would definitely review pre and post traversal of that tree using a recursive procedure. OOP is also very popular and usually worth around 30 points or so.

@@erbcomputerscience thanks keep up the good job