data structures - government polytechnic, mumbai · data structures rationale:- ......

DATA STRUCTURES

Rationale:-

The study of data structure is an essential part of computer science. Data structure is a logical &

mathematical model of storing & organizing data in a particular way in a computer. In system

programming application programming the methods & techniques of data structures are widely used.

The study of data structure helps the students in developing logic & structured programs.

Objectives: - Students will be able to-

1. Differentiate between different data structure

2. To apply the different Searching and Sorting techniques.

3. To understand Stack and implementation of Recursion.

4. To understand Linked List and Trees

Programme Code : CO

Course Code : CO 11 306 Course Title : Data Structures

Compulsory/Optional : Compulsory

Teaching Scheme and Credits Duration of Written

Examination Examination Scheme

TH TU PR TOTAL TH TS TH TS PR OR TW TOTAL

3 - 2 5 3 hrs 2 Tests of 1

Hour each 80 20 50* - - 150

( * ) indicates assessment by Internal and External examiners

Topic No Contents Hours Marks

SECTION-I 24 40

1.0 INTRODUCTION TO DATA STRUCTURE

1.1 General concept of

Data types of C,

1.2 Data Structure and their types

Linear data type,

Non- Linear data type

1.3 Complexity

Time complexity

Space complexity

6 08

2.0

SEARCHING & SORTING

2.1 Searching

Linear Search,

Binary Search ,

Hash Search.

2.2 Sorting

Bubble Sort

Insertion Sort

Selection Sort

Merge Sort

Radix Sort

Bucket Sort

Shell Sort

Heap Sort

10 16

3.0 STACKS

3.1 Definition & examples of Stack

Stack as an abstract data type

Representation of stack through arrays

3.2 Primitive operations of Stack

Push

Pop

3.3 Overflow & Underflow of Stack

3.4 Applications of Stack

Polish Notation

Reversing a List

Conversions

Recursion with Example Such as factorial, Fibonacci

sequence

8 16


SECTION-II 24 40

4.0 QUEUES

4.1 Definition & examples of Queue

Queue as an abstract data type

Representation of Queue through arrays

4.2 Operations on Queue

Searching

Insertion

Deletion

4.3 Types of Queue

Priority queue

Circular queue

4.4 Application Of Queue

8 12

5.0 LINKED LIST

5.1 Introduction and Terminologies

Node, Next Address and Pointer, Null pointer, Empty list

5.2 Types of Linked List

Single Linked List

Doubly Linked List

Circular Linked List

Doubly Circular Linked List

5.3 Operations on Single Linked List (with Algorithm)

Searching

Insertion - (At Front ,In between and At End )

Deletion - (From Front ,In between, From End )

08 14

6.0 TREES and GRAPHS

6.1 Introduction and Terminologies

Sub-tree, root ,leaf , left, right, parent, child, ancestor,

descendant, brother, level, depth

6.2 Types of Tree

General Tree

Binary Tree

Binary Search Tree

6.3 'C' representation of Tree

6.4 Operations on Trees

Insertion - Concept with Example

Deletion - Concept with Example

Searching - Depth-first search and Breadth-first search

Traversing - Pre-order, In-order ,Post-order

Examples on Trees - Height balanced Trees and Weight

balanced Tree

6.5 Introduction to GRAPHS

Terminologies: graph, node (Vertices), arcs (edge), directed

graph, in-degree, out-degree, adjacent, successor, predecessor,

relation, weight, path, length.

8 14

List of Practicals:

Reference Books:

Sr.

No.

Book Title Author Publication

1 Data structures Schaum’s series Tata McGraw Hill

2 An introduction to data structures with

applications

Tremblay & Srenson Tata McGraw Hill

3 Data structures through `C’ Ajit Abyankar Tata McGraw Hill

4 Data structures through `C’ Amiya Rath Scitech Publication

Websites:

http://www.oupinheonline.com/book/thareja-data-structures-using-c/9780198065449

www.vikaspublishing.com/teachersmannual.aspx

www.pearsoned.co.in/prc

www.phindia.com/learningresources.aspx

Academic Co-ordinator Head of Department Principal

(Computer Engineering) Government polytechnic Mumbai

Sr.No. Title of Experiment

1 Implement a C program to define an integer array of 10 elements and display it.

2 Implement a C program for inserting an element in an array at given position.

