3 Sem Mdu Syllabus
3 Sem Mdu Syllabus
3 Sem Mdu Syllabus
Python
4 PCC-CSE-207G 3 0 0 3 3 25 75 100 3
Programming
Mathematics - III
(Multivariable
BSC-MATH-
5 Calculus and 2 0 0 2 2 25 75 100 3
203G
Differential
Equations)
Economics for
6 HSMC-01G 3 0 0 3 3 25 75 100 3
Engineers
Database
7 LC-CSE-209G Management 0 0 3 3 1.5 25 25 50 3
Systems LAB
Digital Electronics
8 LC-ESC-211G 0 0 3 3 1.5 25 25 50 3
LAB
Python
10 LC-CSE-215G 0 0 3 3 1.5 25 25 50 3
Programming LAB
Total 23 800
Database Management System
Coursecode PCC-CSE-201G
Category Professional Core Course
Coursetitle Database Management System
L T P Credits
Scheme and Credits Semester 3
3 0 3
Class work 25 Marks
Exam 75 Marks
Total 100 Marks
Duration of Exam 03 Hours
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one
will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15 marks each
to be set by taking two questions from each unit. The students have to attempt five questions in
total, first being compulsory and selecting one from each unit.
Unit: 1
Database system architecture: Data Abstraction, Data Independence, Data Definition
Language(DDL),DataManipulationLanguage(DML). Data models: Entity-
relationshipmodel,networkmodel,relationalandobjectorienteddata models, integrityconstraints,
datamanipulation operations.
Unit: 2
Relationalquerylanguages:Relationalalgebra,Tuple anddomainrelationalcalculus,SQL3, DDL and
DML constructs, Open source and Commercial DBMS - MYSQL, ORACLE, DB2, SQL server.
Relational database design: Domain and data dependency, Armstrong's axioms,Normal forms,
Dependency preservation, Lossless design.
Query processing and optimization: Evaluation of relational algebra expressions,
Queryequivalence, Join strategies, Query optimization algorithms.
Unit: 3
Storage strategies: Indices, B-trees, hashing,
Transaction processing: Concurrency control, ACID property, Serializability ofscheduling,
Locking and timestamp based schedulers, Multi-version and optimistic Concurrency Control
schemes, Database recovery.
Unit: 4
Database Security: Authentication, Authorization and access control, DAC, MAC andRBAC
models, Intrusion detection, SQL injection.
Advanced topics: Object oriented and object relational databases, Logical databases,
Webdatabases, Distributed databases, Data warehousing and data mining.
Suggested books:
“Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F. Korth, S.
Sudarshan, McGraw-Hill.
Course Outcomes
1. For a given query write relational algebra expressions for that query and optimize the
developed expressions
2. For a given specification of the requirement, design the databases using E R method and
normalization.
3. For a given specification, construct the SQL queries for Open source and Commercial
DBMS -MYSQL, ORACLE, and DB2.
4. For a given query optimize its execution using Query optimization algorithms
5. For a given transaction-processing system, determine the transaction atomicity,
consistency, isolation, and durability.
6. Implement the isolation property, including locking, time stamping based on
concurrency control and Serializability of scheduling.
Data Structure & Algorithms
Coursecode PCC-CSE-203G
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one
will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15 marks each
to be set by taking two questions from each unit. The students have to attempt five questions in
total, first being compulsory and selecting one from each unit.
Unit 1:
Introduction: Basic Terminologies: Concept of Data Structure, Choice of right Data Structure,
Algorithms , how to design and develop algorithm , Complexity of algorithm. Operations:
insertion, deletion, traversal etc.; Analysis of an Algorithm, Searching: Linear Search and Binary
Search Techniques and their complexity analysis.
Unit 2:
Stacks and Queues: Stack and its operations: Algorithms and their complexity analysis,
Applications of Stacks: Expression Conversion and evaluation -corresponding algorithms and
complexity analysis. queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue;
Operations on each types of Queues: Algorithms and their analysis.
Unit 3:
Linked Lists: Singly linked lists: Representation in memory, Algorithms of several operations:
Traversing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack and
Queue, Header nodes, Doubly linked list: operations on it and algorithmic analysis; Circular Linked
Lists: all operations their algorithms and the complexity analysis.
Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded BinaryTree,
Binary Search Tree, AVL Tree; Tree operations on each of the trees and their algorithms with
complexity analysis. Applications of Binary Trees. B Tree, B+ Tree: definitions, algorithms and
analysis.
Unit 4:
Sorting and Hashing: Objective and properties of different sorting algorithms:Selection Sort,
Bubble Sort, Insertion Sort, Selection Sort Quick Sort, Merge Sort, Heap Sort; Performance and
Comparison among all the methods.
Graph: Basic Terminologies and Representations, Graph search and traversal algorithms
andcomplexity analysis.Minimum Spanning Tree: Kruskal’s Algorithm, Prim’s Algorithm.
Suggested books:
Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark
Allen Weiss, Addison-Wesley Publishing Company
“How to Solve it by Computer”, 2nd Impression by R.G. Dromey, Pearson Education.
Course outcomes
1. For a given algorithm student will able to analyze the algorithms to determine the
time and computation complexity and justify the correctness.
2. For a given Search problem (Linear Search and Binary Search) student will able to
implement it.
3. For a given problem of Stacks, Queues and linked list student will able to implement
it and analyze the same to determine the time and computation complexity.
4. Student will able to write an algorithm Selection Sort, Bubble Sort, Insertion Sort,
Quick Sort, Merge Sort, Heap Sort and compare their performance in term of Space
and Time complexity.
5. Student will able to implement Graph search and traversal algorithms and determine
the time and computation complexity.
DIGITAL ELECTRONICS
Coursecode PCC-CSE-205G
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one
will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15 marks each
to be set by taking two questions from each unit. The students have to attempt five questions in
total, first being compulsory and selecting one from each unit.
UNIT1:
FUNDAMENTALSOFDIGITAL SYSTEMSAND LOGICFAMILIES
Digitalsignals,digital circuits,AND, OR,NOT, NAND, NORand Exclusive-ORoperations,
Booleanalgebra,examples ofICgates,numbersystems-binary, signed binary, octal hexadecimal
number,binary arithmetic,one’sandtwo’scomplementsarithmetic,codes,error detectingand
correctingcodes.
UNIT2:
COMBINATIONAL DIGITALCIRCUITS
Standardrepresentationfor logicfunctions,K-maprepresentation,and simplificationoflogic
functionsusingK-map,minimizationoflogicalfunctions.Don’tcareconditions,Multiplexer, De-
Multiplexer/Decoders,Adders,Subtractors,BCDarithmetic,carry lookaheadadder,serial
adder,ALU,elementaryALUdesign,popularMSI chips,digitalcomparator,parity
checker/generator,codeconverters,priorityencoders,decoders/drivers fordisplay devices,Q-M
method of function realization.
UNIT3:
SEQUENTIAL CIRCUITSAND SYSTEMS
A1-bitmemory,thecircuitpropertiesofBistablelatch,theclockedSRflipflop, J-K-TandD
typesflipflops,applicationsof flipflops,shift registers,applicationsof shiftregisters, serialto
parallelconverter, paralleltoserialconverter,ringcounter, sequencegenerator,ripple
(Asynchronous)counters, synchronouscounters,counters design using flipflops, specialcounter
IC’s,asynchronous sequential counters, applications of counters.
UNIT4:
A/D ANDD/A CONVERTERS
Digitaltoanalog converters: weightedresistor/converter,R-2RLadderD/Aconverter,
specificationsforD/Aconverters,examplesofD/AconverterlCs,sampleandholdcircuit, Analogto
digital converters: quantization and encoding, parallel comparator A/Dconverter,
successiveapproximationA/Dconverter,countingA/Dconverter,dualslopeA/Dconverter,
SEMICONDUCTOR MEMORIES AND PROGRAMMABLE LOGIC DEVICES
Memoryorganization and operation, expandingmemorysize, classificationand characteristics of
memories, sequential memory, read only memory (ROM), read and write memory(RAM),
contentaddressablememory (CAM),ROMasaPLD,Programmablelogicarray,Programmablearray
logic,complex Programmable logic devices (CPLDS), Field Programmable GateArray(FPGA).
CourseOutcomes:
REFERENCES:
Coursecode PCC-CSE-207G
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one
will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15 marks each
to be set by taking two questions from each unit. The students have to attempt five questions in
total, first being compulsory and selecting one from each unit.
Detailed contents:
Unit 1:
Introduction: Installing Python; basic syntax, interactive shell, editing, saving, and running a
script; data types; variables, assignments; numerical types; arithmetic operators and expressions;
Loops and selection statements, Control statementsString manipulations: subscript operator,
indexing, slicing a string; text files: reading/writing text and numbers from/to a file; creating and
reading a formatted file
Unit 2: Lists, dictionary and Design with functions: Basic list operators, replacing, inserting,
removing an element; searching and sorting lists; dictionary literals, adding, and removing keys,
accessing and replacing values; traversing dictionaries. Hiding redundancy, complexity; arguments
and return values; Program structure and design. Recursive functions.
Unit 3: Simple graphics and image processing: Simple graphics, Turtle operations, Manipulating
turtle screen, Drawing two dimensional shapes, examining an object attributes, Taking a random
walk, Color and RGB scheme, Image processing: Image manipulation operations, properties of
images, image module, copying, blurring and reducing image. Graphical User Interfaces: Terminal
based and GUI based programs,Simple GUI-Based Programs, Windows and Window Components,
Input and Output with Entry Fields, Defining and Using Instance Variables, Other Useful GUI
Resources.
Unit 4: Object Oriented concepts: Classes and OOP: classes, objects, attributes and methods;
defining classes; design with classes, data modelling; persistent storage of objects, Inheritance,
polymorphism, operator overloading; abstract classes; exception handling, try block.
Multithreading: Threads and Processes,Sleeping Threads,Producer, Consumer, and
Synchronization,The Readers and Writers Problem, SharedCell Class,Thread-Safe Class
Course outcomes
For a given conceptual problem student will able to analyze the problem and write a
program in python with basic concepts.
For a given problem of Strings and texts, student will able to analyze the problem and
write a program in python with basic concepts involving strings and texts.
The knowledge of list and dictionary will enable student to implement in python language
and analyze the same.
Student will able to write a program using functions to implement the basic concepts of
object oriented programming language
Suggested books:
Coursecode BSC-MATH-203G
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one
will have 6 parts of 2.5 marks each from all units and remaining eight questions of 15 marks each
to be set by taking two questions from each unit. The students have to attempt five questions in
total, first being compulsory and selecting one from each unit.
Unit-I
Multivariable Differential Calculus: Limit, Continuity and Partial derivatives, Homogeneous
functions, Euler’s Theorem, Total derivative, Maxima, Minima and Saddle points, Lagrange’s
method of undetermined multipliers
Unit-II
Multivariable Integral Calculus: Double integral, Change of order of integration, Change of
variables, Applications of double integral to find area enclosed by plane curves, Triple integral
Unit-III
Ordinary Differential Equations of first order: Linear and Bernoulli’s equations, Exact differential
equations, Equations reducible to exact differential equations, Applications of differential
equations of first order and first degree to simple electric circuits, Newton’s law of cooling, Heat
flow and Orthogonal trajectories
Unit-IV
Ordinary Differential equations of second and higher order: Linear differential equations of
second and higher order, Complete solution, Complementary function and Particular integral,
Method of variation of parameters to find particular integral, Cauchy’s and Legendre’s linear
equations, Simultaneous linear differential equations with constant coefficients, Applications of
linear differential equations to oscillatory electric circuits
Reference Books:
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, Pearson Education.
2. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons.
3. B. V. Ramana, Higher Engineering Mathematics, Tata McGraw-Hill Publishing Company
Limited.
4. N. P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications.
5. B. S. Grewal, Higher Engineering Mathematics, Khanna Publishers.
6. W. E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value
Problems,Wiley India.
7. S. L. Ross, Differential Equations, Wiley India.
8. E. A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall India.
9. E. L. Ince, Ordinary Differential Equations, Dover Publications
Course Outcomes
The students will learn:
1. To deal with functions of several variables and evaluate partial derivative.
2. The mathematical tools needed in evaluating multiple integrals and their usage.
3. The effective mathematical tools for the solutions of ordinary differential equations that
model physical processes.
ECONOMICSFORENGINEERS
CourseObjectives:
1.Acquaintthestudentstobasicconceptsofeconomicsandtheiroperationalsignificance.
2.Tostimulatethestudentstothinksystematicallyandobjectivelyabout contemporary
economicproblems.
UNIT-1
Demand- Meaning of Demand, Law of Demand, Elasticity of Demand- meaning,factors effecting it,
its practical application and importance,
UNIT 2
Production- Meaning of Production and factors of production, Law of variable proportions, and
Returns to scale, Internal external economies and diseconomies of scale. Various concepts of cost
of production- Fixed cost, Variable cost, Money cost, Realcost, Accounting cost, Marginal cost,
Opportunity cost. Shape of Average cost, Marginal cost, Total cost etc. in short run and long run.
UNIT-3
Market- Meaning of Market, Types of Market- Perfect Competition, Monopoly,
Monopolistic Competition and Oligopoly (main features).
Supply- Supply and law of supply, Role of demand & supply in price determination andeffect of
changes in demand and supply on prices.
UNIT-4
Indian Economy- Nature and characteristics of Indian economy as under developed,developing
and mixed economy (brief and elementary introduction), Privatization - meaning, merits and
demerits.
Globalization of Indian economy - merits and demerits.
Banking- Concept of a Bank, Commercial Bank- functions, Central Bank- functions,Difference
between Commercial & Central Bank.
COURSEOUTCOMES:
1.Thestudentswillabletounderstandthebasicconceptofeconomics.
2.Thestudentwillabletounderstandtheconceptofproductionandcost.
3.Thestudentwillabletounderstandtheconceptofmarket.
4.Thestudentwillabletounderstandtheconceptofprivatization,globalizationandbanks.
REFERENCES:
1.JainT.R.,EconomicsforEngineers,VKPublication.
2.ChopraP.N.,PrincipleofEconomics,KalyaniPublishers.
3.DewettK.K.,Moderneconomictheory,S.Chand.
4.H.L.Ahuja.,Moderneconomictheory,S.Chand.
5.DuttRudar&SundhramK.P.M.,IndianEconomy.
6.MishraS.K.,ModernMicroEconomics,PragatiPublications.
7.SinghJaswinder,ManagerialEconomics,dreamtechpress.
8.ATextBookofEconomicTheoryStonierandHague(Longman’sLandon).
9.MicroEconomicTheory–M.L.Jhingan(S.Chand).
10.MicroEconomicTheory-H.L.Ahuja(S.Chand).
11.ModernMicroEconomics:S.K.Mishra(PragatiPublications).
12.EconomicTheory-A.B.N.Kulkarni&A.B.Kalkundrikar(R.Chand& Co).
Database Management System Lab
Course Objectives:
Contents:
i. Creation of a database and writing SQL queries to retrieve information from the database.
ii. Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records based
on
conditions.
iii. Creation of Views, Synonyms, Sequence, Indexes, Save point.
iv. Creating an Employee database to set various constraints.
v. Creating relationship between the databases.
vi. Study of PL/SQL block.
vii. Write a PL/SQL block to satisfy some conditions by accepting input from the user.
viii. Write a PL/SQL block that handles all types of exceptions.
ix. Creation of Procedures.
x. Creation of database triggers and functions
xi. Mini project (Application Development using Oracle/ MySQL)
a) Inventory Control System
b) Material Requirement Processing.
c) Hospital Management System.
d) Railway Reservation System.
e) Personal Information System.
f) Web Based User Identification System.
g) Time Table Management System.
h) Hotel Management
Digital Electronics Lab
Objectives
To write, test, and debug simple Python programs.
To implement Python programs with conditionals and loops.
Use functions for structuring Python programs.
Represent compound data using Python lists, tuples, and dictionaries.
Read and write data from/to files in Python.
List of Programs
1. Compute the GCD of two numbers.
2. Find the square root of a number (Newton‘s method)
3. Exponentiation (power of a number)
4. Find the maximum of a list of numbers
5. Linear search and Binary search
6. Selection sort, Insertion sort
7. Merge sort
8. First n prime numbers
9. Multiply matrices
10. Programs that take command line arguments (word count)
11. Find the most frequent words in a text read from a file
12. Simulate elliptical orbits in Pygame
13. Simulate bouncing ball using Pygame
Outcome:
Write, test, and debug simple Python programs.
Implement Python programs with conditionals and loops
Develop Python programs step-wise by defining functions and calling them.
Use Python lists, tuples, dictionaries for representing compound data.
Read and write data from/to files in Python.
CO1: Understand the structure and architectural components of OS to analyze and design the
applications to run in parallel. Moreover, students would be able to develop scheduling
algorithms to optimize various parameters like CPU utilization, Throughput, Turnaround Time,
Waiting Time, Response Time for research purpose.
CO2:Understand the design issues associated with Operating system (e.g. Mutual exclusion,
Deadlock detection etc.) to gain insight towards developing algorithms/techniques for efficient
deadlock handling.
CO3: For a given specification of memory organization, develop the techniques for optimally
allocating memory to processes by increasing memory utilization and for improving the access
time.
CO4: Design and implement file management system for a given specification. Identify, use and
evaluate the disk management policies with respect to various performance evaluation
parameters.