SE Session Plan

7/31/2019 SE Session Plan

1/16

Date of Commencement: 21/06/12 Date of Conclusion: 11/10/12

JSPMs

Rajarshi Shahu College of EngineeringTathawade, Pune-33

Department of Information Technology Teaching Plan

Class:- SE Year:-2012-13

Sub:- DEL Sem:- I

---------------------------------------------------------------------------------------------------------------------

No. of Lectures Planned:-44

Lecture

No.

Topics to be Covered Planned

Date

Actual

Date

Books

Referred

Teaching

aid used

Unit I: Number System& Logic

Design Minimization Techniques1 Introduction. Binary, Hexadecimal

numbers, Octal numbers andnumber conversion.

21/06/12

2 Signed Binary numberrepresentation. Signed Magnitude,

22/06/12

3 1s complement and 2scomplement

representation

25/06/12

4 Binary, Hexadecimal Arithmetic,

2s complement arithmetic

26/06/12

5 Algebra for logic circuits : Logic

variables;Logic function : NOT, AND, NOR,

XOR, OR, XNOR, NAND

27/06/12

6 Codes : BCD, Excess-3, Gray code ,

Binary Code and their conversion02/07/12

7 Boolean algebra. Truth tables and

Boolean algebra. Idealized logic

gates and symbols

03/07/12

8 DeMorgan's

rules Axiomatic definition ofBoolean algebra, Basic theorems

and properties of Boolean algebra

4/07/12

Unit II: Logic Families

9 TTL: Standard TTL characteristics-Speed, power dissipation, fan-in,

fan-out,

05/07/12

10 current and 07/07/12


2/16

voltage parameters, noise margin,

operating temperature etc.

11 Operation of TTL NAND gate. TTL

Configurations- Active pull-up,

10/07/12

12 Wired AND, totem pole, open

collector

11/07/12

13 CMOS: CMOS Inverter, CMOS

characteristics, CMOS

configurations- Wired Logic, Opendrain outputs.

12/07/12

14 Interfacing: TTL to CMOS andCMOS to TTL

17/07/12

Unit III : (8 Hrs)

Combinational Logic

15 Logic minimization Representationof truth-table, SOP form, POS form,

Simplification oflogical functions

18/07/12

16 Minimization of SOP and POS

forms, Dont care conditions

19/07/12

17 Reduction techniques: K-Maps

(only up to 4 variables) & Quine McClusky technique

21/07/12

18 Arithmetic Operations: - Binary

Addition, Subtraction, BCD

Addition

24/07/12

19 Circuits: - Half- Adder, Full Adder,

Half Subtract or, Full Sub tractor,BCD adder using andsubtract using 7483

25/07/12

20 look ahead and carry, parity

generator and checker using 74180

26/07/12

21 magnitude

comparator using 7485,

Multiplexers (MUX) : Working ofMUX, Implementation of

expression using MUX

(ICD74153, Demultiplexers 74151).

31/07/12

22 Demultiplexers (DEMUX):-Implementation of expression using

DEMUX, Decoder. (IC 74138).

01/08/12

Unit IV : (8 Hrs)

Sequential Logic

23 Introduction: Sequential Circuits.

Difference between combinationalcircuits and sequential

2/08/12


3/16

circuits

Flip- flop : SR, JK18/09

24 D, T; Preset & Clear, M19/09aster

and

Slave Flip Flops their truth tables

and excitation tables

4/08/12

25 Conversion from one type to anothertype of Flip Flop

7/08/12

26 Study of7473,7474,7476 8/8/12

27 Application of Flip-flops. Bounce

Elimination Switch, registers,counters

9/08/12

28 Registers : Buffer register; shift

register;7495

14/08/12

29 Counters : Asynchronous counter.Synchronous counter, ring counters,

BCD Counter, JohnsonCounter

16/08/12

30 Modulus n counter(IC 7490, 74191),

Pseudo Random Binary SequenceGenerator, Sequence

generator and detector

18/08/12

Unit V : (8 Hrs)

ASM & Programmable Logic

Devices

31 Algorithmic State Machines,ASM

charts, notations21/08/12

32 design of simple controller,multiplexer controller method

22/08/12

33 Examples. Sequence Generator,Types of Counter

