Course Introduction and Logistics

Benny George K
Dept.of Comp. Sci. and Engg.
Indian Institute of Technology Guwahati
ben@iitg.ernet.in

Introduction to Computing (CS 101)

January - April 2016

Logistics

Class Timing and Venue

Divisions I (CE, ME) and II (BT,ECE,EEE)

Divisions III (CSE,EP,MC) and IV (CL,CT,DD)



CS 101

Monday
Thursday
Friday

Monday
Thursday
Friday

Classes for Division II and IV will be in L2.

Classes for Division I and III will be in L1.

D1 slot
2:00 - 3:00
4:00 - 5:00
3:00 - 4:00

D slot.
11:00 - 12:00
9:00 - 10:00
10:00 - 11:00

Logistics

Instructors

Till Midsem
Hemangee Kapoor

Benny George K

hemangee,Div II and IV

ben , Div I and III

After Midsem
S.V. Rao
svrao,Div I and III
CS 101

Deepanjan Kesh
deepkesh, Div II and IV

Logistics

Grading Policy




40 for MidSem 60 for EndSem

25 for Make Up Quiz






CS 101

Make Up Quiz will be after End Sem

You can take the Quiz only if your attendance is above 75%

If Mid + End 25, then Marks = Mid + End

Otherwise, Marks = Min( 25, Mid + End + Quiz)
Pass Marks = 25
Cheating in course results in an F grade.
Relative grading.

Logistics

Textbooks
Textbook




A Kelly and I Pohl, A Book on C, 4/e, Pearson Education,

1999.
A M Tenenbaum, Y Langsam and M J Augenstein, Data
Structures Using C, Prentice Hall India, 1996.

References




H Schildt, C: The Complete Reference, 4/e, Tata Mcgraw

Hill, 2000
B Kernighan and D Ritchie, The C Programming Language,
2/e, Prentice Hall of India, 1988.

Lecture slides will be uploaded on the course web page.

CS 101

Course Content

Syllabus
Computer Basics
Introduction: The von Neumann architecture, machine language,
assembly language, high level programming languages, compiler,
interpreter, loader, linker, text editors, operating systems,
flowchart;

C Programming
Basic features of programming (Using C): data types, variables,
operators, expressions, statements, control structures, functions;
Advanced programming features: arrays and pointers, recursion,
records (structures), memory management, files, input/output,
standard library functions, programming tools, testing and
debugging;
CS 101

Course Content

Syllabus (contd.)

Data Structures
Fundamental operations on data: insert, delete, search, traverse
and modify; Fundamental data structures: arrays, stacks, queues,
linked lists; Searching and sorting: linear search, binary search,
insertion-sort, bubble-sort, selection-sort, radix-sort, counting-sort;

Programming Methodology
Introduction to object-oriented programming

CS 101

Course Content

Learning Objectives






CS 101

Attain fluency with basic computer usage and associated

jargon.
Understand the basic working of a computer.
Learn how to program in C.
Understand basics of object oriented programming and how
programming styles affect programmer efficiency.

What is a Computer?

Different Types of Computers

CS 101

Desktop

Laptop

Server

Tablet

What is a Computer?

Hardware








CS 101

Input devices
Processing devices
Storage devices
Output devices
Communication devices.
Power Supply and Cooling

What is a Computer?

Input and Output Devices

Keyboard

Monitor

CS 101

JoyStick

Speaker

Mouse

Microphone

Printer

What is a Computer?

Processing and Communication Devices

CS 101

CPU

RAM

Motherboard

Slots

Network Cards

Ports

Router

USB Cable

What is a Computer?

Storage Devices

CD

Hard Disk

Thumb Drive

Micro SD card

SD Card

Floppy

Memory hierarchy
CS 101

What is a Computer?

Software

System Software

Application Software

CS 101

Operating Systems, Linux, Unix, Mac, Windows, DOS,

Android
Device Drivers
Text Editors Document Processors
Browsers, Video and Music Players, Image Processing
Software, Animation Software.

How does a computer work?

Information Processing Cycle






CS 101

Input
Processing
Output
Storage

How does a computer work?

Von Neumann Architechture

Central Processing Unit

Control Unit
Input

Arithmetic/Logic Unit

Memory

CS 101

Output

How does a computer work?

Central Processing Unit




Control Unit
Arithmetic- Logic Unit

Registers

Instruction Registers
General Purpose Registers

Processing Cycle

CS 101

Arithmetic Operations
Logical Operations

Fetch
Decode
Execute
Store

How does a computer work?

Memory Hierarchy






CS 101

Internal
Main Memory
On-line Mass Storage
Off-line Bulk Storage

How does a computer work?

Quantifying Performance






CS 101

Amount of Data Stored

Speed of Data Transfer
Clock Speeds
Bit, Byte, Kilo, Mega , Giga, Tera