VTU Syllabus Computer Science & Engineering 4th Semester

COMPLEX ANALYSIS, PROBABILITY AND STATISTICAL METHODS

· To provide an insight into applications of complex variables, conformal mapping, and special functions arising in potential theory, quantum mechanics, heat conduction, and field theory.

· To develop probability distribution of discrete, continuous random variables and joint probability distribution occurring in digital signal processing, design engineering, and microwave engineering.

Construction of analytic functions: Milne-Thomson method-Problems.

, ≠ 0.Bilinear transformations- Problems.

Complex integration: Line integral of a complex function-Cauchy’s theorem and Cauchy’s integral formula

and problems.

-problems. Regression analysis- lines of regression –problems.

Curve Fitting: Curve fitting by the method of least squares- fitting the curves of the form-

= + , = = + + .

Sampling Theory: Introduction to sampling distributions, standard error, Type-I and Type-II errors. Test of hypothesis for means, student’s t-distribution, and Chi-square distribution as a test of goodness of fit.

· Use the concepts of analytic function and complex potentials to solve the problems arising in electromagnetic field theory.

· Utilize conformal transformation and complex integral arising in aerofoil theory, fluid flow visualization, and image processing.

· Apply discrete and continuous probability distributions in analyzing the probability models arising in the engineering field.

· Make use of the correlation and regression analysis to fit a suitable mathematical model for the statistical data.

· The question paper will have ten full questions carrying equal marks.

· Each full question will be for 20 marks.

· There will be two full questions (with a maximum of four sub-questions) from each module.

Mathematics

Louis C.Barrett

Numerical Analysis

India

Mathematics

Mathematics

Manish Goyal

Mathematics

and Reena Garg

Publishing,

1. http://nptel.ac.in/courses.php?disciplineID=111

2. http://www.class-central.com/subject/math(MOOCs)

3. http://academicearth.org/

4. VTU EDUSAT PROGRAMME – 20

DESIGN AND ANALYSIS OF ALGORITHMS

· Apply appropriate methods to solve a given problem.

· Describe various methods of algorithm analysis.

RBT: L1, L2, L3

RBT: L1, L2, L3

RBT: L1, L2, L3

RBT: L1, L2, L3

and Bound solution (T2:8.2). NP-Complete and NP-Hard problems: Basic concepts, non-

RBT: L1, L2, L3

· Estimate the computational complexity of different algorithms.

· Devise an algorithm using appropriate design strategies for problem-solving.

· Each full Question consisting of 20 marks

· There will be 2 full questions (with a maximum of four sub-questions) from each module.

· Each full question will have sub-questions covering all the topics under a module.

· The students will have to answer 5 full questions, selecting one full question from each module.

2. Computer Algorithms/C++, Ellis Horowitz, Satraj Sahni and Rajasekaran, 2nd Edition, 2014, Universities Press

2. Design and Analysis of Algorithms, S. Sridhar, Oxford (Higher Education).

OPERATING SYSTEMS

· Explain threading and multithreaded systems

· Illustrate process synchronization and the concept of Deadlock

· Introduce Memory and Virtual memory management, File system and storage techniques

Textbook 1: Chapter 1, 2.1, 2.3, 2.4, 2.5, 2.6, 2.8, 2.9, 2.10, 3.1, 3.2, 3.3, 3.4 RBT: L1, L2, L3

Textbook 1: Chapter 4.1, 4.2, 4.3, 4.4, 5.1, 5.2, 5.3, 5.4, 5.5, 6.2, 6.3, 6.4, 6.5, 6.6, 6.7 RBT: L1, L2, L3

Textbook 1: Chapter 7, 8.1 to 8.6 RBT: L1, L2, L3

Textbook 1: Chapter 91. To 9.6, 10.1 to 10.5

RBT: L1, L2, L3

Textbook 1: Chapters 12.1 to 12.6, 21.1 to 21.9 RBT: L1, L2, L3

· Apply suitable techniques for the management of different resources

· Use a processor, memory, storage, and file system commands