23/08/12

34 Programmable Logic DevicesPLD: PLA- Input, Output Buffers

28/08/12

35 AND, OR, Invert/ Non-InvertMatrix

29/08/12

36 Design Example- Any 4 VariablesSOP function using PLDs

30/08/12

37 Study of basic architecture of FPGA

CPLD

01/09/12

Unit VI : (6 Hrs)

VHDL and Introduction to

Microprocessors

38 Introduction to HDL, VHDL-

Library, Entity, Architecture,Modeling Styles

4/09/12

39 Concurrent 5/09/12


4/16

and Sequential Statements, Data

Objects & Data Types

40 Attributes

Design Examples. VHDL for

Combinational Circuits-Adder

06/09/12

41 VHDL for Sequential Circuits-Synchronous and AsynchronousCounter. ,Shift Register

11/09/12

42 Introduction to Microprocessor.Introduction of Ideal

Microprocessor, Data Bus

12/09/12

43 Address Bus,

Control Bus, 8085 Programmers

model as an example.

13/09/12

44 University Question paper

discussion

18/09/12

Text Books

T1. James Bignell, Robert Donavan Digital Electronics 5th edition CengageLearning

T2.R. P. Jain, Modern Digital Electronics, 3rd Edition, Tata McGraw-Hill, 2003. T3.Stephen Brown, Zvonko Vranesic Fundamentals of Digital Logic with VHDL

Design McGraw-Hill.

Reference Books

R1.John Yarbrough, Digital Logic applications and Design Thomson. R2.Flyod Digital Principles, Pearson Education. R3.Malvino, D.Leach Digital Principles and Applications, 5th edition, Tata Mc-

Graw Hill.

R4.J.Bhaskar VHDL Primer 3rd Edition, Pearson Edition.Teaching Aid Used

C: Chalk & Talk L: LCD, PPTs O:OHP V: Video Lectures G: Guest Lectures

Prof. Dipmala Salunke Prof. S.V. Kedar

(Subject In charge) (HOD IT)


5/16

Date of Commencement: 21/06/12 Date of Conclusion: 11/10/12

JSPMs

Rajarshi Shahu College of EngineeringTathawade, Pune-33

Department of Information Technology Teaching Plan

Class:- SE Year:-2012-13

Sub:- Fundamental of Data Structure Sem:- I

---------------------------------------------------------------------------------------------------------------------

No. of Lectures Planned:-46

Lecture

No.

Topics to be Covered Planned

Date

Actual

Date

Books

Referred

Teaching

aid used

Unit I:IntroductionIntroduction to C

1 Constants, variables and keywords

in C, operators and control structurein c(decision, loop

and case), functions, macros, arrays

and string manipulation, structure,

union, enumeration, bitwiseoperations

21/6/2012

23

4

5

6

7

8

Unit II:

Arrays & Pointers in C

9 Functions: Parameter passing call by

value and call by reference, scoperules, functions and

pointers, function returning pointerand pointer to function, String

manipulations using

arrays,pointer to pointer.Structure and Union: Passing and

returning structure as parameter for


6/16

function ,structure and

pointer.

Recursion: Definition, writing

recursive functions & how recursionworks. File handling using C.

10

11

12

13

14

15

16

17 Unit -III

Introduction to Data structures &

Analysis of Algorithams

17

18

19

20

21

22

23

24

25

2627

28

29

30

31

32

33

34

35 automatic feature extraction 02/03/12

Unit VI: Searching the Web

36 Searching the Web, Challenges 06/03/12

37 Characterizing the Web, SearchEngines, Browsing

07/03/12

38 Mata searchers, Web crawlers, 08/03/12

39 robot exclusion, Web data mining,Metacrawler,

09/03/12


7/16

40 Collaborative filtering, Web agents

(web shopping, bargain finder)

13/03/12

41 Economic, ethical, legal and

political issues

14/03/12

42 University Question paper

discussion

15/03/12

Text Books :

T1: Yates & Neto, "Modern Information Retrieval", Pearson Education, ISBN 81-297-

0274-6

T2: C.J. Rijsbergen, "Information Retrieval", (www.dcs.gla.ac.uk)

