Calicut University Syllabus IT: Difference between revisions

(Common with CS04 301B)

3 hours lecture and 1 hour tutorial per week

Vector spaces -Linear dependence and independence, and their computation - Bases and dimension - Subspaces - Inner product spaces - Gram-Schmidt orthogonalisation process - Linear transformations - Elementary properties of Linear transformations - Matrix of a linear transformation. (Proofs of theorems are not required)

Fourier integral (proof not required) - Fourier sine and cosine integral representations - Fourier sine and cosine transforms - Properties of Fourier transforms - Singularity functions and their Fourier transforms.

Function of a complex variable - Derivative-Analytic function - Canchy-Riemen equations - Laplaces equation - conformal mapping - Exponential function - Trigonometric functions - Hyperbolic functions - Logarithm - Linear fractional transformations.

Line integral in the complex plane - Cauchy's integral theorem (Proof of existence of indefinite integral to be omitted) - Cauchy's integral formula - Derivatives of an analytic functions (Proof to be omitted) - Taylor series - Laurent series -Singularities and zeros - Residue integration method - Evaluation of real integrals.

Module 1: K.B. Datta, Matrix and linear algebra for engineers, Prentice hall of India

Module 2: Wylie C.R. and Barret L.C, Advanced Engineering mathematics 6th Edition, McGraw Hill

Module 3: Erwin Kreyszig - Advanced Engineering Mathematics 8th Edition, John Wiley & Sons

Module 4: Erwin Kreyszig - Advanced Engineering Mathematics 8th Edition, John Wiley & Sons

1. R.S.L Srivastava, Engineering Mathematics (Volume II) Tata McGraw Hill

2. S.Narayanan, T.K. Manicavachagom Pillai & Dr. Ramanaiah - Advanced Mathematics                for Engineering students, S. Viswanathan Publishers.

3. R.K. Jain & R.K. Iyengar, Advanced Engineering Mathematics, Narosa Publishing house

4. Lipschutz. S, Linear Algebra, Schaum's Outline Series, McGraw Hill

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  - 8 short type questions of 5 marks, 2 from each module  

QII - 2 questions  of 15 marks each from module I with choice to answer anyone

QIV - 2 questions  of 15 marks each from module III with choice to answer anyone

QV - 2 questions  of 15 marks each from module IV with choice to answer anyone

(Common with CS04 302)

3 hours lecture and 1 hour tutorial per week

Review of data types - scalar types - primitive types -enumerated types -sub ranges structures types - character strings - arrays - records - sets - tiles - data abstractions - complexity of algorithms - time and space complexity of algorithms using “big oh” notation - recursion: recursive algorithms - analysis of recursive algorithms.

Linear data structures - stacks - queues -lists - stack and queue implementation using array - linked list - linked list implementation using pointers.

Non linear structures: graphs - trees - sets - graph and tree implementation using array linked list - set implementation using bit string, linked list.

Searching - sequential search -searching arrays and linked lists - binary search - searching arrays and binary search trees - hashing - introduction to simple hash functions - resolution of collisions - sorting: n2 sorts - bubble sort - intension sort - selection sort - NlogN sorts - quick sort - heap sort - merge sort - external sort - merge files

  Aho A.V., Hopcroft.J.E & Ullman J.D., Data Structures and Algorithms, Addision Wesley  

Reference book

  Adam Drozdek, Data Structures and Algorithms in C++, Thomson Brooks/cole - Vikas Pub. House pvt. Ltd.

  Deshpande P.S, Kakde O.G, C and Data Structures, Dream -tech India Pvt. Ltd.  

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  -  8 short type questions of 5 marks each, 2 from each module

QII -  2 questions  of 15 marks each from module I with choice to answer anyone

QIV -  2 questions  of 15 marks each from module III with choice to answer anyone

QV -  2 questions  of 15 marks each from module IV with choice to answer anyone

(Common with CS04 303)

3 hours lecture and 1 hour tutorial per week

Logic - logical connectives and Truth tables - Logical equivalence and laws of logic - logical implication and rules of inference - Quantifiers - Proofs of theorems using rules of universal specification and universal generalization.

Relational Structures - Cartesian products -Relations - Relation matrices -Properties of relations - Composition of relations - Equivalence relations and partitions - functions - One-to-one, on to functions - Composition of functions and inverse functions - partial orders - Hasse diagrams

Group theory - Definition and elementary properties - Cyclic groups - Homomorphism and Isomorphisms- Subgroups - Cosets and Lagrange's theorem - Elements of coding theory - Hamming metric  - Generator matrices - Group codes - Hamming matrices.

