BE 5th sem CSE syllabus of RTM Nagpur university

Author posted by Jitendra on Posted on under category Categories RTM NU and tagged as Tags with 6 Comments on BE 5th sem CSE syllabus of RTM Nagpur university

Fifth semester Syllabus of Computer science of RTM Nagpur University

55CS1: Data Communication

UNIT 1:
SIGNALS: ANALOG AND DIGITAL: Analog and digital data, Analog and digital signals; PERIODIC AND APERIODIC SIGNALS, ANALOG SIGNALS: Simple analog signals; TIME AND FREQUENCY DOMAINS; COMPOSITE SIGNALS: Frequency spectrum and Bandwidth; DIGITAL SIGNALS: Decomposition of digital signal; TRANSMISSION MODES: Serial and Parallel transmission, Asynchronous and Synchronous Transmission, Simplex,
Half-Duplex and Full-Duplex communication.

UNIT 2:
ENCODING AND MODULATING: DIGITAL-TO-DIGITAL CONVERSION: Unipolar, Polar, Bipolar; ANALOG-TO-DIGITAL CONVERSION: Pulse Amplitude Modulation (PAM), Pulse Code Modulation (PCM), Sampling Rate, How many Bits per Sample? Bit rate;
DIGITAL-TO-ANALOG CONVERSION: Aspects of Digital-to-Analog conversion, Amplitude Shift Keying (ASK), Frequency Shift Keying (FSK), Phase shift Keying (PSK), Quadrature Amplitude modulation (QAM), Bit / Baud comparison; ANALOG-TO-ANALOG CONVERSION: amplitude modulation (AM), Frequency Modulation (FM), Phase Modulation(PM);

UNIT 3:
INTERFACES AND MODEMS: DIGITAL DATA TRANSMISSION: Parallel transmission, Serial Transmission; DTEDCE INTERFACE: Data Terminal Equipment (DTE), Data Circuit-Terminating Equipment (DEC), Standards, EIA-232 Interface; OTHER INTERFACE STANDARDS: EIA-449, EIA-530, X.21; MODEMS: Transmission rate, Modem
standards; 56K MODEMS: Traditional Modems, 56K Modems

UNIT 4:
COMMUNICATION MEDIA: GUIDED MEDIA: Twisted pair cable, Coaxial cable, Optical Fiber cable; UNGUIDED MEDIA: Radio frequency allocation, Propagation of Radio waves, Terrestrial microwave, Satellite communication, Cellular Telephony; TRANSMISSION IMPAIRMENTS: Attenuation, Distortion, Noise; PERFORMANCE: throughput, Propagation Speed, Propagation time;

UNIT 5:
MULTIPLEXING: FREQUENCY DIVISION MULTIPLEXING (FDM). TIME DIVISION MULTIPLEXING (TDM): Inverse Multiplexing, WAVE-DIVISION MULTIPLEXING, MULTIPLEXING APPLICATIONS: THE TELEPHONE SYSTEM: Common carrier services and hierarchies, Analog services, Digital Services; DIGTAL SUBCRIBER LINE (DSL): ADSL, RADSL, HSDL, SDSL, VDSL; FTTC: FTTC in the Telephone Network, FTTC in the Cable TV Network.

UNIT 6:
DATA COMPRESSION: Huffman code, Run-Length Encoding, Relative Encoding, Lempel-Ziv Encoding, Image Compression, JPEG, MPEG

Text Books:
Data Communications and Networking by Behrouz A. Forouzan, 4thEdition, Tata McGraw Hill Understanding Data Communications and Networks by William A. Shay, 2nd Edition, Vikas Publishing House.

Reference Book:
Electronic communication Systems by Kennedy.
Communication systems by Singh and Sapre.
Data communication by Fred Halsall, Pearson Education.

5CS2: Numerical Computing
Unit 1
Polynomial Equations: Newton-Raphson method, Regula Falsi Method, Muller method, Bairstow method, Multipoint iteration method, Convergence / Rate of Convergence of iterative method, Evaluation of Multiple & complex roots. Simultaneous equations.

Unit 2
Linear Systems & Matrrices: Gauss elimination with pivoting, Gauss-Seidal iteration, Triangularization / Cholesky methos, Iterative determination of Eigen values.
Unit 3
Interpolation & Approximation: Lagrange’s bivariate interpolation, Least
squares approximation, Uniform approximation, Rational Approximation, Hermite Interpolation. Differentiation /Integration: Double integrals by Trapezoidal & Simpson rule, Methods of undetermined coefficients for numerical integration, Gauss0Legendre, Gauss-Hermite formula, Romberg Integration, Approximation of derivates, Richardson’s Extrapolation.

Unit 4
Differential Equations: Initial value problems by Euler’s method, Picard’s, Taylor series, Runge-Kutta methods, Predictor-Corrector methods, Boundary value problems (Second order) by finite difference methods.