T3: I. Witten, A. Moffat, and T. Bell, Managing Gigabytes

Reference Books:

R1: D. Grossman and O. Frieder Information Retrieval:Algorithms and Heuristics

R2:Mark leven, Introduction to search engines and web navigation, John Wiley andsons Inc., ISBN 9780-170-52684-2.

R3: V. S. Subrahamanian, Satish K. Tripathi Multimedia information System, KulwerAcademic Publisher.

R4: Chabane Djeraba, Multimedia mining A highway to intelligent multimedia

documents, Kulwer Academic Publisher, ISBN 1-4020-7247-3

Teaching Aid Used

C: Chalk & Talk L: LCD, PPTs O:OHP V: Video Lectures G: Guest Lectures

Prof. Dipmala Salunke Prof. S.V. Kedar

(Subject In charge) ( HOD IT)
http://www.dcs.gla.ac.uk/http://www.dcs.gla.ac.uk/


8/16

Date of Commencement: 21/06/2012 Date of Conclusion:

11/10/2012

JSPMs Rajarshi Shahu College of Engineering

Department of Information Technology

Teaching Plan, Semester-I (2012-13)

Name of the Staff: - Prof. D. H. Patil

Name of the Subject: - Humanities and Social Science

Department: -I.T. No. of Lect. Planned: - 38 Class: - SE IT

Sr. No. Topic(s) to be covered Planned

Date

Actual

Date

Book/

Website

Referred

1. Introduction of Humanities and Social Science2.

Unit 1: Indian Society: 06Introduction 25/6/2012

3. Structure of Indian Society, Indian SocialDemographySocial and Cultural,

26/6/2012

4. Differentiations: caste, class, gender and tribe; 27/6/125. Institutions of marriage, family and kinship 6/7/126. Secularization Social Movements and

Regionalism- Panchayatraj, Institutions; Indianconstitution;

2/7/12

7. Affirmative Action Programme of theGovernment-various reservations and

commissions.

3/7/12

8. Unit II : Social Development : 06Introduction

4/7/12

9. Scientific approach to the study of human beings 9/7/1210. Evolution of human kind, 10/7/1211. Social change and evolution 11/7/1212. Industrial revolution. 16/7/1213. National policy on education 17/7/1214. Health and health care and human development 18/7/1215. Unit III: Sectoral Development: 06

Introduction23/7/12

16. Agriculture: Technology changes, Greenrevolutions,

24/7/12

17. Employment Rural & Urban, GovernmentSchemes

25/7/12


9/16

18. Industrial Development : Strategies, 30/7/1219. Public & Private Sectors, 31/7/1220. Categories, infrastructure, transport &

communication,1/8/12

21. Consumer Awareness 6/8/1222. Classroom Test and Assessment 7/8/1223. Unit IV:Environment & Ecology: 06

Introduction: Ecosystems: Structure, Working,components

8/8/12

24. Pollution: Water & Air Pollution, GlobalWarming

13/8/12

25. Control Strategies, International Treaties. EnergySources: Renewable & Non Renewable

14/8/12

26. Ocean, Geothermal & Tidal, GlobalEnvironmental Issues: Population Growth,

20/8/12

27.

Soil Degradation, Loss of Biodiversity 21/8/1228. Unit V: Economic Development: 05

Introduction

22/8/12

29. Need for planned economic developmentLaw ofdemand and supply.

27/8/12

30. Planning objectives, five year plans, Priorities andproblems. Population and development

28/8/12

31. Indian Economics basic features, naturalrecourses population size and composition 29/8/12

32. National income concepts, micro economics ofIndia, inflation

3/9/12

33. Unit VI : Banking & Trades: 05Introduction

4/9/12

34. Financial Analysis, Ratios, Cost Analysis, 5/9/1235. Financial Institutions, Finance Commissions,

Budget Analysis.

10/9/12

36. Indian Banking, Role of Reserve bank of India 11/9/1237. International Economy, WTO,

International aid for economic growth.

12/9/12

38. Question Paper Discussion 17/9/12

HOD Signature Staff

Signature

Reference Books


10/16

1. Krugman, International Economics, Pearson Education.2. Prakash, The Indian Economy, Pearson Education.3. Thursen Gerald, Engineering Economics, Prentice Hall.