3 Implement a C program for deleting an element from an array.

4 Implement a C program for sorting an array of strings using pointer array.

5 Implement a C program to implement Binary search algorithm.

6. Implement a C program to implement Hash search algorithm.

7 Implement a C program to implement Heap sort algorithm.

8 Implement a C program to check where the given matrix is identity matrix or not.

9 Implement a C program for inserting and deleting element in a stack.

10 Implement a C program for recursive function using stack

11 Implement a C program for inserting & deleting element in a queue.

12 Implement a C program for circular queue.

13 Implement C program for inserting a node in a linked list.

14 Implement a C program for searching a node in a linked list.

15

Implement a C program to implement depth-first search.

http://www.oupinheonline.com/book/thareja-data-structures-using-c/9780198065449

http://www.vikaspublishing.com/teachersmannual.aspx

http://www.pearsoned.co.in/prc

http://www.phindia.com/learningresources.aspx

Web Page Designing

Rationale:

It is estimated that across the Internet, over 100 million domain names are in use.

With fast and cheap broadband Internet connections available to the masses, online users now

exceed 500 millions. Tens of millions of users are now creating personal Web sites. It is a

practical oriented subject which will enable student to develop Web sites.

Objectives: The student will be able to:

1. Design simple Web pages - using HTML

2. Organize information using Tables, collect information from users using Forms &

Present information using I-Frames.

3. Use style sheets to gain full control of formatting within Web page.

4. Include JavaScript within Web pages.

5. Embed multimedia to Web pages.

6. Integrate all above to develop Web sites.

Programme Code : CO

Course Code : CO 11 204 Course Title : Web Page Designing





- - 2 2 - - - - 50 - - 50


Contents: Theory (To be covered during Practical periods)

Topic

No

Contents Hours Marks

32 N.A

01 HTML

1.1 Introduction to HTML

1.1.1 Terminologies used in Web Design: Web, Web site, Web

page, Web server, Web Browser, Search

Engine.

1.1.2 Components of HTML: Tags – closed tags and open tags,

Attributes, Elements.

1.1.3 Structure Tags: ! DOCTYPE, HTML, HEAD, TITLE,

BODY tags.

1.1.4 Block Level Elements : Headings, Paragraphs, Breaks,

Divisions,

Centered Text, Block Quotes, Preformatted text,

Address.

1.1.5 Text Level Elements: Bold, Italic, Teletype, Underline,

Strikethrough, Superscript, subscript.

1.1.6 Horizontal Rules.

1.1.7 Special characters.

1.1.8 Adding comments

1.1.9 The Meta tag.

1.2 Creating Lists

1.2.1 Ordered Lists

1.2.2 Unordered Lists

1.2.3 Definition Lists

1.2.4 Nested Lists

1.3 Linking HTML Documents

1.3.1 URL : Types of URLs, Absolute URLs, Relative URLs

1.3.2 The Anchor Tag.

1.3.3 Linking :

To document in the same folder.

To document in the different folder.

To document on the web.

To specific section within the document.

1.3.4 Inserting E-mail links

10 -

02 IMAGES, COLORS AND BACKGROUNDS

2.1 Images

2.1.1 Image formats : gif, jpeg, png

2.1.2 The inline image: an IMG tag, alternate text, image

alignment, buffer space – HSPACE, VSPACE,

wrapping text, height and width of images.

2.1.3 Image as a link.

2.1.4 Image maps: Server side image maps, Client side image

maps.

2.2 Colors and Backgrounds

8 -

2.2.1 The text color: color attribute of FONT tag, text attribute

of BODY tag.

2.2.2 Background color: bgcolor attribute of BODY tag.

2.2.3 Background images: background attribute of BODY tag.

2.2.4 Changing link colors: link, alink, vlink attributes of

BODY tag.

03 TABLES, I-FRAMES AND FORMS

3.1 Tables

3.1.1 Creating basic tables: TABLE, TR, TH, TD tags.

3.1.2 Formatting tables: border, cellspacing, cellpadding,

width, align, bgcolor attributes.

3.1.3 Adding captions : CAPTION tag.

3.1.4 Formatting contents in the table cells : align, valign,

bgcolor, height, width, nowrap attributes.

3.1.5 Spanning rows and coloums : rowspan and colspan

attributes.

3.2 I-Frames