Unit 5
Related topics: Simplex method for linear programming problems, Errors & Methods of error analysis.

Text Books:
· Numerical methods for Scientific and Engg. Computations by M.K. Jain, SRK Iyengar, R. K. Jain , Wiley Eastern Ltd.
· Numerical methods for Science & Engg. By Stanton R. G., PHI
· Introductory Methods of Numerical Analysis by Sastry S. S., PHI.

55CS3: Object Oriented Methodologies

UNIT-1
The Object Oriented Paradigm What is Object Orientation? , What is Object Oriented Development? , The Object Oriented Themes; The Object modeling
Technique (OMT).Object Modeling Objects and Classes; Links and Associations; Advanced Links and Associations Concepts; Generalization and Inheritance;
Grouping Constructs; A Sample Object Model. Advanced Object Modeling Aggregation; Abstract and Concrete Classes; Generalization as Extension and Restriction; Multiple Inheritance; Metadata; Candidate Keys.

UNIT-2
Dynamic Modeling Events and States; Operations; Nested State Diagrams; Concurrency of States; Advanced Dynamic Modeling Concepts; A Sample Dynamic Model; Relation of Dynamic Model to Object Model. Functional Modeling The Functional Model; the Data Flow Diagrams (DFD); Properties of DFD; Construction of DFD; Specifying Operations; Constraints; A Sample Functional Model; Relationship between the Object, Dynamic and the Functional Models.

UNIT-3
Pre-Analysis The need for Pre-Analysis; Pre-Analysis Steps: Interviews, Questionnaire, Observation, Documentation and Notations; the Bus Stop Problem Domain Example. Analysis: The Analysis Overview; the Problem Statement; the ATM
example; Object Modeling in ATM; Dynamic Modeling in A TM; Functional Modeling in A TM; Adding Operations; Iterating Analysis; Recording Analysis.

UNIT-4
Design How does Design differ from Analysis? The Logical and Physical Design; Qualities and Objectives of Analysis and Design; Measurable Objectives in Design; Planning for Design.System Design Overview of System Design; Breaking
System into Subsystems; Identifying Concurrency; Allocating Subsystems to Processors and Tasks; Managing Data Stores; Handling Global Resources; Choosing Software Control Implementation; Handling Boundary Conditions; Setting
Trade-Off Priorities; Common Architectural Frameworks; the Architecture of A TM System.

UNIT-5
The object design paradigm: Overview of Object Design; Class Specifications; Interfaces; Criteria for Good Design; Designing Algorithms; Design Optimization; Implementation of Control; Adjustment of Inheritance; Design of Associations; Integrity Constraints; Object Representations; Physical Packaging; Documenting Design Decisions.

UNIT-6
The Human Computer Interaction What is Human Computer Interaction? , Qualities of Good User Interface; Approaches to User Interface Design; the Standards and Legal requirements. The Programming Style The Object-Oriented Style; Extensibility and Robustness; Programming-in-the-Large; Late Binding and Early Binding. Reusable Components What is meant by Reuse? , Why Reuse? ,Planning Strategy for Reuse; the Reusability approaches. Software Development Methodologies The Method and the Methodology; Why use Methodology?, the Unified Software Development Process; Participative Design Approaches; Issues in Choosing Methodology; Hard Vs Soft Methodologies.

(Practical Implementation in “C++” )

Textbooks:
· Object Oriented Modeling and Design; James Rumbaugh, Michael Blaha, Pearson Education

References:
· Object Oriented System Analysis and Design using UML; Second Edition; Simon Bennett, Steve McRobb, Ray Farmer; Tata McGraw Hill; 2004.
· Object Oriented Analysis and Design with Applications; Second Edition; Grady Booch; Pearson Education.
· Object Oriented Analysis and Design; Andrew Haigh; Tata McGraw Hill; 2001.

55CS4: Operating Systems
UNIT-I
Introduction: Evolution of OS, Types of OS, Basic h/w support necessary for modern operating systems, services provided by OS, system programs and system calls, system design and implementation.

UNIT-II
File systems: File concept, Access methods, Disk space management and space allocation strategies, directory structures, Recovery, Log-structured File System, disk arm scheduling strategies.

UNIT-III
Scheduling: Process concept, process control block, Types of scheduler, context switch, threads, multithreading model, goals of scheduling and different scheduling algorithms, examples from WINDOWS 2000 & LINUX.

UNIT-IV
Memory management: Contiguous allocation, Relocation, Paging, Segmentation, Segmentation with paging, demand paging , page faults and instruction restart , page replacement algorithms , working sets , Locality, Thrashing,Garbage
Collection .

UNIT-V
Process cooperation and synchronization: Concurrency conditions, Critical section problem, software and hardware solution, semaphores, conditional critical regions and monitors, classical inter process communication problems.

UNIT-VI
Deadlocks & Protection: Deadlock definition, Prevention, Avoidance, Detection and recovery, Goals of Protection, access matrix, implementation, Security problem.

