A-level Comp Science
flashcards
Decks in class (38)
# Cards
-
37. Queues0
-
38. Lists0
-
39. Stacks0
-
40. Hash tables and dictionaries0
-
41. Graphs0
-
42. Trees0
-
43. Vectors0
-
44. Recursive algorithms0
-
45. Big-O notation0
-
46. Searching and sorting0
-
47. Graph-traversal algorithms0
-
48. Optimisation algorithms0
-
49. Limits of computation0
-
50. Mealy machines0
-
51. Sets0
-
52. Regular expressions0
-
53. The Turing machine0
-
54. Backus-Naur Form0
-
55. Reverse Polish notation17
-
56. Structure of the internet13
-
57. Packet switching and routers9
-
58. Internet security0
-
59. TCP/IP, standard application layer protocols0
-
60. IP addresses0
-
61. Client server model0
-
62. Entity relationship modelling0
-
63. Relational databases and normalisation0
-
64. Introduction to SQL0
-
65. Defining and updating tables using SQL0
-
66. Systematic approach to problem solving0
-
67. Basic concepts of object-oriented programming0
-
68. Object-oriented design principles0
-
69. Functional programming0
-
70. Function application0
-
71. Lists in functional programming0
-
72. Big data0
-
A. Floating point form0
-
B. Adders and D-type flip-flops0