· Realize the different concepts of OS in the platform of usage through case studies

· Each full Question consisting of 20 marks

· There will be 2 full questions (with a maximum of four sub-questions) from each module.

· Each full question will have sub-questions covering all the topics under a module.

· The students will have to answer 5 full questions, selecting one full question from each module.

2. D.M Dhamdhere, Operating Systems: A Concept-Based Approach 3rd Ed, McGraw- Hill, 2013.

3. P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition, PHI(EEE), 2014.

4. William Stallings Operating Systems: Internals and Design Principles, 6th Edition, Pearson.

MICROCONTROLLER AND EMBEDDED SYSTEMS

· Program ARM controller using the various instructions

· Identify the applicability of the embedded system

· Comprehend the real-time operating system used for the embedded system

ARM Processor Fundamentals: Registers, Current Program Status Register, Pipeline, Exceptions, Interrupts, and the Vector Table, Core Extensions

Textbook 1: Chapter 1 – 1.1 to 1.4, Chapter 2 – 2.1 to 2.5 RBT: L1, L2

ARM programming using Assembly language: Writing Assembly code, Profiling and cycle counting, instruction scheduling, Register Allocation, Conditional Execution, Looping Constructs

Text book 1: Chapter 3:Sections 3.1 to 3.6 ( Excluding 3.5.2), Chapter 6(Sections 6.1 to

6.6)

RBT: L1, L2

The core of an Embedded System including all types of processor/controller, Memory, Sensors, Actuators, LED, 7-segment LED display, stepper motor, Keyboard, Push button switch, Communication Interface (onboard and external types), Embedded firmware, Other system components.

Textbook 2:Chapter 1(Sections 1.2 to 1.6),Chapter 2(Sections 2.1 to 2.6) RBT: L1, L2

Systems, Operational quality attributes, non-operational quality attributes, Embedded

Text book 2: Chapter-3, Chapter-4, Chapter-7 (Sections 7.1, 7.2 only), Chapter-9 (Sections 9.1, 9.2, 9.3.1, 9.3.2 only)

RBT: L1, L2

Textbook 2: Chapter-10 (Sections 10.1, 10.2, 10.3, 10.4 , 10.7, 10.8.1.1, 10.8.1.2, 10.8.2.2,

10.10 only), Chapter 12, Chapter 13 ( block diagram before 13.1, 13.3, 13.4, 13.5, 13.6 only)

RBT: L1, L2

● Apply the knowledge gained for Programming ARM for different applications.

● Interface external devices and I/O with ARM microcontroller.

● Interpret the basic hardware components and their selection method based on the characteristics and attributes of an embedded system.

● Develop the hardware /software co-design and firmware design approaches.

· Demonstrate the need of real-time operating system for embedded system applications

· Each full Question consisting of 20 marks

· There will be 2 full questions (with a maximum of four sub-questions) from each module.

· Each full question will have sub-questions covering all the topics under a module.

· The students will have to answer 5 full questions, selecting one full question from each module.

2. Shibu K V, “Introduction to Embedded Systems”, Tata McGraw Hill Education, Private Limited, 2^nd Edition.

2. The Insider’s Guide to the ARM7 Based Microcontrollers, Hitex Ltd.,1st edition, 2005.

3. Steve Furber, ARM System-on-Chip Architecture, Second Edition, Pearson, 2015.

4. Raj Kamal, Embedded System, Tata McGraw-Hill Publishers, 2nd Edition, 2008.

OBJECT-ORIENTED CONCEPTS

· Set up Java JDK environment to create, debug and run simple Java programs.

· Create multi-threaded programs and event handling mechanisms.

· Introduce event driven Graphical User Interface (GUI) programming using applets and swings.

A Review of structures, Procedure–Oriented Programming system, Object Oriented Programming System, Comparison of Object Oriented Language with C, Console I/O, variables and reference variables, Function Prototyping, and Function Overloading. Class and Objects: Introduction, member functions and data, objects and functions.

