New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
BT401 | Mathematics-III | 3L-1T-0P | 4 Credits |
OBJECTIVES: The objective of this course is to fulfill the needs of engineers to understand applications of Numerical Analysis, Transform Calculus and Statistical techniques in order to acquire mathematical knowledge and to solving wide range of practical problems appearing in different sections of science and engineering. More precisely, the objectives are:
To introduce effective mathematical tools for the Numerical Solutions algebraic and transcendental equations.
To enable young technocrats to acquire mathematical knowledge to understand Laplace transformation, Inverse Laplace transformation and Fourier Transform which are used in various branches of engineering.
To acquaint the student with mathematical tools available in Statistics needed in various field of science and engineering.
Module 1: Numerical Methods – 1: (8 hours): Solution of polynomial and transcendental equations – Bisection method, Newton-Raphson method and Regula-Falsi method. Finite differences, Relation between operators, Interpolation using Newton’s forward and backward difference formulae. Interpolation with unequal intervals: Newton’s divided difference and Lagrange’s formulae.
Module 2: Numerical Methods – 2: (6 hours): Numerical Differentiation, Numerical integration: Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules. Solution of Simultaneous Linear Algebraic Equations by Gauss’s Elimination, Gauss’s Jordan, Crout’s methods, Jacobi’s, Gauss-Seidal, and Relaxation method.,
Module 3: Numerical Methods – 3: (10 hours): Ordinary differential equations: Taylor’s series, Euler and modified Euler’s methods. RungeKutta method of fourth order for solving first and second order equations. Milne’s and Adam’s predicator-corrector methods. Partial differential equations: Finite difference solution two dimensional Laplace equation and Poission equation, Implicit and explicit methods for one dimensional heat equation (Bender-Schmidt and Crank- Nicholson methods), Finite difference explicit method for wave equation.
Module 4: Transform Calculus: (8 hours): Laplace Transform, Properties of Laplace Transform, Laplace transform of periodic functions. Finding inverse Laplace transform by different methods, convolution theorem. Evaluation of integrals by Laplace transform, solving ODEs by Laplace Transform method, Fourier transforms.
Module 5: Concept of Probability: (8 hours): Probability Mass function, Probability Density Function, Discrete Distribution: Binomial, Poisson’s, Continuous Distribution: Normal Distribution, Exponential Distribution.
P. Kandasamy, K. Thilagavathy, K. Gunavathi, Numerical Methods, S. Chand & Company, 2nd Edition, Reprint 2012.
S.S. Sastry, Introductory methods of numerical analysis, PHI, 4th Edition, 2005.
Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2010.
N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint, 2010.
Veerarajan T., Engineering Mathematics, Tata McGraw-Hill, New Delhi, 2008.
P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall, 2003 (Reprint).
S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.
W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd Ed., Wiley, 1968. Statistics
New Scheme Based On AICTE Flexible Curricula
Course Objectives
The study of communication systems starts with the concept of analog communication. In this course time and frequency representation of information is given. The objective of this course is to be familiar with the basic building blocks of communication systems such as modulator and demodulator. Different types of analog modulation techniques are given in this course.
Unit-I Signals and Systems: Block diagram of a communication system, signal-definition, types of signals continuous, discrete, deterministic, non-deterministic, periodic, non-periodic, energy, power, analog and digital signals. Electromagnetic Spectra, Standard signals- DC, sinusoidal, unit step, ramp, signum, rectangular pulse, impulse(delta) signal. System definition, classification of systems, linear, nonlinear, time variant, time invariant, causal, non causal, stable and unstable systems. Fourier transforms: Time domain and frequency domain representation of signal, Fourier Transform and its properties, conditions for existence, Transform of Gate, unit step, constant, impulse, sine and cosine wave. Shifting property of delta function, convolution, time and frequency convolution theorems.
Unit-II Amplitude Modulation: Modulation, need of modulation, types of modulation techniques, amplitude modulation (DSB-FC), modulation index, frequency spectrum of AM wave, linear and over modulation, power relation in AM, transmission efficiency, modulation by a complex signal, bandwidth of AM, AM modulators, square law and switching modulator, advantages and disadvantages of AM. Demodulation of AM: Suppressed carrier amplitude modulation systems, DSB-SC, SSB-SC, VSB-SC systems, comparison of various amplitude modulation systems. Demodulation of AM, square law and envelope detector, synchronous detection of AM, Low and high power AM transmitters, AM receivers, TRF and superheterodyne receivers, sensitivity, selectivity and fidelity of receivers.
Unit-III Angle modulation: Introduction and types of angle modulation, frequency modulation, frequency deviation, modulation index, deviation ratio, bandwidth requirement of FM wave, types of FM. Phase modulation, difference between FM and PM, Direct and indirect method of FM generation, FM demodulators- slope detector, Foster seeley discriminator, ratio detector. Introduction to pulse modulation systems.
Unit-IV Sampling of signal: sampling theorem for low pass and Band pass signal, Pulse amplitude modulation (PAM), Time division, multiplexing (TDM). Channel Bandwidth for PAM- TDM signal Type of sampling instantaneous, Natural and flat top, Aperture effect, Introduction to pulse position and pulse duration modulations, Digital signal, Quantization, Quantization error, Pulse code modulation, signal to noise ratio, Companding, Data rate and Baud rate, Bit rate, multiplexed PCM signal, Differential PCM (DPCM), Delta Modulation (DM) and Adaptive Delta Modulation (ADM), comparison of various systems.
Unit-V Digital modulations Techniques: Generation, detection, equation and Bandwidth of amplitude shift keying (ASK) Binary Phase Shift keying (BPSK), Differential phase shift keying (DPSK), offset and non offset quadrature phase shift keying (QPSK), M-Ary PSK, Binary frequency Shift Keying (BFSK), M-Ary FSK Quadrature Amplitude modulation (QAM).
Differentiate Analog and Digital Signal and types of signals.
Understand the communication of information over the communication channel.
Understand how information signal of low frequency can be transmitted with the help of modulation techniques over a long distance.
Differentiate different modulation techniques such as AM, SSB, DSB and FM.
Explain using block diagrams, modulation and demodulation techniques for digital signal and determine bandwidth requirement.
Reference Books:
Singh & Sapre, “Communication Systems”, TMH.
Taub Schilling, “Principles of Communication Systems”, TMH.
W. Tomasi “Electronic Communications Systems”, Pearson Education Pvt. Ltd.
Taub & shilling, “Communication Systems”, TMH.
Abhay Gandhi, “Analog and Digital Communication”, CENGAGE Learning.
List of Experiments:
AM Modulation and Demodulation (Envelope Detector)
Frequency modulation using reactance modulator.
Frequency modulation using varactor modulator.
Pulse Amplitude Modulation and Demodulation
Pre-emphasis and De-emphasis
Analog Multiplexing.
Amplitude Modulation using Pspice
Receiver characteristics (selectivity, sensitivity, fidelity).
Operation of foster-seeley loop detector.
Operation of ratio detector.
New Scheme Based On AICTE Flexible Curricula
Data structure includes analyzing various algorithms along with time and space complexities. It also helps students to design new algorithms through mathematical analysis and programming.
Implement sorting and searching algorithm
Experiment with techniques for obtaining maximum output with minimum efforts
Make use of dynamic programming for finding
Solve 8 queen’s problem and others of the kind for application in real world scenarios .
Distinguish between NP hard and NP complete problems and develop their solutions
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, Wiley 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 Floyd-Warshall algorithm.
Write a program for traveling salesman problem.
Write a program for Hamiltonian cycle problem.
New Scheme Based On AICTE Flexible Curricula
Objectives: Students to be familiarize the basic principles of computer architecture, Design and Multi Processing, Types of data transfer, Concept of semi conductor memories which is useful for research work in field Computer System.
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
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 storedat 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 address2000, 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
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
Course Objectives:
The main objectives of the course are
To understand fundamental knowledge of file system, database concepts and use of relational database.
To study of different data model and conceptual design using ER diagram.
Students can use SQL operations to manipulate the database and learn how to design and create a good database using functionaldependencies and normalization.
The course provides an overview of transaction management, concurrency control, distributed database and Big Data.
Course Outcomes:
After successful completion of this course, the students would be able to:
Compare file system and DBMS and explain how DBMS is better than traditional File Processing Systems.
Analyze the physical and logical database designs, database modeling, relational, hierarchical, and network models
Analyze and renovate an information model into a relational database schema and to use a DDL, DML and DCL utilities to implement the schema using aDBMS.
Formulate data retrieval queries in SQL and Relational Algebra.
Demonstrate an understanding of functional dependencies, normalization theory and apply such knowledge to the design of adatabase.
Demonstrate and explain terms like Transaction Processing, Concurrency Control, distributed database and big data.
Reference Books:
Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill.
Elmasri, Navathe, “Fundamentals of Database Systems”, Pearson.
Ivan Bayross, “SQL, PL/SQL the Programming Language of Oracle”, BPB publications.
S. Sharma, J. Agrawal, S. Agrawal, “Advanced Database Management System”, Dreamtech Press.
Leon & Leon, “Fundamental of Data Base Management System”,TMH
List of Experiments:
To perform various SQL Commands of DDL, DML, DCL.
Write SQL Commands such as Insertion, deletion and updation for anyschema.
To execute Nested Queries, Join Queries, order-by, having clause and stringoperation.
To perform set operators like Union, Intersect, Minus on a set of tables.
To execute various commands for GROUP functions (avg, count, max, min, Sum).
Write a PL/SQL block for transaction application using Triggers.
Write a DBMS program to prepare report for an application usingfunction.
Designing of various Input screens/Forms.
Create reports using database connectivity of Front end with back end.
Create database Design with normalization and implementing in anyapplication.
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
Gain a comprehensive understanding of the philosophy and architecture of C-Sharp programming. Configure and deploy a Microsoft ASP.NET Web application. Learn how to implement web applications using web forms, including programs that interact with databases. Gain a strong knowledge in all Dot Net Web application concepts
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
References:
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
List of Experiments/ program (Expandable):
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.
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
BT407- 90 hrs Internship based on using various software’s –Internship -II
To be completed anytime during fourth semester. Its evaluation/credit to be added in fifth semester.
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
Unit I
Introduction- Introduction of Cyber Crime, Categorizing Cybercrime, Cybercrime Theory, Criminology perception of cyber criminals: hackers, computer intrusions and Attacks, Privacy, surveillance and protection, hiding crimes in cyberspace, cryptography, hacking vs cracking, privacy and security at risk in the global information society.
Unit II
Application Security- Data Security, Security Technology-Firewall and VPNs, Intrusion Detection, Access Control. Security Threats -Viruses, Worms, Trojan Horse, Bombs, Trapdoors, Spoofs, E-mail Viruses, Macro Viruses, Malicious Software, Network and Denial of Services Attack, Security Threats to E-Commerce- Electronic Payment System, e- Cash, Credit/Debit Cards.
Unit III
Cryptrography concepts and Techniques
Plain text , cipher text, types – substitution ,transposition ,encryption, decryption , symmetric and asymmetric key cryptography algorithms, steganography .
Unit IV
Security Policies- Development of Policies, WWW Policies, Email Security Policies, Policy Review Process-Corporate Policies-Sample Security Policies, Publishing and Notification Requirement of the Policies.
Unit V
Information Security Standards-ISO, IT Act, Copyright Act, Patent Law, IPR. Cyber Laws in India; IT Act 2000 Provisions, Intellectual Property Law: Copy Right Law, Software License, Semiconductor Law and Patent Law.
Case Study – Corporate Security , Cyber cases
References:
Nina Godbole “ Cyber Security: Wiley.
Michael E.Whitman and Herbert J Mattord "Principle of Information Security" Cengage
William stallings “Cryptography and Network Security” PEARSON
Charles P. Pfleeger, Shari Lawerance Pfleeger, “Analysing Computer Security”, Pearson Education India.
Vinod V. Sople, “Managing Intellectual Property” PHI Learning Private Limited
Atul Khate, “Cryptrography and Network Security” ,TMH
V.K.Pachghare, “Cryptography and information Security”, PHI Learning Private Limited, Delhi India.
CHANDER, HARISH,” Cyber Laws And It Protection ” , PHI Learning Private Limited ,Delhi
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
BT401 | Mathematics-III | 3L-1T-0P | 4 Credits |
OBJECTIVES: The objective of this course is to fulfill the needs of engineers to understand applications of Numerical Analysis, Transform Calculus and Statistical techniques in order to acquire mathematical knowledge and to solving wide range of practical problems appearing in different sections of science and engineering. More precisely, the objectives are:
To introduce effective mathematical tools for the Numerical Solutions algebraic and transcendental equations.
To enable young technocrats to acquire mathematical knowledge to understand Laplace transformation, Inverse Laplace transformation and Fourier Transform which are used in various branches of engineering.
To acquaint the student with mathematical tools available in Statistics needed in various field of science and engineering.
Module 1: Numerical Methods – 1: (8 hours): Solution of polynomial and transcendental equations – Bisection method, Newton-Raphson method and Regula-Falsi method. Finite differences, Relation between operators, Interpolation using Newton’s forward and backward difference formulae. Interpolation with unequal intervals: Newton’s divided difference and Lagrange’s formulae.
Module 2: Numerical Methods – 2: (6 hours): Numerical Differentiation, Numerical integration: Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules. Solution of Simultaneous Linear Algebraic Equations by Gauss’s Elimination, Gauss’s Jordan, Crout’s methods, Jacobi’s, Gauss-Seidal, and Relaxation method.,
Module 3: Numerical Methods – 3: (10 hours): Ordinary differential equations: Taylor’s series, Euler and modified Euler’s methods. RungeKutta method of fourth order for solving first and second order equations. Milne’s and Adam’s predicator-corrector methods. Partial differential equations: Finite difference solution two dimensional Laplace equation and Poission equation, Implicit and explicit methods for one dimensional heat equation (Bender-Schmidt and Crank- Nicholson methods), Finite difference explicit method for wave equation.
Module 4: Transform Calculus: (8 hours): Laplace Transform, Properties of Laplace Transform, Laplace transform of periodic functions. Finding inverse Laplace transform by different methods, convolution theorem. Evaluation of integrals by Laplace transform, solving ODEs by Laplace Transform method, Fourier transforms.
Module 5: Concept of Probability: (8 hours): Probability Mass function, Probability Density Function, Discrete Distribution: Binomial, Poisson’s, Continuous Distribution: Normal Distribution, Exponential Distribution.
P. Kandasamy, K. Thilagavathy, K. Gunavathi, Numerical Methods, S. Chand & Company, 2nd Edition, Reprint 2012.
S.S. Sastry, Introductory methods of numerical analysis, PHI, 4th Edition, 2005.
Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2010.
N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint, 2010.
Veerarajan T., Engineering Mathematics, Tata McGraw-Hill, New Delhi, 2008.
P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall, 2003 (Reprint).
S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.
W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd Ed., Wiley, 1968. Statistics
New Scheme Based On AICTE Flexible Curricula
Course Objectives
The study of communication systems starts with the concept of analog communication. In this course time and frequency representation of information is given. The objective of this course is to be familiar with the basic building blocks of communication systems such as modulator and demodulator. Different types of analog modulation techniques are given in this course.
Unit-I Signals and Systems: Block diagram of a communication system, signal-definition, types of signals continuous, discrete, deterministic, non-deterministic, periodic, non-periodic, energy, power, analog and digital signals. Electromagnetic Spectra, Standard signals- DC, sinusoidal, unit step, ramp, signum, rectangular pulse, impulse(delta) signal. System definition, classification of systems, linear, nonlinear, time variant, time invariant, causal, non causal, stable and unstable systems. Fourier transforms: Time domain and frequency domain representation of signal, Fourier Transform and its properties, conditions for existence, Transform of Gate, unit step, constant, impulse, sine and cosine wave. Shifting property of delta function, convolution, time and frequency convolution theorems.
Unit-II Amplitude Modulation: Modulation, need of modulation, types of modulation techniques, amplitude modulation (DSB-FC), modulation index, frequency spectrum of AM wave, linear and over modulation, power relation in AM, transmission efficiency, modulation by a complex signal, bandwidth of AM, AM modulators, square law and switching modulator, advantages and disadvantages of AM. Demodulation of AM: Suppressed carrier amplitude modulation systems, DSB-SC, SSB-SC, VSB-SC systems, comparison of various amplitude modulation systems. Demodulation of AM, square law and envelope detector, synchronous detection of AM, Low and high power AM transmitters, AM receivers, TRF and superheterodyne receivers, sensitivity, selectivity and fidelity of receivers.
Unit-III Angle modulation: Introduction and types of angle modulation, frequency modulation, frequency deviation, modulation index, deviation ratio, bandwidth requirement of FM wave, types of FM. Phase modulation, difference between FM and PM, Direct and indirect method of FM generation, FM demodulators- slope detector, Foster seeley discriminator, ratio detector. Introduction to pulse modulation systems.
Unit-IV Sampling of signal: sampling theorem for low pass and Band pass signal, Pulse amplitude modulation (PAM), Time division, multiplexing (TDM). Channel Bandwidth for PAM- TDM signal Type of sampling instantaneous, Natural and flat top, Aperture effect, Introduction to pulse position and pulse duration modulations, Digital signal, Quantization, Quantization error, Pulse code modulation, signal to noise ratio, Companding, Data rate and Baud rate, Bit rate, multiplexed PCM signal, Differential PCM (DPCM), Delta Modulation (DM) and Adaptive Delta Modulation (ADM), comparison of various systems.
Unit-V Digital modulations Techniques: Generation, detection, equation and Bandwidth of amplitude shift keying (ASK) Binary Phase Shift keying (BPSK), Differential phase shift keying (DPSK), offset and non offset quadrature phase shift keying (QPSK), M-Ary PSK, Binary frequency Shift Keying (BFSK), M-Ary FSK Quadrature Amplitude modulation (QAM).
Differentiate Analog and Digital Signal and types of signals.
Understand the communication of information over the communication channel.
Understand how information signal of low frequency can be transmitted with the help of modulation techniques over a long distance.
Differentiate different modulation techniques such as AM, SSB, DSB and FM.
Explain using block diagrams, modulation and demodulation techniques for digital signal and determine bandwidth requirement.
Reference Books:
Singh & Sapre, “Communication Systems”, TMH.
Taub Schilling, “Principles of Communication Systems”, TMH.
W. Tomasi “Electronic Communications Systems”, Pearson Education Pvt. Ltd.
Taub & shilling, “Communication Systems”, TMH.
Abhay Gandhi, “Analog and Digital Communication”, CENGAGE Learning.
List of Experiments:
AM Modulation and Demodulation (Envelope Detector)
Frequency modulation using reactance modulator.
Frequency modulation using varactor modulator.
Pulse Amplitude Modulation and Demodulation
Pre-emphasis and De-emphasis
Analog Multiplexing.
Amplitude Modulation using Pspice
Receiver characteristics (selectivity, sensitivity, fidelity).
Operation of foster-seeley loop detector.
Operation of ratio detector.
New Scheme Based On AICTE Flexible Curricula
Data structure includes analyzing various algorithms along with time and space complexities. It also helps students to design new algorithms through mathematical analysis and programming.
Implement sorting and searching algorithm
Experiment with techniques for obtaining maximum output with minimum efforts
Make use of dynamic programming for finding
Solve 8 queen’s problem and others of the kind for application in real world scenarios .
Distinguish between NP hard and NP complete problems and develop their solutions
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, Wiley 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 Floyd-Warshall algorithm.
Write a program for traveling salesman problem.
Write a program for Hamiltonian cycle problem.
New Scheme Based On AICTE Flexible Curricula
Objectives: Students to be familiarize the basic principles of computer architecture, Design and Multi Processing, Types of data transfer, Concept of semi conductor memories which is useful for research work in field Computer System.
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
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 storedat 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 address2000, 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
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
Course Objectives:
The main objectives of the course are
To understand fundamental knowledge of file system, database concepts and use of relational database.
To study of different data model and conceptual design using ER diagram.
Students can use SQL operations to manipulate the database and learn how to design and create a good database using functionaldependencies and normalization.
The course provides an overview of transaction management, concurrency control, distributed database and Big Data.
Course Outcomes:
After successful completion of this course, the students would be able to:
Compare file system and DBMS and explain how DBMS is better than traditional File Processing Systems.
Analyze the physical and logical database designs, database modeling, relational, hierarchical, and network models
Analyze and renovate an information model into a relational database schema and to use a DDL, DML and DCL utilities to implement the schema using aDBMS.
Formulate data retrieval queries in SQL and Relational Algebra.
Demonstrate an understanding of functional dependencies, normalization theory and apply such knowledge to the design of adatabase.
Demonstrate and explain terms like Transaction Processing, Concurrency Control, distributed database and big data.
Reference Books:
Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill.
Elmasri, Navathe, “Fundamentals of Database Systems”, Pearson.
Ivan Bayross, “SQL, PL/SQL the Programming Language of Oracle”, BPB publications.
S. Sharma, J. Agrawal, S. Agrawal, “Advanced Database Management System”, Dreamtech Press.
Leon & Leon, “Fundamental of Data Base Management System”,TMH
List of Experiments:
To perform various SQL Commands of DDL, DML, DCL.
Write SQL Commands such as Insertion, deletion and updation for anyschema.
To execute Nested Queries, Join Queries, order-by, having clause and stringoperation.
To perform set operators like Union, Intersect, Minus on a set of tables.
To execute various commands for GROUP functions (avg, count, max, min, Sum).
Write a PL/SQL block for transaction application using Triggers.
Write a DBMS program to prepare report for an application usingfunction.
Designing of various Input screens/Forms.
Create reports using database connectivity of Front end with back end.
Create database Design with normalization and implementing in anyapplication.
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
Gain a comprehensive understanding of the philosophy and architecture of C-Sharp programming. Configure and deploy a Microsoft ASP.NET Web application. Learn how to implement web applications using web forms, including programs that interact with databases. Gain a strong knowledge in all Dot Net Web application concepts
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
References:
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
List of Experiments/ program (Expandable):
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.
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
BT407- 90 hrs Internship based on using various software’s –Internship -II
To be completed anytime during fourth semester. Its evaluation/credit to be added in fifth semester.
New Scheme Based On AICTE Flexible Curricula Computer Science & Information Technology, IV-Semester
Unit I
Introduction- Introduction of Cyber Crime, Categorizing Cybercrime, Cybercrime Theory, Criminology perception of cyber criminals: hackers, computer intrusions and Attacks, Privacy, surveillance and protection, hiding crimes in cyberspace, cryptography, hacking vs cracking, privacy and security at risk in the global information society.
Unit II
Application Security- Data Security, Security Technology-Firewall and VPNs, Intrusion Detection, Access Control. Security Threats -Viruses, Worms, Trojan Horse, Bombs, Trapdoors, Spoofs, E-mail Viruses, Macro Viruses, Malicious Software, Network and Denial of Services Attack, Security Threats to E-Commerce- Electronic Payment System, e- Cash, Credit/Debit Cards.
Unit III
Cryptrography concepts and Techniques
Plain text , cipher text, types – substitution ,transposition ,encryption, decryption , symmetric and asymmetric key cryptography algorithms, steganography .
Unit IV
Security Policies- Development of Policies, WWW Policies, Email Security Policies, Policy Review Process-Corporate Policies-Sample Security Policies, Publishing and Notification Requirement of the Policies.
Unit V
Information Security Standards-ISO, IT Act, Copyright Act, Patent Law, IPR. Cyber Laws in India; IT Act 2000 Provisions, Intellectual Property Law: Copy Right Law, Software License, Semiconductor Law and Patent Law.
Case Study – Corporate Security , Cyber cases
References:
Nina Godbole “ Cyber Security: Wiley.
Michael E.Whitman and Herbert J Mattord "Principle of Information Security" Cengage
William stallings “Cryptography and Network Security” PEARSON
Charles P. Pfleeger, Shari Lawerance Pfleeger, “Analysing Computer Security”, Pearson Education India.
Vinod V. Sople, “Managing Intellectual Property” PHI Learning Private Limited
Atul Khate, “Cryptrography and Network Security” ,TMH
V.K.Pachghare, “Cryptography and information Security”, PHI Learning Private Limited, Delhi India.
CHANDER, HARISH,” Cyber Laws And It Protection ” , PHI Learning Private Limited ,Delhi