Rings and Fields -Definitions and examples of rings, integral domains and fields - Elementary properties and substructures - Homomorphisms and Isomorphisms - The ring Zn - Polynomial rings - Irreducible polynomials and finite fields.

  Ralph P Grimaldi, Discrete and Computational Mathematics: An Applied introduction  (Fourth Edition, Pearson Education, 2004  

  Tremblay, J.P. & Manohar , R, Discrete and Mathematical Structures with Applications to Computer Science, McGraw Hill Book Company.

  Kolman B & Busby R.C., Discrete and Mathematical Structures for Computer Science, Prentice Hall of India.

   Herstein I.N, Topics in Algebra, Wiley Eastern.

  Garding, L & Tambour T, Algebra for Computer Science, Narosa Publishing House, New Delhi.  

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  -  8 short type questions of 5 marks each, 2 from each module

QII -  2 questions  of 15 marks each from module I with choice to answer anyone

QIV -  2 questions  of 15 marks each from module III with choice to answer anyone

QV -  2 questions  of 15 marks each from module IV with choice to answer anyone

(Common with CS04 304)

3hours lecture and 1 hour tutorial per week

Electronic components - concepts of voltage and current sources - Energy bands in solids, metals insulators and semiconductors -Intrinsic and extrinsic semiconductors - PN junction theory - V-I characteristics - diode resistance - rectifiers - Performance analysis of rectifiers - Filters, Zener, varator and power diodes - LEDs. Transistors - Working and amplifying action - characteristics - Comparison between CE, CB and CC configurations - CE Amplifier, construction of transistors  - Use of data sheet - Thermal runaway - UJT, introduction to FETs.

Transistor biasting - Selection of operating point - Bias stabilization - Different biasting circuits - PNP biasting - Small signal amplifiers - single stage amplifier - Graphical Method - Equivalent circuit method - Amplifier analysis FET amplifier - Multistage amplifiers - Gain analysis - RC coupled amplifier - Frequency response - Two stage RC coupled amplifier - Distortation in amplifiers - Classification of amplifiers  

Power amplifiers - Single-ended power amplifier  - harmonic distortation - Push-pull amplifier - Tuned voltage amplifier - Resonance- Single tuned voltage amplifier  - Feedback in amplifiers - Types of feedback - Voltage gain with feedback - Negative feedback - Oscillators - Classification - LC oscillators - RC Oscillators - Crystal oscillators - Astable multivibrator

Operational amplifiers - Inverting and non- Inverting amplifiers - Adder - Voltage follower - Differential amplifier - Integrator and Differentiator - Zero-crossing detector - Precision diode  - Peak detector - Logarithmic amplifier - Square and triangle wave generator - Analog computation -Active filters.

  Bhargava N.N., Kulshreshta D.C. & Gupta S.C., Basic Electronics &Linear Circuits, Tata McGraw Hill (Modules I, II & III)

  Nagarath J, Electronics Analog & Digital, Prentice Hall India  (Module IV)  

  Millman J. & Halkias C.C., Integrated Electronics: Analog & Digital Circuits & Systems, Tata McGraw Hill

  Schilling D.L. & Belove C., Electronic Circuits: Discrete & Integrated, McGraw Hill  

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  -  8 short type questions of 5 marks each, 2 from each module

QII -  2 questions of 15 marks each from module I with choice to answer anyone

QIV -  2 questions of 15 marks each from module III with choice to answer anyone

QV -  2 questions of 15 marks each from module IV with choice to answer anyone

(Common with CS04 304)

3 hours lecture and 1 hour tutorial per week

Number Systems and codes - Boolean algebra - Postulates and theorems - Constants, Variables and functions - Switching algebra - Electronic gates and Mechanical contacts Boolean functions and logical operations - Normal and canonical forms - self-dual functions - Logical operations - Karnaugh map - Prime cubes - Minimum sum of products and product of sums - Quine - McClusky algorithm

Combinational Logic - Analysis and Design of combinational logic circuits - Universal property of the NAND and NOR gates - Adders -Parallel adders and look-ahead adders - Comparators - Decoders and encoders - Code conversion -Multiplexers and demultiplexers - Parity generators and checkers - ROMs PLAs

Fault diagnosis and tolerance - Fault classes and models-Fault diagnosis and testing - Test generation -Fault table method - Path sensitizations method - Boolean difference method - Fault-tolerance techniques. Programmable logic arrays - PLA minimization - Essential prime cube theorem  - PLA folding - Design for testability.

Counters and shift registers - SR, JK, D and T flip-flops - Excitations tables - Triggering of flip-flops - Flip-flop applications - Latches - Ripple counters - Synchronous counters - Up-down counters -Design of sequential circuits  - Counter decoding - Counter applications - Shift registers and their applications - Clock mode sequential machine - State tables and diagrams.

  Biswas N.N., Logic Design Theory, Prentice Hall of India (Modules I, II & III)

  Floyd T.L., Digital Fundamentals, Universal Book Stall (Module IV)  

  Kohavi Z., Switching & Finite Automata Theory, Tata McGraw Hill

  Millman  J. & Halkias C.C., Integrated Electronics: Analog & Digital Circuits & Systems, Tata McGraw Hill

  M.Morris mano, Charles R. Kime, Logic and Computer Design Fundamental, Pearson Education.  

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  -  8 short type questions of 5 marks each, 2 from each module

QII -  2 questions  of 15 marks each from module I with choice to answer anyone

QIV -  2 questions  of 15 marks each from module III with choice to answer anyone

QV -  2 questions  of 15 marks each from module IV with choice to answer anyone

(Common with CS04 304)

3 hours lecture and 1 hour tutorial per week

[This topic is concerned with the most fundamental aspects of academic study; abilities to reason with ideas and evidence, to formulate arguments effectively and to appreciate the interplay between ideas and evidence in debate. It introduces a student to the nature of good reasoning and how to test and construct good arguments without assuming any prior knowledge of logic or philosophy. The subject May work as a much-needed guide to thinking critically for oneself.]

Introduction to argument - choice of topic - defining audience -defining terms - planning argument - avoiding logical fallacies - case study of classic arguments of Mahatma Gandhi, Martin Luther King Jr.

Understanding forms of persuasion - Reading critically - Plagirism - documenting sources - guide to research - avoiding selective research - case study involving issue of surfing the web.

Searching for magazine, journal, newspaper articles - using abstracting services, Internet, books, other library resources - case study involving culture and curriculam

Conducting interviews, surveys, compiling bibliography - organizing, writing and preparing researched paper - case study involving gun control and immigration - case study of select classic argument of Plato.

  Robert k Miller, The informed Argument, fifth edition, Harcourt Brace College Publishers  

References:

  Tracy Bowell and Garry Kemp, Critical Thinking, Routledge Publishers

  David Sansford, If P then Q, Routledge Publishers   

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  -  8 short type questions of 5 marks, 2 from each module

QII -  2 questions  of 15 marks each from module I with choice to answer anyone

QIV -  2 questions  of 15 marks each from module III with choice to answer anyone

QV -  2 questions  of 15 marks each from module IV with choice to answer anyone

3 hours Practical per week

This Course is to give a strong programming concept so as to introduce the software engineering techniques to the students of computing streams. For adequacy this has to be complemented by exercises appearing in texts and references. Books have been carefully chosen to get examples from diverse computing applications for practice.

HCF (Euclid's algorithm) and LCM of given numbers - Find mean - median and mode of a given set of numbers - Conversion of numbers from binary to decimal, hexadecimal, octal and back - Evaluation of functions like  ex, Sin x, cos x, etc. for a given numerical precision using Taylor's series - Testing whether a given number is prime.

String manipulation programs: sub-string search, deletion - Lexicographic sorting of a given set of strings - Generation of all permutations of the letters of a given string using recursion.

Matrix operations: Programs to find the product of two matrices - Inverse and determinant (using recursion) of given matrix - Solution to simultaneous linear equations using Jordan elimination.

Files: Text files - use of sequential files for storing records with provision for insertion - deletion, search, sort and update of a record. Implementation of random access files of records.

Usage of program development & maintenance tools (for example. “make”)  - Examples of accessing operating system environment from within program, conditional assembly - Exercises involving standard I/O devices, argc,  argv functions - Exercises demonstrating a few system calls.

Note: Make utility May used extensively to do the programming for this set of experiments.

  Schildt H., C: The Complete Reference, Tata McGraw Hill

  Tan H.H. & D'Orazio T.B., C programming for engineering & Computer Science, McGraw Hill

  Cormen T.H. et al, Introduction to Algorithms, Prentice Hall of India.

  Brian W Kernighan and Rob Pike, The Unix Programming environment, Prentice Hall of India/Pearson Education Asia.  

Assignments 2x7.5 = 15

Tests 2x15 = 30

Regularity  = 05

Total marks  = 50

3hours Practical per week

This course gives hand on experience on digital electronics components and systems; which are fundamental building blocks of the Computer systems. Experiments are structured to cover extensively the characteristic and features of indispensable digital electronic circuits and systems

  Verification of truth tables of AND, OR, NOT, NAND, NOR and XOR gates, use for gating digital signals  

  TTL characteristics

  Decade counter and variable modulo asynchronous counter

  Astable multivibrator and Schmitt trigger using gates, astable and monostable multivibrator and frequency divider using 555  

  Nagarath.J, Electronics Analog & Digital, Prentice Hall India

  Millman & Halkias, Integrated Electronics, Tata McGraw Hill  

Lab practicals & records =25

Regularity in the class =05

2 tests 2x10 =20

Total marks  =50

(Common with CS04 401)

3 hours lecture and 1 hour tutorial per week

Introduction -Probability distributions continuous random variables -Probability density functions - Mathematical expectation - The Expected value of arandom variable -Moments -Moment generating function- Special probability distributions -Binomial distribution-Geometric distributions-Hyper geometric distribution-Poisson distribution-Special probability densities-Uniform density -Gamma nad Chi-square distributions-Normal distribution.

Population and samples-The sampling distribution of the mean- The sampling distribution of the variance Estimation-Introduction-Unbiased estimators-Efficiency-Consistency-Sufficiency-The method of maximum likehood-Interval estimations- the estimation of means-The estimation of Variances.

Tests of hypothesis-Null hypotheses and tests of hypotheses and tests of hypotheses - Hypotheses concerning one mean-Hypotheses concerning two means - hypothesis concerning one variance - Hypotheses concerning two variances -chi-square test for goodness of fit.

(16 hours)

Joint distribution functions-Independent random variables-Covariance and variance of sums of random variables-Joint probability distribution of functions of random variables- Joint probability distribution of functions of random variables-Stochastic process-Conditional probability and conditional expectations.

Markov chains-Champman Kolmogorov equations-Exponential distribution-Properties of exponential distribution-Counting process-Definition of Poisson process-Interval and waiting time distributions.

Module 1: John E Freund, Mathematical Statistics 5th Edition, Prentice Hall of India

Module 2: Johnson R.A, Miller & Freud's Probability & Statistics for Engineers, 6th Edition Pearson Education Asia

Module 3: Johnosn R.A, Miller & Freud's Probability & Statistics for engineers, 6th Edition Pearson Education Asia

Module 4: Ross S.M, Introduction to Probability Models, 7th Edition, Academic Press

  Erwin Kreyszig- Advanced Engineering Mathematics, 8th Edition, John Wiley & sons

  R.E. Walpole, R.H Myers, S.L Myers& Keying, Probability and Statistics for Engineers, 7th Edition, Pearson Education Asia

  Karlin S & Tailor.H, A first course in Stochastic process, Academic Press  

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI - 8 short type questions of 5 marks each, 2 from each module

QII - 2 questions of 15 marks each from module I with choice to answer any one  

QIV - 2 questions of 15 marks each from module III with choice to answer any one  

QV - 2 questions of 15 marks each from module IV with choice to answer any one

3 hours lecture & 1 hour Tutorial per week

The importance of environmental science and environmental studies cannot be disputed. Continuing problems of pollution, loss of forest, solid waste disposal, degradation of environment, loss of bio diversity etc have made everyone aware of environmental issues. The objective of this course is to create general awareness among the students regarding these environmental issues.

The Multi disciplinary nature of environmental studies

Definition - scope and importance -need for public awareness.

Renewable and non-renewable resources:

Natural resources and associated problems - forest resources: Use and over exploitation, deforestation, case studies. Timber extraction, mining, dams and their defects on forests and tribal people. - Water resources: Use and over - utilization of surface and ground water, floods, drought, conflicts over water, dams-benefits and problems. -Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources, case studies. - Food resources: World food problems, changes caused by agriculture overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. Energy resources: Growing energy needs, renewable energy sources, use of alternate energy sources, case studies - Land resources: Land as a resource, land degradation, man induced land slides, soil crosion and desertification - Role of an individual in conservation of natural resources - Equitable use of resources for sustainable lifestyle.

Ecosystems - Concept of an ecosystem -Structure of an ecosystems - Producers, consumers, and decomposers- Energy flow in the ecosystem- Ecological succession - Food chains, food webs and ecological pyramids - Introduction, types, characteristic features. Structure and functions of the following ecosystem: - forest ecosystem - Grassland ecosystem- Desert ecosystem -Aquatic ecosystem (ponds, streams, lakes, rivers, oceans, estuaries)

Biodiversity and its conservation

Introduction -Definition: genetic, species and ecosystem diversity - Biogeographical classification of India - Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values - Biodiversity at global, national and local levels- India as a mega-diversity nation - Hot-spots of Biodiversity - Threats to biodiversity: habitat loss, poaching of wild life, man-wildlife conflicts - Endangered and endemic species of India -Conservation of Biodiversity: In-situ and Ex-situ conservation of biodiversity.

Environmental Pollution

Definition - Causes, effects and control measures of: - Air pollution -Water pollution -Soil pollution- Machine pollution- Noise pollution- Thermal pollution -Nuclear hazards - Solid waste Management: Cause, effects and control measures of urban and industrial wastes - Role of an individual in prevention of pollution - Pollution case studies - Disaster management: floods, earthquake, cyclone and landslides -Environmental Protection Act - air (Prevention and Control of Pollution) Act- Water (Prevention and control of Pollution) Act - wildlife Protection Act - Forest Conservation Act - Issues involved in enforcement of environmental legislation- Public Awareness.

Social Issues and the Environment

From unsustainable to sustainable development -Urban problems related to energy - Water conservation, rain water harvesting, watershed management- Resettlement and rehabilitation of people: its problems and concerns, case studies - environmental Ethics: Issues and possible solutions- Climate change, global, warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Case studies - Wasteland reclamation - Consumerism and waste products.

Human Population and the environment

Population growth, variation among nations - Population explosion - family welfare programme - Environment and human health - Pollution hazards, sanitation and health - Human rights for clean environment-Value Education-HIV/AIDS-social concern-Women and Child Welfare-Role of information Technology in Environmental and human health-case studies.

  Visit to a local area to documents environment assets river/forests/grassland/hill/ mountain

  Visit to local polluted site-urban/rural/industrial/agricultural

  Study of common plants, insects, birds

  Study of simple ecosystems-pond, river, hill slopes, etc.  

  Clark, R.S. Marine Pollution. Clanderson Press Oxford  

  Mhaskar A.K, Matter Hazardous. Techno-science Publications

  Townsend, C, Harper, J. and Michael Begon, Essential of Ecology. Balckwell science

  Trivedi . R.K. and Goel. P.K. Introduction to air pollution. Techno-Science Publications  

  Agarval. K.C. 2001 Environmental biology.Nidhi Publ. Ltd. Bikaner

  Bharucha Erach, Biodiversity of India, Mapin Publishing Pvt.Ltd, Ahmedabad-380 013, India, E-mail: mapin@icenet.net

  Wagner K.D. 1998. Environmental Management. W.B. Saunders Co. Philaldelphia, USA 499pp   

  (M) Magazine

2 Tests = 20  

Field work and Report (Internal Assessment) = 25

Regularity = 5

Total marks = 50  

QI -  16 Short answer question (4 from each module) of 5 marks each with a choice to answer any 12 (12x5)

QII - 2 questions A&B of 10 marks from module I with choice to answer any one

QIV - 2 questions A&B of 10 marks from module III with choice to answer any one  

QV - 2 questions A&B of 10 marks from module IV with choice to answer any one

(Common with CS04 403)

3 hours lecture and 1 hour tutorial per week

[The subject gives the essentials of system software design. System software consists of programs necessary to make the hardware function properly. The objective of the study of this subject is to equip the student with the right kind of tools for computer systems design and development]

Background - System software machine architecture -the simplified instructional computer - traditional machines -RISC machines -assemblers - bascic assembler functions- machine dependent and machine independent -assembler features- assembler designs - assembler design options - implementation examples- AIX Assembler.

Loaders and linkers - basic loader functions - machine dependent and machine independent loader features- loader design options and implementation examples- macro processors- basic macro processor functions - machine-independent macro processor features - macro processor design options and implementations examples.

Introduction to operating systems - basic principles - batch processing - multiprogramming- time sharing systems and real-time systems - parallel and distributed systems - computer system structure - computer system operation -I/O structure - structure -storage hierarchy - hardware protection - general system architecture - operating system structure -system components - OS services - system calls -system structure - virtual machines.

General overview of the UNIX operating system - history of UNIX - system structure - user perspective -services - hardware assumptions - unix Architecture - system concepts - kernel data structures - system administration process (concepts only)

  Beck L.L., System Software - An introduction to systems Programming, Addison Wesley  

  Bach M.J., The Design of the Unix Operating System, Prentice Hall India  

  Dhamdhere D.M., Systems Programming and Operating Systems, Tata McGraw Hill

  Godbole S, Operating Systems, Tata McGraw Hill  

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  -  8 short type questions of 5 marks, 2 from each module

QII -  2 questions  A & Bof 15 marks from module I with choice to answer anyone

QIV -  2 questions  A & B of 15 marks from module III with choice to answer anyone

QV -  2 questions  A & B of 15 marks  from module IV with choice to answer anyone

(Common with CS04 404)

3 hours lecture and 1 hour tutorial per week

The Course depicts essential features of systems design based on microprocessors. Students get exposure to hardware, interfacing, programming and debugging. The course is also meant to enable students to design hardware systems for optimal performance.

Historical background of microprocessors - inside the PC - motherboard - graphic adapters and monitors - drive controllers - floppy and hard disk drives - streams and other drives - parallel interfaces and printers- serial interfaces and modems - network adapters and LANs - CMOS RAM and real clock - keyboard, mouse and other rodents - the power supply - operating system - BIOS and memory organization - 8086/8088 hardware specification: clock generator-bus buffering and latching-bus timing-ready and wait states- minimum and maximum modes-advanced processors- features of 80386,80486 and Pentium processors  

Microprocessors architecture: real mode and protected mode memory addressing-memory paging-addressing modes-data addressing-program memory addressing-stack memory addressing-data movement instructions-arithmetic and logic instruction-program control instructions-programming the microprocessors: modular programming -using keyboard and display-data conversion- disk file- interrupt hooks   

Memory interface-memory devices- address decoding,8bit (8088),16bit(8086),32bit (80486) and 64 bit(Pentium) memory interfaces-dynamic RAM.I/O interface-port address decoding-PPI,8279 interface-8254 timer interface-16550 UART interface-ADC /DAC interface  

Interrupts -interrupt processing -hardware interrupts - expanding the interrupt - 8259A programmable interrupt controller -DMA: DMA operation - 8237 DMA controller -shared bus operation- disk memory systems - video displays - bus interface: ISA bus -EISA and VESA buses -PCI bus

  Brey B.B, The Intel Microprocessors 8086 to Pentium: Architecture, Programming and Interface, Prentice Hall of India  

  Messmer  H.P, The indispensable PC Hardware Book, Addison Wesley

  Ray K. & Bhurchandi K.M., Advanced Microprocessors & Peripherals, Tata McGraw Hill

  Miller K., An Assembly Language Introduction to Computer Architecture using the intel Pentium, Oxford University Press

  Bigelow S.J., Troubleshooting, Maintaining & Repairing PCs, Tata McGraw Hill  

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  -  8 short type questions of 5 marks each, 2 from each module

QII -  2 questions  of 15 marks each from module I with choice to answer anyone

QIV -  2 questions  of 15 marks each from module III with choice to answer anyone

QV -  2 questions  of 15 marks each from module IV with choice to answer anyone

3 Hours lecture and 1 hour tutorial per week

Objective of the course is to teach students about different models for programming and to introduce the various constructs and their implementation to support the model on a bare machine. The material is selected to be useful for the computing science stream. It is hoped that students will be familiar with principles of design of programming languages after going through this course. The text given is presenting the ideas using abstract notation; however, the first reference contain good illustrations to the ideas and teachers are requested to include sufficient illustrations from the reference book while presenting ideas in classroom. Paradigms lab will supplement the learning process.

Introduction: Role of programming languages - higher level languages - programming paradigms - language implementation on a machine - Language Syntax description -notations for expressions, abstract syntax trees, lexical syntax, context free grammars, variants of grammars- Language Semantic description - introduction to synthesized attributes, attributed grammar, natural semantics, denotational semantics.

Imperative programming: Introduction - structured programming - Constructs for structured control flow - syntactic concerns - handling special cases in loops - Discussion based on C.

Role of types -Basic types - compound types like arrays, records, union and variant records, sets - Pointers and dynamic allocation - types and error checking -Discussion based on C.

Introduction to procedures - parameter passing methods - scope rules -, nested scopes- implementation- discussion based on C.

Object oriented programming: Introduction - Grouping of data and operations- Constructs for program structuring - Information hiding - Program design with modules - Modules and defined types - Illustration based on C++ on class declaration, dynamic allocation, templates, objects.

Definition of object - Object oriented thinking - Inheritance - Derived classes and information hiding - Illustration based on C++.

Functional programming: Introduction - Elements of functional programming -  Types: values and operations - Function declaration - approaches to expression evaluation - Lexical scope - Type checking.

Functional programming with lists- introduction to schemes- Structures of lists - List manipulation - Simplification of expression - storage allocation for lists.

Logic programming:

Introduction - Computing with relations - Introduction to Prolog - Data structures - Programming techniques - controlling prolog - Cuts.

Text books

  Ravi Sethi; Programming languages - Concepts and Constructs; Pearson Education Asia  

  Sayed H. Roosta; Foundations of programming languages Designs and Implementation; Vikas Publishing House, New Delhi

  Scott M.L; Programming Language Pragmatics; Harcourt Asia (Morgan Kaufman)

  Tennent R.D; Principles of Programming Languages; Prentice Hall International

  Appleby. D & Vandekopple.J.J; Programming Languages: Paradigms & Practice; Tata McGraw Hill   

30 - Test papers (minimum 2)

15 -  Open book tests/Assignments/any other mode decided by the teacher.

5 - Other measures like Regularity and Participation in Class.

Total Marks=50

QI  -  8 short type questions of 5 marks, 2 from each module

QII -  2 questions  A & B of 15 marks  from module I with choice to answer anyone

QIV -  2 questions A & B of 15 marks from module III with choice to answer anyone

QV -  2 questions A & B of 15 marks from module IV with choice to answer anyone

3 hours lecture and 1 hour tutorial per week

Objective of these course is to give idea about the various transmission technology available for digital communication. This together with paper of digital data communication will give sound knowledge in designing custom communication network for an IT application. This course is touching more on the theory on how is each working. This is a pre-requisite for the computer network course also.

Noise in communication systems - Classification - SNR - CNR - Noise figure -Relationship between noise figures - Voice signal digitization - PAM - pTM - PWM - PCM - Delta modulation - PCM & DM voice signal comparison - TDM of PCM signals - CCITT - Digital radio - Block diagram - ASK - FSK -PSK - QAM - Digital demodulation - QAM demodulation.

   

Line of sight microwave links - Analog line of sight microwave links - Digital line of sight microwave links - Communication satellite - Classification - Communication satellite systems - Orbits - Planetary mechanics - Launching -Stabilization -Subsystems and repeaters - Satellite Earth station - antenna subsystems -  Transmitter - Receiver.

Fibre optic communications - nature of light - Optical Laws - Optical fibres - Optical sources - Photo detections - Optical communication system - System parameters - Analog optical fibre links - Digital optical fibre systems.

Satellite access - FDM access -TDM access - Satellite links - Satellite link analysis and design - Digital satellite link design - System measurements - Fourier series - The Z - transform -  Modulator/demodulator sensitivity measurements - digital microwave link measurements and performance evaluation - high definition TV - System specifications.

1. Kolimdiris H., Digital Communication Systems, Pearson Education, Asia

Reference books

  Gagliardi R.M., Satellite Communication, CBS Publishers

  Gowar, Optical Communication, PHI  

Assignments 2x7.5 =15

Tests 2x15 =30

Regularity  =05

Total marks  =50

QI  -  8 short type questions of 5 marks each, 2 from each module

QII -  2 questions  of 15 marks each from module I with choice to answer anyone

QIV -  2 questions  of 15 marks each from module III with choice to answer anyone

QV -  2 questions  of 15 marks each from module IV with choice to answer anyone

3 hours Practical per week

  Stack Queue: Implementation using arrays and linked lists  

  Searching methods: Binary search and hashing

  Infix expression evaluation: Using expressions tree.

  Graphs search Algorithms: DFS & BFS on a connected directed graph.

  Shortest path Algorithms:  Dijkstra and Floyd Warshall algorithms

  Disjoint set operations: Union and find using rank and path compression

  Applications of Heap: Priority queue and heap sort  

  Cormen T.H., lieserson C.E.& Rivest R.L., introduction to Algorithms, Prentice Hall of India

  Sahni S., Data structures, Algorithms, and Application in C++, McGraw Hill  

Lab practicals  & record = 25

2 tests 2x10 = 20

Total marks  = 50

      

3 hours practical per week

  Familiarization with features of an editor ( for example Vi, Emacs)

  Shell programming, usage of tools like grep, awk etc…

  Introduction to the tools providing GUI based human computer interaction (for example Qt.). Automatic generation of code for interaction using visual programming (for example Qt Designer)

  Introduction to tools for preparing documents (for example Word/Latex)  

Lab practicals  & record = 25

2 tests 2x10 = 20

Total marks  = 50

    

(Common with CS04 501)

3 hours lecture and 1 hour tutorial per week

Objective of the course is to quickly introduce the software engineering techniques and background information in a single paper useful for the computing sciences stream.  Note that software engineering has grown to the level of becoming a course by itself; since we are covering material in a single paper because of lack of slots, the thrust of this course is on teaching existing practice.  For adequacy this has to be complemented by exercises appearing in texts and references.  Books have been carefully chosen to get examples from diverse computing application for practice along with theory.  Those interested can find additional training materials downloadable from sites associated with each book.  One suggestion is to consider using techniques learned here while doing mini project.

Introduction: Definition - History - Software life cycle - Software Engineering & other areas of  computer science - Nature of a software product - Representative qualities - Quality requirements in different application areas - Idea of quality assurance.

Software Engineering principles - Illustrative case studies.

Design:  Relation of software engineering principles to design - Design activity & its objectives - Modularization techniques - module structure and its representation, interface and information hiding, categories, specific techniques to accommodate change, stepwise refinement, top-down and bottom-up design - Handling anomalies.

Concurrent software - methods to keep consistency - Real time software - Distributed software - issues in building modules, module integration - Object oriented design.

Specification: The different contexts - Typical uses - Different styles - Verification of specification.

Operational specification notations - Definition with example for DFD, UML, Finite state machines - Descriptive specification notations - Definition with example of E-R diagrams, logic specification, algebraic specification - Building & using specifications in practice.

Verification:

Goals and requirements of verification - Approaches to verification.

Process models - Waterfall model, Evolutionary model, Transformational model, Spiral model - An assessment of process models - Dealing with Legacy software - Case study: A telephone switching system - Case study: Synchronize & stabilize process - Case Study: Open source approach.

Configuration management - Software standards.  

Management: Functions - Project planning - Software productivity - Productivity metrics - Factors affecting productivity - Cost estimation - Predictive models - COCOMO & COCOMO II - Project control - Work breakdown structures, Gantt charts, PERT charts - Dealing with deviations - Team organization - centralized, de-centralized, mixed - An assessment of team organizations - Risk management - Capability maturity model.

Tools & Environments: Evolution - Dimensions for comparing tools - Representative tools - Tools for software testing - Static analyzers - GUI tools - Configuration management tools - Tracking tools - Reverse and re-engineering tools - Management tools - Tool integration - Evolution of tools.  

Future - Role of the software engineer - Ethics and social responsibility.

  Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli; Fundamentals of Software Engineering; 2nd edition; Pearson Education Asia   

  Pressman R.S.; Software engineering - A practitioner's approach; 5th edition; McGraw Hill Higher education series.

  Mall R.; Fundamentals of Software Engineering; Prentice Hall of India

  Jalote P.; An Integrated approach to Software Engineering; Narosa

  Ian  Sommervillie; Software Engineering, Pearson Education Asia  

60% - Test papers (minimum 2)

30% - Assignments/Term project/any other mode decided by the teacher.

10% - Other measures like Regularity and Participation in Class.

Total Marks=50

QI  -  8 short type questions of 5 marks, 2 from each module

QII -  2 questions  of 15 marks each from module I with choice to answer anyone

QIV -  2 questions  of 15 marks each from module III with choice to answer anyone

QV -  2 questions  of 15 marks each from module IV with choice to answer anyone

(common with CS04 502)

3 hours lecture and 1 hour tutorial per week

This course is useful for the students in understanding the fundamental theory associated with Data Communication, which is the basis for all forms of Computer networks. This syllabus focuses on essential principles of digital transmission and the reliable transfer of data between Computers located at various places.]

Data communication networks - standards - ISO reference model - internal architecture - protocol implementation issues - transmission media - attenuation and distortion - limited bandwidth - signal types -propagation delay - public carrier circuits - modulation - multiplexing - physical layer interfacing standards

Data transmission basics - transmission modes - asynchronous and synchronous transmission - bit - character and frame synchronization - coding - error detection methods - parity - block sum check - cyclic redundancy check - data compression - Huffman coding - dynamic Huffman coding - facsimile compression - transmission control circuits - communication control devices

Protocol basics - error control - stop-and-wait & sliding window protocol - link utilization - selective repeat and go-back-N - link management

Module - IV: (13 hours)

Data link control protocols - character-oriented protocols - half-duplex protocols - duplex protocols - bit- oriented protocols - high level data link control (HDLC) - LAPB - LAPD - logical link control - protocol operation

1. Halsall F., Data Communication, Computer Networks and Open Systems, Addison Wesley

Reference books

  William Stallings, Data and Computer Communications, PHI

  Prakash C Gupta, Data Communications, PHI  

Assignments 2x7.5 = 15

Tests 2x15 = 30

Regularity  = 05

Total marks  = 50

Q I    -  8 short type questions of 5 marks each, 2 from each module

Q II  -  2 questions of 15marks each from module I with choice to answer any one

Q IV  - 2 questions of 15marks each from module III with choice to answer any one

Q V  - 2 questions of 15marks each from module IV with choice to answer any one

(Common with CS04 503)

3 hours lecture and 1 hour tutorial per week

This course is to impart the students the need and requirement of an interface between Man and Machine; to enable them to identify the difference between the system software and the application software and their design requirements. The syllabus includes the features of operating systems and the fundamental theory associated with process, memory and file managements components of operating systems.]

