Syllabus CSI104 Summer 2021 [PDF]

  • 0 0 0
  • Gefällt Ihnen dieses papier und der download? Sie können Ihre eigene PDF-Datei in wenigen Minuten kostenlos online veröffentlichen! Anmelden
Datei wird geladen, bitte warten...
Zitiervorschau

1 2 3 4 5

Course Name Tên môn học Course Code Mã môn học No of credits Số tín chỉ Degree Level Cấp độ Time Allocation Phân bố giờ học

Pre-requisite 6 Điều kiện tiên quyết Description Mô tả

7

8

Learning Outcomes Đầu ra LO1 LO2 LO3 LO4 LO5 LO6 LO7 LO8 LO9 L1O L11 02.01a-BM/CT/HDCV/FE 1/1

L12 8 Student's tasks Nhiệm vụ của sinh viên

Teaching & Learning Materials Tài liệu học tập & giảng dạy 9

Assessment structure Cấu trúc đánh giá

10

Scoring scale 11 Thang điểm

02.01a-BM/CT/HDCV/FE 1/1

SYLLABUS/ ĐỀ CƯƠNG CHI TIẾT (Under Decision No 378/QĐ-ĐHFPT dated 2/4/2021)

Introduction to Computer Science CSI104 3 Bachelor level 30 sessions; 1 session = 90' Lectures: 24; Tutorials/Lab: 02; Presentations: 02; progress tests:02 None This course provides an overview of computer Fundamentals. Topics cover all areas of computer science in breadth such as computer organization, network, operating system, data structure , file structure, social and ethical issues. Major Instructional Areas - Introduction to Von Neumann Model and computer components - Numbering system & data representation - Different data types and operations on data - The concepts of computer networking and internet - Operating system - Introduction to basic algorithms and algorithms representation - Introduction to Data structure and File structure - The concepts of database - software engineering - Computing Security & Ethics

Upon the completion of the course, students will be able to: List the subsystems of a computer and describe the role of these components Convert a number from one base to other base( decimal, binary, octal and hexadecimal) Describe how different data type is stored inside a computer as bit patterns and operations on data List the layers in netwoking and their relationship Undestand the role of OS in a computer system Define a algorithm and describe tools used to develop algorithms Explain how a program in a high-level language is translated into machine language Describe the software lifecycle Discuss some data structures: Array, Records, Linked list Distinguish between text file and binary file and access methods Describe and explain operations within a relational database 02.01a-BM/CT/HDCV/FE 1/1

Descibe security goals and discuss ethical issues Students must attend more than 80% of contact sessions in order to be accepted to the final examination. - Students are responsible to do all exercises, assignments and labs given by instructor in class or at home and submit on time - Use laptop in class only for learning purpose - Promptly access to the http://cms.fpt.edu.vn for up-to-date course information

a) Main textbooks/resources: 1. Foundations Of Computer Science, 4th Edition, Behrouz Forouzan, Cengage, 2017, ISBN: 978-14737-5104-0. b) Reference books/resources (pdf included) 2. Fundamentals of Information Systems Security, 3rd Edition, Jones & Bartlett, 2016. 3. John L. Hennessy, David A Patterson, 2011, Computer architecture : A quantitative approach ,5th ed, Morgan Kaufmann 4. Lecture slides, supplementary material c) Tools: Internet, PowerPoint Lecture Slides, Instructor Manual, test banks, website 1) Ongoing assessment: 60%: 02 progress tests: 30% 02 labs 20% 02 Presentations 10% 2) Final Exam: 40% 3) Final result 100% Completion Criteria: 1) Every on-going assessment component > 0 2) Final Exam Score >= 4 & Final Result >= 5

10

02.01a-BM/CT/HDCV/FE 1/1

.

02.01a-BM/CT/HDCV/FE 1/1

Back to Syllabus

Sessio n Buổi học

Topic/ Sub-topics Chủ đề chính/ chủ đề con

COURSE SCHEDULE/ LỊCH TRÌNH MÔN HỌC

LO

Introduction to the Course 1

1.Computer Organization 1.1 Von Neumann model 1.2 Computer generations

ITU level Mức ITU

Materials Tài liệu

I

Course syllabus, Textbook Lecture slides,