BOOKS:

· Operating System concepts – Silberchatz & Galvin, Addison Wesley, 6th Edn.
· Modern Operating Systems – Tanenbaum, Pearson Edn. 2nd edn.

Reference Books:
· Operating System –Milan Milenkovik
· Operating Systems, 3rd Edition by Gary Nutt, Pearson Education

55CS5: Concept In Programming Language
UNIT I
Definition of Programming language, Implementation of high-level languages,Data elements, binding time, binding identifiers to names, binding of attributes,Binding time. Concept of r-value and l-value and their implementation. Effect of Environment on a language, Language paradigms. Language translation issues.

UNIT II
Data type, Type checking and type conversion, elements of specification and implementation of data type. Implementation of elementary data types: integer, real, character, Boolean Pointer, enumerated type Implementation of structured data types. Vectors & arrays, Sets, Files.

UNIT III
Abstract data type, encapsulation. Implementation of new data types, Subprogram definition and activation, their Implementation, parameter passing methods, generic subprograms, Scope rules

UNIT IV
Type equivalence, type definitions with parameters, Implementation of Inheritance. Storage management issues like static and dynamic allocation , stack based allocation and management, Heap based allocation and management.

UNIT V
Sequence control, Implicit and explicit sequence control, Sequencing with arithmetic expression, Sequence control between statements, prime programs, implementation of case statement,

UNIT VI
Subprogram sequence control, recursive and non recursive subprogram . Data control, referring environment, dynamic and static scope, static chain implementation and display implementation.

BOOKS:
· Programming Languages, 1st edition by T.W. Pratt and M .V. Zelkowitz & T. V. Gopal by Pearson Education, 2006
· Programming Languages, Ravi Sethi, Addison Wesley.

55CS6: System Programming
UNIT 1:
IBM 360/370 & Assembler– Introduction to System Programming & its components, M/c Architecture , Data Formats & Register Formats , Concept of assembler, design of single pass and two pass assembler.

UNIT 2:
Microprocessor- Concept of macro, macro call within macro, macro definition within macro, recursive macro calls, design of macro processor.

UNIT 3 :
Linker and Loader- Concept of static and dynamic relocation, external symbols, design of linker, design of object file for different loading schemes.

UNIT 4:
Common Object file format & System Utilities- Structure of object file and executable file, section or segment headers, symbol table, concept of storage class, string various, data types line insert, character, arrays structures. Source code control system, make, link editor, symbolic debugger.

UNIT 5:
Unix Device Drivers- Definition , Anatomy and Types , Device programming, Installation , Incorporation of driver routines, Basic device driver operation, Implementation with Line Printer & Disk ,Comparative study between device
drivers for UNIX & Windows.

UNIT 6:
Compiler- Phases of Compilers ,Overview of Databases and Algorithms required for all phases. Role of lexical analyzer, recognition of tokens, Study of LEX & YACC.

Books:
· System Programming- J. J. Donovan.
· System Programming and Operating systems- D. M. Dhamdhere
· Unix system Utilities manual.
· Unix programming Environment- Keringham and Pike, Pearson Education
· Unix Device Drivers- George Pajari , Pearson Education.

BE 4th sem CSE syllabus of RTM Nagpur university

Author posted by Jitendra on Posted on under category Categories RTM NU and tagged as Tags with 5 Comments on BE 4th sem CSE syllabus of RTM Nagpur university

fourth semester syllabus of Computer science of Nagpur University

44CS1: Discrete Mathematics and Graph theory

Unit 1 :
Set Theory Operation of Sets – relation and functions, partial order, equivalence relation peano axioms and inductions.

Unit 2 :
Mathematical Logic Propositions, predicate logic, formal mathematical system, algebra, Homomorphism, Automorphism.

Unit 3 :
Groups Element of theory of some Algebras, semi group, monoid groups.

Unit 4 :
Rings Rings, fields, lattices, Boolean Algebra.

Unit 5 :
Graph Theory Graphs, Hyper Graph, Transitive Closure, Spanning Trees.

Unit 6 :
Combinatorics Generating Functions, recurrences, counting theorem and applications

Text Books:
· Discrete Mathematical Structures for computer science, Kolman / Rahman Pearson education.
· Combinatorial Mathematics, C.L.Liu (McGraw Hill)
· (Common to CS/CT/CE/IT)44CS2: Data Structures And Program Design In ‘C’
·

44CS2: Data Structures & Program Design

UNIT I
General concepts and linear data structures: Abstract data structure as an organization of data with specified properties and operations, Time and space analysis of algorithms, Big oh and theta notations and omega notations, Average, best and worst case analysis, Representation of Arrays -Single and Multi dimensional-Address calculation using column and row major ordering, Representation of Stacks and queues using arrays – Circular queues, Priority Queues, Dequeue, Application of stacks, Conversion from infix to post fix and pre-fix expressions, Evaluation of postfix expression using stacks, Multiple stacks