Review of operating system strategies - resources - processes - threads - objects - operating system organization - design factors - functions and implementation considerations - devices - characteristics - controllers - drivers - device management - approaches - buffering - device drivers - typical scenarios such as serial communications - storage devices etc

Process management - system view - process address space - process and resource abstraction - process hierarchy - scheduling mechanisms - various strategies - synchronization - interacting & coordinating processes - semaphores - deadlock - prevention - avoidance - detection and recovery

Memory management - issues - memory allocation - dynamic relocation - various management strategies - virtual memory - paging - issues and algorithms - segmentation - typical implementations of paging & segmentation systems

File management - files - implementations - storage abstractions - memory mapped files - directories and their implementation - protection and security - policy and mechanism - authentication - authorization - case study of unix kernel and microsoft windows NT (concepts only)

  Nutt G.J., Operating Systems - A Modern Perspective, Pearson Education Asia  

  Silberschatz & Galvin, Operating System Concepts, Pearson Education Asia

  Crowley C., Operating Systems-A Design Oriented Approach, Tata McGraw Hill

  Tanenbaum A.S., Modern Operating Systems, Prentice Hall of India / Pearson Education  

Assignments 2x7.5 = 15

Tests 2x15 = 30

Regularity  = 05

Total marks  = 50

Q I    - 8 short type questions of 5 marks each, 2 from each module