3.2.1 Introduction to Iframes : What is Iframe?, Advantages

and disadvantages of using frames.

3.2.2 Creating Iframes :. Iframes Attributes, Iframes Tag

3.2.3 Linking with Iframes

3.2.4 Iframes Browser Support

3.3 Forms

3.3.1 Creating basic form: FORM tag, action and method

attributes.

3.3.2 Form fields: Single line text field, password field,

multiple line text area, radio buttons, check boxes.

3.3.3 Pull down menus: SELECT and OPTION tags.

3.3.4 Buttons: submit, reset and generalized buttons.

3.3.5 Formatting technique: Using table to layout form.

8 -

04 STYLE SHEETS and DHTML

4 .1 STYLE SHEETS

4.1.1 Adding style to the document: Linking to style sheets,

Embedding

style sheets, Using inline style.

4.1.2 Selectors: CLASS rules, ID rules.

4.1.3 Style sheet properties: font, text, box, color and

background

properties.

4.2DHTML

4.2.1 Introduction to DHTML

4.2.2 DHTML – JavaScript

4.2.3 DHTML - HTML DOM

4 .2.4 DHTML - HTML Events

4.2.5 DHTML - CSS

6 -

List of Practical’s:-


1 Designs Web page and apply some block level tags and some text level tags.

2 Include Horizontal Rules and special characters in a Web page.

3 Design Web page and include different lists.

4 Include various links in a Web page

5

Include images with different alignments and wrapped text in Web page. Also

Include image as a link in the Web page.

6 Design a web page and set background color and document wide text color.

7

Design a web page with background image, different text color for different Paragraphs,

and set colors for links, active links and visited links.

8 Create HTML table, format contents in table cells and span the rows and columns

9 Design Web page using Iframes.

10 Create a basic form using different input controls and pull down menu.

11 Use table to lay out form with different form controls and generalized buttons

12 Create a web page and apply style sheet properties (font, text and box properties).

13 Create a web page to get watermark effect using style rules.

14 Create a web page using DHTML .

15 To study hosting and domain registration of website

Mini Project:

1.Design a website using all topics mentioned in syllabus

Books:

webreferences:

1. www.w3schools.com

2. www.google.com

Academic Coordinator Head of Department Principal

(Computer Engineering) Govt. polytechnic Mumbai

Sr. No Title Author Publication

1 HTML and XHTML The

complete reference

Thomas Powell Tata McGraw Hill

2 HTML and Web Design Tips

and Technique

Jamsa, King, Anderson Tata McGraw Hill

http://www.w3schools.com/

Applied Mathematics

Rationale:

The subject intends to teach students basic facts, concepts, principle

& procedure of mathematic as a tool to analyze Engineering problems & as

such lays down foundation for understanding the engineering & core

technology subjects

Objectives:

The Students will be able to,

1. Understand basic facts of mathematics about the field analysis of any

Engineering Problem.

2. Know the standard ways in which the problem can be approached.

3. Apply basic concepts to engineering problem.

Topic

No


Programme Code : CO

Course Code : SC11121 Course Title : Applied Mathematics


Credits Duration of Written



3 1 - 4 3 hrs 2 Tests of 1

Hour each 80 20 - - - 100


SECTION-I 24 40

01

Integration

1.1 Definition ,Standard formulae for integration (without

proof)

1.2 Rules of integration. simple integration, Actual

division

1.3 Method of substitution

1.4 Integration by parts

1.5 Integration by partial fraction.

1.6 Definite integral:Defination and properties of definite

integral, simple

Examples and examples based on the properties.

10

20

02 Applications of Definite integrals

2.1 Area under the curve and area enclosed between two

curves

2.2 Mean value and R.M.S. values.

04

08

03

Differential equations

3.1 Definition ,order and degree of differential equation,

formation of

differential equation

3.2 Types of differential equations

3.3 Variable separable and reducible to variable separable.

3.4 Homogeneous differential equation.

3.5 Linear differential equation and Bernoulli”s equation.

3.5 Partial derivatives first order only.

3.6 Exact differential equation.

.

10

12

Topic

No


SECTION-II 24 40

04 Probability 4.1 Basic definations,trial,event, exhaustive, favorable events.

4.2 Mutually exclusive and independent events, addition and

Multiplication theorem.

4.3 Binomial distributation.