TextBook Chapter 1 & 5; Chapter Slides

1.3 Subsystems and the role of subsystems 1.4 Central Processing Unit

3

1.5 Memory: main memory and cache memory

T

4

1.6 Input/Output subsystems 1.7 Different architectures

T

5

2. Numbering systems 2.1 Introduction 2.2 Positional Number Systems 2.3 Conversion

T

LO1

LO2

7

Introduce course, LOs, assessment, resources

T

2

6

Activitiy Hoạt động dạy và học

Lab 1: Guide Introduction to presentation 1

U,I

3.Data storage and Operations on Data 3.1 Storing Numbers 3.2 Storing Text, Media, Image, Video

T

TextBook Chapter 2; Chapter Slides,

TextBook Chapter 2, Instructor manuals

TextBook Chapter 3 & 4; Chapter Slides

Study and Read textbook

Study and Review Chapter 1&5 Read textbook Do lab Determine presentation groups Each group chooses one of the appendices as topic for presentation 1 Study and Review Chapter 2

LO3 8

3.3 Logic, Shift, Arithmetic operations

02.01a-BM/CT/HDCV/FE 1/1

T

TextBook Chapter 3 & 4; Chapter Slides

Study and Read textbook

9

4. Computer Networks and Internet 4.1 Overview 4.1.1 LAN & WAN 4.1.2 TCP/IP protocol 4.2 layers in netwoking

10

5. Operating System 5.1 Introduction 5.2 Evolution 5.3 Components of OS: UI, memory manager, process manager, file manager, device manager

LO4

T

textbook chapter 6 Chapter Slides

Study and Read textbook

T TextBook Chapter 7; Chapter Slides

LO5

11

5.3 Components of OS: UI, memory manager, process manager, file manager, device manager (continue)

T

12

Progress test 1

I

13

6. Algorithms 6.1 Concepts: input, output, processing 6.2 Three basic constructs LO6

Study and Read textbook

Quiz:question bank (chapter 1-> 7)

T

TextBook Chapter 8; Chapter Slides

14

6.3 Algorithm representation 6.4 Search Algorithms: linear, binary

15

Presentations 1

U

Slide for presentaion

16

7. Programming 7.1 translation 7.2 programming paradigms 7.2common concepts

T

TextBook Chapter 9; Chapter Slides

LO7 17

18

Lab 2: Guide Introduction to presentation 2

8.Software engineering 8.1 The software lifecycle 8.2 Analysis phase 8.3 Design phase

02.01a-BM/CT/HDCV/FE 1/1

TextBook Chapter 8 & 9, Instructor manuals U,I

T LO8

Study and Read textbook

Test

Study and Read textbook

Studens perform their presentation

Study and Read textbook

Do lab Determine presentation groups Each group chooses one of the appendices as topic for presentation 2

TextBook Chapter 10, Study and Read textbook Review Chapter 9

TextBook Chapter 10, Study and Read textbook Review Chapter 9

LO8 19

8.4 Implementation phase 8.5 Testing phase

20

9. Data structures 9.1 Arrays 9.2 Records 9.3 Linked List

LO9

TextBook Chapter 11; Chapter Slides

Study and Read textbook

Study and Read textbook

T

21

9.4 Introduction: Stack, Queue, Tree, graph

T

TextBook Chapter 12; Chapter Slides

22

Presentation 2

U

Slide for presentaion

23

10.File structure 10.1 Text versus Binary 10.2 access methods

U

TextBook Chapter 13; Chapter Slides

Study and Read textbook

T

TextBook Chapter 14; Chapter Slides

Study and Read textbook

T

TextBook Chapter 14; Chapter Slides

Study and Read textbook

24

25

26

27

L1O

11. Database 11.1 Itroduction 11.2 Database architecture

11.3 Database model 11.4 The relationship database model

L11

TextBook Chapter 14, Instructor manuals

11.5 Database design 11.6 Guide do practice set (database)

12. Security and Ethical Issues 12.1 Introduction 12.2 Confidentiality 12.3 Ethical Principles

Study and Read textbook

T

TextBook Chapter 16 & 20; Chapter Slides

Study and Read textbook

Study and Read textbook

L12

28

