Total Lectures: 50
Notation, Inclusion and Equality of Sets, Power Set, Operations on set, Venn Diagram, Relation, Domain and range, Properties of binary relation in a set, relation matrix, digraph, Equivalence Relation, Partition and covering of a set. Definition and types of Functions, Composition of function, Inverse function.
Definitions and illustrative examples of semi-groups, monoids, Groups, Subgroups, Ring.
Partial Ordering, partially ordered set, chain, Maximal, Minimal, Lub and Glb, Hasse Diagram, Definition of lattice and its properties, Sublattice, distributive and complemented lattice.
Definition of graph and types, Directed and undirected graph, path, walk and circuit, Regular graph, Tree.
Total Lectures: 50
Data representation, Data Types and Number Systems, Binary Number System, Octal & Hexa-Decimal Number System, Fixed Point Representation, 1's & 2's Complement, Binary Fixed-Point Representation, Arithmetic Operation on Binary Numbers, Overflow & Underflow.
Boolean algebra and digital logic circuits - Logic Gates, AND, OR, NOT Gates and their Truth Tables, NOR, NAND & XOR Gates, Boolean Algebra, Basic Definition and Properties, Basic Boolean Law’s, Demorgan’s Theorem.
Sequential logic: Flip-Flops - RS, D, J K & T Flip-Flop, Registers, Counters and the memory unit, Shift registers, Ripple counters and Synchronous counters, Timings sequence digital logic families.
Input-output organizations - I/O Interface, Properties of simple I/O Devices and their controller, Isolated Vs Memory-mapped I/O, Modes of data transfer, Synchronous & Asynchronous data transfer.
Total Lectures: 50
Array, Function, Pointer and Structure.
Recursion vs Looping, Recursive Functions.
Sorting:
Selection, Bubble, Insertion, Heap and Quick sorting.
Searching:
Linear and Binary searching.
Self referential structure, Dynamic memory allocation.
Single Linked List:
Addition, Deletion, Insertion, Searching of nodes.
Double Linked List:
Addition, Deletion, Insertion, Searching of nodes.
Circular Linked List:
Addition, Deletion, Insertion, Searching of nodes.
Stack:
Implementation using array and linked list. Push and Pop operations.
Queue:
Implementation using array and linked list. Add and Delete operations.
Trees:
Binary Trees, Binary Tree Representations, Binary Search Tree, Prefix, Infix and Postfix traversal of tree.
Graph:
Concept and representation using matrix.
Total Lab Classes = 60
Introducing Word, Entering and Editing Text, Formatting Text, Formatting Pages, Creating Tables; Special Word Techniques, Word and the Web.
Introducing Excel, Entering Data and Formulas, Structuring the Sheet, Formatting the Sheet, Using Excel Charts, Excel Database Techniques, Special Excel Techniques, Excel.
Introducing PowerPoint, Building a Presentation, Outlining the Presentation, Creating Text Slides, Creating Chart Slides, Formatting Charts, Creating Org Chart and Tables, Customizing a Presentation, Drawing on Slides, Creating Slide Shows, Animation effects.
Total Lab Classes = 60
Page-13