4.4 Poissons distribution

4.5 Normal distribution

10 16

Reference Books:

Sr.No. Author Title Publication

1 S.P. Deshpande Mathematics for polytechnic students Pune Vidyarthi Graha

Prakashan

2 H. K. Das Mathematics for polytechnic students

(Volume I )

S.Chand Prakashan

3 G. V. Kumbhojkar Companian to basic maths Phadke Prakashan

4 N. Raghvendra Bhatt

Late Shri R Mohan

Singh

Applied Maths Tata McGraw Hill

Publication


(Computer Engineering) Government polytechnic Mumbai

05

Interpolation

5.1 Introduction, Difference operator, relation between them,

Difference table.

5.2 Newton’s forward and backward difference interpolation

formula.

5.3 Concept of extrapolation

5.4 Lagrange’s interpolation formula.

5.5 Newton’s forward and backward difference interpolation

formula for differentiation.

5.6 Numerical integration: Trapezoidal rule, Simpson’s 1/3 rule,

5.7 Simpson’s 3/8rule,

10 16

06 Numerical Solution Of Ordinary Differential Equation:

6.1 Introduction. 6.2 Runge Kutta’s 2nd And 4

th order methods

04 08

Relational Database Management System

Rationale:

The primary resource that fuels knowledge power is the database. Organizations are

Employing mechanisms to effectively manage and utilize the data stored in the databases.

Relational Database management system has been developed to harness the information stored in

the database. The database management system is a collection of programs that enables to store,

modify and extract information from a database. After learning this subject, the students will be

able to understand the designing of RDBMS and can use any RDBMS package as a backend for

developing database applications. The students develop the skills to design and establish

entity/relationship and also learn database security aspects.

Objectives: The student will be able to:

1) Develop the skills to design database system.

2) Establish entity/relationship.

3) Understand the concept of Database system and Client Server Architecture

4) Understand and develop the concepts of Data Modeling, Security and Integrity.

5) Understand and execute different SQL queries and PL / SQL programs.

6) Normalize the database using normal forms.

7) Understand the concept of query processing and Transaction processing.

Programme Code : CO

Course Code : CO 11 307 Course Title : Relational Database Management System




T

H TU PR TOTAL TH TS TH TS PR OR TW TOTAL

4 - 4 8 3 hrs 2 Tests of 1

Hour each 80 20 - 50* - 150


Topic

No


SECTION-I 32 40

01 Database System Concept & Data Modeling

1.1 An Introduction to Database:

Data: Database, Database Management Systems,

Disadvantages of file processing system, advantages of

DBMS over file processing system.

Applications of DBMS

1.2 Data abstraction, Data dictionary, Instance and schema,

Data independence-Logical and Physical Independence

1.3 Components of a DBMS and overall structure of a DBMS ,

Query processor, Database Users, functions of Database

Administrator

1.4 Introduction to client server architecture: Two/Three tier

Architecture

1.5 Data Models:

Network Model ,Hierarchical Model ,Relational Model

08 10

02 Relational Data Model and Security and Integrity Specification

2.1 Relational Model: Basic concepts, attributes and domains

Keys concept: Super Key, Candidate key, primary Key,

foreign key

2.2 Constraints: Referential Integrity Constraints, Entity Integrity

Constraints 2.3 E- R Model-Types of attributes, role indicator, weak and

strong entity set

2.4 Security and Authorization:

2.4.1 DCL : Grant and Revoke commands

2.4.2 TCL : Commit, Rollback, Savepoint

2.5 Relational Algebra and Relational Calculus

2.6 Creating Views and all options of Views

10 14

03 Structured Query Language 3.1 Structured Query Language : DDL, DML

3.2 Data types in SQL

3.3 DDL: Create, Alter, Drop

3.4 DML: Select, Insert, Update, Delete, Truncate

3.5 Clauses in SQL:

Where, Having ,Group by, Order by clauses

3.6 Operators in SQL:

Logical operators, Relational operators, Set operators

3.7 Functions in SQL:

Date functions, Time functions, String functions, Aggregate

functions

3.8 Concept of Nested Query

3.9 Concept of Join: Equi ,Non-equi ,outer ,self join

14 16

Topic

No


SECTION-II 32 40

04 Introduction to advanced SQL

4.1 Creating Cursors

4.2 Introduction to stored procedures

