Credit Based Grading System
Air Pollution: Air pollutants, classification, (Primary & secondary Pollutants) Adverse effects of pollutants. Causes of Air pollution chemical, photochemical, Green house effect, ozone layer depletion, acid Rain.
Sound Pollution: Causes, controlling measures, measurement of sound pollution (deciblage), Industrial and non – industrial.
Harris, CE, Prichard MS, Rabin’s MJ, “Engineering Ethics”; Cengage Pub.
Rana SVS ; “Essentials of Ecology and Environment”; PHI Pub.
Raynold, GW “Ethics in information Technology”; Cengage.
Svakumar; Energy Environment & Ethics in society; TMH
AK De “Environmental Chemistry”; New Age Int. Publ.
6 BK Sharma, “Environmental Chemistry” ; Goel Publ. House.
Bala Krishnamoorthy; “Environmental management”; PHI
Gerard Kiely, “Environmental Engineering” ; TMH
Miller GT JR; living in the Environment Thomson/cengage
Cunninghan WP and MA; principles of Environment Sc; TMH
Pandey, S.N. & Mishra, S.P. Environment & Ecology, 2011, Ane Books , Pvt. Ltd, New Delhi
Joseph, B. Environmental Studies, 2009 Tata Mcgraw Hill, Edu India Ltd. New Delhi.
Gour R.R, Sangal, R &Bagaria, G.P. , Excel Books, A-45, Naraina Phase-I New Delhi.-110028
Credit Based Grading System
Structure of Desktop Computers, CPU: General Register Organization- Memory Register, Instruction Register, Control Word, Stack Organization, Instruction Format, ALU, I/O System,bus,CPU and Memory Program Counter, Bus Structure, Register Transfer Language- Bus and Memory Transfer, addressing modes.
Basic Concept of Instruction, Instruction Types, Micro Instruction Formats, Fetch and Execution cycle, Hardwired control unit, Micro-programmed Control unit- microprogram sequencer Control Memory, Sequencing and Execution of Micro Instruction.
Addition and Subtraction, Tools Compliment Representation, Signed Addition and Subtraction, Multiplication and division, Booths Algorithm, Division Operation, Floating Point Arithmetic Operation.design of Arithmetic unit
I/O Interface – PCI Bus, SCSI Bus, USB, Data Transfer: Serial, Parallel, Synchronous, Asynchronous Modes of Data Transfer, Direct Memory Access(DMA), I/O Processor.
Main memory- RAM, ROM, Secondary Memory – Magnetic Tape,Disk, Optical Storage, Cache Memory: Cache Structure and Design, Mapping Scheme, Replacement Algorithm, Improving Cache Performance, Virtual Memory,memory management hardware
Characteristics of Multiprocessor, Structure of Multiprocessor- Inter-processor Arbitration, Inter- Processor Communication and Synchronization. Memory in Multiprocessor System, Concept of Pipelining, Vector Processing, Array Processing, RISC And CISC,Study of Multicore Processor – Intel, AMD.
Morris Mano , “Computer System Organization ” PHI
Alan Clements: “Computer Organization and Architecture”, Cengage Learning
Subrata Ghosal: “Computer Architecture and Organization”, Pearson
William stalling ,“Computer Architecture and Organization” PHI
M. Usha, T.S. Shrikant: “Computer System Architecture and Organization”, Willey India
Chaudhuri, P.Pal: “Computer Organization and Design”, PHI
Sarangi: “Computer Organization and Architecture”,Mc- Graw Hills
1) Study of Multiplexer and Demultiplexer
Study of Half Adder and Subtractor
Study of Full Adder and Subtractor
WAP to add two 8 bit numbers and store the result at memory location 2000
WAP to multiply two 8 bit numbers stored at memory location 2000 and 2001 and stores the result at memory location 2000 and 2001.
WAP to add two 16-bit numbers. Store the result at memory address starting from 2000.
WAP which tests if any bit is '0' in a data byte specified at an address 2000. If it is so, 00 would be stored at address 2001 and if not so then FF should be stored at the same address.
Assume that 3 bytes of data are stored at consecutive memory addresses of the data memory starting at 2000. Write a program which loads register C with (2000), i.e. with data contained at memory address 2000, D with (2001), E with (2002) and A with (2001).
Sixteen bytes of data are specified at consecutive data-memory locations starting at 2000. Write a program which increments the value of all sixteen bytes by 01.
WAP to add t 10 bytes stored at memory location starting from 3000. Store the result at memory location 300A.
Credit Based Grading System
Modulation equation and their relative phase and frequency deviations, modulation index frequency spectrum, NBFM and WBFM, Bandwidth comparison of modulation techniques.
Sampling of signal, sampling theorem for low pass and Band pass signal, PAM, TDM. Channel Bandwidth for PAM-TDM signal, Type of sampling instantaneous (Natural and Flat Top), Aperture effect, PPM, PDM.
Digital signal Quantization, Quantization error, PCM, S/N Ratio, Companding, Data Rate, Baud Rate, Bit Rate, Multiplexed PCM signal, DPCM), DM, ADM).
Digital modulations techniques, ASK, BPSK, DPSK, offset and non-offset QPSK, M-Ary PSK, BFSK, M-Ary FSK, QAM).
Singh & Sapre, Communication System, TMH
B.P. Lathi & Zhi Ding, Modern Digital and Analog Communication System, 4rth Edition, Oxford University Press.
Taub & Shilling, Communication System, TMH
George Kennedy & Davis, Electronic Communication System, 4rth Edition, TMH.
Abhay Gandhi, Analog & Digital Communication: Theory & Lab Work, Cengage Learning, India.
Study of sampling process and signal reconstruction and aliasing.
Study of PAM PPM and PDM
Study of PCM transmitter and receiver.
Time division multiplexing (TDM) and De multiplexing
Study of ASK PSK and FSK transmitter and receiver.
Study of AM modulation and Demodulation techniques (Transmitter and Receiver) Calculate of parameters
Study of FM modulation and demodulation (Transmitter and Receiver) & Calculation of parameters
To construct and verify pre emphasis and de-emphasis and plot the wave forms.
Study of super hetrodyne receiver and characteristics of ratio radio receiver.
To construct frequency multiplier circuit and to observe the waveform
Study of AVC and AFC.
Credit Based Grading System
Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort. Introduction to divide and conquer technique, analysis, design and comparison of various
algorithms based on this technique, example binary search, merge sort, quick sort, strassen’s matrix multiplication.
Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman
coding, minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path algorithm
Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage graph, reliability design, Floyd-Warshall algorithm
Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph coloring problem etc. Introduction to branch & bound method, examples of branch and bound
method like traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem, introduction to parallel algorithms.
Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.
Coremen Thomas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.
Horowitz & Sahani; Analysis & Design of Algorithm
Dasgupta; algorithms; TMH
Ullmann; Analysis & Design of Algorithm;
Michael T Goodrich, Robarto Tamassia, Algorithm Design, Wiely India
Write a program for Iterative and Recursive Binary Search.
Write a program for Merge Sort.
Write a program for Quick Sort.
Write a program for Strassen’s Matrix Multiplication.
Write a program for optimal merge patterns.
Write a program for Huffman coding.
Write a program for minimum spanning trees using Kruskal’s algorithm.
Write a program for minimum spanning trees using Prim’s algorithm.
Write a program for single sources shortest path algorithm.
Write a program for Floye-Warshal algorithm.
Write a program for traveling salesman problem.
Write a program for Hamiltonian cycle problem.
Credit Based Grading System
of Computation. In this syllabus we cover finite automata, pushdown automata, Context free grammars and Turing machines.
Automata: Basic machine, FSM , Transition graph, Transition matrix, Deterministic and nondeterministic FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines, minimization of finite automata, Two-way finite automata. Regular Sets and Regular Grammars:
Alphabet, words, Operations, Regular sets, Finite automata and regular expression, Myhill- Nerode theorem Pumping lemma and regular sets, Application of pumping lemma, closure properties of regular sets.
Context –Free Grammars: Introduction to CFG, Regular Grammars, Derivation trees and Ambiguity, Simplification of Context free grammars, Normal Forms (Chomsky Normal Form and Greibach Normal forms).
Pushdown Automata: Definition of PDA, Deterministic Pushdown Automata, PDA corresponding to given CFG, CFG corresponding to a given PDA. Context Free Languages:
The pumping lemma for CFL’s, Closure properties of CFL’s, Decision problems involving CFL’s.
Turing Machines: Introduction, TM model, representation and languages acceptability of TM Design of TM,Universal TM & Other modification, Church’s hypothesis, composite & iterated TM. Turing machine as enumerators.Properties of recursive & recursively enumerable languages,Universal Turing machine
Tractable and Untractable Problems: P, NP, NP complete and NP hard problems, examples of these problems like satisfy ability problems, vertex cover problem, Hamiltonian path problem, traveling sales man problem, Partition problem etc.
John E. Hopcroft, Jeffery Ullman,”Introduction to Automata theory, Langauges & computation” , Narosa Publishers.
K.L.P Mishra & N.Chandrasekaran,“Theory of Computer Science”, PHI Learning
Daniel I.A. Cohen,“Introduction to Computer Theory”,Wiley India.
John C Martin, “Introdution to languages and theory of computation”, McGraw Hill
Anami & Aribasappa , “ Formal Languages and Automata Theory”,Wiley India
Credit Based Grading System
Introduction .NET framework, features of .Net framework, architecture and component of .Net, elements of .Net.
Basic Features Of C# Fundamentals, Classes and Objects, Inheritance and Polymorphism, Operator Overloading, Structures. Advanced Features Of C# Interfaces, Arrays, Indexers and Collections; Strings and Regular Expressions, Handling Exceptions, Delegates and Events.
Installing ASP.NET framework, overview of the ASP .net framework, overview of CLR, class library, overview of ASP.net control, understanding HTML controls, study of standard controls, validations controls, rich controls. Windows Forms: All about windows form, MDI form, creating windows applications, adding controls to forms, handling Events, and using various Tolls
Understanding and handling controls events, ADO.NET- Component object model, ODBC, OLEDB, and SQL connected mode, disconnected mode, dataset, data-reader Data base controls: Overview of data access data control, using grid view controls, using details view and frame view controls, ado .net data readers, SQL data source control, object data source control, site map data source.
XML: Introducing XML, Structure, and syntax of XML, document type definition (DTD), XML Schema, Document object model, Presenting and Handling XML. xml data source, using navigation controls, introduction of web parts, using java script, Web Services
C# for Programmers by Harvey Deitel, Paul Deitel, Pearson Education
Balagurusamy; Programming in C#; TMH
Web Commerce Technology Handbook by Daniel Minoli, Emma Minoli , TMH
Web Programming by Chris Bates, Wiley
Alex Mackey, “ Introduction.NET 4.5 “, Wiley India
ASP .Net Complete Reference by McDonald, TMH.
ADO .Net Complete Reference by Odey, TMH
Working with call backs and delegates in C#
Code access security with C#.
Creating a COM+ component with C#.
Creating a Windows Service with C#
Interacting with a Windows Service with C#
Using Reflection in C#
Sending Mail and SMTP Mail and C#
Perform String Manipulation with the String Builder and String Classes and C#:
Using the System .Net Web Client to Retrieve or Upload Data with C#
Reading and Writing XML Documents with the XML Text-Reader/-Writer Class and C#
Working with Page using ASP .Net.
Working with Forms using ASP .Net
Data Sources access through ADO.Net,
Working with Data readers , Transactions
Creating Web Application.
Credit Based Grading System Computer Science & Engineering, IV-Semester CS-4006 Computer Programming –II (b) (Python)
Timothy A. Budd: Exploring python, McGraw-Hill Education.
R.Nageshwar Rao ,”Python Programming” ,Wiley India
Think Python: Allen B. Downey, O'Reilly Media, Inc.
Credit Based Grading System Computer Science & Engineering, IV-Semester CS-4006 Computer Programming –II (c) (MATLAB)
MATLAB: An Overview, Brief history of MATLAB, About MATLAB, Installation of MATLAB, Help browser, Arranging the desktop, Basic functions of Matlab, Mostly used symbols in MATLAB, debugging in Matlab; Building MATLAB expressions: MATLAB datatype, command handling, MATLAB basics.
MATLAB Vector and Matrix: Scalar and vector, elementary features in a vector array, matrices, eigen values and eigen vectors, matrix operations, matrix operators, creating matrix arrangement, indexing array value, other operations, mathematical operations on array, array types
Graphics in MATLAB: 2D plots, parametric plots, contour lines and implicit plots, field plots, multiple graphics display function, 3D plots, multivariate data, data analysis.
MATLAB programming introduction to M-files,MATLAB editors, M files, scripts, functions, MATLAB error and correction, MATLAB debugger; Digital Image Processing with MATLAB (Image Processing).
MATLAB in neural networks: About neural networks, Human and artificial neuron, Architecture of neural networks (feed-forward, feedback, network layers), The McCuulloch- Pitts Model of Neuron, The Perceptron, Transfer function, neural network toolbox, Actual model, applications of neural network.
S. Swapna Kumar, S V B Lenina: MATLAB – Esay way of learning, PHI Learning, 2016
Amos Gilat ,” An Introduction with Applications ,4ed “ , wiley India
Credit Based Grading System
Air Pollution: Air pollutants, classification, (Primary & secondary Pollutants) Adverse effects of pollutants. Causes of Air pollution chemical, photochemical, Green house effect, ozone layer depletion, acid Rain.
Sound Pollution: Causes, controlling measures, measurement of sound pollution (deciblage), Industrial and non – industrial.
Harris, CE, Prichard MS, Rabin’s MJ, “Engineering Ethics”; Cengage Pub.
Rana SVS ; “Essentials of Ecology and Environment”; PHI Pub.
Raynold, GW “Ethics in information Technology”; Cengage.
Svakumar; Energy Environment & Ethics in society; TMH
AK De “Environmental Chemistry”; New Age Int. Publ.
6 BK Sharma, “Environmental Chemistry” ; Goel Publ. House.
Bala Krishnamoorthy; “Environmental management”; PHI
Gerard Kiely, “Environmental Engineering” ; TMH
Miller GT JR; living in the Environment Thomson/cengage
Cunninghan WP and MA; principles of Environment Sc; TMH
Pandey, S.N. & Mishra, S.P. Environment & Ecology, 2011, Ane Books , Pvt. Ltd, New Delhi
Joseph, B. Environmental Studies, 2009 Tata Mcgraw Hill, Edu India Ltd. New Delhi.
Gour R.R, Sangal, R &Bagaria, G.P. , Excel Books, A-45, Naraina Phase-I New Delhi.-110028
Credit Based Grading System
Structure of Desktop Computers, CPU: General Register Organization- Memory Register, Instruction Register, Control Word, Stack Organization, Instruction Format, ALU, I/O System,bus,CPU and Memory Program Counter, Bus Structure, Register Transfer Language- Bus and Memory Transfer, addressing modes.
Basic Concept of Instruction, Instruction Types, Micro Instruction Formats, Fetch and Execution cycle, Hardwired control unit, Micro-programmed Control unit- microprogram sequencer Control Memory, Sequencing and Execution of Micro Instruction.
Addition and Subtraction, Tools Compliment Representation, Signed Addition and Subtraction, Multiplication and division, Booths Algorithm, Division Operation, Floating Point Arithmetic Operation.design of Arithmetic unit
I/O Interface – PCI Bus, SCSI Bus, USB, Data Transfer: Serial, Parallel, Synchronous, Asynchronous Modes of Data Transfer, Direct Memory Access(DMA), I/O Processor.
Main memory- RAM, ROM, Secondary Memory – Magnetic Tape,Disk, Optical Storage, Cache Memory: Cache Structure and Design, Mapping Scheme, Replacement Algorithm, Improving Cache Performance, Virtual Memory,memory management hardware
Characteristics of Multiprocessor, Structure of Multiprocessor- Inter-processor Arbitration, Inter- Processor Communication and Synchronization. Memory in Multiprocessor System, Concept of Pipelining, Vector Processing, Array Processing, RISC And CISC,Study of Multicore Processor – Intel, AMD.
Morris Mano , “Computer System Organization ” PHI
Alan Clements: “Computer Organization and Architecture”, Cengage Learning
Subrata Ghosal: “Computer Architecture and Organization”, Pearson
William stalling ,“Computer Architecture and Organization” PHI
M. Usha, T.S. Shrikant: “Computer System Architecture and Organization”, Willey India
Chaudhuri, P.Pal: “Computer Organization and Design”, PHI
Sarangi: “Computer Organization and Architecture”,Mc- Graw Hills
1) Study of Multiplexer and Demultiplexer
Study of Half Adder and Subtractor
Study of Full Adder and Subtractor
WAP to add two 8 bit numbers and store the result at memory location 2000
WAP to multiply two 8 bit numbers stored at memory location 2000 and 2001 and stores the result at memory location 2000 and 2001.
WAP to add two 16-bit numbers. Store the result at memory address starting from 2000.
WAP which tests if any bit is '0' in a data byte specified at an address 2000. If it is so, 00 would be stored at address 2001 and if not so then FF should be stored at the same address.
Assume that 3 bytes of data are stored at consecutive memory addresses of the data memory starting at 2000. Write a program which loads register C with (2000), i.e. with data contained at memory address 2000, D with (2001), E with (2002) and A with (2001).
Sixteen bytes of data are specified at consecutive data-memory locations starting at 2000. Write a program which increments the value of all sixteen bytes by 01.
WAP to add t 10 bytes stored at memory location starting from 3000. Store the result at memory location 300A.
Credit Based Grading System
Modulation equation and their relative phase and frequency deviations, modulation index frequency spectrum, NBFM and WBFM, Bandwidth comparison of modulation techniques.
Sampling of signal, sampling theorem for low pass and Band pass signal, PAM, TDM. Channel Bandwidth for PAM-TDM signal, Type of sampling instantaneous (Natural and Flat Top), Aperture effect, PPM, PDM.
Digital signal Quantization, Quantization error, PCM, S/N Ratio, Companding, Data Rate, Baud Rate, Bit Rate, Multiplexed PCM signal, DPCM), DM, ADM).
Digital modulations techniques, ASK, BPSK, DPSK, offset and non-offset QPSK, M-Ary PSK, BFSK, M-Ary FSK, QAM).
Singh & Sapre, Communication System, TMH
B.P. Lathi & Zhi Ding, Modern Digital and Analog Communication System, 4rth Edition, Oxford University Press.
Taub & Shilling, Communication System, TMH
George Kennedy & Davis, Electronic Communication System, 4rth Edition, TMH.
Abhay Gandhi, Analog & Digital Communication: Theory & Lab Work, Cengage Learning, India.
Study of sampling process and signal reconstruction and aliasing.
Study of PAM PPM and PDM
Study of PCM transmitter and receiver.
Time division multiplexing (TDM) and De multiplexing
Study of ASK PSK and FSK transmitter and receiver.
Study of AM modulation and Demodulation techniques (Transmitter and Receiver) Calculate of parameters
Study of FM modulation and demodulation (Transmitter and Receiver) & Calculation of parameters
To construct and verify pre emphasis and de-emphasis and plot the wave forms.
Study of super hetrodyne receiver and characteristics of ratio radio receiver.
To construct frequency multiplier circuit and to observe the waveform
Study of AVC and AFC.
Credit Based Grading System
Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort. Introduction to divide and conquer technique, analysis, design and comparison of various
algorithms based on this technique, example binary search, merge sort, quick sort, strassen’s matrix multiplication.
Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman
coding, minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path algorithm
Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage graph, reliability design, Floyd-Warshall algorithm
Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph coloring problem etc. Introduction to branch & bound method, examples of branch and bound
method like traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem, introduction to parallel algorithms.
Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.
Coremen Thomas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.
Horowitz & Sahani; Analysis & Design of Algorithm
Dasgupta; algorithms; TMH
Ullmann; Analysis & Design of Algorithm;
Michael T Goodrich, Robarto Tamassia, Algorithm Design, Wiely India
Write a program for Iterative and Recursive Binary Search.
Write a program for Merge Sort.
Write a program for Quick Sort.
Write a program for Strassen’s Matrix Multiplication.
Write a program for optimal merge patterns.
Write a program for Huffman coding.
Write a program for minimum spanning trees using Kruskal’s algorithm.
Write a program for minimum spanning trees using Prim’s algorithm.
Write a program for single sources shortest path algorithm.
Write a program for Floye-Warshal algorithm.
Write a program for traveling salesman problem.
Write a program for Hamiltonian cycle problem.
Credit Based Grading System
of Computation. In this syllabus we cover finite automata, pushdown automata, Context free grammars and Turing machines.
Automata: Basic machine, FSM , Transition graph, Transition matrix, Deterministic and nondeterministic FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines, minimization of finite automata, Two-way finite automata. Regular Sets and Regular Grammars:
Alphabet, words, Operations, Regular sets, Finite automata and regular expression, Myhill- Nerode theorem Pumping lemma and regular sets, Application of pumping lemma, closure properties of regular sets.
Context –Free Grammars: Introduction to CFG, Regular Grammars, Derivation trees and Ambiguity, Simplification of Context free grammars, Normal Forms (Chomsky Normal Form and Greibach Normal forms).
Pushdown Automata: Definition of PDA, Deterministic Pushdown Automata, PDA corresponding to given CFG, CFG corresponding to a given PDA. Context Free Languages:
The pumping lemma for CFL’s, Closure properties of CFL’s, Decision problems involving CFL’s.
Turing Machines: Introduction, TM model, representation and languages acceptability of TM Design of TM,Universal TM & Other modification, Church’s hypothesis, composite & iterated TM. Turing machine as enumerators.Properties of recursive & recursively enumerable languages,Universal Turing machine
Tractable and Untractable Problems: P, NP, NP complete and NP hard problems, examples of these problems like satisfy ability problems, vertex cover problem, Hamiltonian path problem, traveling sales man problem, Partition problem etc.
John E. Hopcroft, Jeffery Ullman,”Introduction to Automata theory, Langauges & computation” , Narosa Publishers.
K.L.P Mishra & N.Chandrasekaran,“Theory of Computer Science”, PHI Learning
Daniel I.A. Cohen,“Introduction to Computer Theory”,Wiley India.
John C Martin, “Introdution to languages and theory of computation”, McGraw Hill
Anami & Aribasappa , “ Formal Languages and Automata Theory”,Wiley India
Credit Based Grading System
Introduction .NET framework, features of .Net framework, architecture and component of .Net, elements of .Net.
Basic Features Of C# Fundamentals, Classes and Objects, Inheritance and Polymorphism, Operator Overloading, Structures. Advanced Features Of C# Interfaces, Arrays, Indexers and Collections; Strings and Regular Expressions, Handling Exceptions, Delegates and Events.
Installing ASP.NET framework, overview of the ASP .net framework, overview of CLR, class library, overview of ASP.net control, understanding HTML controls, study of standard controls, validations controls, rich controls. Windows Forms: All about windows form, MDI form, creating windows applications, adding controls to forms, handling Events, and using various Tolls
Understanding and handling controls events, ADO.NET- Component object model, ODBC, OLEDB, and SQL connected mode, disconnected mode, dataset, data-reader Data base controls: Overview of data access data control, using grid view controls, using details view and frame view controls, ado .net data readers, SQL data source control, object data source control, site map data source.
XML: Introducing XML, Structure, and syntax of XML, document type definition (DTD), XML Schema, Document object model, Presenting and Handling XML. xml data source, using navigation controls, introduction of web parts, using java script, Web Services
C# for Programmers by Harvey Deitel, Paul Deitel, Pearson Education
Balagurusamy; Programming in C#; TMH
Web Commerce Technology Handbook by Daniel Minoli, Emma Minoli , TMH
Web Programming by Chris Bates, Wiley
Alex Mackey, “ Introduction.NET 4.5 “, Wiley India
ASP .Net Complete Reference by McDonald, TMH.
ADO .Net Complete Reference by Odey, TMH
Working with call backs and delegates in C#
Code access security with C#.
Creating a COM+ component with C#.
Creating a Windows Service with C#
Interacting with a Windows Service with C#
Using Reflection in C#
Sending Mail and SMTP Mail and C#
Perform String Manipulation with the String Builder and String Classes and C#:
Using the System .Net Web Client to Retrieve or Upload Data with C#
Reading and Writing XML Documents with the XML Text-Reader/-Writer Class and C#
Working with Page using ASP .Net.
Working with Forms using ASP .Net
Data Sources access through ADO.Net,
Working with Data readers , Transactions
Creating Web Application.
Credit Based Grading System Computer Science & Engineering, IV-Semester CS-4006 Computer Programming –II (b) (Python)
Timothy A. Budd: Exploring python, McGraw-Hill Education.
R.Nageshwar Rao ,”Python Programming” ,Wiley India
Think Python: Allen B. Downey, O'Reilly Media, Inc.
Credit Based Grading System Computer Science & Engineering, IV-Semester CS-4006 Computer Programming –II (c) (MATLAB)
MATLAB: An Overview, Brief history of MATLAB, About MATLAB, Installation of MATLAB, Help browser, Arranging the desktop, Basic functions of Matlab, Mostly used symbols in MATLAB, debugging in Matlab; Building MATLAB expressions: MATLAB datatype, command handling, MATLAB basics.
MATLAB Vector and Matrix: Scalar and vector, elementary features in a vector array, matrices, eigen values and eigen vectors, matrix operations, matrix operators, creating matrix arrangement, indexing array value, other operations, mathematical operations on array, array types
Graphics in MATLAB: 2D plots, parametric plots, contour lines and implicit plots, field plots, multiple graphics display function, 3D plots, multivariate data, data analysis.
MATLAB programming introduction to M-files,MATLAB editors, M files, scripts, functions, MATLAB error and correction, MATLAB debugger; Digital Image Processing with MATLAB (Image Processing).
MATLAB in neural networks: About neural networks, Human and artificial neuron, Architecture of neural networks (feed-forward, feedback, network layers), The McCuulloch- Pitts Model of Neuron, The Perceptron, Transfer function, neural network toolbox, Actual model, applications of neural network.
S. Swapna Kumar, S V B Lenina: MATLAB – Esay way of learning, PHI Learning, 2016
Amos Gilat ,” An Introduction with Applications ,4ed “ , wiley India