Q II  - 2 questions of 15marks each from module I with choice to answer any one

Q IV  - 2 questions of 15marks each from module III with choice to answer any one

Q V  - 2 questions of 15marks each from module IV with choice to answer any one

3 hours lecture and 1 hour tutorial per week

The subject deals with the fundamentals of information quality, error control in communication process and various systems of coding information for reliable communications. Built on a sound mathematical basis, the methods developed in this field of study are essential in a study of communication systems, information Technology and computing. A background in algebraic structures would prove helpful while learning this subject.

Information theory - information and entropy - properties of entropy of a binary memory less source - extension of a discrete memory less source - source coding theorem - Shannon-Fano coding - Huffman coding - Lempel Ziv coding - discrete memory less source - binary symmetric channel - mutual information - properties - channel capacity - channel coding theorem - information capacity theorem

Coding - linear block codes - generator matrices - parity check matrices - encoder - syndrome and error detection - minimum distance - error correction and error detection capabilities - cyclic codes - coding and decoding

Introduction to algebra - groups - fields - binary field arithmetic - construction of galois field - basic properties - computations - vector spaces - matrices - BCH codes - description - decoding - reed solomon codes

Coding - convolutional codes - encoder - generator matrix - transform domain representation - state diagram - distance properties - maximum likelihood decoding - Viterbi decoding - sequential decoding - interleaved convolutional codes

  Simon Haykin, Communication Systems, John Wiley

  Shu Lin & Costello D.J., Error Control Coding - Fundamentals and Applications, Prentice Hall Inc. Englewood Cliffs  

  Das J., Malik S.K. & Chatterje P.K., Principles of Digital Communication, New Age International Limited

  Sam Shanmugham, Digital and Analog Communications, John Wiley  

  Simon Haykin, Digital Communications, John

  Taub & Shilling, Principles of Communication Systems, Tata McGraw Hill.  