UNIT II
Linked list: Linked Lists, Simply linked list, Implementation of linked list using static and dynamic memory allocationdynamic memory allocation, operations on list linked stacks and queues, polynomial representations and manipulations are using linked list, circular linked list, doubly linked list, Generalized list.

UNIT III
Trees: General and binary trees, Representations and traversals, General trees as binary trees, Binary search trees, Applications, The concept of balancing and its advantages, B-Trees, B+ Trees, AVL Trees, Threaded Binary Trees.

UNIT IV
Hashing: Hash functions, Collision resolution, Expected behavior, Applications

UNIT V
Graphs and digraphs: Representations, Breadth and depth first searches, Connectivity algorithms, shortest path, Minimal spanning tree, The union find problem, Hamiltonian path

UNIT VI
Sorting: Elementary sorts: selection, insertion, bubble sort, shell sort, Radix sort, Quick sort, merge sort, heapsort, Bucket sorting, External sorting, Worst case and average behavior, Lower bound for sorting using comparisons

Textbooks:
· Data Structures using C and C++ by Y. Langsam, Pearson Education
· Data Structures using C by Tenenbaum, Pearson Education
· Data Structures using C by S. K. Bandyopadhyay, Pearson Education
· S. Sahani, Data Structures in C,
· D.Samantha, Classic Data Structure, PHI Publications
· Data structures -Robert Kruse

44CS3: Business Data Processing
UNIT-I:
Structural Organization of COBOL: Character set, Words, Sentences, dentification Division, Environment Division, Data Division, Data types – numerical, lphabetic & alphanumeric, Input-output sections, Working storage sections, PROCEDURE division features: ACCEPT, DISPLAY, MOVE, Arithmetic & COMPUTE verbs, levels ,Error Handling, Sample programs, PERFORM & GOTO verbs, Sample programs using PERFORM, Miscellaneous COBOL statements.

UNIT-II:
Conditional Statements & Handling: Relation conditions, Nested conditions, Class conditions, Condition-name conditions, Justified clause, Structured programming forms of program structure, Structural flow charts, Subscripting, OCCURS clause, Multidimensional tables, Table handling with PERFORM verb.

UNIT-III:
Business Files: Structured Flow charts, Operation on files, Master files, Transaction file, Report file, Batch processing, On-line processing, case studies. Sequential Access Files: Principles of magnetic storage & accessing, Blocking, Inter record gap, Label records, COBOL language instructions for sequential files.

UNIT-IV:
Direct Access Files: Characteristics of disk storage & timing index, Indexed sequential files, COBOL instruction for indexed sequential files, relative file organization, Division-Remainder method, digital-analysis method, COBOL
instructions for handling relative files.

UNIT-V:
Sorting, Searching & merging: Linear search sort, Merge sort, Chained record sort, Linear search, Binary search, File sorting & Merging using sequential files. Report Generation: Output layout design, Heading, Date & Detailed summaries. Control breaks, Language specifications for COBOL report writing.

UNIT VI :
Advanced Tool manipulators like STRING, UNSTRING, INSPECT & COPY verbs, COBOL Subprogram and main Program.

For Practical: 10-12 experiments on COBOL based on above syllabus.

TEXT BOOKS:
· COBOL Programming with business application – N.L.Sarda
· Information Systems through COBOL – Philippakis & Kazmier
· Structured COBOL Programming – Stern & Stern
· COBOL Programming by M. K. Roy, D. Ghosh Dastidar.

44CS4: Theoretical Foundations of Computer Science

UNIT I
Mathematical preliminaries – Sets, operations, relations, strings, transitive closure, countability and diagonalisation, induction and proof methods- pigeon-hole principle and simple applications – concept of language – grammars and
production rules –Chomsky hierarchy.

UNIT II
Finite State machine, regular languages, deterministic finite automata, ,conversion to deterministic automata, E-closures –regular expressions, finite automata, minimization of automata , Moore and Mealy machine and their equivalence.

UNIT III
Pumping lemma for regular sets- closure properties of regular sets- decision properties for regular sets, equivalence between regular language and regular grammar. Context – free languages – parse trees and ambiguity , reduction of
CFGS ,Chomsky and Griebach normal forms

UNIT IV
Push – down Automata (PDA) – non Determinism – acceptance by two methods and their equivalence ,conversion of PDA to CFG CFLs and PDAs- closure and decision properties of CFLs

UNIT V
Turing machines – variants – recursively enumerable (r.e.) set – recursive sets
TM as computer of function – decidability and solvability – Halting Problem – reductions – Post correspondence Problem (PCP) and unsolvability of ambiguity problem of CFGs, Church’s hypothesis.

UNIT VI
Introduction to recursive function theory – primitive recursive and partial recursive functions , Parsing: top down and bottom up approach, derivation and reduction

