AQA Alevel Computer Science Paper 1 EXAM 2024
what is the most common hashing algorithm - ANSWER-to divide the key by the number of available addresses and take the remainder as the address
what is the pseudocode for adding an element into the queue - ANSWER-sub unqueue(newitem)
if isfull the
o...
what is the most common hashing algorithm - ✔✔✔ANSWER-to divide the key
by the number of available addresses and take the remainder as the address
what is the pseudocode for adding an element into the queue - ✔✔✔ANSWER-sub
unqueue(newitem)
if isfull the
output ' queue is full'
else
rear < -- (rear + 1) MOD maxsize
,q[rear] <-- newitem
size <-- size + 1
end if
end sub
what is the pseudocode for initialising a queue - ✔✔✔ANSWER-sub initialise
front <-- 0
rear <-- -1
size<--0
maxsize <-- size of the array
end sub
what is the psuedocode for adding an item to a stack - ✔✔✔ANSWER-sub
push(item)
if isfull then
output ' stack is full'
else
top <-- top + 1
s(top) <-- item
end if
end sub
draw an example of a callstack - ✔✔✔ANSWER-
explain how a priority queue can be implemented - ✔✔✔ANSWER-by checking
the priority of each item in the queue starting at the rear and moving it along one
, place until an item with the same or lower priority is found at which point the new
item can be inserted
explain how a queue works - ✔✔✔ANSWER-new elements are added at the end
of a queue and elements are retreived from the front of the queue. The sequence of
items in a queue is determined by the order in which they are inserted
explain how functional abstraction is used in linked lists - ✔✔✔ANSWER-as
items are added to the list the pointers are adjusted to point to a new memory
locatio taken from the heap and when items are deleted pointers are again adjusted
and the freed up memory is de allocated and returned to the heap
explain how items are deleted from lists - ✔✔✔ANSWER-items are moved up to
fill the empty space then the last element is replaced with a blank
explain how to insert a new name into a list - ✔✔✔ANSWER-test for list already
full quit if it is
determine where new item needs to be inserted
starting at the end of the list move other items along one place
insert new item in correct place
how are hash functions created from alphanumeric strings - ✔✔✔ANSWER-e.g
CAB could be converted into ASCII values then adding those values and modding
it to get the remainder
how are lists implemented in python - ✔✔✔ANSWER-linked lists
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller NURSING2EXAM. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $17.99. You're not tied to anything after your purchase.
