Datasets:

hatakekksheeshh
/

CSE_course_RAG

License:

Dataset card Files Files and versions

xet

Community

CSE_course_RAG / data /Introduction_to_Computing /material /material.json

hatakekksheeshh

Upload folder using huggingface_hub

7ec75e2 verified 4 months ago

raw

history blame contribute delete

207 kB

	{
	"course": "Introduction_to_Computing",
	"course_id": "CO1005",
	"schema_version": "material.v1",
	"slides": [
	{
	"page_index": 0,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_001.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_001.png",
	"page_index": 0,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:39:50+07:00"
	},
	"raw_text": "B K TP.HCM INTRODUCTION TO COMPUTING Course Outline WEEK 1"
	},
	{
	"page_index": 1,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_002.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_002.png",
	"page_index": 1,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:39:58+07:00"
	},
	"raw_text": "2021 Course Outline 2 Kick-offvideos -https://www.youtube.com/watch?v=uMPeioUIQs (English) https://www.youtube.com/watch?v=lP7aJd8iqAo Vietnamese BK TP.HCM"
	},
	{
	"page_index": 2,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_003.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_003.png",
	"page_index": 2,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:40:07+07:00"
	},
	"raw_text": "Course Outline 3 Aims The goal of this course is to provide undergraduate students with . basic concepts of computer science and computer engineering overview of computer science and computer engineering disciplines basic programming techniques . With loT devices BK TP.HCM"
	},
	{
	"page_index": 3,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_004.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_004.png",
	"page_index": 3,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:40:14+07:00"
	},
	"raw_text": "Course Outline 4 Outline fundamental concepts of computer systems information systems computer architecture and computer hardware operating systems computer networks computer security social and ethical issues related to computing disciplines In particular, programming concepts including variable assignment, branching and looping - on loT devices BK TP.HCM"
	},
	{
	"page_index": 4,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_005.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_005.png",
	"page_index": 4,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:40:22+07:00"
	},
	"raw_text": "Course Outline 5 Student learning outcomes L.O.1. Describe basic hardware and software concepts . L.O.2. Use a programming language to develop a simple project, L.O.3. Recognize social impacts of a computing solution to organizations and society; L.O.4. Demonstrate the understanding of professional. ethical, legal, and social issues and responsibilities of computing practices; BK TP.HCM"
	},
	{
	"page_index": 5,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_006.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_006.png",
	"page_index": 5,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:40:34+07:00"
	},
	"raw_text": "Course Outline 6 L.0.1 Describe basic hardware and software concepts L.0.1.1 Able to describe different components of a computer system such as CPU, main memory, secondary storage, input and output devices, etc L.0.1.2 Able to describe different types of computer software such as system software, application software, etc L.0.1.3 Able to describe basic concepts in the field of computing such as Internet, Web Computer Networks, E-Commerce, etc. L.0.2 Use a programming language to develop a simple project L.0.3 Recognize social impacts of a computing solution to organizations and society L.0.3.1 Able to identify practical applications of a computing solution in organizations and society L.0.3.2 Able to give practical examples and analyze the value that computing solution can bring to organizations L.0.4 Demonstrate the understanding of professional, ethical, legal, and social issues and responsibilities of computing practices L.0.4.1 Able to describe some basic job titles in Information Technology and the skills needed for these job titles L.0.4.2 Be aware of plagiarism and how to avoid plagiarism mistakes when writing technical reports L.0.4.3 Be aware of software copyright and licence L.0.4.4 Be aware of threads to computer systems such as virus, denial of service attacks, computer crimes, etc. L.0.4.5 Beware of the rapid change in computing technology, and to keep up-to-date with new technologies, computing professionals to update their knowledge continuously BK TP.HCM"
	},
	{
	"page_index": 6,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_007.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_007.png",
	"page_index": 6,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:40:40+07:00"
	},
	"raw_text": "Course Outline 7 Textbook/reference book [1] Computing Essentials: Make IT Work for , (27th edition) Timothy J. O'Leary and Linda I. O'Leary, McGraw Hill,2019 [2] The C++ Programming Language, (4th Edition), Bjarne Stroustrup,Addison-Wesley, 2013 BK TP.HCM"
	},
	{
	"page_index": 7,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_008.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_008.png",
	"page_index": 7,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:40:47+07:00"
	},
	"raw_text": "Course Outline 8 Evaluation Lab/exercises: 10% : Midterm: 30% (MCQ + Additional Quizzes Assignment: 30% . Final exam: 30% (MCQ + Report) BK TP.HCM"
	},
	{
	"page_index": 8,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_009.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_009.png",
	"page_index": 8,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:40:54+07:00"
	},
	"raw_text": "Course Outline 9 Learning strategy Reading materials before the lectures . Attending lectures => Activities on the lectures s (->10%) . Practice at the lab => They are just summaries about the lectures Doing projects: . Two assignment projects Bonus: Technology Festival participation for those who performed well in the lab Attending final exams BK TP.HCM"
	},
	{
	"page_index": 9,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_010.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_010.png",
	"page_index": 9,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:41:01+07:00"
	},
	"raw_text": "Course Outline 10 Projects . Programming projects: Basic l/O Loop handling BK TP.HCM"
	},
	{
	"page_index": 10,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_011.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_011.png",
	"page_index": 10,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:41:09+07:00"
	},
	"raw_text": "Course Outline 11 Tentative schedule Week Lecture Lab Assignment 1 Course Introduction - Flowchart 2 Basic C++, types, variables 3 Assignment, l/0 operations 4 Branching Switch-loop Lab 1: Part 1 - Flowchart Part 2 - I/O C++ 6 Loop (cont.) - Functions Part 3 - if-elss 7 JVN architecture - Basic Hardware - Basic Types Lab 2: Assignment 1: l/0 Data Part 1: Loop 8 JVN architecture - Basic Hardware - Basic Types (Cont.) Part 2: Functions Deadline Assignment 1 9 Midterm --> revision Assignment 2: Loop handling 10 Network - loT loT part 1 Deadline Assignment 2 11 Plagiarism --> more revision 12 Invited Talk IoT part 2 BK TP.HCM"
	},
	{
	"page_index": 11,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_012.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_012.png",
	"page_index": 11,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:41:18+07:00"
	},
	"raw_text": "Course Outline 12 Contact Lecturers: . Quän Thanh Tho (gttho@hcmut.edu.vn Phan Duy Hän (han.phan@monash.edu) G. Jan Wilms (wilms@uu.edu) Nguyén Cao Tri (caotri@hcmut.edu.vn) Nguyén Thanh Binh (ntbinh@hcmut.edu.vn) Le Thanh Van (Itvan@hcmut.edu.vn) . Vuo'ng Bä Thinh (vbthinh@hcmut.edu.vn) : Truo'ng Quynh Chi (tachi@hcmut.edu.vn) .Le Trong Nhan (Itnhan@hcmut.edu.vn) TA and Course Cordinator Mai Düc Trung (mdtrung@hcmut.edu.vn) Nguyén Quang Düc (duc.nguyenquang@hcmut.edu.vn BK TP.HCM"
	},
	{
	"page_index": 12,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_013.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_013.png",
	"page_index": 12,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:41:24+07:00"
	},
	"raw_text": "2021 Course Outline 13 Course Website Course website: http://e-learning.hcmut.edu.vn BK TP.HCM"
	},
	{
	"page_index": 13,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_014.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_014.png",
	"page_index": 13,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:41:32+07:00"
	},
	"raw_text": "2021 Course Outline 14 INTRODUCTIONTOALGORITHMS AND FLOWCHARTS . An algorithm is defined as a step-by-step sequence of instructions that describes how the data are to be processed to produce the desired outputs . In essence, an algorithm answers the question: \"What method will you use to solve the problem?\". . You can describe an algorithm by using flowchart symbols. By that way, you obtain a flowchart. : Flow chart is an outline of the basic structure or logic of the program. Another way to describe an algorithm is using pseudocode .English-like phrases to describe an algorithm BK TP.HCM"
	},
	{
	"page_index": 14,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_015.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_015.png",
	"page_index": 14,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:41:40+07:00"
	},
	"raw_text": "2021 Course Outline 15 Flowchart Elements Terminal Input/output Process Connector Flowlines Predefined process Decision BK TP.HCM"
	},
	{
	"page_index": 15,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_016.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_016.png",
	"page_index": 15,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:41:47+07:00"
	},
	"raw_text": "2021 Course Outline 16 Example: Average of 3 Numbers Start Input a.b.c Calculate av= a+b+c/3 Display av End BK TP.HCM"
	},
	{
	"page_index": 16,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_017.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_017.png",
	"page_index": 16,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:41:53+07:00"
	},
	"raw_text": "2021 Course Outline 17 Branching false false true true test-condition tcst-condition S: S, S Exccuiestalement Executestatement afterif-statement afterif-statement If test-condition then S If test-condition then S else S2 endif endif BK TP.HCM"
	},
	{
	"page_index": 17,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_018.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_018.png",
	"page_index": 17,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:01+07:00"
	},
	"raw_text": "2021 Course Outline 18 Branching Example Start W Pseudo-code of the program. ReadA Input A ifA > 0 then calculate B = sqrt(A) no. print B A>0? else Print \" A is negative yes endif Calculate Print\"Ais B=sqrt(A) negative W PrintB BK End TP.HCM"
	},
	{
	"page_index": 18,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_019.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_019.png",
	"page_index": 18,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:08+07:00"
	},
	"raw_text": "2021 Course Outline 19 Looping & Example Start Sequence of instructions is NUM <-4 repeated for as long as the SQNUM< NUM3 loop condition is met Example: write a program to Print do the following task NUM, SQNUM : Print a list of the numbers from 4 to 9, next to each number, print the NUM< NUM + 1 square of the number. No NUM> 9? Yes BK TP.HCM STOP"
	},
	{
	"page_index": 19,
	"chapter_num": 0,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_020.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_0/slide_020.png",
	"page_index": 19,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:17+07:00"
	},
	"raw_text": "2021 Course Outline 20 Preparation for C++p programming This unit uses C++ to demonstrate many core programming concepts including branching, looping, ... C++ is powerful and fast . C++ is used extensively in many areas including software, games, embedded systems development . Install Visual Studio 2022 & Create First C++ Program I Dr Cat Can Code (English) https://youtu.be/M0Cr-u76Lil Cai dät Visual Studio 2022 va viét chuong trinh C++ dau tién I Meo Lap Trinh (Vietnamese) https://youtu.be/SwpS0ClELTU BK TP.HCM"
	},
	{
	"page_index": 20,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_001.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_001.png",
	"page_index": 20,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:20+07:00"
	},
	"raw_text": "Chapter 1 INTRODUCTION TO ALGORITHMS AND FLOWCHARTS Introduction to computer science"
	},
	{
	"page_index": 21,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_002.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_002.png",
	"page_index": 21,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:23+07:00"
	},
	"raw_text": "Chapter 1 Algorithms Using Flowchart to describe Algorithm Algorithm in pseudo-code Branching in Algorithms Loop in Algorithms 2"
	},
	{
	"page_index": 22,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_003.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_003.png",
	"page_index": 22,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:28+07:00"
	},
	"raw_text": "1. Algorithms An a/gorithm is defined as a step-by-step sequence of instructions that describes how the data are to be processed to produce the desired outputs. In essence, an algorithm answers the question: You can describe an algorithm by using flowchart symbols. By that way, you obtain a flowchart. F/ow chart is an outline of the basic structure or Iogic of the program. Another way to describe an algorithm is using pseudocode."
	},
	{
	"page_index": 23,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_004.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_004.png",
	"page_index": 23,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:31+07:00"
	},
	"raw_text": "2. Using Flowchart to describe algorithm Terminal Input/output Process Connector Flowlines Predefined process Decision Fig 1. Flowchart symbols 4"
	},
	{
	"page_index": 24,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_005.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_005.png",
	"page_index": 24,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:35+07:00"
	},
	"raw_text": "Example 2.1. Calculate the payment of an employee Fig. 2. Start Input Name Hours, Rate Note: Name, Hours Calculate Pay Hours x Rate and Pay are variables in the program. Dislay Name, Pay End 5"
	},
	{
	"page_index": 25,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_006.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_006.png",
	"page_index": 25,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:38+07:00"
	},
	"raw_text": "Example 2.2: Calculate the average of 3 numbers Fig.3. Start Input a.b.c Calculate av=(a+b+c/3 Display av End 6"
	},
	{
	"page_index": 26,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_007.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_007.png",
	"page_index": 26,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:42+07:00"
	},
	"raw_text": "Example 2.3: How to compute profit and loss. Fig. 4. Start Read Income Read Cost Yes Calculate Profitas Income=Cosi? Income-Cost No Calculate Lossas Cost-Income Print Loss Print Profit End 7"
	},
	{
	"page_index": 27,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_008.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_008.png",
	"page_index": 27,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:47+07:00"
	},
	"raw_text": "3. Algorithms in pseudo-code You also can use English-like phrases to describe an algorithm. In this case, the description is called pseudocode. Example: The pseudocode for the program with the flowchart in Fig. 2 Input the three values into the variables Name, Hours. Rate. Start Pay = Hours x Rate. Input Name, Calculate Hours, Rate Display Name and Pay. Calculate Pay - Hours x Rate Dislay Name, Pay 8 End"
	},
	{
	"page_index": 28,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_009.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_009.png",
	"page_index": 28,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:51+07:00"
	},
	"raw_text": "4. Branching in algorithms false true false tcst-condition true test-condition S2 S, S Executestatemcnt Execuiestalement afterif-statement afterif-slatement If test-condition then S If test-condition then S1 endif else S2 endif"
	},
	{
	"page_index": 29,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_010.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_010.png",
	"page_index": 29,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:42:57+07:00"
	},
	"raw_text": "Example 2.1 Start Pseudo-code of the W program: Read.A Input A if A > 0 then calculate B = sqrt(A) no. print B A>0? else yes W Print \" A is negative Calculate endif Print\"Ais B=sqrtA) negative W PrintB End 10"
	},
	{
	"page_index": 30,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_011.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_011.png",
	"page_index": 30,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:04+07:00"
	},
	"raw_text": "Branching Start W Example 4.2: Solving Read the quadratic a,b,c equation : V ax2 + bx +c = 0 Calculate del=b²-4.a.c W Pseudo-code of the program: no del>0 Input a, b, c no Calculate del = b2 + 4.a.c yes del=0 if del >0 then x1=(-b+sqrt(del)/(2.a) yes W x1 = (-b + sqrt(del)/(2.a) x2=(-b-sqrt(del)/(2.a Calculate x2 = (-b - sqrt(del)/(2.a) W x=-b/(2.a) Print\"No print x1, x2 solution\" Display else if del =0 then x1,x2 x = -b/(2.a) Display x else print \"No solution endif End 11"
	},
	{
	"page_index": 31,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_012.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_012.png",
	"page_index": 31,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:07+07:00"
	},
	"raw_text": "5. Loops on Algorithms Many problems reguire repetition capability, in which the same calculation or sequence of instructions is repeated, over and over, using different sets of data. Loop is a very important concept in programming Example 5.1. Write a program to do the task: Print a list of the numbers from 4 to 9, next to each number print the square of the number. 12"
	},
	{
	"page_index": 32,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_013.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_013.png",
	"page_index": 32,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:11+07:00"
	},
	"raw_text": "Example 5.1 Note: NUM <- NUM + 1 means Start old value of NUM + 1 becomes new value of NUM. NUM< 4 SQNUM <- NUM The algorithm can be described Print in pseudocode as follows: NUM, SQNUM NUM <- 4 do NUM <-NUM + 1 SQNUM< NUM2 No NUM> 9? Print NUM, SQNUM Yes NUM < NUM + 1 STOP while (NUM <= 9) 13"
	},
	{
	"page_index": 33,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_014.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_014.png",
	"page_index": 33,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:16+07:00"
	},
	"raw_text": "Example 5.2 Start The algorithm sums W all the even numbers Sum = 0 between 1 and 20 inclusive and then count = 1 displays then sum. yes Count is even sum=sum+count no count= count+1 yes count20 no Display sum W End 14"
	},
	{
	"page_index": 34,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_015.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_015.png",
	"page_index": 34,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:19+07:00"
	},
	"raw_text": "Pseudo-code of Example 5.2 sum = 0 count = 1 do if count is even then sum = sum + count endif count = count + 1 while count <= 20 Display sum 15"
	},
	{
	"page_index": 35,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_016.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_016.png",
	"page_index": 35,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:24+07:00"
	},
	"raw_text": "Exercise Give the flowchart of Start the program which finds the largest Read among three different a,b,c numbers. Write the pseudo-code for the no yes a>b? flowchart. yes no no yes b>c? a>c? Printb Print c Printa Stop 16"
	},
	{
	"page_index": 36,
	"chapter_num": 1,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_017.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_1/slide_017.png",
	"page_index": 36,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:27+07:00"
	},
	"raw_text": "Ans. Input a,b,c if a > b then if a > c then print a endif else if b > c then print b else print c endif endif 17"
	},
	{
	"page_index": 37,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_001.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_001.png",
	"page_index": 37,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:30+07:00"
	},
	"raw_text": "Chapter 2 BASIC ELEMENTS IN C++ Introduction to Computer Science"
	},
	{
	"page_index": 38,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_002.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_002.png",
	"page_index": 38,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:32+07:00"
	},
	"raw_text": "Chapter 2 Program structures Data types and operators Variables and declaration statements 2"
	},
	{
	"page_index": 39,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_003.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_003.png",
	"page_index": 39,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:35+07:00"
	},
	"raw_text": "1. Program Structure A function is a program segment that transforms the data it receives into a finished result. Module 1 Module 2 Module 3 Module4 Module5 Module 6 Fig. 1. A well-designed program is built using modules 3"
	},
	{
	"page_index": 40,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_004.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_004.png",
	"page_index": 40,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:39+07:00"
	},
	"raw_text": "Function Each function must have a name. Names or identifiers in C++ can made up of any combination of letters, digits, or underscores selected according to the following rules: Identifiers must begin within an uppercase or lowercase AsCll letter or an underscore (_). You can use digits in an identifier, but not as the first character. You are not allowed to use special characters such as $, &, * or %. Reserved words cannot be used for variable names. Pascal: ThislsAFunction Example: Camel: thislsAFunction DegToRad intersect addNums FindMax1 density slope 4"
	},
	{
	"page_index": 41,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_005.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_005.png",
	"page_index": 41,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:43+07:00"
	},
	"raw_text": "The main() function The mainO function is a special function that runs automatically when a program first executes. All C++ programs must include one main( function. All other functions in a C++ program are executed from the main(. The first line of the function, in this case int mainO is called a function header line. The function header line contains three pieces of information: 1. What type of data, if any, is returned from the function. 2.The name of the function 3. What type of data, if any, is sent into the function. int mainO int getNumber(void) int totalScore(int score1, int score2 5"
	},
	{
	"page_index": 42,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_006.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_006.png",
	"page_index": 42,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:47+07:00"
	},
	"raw_text": "The main( function (cont.) int mainO program statements in here return 0: The line return 0: is included at the end of every main function. C++ keyword return is one of several means we will use to exit a function. When the return statement is used at the end of main0, the value 0 indicates that the program has terminates successfully. 6"
	},
	{
	"page_index": 43,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_007.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_007.png",
	"page_index": 43,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:51+07:00"
	},
	"raw_text": "The cout Object The cout object is an output object that sends data given to it to the standard output display device. To send a message to the cout object, you use the following pattern: cout << \"Hello \" << \"C++\" cout << \"text\" The insertion operator, <<, is used for sending text to an output device. The text portion of cout statement is called a text string. 7"
	},
	{
	"page_index": 44,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_008.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_008.png",
	"page_index": 44,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:54+07:00"
	},
	"raw_text": "A simple program Example 2.1.1 header file #tinclude <iostream> using namespace std; int main0 cout << \"Hello world!\": return 0: - A header file is a file with an extension of .h that is included as part of a program. It notifies the compiler that a program uses run-time libraries. - All statements in C++ must end with a semicolon. The iostream classes are used for giving C++ programs input and output capabilities. The header file for the iostream class is iostream.h 8"
	},
	{
	"page_index": 45,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_009.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_009.png",
	"page_index": 45,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:43:58+07:00"
	},
	"raw_text": "The iostream classes The #inc/ude statement is one of the several preprocessor directives that are used with C++. Example: To include the iostream.h file you use the following preprocessor directives: #include <iostream> The statement using namespace std; tell the compiler where to find the header files. A namespace is a specific named section of code within a folder that is accessed by the compiler when it is looking for prewritten classes or function."
	},
	{
	"page_index": 46,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_010.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_010.png",
	"page_index": 46,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:02+07:00"
	},
	"raw_text": "Preprocessor directives The preprocessor is a program that runs before the compiler. statement, it places the entire contents of the designated file into the current file. Preprocessor directives and inc/ude statements allow the current file to use any of the classes functions, variables, and other code contained within the included file. 10"
	},
	{
	"page_index": 47,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_011.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_011.png",
	"page_index": 47,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:06+07:00"
	},
	"raw_text": "i/o manipulator An i/o manipulator is a special function that can be used with an i/o statement. The end/ i/o manipulator is part of iostream classes and represents a new line character. Example: cout << \"Program type: console application\" << endl; cout << \"Create with: Visual C++ \"<< endl; cout << \"Programmer: Don Gesselin\" << endl; 11"
	},
	{
	"page_index": 48,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_012.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_012.png",
	"page_index": 48,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:10+07:00"
	},
	"raw_text": "Comments Comments are lines that you place in your code to contain various type of remarks. C++ line comments are created by adding two slashes (// ) before the text you want to use as a comment. Ex: B/ock comments span multiple lines. Such comments begin with /* and end with the symbols /. Ex: / this program solves a quadratic equation: ax2 + bx +c = 0 */ 12"
	},
	{
	"page_index": 49,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_013.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_013.png",
	"page_index": 49,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:14+07:00"
	},
	"raw_text": "2. DATA TYPES AND OPERATORS Data Types A data type is the specific category of information that a variable contains. There are three basic data types used in C++: integers, floating point numbers and characters. Integer Data Type An integer is a positive or negative number with no decimal places. Examples: - 259 -13 0 200 13"
	},
	{
	"page_index": 50,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_014.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_014.png",
	"page_index": 50,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:17+07:00"
	},
	"raw_text": "Floating Point Numbers A floating point number contains decimal places or is written using exponential notations. -6.16 -4.4 2.7541 10.5 90.1e3 0.89E8 -1.01e-1 Note: 90.1e3 means 90.1x103 14"
	},
	{
	"page_index": 51,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_015.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_015.png",
	"page_index": 51,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:21+07:00"
	},
	"raw_text": "The Character Data Type To store text, you use the character data type. To store one character in a variable, you use the char keyword and place the character in single quotation marks. Example: char cLetter = 'A': Escape Sequence The combination of a back/ash () and a special character is called an escape sequence. Example: In move to the next line It move to the next tab 15"
	},
	{
	"page_index": 52,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_016.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_016.png",
	"page_index": 52,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:25+07:00"
	},
	"raw_text": "Arithmetic Operators Arithmetic operators are used to perform mathematical calculations, such as addition, subtraction, multiplication, and division. Operator Description Add two operands Subtracts one operand from another operand * Multiplies one operand by another operand / Divides one operand by another operand % Divides two operands and returns the remainder A simple arithmetic expression consists of an arithmetic operator connecting two operands in the form: operand1 operator operand2 16"
	},
	{
	"page_index": 53,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_017.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_017.png",
	"page_index": 53,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:29+07:00"
	},
	"raw_text": "Examples: 3 + 7 18 - 3 12.62 + 9.8 12.6/2.0 The output of the program: Example 2.2.1 15.0 plus 2.0 equals 17 15.0 minus 2.0 equals 13 #include <iostream> 15.0 times 2.0 equals 30 using namespace std 15.0 divided by 2.0 equals 7.5 int mainO cout << \"15.0 plus 2.0 equals \" << (15.0 + 2.0) << 'n' << \"15.0 minus 2.0 equals \" << (15.0 - 2.0) << 'n' << \"15.0 times 2.0 equals \" << (15.0 * 2.0) << 'n' << \"15.0 divided by 2.0 equals \" << (15.0 / 2.0) << 'n'; return 0: 17"
	},
	{
	"page_index": 54,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_018.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_018.png",
	"page_index": 54,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:32+07:00"
	},
	"raw_text": "Integer Division and % operator The division of two integers yields integer result. Thus the value of 15/2 is 7. Modulus % operator produces the remainder of an integer division. Example: 9%4 is 1 17%3 is 2 14%2 is 0 18"
	},
	{
	"page_index": 55,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_019.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_019.png",
	"page_index": 55,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:36+07:00"
	},
	"raw_text": "Operator Precedence and Associativity Expressions containing multiple operators are evaluated by the priority, or precedence, of the operators. Operator Associativity unary - Right to left * 1 % Left to right Left to right Example 8 + 57%24 4 12 3 19"
	},
	{
	"page_index": 56,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_020.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_020.png",
	"page_index": 56,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:40+07:00"
	},
	"raw_text": "3. VARIABLES One of the most important aspects of programming is storing and manipulating the values stored in variables. Variable names are also selected according to the rules of identifiers: - Identifiers must begin with an uppercase or lowercase AsCll letter or an underscore (_). You can use digits in an identifier, but not as the first character. You are not allowed to use special characters such as $, &, * or %. Reserved words cannot be used for variable names. 20"
	},
	{
	"page_index": 57,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_021.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_021.png",
	"page_index": 57,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:43+07:00"
	},
	"raw_text": "dentifiers Example: Some valid identifiers my_variable (python style) MyVariable (pascal style) myVariable (camel style m, suggested style for C++) Temperature x1 x2 my variable Some invalid identifiers are as follows %x1 %my_var @x2 21"
	},
	{
	"page_index": 58,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_022.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_022.png",
	"page_index": 58,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:46+07:00"
	},
	"raw_text": "Declaration Statements In C++ you can declare the data types of variables using the syntax: type name, The type portion refers to the data type of the variable. The data type determines the type of information that can be stored in the variable. Example: Int count. float sum 22"
	},
	{
	"page_index": 59,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_023.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_023.png",
	"page_index": 59,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:50+07:00"
	},
	"raw_text": "Rules of variable declaration Rules: 1. A variable must be declared before it can be used. 2. Declaration statements can also be used to store an initial value into declared variables. Example int num = 15; float grade1 = 87.0; Note: Declaration statement gives information to the compiler rather than a step in the algorithm. 23"
	},
	{
	"page_index": 60,
	"chapter_num": 2,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_024.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_2/slide_024.png",
	"page_index": 60,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:54+07:00"
	},
	"raw_text": "Example 2.2.1 #include <iostream> using namespace std; int main0 float grade1 = 85.5; float grade2 = 97.0; float total, average; total = grade1 + grade2; average = total/2.0; // divide the total by 2.0 cout << \"The average grade is \" << average << endl; return 0; The output of the above program: The average grade is 91.25 Let notice the two assignment statements in the above program: total = grade1 + grade2; average = total/2.0; Each of these statements is called an assignment statement because it tells the computer to assign (store) a value into a variable. 24"
	},
	{
	"page_index": 61,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_001.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_001.png",
	"page_index": 61,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:44:57+07:00"
	},
	"raw_text": "Chapter 3 COMPLETING THE BASICS Introduction to Computer Science 1"
	},
	{
	"page_index": 62,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_002.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_002.png",
	"page_index": 62,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:00+07:00"
	},
	"raw_text": "Chapter 3 1. Assignment statement 2. Formatting the output 3. Using mathematical library functions 4. Program input using the cin object 5. Strings 2"
	},
	{
	"page_index": 63,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_003.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_003.png",
	"page_index": 63,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:04+07:00"
	},
	"raw_text": "1. Assignment statement How do we place data items into variables? Read in values typed at the keyboard by the user Use an assignment statement Assignment statement examples : length = 25; cMyCar = \"Mercedes\": sum = 3 + 7; newtotal = 18.3*amount: Assignment operator (=) are used for assignment a value to a variable and for performing computations. Assignment statement has the syntax: variable = expression; Expression is any combination of constants, variables, and function calls that can be evaluated to yield a result. 3"
	},
	{
	"page_index": 64,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_004.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_004.png",
	"page_index": 64,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:10+07:00"
	},
	"raw_text": "Assignment statement (cont.) The order of events when the computer executes an assignment statement is - Evaluate the expression on the right hand side of the assignment operator. - Store the resultant value of the expression in the variable on the left hand side of the assignment operator. Note: 1. The equal sign here does not have the same meaning as an equal sign in mathematics. 2. Each time a new value is stored in a variable, the old one is overwritten. 4"
	},
	{
	"page_index": 65,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_005.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_005.png",
	"page_index": 65,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:14+07:00"
	},
	"raw_text": "Example 3.1.1 This program calculates the volume of a cylinder given its radius and height #include <iostream> using namespace std; int mainO float radius, height, volume, radius = 2.5: height = 16.0; volume = 3.1416 * radius * radius * height; cout << \"The volume of the cylinder is \" << volume << endl; return 0; The output of the above program: The volume of the cylinder is 314.16 5"
	},
	{
	"page_index": 66,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_006.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_006.png",
	"page_index": 66,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:20+07:00"
	},
	"raw_text": "Assignment Variations C++ includes other arithmetic operators in addition to the egual sign of assignment. Operator Example Meaning Num1 = iNum2 - += iNum1 += iNum2 iNum1 = iNum1 + iNum2 iNum1 -= iNum2 iNum1 = iNum1 - iNum2 - iNum1 = iNum2 iNum1 = iNum1 iNum2 /= iNum1 /= iNum2 iNum1 = iNum1/ iNum2 %= Num1 %= iNum2 iNum1 = iNum1 % iNum2 So sum += 10 is equivalent to sum = sum + 10 6"
	},
	{
	"page_index": 67,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_007.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_007.png",
	"page_index": 67,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:24+07:00"
	},
	"raw_text": "Data Type Conversion across Assignment Operator Note: Data type conversion can take place across assignment operators, i.e., the value of the expression on the right side is converted to the data type of the variable to the left side. For example, if temp is an integer variable, the assignment temp = 25.89 causes the integer value 25 to be stored in the integer variable temp. 7"
	},
	{
	"page_index": 68,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_008.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_008.png",
	"page_index": 68,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:29+07:00"
	},
	"raw_text": "Increment and decrement operators For the special case in which a variable is either Increased or decreased by 1, C++ provides two unary operators: increment operator and decrement operator. Operator Description ++ Increase an operand by a value of one Decrease an operand by a value of one The increment (++) and decrement (--) unary operators can be used as prefix or postfix operators to increase or decrease value 8"
	},
	{
	"page_index": 69,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_009.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_009.png",
	"page_index": 69,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:34+07:00"
	},
	"raw_text": "Increment and decrement operators (cont.) A prefix operator is placed before a variable and returns the value of the operand after the operation is performed. A postfix operator is placed after a variable and returns the value of the operand before the operation is performed. Prefix and postfix operators have different effects when used in a statement b = ++a; // prefix way will first increase the value of a (equal to 5) to 6, and then assign that new value to b. It is equivalent to a=a +1;b=a;"
	},
	{
	"page_index": 70,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_010.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_010.png",
	"page_index": 70,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:38+07:00"
	},
	"raw_text": "b = a++;l/ postfix way will first assign the value of a (equal to 5) to b, and then increase the value of a to 6. It is equivalent to b = a; a = a + 1; The decrement operators are used in a similar way. b = --a; equivalent to a = a -1; b = a; b = a--; equivalent to b=a; a=a-1; 10"
	},
	{
	"page_index": 71,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_011.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_011.png",
	"page_index": 71,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:42+07:00"
	},
	"raw_text": "Example 3.1.2 #include <iostream.h> using namespace std; int mainO int c; c = 5; cout << c << endl // print 5 cout << c++ << endl; // print 5 then postincrement cout << c << endl << endl; // print 6 The output of the above program: c = 5; cout << c << endl: // print 5 5 cout << ++c << endl 5 // preincrement then print 6 6 cout << c << endl // print 6 5 return 0: 6 6 11"
	},
	{
	"page_index": 72,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_012.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_012.png",
	"page_index": 72,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:47+07:00"
	},
	"raw_text": "2. FORMATTING FOR PROGRAM OUTPUT Besides displaying correct results, a program should present its results attractively with good formats. Stream Manipulators Stream manipulator functions are special stream functions that change certain characteristics of the input and output The main advantage of using manipulator functions is they facilitate the formatting of the input and output streams. 12"
	},
	{
	"page_index": 73,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_013.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_013.png",
	"page_index": 73,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:52+07:00"
	},
	"raw_text": "Stream Manipulators setw0 The setw( stands for set width. This manipulator is used to specify the minimum number of the character positions on the output field a variable will consume. setprecision0 The setprecision( is used to control the number of digits of an output stream display of a floating-point value. Setprecision(2) means 2 digits of precision to the right of the decimal point (this is only true if fixed mode is enabled). Example: cout << \"I\"<< setw(10) << setprecision(3) << fixed << 25.67<<\"\" cause the printout without the \"fixed\" keyword, the precision starts at the beginning of the number. With the \"fixed\" keyword, it starts at the decimal point To reset the behaviour after using \"fixed\", we can use \"defaultfloat' 25.670 13"
	},
	{
	"page_index": 74,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_014.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_014.png",
	"page_index": 74,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:45:57+07:00"
	},
	"raw_text": "Example 3.2.1 #include <iostream> #include <iomanip> using namespace std; int mainO cout << setw(3) << 6 << endl << setw(3) << 18 << endl << setw(3) << 124 << endl << \"---n\" << (6+18+124) << endl; return 0; The output of the above program: 6 18 124 148 14"
	},
	{
	"page_index": 75,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_015.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_015.png",
	"page_index": 75,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:01+07:00"
	},
	"raw_text": "B. USING MATHEMATICAL LIBRARY FUNCTIONS C++ provides standard library functions that can be included in a program. have the preprocessor command #include<math.h> in the beginning of the program. Function Name Description Return Value abs(a) Absolute value Same data type as argument log(a) Natural logarithm double sin(a) sine of a (a in radians) double cos(a) cosine of a (a in radians) double tan(a) tangent of a (a in radians) double 15"
	},
	{
	"page_index": 76,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_016.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_016.png",
	"page_index": 76,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:07+07:00"
	},
	"raw_text": "MATHEMATICAL LIBRARY FUNCTIONS Function Name Description Return Value log10(a) common log (base 10) of a double pow(a1,a2) a1 raised to the a2 power double exp(a) ea e2.71828 double sqrt(a) square root of a double Except abs(a), they all take an argument of type doub/e and return a value of type double. Note: The typical floating point types and its sizes in C++ are: Type size float 4 double 8 16"
	},
	{
	"page_index": 77,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_017.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_017.png",
	"page_index": 77,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:11+07:00"
	},
	"raw_text": "4. PROGRAM INPUT USING THE cin OBJECT So far, our programs have been limited since that all their data must be defined within the program source code. We now learn how to write programs which enable data to be entered via the keyboard, while the program is running. Standard Input Stream The cin obiect reads in information from the keyboard via the standard input stream. The extraction operator (>>) retrieves information from the input stream. When the statement cin >> num1; is encountered, the computer stops program execution and accepts data from the keyboard. When a data item is typed, the cin object stores the item into the variable listed after the >> operator. 17"
	},
	{
	"page_index": 78,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_018.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_018.png",
	"page_index": 78,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:17+07:00"
	},
	"raw_text": "Example 3.4.1 #include <iostream> using namespace std; int mainO float num1, num2, product; cout << \"Please type in a number: \"; cin >> num1; cout << \"Please type in another number: \": cin >> num2 product = num1 * num2: cout << num1 << \" times \" << num2 << \" is \" << product << endl: return 0; The output of the above program: Please type in a number: 30 Please type in another number: 0.05 30 times 0.05 is 1.5 18"
	},
	{
	"page_index": 79,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_019.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_019.png",
	"page_index": 79,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:20+07:00"
	},
	"raw_text": "Example 3.4.2 #include <iostream> using namespace std; int mainO int num1, num2, num3 float average, cout << \"Enter three integer numbers: \"; cin >> num1 >> num2 >> num3; average = (num1 + num2 + num3) / 3.0; cout << \"The average of the numbers is \" << average << endl; return 0; The output of the above program: Enter three integer numbers: 22 56 73 The average of the numbers: 50.333333 19"
	},
	{
	"page_index": 80,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_020.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_020.png",
	"page_index": 80,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:27+07:00"
	},
	"raw_text": "5. Strings Fundamental types represent the most basic types handled by the machines where the code may run. But one of the major strengths of the C++ language is its rich set of compound types, of which the fundamental types are mere building blocks. An example of compound type is the string class. Variables of this type are able to store sequences of characters, such as words or sentences. A very useful feature! A first difference with fundamental data types is that in order to declare and use objects (variables) of this type, the program needs to include the header where the type is defined within the standard library (header <string.h>) Position: 0 1 2 3 4 H - e 0 20"
	},
	{
	"page_index": 81,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_021.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_021.png",
	"page_index": 81,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:31+07:00"
	},
	"raw_text": "// my first string #include <iostream> #include <string> using namespace std; int main O string mystring mystring = \"This is a string\"; cout << mystring; return 0; A variable of string type can be initialized in the variable declaration as follows: string month = \"March\": A variable of string type can be initialized in the second way as follows: string s1(\"Hello\") 21"
	},
	{
	"page_index": 82,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_022.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_022.png",
	"page_index": 82,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:38+07:00"
	},
	"raw_text": "Example 3.5.1 #include<iostream> #include<string> using namespace std; int mainO string str1; // an empty string string str2(\"Good Morning\"); string str3 = \"Hot Dog\"; string str4(str3);) string str5(str4, 4); The output of the program: string str6 = \"linear\": string str7(str6, 3, 3): str1 is: str2 is: Good Morning cout << \"str1 is: \" << str1 << endl: cout << \"str2 is: \" << str2 << endl; str3 is: Hot Dog cout << \"str3 is: \" << str3 << endl; str4 is: Hot Dog cout << \"str4 is: \" << str4 << endl; str5 is: Dog cout << \"str5 is: \" << str5 << endl; str6 is: Linear cout << \"str6 is: \" << str6 << endl; str7 is: ear cout << \"str7 is: \" << str7 << endl return 0: 22"
	},
	{
	"page_index": 83,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_023.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_023.png",
	"page_index": 83,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:43+07:00"
	},
	"raw_text": "Some methods for string class string objectName(str, n) : creates and initializes a string object with a substring of string object str, starting at index position n of str. string objectName(str, n, p) : creates and initializes a string object with a substring of string object str, starting at index position n of str and containing p characters. Input a string with getlineO The expression getline(cin, message) will continuously accept and store characters typed at the terminal until the Enter key is pressed. All the characters encountered by getline() are stored in the string named message. 23"
	},
	{
	"page_index": 84,
	"chapter_num": 3,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_024.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_3/slide_024.png",
	"page_index": 84,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:48+07:00"
	},
	"raw_text": "Example 3.5.2 #include<iostream> #include<string> using namespace std; int main() string message; cout << \"Ener a string: n\") getline(cin, message); cout << \"The string just entered is:n\") << message << endl; return 0; The output of the program: Enter a string: This is a test input of a string typed in by user The string just entered is: This is a test input of a string 24"
	},
	{
	"page_index": 85,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_001.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_001.png",
	"page_index": 85,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:50+07:00"
	},
	"raw_text": "Chapter 4 CONTROL STRUCTURES Introduction to computer science 1"
	},
	{
	"page_index": 86,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_002.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_002.png",
	"page_index": 86,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:55+07:00"
	},
	"raw_text": "Outline 1.Selection criteria 2.The if-e/se statement 3.Nested if statement 4. Repetition structure 5. while loops 6. for loops 7. Nested loops 8. do-while Loops 2"
	},
	{
	"page_index": 87,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_003.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_003.png",
	"page_index": 87,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:46:59+07:00"
	},
	"raw_text": "1. Selection structure The flow of control means the order in which a program's statements are executed. Unless directed otherwise, the normal flow of control for all programs is sequential. Selection, repetition and function invocation structures permit the flow of control to be a/tered in a defined way. In this chapter, you learn to use selection structures and repetition structures in C++"
	},
	{
	"page_index": 88,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_004.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_004.png",
	"page_index": 88,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:05+07:00"
	},
	"raw_text": "SELECTION CRITERIA Comparison Operators Comparison operators are used to compare two operands for equality or to determine if one numeric value is greater than another. A Boolean value of true or fa/se is returned after two operands are compared. C++ uses a nonzero value to represent a true and a zero value to represent a fa/se value. Operator Description Examples equal a=='y - 1= not equal m!= 5 7 greater than a*b > 7 < less than b< 6 less than or equal b<= a <= greater than or equal c >= 6 >= 4"
	},
	{
	"page_index": 89,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_005.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_005.png",
	"page_index": 89,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:09+07:00"
	},
	"raw_text": "Logical operators Logical operators are used for creating more complex conditions. Like comparison operators, a Boolean value of true or false is returned after the logical operation is executed. Operator Description && AND II OR NOT Example: (age > 40) && (term < 10) (age > 40) ll (term < 10) !(age > 40) (i==j) ll (a < b) ll complete 5"
	},
	{
	"page_index": 90,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_006.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_006.png",
	"page_index": 90,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:17+07:00"
	},
	"raw_text": "Operator precedence The relational and logical operators have a hierarchy of execution similar to the arithmetic operators Level Operator Associativity 1. ! unary - ++ -- Right to left 2. * % Left to right 3. + Left to right 4. < Left to right <= >>= 5. 1= Left to right 6. && Left to right 7. I Left to right 8. = += -= *= /= Right to left 6"
	},
	{
	"page_index": 91,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_007.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_007.png",
	"page_index": 91,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:23+07:00"
	},
	"raw_text": "Example: Assume the following declarations: char key = 'm'; int i = 5,j = 7, k = 12; double x = 22.5; Expression Equivalent Value Interpretation i + 2 = = k-1 (i + 2) ==(k-1) 0 false a' +1 == 'bj (a'+1) == bj 1 true 25 >= x + 1.0 25 >= (x + 1.0) 1 true key -1 > 20 (key -1) > 20 0 false 7"
	},
	{
	"page_index": 92,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_008.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_008.png",
	"page_index": 92,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:27+07:00"
	},
	"raw_text": "Order of evaluation The following compound condition is evaluated as: (63 = = 36/2) l (13<33 + 4) && !(6-2 < 5) (18 = = 18) l (13 < 9 + 4) &&!(4 < 5) 1 ll (13 < 13 && !1 1 ll 0 && 0 1 lI 0 1 8"
	},
	{
	"page_index": 93,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_009.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_009.png",
	"page_index": 93,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:32+07:00"
	},
	"raw_text": "The bool Data Type As specified by the ANSO/ISO standard, C++ has a built-in Boolean data type, bool, containing the two values true and false. The actual values represented by the bool values, true and fa/se. are the integer values 1 and 0, respectively. Example 4.1.1 #include<iostream> using namespace std; int mainO bool t1,t2 t1 = true; t2 = true; cout << <The value of t1 is \"<< t1 << \"n and the value of t2 is \"<< t2 << endI; return 0; } 9"
	},
	{
	"page_index": 94,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_010.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_010.png",
	"page_index": 94,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:38+07:00"
	},
	"raw_text": "2.THE if-else STATEMENT Previous The if-e/se statement directs statement the computer to select a sequence of one or more statements based on the No result of a comparison. Is condition true ? The syntax: Yes if (conditional expression) { Statement 1 Statement 2 statements, else { statements, /if only 1 statement, then we can skip the block for if-else 10"
	},
	{
	"page_index": 95,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_011.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_011.png",
	"page_index": 95,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:43+07:00"
	},
	"raw_text": "START Example 4.2.1 We construct a C++ program for Input taxable determining income taxes. Assume that these taxes are Yes assessed at 2% of taxable taxable <= CUTOFF? incomes less than or equal to $20,000. For taxable income No greater than $20,000, taxes are taxes = HIGHRATE(taxable - 2.5% of the income that CUTOFF) + FIXEDAMT exceeds $20,000 plus a fixed taxes = LOWRATEtaxable amount of $400 Output taxes END 11"
	},
	{
	"page_index": 96,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_012.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_012.png",
	"page_index": 96,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:49+07:00"
	},
	"raw_text": "Example 4.2.1 #include <iostream> #include <iomanip> using namespace std; const float LOWRATE = 0.02; // lower tax rate const float HIGHRATE = 0.025 // higher tax rate const float CUTOFF = 20000.0; // cut off for low rate const float FlXEDAMT = 400; int mainO float taxable, taxes: cout << \"Please type in the taxable income: \": cin >> taxable; if (taxable <= CUTOFF) taxes = LOWRATE * taxable; else taxes = HIGHRATE * (taxable - CUTOFF) + FIXEDAMT // set output format cout << setiosflags(ios: :fixed) << setiosflags(ios: :showpoint) << setprecision(2); cout << \"Taxes are $ \" << taxes << endl; return 0: 12"
	},
	{
	"page_index": 97,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_013.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_013.png",
	"page_index": 97,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:53+07:00"
	},
	"raw_text": "setiosflags this manipulator is used to control different input and output settings. setioflag(ios::fixed) means the output field will use conventional.fixed-point decimal notation. (ex: 12.568) setiosflag(ios::showpoint) means the output field will show the decimal point for floating point number. setiosflag(ios::scientific) means the output field will use exponential notation. (1.0e-10) The results of the above program: Please type in the taxable income: 10000 Taxes are $ 200 and Please type in the taxable income: 30000 Taxes are $ 650 13"
	},
	{
	"page_index": 98,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_014.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_014.png",
	"page_index": 98,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:47:56+07:00"
	},
	"raw_text": "Bock Scope All statements within a compound statement constitute a single b/ock of code, and any variable declared within such a block only is valid within the block. The location within a program where a variable can be used formally referred to as the scope of the variable 14"
	},
	{
	"page_index": 99,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_015.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_015.png",
	"page_index": 99,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:00+07:00"
	},
	"raw_text": "Example: { // start of outer block int a = 25; int b = 17; cout << \"The value of a is \" << a << \" and b is \" << b << endl { // start of inner block float a = 46.25: int c = 10: cout << \" a is now \" << a <<\"b is now \" << b << \" and c is \" << c << endI; } cout << \" a is now \" << a << \"b is now \" << b << endI } // end of outer block The output is The value of a is 25 and b is 17 a is now 46.25 b is now 17 and c is 10 a is now 25 b is now 17 15"
	},
	{
	"page_index": 100,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_016.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_016.png",
	"page_index": 100,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:04+07:00"
	},
	"raw_text": "One-way Selection A useful modification of the if-e/se statement involves Previous statement omitting the e/se part of the statement. In this case, the if No statement takes a shortened Is condition format: true ? Yes Statement(s) if (conditional expression) { statements, 16"
	},
	{
	"page_index": 101,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_017.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_017.png",
	"page_index": 101,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:08+07:00"
	},
	"raw_text": "Example 4.2.2 The following program displays an error message for the grades that is less than 0 or more than 1o0. #include <iostream> using namespace std; int mainO int grade = 0; cout << \"nPlease enter a grade: \"; cin >> grade; if(grade < 0 ll grade > 100) cout << \" The grade is not validn\"; return 0: 1 17"
	},
	{
	"page_index": 102,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_018.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_018.png",
	"page_index": 102,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:12+07:00"
	},
	"raw_text": "3. NESTED if STATEMENT The inclusion of one or more if statement within an existing if statement is called a nested if statement. The if-else Chain When an if statement is included in the e/se part of an existing if statement, we have an if-else chain. if (expression-1) statement-1 else if (expression-2) statement-2 else statement-3 Example 4.3.1 // This program can solve quadratic equation 18"
	},
	{
	"page_index": 103,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_019.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_019.png",
	"page_index": 103,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:17+07:00"
	},
	"raw_text": "The output of the above #include <iostream> program: #include <cmath> #include <iomanip> Enter the coefficients of the using namespace std; equation: int main0 1 5 6 x1 = -2.0 x2 = -3.0 double a, b, c, del, x1, x2; cout << \"Enter the coefficients of the equation: \"<< endl; cin >> a >> b >> c; del = bb - 4.0ac; if (del == 0.0) x1 = x2 = -b/(2a); cout << \"x1 = \" << x1 << setw(20) << \"x2 = \" << x2 << endl; else if (del > 0.0) x1 = (-b + sqrt(del)/(2a): x2 = (-b - sqrt(del))/(2a); cout << \"x1 = \" << x1 << setw(20) << \"x2 = \" << x2 << endl; else // del < 0 cout <<\"There is no solutionn\"; return 0; 19"
	},
	{
	"page_index": 104,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_020.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_020.png",
	"page_index": 104,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:20+07:00"
	},
	"raw_text": "4. Repetition structures C++ provides three different forms of repetition structures: while structure 1. 2. for structure do-while structure 3. Each of these structures requires a condition that must be evaluated. The condition can be tested at either (1) the beginning or (2) the end of the repeating section of code. If the test is at the beginning of the loop, the type of loop is a pre-test loop. If the test is at the end of the loop, the type of loop is a post- test loop. 20"
	},
	{
	"page_index": 105,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_021.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_021.png",
	"page_index": 105,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:24+07:00"
	},
	"raw_text": "Fixed count loop and variable condition loop In addition to where the condition is tested, repeating sections of code are also classified. In a fixed count /oop, the condition is used to keep track of how many repetitions have occurred. In this kind of loops, a fixed number of repetitions are performed, at which point the repeating section of code is exited. In many situations, the exact number of repetitions are not known in advance. In such cases, a variable condition /oop is used. In a variable condition /oop, the tested condition does not depend on a count being achieved, but rather on a variable that can change interactively with each pass through the loop. When a specified value is encountered, regardless of how many iterations have occurred, repetitions stop. 21"
	},
	{
	"page_index": 106,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_022.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_022.png",
	"page_index": 106,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:28+07:00"
	},
	"raw_text": "5.while loops The whi/e statement is used for repeating a statement or series of statements as long as a given conditional Enter the while statement expression is evaluated to true. false test the condition ? The syntax for the while true statement: Execute the statement (s) while (condition expression) { Exit the while statement statements, 22"
	},
	{
	"page_index": 107,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_023.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_023.png",
	"page_index": 107,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:32+07:00"
	},
	"raw_text": "Example 5.2.1 // This program prints out the numbers from 1 to 10 #include <iostream> using namespace std; int mainO int count, count = 1: l/ initialize count while (count <= 10) { cout << count << \" \". 2 count++; // increment count return 0: 2 The output of the above program: 12345678910 23"
	},
	{
	"page_index": 108,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_024.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_024.png",
	"page_index": 108,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:36+07:00"
	},
	"raw_text": "In the above program, the loop incurs a counter-controlled repetition. Counter-controlled repetition requires: 1 the name of a control variable (the variable count) 2) the initial value of the control variable ( count is initialized to 1 in this case ) 3) the condition that tests for the final value of the control variable (i.e., whether looping should continue) ; 4 the increment (or decrement) by which the control variable is modified each time through the loop. 24"
	},
	{
	"page_index": 109,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_025.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_025.png",
	"page_index": 109,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:40+07:00"
	},
	"raw_text": "Sentinels In programming, data values used to indicate either the start or end of a data series are called sentinels. The sentinels must be selected so as not to conflict with legitimate data values. Example 5.3.2 #include <iostream> using namespace std; const int HlGHGRADE = 100: // sentinel value int mainO float grade, total; grade = 0; total = 0: cout << \"nTo stop entering grades, type in any number\" << \" greater than 100.nln\": 25"
	},
	{
	"page_index": 110,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_026.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_026.png",
	"page_index": 110,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:44+07:00"
	},
	"raw_text": "cout << \"Enter a grade: \"; cin >> grade; while (grade <= HIGHGRADE) total = total + grade: cout << \"Enter a grade: \"; cin >> grade; cout << \"nThe total of the grades is \" << total << endl; return 0: 2 In the above program, the sentine/ is the value 1oo for the entered grade. 26"
	},
	{
	"page_index": 111,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_027.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_027.png",
	"page_index": 111,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:48+07:00"
	},
	"raw_text": "break statement The break statement causes an exit from the innermost enclosing loop Example: while (count <= 10) cout << \"Enter a number: \": cin >> num: if (num > 76) { cout << \"you lose!n\": break; 2 else cout << \"Keep on trucking!n\", count++; 2 //break jumps to here 27"
	},
	{
	"page_index": 112,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_028.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_028.png",
	"page_index": 112,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:51+07:00"
	},
	"raw_text": "continue Statements The continue statement halts a looping statement and restarts the loop with a new iteration. Int count = 0; while (count < 30) { cout << \"Enter a grade: \"; cin >> grade; if (grade < 0 l grade > 100) continue; total = total + grade: count++; 2 In the above program, invalid grades are simply ignored and only valid grades are added to the total. 28"
	},
	{
	"page_index": 113,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_029.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_029.png",
	"page_index": 113,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:48:56+07:00"
	},
	"raw_text": "The null statement All statements must be terminated by a semicolon. A semicolon with nothing preceding it is also a valid statement, called the null statement. Thus, the statement is a null statement. Example: if (a > 0) b = 7; else ; goto statement A goto statement is a kind of jump statement. Its destination is specified by a label within the statement. A label is simply an identifier followed by a statement, separated by a colon. Example: if (a > 20) goto esc; else cout << a*a: esc: cout << endl 29"
	},
	{
	"page_index": 114,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_030.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_030.png",
	"page_index": 114,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:00+07:00"
	},
	"raw_text": "6.for LOOPS The for statement is used for repeating a statement or series of statements as long as a given conditional expression evaluates to true. One of the main differences between while statement and for statement is that in addition to a condition, you can also include code in the for statement to initialize a counter yariable and changes its value with each iteration The syntax of the for statement: for (initialization expression; condition; update statement) statement(s), 30"
	},
	{
	"page_index": 115,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_031.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_031.png",
	"page_index": 115,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:03+07:00"
	},
	"raw_text": "Enter the for statement Initialization expression false test the condition ? true Execute the statement (s) Exit the for statement Execute the update statement 31"
	},
	{
	"page_index": 116,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_032.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_032.png",
	"page_index": 116,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:07+07:00"
	},
	"raw_text": "Example 4.6.1 #include <iostream> using namespace std; int mainO t int count: for (count = 2; count <= 20; count = count + 2) cout << count << : return 0: 2 The output of the above program: 2 4 6 8 12 14 16 18 20 32"
	},
	{
	"page_index": 117,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_033.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_033.png",
	"page_index": 117,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:11+07:00"
	},
	"raw_text": "Example 4.6.2 In this example, we solve this problem: A person invests $1000.00 in a saving account with 5 percent interest. Assuming that all interest is left on deposit in the account. calculate and print the amount of money in the account at the end of each year for 10 years. Use the following formula for determining these amounts: a = p(1 + r)n where p is the original amount invested, r is the annual interest rate and n is the number of years and a is the amount on deposit at the end of the nth year #include <iostream> #include <iomanip> #include <cmath> using namespace std; int mainO { double amount = 0, principal = 1000.0, rate = 0.05; cout << \"Year\" << setw(21) << \"Amount on deposit\" << endl; 33"
	},
	{
	"page_index": 118,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_034.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_034.png",
	"page_index": 118,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:16+07:00"
	},
	"raw_text": "cout << setiosflags(ios: :fixed 1 ios: :showpoint) << setprecision(2); for (int year = 1; year <= 10; year++) { amount = principal*pow(1.0 + rate, year); cout << setw(4) << year << setw(21) << amount << endl 2 return 0; The output of the above program: Year Amount on deposit 1 1050.00 2 1102.50 3 1157.62 4 1215.51 5 1276.28 6 1340.10 7 1407.10 8 1477.46 9 1551.33 10 1628.89 34"
	},
	{
	"page_index": 119,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_035.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_035.png",
	"page_index": 119,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:22+07:00"
	},
	"raw_text": "7. NESTED LOOPS In many situations, it is convenient to use a loop contained within another loop. Such loops are called nested /oops. Example 4.7.1 #include <iostream> using namespace std; int mainO The output of the const int MAXI = 5; program: const int MAXJ = 4: int i, J; i is now 1 for(i = 1; i <= MAXI; i++) // start of outer loop j=1 j=2 j=3 j=4 i is now 2 j=1 j=2j=3j=4 cout << \"n i is now \" << i << endI; i is now 3 for(j = 1;j <= MAXJ;j++) // start of inner loop j=1 j=2 j=3 j=4 cout << \" j = \" <<j; ; // end of inner loop i is now 4 // end of outer loop j=1 j=2 j=3j=4 i is now 5 cout << endl: j=1 j=2j=3j=4 return 0; 2 35"
	},
	{
	"page_index": 120,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_036.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_036.png",
	"page_index": 120,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:25+07:00"
	},
	"raw_text": "8. do-while LOOPS Enter the do-while statement Execute the statement (s false test the condition ? true do..whi/e statement is used to create post-test loops. Exit the do-while The syntax: statement do { statements, } while (conditional expression), 36"
	},
	{
	"page_index": 121,
	"chapter_num": 4,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_037.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_4/slide_037.png",
	"page_index": 121,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:30+07:00"
	},
	"raw_text": "Example of do-whi/e Example 4.8.1 A program to find the sum of even numbers: 2+4+. :.+n #include<iostream> using namespace std; void main { int max, sum = 0, digit: digit = 2; cout<< \" enter a number In\": cin >> max; Output of the program: do{ Enter a number sum = sum + digit; 10 2+4+.:.+10 sum = 30 digit = digit + 2; } while (digit <= max) cout << \" 2 + 4 +...+ \"<< max << sum = cout << sum << endI; 37"
	},
	{
	"page_index": 122,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_001.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_001.png",
	"page_index": 122,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:31+07:00"
	},
	"raw_text": "Chapter 5 ARRAYS AND FUNCTIONS Introduction to computer science"
	},
	{
	"page_index": 123,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_002.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_002.png",
	"page_index": 123,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:35+07:00"
	},
	"raw_text": "Outline 1. Arrays 2. Multidimensional Arrays 3. Function and parameter declarations 4. Pass-by-value 5. Variable scope 6. Variable storage classes 7. Pass-by-reference 8. Recursion 9. Passing a arrays to functions 2"
	},
	{
	"page_index": 124,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_003.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_003.png",
	"page_index": 124,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:38+07:00"
	},
	"raw_text": "1.ARRAYS An array is an advanced data type that contains a set of data represented by a single variable name. An element is an individual piece of data contained in an array The following figure shows an integer array called c. c[0] = 4; c[1] = 4,c[2] = 8,etc [ 0] [1] [2][3][4] [5] 4 4 8 3"
	},
	{
	"page_index": 125,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_004.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_004.png",
	"page_index": 125,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:42+07:00"
	},
	"raw_text": "Array Declaration The syntax for declaring an array is type name[elements], Array names follow the same naming conventions as variable names and other identifiers. Example: int arMyArray[3]; char arStudentGrade[5] The first declaration tells the compiler to reserve 3 elements for integer array arMyArray Programming Fundamentals 4"
	},
	{
	"page_index": 126,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_005.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_005.png",
	"page_index": 126,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:46+07:00"
	},
	"raw_text": "Subscript The numbering of elements within an array starts with an index number of 0. An index number is an element's numeric position within an array. It is also called a subsript. Example StudentGrade[0] refers to the 1st element in the StudentGrade array. StudentGrade/1] refers to the 2nd element in the StudentGrade array. StudentGrade[2] refers to the 3rd element in the StudentGrade array. StudentGrade/3] refers to the 4th element in the StudentGrade array- StudentGrade[4] refers to the 5fth element in the StudentGrade array. 5"
	},
	{
	"page_index": 127,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_006.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_006.png",
	"page_index": 127,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:50+07:00"
	},
	"raw_text": "An example of array Example 5.1.1 #include <iostream> using namespace std; int mainO { char arStudentGrade[5] = {'A', 'B', 'C', 'D', F'} for (int i = 0; i < 5; i++) cout << arStudentGrade[] << endl; return 0; The output is: A B C D F 6"
	},
	{
	"page_index": 128,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_007.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_007.png",
	"page_index": 128,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:54+07:00"
	},
	"raw_text": "Example 5.1.2 // Compute the sum of the elements of the array #include <iostream> using namespace std; int main0 const int arraySize = 12; int a[arraySize] ={ 1, 3, 5, 4, 7, 2, 99, 16, 45, 67, 89, 45 }, Int total = 0; for ( int i = 0; i < arraySize; i++ total += a[ i ]; cout << \"Total of array element values is \" << total << endl return 0 : 2 The output of the above program is as follows : Total of array element values is_383 7"
	},
	{
	"page_index": 129,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_008.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_008.png",
	"page_index": 129,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:49:58+07:00"
	},
	"raw_text": "2. Multi-Dimensional Arrays C++ allows arrays of any type, including arrays of arrays. With two bracket pairs we obtain a two-dimensional array. The idea can be iterated to obtain arrays of higher dimension. With each bracket pair we add another dimension. Some examples of array declarations int t[4][2]; int a[1000]: Il a one-dimensional array int b[3][5]; I/l a two-dimensional array I// a three-dimensional array int c[7][9][2] In these above examples, b has 3 x 5 elements, and c has 7 x 9 x 2 elements. 8"
	},
	{
	"page_index": 130,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_009.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_009.png",
	"page_index": 130,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:02+07:00"
	},
	"raw_text": "A two-dimensional array Starting at the base address of the array, all the array elements are stored contiguously in memory For the array b, we can think of the array elements arranged as follows: int b[3][5]; col 1 col2 col3 col4 col5 row 1 b[0][0] b[0][1] b[0][2] b[0][3] b[0][4] row 2 b[1][0] b[1][1] b[1][2] b[1][3] b[1][4] row 3 b[2][0] b[2][1] b[2][2] b[2][3] b[2][4] 9"
	},
	{
	"page_index": 131,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_010.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_010.png",
	"page_index": 131,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:08+07:00"
	},
	"raw_text": "Example 5.2.1 This program checks if a matrix is symmetric or not. for(i= 0; i<N; i++){ #include<iostream> for (j = 0;j < N;j++) if(a[i]D] != aD][i]) { using namespace std; symmetr = false; const int N = 3; break; 0,0 0,1 0,2 void main() } 1,0 1,1 1,2 if(!symmetr) int i, j; break; 2,0 2,1 2,2 int a[N][N] 2 f(symmetr) bool symmetr = true; cout<<\"nThe matrix is symmetric\" for (i=0; i<N; ++i) << endl; for (j=0; j<N; ++j) else cin >> a[i]D]; cout<<\"nThe matrix is not symmetric\" << endl; return 0: if(!symmetr) means if(symmetry == false) 10"
	},
	{
	"page_index": 132,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_011.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_011.png",
	"page_index": 132,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:12+07:00"
	},
	"raw_text": "3. Function and parameter declarations User-defined program units are called subprograms. Defining a Function The lines that compose a function within a C++ program are called a function definition. The syntax for declaring & defining a function: data type name of function (parameters) { statements; To call a function data_type result = name_of_function (param1, param2, ...) 11"
	},
	{
	"page_index": 133,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_012.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_012.png",
	"page_index": 133,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:17+07:00"
	},
	"raw_text": "A function definition consists of four parts: A reserved word indicating the data type of the function's return value. The function name Any parameters required by the function, contained within ( and The function's statements enclosed in curly braces {} Example 1: void FindMax(int x, int y) { int maxnum; if (x >= y) maxnum = x; else maxnum = y ; cout << \"n The maximum of the two numbers is \" << maxnum << endl return; 12"
	},
	{
	"page_index": 134,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_013.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_013.png",
	"page_index": 134,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:20+07:00"
	},
	"raw_text": "How to call functions You designate a data type for function since it will return a yalue from a function after it executes. Variable names that will be used in the function header line are called formal parameters. To execute a function, you must invoke, or call, it from the mainO function. The values or variables that you place within the parentheses of a function call statement are called actual parameters. Example: Int firstNum = 5 int secNum = 8; findMax(firstNum, secNum): 13"
	},
	{
	"page_index": 135,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_014.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_014.png",
	"page_index": 135,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:25+07:00"
	},
	"raw_text": "Function Prototypes A function prototype declares to the compiler that you intend to use a function later in the program. If you try to call a function at any point in the program prior to its function prototype or function definition, you will receive an error at compile time Example 5.3.1 // Finding the maximum of three integers #include <iostream> using namespace std; int maximum(int, int, int); // function prototype (forward declaration) int main0 int a, b, c; cout << \"Enter three integers: \" cin >> a >> b >> c; cout << \"Maximum is: \" << maximum (a, b, c) << endI; return 0; 14"
	},
	{
	"page_index": 136,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_015.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_015.png",
	"page_index": 136,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:28+07:00"
	},
	"raw_text": "// Function maximum definition // x, y and z are parameters to the maximum function definition int maximum( int x, int y, int z) int max = x; if ( y > max) max = y; if(z> max) max = z; return max: 2 The output of the above program: Enter three integers: 22 85 17 Maximum is: 85 15"
	},
	{
	"page_index": 137,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_016.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_016.png",
	"page_index": 137,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:31+07:00"
	},
	"raw_text": "Calling a Function Argument1 Function Argument2 Calling Procedure Return Value Conceptual diagram of the process of calling a function 16"
	},
	{
	"page_index": 138,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_017.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_017.png",
	"page_index": 138,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:35+07:00"
	},
	"raw_text": "4.Pass by Value If a variable is one of the actual parameters in a function call, the called function receives a copy of the values stored in the variable. After the values are passed to the called function. control is transferred to the called function. Example: The statement findMax(firstnum, secnum): calls the function findMax and causes the va/ues currently residing in the variables firstnum and secnum to be passed to findMax function. The method of passing values to a called function is called pass by value. 17"
	},
	{
	"page_index": 139,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_018.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_018.png",
	"page_index": 139,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:38+07:00"
	},
	"raw_text": "RETURNING VALUES To actually return a value to a variable, you must include the return statement within the called function. The syntax for the return statement is either return result. or return(result): Values passes back and forth between functions must be of the same data type. 18"
	},
	{
	"page_index": 140,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_019.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_019.png",
	"page_index": 140,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:42+07:00"
	},
	"raw_text": "5. VARIABLE SCOPE Scope refers to where in your program a declared variable or constant is allowed used. G/oba/ scope refers to variables declared outside of any functions or classes and that are available to all parts of your program. Loca/ scope refers to a variable declared inside a function and that is available only within the function in which it is declared. 19"
	},
	{
	"page_index": 141,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_020.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_020.png",
	"page_index": 141,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:46+07:00"
	},
	"raw_text": "Example 5.5.1 #include <iostream> using namespace std; int x; // create a global variable named x void valfunO; // function prototype (declaration) int mainO int y; Il create a local variable named y x = 10; // store a value into the global variable y = 20; // store a value into the local variable cout << \"From main0: x = \" << x << endl cout << \"From main0: y = \" << y << endl; valfunO; // call the function valfun cout << \"nFrom main( again: x = \" << x << endl; cout << \"From main0 again: y = \" << y << endl; return 0; 20"
	},
	{
	"page_index": 142,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_021.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_021.png",
	"page_index": 142,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:50+07:00"
	},
	"raw_text": "void valfunO { int y; // create a second local variable named y y = 30; // this only affects this local variable's value cout << \"nFrom valfun0: x = \" << x << endl; cout << \"nFrom valfun0: y = \" << y << endl; x = 40; // this changes x for both functions return; The output of the above program: From mainO: x = 10 From main0: y = 20 From valfunO: x = 10 From valfunO: y = 30 From main( again: x = 40 From main0 again: y = 20 21"
	},
	{
	"page_index": 143,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_022.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_022.png",
	"page_index": 143,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:53+07:00"
	},
	"raw_text": "6. VARIABLE STORAGE CLASS The lifetime of a variable is referred to as the storage duration, or storage class. Four available storage classes: auto, static, extern and register If one of these class names is used, it must be placed before the variable's data type in a declaration statement. Examples: auto int num; static int miles; register int dist, extern float price: extern float yld; 22"
	},
	{
	"page_index": 144,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_023.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_023.png",
	"page_index": 144,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:50:57+07:00"
	},
	"raw_text": "Local Variable Storage Classes Local variables can only be members of the auto, static, or register storage classes. Default: auto class. Automatic Variables The term auto is short for automatic Automatic storage duration refers to variables that exist only during the lifetime of the command block (such as a function) that contains them. 23"
	},
	{
	"page_index": 145,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_024.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_024.png",
	"page_index": 145,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:02+07:00"
	},
	"raw_text": "Example 5.6.1 #include <iostream> using namespace std; void testauto0; // function prototype int mainOt int count, // count is a local auto variable for(count = 1; count <= 3; count++) testautoO: return 0; 2 void testauto0t int num = 0; // num is a local auto variable cout << \"The value of the automatic variable num is \" << num << endIF The output of the above program: num++; The value of the automatic variable num is 0 return; The yalue of the automatic yariable num is 0 The value of the automatic yariable num is 0 24"
	},
	{
	"page_index": 146,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_025.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_025.png",
	"page_index": 146,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:06+07:00"
	},
	"raw_text": "Static local variables In some applications, we want a function to remember values between function calls. This is the purpose of the static storage class. A local static variable is not created and destroyed each time the function declaring the static variable is called. Once created, local static variables remain in existence for the life of the program. 25"
	},
	{
	"page_index": 147,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_026.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_026.png",
	"page_index": 147,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:12+07:00"
	},
	"raw_text": "Example 5.6.2 #tinclude <iostream> using namespace std; int funct(int); // function prototype int mainO int count, value; // count is a local auto yariable for(count = 1; count <= 10; count++) The output of the value = funct(count); above program: cout << count << t' << value << endl; 1 101 return 0: 2 102 3 103 4 104 int funct( int x) 5 105 6 106 int sum = 100: // sum is a local auto yariable 7 107 8 108 sum += x; 9 109 return sum: 10 110 Note: The effect of increasing sum in funct0, before the function's return statement, is lost when control is returned to main0 26"
	},
	{
	"page_index": 148,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_027.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_027.png",
	"page_index": 148,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:17+07:00"
	},
	"raw_text": "Local static variable A local static variable is not created and destroyed each time the function declaring the static variable is called. Once created, local static variables remain in existence for the life of the program. Example 5.6.3 #include <iostream> using namespace std; int funct( int); // function prototype int main0 int count, value; // count is a local auto variable for(count = 1; count <= 10; count++) value = funct( count); cout << count << t' << value << endl return 0: 2 int funct( int x static int sum = 100: // sum is a local static yariable sum += x; return sum 27"
	},
	{
	"page_index": 149,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_028.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_028.png",
	"page_index": 149,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:22+07:00"
	},
	"raw_text": "The output of the above program: 1 101 2 103 3 106 4 110 5 115 6 121 7 128 Note 8 136 9 145 1.The initialization of static variables is done 10 155 only once when the program is first compiled. At compile time, the variable is created and any initialization value is placed in it. 2. All static variables are set to zero when no explicit initialization is given. 28"
	},
	{
	"page_index": 150,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_029.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_029.png",
	"page_index": 150,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:25+07:00"
	},
	"raw_text": "Register Variables Register variables have the same time duration as automatic variables. Register variables are stored in CPU's internal registers rather than in memory. Examples: register int t time; register double difference; 29"
	},
	{
	"page_index": 151,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_030.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_030.png",
	"page_index": 151,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:29+07:00"
	},
	"raw_text": "Global Variable Global variables are created by definition statements external to a function. Once a global variable is created, it exists until the 30"
	},
	{
	"page_index": 152,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_031.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_031.png",
	"page_index": 152,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:33+07:00"
	},
	"raw_text": "Z.PASS BY REFERENCE Reference Parameters Two ways to invoke functions in many programming languages are: call by value call by reference When an argument is passed call by value, a copy of the argument's value is made and passed to the called function. Changes to the copy do not affect the original variable's value in the caller. With call-by-reference, the caller gives the called function the ability to access the caller's data directly, and to modify that data if the called function chooses so. To indicate that the function parameter is passed-by-reference, simply follow the parameter's type in the function prototype of function header by an ampersand (&)- 31"
	},
	{
	"page_index": 153,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_032.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_032.png",
	"page_index": 153,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:39+07:00"
	},
	"raw_text": "For example, the declaration int& count in the function header means \"count is a reference parameter to an int\". Example 5.7.1 #include <iostream> using namespace std; int squareByValue( int ) void squareByReference( int & ): int mainO int x = 2, z = 4: cout << \"x = \" << x << \" before squareByValuen\" << squareByValue( x) << endl << \"x = \" << x << \" after squareByValuen\" << endl; cout << \"z = \" << z << \" before squareByReference\" << endl; squareByReference( z ); cout << \"z = \" << z << \" after squareByReference\" << endl; return 0: 32"
	},
	{
	"page_index": 154,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_033.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_033.png",
	"page_index": 154,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:42+07:00"
	},
	"raw_text": "int squareByValue( int a) return a = a; // caller's argument not modified 2 void squareByReference(int &cRef) cRef = cRef; // caller's argument modified The output of the above program: x = 2 before squareByValue Value returned by squareByValue: 4 x = 2 after squareByReference z = 4 before squareByReference z = 16 after squareByReference 33"
	},
	{
	"page_index": 155,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_034.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_034.png",
	"page_index": 155,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:46+07:00"
	},
	"raw_text": "8. RECURSION In C++, it's possible for a function to call itself. Functions that do so are called seft-referential or recursive functions Example: To compute factorial of an integer 1!= 1 n! = n*(n-1)! Example 5.8.1 #include <iostream> #include <iomanip> using namespace std; int factorial( int ); int mainO { for ( int i = 0; i <= 10; i++ ) cout << setw( 2 ) << i << \"! = \" << factorial( i ) << endl; return 0: 2 34"
	},
	{
	"page_index": 156,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_035.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_035.png",
	"page_index": 156,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:50+07:00"
	},
	"raw_text": "/ Recursive definition of function factoria int factorial( int number ) if (number == 0) // base case return 1: else // recursive case return number * factorial( number - 1 ): 2 The output of the above program: O!= 1 1!= 1 2! = 2 3! = 6 4!= 24 5! = 120 6! = 720 7! = 5040 8! = 40320 9! = 362880 10! = 3628800 35"
	},
	{
	"page_index": 157,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_036.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_036.png",
	"page_index": 157,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:54+07:00"
	},
	"raw_text": "9. PASSING ARRAYS TO FUNCTIONS To pass an array to a function, specify the name of the array without any brackets. For example, if array hour/yTemperature has been declared as int hourlyTemperature[24] The function call statement modifyArray(hourlyTemperature, size): passes the array hour/yTemperature and its size to function modifyArray For the function to receive an array through a function call, the function's parameter list must specify that an array will be received. 36"
	},
	{
	"page_index": 158,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_037.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_037.png",
	"page_index": 158,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:51:58+07:00"
	},
	"raw_text": "For example, the function header for function modifyArray might be written as void modifyArray(int b[, int arraySize) Notice that the size of the array is not reguired between the array brackets. Example 5.9.1 #include<iostream> using namespace std; int linearSearch( int [, int, int); void main0 const int arraySize = 100; int a[arraySize], searchkey, element; 37"
	},
	{
	"page_index": 159,
	"chapter_num": 5,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_038.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_5/slide_038.png",
	"page_index": 159,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:03+07:00"
	},
	"raw_text": "for (int x = 0; x < arraySize, x++) // create some data a[x] = 2*x; cout<< \"Enter integer search key: \"<< endl; cin >> searchKey; element = linearSearch(a, searchKey, arraySize); if(element != -1) cout<<\"Found value in element \"<< element << endl; else cout<< \"Value not found \" << endl; int linearSearch(int array[], int key, int sizeofArray) for(int n = 0; n< sizeofArray; n++) if (array[n] = = key) return n: return -1: 2 38"
	},
	{
	"page_index": 160,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_001.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_001.png",
	"page_index": 160,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:06+07:00"
	},
	"raw_text": "The Von Neumann Architecture Von Neumann AWT-4500 DEEP CRACK ORBIT61335A 9816T03093.1A Architecture"
	},
	{
	"page_index": 161,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_002.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_002.png",
	"page_index": 161,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:10+07:00"
	},
	"raw_text": "Designing Computers All computers more or less based on the same basic design, the Von Neumann Architecture! DATO CMPUT101 Introduction to Computing c) Yngvi Bjornsson 2"
	},
	{
	"page_index": 162,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_003.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_003.png",
	"page_index": 162,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:14+07:00"
	},
	"raw_text": "The Von Neumann Architecture Model for designing and building computers, based on the following three characteristics: The computer consists of four main sub-systems: Memory ALU (Arithmetic/Logic Unit) Control Unit Input/Output System (Il/O) 2) Program is stored in memory during execution. 3) Program instructions are executed sequentially. CMPUT101Introduction to Computing c) Yngvi Bjornsson 3"
	},
	{
	"page_index": 163,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_004.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_004.png",
	"page_index": 163,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:18+07:00"
	},
	"raw_text": "The Von Neumann Architecture Bus Processor (CPU) Memory Input-Output Control Unit ALU Communicate with Store data and program \"outside world\", e.g . Screen Execute program Keyboard Storage devices Do arithmetic/logic operations requested by program CMPUT101 Introduction to Computing c) Yngvi Bjornsson"
	},
	{
	"page_index": 164,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_005.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_005.png",
	"page_index": 164,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:21+07:00"
	},
	"raw_text": "Other Diagram for Von Neumann Von-Neumann Basic Structure: Central ProcessingUnit Control Unit Arithmetice/Logic Unit Registers PC CIR Input Device Output Device AC MAR MOR Memory Unit CMPUT101 Introduction to Computing c Yngvi Bjornsson 5"
	},
	{
	"page_index": 165,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_006.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_006.png",
	"page_index": 165,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:25+07:00"
	},
	"raw_text": "https://www.bbc.co.uk/bitesize/guides/zhppfcw/revision/1 Other Diagram for Von Neumann Primary storage Input CPU Output 88 CMPUT101ln Secondary storage"
	},
	{
	"page_index": 166,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_007.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_007.png",
	"page_index": 166,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:29+07:00"
	},
	"raw_text": "Memory Subsystem Memory, also called RAM (Random Access Memory), - Consists of many memory cells (storage units) of a fixed size. Each cell has an address associated with it: 0, 1, -.. - All a accesses to memory are to a specified address. A cell is the minimum unit of access (fetch/store a complete cell) - The time it takes to fetch/store a cell is the same for all cells When the computer is running, both - Program - Data (variables) are stored in the memory. CMPUT101 Introduction to Computing c) Yngvi Bjornsson"
	},
	{
	"page_index": 167,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_008.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_008.png",
	"page_index": 167,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:34+07:00"
	},
	"raw_text": "RAM N Need to distinguish between - the address of a memory cell and 0000000000000001 the content of a memory cell r 1bit 0 Memory width (W): - How many bits is each memory 1 cell, typically one byte (=8 bits) 2 Address width (N): 2N - How many bits used to represent each address, determines the maximum memory size = address space 2N-1 - If address width is N-bits, then address space is 2N (0,1,....2N-1) W CMPUT101 Introduction to Computing (c) Yr"
	},
	{
	"page_index": 168,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_009.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_009.png",
	"page_index": 168,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:40+07:00"
	},
	"raw_text": "Memory Size / Speed Typical memory in a personal computer (PC): 64MB - 256MB Memory sizes: - Kilobyte (KB) 210: 1,024 bytes 1 thousand - Megabyte(MB) 220 1,048,576 bytes 1 million Gigabyte (GB) 230= 1 1,073,741,824 bytes 1 billion 1 Memory Access s Time (read from/ write to memory) - 50-75 nanoseconds (1 nsec. = 0.000000001 sec.) RAM is - volatile (can only store when power is on) - relatively expensive CMPUT101Introduction to Computing c) Yngvi Bjornsson"
	},
	{
	"page_index": 169,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_010.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_010.png",
	"page_index": 169,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:44+07:00"
	},
	"raw_text": "Operations on Memory Fetch (address): - Fetch a copy of the content of memory cell with the specified address. - Non-destructive, copies value in memory cell. Store (address, value): - Store the specified value into the memory cell specified by address. Destructive, overwrites the previous value of the memory cell. The memory system is interfaced via: - Memory Address Register (MAR) Memory Data Register (MDR) - - Fetch/Store signal CMPUT101Introduction to Computing c) Yngvi Bjornsson 10"
	},
	{
	"page_index": 170,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_011.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_011.png",
	"page_index": 170,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:49+07:00"
	},
	"raw_text": "Structure of the Memory Subsystem Fetch(address MAR MDR - Load address into MAR. F/S 1 Decode the address in MAR Memory Fetch/Store - Copy the content of memory cell with decoder controller specified address into MDR. circuit Store(address, value) - Load the address into MAR. - Load the value into MDR. Decode the address in MAR - -Copy the content of MDR into memory cell with the specified address. CMPUT101 Introduction to Computing c) Yngvi Bjornsson"
	},
	{
	"page_index": 171,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_012.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_012.png",
	"page_index": 171,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:53+07:00"
	},
	"raw_text": "Input/Output Subsystem Handles devices that allow the computer system to: - Communicate and interact with the outside world . Screen, keyboard, printer, .. - Store information (mass-storage) . Hard-drives, floppies, CD, tapes, ... Mass-Storage Device Access Methods: - Direct Access Storage Devices (DASDs) . Hard-drives, floppy-disks, CD-ROMs, ... - Sequential Access s Storage Devices (SASDs) . Tapes (for example, used as backup devices) CMPUT101 Introduction to Computing c) Yngvi Bjornsson 12"
	},
	{
	"page_index": 172,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_013.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_013.png",
	"page_index": 172,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:52:57+07:00"
	},
	"raw_text": "1/0 Controllers Speed of I/O devices is slow compared to RAM - RAM 50 nsec - Hard-Drive 10msec. = (10,000,000 nsec Solution: - I/O Controller, a special purpose processor: . Has a small memory buffer, and a control logic to control l/0 device (e.g. move disk arm) Sends an interrupt signal to CPU when done read/write. Data transferred between RAM and memory buffer. - Processor free to do something else while l/O controller reads/writes data from/to device into l/O buffer. CMPUT101Introduction to Computing c) Yngvi Bjornsson 13"
	},
	{
	"page_index": 173,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_014.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_014.png",
	"page_index": 173,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:00+07:00"
	},
	"raw_text": "Structure of the l/0 Subsystem Interrupt signal (to processor) Data from/to memory l/O controller l/O Buffer Control/Logic l/O device CMPUT101 Introduction to Computing c) Yngvi Bjornsson 14"
	},
	{
	"page_index": 174,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_015.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_015.png",
	"page_index": 174,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:04+07:00"
	},
	"raw_text": "The ALU Subsystem The ALU (Arithmetic/Logic Unit) performs - mathematical operations (+, -, x, I, ...) - logic operations (=, <, >, and, or, not, ...) In today's computers integrated into the CPU Consists of: - Circuits to do the arithmetic/logic operations - Registers (fast storage units) to store intermediate computational results. - Bus that connects the two. CMPUT101Introduction to Computing c) Yngvi Bjornsson 15"
	},
	{
	"page_index": 175,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_016.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_016.png",
	"page_index": 175,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:10+07:00"
	},
	"raw_text": "Structure of the ALU Registers: RO - Very fast local memory cells, that R1 store operands of operations and intermediate results R2 CCR (condition code register), a special p purpose register that stores the result of <, = , > operations Rn ALU circuitry: - Contains an array of circuits to do mathematical/logic operations. ALU circuitry Bus: - Data path interconnecting the GT EQLT registers to the ALU circuitry. CMPUT101 Introduction to Computing c) Yngvi Bjornsson 16"
	},
	{
	"page_index": 176,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_017.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_017.png",
	"page_index": 176,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:15+07:00"
	},
	"raw_text": "Arithmetic logic unit Register Controlunit Input Output The Control Unit Memory Program is stored in memory - as machine language instructions, in binary The task of the control unit is to execute programs by repeatedly: - Fetch from memory the next instruction to be executed - Decode it, that is, determine what is to be done. Execute it by issuing the appropriate signals to the ALU, memory, and I/O subsystems. - Continues until the HALT instruction CMPUT101Introduction to Computing c) Yngvi Bjornsson 17"
	},
	{
	"page_index": 177,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_018.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_018.png",
	"page_index": 177,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:19+07:00"
	},
	"raw_text": "Machine Language Instructions A machine language instruction consists of: - Operation code, telling which operation to perform - Address field(s), telling the memory addresses of the values on which the operation works. Example: ADD X,Y (Add content of memory locations X and Y, and store back in memory location Y). Assume: opcode for ADD is 9, and addresses X=99,Y=100 Opcode (8 bits) Address 1 (16 bits) Address 2 (16 bits 00001001 0000000001100011 0000000001100100 CMPUT101Introduction to Computing c) Yngvi Bjornsson 18"
	},
	{
	"page_index": 178,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_019.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_019.png",
	"page_index": 178,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:22+07:00"
	},
	"raw_text": "Instruction Set Design Two different approaches: - Reduced Instruction Set Computers (RISC) Instruction set as small and simple as possible. Minimizes amount of circuitry --> faster computers - Complex Instruction Set Computers (CISC) More instructions, many very complex Each instruction can do more work, but require more circuitry CMPUT101Introduction to Computing c) Yngvi Bjornsson 19"
	},
	{
	"page_index": 179,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_020.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_020.png",
	"page_index": 179,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:27+07:00"
	},
	"raw_text": "Typical Machine Instructions Notation: - We use X, Y, Z to denote RAM cells - Assume only one register R (for simplicity) - Use English-like descriptions (should be binary) Data Transfer Instructions - LOAD x Load content of memory location X to R - STORE X Load content of R to memory location X - MOVE X,Y Copy content of memory location X to loc. Y (not absolutely necessary) CMPUT101 Introduction to Computing c) Yngvi Bjornsson 20"
	},
	{
	"page_index": 180,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_021.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_021.png",
	"page_index": 180,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:31+07:00"
	},
	"raw_text": "Machine Instructions Ccont.) Arithmetic - ADD X,Y,Z CON(Z) = CON(X) + CON(Y) - ADD X,Y CON(Y) = CON(X) + CON(Y) - ADD X R = CON(X) + R - similar instructions for other operators, e.g. SUBTR,OR, .. Compare - COMPARE X, Y Compare the content of memory cell X to the content of memory cell Y and set the condition codes (CCR) accordingly. - E.g.If CON(X) = R then set EQ=1,GT=0,LT=0 CMPUT101Introduction to Computing c) Yngvi Bjornsson 21"
	},
	{
	"page_index": 181,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_022.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_022.png",
	"page_index": 181,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:34+07:00"
	},
	"raw_text": "Machine Instructions (cont.) Branch - JUMP X Load next instruction from memory loc. X - JUMPGT X Load next instruction from memory loc. X only if GT flag in CCR is set, otherwise load statement from next sequence loc. as usual. JUMPEQ, JUMPLT.JUMPGE.JUMPLE.JUMPNEQ Control - HALT Stop program execution. CMPUT101Introduction to Computing c) Yngvi Bjornsson 22"
	},
	{
	"page_index": 182,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_023.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_023.png",
	"page_index": 182,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:39+07:00"
	},
	"raw_text": "Example Pseudo-code: Set A to B + C Assuming variable: - A stored in memory cell 100, B stored in memory cell 150, C stored in memory cell 151 Machine language (really in binary) - LOAD 150 - ADD 151 - STORE 100 - or (ADD 150, 151,100 CMPUT101Introduction to Computing c Yngvi Bjornsson 23"
	},
	{
	"page_index": 183,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_024.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_024.png",
	"page_index": 183,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:42+07:00"
	},
	"raw_text": "Structure of the Control Unit PC (Program Counter): Arithmetic logic unit Register Control unit Input Output - stores the address of next instruction to fetch Memory IR (Instruction Register): - stores the instruction fetched from memory Instruction Decoder: - Decodes instruction and activates necessary circuitry PC IR +1 nstruction Decoder CMPUT101 Introduction to Computing c) Yngvi Bjornsson 24"
	},
	{
	"page_index": 184,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_025.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_025.png",
	"page_index": 184,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:51+07:00"
	},
	"raw_text": "Memory unit Arithmetic/logic unit Input/output Control unit Bus Y MAR MDR 1/0 PC IR controller R1 F/S signal Instruction R2 decoder Memory Fetch/ Control circuit decoder store signals l/O device circuits controller R3 von Neumann Architecture ALU Selector lines GT EQ LI Random access memory Condition code register"
	},
	{
	"page_index": 185,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_026.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_026.png",
	"page_index": 185,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:54+07:00"
	},
	"raw_text": "How does this all work together? Program Execution: - PC is set to the address where the first program instruction is stored in memory. - Repeat until HALT instruction or fatal error Fetch instruction Decode instruction Execute instruction End of loop CMPUT101Introduction to Computing c) Yngvi Bjornsson 26"
	},
	{
	"page_index": 186,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_027.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_027.png",
	"page_index": 186,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:53:58+07:00"
	},
	"raw_text": "Program Execution (cont.) Fetch phase - PC --> MAR (put address in PC into MAR) - Fetch signal (signal memory to fetch value into MDR) - MDR --> IR (move value to Instruction Register) - PC + 1 -> PC (Increase address in program counter) Decode Phase - IR -> Instruction decoder (decode instruction in IR) - Instruction decoder will then generate the signals to activate the circuitry to carry out the instruction CMPUT101 Introduction to Computing (c) Yngvi Bjornsson 27"
	},
	{
	"page_index": 187,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_028.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_028.png",
	"page_index": 187,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:01+07:00"
	},
	"raw_text": "Program Execution (cont.) Execute Phase - Differs from one instruction to the next Example: - LOAD X (load value in addr. X into register) lR address -> MAR Fetch signal MDR --> R - ADD X . left as an exercise CMPUT101Introduction to Computing c) Yngvi Bjornsson 28"
	},
	{
	"page_index": 188,
	"chapter_num": 6,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_029.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_6/slide_029.png",
	"page_index": 188,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:08+07:00"
	},
	"raw_text": "nstruction Set for Our Von Neumann Machine Opcode Operation Meaning 0000 LOAD X CON(X) --> R 0001 STORE X R --> CON(X) 0010 CLEAR X 0 --> CON(X) 0011 ADD X R + CON(X) --> R 0100 INCREMENT X CON(X) + 1 --> CON(X 0101 SUBTRACT X R - CON(X) --> R 0101 DECREMENT X CON(X) - 1 --> CON(X) COMPARE X lf CON(X)> R then GT = 1 else 0 0111 lf CON(X) = R then EQ = 1 else 0 lf CON(X) < R then LT = 1 else 0 1000 JUMP X Get next instruction from memory location X 1001 JUMPGT X Get next instruction from memory loc. X if GT=1 JUMPxx X xx = LT 7 EQ7 NEQ 1101 IN X Input an integer value and store in X 1110 OUT X Output, in decimal notation, content of mem. loc. X 1111 HALT Stop program execution"
	},
	{
	"page_index": 189,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_001.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_001.png",
	"page_index": 189,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:12+07:00"
	},
	"raw_text": "Network, Internet and Internet of Things Application Layer loT Transport Layer InternetLayer Network Access Layer"
	},
	{
	"page_index": 190,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_002.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_002.png",
	"page_index": 190,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:16+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) Communication / Model SourceSystem Destination System Trans- Trans- Source Receiver Destination mission mitter System (a) General block diagram ++++ Workstation Modem Modem Server Public Telephone Network (b) Example 2"
	},
	{
	"page_index": 191,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_003.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_003.png",
	"page_index": 191,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:20+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Conventional Communication Networks Switching Wide-area node network SourceSystem Destination System Trans- Trans- Source mission Receiver Destination mitter System Localarea network 3"
	},
	{
	"page_index": 192,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_004.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_004.png",
	"page_index": 192,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:24+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Local Area Networks (LANs) Characteristics Token- LAN Smaller scope Ring Building or small campus Usually owned by same organization as attached devices Data rates much higher Categories Switched LANs 192.168.1.2 Ethernet 192.168.1.1 192.168.1.3 Wireless LANs SWITCH/ROUTER ATM LANs (Asynchronous Transfer Mode) 192.168.1.4 192.168.1.6 192.168.1.5 4"
	},
	{
	"page_index": 193,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_005.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_005.png",
	"page_index": 193,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:29+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs Wide Area Networks (WANs) Characteristics Span a large geographical area Cross public rights of way Switching Wide-area node network Technologies used include: Circuit switching Packet switching Frame relay Asynchronous Transfer Mode (ATM) 5"
	},
	{
	"page_index": 194,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_006.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_006.png",
	"page_index": 194,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:34+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs Internet Network Subscriber connection High-speed link (e. g. SONET) TCP/IP Residential user Internet service provider (ISP) Architecture Application Router Internet Transport ATM switch Internet High-speed Firewall link host ATM Network Data Link Ethernet Router switch Physical Private Information LAN PCs WAN server andworkstations 6"
	},
	{
	"page_index": 195,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_007.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_007.png",
	"page_index": 195,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:39+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) Internet of Things (loTs) # $ 0 SMS SALE ? r 0000 7"
	},
	{
	"page_index": 196,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_008.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_008.png",
	"page_index": 196,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:43+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Internet of Things s (loT) Smart Agriculture Open Data Internet of Things Smart Smart Home Retail Smart Mobility Education SMART CITY Smart Grid/ Smart Health Smart Energy + Smart Government 8"
	},
	{
	"page_index": 197,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_009.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_009.png",
	"page_index": 197,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:50+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Industry 4.0 Figure 1: The four stages of the Industrial Revolution Em First programmable logic controller 4.industrialrevolution 177 PLC,Modicon 084 based on Cyber-Physical 1969 Systemss 3.industrial revolution uses electronics and IT to First production line achieve further automation Cincinnati slaughterhouses of manufacturing 1870 2.industrial revolution follows introduction of electrically-poweredmass First mechanical loom production based on the 1784 division of labour 1.industrial revolution follows introduction of water- and steam-powered mechanical manufacturing time facilities End of Start of Start of 1970s today 18th century 20th century Source:DFKI2011 9"
	},
	{
	"page_index": 198,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_010.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_010.png",
	"page_index": 198,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:55+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) loTs and Services Figure 4: Internet of People Social Web The Internet of Things and 106-108 Services - Networking people, objects and systems CPS- platforms Smart Grid 1 Business Web Smart Factory 26 X Smart Building Smart Home Internet of Things Internet of Services 107-109 104-106 Source:Bosch Sottware lrnovations2012 1"
	},
	{
	"page_index": 199,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_011.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_011.png",
	"page_index": 199,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:54:59+07:00"
	},
	"raw_text": "Internet of Things Architecture Networks Middleware Applications Ek Ok Ek IOT Smart things Gateways N ARCHITECTURE W 0 Q https://www.altexsoft.com /"
	},
	{
	"page_index": 200,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_012.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_012.png",
	"page_index": 200,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:06+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) Internet of Things s(loT) Timothy Chou Do Learn InterP LTEAdvanced Cellular4G/LTE 3G-GPS/GPRS 2G/GSM/EDGE,CDMA.EVDO WEIGHTLESS WIMAX LICENSE-FREE SPECTRUM Collect DASH7 wi Fi WiFi BLUETOOTH UWB Z-WAVE ZIGBEE 6LOWPAN NFC ANT RFID WAN Connect WideArea Network-802.20 POWERLINE MAN ETHERNET PRINTED MetropolitanAreaNetwork-802.16 LAN LocalAreaNetwork-802.11 v4IPV6UDP DTLS RPLTeinEtMQTT DDS CAP XMPP HTTP SOCKETSREST AP PAN Personal Area Network 802.15 Ambient Light Touch Screen Proximity Fingerprint Attitude Things Accelerometer Gyroscope Moisture Magnetometer Gravity Barometer 1"
	},
	{
	"page_index": 201,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_013.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_013.png",
	"page_index": 201,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:11+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Things Layer Sensors are selected according to the applications: Easy configuration Low cost - Long lifetime Camera a is used as a sensor Actuators [MQTT Protocol]: Remote control Low latency Smart Agriculture eHealth Water Quality Smart Water MySignals wildll 1"
	},
	{
	"page_index": 202,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_014.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_014.png",
	"page_index": 202,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:17+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Connect Layer Globalareanetwork Building area WIFD Wireless Wide network iBS Area Network Metropolitanarea Home area WIFD) Neighborhood network network area network Access area network 3G+ Personalarea Bluetooth 4. ZigBee networks Campus area Lte CWAYS network xDSL ZG Lte CableTY Near RNFC PLC wimax CDMA450 communications RFID FTTx Indoor/in-home/intra communication Outdoor/inter-communication More than 60 protocols are proposed every year Mobility network 1"
	},
	{
	"page_index": 203,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_015.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_015.png",
	"page_index": 203,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:22+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Communication Protocol The combination of framing, flow control, and error control to achieve the delivery of data from one node to another The protocols are normally implemented in software by using one of the common programming languages. Sender Receiver Protocols A B Request Frame Arrival ACK Arrival For noiseless For noisy Request Frame channel channel Arrival ACK Arrival Simplest Stop-and-Wait ARQ Time Time -Stop-and-Wait Go-Back-N ARQ -Selective Repeat ARQ 1"
	},
	{
	"page_index": 204,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_016.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_016.png",
	"page_index": 204,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:29+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) OMNeT++ 5.0 OMNeT++5.0 3D Visualization Demo Press Esc to exit full screen BostonPark#OOsgEarthNet Event#1 t=0s Msgstats20scheduled/20existina/20created Nextmove(omnetpp.cMessage.id=20 InOsgEar leNode.id=RambleNode Atlastevent+Os OsgEarthNet scheduled-eve.. OsgEarthNetO. base fields owned objects parameters.gates 0:32/3:51 cc HD"
	},
	{
	"page_index": 205,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_017.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_017.png",
	"page_index": 205,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:36+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) OMNeT++ 5.0 OMNeT++.5.0 3D Visualization Demo BostonPark#0OsaEarthNet Event#976 t=3.003s Msgstats20scheduled/20existing/20created Ev/sec167.46 Simsec/sec0.533777 Ev/simsec313.725 OsgEarthNet.. scheduled-eve.. OsgEarthNetO. base fields owned objects parameters.gates 1:06/3:51 cc 1"
	},
	{
	"page_index": 206,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_018.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_018.png",
	"page_index": 206,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:44+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs OMNeT++ 5.0 OMNeT++ 5.0 3D Visualization Demo 80 BostonStreets#0:OsaEarthNet Event#44 t=1.419s Msgstats:20scheduled/20existina/20created Ev/sec14.0318 Simsec/sec0.46305 Ev/simsec30.303 OsgEarthNet. A scheduled-eve.. car[19 OsgEarthNet(O. base fields owned objects car[0] parameters.gates Beacon Street sar[1] Beacon Street Beacon Street Hloway Charies St Becon 1:26/3:51 HD 1"
	},
	{
	"page_index": 207,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_019.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_019.png",
	"page_index": 207,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:49+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) OMNeT++ 5.0 OMNeT++5.0 3D Visualization Demo Office#0:OsglndoorNet Event#622 t=40.579653790237s Msgstats:10scheduled/10existing/10created Ev/sec30.0388 Simsec/sec0.981733 Ev/simsec30.5977 OsgindoorNet.. scheduled-eve.. OsgindoorNet.. base fields ownedobjects parameters.gates Mobiles nodes in the simulation are represented by animated 3D models 2:27/3:51 cc HD"
	},
	{
	"page_index": 208,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_020.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_020.png",
	"page_index": 208,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:55+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) OMNeT++ 5.0 OMNeT++ 5.0 3D Visualization Demo B random#0:OsgEarthNet Event#1 t=0s Msgstats:5scheduled/5existing/5created Nextmove(omnetpp.cMessageid=5 InOsgEarthNet.osgEarthScene(OsgEarthScene.id=OsgEarthScene Atlast event+Os OsgEarthNet. scheduled-eve.. t 21 Mam1l Jakarte OsgEarthNetO.. base SAC fields owned objects parameters.gates satlr] s8t13 3:00/3:51 cc THD 2"
	},
	{
	"page_index": 209,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_021.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_021.png",
	"page_index": 209,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:55:59+07:00"
	},
	"raw_text": "Edge Computing in Internet of Things Applications N EDGE nVIDIA COMPUTING"
	},
	{
	"page_index": 210,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_022.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_022.png",
	"page_index": 210,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:03+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Edge Computing Operations Information Technology Technology THE EDGE Data The Things Sensors & Data Center & Aggregation Edge IT Actuators Cloud IT Wearables . Mobile Devices & Gateways Cars Meters Motors Robotics Buildings . Generators DATA GENERATION DATA SENSING DATA COLLECTION EARLY DATA DEEPDATA AGGREGATION ANALYTICS ANALYTICS 2"
	},
	{
	"page_index": 211,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_023.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_023.png",
	"page_index": 211,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:09+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs Combine it with Al = Edge Al 8 (i) Training MLmodel training Data ? Artificial Intelligence Connectivity IOT IntelligentEdge Backend Core Edge AI overcomes the latency of data and complex computations: Increase in levels of Automation Digital Twins for Advanced Analytics Real-Time Decision Making Edge Inference and Training 2"
	},
	{
	"page_index": 212,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_024.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_024.png",
	"page_index": 212,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:13+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Edge Al on Embedded Platform Sample Code Nsight Developer Tools Multimedia APl TensorRT VisionWorks X Vulkan libargus CuDNN OpenCV OpenGL GStreamer TF, PyTorch, .. NPP EGL/GLES V4L2 Deep Learning Computer Vision Graphics Media cUDA, Linux For Tegra, ROs Jetson AGX Xavier: Advanced GPU,64-bit CPU, Video CODEC, DLAs 384 NVIDlA CUDA cores and 48 Tensor Cores 2"
	},
	{
	"page_index": 213,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_025.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_025.png",
	"page_index": 213,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:19+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) PyCoral [https://coral.ai/products/] Coral Models Trained TensorFlow models for the Edge TPU California Quail Image classification Object detection Semantic segmentation 0.9179 Models that recognize the subject in an image Modeis that identify multipie objects and Modeis that identify specific pixels belonging to plus ciassificationmodels for on-device provide their iocation. different objects. transferlearning. See models - See models 7 See models 2"
	},
	{
	"page_index": 214,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_026.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_026.png",
	"page_index": 214,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:22+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) Train an Al Model Train Model Application Dev Get Data 2 4 1 3 5 Clean,Prepare Test Data & Manipulate Data 2"
	},
	{
	"page_index": 215,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_027.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_027.png",
	"page_index": 215,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:29+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (IoTs) with Google TM Demo https://teachablemachine.withgoogle.com/train New Project Open an existing project from Drive Open an existing project from a file Image Project Audio Project Pose Project Teach based on images,from Teach based on one-second-long Teach based on images,from files or your webcam sounds,from files or your files or your webcam microphone. 2"
	},
	{
	"page_index": 216,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_028.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_028.png",
	"page_index": 216,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:31+07:00"
	},
	"raw_text": "Potential Applications"
	},
	{
	"page_index": 217,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_029.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_029.png",
	"page_index": 217,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:35+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) Smart Agriculture Temperature and Humidity pH, EC Light intensity Pump controllers 6AM BAM Feed Wate eedFer umidit 25C 21C 6.0 60% 2"
	},
	{
	"page_index": 218,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_030.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_030.png",
	"page_index": 218,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:41+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) Monitoring system based AR/VR WaterLevel 63% 720% Plant Progress 8-10weeks 351 12 60% 6.0 25°C 21°C WatErTEMPERATURE OIRTEMPERATURE 2t 24-C 3"
	},
	{
	"page_index": 219,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_031.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_031.png",
	"page_index": 219,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:47+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs Air Quality Monitoring 58 35 93 70 64 23 69 6 Temperature HumidityPM2.5 Air quality monitoring program assists us in improving and developing air pollution control programs to reduce the effect of air pollution. PM2.5, PM10, C02, C0 3"
	},
	{
	"page_index": 220,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_032.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_032.png",
	"page_index": 220,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:51+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) Smart Street Light Management System Street Light 1 909090 DO H 888888 Generic loT Platform Internet Connection Street Light 2 Wifi/3G/4G/5G 999999 DO H H 888880 PLC Monitoring System 3"
	},
	{
	"page_index": 221,
	"chapter_num": 7,
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_033.png",
	"metadata": {
	"doc_type": "slide",
	"course_id": "CO1005",
	"source_file": "/workspace/data/converted/CO1005_Introduction_to_Computing/Chapter_7/slide_033.png",
	"page_index": 221,
	"language": "en",
	"ocr_engine": "PaddleOCR 3.2",
	"extractor_version": "1.0.0",
	"timestamp": "2025-10-30T15:56:55+07:00"
	},
	"raw_text": "Introduction to Applications based Internet of Things (loTs) Autonomous Robots micro:bit Smart warehouse applications 3"
	}
	]
	}