Introduction to Computer Science

1.Introduction

This course is the first major course for students of computer science and technology. As an important introductory compulsory course, it contains rich contents about computer science and offers an overall knowledge introduction. It focuses on the whole architecture of computer science and helps students set up a correct cognition and guidance learning. While establishing a necessary foundation which to launch our study, we leave lots of questions and issues for subsequent major courses.

2.Objectives and Requirements

The course Introduction to Computer Science aims to introduce some important concepts of computer science. Throughout the study, our students can generally understand expertise in computer science, newly developments and application, realize significance, contents and research methods of computer science. We require students grasp the basic concepts of information representation and data storage, hardware, operation system, network, algorithm, programming language, software engineering, data structure, database systems, artificial intelligence and theory of computation in computer science.

This is an examination course opened in the first term and contains 32 hours which equals to 2 units. The evaluation scheme comprises three parts: Assignments (20%), midterm examination (20%) and final examination (60%).

3.Topics and Content Details

Chapter 0:Introduction (2016.9.22) Download slide

Understand the basic concepts of algorithm, program, program design, software and hardware; grasp the function of algorithm; learn the origin and development of computers; understand the concept of abstraction.

Chapter 1:Data storage (2016.9.29) Download slide

Look at how information is encoded and stored within modern computers. Grasp Boolean operation, the transition between binary and decimal, binary and hexadecimal. Grasp principle of gates and Flips-Flops. Understand the computer representation of data, including text, numeric values, images, audio and video. Learn the operation principle of main memory and mass storage.

Chapter 2:Data Manipulation () Download slide

Investigate the basic internal operation of a simple computer, including how a computer manipulates data and communicates with peripheral devices. Explore the basics of computer architectures and hardware and learn how computers are programmed by means of encoded instructions. Learn the concept of stored-program and the concept of machine cycle.

Chapter 3:Operation Systems () Download slide

  • We study the software that controls the overall operation of a computer. Learn the born of operation system, its development and current status. Grasp the concepts of batch processing, interactive processing, real-time processing, time sharing and multiprogramming, multitasking. We study the definition of operation system, its properties and main functions such as processor management, storage management, device management and file management, the division of software. Grasp the concept of process and process administration.

    Chapter 4:Networking and the Internet () Download slide

    We study how computers are connected to each other to form computer networks and how networks are connected to form internets. This study leads to topics such as networks, network protocols (some popular network topologies), the Internet’s structure and internal operation. Grasp IP address, domain name, domain analysis; understand the fundamental services provided by internet; grasp the operation principle of client-server mode; grasp the basic concept of World Wide Web, including hypertext, hyperlink, hypermedia, Web page, Web site, hypertext transfer protocol, uniform resource locator, hypertext markup language and so on; learn to create a simple web page with HTML; understand a few simple methods of data encryption, like public-key encryption and digital signature; realize the network attack and protection ways.

    Chapter 5:Algorithms () Download slide

    We introduce the formal definition of algorithms and investigate how algorithms are discovered, develop elementary techniques for representing algorithms, such as primitive and pseudocode, grasp iterative and recursive structures and some popular methods’ description, such as the insertion sort algorithm, the sequential search algorithm and the binary search algorithm.

    Chapter 6:Programming Languages () Download slide

    We consider the subject of algorithm representation and the program development process, the history of program languages and their development. Create a fundamental cognition of object-oriented programming; learn the concept of procedure; learn how to translate programs written by advance languages into forms known by machines and executed.

    Chapter 7:Software Engineering () Download slide

    We learn the spirit of software, its discipline, basic principle and architecture, including software life cycle and modularity methods; learn the modeling techniques and symbols system used in the software development and design process, such as unified modeling language; learn how to make document and the design principle of human-machine interface.

    Chapter 8:Data Abstractions () Download slide

    We look at the basic concepts in data structure and study the definition of list, stack, queue and tree; grasp some popular data sorting and searching methods.

    Chapter 9:Database Systems () Download slide

    We study the fundamental concepts of database, including data, database, database management systems and database systems; grasp three relations of concept models which are one-to-one, one-two-more, and more-to-more; learn to draw ER picture; grasp the related concepts in relational database such as relation, relational operations, tuple, attribute and et al; grasp the basic relational operation; learn to apply simple SQL statements.

    4.Textbook

    J.Glenn Brookshear .Computer Science : An Overview(11th Edition)2011
    Chinese ebook   English ebook     Downlaod Studviewer

    5.Assignments

    Please check the assignment information after class. The due date for each assignment is before the next class time. For example, if the assignment is given on 2013.09.18, then the due date is 2013.09.25 (before class). Lateness assignment will only be marked 20% of the whole mark.

    Please note: avoid any behavior which could potentially result in suspicions of cheating, plagiarism, misrepresentation of facts and/or participation in an offence.

    Index
    Assignment date
    Contents and requirements
    Answers
    1  

     

     

     

     

    2  

     


     

    3  


    4    

     

    5  


    6  
     
    7  

    8  

    9  

    6.Some related materials

    1. Public class of Harvard University :Introduction to Computer ScienceCS50 http://v.163.com/special/opencourse/cs50.html
    2. Public class of MIT :Introduction to Computer science and Programming http://download.v.163.com/dl/open/00DL0QDR0QDS0QVW.html
    3. Explanation of main board http://www.360doc.com/content/09/0122/17/93804_2384176.shtml
    4. Chapter1 Answer to Questions and Exercises
    • Course No.:111079
    • Venue of the course:Building#48
    • Date and time of the course:
    • Instructor:Mingli Song
    • Office:Building #48 9th floor A906
    • Email:songmingli