Text Books
· Introduction to formal languages and automata – Peter Linz Norasa,2000.
· Theory Of Computer Science –Mishra and Chandrashekharan, PHI

Reference Books
· Introduction Of Automata Theory, Languages and computation- J.E. Hopcroft , J.D.Ulman, Pearson education.

44CS5: Computer Architecture & Organization


UNIT I

BASIC STRUCTURE OF COMPUTERS: Functional units, Basic operational concepts, Bus structures Addressing modes, subroutines: parameter passing, Instruction formats, expanding opcodes method. BASIC PROCESSING UNIT: bus architecture, Execution of a Complete Instruction, sequencing of control signals, Hardwired control, Microprogrammed Control, microinstruction format, Bit slice concept.

UNIT II
ARITHMETIC: Number representations and their operations, Design of Fast Adders, Signed multiplication, Booth’s Algorithm, bit-pair recoding, Integer Division, Floating point numbers and operations, guard bits and rounding.

UNIT III
THE MEMORY SYSTEM: various technologies used in memory design, higher order memory design, multimodule memories and interleaving, Associative Memory, Cache memory, Virtual Memory

UNIT IV
INPUT/OUTPUT ORGANIZATION: I/O mapped I/O and memory mapped I/O, interrupts and interrupt handling mechanisms, vectored interrupts, synchronous vs. asynchronous data transfer, Direct Memory Access COMPUTER PERIPHERALS: I/O devices such as magnetic disk, magnetic tape, CDROM systems.

UNIT V
RISC philosophy, pipelining, basic concepts in pipelining, delayed branch, branch prediction, data dependency, influence of pipelining on instruction set design, multiple execution units, performance considerations,

UNIT VI
Basic concepts in parallel processing & classification of parallel architectures. Vector Processing, Array Processors.

BOOKS:·
V.C.Hamacher,Z.G.Vranesic and S.G.Zaky, Computer Organisation, McGraw Hill,5thed,2002.
· Computer Architecture & Organization III Ed- J.P.Hayes.
· A.S.Tanenbaum, “Structured Computer Organization” 4th Edition, Pearson Education

REFERENCES BOOKS:
· M Mano, “Computer System and Architecture”, Pearson Education
· W. Stallings, “Computer Organization & Architecture”,Pearson Education

44CS6: Internet Technologies

Practical to be conducted based on following topics:
1) HTML: Standard use for www documents on internet, GML, SGML, HTML tags, special characters, Fonts, Lists,
Images, Tables, Forms and Frames.
2) DHTML: Introduction to CSS, Fonts in CSS, Text in CSS, Boxes in CSS, CSS positioning, Tables in CSS, Generated
content and lists in CSS.
3) XML: XML basics, understanding markup languages, structures and syntax, valid Vr well formed XML, DTD
(document type Definition) classes. Scripting XML, XML processor, parent child relationship, XML as a data, data type in
XML, XML namespaces, linking with XML simple link, the HTML way, XSL with style: style sheet basics, XSL basics,
XSL style sheets.
4) FRONTPAGE:
5) SECURITY:
6) Scripting Language: Perl Scripts, Java Scripts:
7) PHP

TEXT BOOKS
· XML in action web technology by William J. Pardi (PHI) Pub.
· Web Technology by Ramesh Bangia (Firewall Media)
· Programming the web using XML by Ellen Pearlman (Tata McGraw – Hill)

BE 3rd sem CSE syllabus of RTM Nagpur University

Author posted by Jitendra on Posted on under category Categories RTM NU and tagged as Tags with 27 Comments on BE 3rd sem CSE syllabus of RTM Nagpur University

Third semester Syllabus of computer science of RTM Nagpur University

33CS1: Applied Mathematics

Unit 1:
Integral Transforms Fourier integral theorem, Fourier and Laplace transforms and their simple properties. Simple applications of Laplace transforms to-solve ordinary differential equations including simultaneous equation Application to one dimensional partial differential equations. The z-transform definition and properties, inversion, relation with Laplace transform, Application of
z-transform to solve difference equations with constant coefficients.

Unit 2:
Complex variables Analytic function, Cauchy-Riemann conditions, conjugate, functions, singularities, Cauchy’s integral theorem and integral formula (Statement only) Taylor’s and Laurent’s theorem(statement only) Residue
theorem, contour integration.

Unit 3:
Calculus of Variations Maxima and Minima of functional, variation and its properties Euler’s-equation, functional dependent on first and second
order derivatives, simple applications.

Unit 4:
Fourier Series Periodic function and their Fourier expansion. Even and odd function, change of interval half range expansion. Partial Differential Equation: Partial-Differential Equation of first order first degree, i.e Langrange’s form, Linear Homogeneous P.D.E. of Nth order with constant coeffient method of separation of variables.

