YAKILI | upper sixth computer science

Course / Course Details

upper sixth computer science

By - High School Computer Science Tutor
0 students
166 Hours 40 Min
(0)

Course Requirements

Upper-Sixth Computer Science course is designed to provide students with a comprehensive understanding of advanced concepts and skills in the field of computer science. This course aims to equip students with the necessary knowledge and expertise to pursue further studies or careers in computer science and related fields. Course Description: The Upper-Sixth Computer Science course will cover a wide range of topics, including but not limited to: 1. Advanced Programming: Students will delve into advanced programming languages and techniques, focusing on object-oriented programming, data structures, algorithms, and software engineering principles. 2. Artificial Intelligence: This module will introduce students to the fundamentals of artificial intelligence, including machine learning, neural networks, natural language processing, and expert systems. 3. Database Systems: Students will gain an in-depth understanding of database management systems, including relational databases, SQL queries, normalization, and data modeling. 4. Web Development: This module will explore advanced web development concepts, including front-end and back-end technologies, web frameworks, responsive design, and web security. 5. Computer Networks: Students will learn about the architecture, protocols, and security of computer networks, as well as network administration and troubleshooting.

Course Description

UPPER-SIXTH COMPUTER SCIENCE course is designed to provide advanced knowledge and skills in the field of computer science to students in their final year of secondary education. This comprehensive program aims to equip students with a deep understanding of fundamental concepts, principles, and applications in computer science. Through a combination of theoretical learning and practical hands-on experience, students will explore topics such as algorithms, programming languages, data structures, computer architecture, artificial intelligence, and software development. The course will also emphasize problem-solving, critical thinking, and analytical skills, enabling students to tackle complex challenges in the digital age. By the end of the UPPER-SIXTH COMPUTER SCIENCE course, students will have developed proficiency in programming languages, gained expertise in algorithm design, and acquired the ability to analyze and solve real-world problems through computational thinking. This course serves as a solid foundation for those aspiring to pursue higher education or careers in computer science, software engineering, data analysis, or related fields. With a professional tone of voice, this course aims to provide a rigorous and engaging learning experience, preparing students for the ever-evolving world of technology and innovation.

Course Outcomes

Course Outline: I. Introduction to Upper-Sixth Computer Science A. Overview of the course objectives and learning outcomes B. Introduction to the importance of computer science in today's world C. Discussion on the relevance of Upper-Sixth Computer Science in career prospects II. Fundamentals of Computer Science A. Understanding the basic components of a computer system B. Introduction to programming languages and their significance C. Exploring algorithm design and problem-solving techniques III. Data Structures and Algorithms A. Overview of data structures and their implementation B. Analysis of algorithms and their efficiency C. Hands-on exercises to practice implementing data structures and algorithms IV. Object-Oriented Programming A. Introduction to object-oriented programming concepts B. Understanding classes, objects, and inheritance C. Practical implementation of object-oriented programming using a programming language V. Database Management Systems A. Introduction to database concepts and models B. Overview of relational database management systems C. Hands-on experience in designing and querying databases VI. Web Development A. Understanding web technologies and protocols B. Introduction to HTML, CSS, and JavaScript C. Practical exercises to develop interactive web applications VII. Artificial Intelligence A. Overview of artificial intelligence and its applications B. Introduction to machine learning algorithms and techniques C. Hands-on projects to implement AI algorithms VIII. Ethical and Legal Considerations in Computer Science A. Discussion on ethical issues related to computer science B. Understanding legal aspects and intellectual property rights C. Case studies and debates on ethical dilemmas in the field IX. Project Work A. Independent or group projects to apply the knowledge and skills acquired B. Project planning, implementation, and documentation C. Presentation and evaluation of the projects X. Exam Preparation and Revision A. Review of key concepts and topics covered in the course B. Practice exams and quizzes to assess understanding C. Guidance on exam preparation strategies Note: This course outline is subject to modification based on the specific curriculum and requirements of the Upper-Sixth Computer Science program.

Course Curriculum

4 chapters
299 lectures
150 quizzes
166 Hours 40 Min total length

Toggle all chapters

1 Stored program concept

5 Min

N/A

3 Von Neumann model

5 Min

N/A

5 Compare the Von Neumann architecture with other architectures like Flynn, CRAY, Data flow and Harvard

5 Min

N/A

7 Explain briefly the characteristics of massively parallel computers

5 Min

N/A

9 Outline the roles of virtual machines

5 Min

N/A

11 Explain the benefits and limitations of virtual machines

5 Min

12 Explain how data are transferred between various components of the computer system

5 Min

N/A

14 Shared memory vs separate memory.

5 Min

N/A

16 Components of the CPU

5 Min

N/A

18 Explain the roles of the Arithmetic and Logic Unit (ALU), Control Unit (CU)and system clock, Immediate Access Store (IAS);

5 Min

N/A

20 Outline the factors that affect computer performance;

5 Min

N/A

22 Differentiate between RAM and ROM

5 Min

N/A