Assignments 2x7.5 = 15

Tests 2x15 = 30

Regularity  = 05

Total marks  = 50

Q I    - 8 short type questions of 5 marks each, 2 from each module

Q II  - 2 questions of 15marks each from module I with choice to answer any one

Q IV  - 2 questions of 15marks each from module III with choice to answer any one

Q V  - 2 questions of 15marks each from module IV with choice to answer any one

3 hours lecture and 1 hour tutorial per week

This course comprehends the graphs as a modeling and analysis tool in computer science & Engineering. It introduces the structures such as graphs & trees and techniques of counting and combinations, which are needed in number theory based computing and network security studies in Computer Science.

Introduction to graphs - definitions - subgraphs - paths and cycles - matrix representation of graphs - euler tours - chinese postman problem - planar graphs - Euler's formula - platonic bodies - applications of Kuratowski's theorem - hamiltonian graphs - graph colouring and chromatic polynomials - map colouring

Trees - definitions and properties - rooted trees - trees and sorting - weighted trees and prefix codes - biconnected components and articulation points - Kruskal's and Prim's algorithms for minimal spanning trees - Dijkstra's shortest path algorithm - bellman-ford algorithm - all-pairs shortest paths - Floyed-Warshall algorithm - the max-flow min-cut theorem - maximum bipartite matching