Unit 5:
Matrices Inverse of matrix by partitioning method, Inverse of a matrix by adjoint method and its use solving – simultaneous equation, Rank of matrix, Consistency of a system of equation, Linear dependence, linear and orthogonal transformations.

Unit 6:
Matrices Characteristic equation, Eigenvalues, Eigenvectors, Reduction of a diagonal form, Statement and verification of Cayley-Hamilton theorem; Sylvester’s theorem, Association of matrices with linear differential equation of second order with a constant coefficient, Determination of largest eigenvalue by iteration method.

Text Books:
· Advanced Engineering Mathematics, kreyzig
· Higher Engineering Mathematics, B.S. Grewal

Reference Books:
· Mathematics of Engineers, Chandrika Prasad
· Advance Mathematics for Engineers, Chandrika Prasad
· Applied Mathematics for Engineers, L.A. Pipes & Harville
· A Text Book of Applied Mathematics, P.N. Wartikar & J. N. Wartikar

33CS2: Programming Fundamentals In “C”

UNIT-I
Introduction to programming, programming languages, algorithms, flowcharts. C: Data types, Identifiers, Storage class, Constant, Operators, expression, Statements, console I/O statements, Selection statements: if-else, switch, Iteration Statements: for, while, do-while, Jump statements: return, go to, break, continue, comments.

UNIT-II
Function, Call by value, Call by reference, calling functions with arrays, arguments to main(), return statements, recursion, function prototypes, inline keyword, preprocessor directives. Pointers: pointer variables, pointer operator, pointer expression, array of pointers, multiple indirection, pointers to functions, dynamic allocation functions.

UNIT-III
Arrays : single dimensional arrays, two dimensional arrays, multidimensional arrays, variable length arrays. Strings, array
of strings.
UNIT-IV
Structures : array of structures, passing structure to function, structure pointers, structure within structures. Unions, bitfields, enumerations, size of, type def.

UNIT-V
File I/O : Streams and files, file system basics, fread, fwrite, fseek, random access I/O, fprintf(), fscanf(), standard streams.

UNIT – VI
Advanced Concepts in C: Different types of pointers, ROM-BIOS functions, Elementary TSRs.

Text Books:
· The Complete Reference C ( 4th Edition) : Herbert Schildt [ TMH]
· C How to Program, 4th Edition by H. M. Deitel & P. J. Deitel, Pearson Education.
· Writing TSRs through C : Yashwant Kanetkar ( BPB)

Reference Books :
· The C Programming Language : Dennis Ritchie & Brain Kernighan [Pearson]
· Programming with C : K.R.Venugopal & S.R.Prasad [TMH]
· Let Us C : Yashwant Kanetkar [BPB]

33CS3: Digital Circuits & Fundamental of Microprocessor:

UNIT-I:
Motivation for digital systems – Logic and Boolean algebra, Number System: Binary ,Hexadecimal ,Octal ,Gray. Gates & truth tables, propositions, Demorgan’s law minimization of combinational circuits using Karnaugh maps.

UNIT-II:
Multiplexers, Demultiplexer , Encoders ,Decoders ,Code Converters, Adders , Subtractor (Half ,Full),BCD Adder/Subtractor , ripple and carry look-ahead addition.

UNIT-III:
Storage elements, Flip-flops and latches: D, T, J/K, S/R flip-flops. Master Slave Conversion of one of type of F/F to another.

UNIT-IV:
Counters, asynchronous and synchronous-design using state and excitation tables.

UNIT-V:
Introduction to mp 8085, Addressing modes, Instruction Set of mp 8085

UNIT-VI:
Interrupts of 8085, Programming of mp 8085.

Text books :
· Digital Design 3rd Edition by M. Morris Mano, Pearson Education
· Digital logic and Computer Design by M. Morris Mano, Pearson Education
· Digital Cicuit & Design –R.P.Jain
· Digital circuit & design- A.P.Godse
· Fundamental Of Digital Electronics- A.Anand Kumar
· 8 bit microprocessor & controller –V.J.Vibhute
· 8 bit Microprocessor – Gaonkar.

33CS4: Combinatorial Theories

UNIT 1:
Combinatorics: Basic counting techniques, pigeon-hole principle, recurrence relations, generating functions. Examples using ordinary power series and exponential generating functions, general properties of such functions.
Dirichlet Series as generating functions. A general family of problems described in terms of “cards, decks and handa” with solution methods using generating
functions.

UNIT II:
Generating function proofs of the sieve formula and of various combinatorial identities. Certifying combinatorial identities. Some analytical methods and asymptotic results. Polya’s counting theorem. Basics of graph theory. Introduction to probabilistic method in combinatorics.

UNIT III:
Number Theory Examples of continued fractions. The study of the continued fractions. Alpha has infinite continued fraction if alpha is irrational.
Formal logic: Propositional logic: proof system, semantics, completeness, compactness. Length of proofs, polynomial size proofs, efficiency of proof systems.