4.3 Creating Triggers

6 8

05 Database Design

5.1 Relational database design

5.2 Normalization ,Data redundancy and updating anomalies

5.3 Normalization based on Functional dependencies and Multi-

valued Dependencies

5.4 Normal Forms : 1NF, 2NF, 3NF, BCNF

8 10

06 DBMS Storage Structures and File System

6.1 File Organization:

a) Fixed Length records

b) Variable Length records

6.2 Organization of records in files:

Heap, Sequential ,Hashing ,Clustering file organization

6.3 Basic concept of Indexing

6.3.1Types of Indexes:

Order Indices, Primary and Secondary Indices, Dense

and Sparse Index

10 12

07 Query Processing and Transaction Processing

7.1 General strategies for query processing: Query Processing

Steps

7.2 Transaction concept: Transaction properties, Transaction

states

7.3 Schedule : Serial ,Concurrent ,Cascadeless Schedule

7.4 Lock based protocols: share & exclusive mode

7.4.1 Protocols:

Two phase locking ,Time Stamp based ,Validation

based protocols

8 10

List of Practical’s:- Using SQL Server 2005 or latest available:


1 Implementing all DDL statements

2 Implementing all DML statements.

3 Implementation of all string & Date related functions.

4 Implementation of aggregate functions such as sum, avg, min, max, count.

5 Applying constraints such as primary key, not null, foreign key, check, default.

6 Execute the queries containing Where, Group by & Having and Order by Clauses.

7 Selecting the records using set operators such as union, union all, Intersect, minus.

8 Selection records with nested query.

9 Implementation of All Types of Joins.

10 Creating views.

11 Implementation of commit, savepoint, rollback

12 Create Cursors.

13 Create, execute & modify stored procedure.

14 Create Triggers.

15 Normalize the table using different normal forms.

16 Implementation of All Indexes.

17 Implement the backup procedure for database.

Books:

Sr.No. Title Author Publication

1 Database System concepts

Abraham Silberschtz,

Henry Korth & S.

Sudarshan

Tata McGraw Hill

International

2 Introduction to Database

Management Systems ISRD Group Tata McGraw Hill

3 Advanced Database

Management System

Chakrabarti

Dasgupta Dreamtech

4 Introduction to Relational

Databases & SQL programming Allen Tata McGraw Hill

Web Site References:

1. wielyIndia.com or DreamtechPress.com

2. http://phindia.com/gupta/chapter

3. www.williamstannings.com

4. www.w3schools.com

Academic Coordinator Head of Department Principal


http://www.williamstannings.com/

Object Oriented Programming Using C ++

Rationale-

This subject intends to teach the students the basic concepts of object-oriented programming

(OOP). Large programs are probably the most complicated entities ever created by humans. Because of

this complexity, programs are prone to error and software errors can be expensive and even life-

threatening. Object-Oriented Programming offers a new and powerful way to coupe with this

complexity. Its goal is clearer, more reliable, more easily maintained programs. This subject will act as

backbone for all other subjects that are based on Object Oriented concept.

Objectives: - Students will be able to-

1. Compare procedure oriented and object oriented approach.

2. Implement real life object in programming

3. Implement inheritance and multiple inheritances.

4. Prepare reusable code.

Programme Code : CO

Course Code : CO 11 305 Course Title : Object Oriented Programming Using

C ++





3 - 4 7 3hr 1hr 80 20 50* - - 150



SECTION-I 24

1.0 Introduction to Object Oriented Programming

Introduction

- OOP need and requirements

- Limitations of C

- Procedure–oriented programming Vs Object-Oriented

programming concept

- Features of OOPs.

- Structure of C++ programming

- C++ I/O statements

6 8

2.0 Objects and Classes

Classes

- Specifying a class

- Defining member functions

- Arrays within a class

Objects

- Creating objects

- Memory allocation for objects

- Static data and member function

- Array of objects

- Objects as function arguments

8 14

3.0 Constructors and destructuros

Constructors

- Definition

- Concept

- Types of Constructors

- Default

- Parameterized

- copy

- Overloaded Constructors( Multiple Constructor)

- Constructor with default argument

- Destructor

10 18


SECTION-II 24

4.0 Inheritance

Introduction Base Classes

Derived classes

Member declaration: protected

Types Of Inheritance

- Single inheritance

