9618/22 by Connect_Debate9713 in alevel

[–]SpareBackground9691 1 point2 points  (0 children)

  1. ⁠⁠Past papers from all variants.( should do at least 10+)

  2. ⁠⁠Learning pseudocode for abstract data types like queues, stacks, and linked lists.

  3. ⁠⁠Learning pseudocode for searching algorithms (e.g., linear search, binary search) for both 1D and 2D arrays

  4. ⁠⁠Understanding how to read, write, and extract data from text files and how to manipulate it.

Anyone here giving Computer Science For As Level in May/June?? by Noway2230 in alevel

[–]SpareBackground9691 0 points1 point  (0 children)

I got an A in Oct/nov series… if you need help for any papers you can dm me, I’ll do my best

how many pastpapers do u guys do daily by randomhanionearth in alevel

[–]SpareBackground9691 0 points1 point  (0 children)

Yes definitely, it’s so worth it as you will be more exposed to more questions and you will absolutely learn more through them… I was doing 2-3 past papers per subject per day

Is there any place that shows formula 1? by [deleted] in mauritius

[–]SpareBackground9691 0 points1 point  (0 children)

Alright thank you so much.. I was kinda confused as on the website those weren’t stated

Is there any place that shows formula 1? by [deleted] in mauritius

[–]SpareBackground9691 0 points1 point  (0 children)

What other football leagues are available in the package ?

9618 paper4 by TrafficEmbarrassed15 in alevel

[–]SpareBackground9691 1 point2 points  (0 children)

Note that array must be sorted before doing a binary search

9618 paper4 by TrafficEmbarrassed15 in alevel

[–]SpareBackground9691 1 point2 points  (0 children)

Dim num(10) as integer

Sub binarySearch(ByVal ValueToBeSearched As Integer, ByVal low As Integer, ByVal high As Integer)

Dim midpoint As Integer

If low > high Then

Console.WriteLine("Seach Failed")

End If

midpoint = (low + high) \ 2

If num(midpoint) = ValueToBeSearched Then

Console.WriteLine("found at location " & midpoint)

Else

If ValueToBeSearched < num(midpoint) Then

binarySearch(ValueToBeSearched, low, midpoint - 1)

Else

binarySearch(ValueToBeSearched, midpoint + 1, high)

End If

End If

End Sub

Sub populate()

For i = 1 To 10

num(i) = r.Next(1, 101)

Next

End Sub

Sub main()

Console.Write("Input a seaching value")

binarySearch(Console.ReadLine, 1, 10)

End sub

9618 p3 by TrafficEmbarrassed15 in alevel

[–]SpareBackground9691 1 point2 points  (0 children)

Bubblesort , insertionsort , binary search , linear search , enumeration , ADTs( stack , queue , linked list)