UNIT IV:
Alpha has periodic continued fraction if alpha is quadratic irrational.
Application to approximation of irrationals by rationals. Hurwitz’s Theorem.
First order logic: models, proof system, compactness, Examples of formal proofs in say, number theory or group theory. Some advanced topics.

UNIT V:
Application to solutions of Pell’s equation. Proof that means cos{(p x pi)/q},for natural numbers p and q,are irrational(apart from obvious exceptions). Example : CS application of logic, introduction to modal and temporal logics, Or formal number theory including incompleteness theorem.

UNIT VI:
Liouville’s Theoram on algebraic numbers.Construction of transcendental numbers.
Elements of proof theory including cut elimination, Or zero-one law for first order logic.

Text Book:
· Niven, Zuckerman and Montgomery, An Introduction to the Theory of Numbers, (5th edition),1991,Wiley.

33CS1: Applied Mathematics

Unit 1:
Integral Transforms Fourier integral theorem, Fourier and Laplace transforms and their simple properties. Simple applications of Laplace transforms to-solve ordinary differential equations including simultaneous equation Application to one dimensional partial differential equations. The z-transform definition and properties, inversion, relation with Laplace transform, Application of
z-transform to solve difference equations with constant coefficients.

Unit 2:
Complex variables Analytic function, Cauchy-Riemann conditions, conjugate, functions, singularities, Cauchy’s integral theorem and integral formula (Statement only) Taylor’s and Laurent’s theorem(statement only) Residue
theorem, contour integration.

Unit 3:
Calculus of Variations Maxima and Minima of functional, variation and its properties Euler’s-equation, functional dependent on first and second
order derivatives, simple applications.

Unit 4:
Fourier Series Periodic function and their Fourier expansion. Even and odd function, change of interval half range expansion. Partial Differential Equation: Partial-Differential Equation of first order first degree, i.e Langrange’s form, Linear Homogeneous P.D.E. of Nth order with constant coeffient method of separation of variables.

Unit 5:
Matrices Inverse of matrix by partitioning method, Inverse of a matrix by adjoint method and its use solving – simultaneous equation, Rank of matrix, Consistency of a system of equation, Linear dependence, linear and orthogonal transformations.

Unit 6:
Matrices Characteristic equation, Eigenvalues, Eigenvectors, Reduction of a diagonal form, Statement and verification of Cayley-Hamilton theorem; Sylvester’s theorem, Association of matrices with linear differential equation of second order with a constant coefficient, Determination of largest eigenvalue by iteration method.

Text Books:
· Advanced Engineering Mathematics, kreyzig
· Higher Engineering Mathematics, B.S. Grewal

Reference Books:
· Mathematics of Engineers, Chandrika Prasad
· Advance Mathematics for Engineers, Chandrika Prasad
· Applied Mathematics for Engineers, L.A. Pipes & Harville
· A Text Book of Applied Mathematics, P.N. Wartikar & J. N. Wartikar

33CS2: Programming Fundamentals In “C”

UNIT-I
Introduction to programming, programming languages, algorithms, flowcharts. C: Data types, Identifiers, Storage class, Constant, Operators, expression, Statements, console I/O statements, Selection statements: if-else, switch, Iteration Statements: for, while, do-while, Jump statements: return, go to, break, continue, comments.

UNIT-II
Function, Call by value, Call by reference, calling functions with arrays, arguments to main(), return statements, recursion, function prototypes, inline keyword, preprocessor directives. Pointers: pointer variables, pointer operator, pointer expression, array of pointers, multiple indirection, pointers to functions, dynamic allocation functions.

UNIT-III
Arrays : single dimensional arrays, two dimensional arrays, multidimensional arrays, variable length arrays. Strings, array
of strings.
UNIT-IV
Structures : array of structures, passing structure to function, structure pointers, structure within structures. Unions, bitfields, enumerations, size of, type def.

UNIT-V
File I/O : Streams and files, file system basics, fread, fwrite, fseek, random access I/O, fprintf(), fscanf(), standard streams.

UNIT – VI
Advanced Concepts in C: Different types of pointers, ROM-BIOS functions, Elementary TSRs.

Text Books:
· The Complete Reference C ( 4th Edition) : Herbert Schildt [ TMH]
· C How to Program, 4th Edition by H. M. Deitel & P. J. Deitel, Pearson Education.
· Writing TSRs through C : Yashwant Kanetkar ( BPB)

Reference Books :
· The C Programming Language : Dennis Ritchie & Brain Kernighan [Pearson]
· Programming with C : K.R.Venugopal & S.R.Prasad [TMH]
· Let Us C : Yashwant Kanetkar [BPB]

33CS3: Digital Circuits & Fundamental of Microprocessor:

UNIT-I:
Motivation for digital systems – Logic and Boolean algebra, Number System: Binary ,Hexadecimal ,Octal ,Gray. Gates & truth tables, propositions, Demorgan’s law minimization of combinational circuits using Karnaugh maps.