- Multilevel inheritance

- Hybrid inheritance

- Multiple inheritance

Virtual base classes

Abstract classes

Constructors in derived classes

10 18

5.0 Polymorphism

Compile Time Polymorphism

- Functions overloading

- Operator Overloading (unary and binary )

- Overloading Vs Overriding

Run Time Polymorphism - Virtual functions

- Static and dynamic binding

6 10

6.0 Pointers in C++

Concept of Pointers

- Pointer declaration

- Memory management operators (new, delete)

Pointers and Functions

- Call by value

- Call by reference

- Pointer to functions

- Passing function to another function

Pointers and objects - Pointers to objects

- Array of pointer to objects

- This pointer

- Pointers to derived classes

8 12

List of Practicals:

Reference Books:

Sr.No. Book Title Author Publication

1 Object Oriented Programming with C++. Balgurusamy Tata McGraw-Hill

2 C++ The Complete Reference Schilt Tata McGraw-Hill

3 Let Us C++ Kanetkar BPB Publication

Web References:

1. www.cplusplus.com

2. www.mycplus.com




1 Write two C++ programs using Input /output statements

2 Write program for printing formatted output (Make use of manipulators )

3 Write program making use of C++ control structures.

4 Write any three programs using different type of function approach.

5 Write a complete C++ program which makes use of classes & objects.

6 Write a complete C++ program which makes use of classes Static data and member function

7 Write C++ program which makes use of array of objects.

8 Write C++ program using constructors & destructors.

9 Write program making use of single inheritance

10 Write program making use of multiple inheritance

11 Write program making use of multilevel inheritance

12 Write program making use of hybrid inheritance.

13 Write a program which makes use of friend function.

14 Write program making use of Function Overloading.

15 Write program using operator overloading

16 Write a program which uses virtual function & polymorphism

http://www.cplusplus.com/

Digital Techniques

Rationale:

This course forms the foundation of computers. This course is introduced with the view

that students will be familiar with various digital devices and circuits which are used in

microprocessor, Computer & other digital systems

Objectives:

Students will be able to –

1. Understand the concept of various number systems.

2. Understand the concept & principles of logic devices

3. Draw the logic circuit diagram

4. Explain the operation of different logic devices

5. Test the different logic devices

6. Identify the logic devices

7. Construct the circuits using logic devices

8. Develop simple application using logic devices

Programme Code : CO/IF/IS

Course Code : EC 11 208 Course Title : Digital Techniques





4 - 2 6 3 hrs 2 Tests of 1

Hour each 80 20 50 - - 150


SECTION I

Topic

no

CONTENTS Hours

32

Marks

40

1 Number system, & Codes:

1.1 Concept of weighted and non-weighted number system

1.2 Concept of base of a number system Binary, Decimal,

Octal, Hexadecimal

1.3 Conversion of one number system to another system

(Fractional point number )

1.4 Types of codes:-BCD,HEX,Excess-3,Gray code,octal

1.5 Code conversion: gray to binary, binary to gray

06

08

2 Binary Arithmetic: 2.1 Rules for binary addition ,subtraction

2.2 BCD addition ,subtraction

2.3 Concept of 1’s , 2’s Complements of binary numbers

2.4 Subtraction using 1’s & 2’s complements

2.5 Concept of signed magnitude, 1’s & 2’s complement

2.6 Parity, Definition of even & odd parity , Applications

06

08

3 Logic gates and families

3.1 concept of digital signals

3.2 Logic gates: AND gate, OR gate, Inverter and buffer,

Concept of universal gates NAND gate ,NOR gate

Exclusive OR ,Exclusive NOR gate

3.3 Symbols ,Logic equation, truth table ,IC numbers,

3.4 NOR and NAND as universal gates

3.5 Concept of logic family

3.6 Classification of logic families:-saturated and non saturated

Types ,examples of each

3.7 Concept of integration: SSI,MSI,LSI,VLSI

3.8 General specification of digital IC’s

3.9 Definition of Fan in and Fan out ,Noise Immunity,

Propagation delay (Typical values for TTL and CMOS)

I/P High,I/P Low ,O/P High ,O/P Low

08

10

4 Boolean Algebra

4.1 Construction of Logic circuits using gates for Boolean

expression

4.2 Rules of Boolean Algebra

4.3 Demorgan’s Theorem