Text book 1: Ch 1: 1.1 to 1.9 Ch 2: 2.1 to 2.3 RBT: L1, L2

Objects and arrays, Namespaces, Nested classes, Constructors, Destructors.

Introduction to Java: Java’s magic: the Byte code; Java Development Kit (JDK); the Java Buzzwords, Object-oriented programming; Simple Java programs. Data types, variables and arrays, Operators, Control Statements.

Textbook 1:Ch 2: 2.4 to 2.6Ch 4: 4.1 to 4.2

Text book 2: Ch:1 Ch: 2 Ch:3 Ch:4 Ch:5 RBT: L1, L2

Text book 2: Ch:6 Ch: 8 Ch:10 RBT: L1, L2, L3

Multi Threaded Programming:Multi Threaded Programming: What are threads? How to make the classes threadable; Extending threads; Implementing runnable; Synchronization; Changing state of the thread; Bounded buffer problems, producer consumer problems.

Text book 2: CH: 9 Ch 11: RBT: L1, L2, L3

Adapter classes; Inner classes.

Text book 2: Ch 22: Ch: 29 Ch: 30 RBT: L1, L2, L3

· Develop computer programs to solve real world problems in Java.

· Develop simple GUI interfaces for a computer program to interact with users, and to understand the event-based GUI handling principles using swings.

· Each full Question consisting of 20 marks

· There will be 2 full questions (with a maximum of four sub questions) from each module.

· Each full question will have sub questions covering all the topics under a module.

· The students will have to answer 5 full questions, selecting one full question from each module.

2. Herbert Schildt, Java The Complete Reference, 7th Edition, Tata McGraw Hill, 2007.

2. Herbert Schildt, The Complete Reference C++, 4th Edition, Tata McGraw Hill, 2003.

3. Stanley B.Lippmann, Josee Lajore, C++ Primer, 4th Edition, Pearson Education, 2005.

4. Rajkumar Buyya,S Thamarasi selvi, xingchen chu, Object oriented Programming with java, Tata McGraw Hill education private limited.

5. Richard A Johnson, Introduction to Java Programming and OOAD, CENGAGE Learning.

6. E Balagurusamy, Programming with Java A primer, Tata McGraw Hill companies.

DATA COMMUNICATION

· Explain with the basics of data communication and various types of computer networks;

· Demonstrate Medium Access Control protocols for reliable and noisy channels.

· Expose wireless and wired LANs.

Textbook1: Ch 1.1 to 1.5, 2.1 to 2.3, 3.1, 3.3 to 3.6

RBT: L1, L2

Physical Layer-2: Analog to digital conversion (only PCM), Transmission Modes,

Analog Transmission: Digital to analog conversion.

Textbook1: Ch 4.1 to 4.3, 5.1 RBT: L1, L2

Switching: Introduction, Circuit Switched Networks and Packet switching.

Error Detection and Correction: Introduction, Block coding, Cyclic codes, Checksum,

Textbook1: Ch 6.1, 6.2, 8.1 to 8.3, 10.1 to 10.4 RBT: L1, L2

Media Access control: Random Access, Controlled Access and Channelization, Introduction to Data-Link Layer: Introduction, Link-Layer Addressing, ARP IPv4 Addressing and subnetting: Classful and CIDR addressing, DHCP, NAT Textbook1: Ch 9.1, 9.2, 11.1, 11.2 11.4, 12.1 to 12.3, 18.4

RBT: L1, L2

Wireless LANs: Introduction, IEEE 802.11 Project and Bluetooth.

Other wireless Networks: Cellular Telephony

RBT: L1, L2

· Explain the fundamentals of digital communication and switching.

· Compare and contrast data link layer protocols.

· Summarize IEEE 802.xx standards

· Each full Question consisting of 20 marks

· There will be 2 full questions (with a maximum of four sub questions) from each module.

· Each full question will have sub questions covering all the topics under a module.

· The students will have to answer 5 full questions, selecting one full question from each module.

2013.

2. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007.

3. Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, 4th Edition, Elsevier, 2007.