12.4 Privacy 12.5 Hackers

T

TextBook Chapter 16 & 20; Chapter Slides

29

Progress test 2

I

Quiz:question bank (chapter 8-> 20)

02.01a-BM/CT/HDCV/FE 1/1

Studens perform their presentation

Test

30

Review

U FINAL EXAM

02.01a-BM/CT/HDCV/FE 1/1

textbook

Review all chapters

ASSESSMENT STRUCTURE/ CẤU TRÚC ĐÁNH GIÁ

Assessment Component Hạng mục đánh giá

Progress Test

Lab

Group presentation

Final exam

Weight Trọng số

30%

20%

10%

40%

02.01a-BM/CT/HDCV/FE 1/1

Part Phần

2

2

2

1

Duration Learning Type of questions Thời Outcomes Loại câu hỏi lượng Đầu ra

7090'/each

6090'/each

.

.

Scope of knowledge and skill of questions Phạm vi kiến thức và kỹ năng của câu hỏi

Option 1: MC or suitable format Option 1: 50-60 Test 1: Chaters 1, 2, 3, Option 2: Questions Option 2: 4, 5, 6, 7 or Activities Follow lecturer's Test 2: Chapters 8, 9, proposed by proposal 10, 11, 2, 13, 14, 16, 20 lecturer

Option 1: practical exercises Option 1: N/A Option 2: Questions Option 2: technical aspect of or Activities Follow lecturer's studied topics proposed by proposal lecturer Option 1: .ppt and oral presenation Option 1: N/A Option 2: Questions Option 2: one of the appendices or Activities Follow lecturer's proposed by proposal lecturer

30'/group

60'

Number of questions Số lượng câu hỏi

L01-12

MC

70

concepts, algorithms; all 20 studied Chapters (1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13,14,16,20) .

10/13

.

02.01a-BM/CT/HDCV/FE 1/1

11/13

RE/ CẤU TRÚC ĐÁNH GIÁ

How? Cách thức đánh giá?

in class, by instructor

Guided by instructor - Labs are arranged relevant to the chapter theory - Student must finish labs and submit the results to the lecturer in class.

Note Ghi chú

Instruction and schedules for Progress Tests must be presented in the Course Implementation Plan approved by director of the campus. The test must be taken right after the last lectures of required material. Instructor has responsibility to review the test for students after graded

.

each group selects one topic to present at slot 6 & slot 17 of syllabus; then prepares to present at slot 15 & slot 22

by exam board, using computer

02.01a-BM/CT/HDCV/FE 1/1

The exam questions must be updated or different at least 70% to the previous ones.

12/13

ITU TERM Introduce: Intent: Touch on or briefly expose the students to this topic

Relationship to learning objectives: No specific learning objective of knowledge retention is linked to this t Time: Typically less than one hour of dedicated lecture/discussion/laboratory time is spent on this topic Relationship to assignments: No assignments/exercises/projects/homework are specifically linked to this

Relationship to assessment: This topic would probably not be assessed on a test or other evaluation instr

Example: At the beginning of class an example is given of the operation of an engineering system to mot aspect of the design. But, no explicit discussion of the design or analysis of operation is presented

Example: An ethical problem or dilemma is presented to the students that sets the context for an example lecture. But, no explicit treatment of ethics or its role in modern engineering practice is presented.

Teach: Intent: Really try to get students to learn new material Relationship to Learning objective: is to advance at least one cognitive level (e.g. no exposure to knowled knowledge to comprehension, comprehension to application, etc.) Time: Typically 1 or more hours of dedicated lecture/discussion/laboratory time are spent on this topic:

Relationship to assignment: Assignments/exercises/projects/homework are specifically linked to this topic

Relationship to assessment: This topic would probably be assessed on a test or other evaluation instrume Example: The process and methodology of product design are explicitly presented to and exercised by students on a project or assignment. Utilize: Intent: Assumes the student already has a certain level of proficiency in this topic Time: No time explicitly allotted to teaching this topic Relationship to assessment:Tests are not designed to explicitly assess this topic Example: When working in a laboratory session, students are expected to utilize their skills of experimentation. But, no further explicit instruction on techniques of experimentation are given.

02.01a-BM/CT/HDCV/FE 1/1