Computer Science Fundamentals (CS-111)

 

Home | Course Outline | Quizzes & Exams | Assignments | Books

 

Topical Outline and Readings

 

You can skim i.e. read lightly (different than skip) the sections mentioned under each chapter

Topics
Sessions
Readings
Introduction

Scope of Computer Science (Abstraction, Models and Conventions)

1 - 2

 

Chapter 1

 

Iteration, Induction and Recursion

Definitions, Functions and Examples

3 - 5

 

Chapter 2

2.4, 2.9

Running time of programs

Measuring running time, Big-Oh notation, Analyzing running time of a program

6 - 7

 

Chapter 3

3.7 - 3.11 

List Data Model

Operations on Lists, Linked-list, Array-based implementation, Stacks, Queues, etc.

8 - 10

 

Chapter 6

6.9

MIDTERM 11

 

 
Relational Data Model and other data models

Relations, Keys, Storage structure for relations, index structures, algebra of structures, Trees, graphs, etc.

12 - 14

 

Chapter 8

8.6  to onwards

Patterns, Automata and Regular Expressions

State machines and automata, Deterministic and non-deterministic automata, regular expressions

15 - 16

 

Chapter 10

10.5 to onwards

Prepositional Logic

Logic expressions, Truth tables, Boolean Functions, K-maps, Tautologies, etc.

17 - 18

 

Chapter 12

12.11 to onwards

Predicate Logic

Predicates and logical expressions, Interpretations and Tautologies, Proofs, etc.

19 - 20

 

Chapter 14

14.10 to onwards

 

 

LAHORE UNIVERSITY OF MANAGEMENT SCIENCES (LUMS), LAHORE

 

Home | Course Outline | Quizzes & Exams | Assignments | Books