4.4 Concept of SOP & POS

4.5 Concept of minterm & maxterm, standard form

4.6 Concept of K map

4.7 Simplification using K map for 2, 3, 4, variables

4.8 Realization of reduced expression using logic gates

07

08

5 Combinational Circuits

5.1 Half adder, full adder

5.2 Half subtractor ,full subtractor

5.3 Block diagram and truth table of Encoders

5.4 Priority Encoders ICs and Decoders

5.5 Decimal to BCD Encoders –IC 74147

BCD to 7-segment Decoder

5.6 Comparator : 1 bit & 2 bit -IC 7485

05

06

SECTION II

Topic CONTENTS Hours

32

Marks

40

6 Multiplexer / Demultiplexer

6.1 Multiplexer

- Necessity of multiplexing

- Principle of multiplexing &

- their types –2 : 1, 4 : 1 , 8 : 1

- Block diagram, operating principle, Applications

- Multiplexer tree 32 to 1 and multiplexing 16 to 1 line

6.2 Demultiplexer

- Necessity of demultiplexing

- Principle of demultiplexing &

- their types - 1 : 2 , 1 : 4 , 1 : 8

- block diagram, operating principle, Applications

04

06

7

Flip Flops

7.1 Difference between combinational and sequential circuits

7.2 Basic concept of Flip Flop

7.3 Types of Flip Flop: RS, Clocked RS, T & D flip flop, JK

FF, Master slave JK FF ( Diagram, Symbol, Truth

table, operation, Application )

7.4 Concept of Preset & Clear, Race around condition

7.5 Types of triggering : Edge, level triggering

7.6 Flip flop IC’s

10

10

8

Counters

8.1 Basic concept of counters

8.2 Classification of counters:

Synchronous &Asynchronous/ripple

8.3 Concept of UP & DOWN counter

8.4 3 bit /4 Bit Binary counter

8.5 BCD counter

8.6 Design MOD – N counter

( Circuit diagram, operation, Timing diagram of above Counter )

08

10

9

Shift Registers

9.1 Definition, Classification

9.2 Working of 4 Bit SISO, SIPO, PISO, PIPO Registers

9.3 Universal shift registers, Bidirectional shift register

9.4 Ring Counter, Twisted ring counter

( Diagram, operation, waveform, applications of shift

Registers)

06

08

10 A-D and D-A converter

10.1 Need of data converters,types of data converter

10.2 DAC specification

10.3 Circuit diagram and working of R-2R Ladder DAC

10.4 ADC specification

10.5 Block diagram and working of RAMP ADC

04

06

LIST OF PRACTICALS ( any 10 ) :--


1

Verification of Truth Table of AND, OR, NOT, NAND,NOR,Ex-OR,Ex-NOR gates using ICS

2 Truth table verification of Basic gates using discrete components such as diode,Transistor etc.

3 Construction of logic circuit for a given Boolean expression

4 Verification of Truth Tables of RS, flip flop using respective ICs

5 Verification of Truth Tables of JK, flip flop using respective ICs

6 Verification of Truth Tables of T & D flip flops using respective ICs

7

To built 3 bit ripple counter using Flip Flop & its ICs and observation of its timing waveform

8 Construction of BCD counter using Flip Flop & its IC 7490

9 Construction of 4 bit shift register using & ICs 7494 / 74194

10 Implementation of adder circuit using Multiplexer IC 74150

11 Implementation of adder circuit using Demultiplexer IC 74154

12 Construction of UP & DOWN counter & observation of its operation

13 To built & study Comparator ( IC 7485 )

14 To study d/a converter using IC 0808

Reference Books:

Sr. No. Title Author Publisher

01 Modern Digital Electronics R.P. Jain Tata McGraw Hill

02 Principle of Digital Electronics Malvino A.P & Leach Tata McGraw Hill

03 Digital Logic Design & Application N.G.Palan Tech-Max

04 Pulse Digital & Switching waveforms Millman & Taub S . Chand

05 Digital Electronics William Gothmann Tat McGraw Hill

Web Reference:-

1. Signetics Logic TTL Data Manual.

2. www.all about circuts.com

3. www.electronicsforu.com

Academic Co-ordinator Head of department Principal

(Computer engineering) Govt.Polytechnic,Mumbai

http://www.all/

http://www.electronicsforu.com/