## Polytechnic Diploma in Computer Engineering 3rd Semester

*3rd Semester Polytechnic Computer Engineering Syllabus MSBTE Course and Classes in Nagpur G Scheme*

Atlanta Computer Institute Nagpur conducts Tuition Classes for third semester Polytechnic Computer Engineering Diploma in Nagpur for Computer Engineering Branch for third Semester in Nagpur India . The Following syllabus is of MSBTE g scheme. Final Year Projects Training is also given to Diploma Students.

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION, MUMBAI

TEACHING AND EXAMINATION SCHEME FOR POST S.S.C. DIPLOMA COURSES

COURSE NAME : COMPUTER ENGINEERING GROUP

COURSE CODE : CO/CD/CM/CW/IF

DURATION OF COURSE : 6 SEMESTERS For CO/CM/CW/IF ( 8 SEMESTERS for CD) WITH EFFECT FROM 2012-13

SEMESTER : THIRD DURATION : 16 WEEKS

FULL TIME / PART TIME : FULL TIME SCHEME : G

## Applied Mathematics

Data Structure Using C

Electrical Technology

Relational Database Management System

Digital Techniques

Graphical User Interface (GUI) Programming

Professional Practices-I

MSBTE – Final Copy 14/01/2013 1

w.e.f Academic Year 2012-13 G Scheme Course Name : All Branches of Diploma in Engineering & Technology Course Code : AE/CE/CH/CM/CO/CR/CS/CW/DE/EE/EP/IF/EJ/EN/ET/EV/EX/IC/IE/IS/ ME/MU/PG/PT/PS/CD/CV/ED/EI/FE/IU/MH/MI

Semester : Third

## Applied Mathematics

Topic-1 Applications of Derivative Specific objectives : Find slope, curvature, maximum and minimum value of functions related to different engineering applications. •Examples for finding slope , equations of tangent and normal to the curve •Maxima and minima. •Radius of curvature.

Topic-2 Integral Calculus

2.1 Integration ------------------------- 20 Specific objectives : Integrate function using different method. •Definition of integration as anti derivative, rules of integration. •Integration of standard functions •Methods of integration Integration by substitution. Integration by partial fractions. Integration by parts and generalized rule by parts.

2.2 Definite Integrals ---------------------------------- 16 Specific objectives : Solve problems on definite integrals using the properties. • Definite integral- Definition, examples. • Properties of definite integrals without proof and simple examples.

2.3 Application of Definite Integrals --------------------- Specific objectives : Find area. 1. Area under a curve. 2. Area between two curves.

Topic 3 - Differential Equation.

3.1 Differential equation Specific objectives : Solve the differential equation of first order and first degree Solve different engineering problems using differential equation •Differential equation- Definition, order and degree of a differential equation. Formation of differential equation containing single constant. •Solution of differential equation of first order and first degree for following types Variable separable form, Equation reducible to variable separable form. Linear differential equation. Homogeneous differential equation. Exact differential equation. 10 20

w.e.f Academic Year 2012-13 G Scheme

Topic 4 - Probability

4.1 Probability Specific objectives : ----------------------------08 Solve different engineering problems related to probability process. •Definition of random experiment, sample space, event, occurrence of event and types of event (impossible, mutually exclusive, exhaustive, equally likely) •Definition of probability, addition and multiplication theorems of probability.

4.2 Probability Distribution ---------------------- 12 •Binomial distribution •Poisson’s Distribution •Normal distribution

w.e.f Academic Year 2012-13 G Scheme

Course Name : Computer Engineering Group

Course Code : CO/CM/IF/CD/CW

Semester : Third

## Data Structure Using C

1 Introduction to Data Structure Specific Objective: To understand data structure organization & classification To understand operations on data structure. To understand approaches to design an algorithm. Knowing the complexity of an algorithm 1.1 Basic Terminology •Elementary data structure organization •Classification of data structure 1.2 Operations on data structures •Traversing, Inserting, deleting •Searching, sorting, merging 1.3 Different Approaches to designing an algorithm •Top-Down approach •Bottom-up approach 1.4 Complexity •Time complexity •Space complexity 1.5 Big ‘O’ Notation

2 Sorting and Searching Specific Objective: To understand and apply sorting algorithms on data. To understand and apply searching algorithms on data. 2.1 Sorting Techniques •Introduction •Selection sort •Insertion sort •Bubble sort •Merge sort •Radix sort ( Only algorithm ) •Shell sort ( Only algorithm ) •Quick sort ( Only algorithm ) 2.2 Searching •Linear search •Binary search

3 Stacks Specific Objective: To understand and apply the knowledge of the data structure – ‘stack’ in the application programs. 3.1 Introduction to stack •Stack as an abstract data type •Representation of stack through arrays 3.2 Applications of Stack •Reversing a list •Polish notations •Conversion of infix to postfix expression •Evaluation of postfix expression

•Converting an infix into prefix expression •Evaluation of prefix expression •Recursion

4 Queues Specific Objective: To understand and apply the knowledge of the data structure – ‘Queue’ in the application programs. 4.1 Introduction •Queues as an abstract data type •Representation of a Queue as an array 4.2 Types of Queue •Circular Queue •Double Ended Queue •Priority Queue •Dequeues 4.3 Applications of Queue

5 Linked List Specific Objective: To understand and apply the knowledge of the data structure – ‘Linked List’ in the application programs. 5.1 Introduction •Terminologies: node, Address, Pointer, Information, Next, Null Pointer, Empty list etc. 5.2 Type of lists •Linear list •Circular list •Doubly list 5.3 Operations on a singly linked list ( only algorithm) •Traversing a singly linked list •Searching a linked list •Inserting a new node in a linked list •Deleting a node from a linked list

