benashbycomputing.wordpress.com
BenAshbyComputing | AS Computing | Page 2
https://benashbycomputing.wordpress.com/page/2
June 21, 2013. Data Structures Exam Questions (June 11). 6 B) Students must queue at a particular serving point in the canteen if they wish to purchase hot food. The Computing student intends to represent the queue of students waiting to be served as a dynamic data structure using a linked list. I) Explain what pointers the student will need to create and what they will be used for. What type of queue would the Computing student use to represent this situation? April 24, 2013. Most Recent Holder: A varia...
davidhalseyscomputing.wordpress.com
October | 2012 | David Halsey's Computing
https://davidhalseyscomputing.wordpress.com/2012/10
David Halsey's Computing. All about computing science…. Posted in October 2012. In programming languages, an array is a way of storing several items (such as integers). These items must have the same type (only integers, only strings, ) because an array can not store different kinds of items. Every item in an array has a number so the programmer can get the item by using that … Continue reading →. Http:/ www.eastaughs.fsnet.co.uk/cpu/execution-fetch.htm. A computer bus is a let of parallel wires that con...
davidhalseyscomputing.wordpress.com
Revision | David Halsey's Computing
https://davidhalseyscomputing.wordpress.com/2013/04/19/revision
David Halsey's Computing. All about computing science…. This entry was posted on April 19, 2013 and tagged alevel. One of the ways I am revising is by making a set of revision cards, (This is just a small selection of the set). I found that reading from the textbook wasn’t an effective way of encoding all the information I need to know in my brain. Effective techniques I found include revision cards, posters, and making colourful notes. 3 thoughts on “ Revision. April 19, 2013 at 10:16 am. My A2 Level Co...
benashbycomputing.wordpress.com
Data Structures Exam Questions (June 11) | BenAshbyComputing
https://benashbycomputing.wordpress.com/2013/06/24/data-structures-exam-questions-june-11-3
June 24, 2013. Data Structures Exam Questions (June 11). 5 D) if (TopOfStackPointer = 20). Output “The stack is full”. StackArray[TopOfStackPointer 1] — ANumber. TopOfStackPointer — TopOfStackPointer 1. This entry was tagged A2 Computing. Leave a Reply Cancel reply. Enter your comment here. Please log in using one of these methods to post your comment:. Email (Address never made public). You are commenting using your WordPress.com account. ( Log Out. Notify me of new comments via email.
benashbycomputing.wordpress.com
Lists | BenAshbyComputing
https://benashbycomputing.wordpress.com/2013/06/23/lists
June 23, 2013. A static abstract data structure. The amount of data does not change at run time. A dynamic abstract data structure. Uses pointers to vary memory used at run time. This entry was tagged A2 Computing. One thought on “ Lists. June 24, 2013 at 5:35 am. Yes, this is true, but far too brief! What are the advantages and disadvantages of each? Leave a Reply Cancel reply. Enter your comment here. Please log in using one of these methods to post your comment:. Email (Address never made public).
davidhalseyscomputing.wordpress.com
Stepwise refinement (page 13 of aqa textbook) | David Halsey's Computing
https://davidhalseyscomputing.wordpress.com/2013/03/25/stepwise-refinement-page-13-of-aqa-textbook
David Halsey's Computing. All about computing science…. Stepwise refinement (page 13 of aqa textbook). This entry was posted on March 25, 2013 and tagged 13. 12)What strategies will you apply? What resources will you use? How will you use these resources? In what order will you use these resources? Are the resources adequate for the task? 13) A module is a self-contained entity that results when a problem is divided into sub-problems; each module corresponds to a sub-problem. Continue to follow A4. Turn ...
benashbycomputing.wordpress.com
Operating Systems (Poem) | BenAshbyComputing
https://benashbycomputing.wordpress.com/2013/07/01/operating-systems-poem
July 1, 2013. OS the abrieviated,. Programs are executed,. Examples could be Windows or Mac,. Runexe has been computed. A click of the mouse,. The light tpping of the keys,. In my virtual computer,. No hardware I can’t please. You need my G-U-I,. Systems okay, I’m not concerned. Take me with you,. Everywhere you go,. Mountains or Oceans,. Server, embedded, I won’t run slow. One thought on “ Operating Systems (Poem). July 1, 2013 at 10:27 am. A for the effort of making it rhyme! Leave a Reply Cancel reply.