Fundamental principles of counting - permutations and combinations - binomial theorem - combinations with repetition - combinatorial numbers - principle of inclusion and exclusion - derangements - arrangements with forbidden positions

Generating functions - partitions of integers - the exponential generating function - the summation operator - recurrence relations - first order and second order - nonhomogeneous recurrence relations - method of generating functions

  Grimaldi R.P., Discrete and Combinatorial Mathematics: An Applied Introduction, Addison Wesley  

Reference books

  Liu C.L., Elements of Discrete Mathematics, McGraw Hill

  Rosen K.H., Discrete Mathematics And Its Applications, McGraw Hill  

Assignments 2x7.5 = 15

Tests 2x15 = 30

Regularity  = 05

Total marks  = 50

Q I    - 8 short type questions of 5 marks each, 2 from each module

Q II  - 2 questions of 15marks each from module I with choice to answer any one

Q IV  - 2 questions of 15marks each from module III with choice to answer any one

Q V  - 2 questions of 15marks each from module IV with choice to answer any one

3 hours lecture and 1 hour tutorial per week

Notations introduced in Object Oriented design are powerful enough to be used as a notation for expressing a software design.  The Unified Modeling Language is a combination of several earlier notations and is being promoted as a universal standard for object-oriented design.  Continuing from the course on paradigms of programming this course tries to give specialized knowledge about UML.  UML notations were introduced in Software Engineering course and hence this paper tries to provide detailed knowledge about UML and its implications.