4. C.S. Rao, Environmental Pollution Control Engineering,New Age International Pvt. Ltd.

5. Rangarajan, Environmental Issues in India, Pearson Education.6. University of Delhi, The Individual & Society, Pearson Education.7. Wikipedia.org / wiki /social studies.

8. M. N. Srinivas, Social change in modern India, 1991, Orient Longman.

9. David Mandelbaum, Society in India, 1990, Popular.

Web sites:

W1.www.nptel.iitm.ac.in

W2.wikipedia.com

W3. http://google.com

Teaching Aid Used

C- Chalk & Talk

L- LCD, PPTs. O- OHP V- Video Lectures. G -Guest Lectures
http://www.cse.chalmers.se/edu/course/TDA297http://www.cse.chalmers.se/edu/course/TDA297http://www.cse.chalmers.se/edu/course/TDA297http://www.cse.chalmers.se/edu/course/TDA297


11/16

Date of Commencement: 21/06/2012 Date of Conclusion: 10 /10/2012

JSPMS RAJARSHI SHAHU COLLEGE OF ENGINEERING

Tathawade, Pune -33.

Teaching Plan[Remidial], SemesterI (2012-13)

Department : IT Class : S.E.

Name of Staff : Prof. V.D.Shinde Name of Subject : DS

No. of Lects. Planned : 12

Sr. No. Topic Name Planned

Date

Actual

Date

Book/ Website

Referred

Teaching-

aid Used

Sets and Propositions

1. Universal and ExistentialQuantifiers, Normal forms

29/6/12 C

2. methods of proofs,Mathematical Induction. 6/7/12 CGraphs

3. planer graph 13/7/12 C4. Travelling

salesman problem

20/7/12 C

Trees

5. Prims algorithms forminimal spanning tree 27/7/12 C

6. The Max flowMin cuttheorem (transportnetwork)

3/7/12 C

Relations and Functions C

7. Discrete Numericfunctions and Generating

functions, Job schedulingProblem.

10/7/12 C

Recurrence Relations C

8. Total solutions, solutionsby the method of

generating functions

17/7/12 C

Permutations,Combinations and

Discrete Probability

C

9. Discrete Probability,Conditional Probability

24/8/12 C

10. Bayes Theorem,Information and Mutual

Information

3/8/12 C


12/16

Groups and Rings C

11. Field, RingHomomorphism

7/9/12

12. Polynomial Rings andCyclic Codes

14/9/12

HOD Signature Staff Signature

Text Books:T1. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics, SiE Edition,

TataMcGraw-Hill, 2008, ISBN 10:0-07-066913-9

T2. R.Johnsonbaugh,Discrete Mathematics,5thEdition,PearsonEducation,2001ISBN817808279(Recommended for Unit I and Unit II)

Reference Books:R1.N. Biggs,Discrete Mathematics,3rdEdition,Oxford University Press, ISBN 019850717- 8R2. Kenneth H. Rosen, DiscreteMathematics and its Applications, 6th edition, McGraw-Hill,

2007. ISBN 978-0-07-288008-3

R3. E. Goodaire and M.Parmenter,Discrete Mathematics with Graph Theory,2nd edition,Pearson

Education,2003 ISBN 8178088274

R4. Semyour Lipschutz & Marc Lipson,Discrete Mathematics,McGraw-Hill,3rd

Edition, ISBN-13 : 978-0-07-060174-1

R5. B. Kolman,R.Busby and S. Ross,Discrete Mathematical Structures,4th Edition,PearsonEducation,2002, ISBN 81-7808-556-9

R6.N. Deo, Graph Theory withapplication to Engineering and Computer Science, Prentice Hallof India,1990, 0876921454

Web sites

W1.www.nptel.edu

W2.www.w3schools.comW3.www.wikipedia.com

Teaching Aids Used:

C: Chalk and Talk L: LCD PPT Presentation G: Guest Lectures O: OHP V: Video Lectures


13/16

Date of Commencement: 21/06/2012 Date of Conclusion:10 /10/2012

JSPMS RAJARSHI SHAHU COLLEGE OF ENGINEERING

Tathawade, Pune -33.

Teaching Plan, SemesterI (2012-13)