24 Differentiate between Static RAM (SRAM) and Dynamic RAM (DRAM)

5 Min

N/A

26 Illustrate memory hierarchy (pyramid).

5 Min

N/A

28 Explain the factors that contribute to the performance of the computer system (processor type and number of cores, bus width, clock speed, cache memory);

5 Min

N/A

30 Describe the stages of the Fetch-Execute (F- E) cycle

5 Min

N/A

32 Explain situations in which polling is done and where interrupts occur

5 Min

N/A

34 Illustrate the sequence of steps taken to process instructions/data by the CPU;

5 Min

N/A

36 Compare pipelining and parallel processing.

5 Min

N/A

38 Difference between Interrupt and Polling;

5 Min

N/A

40 Describe interrupt detection strategy.

5 Min

N/A

42 Explain the relationship between assembly language and machine code

5 Min

N/A

44 Trace a given simple assembly language program

5 Min

N/A

46 Explain instructions sets:data movement instructions

5 Min

N/A

48 Explain instructions sets: Input/output instructions

5 Min

N/A

50 Explain instructions sets: arithmetic operations

5 Min

N/A

53 Explain instructions: compare instructions;

5 Min

N/A

55 Manipulate machine instructions code (LOAD, STORE, ADD)

5 Min

N/A

57 Give examples of the different instruction formats

5 Min

N/A

59 Explain briefly the notion of fixed-length and variable-length instructions;

5 Min

N/A

61 Distinguish between different addressing modes including immediate, direct, indirect, register, relative and indexed.

5 Min

N/A

63 Distinguish between the use of kibi and kilo

5 Min

N/A

65 Distinguish between the use of mebi and mega

5 Min

N/A

67 Distinguish between the use of gibi and giga

5 Min

N/A

69 Distinguish between the use of tebi and tera

5 Min

N/A

71 Represent binary numbers in one’s and two’s complement ;

5 Min

N/A

74 Perform binary addition and subtraction

5 Min

N/A

76 Describe practical applications of Binary Coded Decimal (BCD) and Hexadecimal.

5 Min

N/A

78 Differentiate between combinational circuits and sequential circuits.

5 Min

N/A

80 Sketch the NOT, AND, OR, NAND, NOR logic gates

5 Min

N/A

82 Construct the truth tables for AND, OR, NAND, NOR gates

5 Min

N/A

84 Construct a logic circuit from a logic expression or a truth table

5 Min

85 Construct a logic circuit from a logic expression or a truth table

5 Min

N/A

87 Construct a truth table from a problem statement, a logic expression or a logic circuit;

5 Min

N/A

89 Derive a logic expression table from a problem statement, a truth table or a logic circuit;

5 Min

N/A

91 Implement logic gates using universal logic gates (NAND, NOR)

5 Min

N/A

94 Implement logic gates using universal logic gates (NAND, NOR)

5 Min

N/A

96 Circuits and components;

5 Min

N/A

98 Input and output of circuits;

5 Min

N/A

100 Produce truth tables for logic circuits including half adders and full adders

5 Min

N/A

102 Describe the SR and JK flip-flop;

5 Min

N/A

104 Describe the role of flip-flops as data storage elements;

5 Min

N/A

106 Draw a logic circuit and derive a truth table for a flip-flop;

5 Min

N/A

108 Perform Boolean algebra using De Morgan’s laws;

5 Min

N/A

110 Simplify a logic circuit/expression using Boolean algebra and Karnaugh maps.

5 Min

N/A

1 Describe the components of an information system

5 Min

N/A

3 Describe the different types of IS

5 Min

N/A

5 Discuss the need for an IS in an organization.

5 Min

N/A

7 Illustrate management levels in an organisation

5 Min

N/A

9 Illustrate how information flow within an organisation

5 Min

N/A

11 Describe the different phase require to develop and IS;

5 Min

N/A

13 Draw a data flow diagram.

5 Min

N/A

15 Identify elements of aGIS application interface

5 Min

N/A

1 Identify what makes an arrangement of data to be qualified as a database;

5 Min

N/A

3 Outline advantages and disadvantages of computerized and non- computerized database systems;

5 Min

N/A

5 Search and report on DBMS used in online or off-line applications;

5 Min

N/A

7 Describe procedures used to avoid the entry of erroneous or wrong data into the system.

5 Min

N/A

9 Identify different database types;

5 Min

N/A

11 Sort out the advantages of multiple file database systems over flat-file systems.

5 Min

N/A

13 Describe the significance of each relational database concept;

5 Min

N/A

15 Organize data into related tables;

5 Min

N/A

17 Select the appropriate data type for each field.

5 Min

N/A

19 Determine various relationships between tables or entities;

5 Min

20 Determine various relationships between tables or entities;

5 Min

N/A

22 Define Inner joins and Outer joins;

5 Min

N/A

24 Notion of constraints and constraints enforcement;

5 Min

N/A

26 Referential integrity Vs check constraints.

5 Min

N/A