UNIT-II:
Multiplexers, Demultiplexer , Encoders ,Decoders ,Code Converters, Adders , Subtractor (Half ,Full),BCD Adder/Subtractor , ripple and carry look-ahead addition.

UNIT-III:
Storage elements, Flip-flops and latches: D, T, J/K, S/R flip-flops. Master Slave Conversion of one of type of F/F to another.

UNIT-IV:
Counters, asynchronous and synchronous-design using state and excitation tables.

UNIT-V:
Introduction to mp 8085, Addressing modes, Instruction Set of mp 8085

UNIT-VI:
Interrupts of 8085, Programming of mp 8085.

Text books :
· Digital Design 3rd Edition by M. Morris Mano, Pearson Education
· Digital logic and Computer Design by M. Morris Mano, Pearson Education
· Digital Cicuit & Design –R.P.Jain
· Digital circuit & design- A.P.Godse
· Fundamental Of Digital Electronics- A.Anand Kumar
· 8 bit microprocessor & controller –V.J.Vibhute
· 8 bit Microprocessor – Gaonkar.

33CS4: Combinatorial Theories

UNIT 1:
Combinatorics: Basic counting techniques, pigeon-hole principle, recurrence relations, generating functions. Examples using ordinary power series and exponential generating functions, general properties of such functions.
Dirichlet Series as generating functions. A general family of problems described in terms of “cards, decks and handa” with solution methods using generating
functions.

UNIT II:
Generating function proofs of the sieve formula and of various combinatorial identities. Certifying combinatorial identities. Some analytical methods and asymptotic results. Polya’s counting theorem. Basics of graph theory. Introduction to probabilistic method in combinatorics.

UNIT III:
Number Theory Examples of continued fractions. The study of the continued fractions. Alpha has infinite continued fraction if alpha is irrational.
Formal logic: Propositional logic: proof system, semantics, completeness, compactness. Length of proofs, polynomial size proofs, efficiency of proof systems.

UNIT IV:
Alpha has periodic continued fraction if alpha is quadratic irrational.
Application to approximation of irrationals by rationals. Hurwitz’s Theorem.
First order logic: models, proof system, compactness, Examples of formal proofs in say, number theory or group theory. Some advanced topics.

UNIT V:
Application to solutions of Pell’s equation. Proof that means cos{(p x pi)/q},for natural numbers p and q,are irrational(apart from obvious exceptions). Example : CS application of logic, introduction to modal and temporal logics, Or formal number theory including incompleteness theorem.

UNIT VI:
Liouville’s Theoram on algebraic numbers.Construction of transcendental numbers.
Elements of proof theory including cut elimination, Or zero-one law for first order logic.

Text Book:
· Niven, Zuckerman and Montgomery, An Introduction to the Theory of Numbers, (5th edition),1991,Wiley.

33CS5: Principles Of Management

UNIT I
Nature and Functions of Management, Management yesterday and today, Planning and Decision making.

UNIT II
Management Information System: Introduction, Conceptual Foundations, Information System Requirement.

UNIT III:
Marketing Management: Marketing concept, Indian Marketing Environment, Market segmentation, Market Planning, International Marketting.

UNIT IV
Financial Management

UNIT V
Human Resource Management: Human Resource Planning, Recruitment, Selection, Training and development, Security, Safety and Health

UNIT VI
Organization Behavior: Organization Structure and design. Designing Effective Organization, Managing Job Stress, Organization Development

Textbooks :
· Principles of management , P C Tripathi and P N Reddy
· Management Information System,Gordan Davis and H. Olison McGraw Hill Pub.
· Human Resources and Personal Management, William Werther and Keith Davis
· Marketing Management, V S Ramaswamy and S Namakumari
· Organization Behavior, High Arnold and Daniel Feldman McGraw Hill
· Financial Management, Khanna

33CS6: Computer Workshop

Practical to be based on following topics:
· Study of PC Hardware:
· Basic computer Organization
· PC construction
· Study of BIOS and CMOS
· Working under DOS and WINDOWS operating systems:
· Internal and External DOS commands.
· Basics required for working under Windows operating System
· Study of control panel.

. Working under UNIX /LINUX Operating Systems:
· Structure: Unix Architecture
· Features of UNIX operating system
· Layered model of UNIX operating system (study of kernel and Shell)
· General file commands and Directory commands
· File structure and Directory structure

Introduction to Networking Accessories:
· Study of user connections.
· Study of communication channels.
· Study of network architecture (topologies)
· Study of Network Types.

Books to Refer:
· Computer Fundamentals – Pradeep K.Sinha
· Introduction to Computer Science by ITL ESL, Pearson Education.
· Introdution to UNIX and shell programming by M.G. Venkateshmurthy, Pearson Education
· Unix Shell programming –Yeshwant Kanetkar