Trees Specific Objective: To understand and apply the knowledge of the data structure – ‘Trees’ on data. 6.1 Introduction --------------------- 06 Marks •Terminologies: tree ,degree of a node, degree of a tree, level of a node, leaf node, Depth / Height of a tree, In-degree & out-Degree, Directed edge, Path, Ancestor & descendant nodes.

6 6.2 Tree Types and Traversal Methods ------------- 12 Marks Type of Trees •General tree •Binary tree •Binary search tree (BST). Binary tree traversal ( only algorithm ) •In order traversal •Preorder traversal •Post order traversal Expression tree

w.e.f Academic Year 2012-13 G Scheme

7 Graph and Hashing Specific Objective: To understand and apply the knowledge of ‘graph’ and ‘hashing’ function on data. 7.1 Introduction •Terminologies: graph, node (Vertices), arcs (edge), directed graph, in-degree, out-degree, adjacent, successor, predecessor, relation, weight, path, length. 7.2 Representations of a graph •Array Representation •Linked list Representation 7.3 Traversal of graphs •Depth-first search (DFS). •Breadth-first search (BFS). 7.4 Applications of Graph 7.5 Hashing •Hash function •Collision resolution techniques

w.e.f Academic Year 2012-13 G Scheme

Course Name : Computer Engineering Group Course Code : CO/CM/IF/CD/CW Third Semester

## Electrical Technology

01 Database System Concept Specific Objectives: State the importance of DBMS effectiveness and database tools. State the advantages of using database system to store operational data. Explain the concept of RDBMS .Describe the overall structure of DBMS & Architecture of Client/Server system. Explain the concept of data mining and data warehousing 1.1 An Introduction to database. Data, database, DBMS, Disadvantages of file processing system, advantages of DBMS over file processing system , Application of database. 1.2 What is RDBMS, Difference between DBMS and RDBMS 1.3 Names of various DBMS and RDBMS softwares 1.4 Data abstraction, Database languages, Instance and schema, Data independence - Logical and Physical Independence. 1.5 Components of DBMS and overall Structure of DBMS. Database Users, functions of Database Administrator. 1.6 Introduction to client server architecture. Two/Three tier Architecture. 1.7 The 12 Rules (Codd’s laws) for fully functional RDBMS. 1.8 Introduction to Distributed database, Introduction to data mining & data warehousing 08 16 02 Relational Data Model and Security and Integrity Specification Specific Objectives: Explain the commercial data processing applications by using various data models. Implement the Concept of E-R Model. Describe the process of Normalization & Design database structure using various Normal forms to reduce redundancy. Explain the various data constraints. Explain the need of data security. 2.1----------------------------------- (10 Marks) Data Model •Network Model •Hierarchical Model •Relational Model Relational Model: - Basic Concepts Attributes and Domains. Key Concepts:- Candidate key, Primary key, Foreign key and Super key. E-R model, Components of ER Model, Types of attributes, role indicator, weak & strong entity set. Enhanced ER Model: Introduction, Specialization & Generalization 2.2 ----------------------------------- (12 Marks) Relational Algebra and Relational Calculus. Database Design: Relational database Design, Functional dependencies, Normalization based on functional dependencies, Normal forms: 1NF, 2NF, 3NF, BCNF. Normalization based on multivalued dependencies, Normalization based on Join dependencies. Integrity Constraints: Domain Integrity Constraints, Entity integrity Constraints, Referential Integrity Constraints & on delete cascade Database Security: introduction, Data security requirements. 14 22 03 Interactive SQL Specific Objectives: Design SQL queries to Create Relational database and apply data constraints. Design the queries for data manipulation. Implement the queries using various operators & functions Design the queries for controlling in Database. Explain the concept of transaction processing. 3.1 ----------------------------------- (10 Marks) Introduction to SQL Data Types in SQL DDL Commands: CREATE, ALTER, DROP, TRUNCATE, DESC, RENAME, Truncate, Creating a User, Use of data constraints DML Commands: INSERT, UPDATE,DELETE,CALL 3.2 ----------------------------------- (16 Marks) SQL Operators: Arithmetic Operators, Comparison Operators, Logical Operators, Set Operators, Range Searching operators-Between, Pattern matching operators-Like. Oracle Functions: String, Arithmetic, Date and time, Aggregate Functions and Miscellaneous Functions. Conversion Functions, Special Date formats using To_char() function Queries using Group by, having, and Order by clause, Joins, Types of Joins, Sub queries. DCL Commands: COMMIT, SAVEPOINT, ROLLBACK, GRANT, REVOKE. DQL Commands: SELECT. Transaction Processing: The concept of Transaction, ACID properties, States of Transaction, Concurrent execution of Multiple transaction, Serializability. 18 26 04 Advance SQL: SQL Performance Tuning Specific Objectives: Design SQL queries for implementation of VIEWS, SEQUENES, INDEXES, SNAPSHOT and SYNONYM. 4.1 Views: What are Views? The Create View Command, Updating Views, Views and Joins, Views and Sub queries, What Views cannot do? , Dropping Views. 4.2 Sequences: Creating Sequences, Altering Sequences, Dropping Sequences. 4.3 Indexes: Index Types, Creating of an Index: Simple Unique, and Composite Index, Dropping Indexes. 4.4 Snapshots: Creating a Snapshot, Altering Snapshot, Dropping a Snapshot. 4.5 Synonyms: Creating a Synonyms, Dropping a Synonyms.

## Digital Techniques

## Graphical User Interface (GUI) Programming

## Professional Practices-I

BCA Bachelor Of Computer Application, BCCA, Bachelor of Commerce & Computer Application BE IT/CS, Information technology/Computer Science MCA, Master of Computer Application MCM, Master of Computer Management Diploma , Polytechnic Others,