Computer Application
Computer Application
Number systems; Boolean algebra - minimization of Boolean function using Karnaugh Map;
Logic Gates, Combinational circuits – multiplexer, demultiplexer, encoder, decoder;
Sequential circuits: Flip-flops, Half and Full adder, Shift register, Counters; Organization of
CPU, Control Unit- Instruction and Execution cycle in CPU, Register Organization, The
Instruction Cycle, Instruction Pipelining; Memory organisation - Internal memory:
Semiconductor Main Memory (RAM, ROM, EPROM), Cache Memory, Advanced DRAM
Organization; External Memory - Magnetic Disks, RAID, Optical Memory, Magnetic Tape;
Basic structure of computer hardware and system software - Addressing methods and
machine programme sequencing; Input-output organisations - accessing I/O devices - direct
memory access (DMA) – interrupts; Introduction to microprocessors – CISC and RISC
Architecture, Study of functional units of microprocessors.
Matrix algebra: Basic operations on matrices, Rank and inverse of matrices, System of linear
equations, Characteristic roots and equations, Eigen values and eigen vectors; Basic
Differentiation, Integration and Differential Equations; Vector algebra: Double and Triple
Product of vectors; Coordinate geometry: circles and conic sections; Three dimensional
geometry: point, straight line, plane and sphere; Sets: Set theory, subsets, operations on sets,
1
set cardinality and counting; Functions: Bijective functions, pigeon-hole principle, Boolean
functions, permutation functions, Boolean algebra, recursion relations; Number Theory:
Binary arithmetic, exponentiation, induction, sequences, Fibonacci sequence, big-oh notation,
GCD, Euclidean algorithm, partially ordered sets, congruence and equivalence relation,
encryption scheme, linear homogenous recurrence relations with constant coefficients; Graph
Theory: Graphs, trees, LAN, Eulerian cycles, Hamiltonian cycles, graph coloring, graph
algorithms; Mathematical Logic: Propositional calculus, proposition, logic connectives and
compound statements, conjunction, disjunction, truth tables, duality, tautologies and fallacies;
Turing Machine: DFA, NFA.
Operating system overview: operating system as an extended machine and resource manager;
Operating system classifications; Operating system modes and system calls; Operating
system architecture; Process model, Process synchronization, Concurrent processes, Process
scheduling criterion and algorithms; Problem of mutual exclusion; Deadlock and prevention;
Race conditions; Semaphores; Monitors; Process allocation; Memory management; Multi-
programming with fixed and variable number of tasks; Continuous allocation; Paging,
Demand paging, Page fault; Virtual memory; Fragmentation; Segmented memory
management, Shared segments; Segmented and demand paged management, Overlays and
swapping, Thrashing; Multi processor system, Master slave scheduling; Homogeneous
scheduling; Device management system; Dedicated share and virtual devices; Spooling
channels; Multiplexer and selector, control units; Traffic controllers and device handlers;
Information management memory techniques; Input-Output file protection; Distributed
operating system (Course to be taught in accordance to the Unix Operating System).
(Pre-requisite: CA-111)
2
CA-124 SYSTEM ANALYSIS AND DESIGN (2L+ 1P) II
Representation of character, string and their manipulation; Linear list structure; Stacks;
Queues; Heaps; Sorting algorithms; Searching algorithms; Representation and processing of
linear linked lists; Multiple linked structures; Sparse arrays; Tree Structures: Representation
of tree structures and different tree traversal algorithms; Graph and geometric algorithms.
(Pre-requisite: CA-112)
Uses and purposes of simulation; Classification of models; Generation and testing of random
numbers, Simulation of stochastic events and processes, Design of simulation experiments,
Analysis of data generated by simulation experiments, Discrete event simulation; Verification
and validation of simulation models, Simulation languages, Simulation of agricultural
problems and systems.
(Pre-requisite: CA-101 or CA-112, AS-101 or AS-161)
3
and services; ISO-OSI references model, TCP/IP reference model; Datalink layer function
and protocols: Framing, error-control, flow control; sliding window protocol; HDLC, SLIP
and PPP protocol; Network layer - routing algorithms, congestion control algorithms;
Internetworking: bridges and gateway; Transport layer - connection management,
addressing; Flow control and buffering, multiplexing; Session layer – RPC; Presentation
layer - abstract syntax notation; Application layer - File Transfer Protocol (FTP), Telnet,
Simple Mail Transfer Protocol(SMTP); World Wide Web(WWW) - Wide Area Indexed
Servers (WAIS), WAP; Network Security; Data compression and cryptography.
(Pre-requisite: CA-111)
Introduction to Artificial Intelligence (AI); Scope of AI: Games, theorem proving, natural
language processing, robotics, expert system; Knowledge: General concept of knowledge,
Knowledge based system, Representation of knowledge, Knowledge organization and
manipulation, Acquisition of knowledge; Symbolic approach: Syntax and Semantics for
Prepositional Logic (PL) and First order predicates logic (FOPL), Properties of well formed
formulas (wffs), Conversion to clausal form, Inference rules, Resolution principle, Non
deductive inference methods; Search and Control strategies: Blind search, Breadth- first
search, Depth – First search, Hill climbing method, Best – First search, Branch and Bound
search; Learning: Concept of learning, learning automation, genetic algorithms, learning by
4
induction; Expert System: Introduction to expert system, Characteristics features of expert
system, Applications, Importance of Expert system, Rule based system architecture.
(Pre-requisite: CA-132)
Concepts and principles of data warehousing; Data warehousing architecture; System process
and process architecture; Data warehousing design; Database schema; Partitioning strategy;
Aggregations; Data marts; Meta data management; Data warehouse process; Query
Management; Data warehouse security; Backup and recovery; Capacity planning; Testing the
warehouse. Introduction to data mining; Neural networks; Fuzzy logic; Visualization
techniques; Decision trees; Association rules; Statistical and clustering models.
(Pre-requisite: CA-131, AS-161)
5
CA-223 MANAGEMENT INFORMATION SYSTEM (2L + 1P) II
Basic management principles; Objectives of MIS; System concepts of MIS; Planning, design
and implementation of MIS; Decision making with MIS; Data information and
communication of MIS; Information systems in agriculture; Development of a MIS;
Accounting and Financial management; Project management-project scheduling CPM and
PERT.
(Pre-requisite: CA-124)
Use of Software packages for: Summarization and tabulation of data; Descriptive statistics;
Graphical representation of data; Fitting and testing the goodness of fit of probability
distributions; Testing of hypothesis; t-test, Chi-square test and F-test; Concept of analysis of
variance and covariance of data for one-way and multi-classified experiments; Analyzing
crossed and nested classified designs; Analysis of mixed models; Estimation of variance
components; Testing the significance of contrasts; Correlation and regression including
multiple regression; Multivariate Analysis Techniques: Principal component analysis, Factor
analysis, Canonical Correlation Analysis, Cluster Analysis, Discriminent function; Analysis
of time series data etc.
(Pre-requisite: CA-101 or CA-112, AS-101 or AS-161)
Core Course
For M.Sc., Within the discipline: CA-111, CA-112, CA-121, CA-122, CA-124, CA-131,
CA-132, CA-135, CA-211 and CA-225