4. Nader F. Mir: Computer and Communication Networks, Pearson Education, 2007.

DESIGN AND ANALYSIS OF ALGORITHMS LABORATORY

· Employ various design strategies for problem solving.

· Measure and compare the performance of different algorithms.

· Installation procedure of the required software must be demonstrated, carried out in groups and documented in the journal.

(i) USN

(ii) Name

(iii) Programme

(iv) Phone

Write a Java program to create nStudent objects and print the USN, Name, Programme, and Phoneof these objects with suitable headings.

objects of all three categories.

dd/mm/yyyy> and display as <name, dd, mm, yyyy> using StringTokenizer class considering the delimiter character as “/”.

Raise an exception when b is equal to zero.

thread generates a random integer for every 1 second; second thread computes the square of the number andprints; third thread will print the value of cube of the number.

average case and best case.

Greedy method.

using Dijkstra’s algorithm. Write the program in Java.

Kruskal’salgorithm. Use Union-Find algorithms in your program

Prim’s algorithm.

(a) Implement All-Pairs Shortest Paths problem using Floyd’s algorithm.

(b) Implement Travelling Sales Person problem using Dynamic programming.

positive integers whose SUM is equal to a given positive integer d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are two solutions {1,2,6}and {1,8}. Display a suitable message, if the given problem instance doesn’t have a solution.

Graph G of n vertices using backtracking principle.

· Implement a variety of algorithms such assorting, graph related, combinatorial, etc., in a high level language.

· Analyze and compare the performance of algorithms using language features.

· Apply and implement learned algorithm design techniques and data structuresto solve real-world problems.

o For laboratories having only one part: Students are allowed to pick one experiment from the lot with equal opportunity.

o For laboratories having PART A and PART B: Students are allowed to pick one experiment from PART A and one experiment from PART B, with equal opportunity.

· Change of experiment is allowed only once and marks allotted for procedure to be made zero of the changed part only.

· Marks Distribution (Courseed to change in accoradance with university regulations)

e) For laboratories having only one part – Procedure + Execution + Viva-Voce: 15+70+15 =

100 Marks

f) For laboratories having PART A and PART B

i. Part A – Procedure + Execution + Viva = 6 + 28 + 6 = 40 Marks

ii. Part B – Procedure + Execution + Viva = 9 + 42 + 9 = 60 Marks

MICROCONTROLLER AND EMBEDDED SYSTEMS LABORATORY

· Conduct the experiments on an ARM7TDMI/LPC2148 evaluation board using evaluation version of Embedded ‘C’ & Keil Uvision-4 tool/compiler.

evaluation board/simulator and the required software tool.

· Conduct the following experiments on an ARM7TDMI/LPC2148 evaluation board using evaluation version of Embedded ‘C’ & Keil Uvision-4 tool/compiler.

o For laboratories having only one part: Students are allowed to pick one experiment from the lot with equal opportunity.

o For laboratories having PART A and PART B: Students are allowed to pick one experiment from PART A and one experiment from PART B, with equal opportunity.

· Change of experiment is allowed only once and marks allotted for procedure to be made zero of the changed part only.

· Marks Distribution (Courseed to change in accoradance with university regulations)

g) For laboratories having only one part – Procedure + Execution + Viva-Voce: 15+70+15 =

ADDITIONAL MATHEMATICS – II

· To provide essential concepts of linear algebra, second & higher order differential equations along with methods to solve them.

· To provide an insight into elementary probability theory and numerical methods.

CO2: Apply the knowledge of numerical methods in modeling and solving engineering problems. CO3: Make use of analytical methods to solve higher-order differential equations.

CO4: Classify partial differential equations and solve them by exact methods. CO5: Apply elementary probability theory and solve related problems.

· The question paper will have ten full questions carrying equal marks.

· Each full question will be for 20 marks.

· There will be two full questions (with a maximum of four sub-questions) from each module.

· Each full question will have sub- sub-question covering all the topics under a module.

· The students will have to answer five full questions, selecting one full question from each module.