1 Third Semester S.No. Code Course Credits Total credits Contact Hours/week Marks L – T - P CIE SEE Total 1. 15MAT31 Engineering Mathematics -III BS 3 – 1 - 0 4 5 50 50 100 2. 15CS32 Logic Design and Applications PC1 4 – 1 - 0 5 6 50 50 100 3. 15CS33 Unix and Shell Programming PC2 3 – 1 - 0 4 5 50 50 100 4. 15CS34 Computer Organization and Architecture PC3 3– 0 - 0 3 3 50 50 100 5. 15CS35 Data Structures using C PC4 3 – 0 - 0 3 3 50 50 100 6. 15CS36 OOP with Java PC5 3 – 0 - 0 3 3 50 50 100 7. 15CSL37 Data Structures with C Lab(Practical) L1 0 – 0- 1.5 1.5 3 25 25 50 8. 15CSL38 OOP with JAVA Programming Lab ( Practical) L2 0 – 0 – 1.5 1.5 3 25 25 50 9. 15MATDIP1# Bridge course Maths –I (Diploma) MNC Mandatory Non Credit Course Total 25 31 350 350 700 * SEE: SEE (Theory exam) will be conducted for 100marks of 3 hours duration. It is reduced to 50 marks for the calculation of SGPA and CGPA # This course is Mandatory Non - Credit course ( Marks will not be considered) for Diploma lateral entry students. The students have to pass this course before 7 th semester. .
50
Embed
Fourth Semester - Gogte Institute of Technology · Third Semester S.No. Code Course Credits Total credits Contact Hours/week Marks L t T - P CIE SEE Total 1. 15MAT31 Engineering Mathematics
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
1
Third Semester
S.No. Code Course
Credits Total credits
Contact
Hours/week
Marks
L – T - P CIE SEE Total
1. 15MAT31 Engineering
Mathematics -III BS 3 – 1 - 0 4 5 50 50 100
2. 15CS32 Logic Design and
Applications PC1 4 – 1 - 0 5 6 50 50 100
3. 15CS33 Unix and Shell
Programming PC2 3 – 1 - 0 4 5 50 50 100
4. 15CS34 Computer Organization
and Architecture PC3 3– 0 - 0 3 3 50 50 100
5. 15CS35 Data Structures using C PC4 3 – 0 - 0 3 3 50 50 100
6. 15CS36 OOP with Java
PC5 3 – 0 - 0 3 3 50 50 100
7. 15CSL37 Data Structures with C
Lab(Practical) L1 0 – 0- 1.5 1.5 3 25 25 50
8. 15CSL38
OOP with JAVA
Programming Lab
( Practical)
L2 0 – 0 – 1.5 1.5 3 25 25 50
9. 15MATDIP1# Bridge course Maths
–I (Diploma) MNC
Mandatory Non
Credit Course
Total 25 31 350 350 700
* SEE: SEE (Theory exam) will be conducted for 100marks of 3 hours duration. It is reduced to 50 marks for the calculation of SGPA and CGPA
# This course is Mandatory Non - Credit course ( Marks will not be considered) for Diploma lateral entry students. The students have to pass this course before 7th
semester.
.
2
* SEE: SEE (Theory exam) will be conducted for 100marks of 3 hours duration. It is reduced to 50 marks for the calculation of SGPA and CGPA.
# This course is Mandatory Non - Credit course ( Marks will not be considered) for Diploma lateral entry students. The students have to pass this course before 7th
Practical examination (SEE) of 3 hours duration will be conducted for 50 marks. It will be reduced to
25 marks for the calculation of SGPA and CGPA.
Bridge Course Mathematics –I
(Common for all branches)
Subject Code: 15MATDIP1
Credits: 0
Course Type: BS CIE Marks: 50
Hours/week: L – T – P 2-0-0 SEE Marks: 50
Total Hours: 32 SEE Duration: 3 Hours
Course Learning Objectives (CLOs):
Students should
1. Be proficient in Complex number manipulations and representing them in Argand Plane.
2. Understand the concept of Ordinary Differentiation, geometric interpretation and developing
the Taylor’s and Maclaurin’s series
3. Be proficient in Integrating standard functions and Trigonometric functions of integral powers.
4. Be proficient in integrating trigonometric functions of integral powers, multiple integrals and their
applications
Prerequisites:
1.Trigonometry
Unit-I 6 hours
Complex Numbers:
Definitions, complex numbers as an ordered pair, real and imaginary parts, modulus and amplitude of
a complex number, equality of a complex number, polar form, De-Moivre’s theorem.
Unit-II 12 hours
Differentiatial Calculus :Ordinary differentiation : Differentiation of i) standard functions ii) Product
of functions iii) parametric equations. Successive differentiation. Taylor’s series, Maclaurin’s series of
simple functions for single variable
Partial Differentiation: Definition, Euler theorem, total differentiation, differentiation of composite
and implicit funtions, Jacobian illustrative examples and problems.
Unit-III 14 hours
Integral Calculus : Basic Integration of standard functions: Polynomials, Geometric functions and
Trignometric Functions, Integrations by parts. Discuss the conic sections-circle, Parabola, Ellipse and
Hyperbola. Area by single Integrals.
Reduction formulae: Reduction formula for , , (m and n
are positive integers) – Direct, Simple problems .Double and Triple Integrals. Area by Double Integrals
and volume by Triple Integrals.
Text Books:
1. Higher Engineering Mathematics- B. S. Grewal
2. Engineering Mathematics- H. K. Dass
Course Outcomes (COs): At the end of the course student will be able to:
1. Represent Complex numbers geometrically in Argand Plane. [L2]
2. Differentiate functions of single variable, Apply to develop the Taylors and Maclaurins series [L2,
L3]
3. Integrate standard functions and find area by integrals[L3]
4. Integrate trigonometric functions of integral powers and apply double and triple integrals to find
area and volume. [L3]
Program Outcomes (Pos) of the course:
1. An ability to apply knowledge of Mathematics, science and Engineering. [PO1]
2. An ability to identify, formulate and solve engineering problems. [PO5]
3. An ability to use the techniques, skills and modern engineering tools necessary for
engineering practice. [PO11]
Scheme of Continuous Internal Evaluation (CIE):
Components Maximum of Two tests
Maximum marks 50
*Students have to score minimum 20 marks in CIE to appear for SEE
Scheme of Semester End Examination (SEE):
* Question paper contains 08 questions each carrying 20 marks.
* Students have to answer any FIVE full questions.
* SEE will be conducted for 100 marks of three hours duration. It will be reduced to 50
marks.
Note: Students have to pass Bridge Course Mathematics – I (15BCMAT31) before
advancing to 7th
semester
Semester IV
Engineering Mathematics-IV
(Computer Science / Information Science)
Subject Code: 15MAT41CS/IS
Credits: 4
Course Type: BS CIE Marks: 50
Hours/week: L – T – P 3 –1– 0 SEE Marks: 50
Total Hours: 50 SEE Duration: 3 Hours
Course Learning Objectives (CLOs):
Students should
1. Learn the concept of Interpolation and use appropriately.
2. Understand and apply the Logic of mathematics in the field of Computer science.
3. Understand the concept of Functions and Relations.
4. Get acquainted with basic concepts of Graph Theory and their applications.
5. Get acquainted with different Algebraic Structures, Prime number and their properties for
applications in Cryptography.
Prerequisites:
1. Set Theory
Unit-I 10 hours
Finite Differences and Interpolation:, For ard a d Ba k ard differe es, Ne to ’s For ard a d Ba k ard I terpolatio For ulae, Di ided Differe e, Ne to ’s Di ided Differe e For ula
(without proof). Lagra ge’s I terpolatio For ula. Illustrative examples. Numerical Integration:
2. Kol a , Bus y, Ross Dis rete Mathe ati al “tru tures , th Edition Prentice Hall of India,
2010.
3. William Stallings –Cryptography and Network Security, Pearson Prentice Hall 6th
Edition,2013.
4. Dr. D. S. Chandrasekharaih, Graph Theory a d Co i atori s , Pris Books P t. Ltd, th
Edition, 2012
5. Dr. D. S.Chandrasekharaih, Dis rete Mathe ati al “tru tures , Pris Books P t. Ltd, th
Edition, 2012
Reference Books:
1. Erwin Kreyszig –Advanced Engineering Mathematics, John Wiley & Sons Inc., 9th
Edition,
2006
2. Peter V. O’ Neil – Advanced Engineering Mathematics, Thomson Brooks/Cole, 7th
Edition,
2011.
3. Glyn James – Advanced Modern Engineering Mathematics, Pearson Education, 4th
Edition,
2010.
4. Ralph P Gri aldi, Dis rete and Co i atorial Mathe ati s , th Edition, Pearson
Education, 2004
Course Outcomes (COs): At the end of the course students will be able to:
1. Use Finite differences in Interpolation.[L3]
2. Understand and Apply the Logic of mathematics in the field of Computer science [L2,L3]
3. Explain and Analyze different Relations Functions.[L2, L3]
4. Understand basic concepts of Graph Theory and Use in Computer Science. [L2, L3]
5. Explain the concept of Finite Fields and Apply in Cryptograhy. [L2,L3]
Program Outcomes (POs) of the course: Students will acquire
1. An ability to apply knowledge of Mathematics, science and Engineering. [PO1]
2. An ability to identify, formulate and solve engineering problems. [PO5]
3. An ability to use the techniques, skills and modern engineering tools necessary for
engineering practice. [PO11]
Scheme of Continuous Internal Evaluation (CIE):
Components Average of
best two tests
out of three
Average of
two
Assignments/
Mathematical
/Computation
al/Statistical
tools of 4 labs
in a semester
Quiz/Seminar/
Project
Class
Participation
Total
Marks
Maximum 25 10 10 5 50
Scheme of Semester End Examination (SEE):
* Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE
full questions.
* SEE question paper will have Two compulsory questions and choice will be given to
remaining three units.
* SEE will be conducted for 100 marks of three hours duration. It will be reduced to 50 marks
for the calculation of SGPA and CGPA.
IV Semester
Operating Systems
Course Code 15CS42 Credits 3
Course type PC CIE Marks 50
Hours/week: L-T-P 3-0-0 SEE Marks 50
Total Hours: 38 SEE Duration 3 Hours for 100 Marks
Course learning objectives(CLOs):
CLO 1: To introduce the functions of operating system, design, structure and associated system
calls.
CLO 2: To study and analyze various scheduling algorithms and process synchronization
techniques.
CLO 3: To develop an understanding about deadlocks and deadlock recovery techniques.
CLO 4: To discuss and realize the importance memory management techniques.
CLO 5: To gain the knowledge of file systems and secondary storage structures.
Prerequisites: Basic Electronics, Basic knowledge of computer concepts & programming.
Unit I 7 Hours
Introduction to Operating Systems: System structures: What operating systems do; Computer System
organization; Computer System architecture; Operating System structure; Operating System operations;
Process management; Memory management; Storage management; Protection and security;
Distributed system; Operating System Services; User - Operating System interface; System calls; Types of
system calls; Operating System design and implementation; Operating System structure; Virtual
machines; System boot.
Self Learning Topics: Operating System structure; Virtual machines; System boot. (2 Hours)
Unit II 8 Hours
Process Management: Process concept; Process scheduling; Operations on processes; Multi-Threaded
Programming: Overview; Multithreading models; Process Scheduling: Basic concepts; Scheduling
criteria; Scheduling algorithms.
Process Synchronization: “y hro izatio : The Criti al se tio pro le ; Peterso ’s solutio ; Synchronization hardware; Semaphores; Classical problems of synchronization.
Unit III 7 Hours
Deadlocks: Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks;
Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
3. To demonstrate the important HTML tags for designing static pages and separate design from
content using Cascading Style sheet. [L 2]
4. To summarize the concepts of JavaScript and XML. [L 5]
5. To compose web application development programming and scripting languages, PHP and
CSS, mysql etc. and identify the environments currently available on the market to design web
sites. [L 5]
6. To demonstrate the application of MVC framework in a web application. [L 2]
Program Outcomes (POs) of the course:
1. An ability to understand the basic concepts of Internet programming and protocols used. [PO1]
2. To create applications using HTML, XHTML, CSS and Java Script. [PO2]
3. To develop web applications using php. [PO3]
4. To work with mysql, Web Database interaction with php. [PO4]
Scheme of Continuous Internal Evaluation (CIE):
Components Average of best
two tests out of
three
Average of two
assignments Quiz/Seminar/
Project
Class
participation
Total
Marks
Maximum
Marks 25 10 10 5 50
Scheme of Semester End Examination (SEE):
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will be given in
the remaining three units. (Kindly incorporate/mention the changes in the pattern of SEE question paper,
if required, based on the content of course)
IV SEMESTER
Design and Analysis of Algorithm
Course Code 15CS44 Credits 03
Course type PC CIE Marks 50
Hours/week: L-T-P 3-0-0 SEE Marks 50
Total Hours: 39 SEE Duration 3 Hours for 100 Marks
Course learning objectives (CLOs):
CLO 1: To discuss the importance of the study of algorithms.
CLO 2: To study and analyze time complexity of various algorithms
CLO 3: To discuss various algorithm design techniques.
CLO 4: To develop an understanding among the working of the efficient algorithms.
CLO 5: To discuss various string matching algorithms
Prerequisites:
Basic computer science concepts such as procedures, decision statements, and loops.
Basic data structures such as lists, dictionaries, and hash tables.
Basics of Graph theory
Unit I 8 Hours
Introduction: Fundamentals of Algorithmic Problem Solving, Analysis Framework, Asymptotic Notations
and basic efficiency classes, Mathematical Analysis of Non-Recursive and Recursive Algorithms, Brute
Force Approaches: Introduction, Selection Sort, linear search.
Self Learning: Short Tutorial on Recurrence Relations, Bubble Sort( 1Hr)
Unit II 8 Hours
Divide and Conquer: Divide and Conquer technique, Binary Search, Merge Sort, Quick Sort and their
performance comparison.
Decrease-and-Conquer: Decrease and Conquer techniques, Insertion Sort, Depth First Search and
Breadth First Search
Transform and Conquer: T a sfo a d Co ue St ategy, Heaps a d Heap So t, Ho e ’s Rule a d Binary Exponentiation.
Self Learning: Multiplicatio of Large I tegers a d Strasse ’s Matrix Multiplicatio (2 Hrs)
Unit III 8 Hours
The Greedy Method: The General Method, Knapsack Problem, Minimum-Cost Spa i g T ees: P i ’s Algo ith , Si gle Sou e Sho test Paths: Dijkst a’s Algorithm, Bellman-Ford Algorithm, Huffman Trees.
Self Learning: Kruskal’s Algorith ( 1 Hr)
Unit IV 8 Hours
Dynamic Programming: The Ge e al Method, Wa shall’s Algo ith , Floyd’s Algo ith fo the All-Pairs
Shortest Paths Problem, Single-Source Shortest Paths: General Weights, 0/1 Knapsack, The Traveling
Salesperson problem.
Self Learning: String Editing (1 Hr)
Unit V 7 Hours
String Matching: Input Enhancement in String Matching, Rabin- Karp Algorithm
Backtracking: n - Quee s’s p o le , Ha ilto ia Ci uit P o le , Su set –Sum Problem.
1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical reasoning and
engineering. [PO1]
2. Graduates will demonstrate the ability to identify, formulate and solve computer systems
engineering problems [PO2]
3. Graduates will demonstrate an ability to analyze the given problems and design solutions, as per
the needs and specifications. [PO4]
4. Graduates will develop confidence for self education and ability for lifelong learning. [PO10]
5. Graduate will be capable of participating and succeeding in competitive examinations. [PO11]
Scheme of Continuous Internal Evaluation (CIE):
Components Average of best
two tests out of
three
Average of two
assignments Quiz/Seminar/
Project
Class
participation
Total
Marks
Maximum
Marks 25 10 10 5 50
Scheme of Semester End Examination (SEE):
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will be given
in the remaining three units.
IV Semester
Microprocessor and Microcontroller
Course Code: 15CS45 Credits: 3
Course Type: PC CIE Marks: 50
Hours/week: L – T – P 3 – 0 – 0 SEE Marks: 50
Total Hours: 38 SEE Duration: 3 Hours for 100 Marks
Course Learning Objectives (CLOs):
CLO 1: To study the i ter al ar hite ture of I tel s 8 8 i ropro essor a d 8 Mi ro o troller. CLO 2: To develop the skill of designing and writing assembly language programs for 8086
Microprocessor.
CLO 3: To program the 8051 microcontroller for Timers, Serial Ports and Interrupts in C.
CLO 4: To present the techniques of interfacing the LCD, Keyboard, ADC, DAC and Sensors with 8051
Microcontroller.
Prerequisites:
Basic Electronics
Computer Organization & Architecture
Logic Design & Applications
Unit I 7 hours
8086 Microprocessor Architecture:
Overview of microcomputer structure and operation, , 8086 internal architecture, introduction
to programming the 8086 microprocessor, data and memory addressing modes of 8086 microprocessor.
Self Learning: Microprocessor evolution and types, the 8086 microprocessor family overview (1 Hr)
Unit II 8 hours
Instruction Set and Programming of 8086 microprocessor:
Instruction set of 8086 microprocessor, , Instruction template with example of MOV instruction,
writing simple assembly language program, delay calculation and programming, interfacing RAM to
8086 microprocessor.
Self Learning: Assembler Directives (1 Hr)
Unit III 7 hours
Introduction to 8051 Microcontroller:
Internal architecture of 8051 microcontroller, 8051 programming model, Data types and time
delay in 8051 C, I/O Programming in 8051 C, Logic operations in 8051 C, Data conversion programs in
8051 C.
Self Learning: Accessing code ROM space in 8051 C, Data serialization using 8051 C (2 Hrs)
Unit IV 8 hours
Timer, Serial Port and Interrupt Programming in 8051 C:
Programming 8051 timers, counter programming, programming timers 0 and 1 in 8051 C, basics
of serial communication, 8051 connection to RS232, serial port programming in C. 8051 interrupts,
programming timer interrupts, programming external hardware interrupts, programming serial
communication interrupt,
Self Learning: Interrupt priority in 8051 C, interrupt programming in C (2 Hrs)
1. It will be conducted for 100 marks of 3 hours duration. It will be reduced to 50 marks for the
calculation of SGPA and CGPA.
2. Question paper contains 08 questions each carrying 20 marks. Students have to answer FIVE full
questions. SEE question paper will have two compulsory questions (any 2 units) and choice will be given in
the remaining three units.
IV Semester
Design and Analysis of Algorithms Laboratory
Course Code 15CSL47 Credits 1.5
Course Type PC CIE 25
Hours/week: L-T-P 0-0-3 SEE Marks: 25
Total Hours 40 SEE Duration: 03 Hours
Course learning objectives(CLOs):
CLO 1. Illustrate the importance of algorithms in a variety of applications.
CLO 2. Illustrate the use of recursive/iterative sort algorithms in different scenarios.
CLO 3. Demonstrate time complexity of various algorithms using various design techniques.
CLO 4. Demonstrate efficient algorithms by drawing comparisons.
CLO 5. Illustrate the use of algorithms for graph search problems.
Prerequisites:
Basic computer science concepts such as procedures, decision statements, and loops.
Basic data structures such as lists, dictionaries, and hash tables.
Platforms:
C/Java Language in LINUX /Windows environment.
List of Programs:
1. Implement Insertion Sort algorithm and determine the time required to sort the elements.
Repeat the experiment for different values of n, the number of elements in the list to be sorted
and plot a graph of the time taken versus n.
2. Implement Heap Sort algorithm and determine the time required to sort the elements. Repeat
the experiment for different values of n, the number of elements in the list to be sorted and plot
a graph of the time taken versus n.
3. Implement Quick Sort algorithm and determine the time required to sort the elements. Repeat
the experiment for different values of n, the number of elements in the list to be sorted and plot
a graph of the time taken versus n.
4. Implement Merge Sort algorithm to sort a given set of elements and determine the time
required to sort the elements. Repeat the experiment for different values of n, the number of
elements in the list to be sorted and plot a graph of the time taken versus n.
5. Implement 0/1 Knapsack problem using Dynamic Programming.
6. From a given vertex in a weighted connected graph, find shortest paths to other vertices using
Dijkstra's algorithm.
7. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm.
8. Find a subset of a given set S = {sl, s2,.....,sn} of n 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}. A suitable message is to be displayed if the given problem instance
doesn't have a solution.
9. Find the Mi i u Cost Spa i g Tree of a give u directed graph usi g Pri ’s algorith .
10. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.
11. Implement DFS algorithm and check if the graph is connected.
12. Implement N Queen's problem using Back Tracking.
Course Outcome (COs):
Upon completion of the course the students will be able to:
1. Identify and implement an appropriate algorithm design technique for a given problem.[L1]
2. Implement and Compute time required for recursive and iterative algorithms.[L3]
3. Design algorithms for specific applications using appropriate techniques.[L6]
4. Design graph search and sorting algorithms.[L6]
Program Outcomes (POs) of the course:
1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical reasoning and
engineering. [PO1]
2. Graduates will demonstrate the ability to identify, formulate and solve computer systems
engineering problems [PO2]
3. Graduates will demonstrate an ability to analyze the given problems and design solutions, as per
the needs and specifications. [PO4]
4. Graduates will develop confidence for self education and ability for lifelong learning. [PO10]
5. Graduate will be capable of participating and succeeding in competitive examinations. [PO11]
Scheme of Continuous Internal Evaluation (CIE):
CIE
Conduct of lab 10
25 Journal writing 10
Lab test 5
Scheme of Semester End Examination (SEE):
SEE
Initial write up 2*10 = 20
50 Conduct of experiments 2*10 = 20
Viva- voce 10
Practical examination (SEE) of 3 hours duration will be conducted for 50 marks. It will be reduced to
25 marks for the calculation of SGPA and CGPA.
IV Semester
Microprocessor and Microcontroller Laboratory
Subject Code: 15CSL48 Credits: 1.5
Course Type: PC CIE Marks: 25
Hours/week: L – T – P 0-0-3 SEE Marks: 25
Total Hours: 40 SEE Duration: 3 Hours
Course Learning Objectives (CLOs):
CLO 1: To develop the skill of designing and writing assembly language programs for 8086
Microprocessor.
CLO 2: To present the techniques of interfacing the LCD, ADC, DAC and stepper motor with 8051
Microcontroller in C.
Prerequisites:
Basic Electronics
Computer Organization & Architecture
Logic Design & Applications
List of Experiments:
PART A
1. a) Write a ALP to add N u sig ed i ar u ers a d store result i the e or lo atio SUM.
b) Write an ALP to perform block data transfer from LOC1 to LOC2.
2. Write an ALP to find GCD and LCM of two 8-bit unsigned numbers.
3. Write an ALP to find largest and smallest number in an array and store in memory location.
4. Write an ALP to calculate the function y= 4 +10, here is u sig ed 8 it binary
number.
5. Write a ALP to ou t u er of s i a gi e it i ar u er. 6. Write an ALP to sort unsigned 16-bit binary numbers in ascending/descending order using
bubble sort.
7. Write an ALP to find factorial of a single digit unsigned integer using recursive procedure.
8. Write an ALP to illustrate the significance of Procedures and Macros.
PART B
1. Write 8 C progra to i terfa e stepper otor to rotate the otor i spe ified dire tio (clockwise or counter-clockwise) by N steps. Introduce suitable delay between successive steps.
2. Write 8 C progra to ge erate the follo i g a efor s usi g DAC i terfa e
i) Square/ Rectangular
ii) Triangular
3. Write 8 C progra to ge erate the follo i g a efor s usi g DAC i terfa e
i) Staircase
ii) Sine
4. Write 8 C progra to i terfa e LCD displa to displa the stri g GITC“E . 5. Write 8 C progra to i terfa e ADC to o ert a alog i put to digital.
Text Book:
1. Douglas V Hall: Microprocessors and Interfacing, 2nd
Edition, The McGraw-Hill Companies.
2. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay: The 8051 Microcontroller and
Embedded Systems Using Assembly and C, 2nd
Edition, Pearson Prentice Hall.
Reference Books:
1. Barry B Brey: The Intel Microprocessors, 8thEdition, Pearson Education, 2009
2. Kenneth Ayala: The 8051Microcontroller, 3rd
Edition, Cengage Learning.
Course Outcomes (COs):
At the end of the course student should be able to:
1. Design and write the assembly language programs for simple computing tasks using 8086
Microprocessor. [L3]
2. Demonstrate the a ilit to rite a d de elop C progra s to i terfa e LCD, ADC/ DAC a d Stepper motor using 8051 Microcontroller.[L3]
Program Outcomes (POs) of the course:
1. Graduates will demonstrate the knowledge of mathematics, basic sciences, logical reasoning
and engineering. [PO1]
2. Graduates will demonstrate the ability to design and experiment both in hardware and
software, analyze and interpret data. [PO3]
3. Graduates will develop confidence for self education and ability for lifelong learning. [PO10]
4. Graduate will be capable of participating and succeeding in competitive examinations. [PO11]
Scheme of Continuous Internal Evaluation (CIE):
CIE
Conduct of lab 10
25 Journal writing 10
Lab test 5
Scheme of Semester End Examination (SEE):
SEE
Initial write up 2*10 = 20
50 Conduct of experiments 2*10 = 20
Viva- voce 10
Practical examination (SEE) of 3 hours duration will be conducted for 50 marks. It will be reduced to
25 marks for the calculation of SGPA and CGPA.
Principles of Engineering Design 15PED49
Syllabus yet to be finalized
Bridge Course Mathematics -II
Subject Code: 15MATDIP2
Credits: 0
Course Type: BS CIE Marks: 50
Hours/week: L – T – P 2-0-0 SEE Marks: 50
Total Hours: 32 SEE Duration: 3 Hours
Course Learning Objectives (CLOs):
Students should
1. Study the properties of Straight Lines and Planes in space.
2. Understand the geometry of Vectors and also the geometrical and physical
interpretation
of their derivatives.
3. Be proficient in Laplace Transforms and solve problems related them.
4. Get acquainted with Inverse Laplace Transform and solution of differential equations.
Prerequisites:
1. Trigonometry
2. Basic Differentiation
3. Basic Integration
Detailed Syllabus
Unit-I 12 hours
Linear Algebra:
Rank of a matrix by elementary transformation, Solution of system of linear equations-
Gauss Jordan method and Gauss-seidal method. Eigen values and Eigen vectors, Largest