Department : IT Class : S.E.

Name of Staff : Prof. V.D.Shinde Name of Subject : DS

No. of Lects. Planned : 39

Sr. No. Topic Name Planned

Date

Actual

Date

Book/

Website

Referred

Teaching-

aid Used

Sets and Propositions

13.

Sets, Combination of sets 21/6/1214. Finite and Infinite sets 25/6/1215. Un-countably infinite sets 27/6/1216. Principle of inclusion

and exclusion

28/6/12

17. Multisets,Propositions,Conditional Propositions

2/7/12

18. Logical Connectivity,Propositional calculus

4/7/12

Graphs

19. Basic terminology 5/7/1220. multi graphs and weighted

graphs9/7/12

21. paths and circuits 11/7/1222. shortest path in weighted

graph

12/7/12

23. Hamiltonian and Eulerpaths

16/7/12

24. circuits, factors of a graph 18/7/12Trees

25.

Trees, rooted trees, pathlength in rooted trees 19/7/12

26. prefix codes, binary searchtrees

23/7/12

27. spanning trees andcut set

25/7/12

28. minimal spanning trees 26/7/12


14/16

29. cut set, minimal spanningtrees 30/7/12

30. Kruskals algorithms forminimal spanning tree

1/8/12

Relations and Functions

31.

Properties of BinaryRelations, Closure of

relations

2/8/12

32. Warshalls algorithm, 6/8/1233. Equivalence

Relations and partitions,

8/8/12

34. Partial ordering relationsand lattices, Chains andAnti chains

9/8/12

35. Functions, Composition offunctions

13/8/12

36. Invertible functions,Pigeonhole Principle

16/8/12

Recurrence Relations

37. Recurrence Relation,Linear RecurrenceRelations With constant

Coefficients

20/8/12

38. Homogeneous Solutions 22/8/1239. Total solutions, solutions

by the method of

generating functions

23/8/12

Permutations,

Combinations and

Discrete Probability

40. Permutations andCombinations: rule of sum

27/8/12

41. Rule of product 29/8/1242. Permutations 30/8/1243. Combinations 3/9/1244. Algorithms for generation

of Permutations5/9/12

45. Algorithms for generationof Combinations

6/9/12

Groups and Rings

46. Algebraic Systems,Groups, Semi Groups,Monoid

10/9/12


15/16

47. Subgroups, PermutationGroups

12/9/12

48. Codes and Group codes 13/9/1249. Isomorphism and

Automorphisms

17/9/12

50. Homomorphism andNormal Subgroups

20/9/12

51. Ring,Integral Domain 24/9/12

HOD Signature Staff Signature

Text Books:T1. C. L. Liu and D. P. Mohapatra, Elements of Discrete Mathematics, SiE Edition,

TataMcGraw-Hill, 2008, ISBN 10:0-07-066913-9

T2. R.Johnsonbaugh,Discrete Mathematics,5thEdition,PearsonEducation,2001ISBN817808279

(Recommended for Unit I and Unit II)

Reference Books:R1.N. Biggs,Discrete Mathematics,3rdEdition,Oxford University Press, ISBN 019850717- 8

R2. Kenneth H. Rosen, Discrete Mathematics and its Applications, 6th edition, McGraw-Hill,

2007. ISBN 978-0-07-288008-3

R3. E. Goodaire and M.Parmenter,Discrete Mathematics with Graph Theory,2nd edition,Pearson

Education,2003 ISBN 8178088274R4. Semyour Lipschutz & Marc Lipson,Discrete Mathematics,McGraw-Hill,3rd

Edition, ISBN-13 : 978-0-07-060174-1

R5. B. Kolman,R.Busby and S. Ross,Discrete Mathematical Structures,4th Edition,Pearson

Education,2002, ISBN 81-7808-556-9

R6.N. Deo, Graph Theory with application to Engineering and Computer Science, Prentice Hallof India,1990, 0876921454

Web sites

W1.www.nptel.edu

W2.www.w3schools.com

W3.www.wikipedia.com

Teaching Aids Used:

C: Chalk and Talk L: LCD PPT Presentation G: Guest Lectures


16/16

O: OHP V: Video Lectures

Documents

SE Session Plan