Computer Science Syllabus UG-1
Computer Science Syllabus UG-1
Theory:
Theory:
Arrays:
One dimensional, two dimensional & Multi dimensional arrays.
Pointers:
Concept of pointers, pointer operators, pointer expressions, pointer and array,
Strings and string library functions.
Structure & Unions:
Overview of structure & unions, Structure and function, array of structure,
structure pointer, Nested structure.
File Management:
Defining and opening a file, closing a file, input/output operations.
3
Transistor as a switch, Switching time, Logic circuit, active and passive logic
circuits, diode logic, register logic, register transistor logic (RTL), Register capacitor
transistor logic (RCTL), Integrated injection logic (I 2 L), transistor- transistor logic
(TTL), Emitter coupled logic (LCTL) CML and CMOS logic interfacing TTL, and
CMOS logic, their characteristics and uses.
Multivibrators:
Astable, monostable, bistable, schmidtt.
A/D Converters:
Time window and slope converters, Tracking A/D and successive approximation
converters, Digital to analog converters, LED and LCD display, seven segment display.
Introduction Data Structure : Concept of Data Types - Primptive data type, Abstract
data type, Polymorphic data type. Description of various data structure, Algorithms,
Performance analysis & Measurement. Defining problems, Designing program, Coding,
Testing, Debugging, Documentation of Program, Concept of recursion, examples of some
recursive functions.
Arrays :
Definition, One dimensional, multi dimensional arrays, representations in
memory.
Stacks & Queues :
Concept of stack and queue, Implementation of stack and queues in memory
using array & Pointer Application of stack and queues. Evaluation of expansion (Postfix,
Infix, Prefix), Circular queues - Priority queues.
Linked List :
Introduction of Linked list, Representation of Linear linked List, Operation of
Linear linked list .
Trees :
Introduction and basic terminologies, Binary tree, Binary search tree,
Representation of Binary search tree using array & linked list.
Fundamentals :
Sets, Subsets, Operation on Set, Finite & Infinite Sets, Relations & Properties of
Relations, Equivalence Relations Boolean Algebra Poset .
5
Lattices :
Lattice as Poset, Properties of Lattice, Sublattice, distributed & Complemented
Lattice.
Boolean Algebra :
Boolean Lattice & Boolean Algebra, Uniqueness of Finite Boolean Algebra
Boolean function & expression, Use of Kmaps. Graph Terminology & Application of
graphs, Finite & Infinite Graphs, Homomorphism, Subgroups, Walks Paths & Circuits,
Connected graph, Eulaline & Euler graphs, Operations on graphs, Hamiltonian Path and
Circuits.
Trees :
Properties of Tree, Distance & Center in Tree, Rooted and Binary Trees,
Spanning Trees, Matching , Matrix Representation, Graph, Coloring, Chromatic
Partitions and Coverings, Directed Graph.
Mathematical Logic :
Statements & Notations, Tautologies, Disjunctives & Conjuctives Normal forms,
Equivalence of Statements.
Wireless Transmission:
Radio Transmission, Microwave Transmission, ISDN, ATM, Data Link Layer:
Services, Framing, Error Control, Error-detecting & Correcting Codes, Data Link
Protocols:
Stop-and-wait Protocol, Sliding Window Protocol.
HDLC:
Static & Dynamic Channel allocation in LANs & MANs
Multiple Access Protocols:
ALOHA, CSMA/CD, IEEE-standards 802.3 and Ethernet, 802.4, Token Bus,
802.5 Token ring, Bridges, Routers, Gateways, Routing algos, Congestion control algos,
Internetworking.
The TCP/IP Protocol, IP Addressing, Subnets.