Overview of object oriented systems - objects - attributes - encapsulation - class hierarchy - polymorphism - inheritance - messages - history of object orientation

UML - classes - attributes - and operations - class diagrams - generalizations and association constructs - composition and aggregation - collaboration diagrams - sequence diagrams - asynchronous messages and concurrent execution - state diagrams - nested states - concurrent states and synchronization - transient states - architecture and interface diagrams packages - deployment diagrams for hardware artifacts and software constructs - window-layout and window- navigation diagrams

Encapsulation structure - connascence - domains of object classes - encumbrance - class cohesion - state spaces and behaviour of classes and subclasses - class invariants - preconditions and post conditions - class versus type - principle of type conformance - principle of closed behaviour - case studies

Abuses of inheritance - danger of polymorphism - mix-in classes - rings of operations - class cohesion and support of states and behaviour - components and objects - design of a component - lightweight and heavy weight components - advantages and disadvantages of using components - case studies

1. Page Jones M., Fundamentals of Object- Oriented Design in UML, Addison Wesley

  Booch G., Rumbaugh J. & Jacobsons I., The Unified Modeling Language User Guide, Addison Wesley

  Bahrami A., Object Oriented System Development, McGraw Hill

  Larman C., Applying UML & Patterns: An Introduction to Object-Oriented Analysis & Design, Addison Wesley

  Pooley R. & Stevens P., Using UML: Software Engineering With Objects & Components, Addison Wesley  

