Course Name: CS2100 : Discrete Mathematics for Computer Science

Description: Computer Science: Mechanization of Abstraction, Data models, The Pascal data model, Algorithms and Design of programs, Iteration, Induction and Recursion, Elementary algorithm analysis. Data models for the computer, Typical computer hardware elements, Main memory, Secondary storage devices, A typical instruction set, supporting pascal data model, representing structures, List data model. The set data model, Basic definitions, Operation on sets, List implementation of sets, Characteristic vector implementation of sets, Relations and functions, Implementing functions as sets, Implementing binary relations, Infinite sets, Relational data model. Propositional logic, logic expressions, truth tables, tautologies, proof by resolution, predicate logic.

Slot: C

RoomNo: CS36

Instructor: Kamala Krithivasan

Period: JUL-NOV 2013

This page was created on: Thursday 19th of September 2013 09:30:32 PM