28 Identify the fields belonging to each entity in a model;

5 Min

N/A

30 Select the key fields belonging to each entity;.

5 Min

N/A

32 Determine entity relationships and links;

5 Min

N/A

34 Represent a collection of data using an Entity-

5 Min

N/A

36 Relationship model

5 Min

N/A

38 Establish the reasons for normalization.

5 Min

N/A

40 Transform a table into First Normal form (1NF)

5 Min

N/A

42 Transform a table into Second Normal form (2NF)

5 Min

N/A

44 Transform a table into third Normal form (3NF)

5 Min

N/A

46 Transform a table into boyce Codd Normal form

5 Min

N/A

48 Identify functional dependencies (transitive dependencies)

5 Min

N/A

50 Identify functional dependencies (mutual dependencies)

5 Min

N/A

52 Identify functional dependencies and their significance in a RDBMS

5 Min

N/A

54 Create a database using an RDBMS (MS Access or Open base)

5 Min

N/A

56 Create tables, forms and reports in RDBMS

5 Min

N/A

58 Create tables, define and manipulate data using SQL.

5 Min

N/A

60 Implement joins

5 Min

N/A

62 Populate and retrieve data from a database using queries.

5 Min

N/A

64 Demonstrate knowledge of other relational database models.

5 Min

N/A

1 Explain the concept of algorithm

5 Min

N/A

3 Enumerate examples of problems solved by divide conquer;

5 Min

N/A

5 Write simple algorithms;

5 Min

N/A

7 Describe approaches to design algorithms (top- down and bottom-up design);

5 Min

N/A

9 Resolve a problem using problem solving models.

5 Min

N/A

11 Write search and sort algorithms;

5 Min

N/A

13 Compare sorting algorithms

5 Min

N/A

15 Compare searching algorithms

5 Min

N/A

17 Choose suitable search or sort algorithm for a given problem

5 Min

N/A

19 Apply sorting and searching algorithms to solve problems

5 Min

N/A

21 Estimate the complexity of an algorithm;

5 Min

N/A

23 Identify types of complexity (worst-case, best-case and average-case)

5 Min

N/A

25 Draw decision tables and state transition diagrams to represent conditions against actions.

5 Min

N/A

27 Transform an algorithm into a program

5 Min

N/A

29 Write a program

5 Min

N/A

31 Translate, test, run a high-level language using an IDE

5 Min

N/A

33 Identify features of an IDE

5 Min

N/A

35 Write programming codes using a given compiler

5 Min

N/A

37 Identify errors in a program

5 Min

N/A

39 Correct errors in a program

5 Min

N/A

41 Write codes with correct syntax.

5 Min

N/A

43 Write programs using arrays.

5 Min

N/A

45 Identify activities involved at each stage of a SDLC;

5 Min

N/A

48 Choose appropriate Software development model to develop software;

5 Min

N/A

50 Explain software reuse

5 Min

N/A

52 Analyse an existing program and make amendments to enhance functionality.

5 Min

N/A

54 Collect opinion of users on existing system to create a new one;

5 Min

N/A

56 Evaluate data gotten from different sources to make conclusion

5 Min

N/A

58 Make references to collected data and drawing a conclusion.

5 Min

N/A

60 Test a program

5 Min

N/A

62 Program testing Strategies

5 Min

N/A

64 Identify errors in a program;

5 Min

N/A

66 Correct programming errors

5 Min

N/A

68 Draw trace tables.

5 Min

N/A

70 Test Plans and test data (Normal data range, abnormal data range, Boundary data range).

5 Min

N/A

72 Identify reasons for programming error

5 Min

N/A

74 Explain debugging techniques

5 Min

N/A

76 Differentiate between corrective and preventive maintenance.

5 Min

N/A

78 Demonstrate the spirit of team work in the project development through communication;

5 Min

N/A

80 Document projects

5 Min

N/A

82 Propose a WBS (Work Break- Down Structure) for a given project;

5 Min

83 Produce scheduling tool (PERT network, Gantt chart) for a project

5 Min

N/A

85 Outline activities for the planning stage of a project;

5 Min

N/A

87 Structure of a project Development Plan

5 Min

N/A

89 Work with methods of controlling projects (tracking, check points ... )

5 Min

N/A

91 Implement a simple project

5 Min

N/A

93 Determine the duration of a project using a Gantt chart

5 Min

N/A

95 Compute the duration of a project using network diagram

5 Min

N/A

97 Calculate ES, EF, LT, and LF

5 Min

N/A

99 Determine slack task, critical path

5 Min

N/A

101 Identify computer crimes and prevention methods

5 Min

N/A

103 Describe issues addressed by existing standard codes of ethics and conduct(BCS, ACM,IEEE)

5 Min

N/A

105 Identify other existing code of ethics on the use of computer systems, for some organizations

5 Min

N/A

Instructor

High School Computer Science Tutor

Our high school computer science tutor plays a crucial role in helping students develop computational thinking skills, programming proficiency, and digital literacy.

0 Rating