Assignments  2x10  =  20

Tests 2x15  =  30

Total marks  =  50

Q I    - 8 short type questions of 5 marks each, 2 from each module

Q II  - 2 questions of 15marks each from module I with choice to answer any one

Q IV  - 2 questions of 15marks each from module III with choice to answer any one

Q V  - 2 questions of 15marks each from module IV with choice to answer any one

3 hours practical per week

Lab -1 : (object-oriented programming in - Java /C+ +) - Programs to bring out concepts of classes and objects - for example the abstract data type binary tree

Lab - 2 : (object oriented programming) Programs to demonstrate inheritance and class hierarchy - for example define a base class “shape” and derived classes for rectangle, square, ellipse, circle with proper class hierarchy

Lab - 9 : (concurrent programming - Java / Ada) Demonstration of concurrency support - for example program to find the least common ancestor of two given nodes in a binary tree may be implemented.

Lab - 10 : (concurrent programming) - Demonstration of synchronized concurrency - for example program for the readers and writers problem may be implemented.

  Sethi R., Programming Languages: Concepts And Constructs, Pearson Education Asia

  Appleby D. & Vandekopple J.J., Programming Languages: Paradigm And Practice, Tata McGraw Hill

  Luger & Stubblefield, Artificial Intelligence, Pearson Education Asia

  Samuel A. Rebelsky, Experiments in Java, Pearson Education Asia  

Lab practicals  & record = 25

2 tests 2x10 = 20

Total marks  = 50

    

3 hours practical per week

This course is to understand the relevance and characteristics of hardware and operating system components of a digital computer system through various laboratory experiments. It also gives the students the ability to interface devices to computer systems through various interfacing techniques.

Lab - 1 : Identification of components/cards and PC assembling from components