Comp 1 Questions 0.0 / 5 ? ComputingProgramming & Systems DevelopmentA2/A-levelWJEC Created by: IqbalKhanCreated on: 25-04-18 09:19 Describe the binary tree data structure Describe the binary tree data structure 1 of 8 Describe the De-Morgan's law Boolean Identity Describe the De-Morgan's law Boolean Identity 2 of 8 Explain the time and space/memory complexity of both the bubble and insertion sort algorithms Explain the time and space/memory complexity of both the bubble and insertion sort algorithms 3 of 8 Name and explain each of the binary tree traversal methods Name and explain each of the binary tree traversal methods 4 of 8 Name the 2 formal methods of expressing language syntax unambigously Name the 2 formal methods of expressing language syntax unambigously 5 of 8 Describe the principle stages involved in the compilation process Describe the principle stages involved in the compilation process 6 of 8 Name at least 4 legislations that are related to computer science Name at least 4 legislations that are related to computer science 7 of 8 Describe the difference between compilers, interpreters and assemblers Describe the difference between compilers, interpreters and assemblers 8 of 8
Comments
No comments have yet been made