Dat e of C om m enc e m ent : 21/ 06/ 12 JS PMs

Dat e of C oncl usi on : 11 / 1 0/ 12

Rajarshi Shahu College o f Engineering

T ath aw ad e, Pu n e -3 3 Dep art men t of In f or mati on T ech n ol ogy

Teaching Plan
Class:- SE Year:-2012-13 Sub:- DEL Sem:- I ---------------------------------------------------------------------------------------------------------------------

No. of Lectures Planned:-44

Lecture Topics to be Covered No. Unit I: Number System& Logic Design Minimization Techniques 1 Introduction. Binary, Hexadecimal numbers, Octal numbers and number conversion. 2 Signed Binary number representation. Signed Magnitude, 3 1s complement and 2s complement representation Binary, Hexadecimal Arithmetic, 2s complement arithmetic Algebra for logic circuits : Logic variables; Logic function : NOT, AND, NOR, XOR, OR, XNOR, NAND Codes : BCD, Excess-3, Gray code , Binary Code and their conversion Boolean algebra. Truth tables and Boolean algebra. Idealized logic gates and symbols DeMorgan's rules Axiomatic definition of Boolean algebra, Basic theorems and properties of Boolean algebra Unit II: Logic Families TTL: Standard TTL characteristicsSpeed, power dissipation, fan-in, fan-out, current and

Planned Date

Actual Date

Books Referred

Teaching aid used

21/06/12

22/06/12

25/06/12

4 5

26/06/12 27/06/12

6 7

02/07/12 03/07/12

4/07/12

05/07/12

10

07/07/12

11 12 13

14

15

16 17

18

19

20 21

22

23

voltage parameters, noise margin, operating temperature etc. Operation of TTL NAND gate. TTL Configurations- Active pull-up, Wired AND, totem pole, open collector CMOS: CMOS Inverter, CMOS characteristics, CMOS configurations- Wired Logic, Open drain outputs. Interfacing: TTL to CMOS and CMOS to TTL Unit III : (8 Hrs) Combinational Logic Logic minimization Representation of truth-table, SOP form, POS form, Simplification of logical functions Minimization of SOP and POS forms, Dont care conditions Reduction techniques: K-Maps (only up to 4 variables) & Quine McClusky technique Arithmetic Operations: - Binary Addition, Subtraction, BCD Addition Circuits: - Half- Adder, Full Adder, Half Subtract or, Full Sub tractor, BCD adder using and subtract using 7483 look ahead and carry, parity generator and checker using 74180 magnitude comparator using 7485, Multiplexers (MUX) : Working of MUX, Implementation of expression using MUX (ICD74153, Demultiplexers 74151). Demultiplexers (DEMUX):Implementation of expression using DEMUX, Decoder. (IC 74138). Unit IV : (8 Hrs) Sequential Logic Introduction: Sequential Circuits. Difference between combinational circuits and sequential

10/07/12 11/07/12 12/07/12

17/07/12

18/07/12

19/07/12 21/07/12

24/07/12

25/07/12

26/07/12 31/07/12

01/08/12

2/08/12

24

25 26 27

28 29

30

31 32 33 34 35 36 37

38

39

circuits Flip- flop : SR, JK18/09 D, T; Preset & Clear, M19/09aster and Slave Flip Flops their truth tables and excitation tables Conversion from one type to another type of Flip Flop Study of7473,7474,7476 Application of Flip-flops. Bounce Elimination Switch, registers, counters Registers : Buffer register; shift register;7495 Counters : Asynchronous counter. Synchronous counter, ring counters, BCD Counter, Johnson Counter Modulus n counter(IC 7490, 74191), Pseudo Random Binary Sequence Generator, Sequence generator and detector Unit V : (8 Hrs) ASM & Programmable Logic Devices Algorithmic State Machines,ASM charts, notations design of simple controller, multiplexer controller method Examples. Sequence Generator, Types of Counter Programmable Logic Devices PLD: PLA- Input, Output Buffers AND, OR, Invert/ Non-Invert Matrix Design Example- Any 4 Variables SOP function using PLDs Study of basic architecture of FPGA CPLD Unit VI : (6 Hrs) VHDL and Introduction to Microprocessors Introduction to HDL, VHDLLibrary, Entity, Architecture, Modeling Styles Concurrent

4/08/12

7/08/12 8/8/12 9/08/12

14/08/12 16/08/12

18/08/12

21/08/12 22/08/12 23/08/12 28/08/12 29/08/12 30/08/12 01/09/12

4/09/12

5/09/12

40

41

42

43

44

and Sequential Statements, Data Objects & Data Types Attributes Design Examples. VHDL for Combinational Circuits-Adder VHDL for Sequential CircuitsSynchronous and Asynchronous Counter. ,Shift Register Introduction to Microprocessor. Introduction of Ideal Microprocessor, Data Bus Address Bus, Control Bus, 8085 Programmers model as an example. University Question paper discussion

06/09/12

11/09/12

12/09/12

13/09/12

18/09/12

Text Books T1. James Bignell, Robert Donavan Digital Electronics 5th edition Cengage Learning 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 McGraw 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 (Subject In charge)

Prof. S.V. Kedar (HOD IT)

Dat e of C om m enc e m ent : 21 / 06/ 1 2 JS PMs

Dat e of C oncl usi on: 11/ 10 / 12

Rajarshi Shahu College o f Engineering

T ath aw ad e, Pu n e -3 3 Dep art men t of In f or mati on T ech n ol ogy

Teaching Plan
Class:- SE Year:-2012-13 Sub:- Fundamental of Data Structure Sem:- I ---------------------------------------------------------------------------------------------------------------------

No. of Lectures Planned:-46

Lecture Topics to be Covered No. Unit I:Introduction Introduction to C 1 Constants, variables and keywords in C, operators and control structure in c(decision, loop and case), functions, macros, arrays and string manipulation, structure, union, enumeration, bitwise operations

Planned Date

Actual Date

Books Referred

Teaching aid used

21/6/2012

2 3 4 5 6 7 8 Unit II: Arrays & Pointers in C 9 Functions: Parameter passing call by value and call by reference, scope rules, functions and pointers, function returning pointer and pointer to function, String manipulations using arrays,pointer to pointer. Structure and Union: Passing and returning structure as parameter for

function ,structure and pointer. Recursion: Definition, writing recursive functions & how recursion works. 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39

automatic feature extraction Unit VI: Searching the Web Searching the Web, Challenges Characterizing the Web, Search Engines, Browsing Mata searchers, Web crawlers, robot exclusion, Web data mining, Metacrawler,

02/03/12 06/03/12 07/03/12 08/03/12 09/03/12

40 41 42

Collaborative filtering, Web agents (web shopping, bargain finder) Economic, ethical, legal and political issues University Question paper discussion

13/03/12 14/03/12 15/03/12

Text Books : T1: Yates & Neto, "Modern Information Retrieval", Pearson Education, ISBN 81-2970274-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 and sons Inc., ISBN 9780-170-52684-2. R3: V. S. Subrahamanian, Satish K. Tripathi Multimedia information System, Kulwer Academic Publisher. R4: Chabane Djeraba, Multimedia mining A highway to intelligent 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 multimedia

Prof. Dipmala Salunke (Subject In charge)

Prof. S.V. Kedar ( HOD IT)

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

Date of Conclusion:

JSPMs Rajarshi Shahu College of Engineering Department of Information Technology Teaching Plan, Semester-I (2012-13)
Name of the Staff: Name of the Subject: Department: -I.T. Prof. D. H. Patil Humanities and Social Science No. of Lect. Planned: 38

Class: - SE IT

Sr. No.
1. 2.

Topic(s) to be covered

Planned Date
25/6/2012 26/6/2012 27/6/12 6/7/12 2/7/12

Actual Date

Book/ Teach Website aid Us Referred

Introduction of Humanities and Social Science Unit 1: Indian Society: 06 Introduction 3. Structure of Indian Society, Indian Social Demography Social and Cultural, 4. Differentiations: caste, class, gender and tribe; 5. Institutions of marriage, family and kinship 6. Secularization Social Movements and Regionalism- Panchayatraj, Institutions; Indian constitution; 7. Affirmative Action Programme of the Government-various reservations and commissions. 8. Unit II : Social Development : 06 Introduction 9. Scientific approach to the study of human beings 10. Evolution of human kind, 11. Social change and evolution 12. Industrial revolution. 13. National policy on education 14. Health and health care and human development 15. Unit III: Sectoral Development: 06 Introduction 16. Agriculture: Technology changes, Green revolutions, 17. Employment Rural & Urban, Government Schemes

3/7/12

4/7/12 9/7/12 10/7/12 11/7/12 16/7/12 17/7/12 18/7/12 23/7/12 24/7/12 25/7/12

18. Industrial Development : Strategies, 19. Public & Private Sectors, 20. Categories, infrastructure, transport & communication, 21. Consumer Awareness 22. Classroom Test and Assessment 23. Unit IV: Environment & Ecology: 06 Introduction: Ecosystems: Structure, Working, components 24. Pollution: Water & Air Pollution, Global Warming 25. Control Strategies, International Treaties. Energy Sources: Renewable & Non Renewable 26. Ocean, Geothermal & Tidal, Global Environmental Issues: Population Growth, 27. Soil Degradation, Loss of Biodiversity 28. Unit V: Economic Development: 05 Introduction 29. Need for planned economic development Law of demand and supply. 30. Planning objectives, five year plans, Priorities and problems. Population and development

30/7/12 31/7/12 1/8/12 6/8/12 7/8/12 8/8/12 13/8/12 14/8/12 20/8/12 21/8/12 22/8/12 27/8/12 28/8/12

31. Indian Economics basic features, natural recourses population size and composition 29/8/12 32. National income concepts, micro economics of 3/9/12 India, inflation 33. Unit VI : Banking & Trades: 05 4/9/12 Introduction 34. Financial Analysis, Ratios, Cost Analysis, 5/9/12 35. Financial Institutions, Finance Commissions, 10/9/12 Budget Analysis. 36. Indian Banking, Role of Reserve bank of India 11/9/12 37. International Economy, WTO, 12/9/12 International aid for economic growth. 38. Question Paper Discussion 17/9/12

HOD Signature Signature

Reference Books

Staff

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

Date of Commencement: 21/06/2012

Date of Conclusion: 10 /10/2012

JSPMS RAJARSHI SHAHU COLLEGE OF ENGINEERING Tathawade, Pune -33. Teaching Plan[Remidial], Semester I (2012-13) Department : IT Name of Staff : Prof. V.D.Shinde No. of Lects. Planned : 12 Sr. No. Topic Name Sets and Propositions Universal and Existential Quantifiers, Normal forms methods of proofs, Mathematical Induction. Graphs planer graph Travelling salesman problem Trees Prims algorithms for minimal spanning tree The Max flow Min cut theorem (transport network) Relations and Functions Discrete Numeric functions and Generating functions, Job scheduling Problem. Recurrence Relations Total solutions, solutions by the method of generating functions Permutations, Combinations and Discrete Probability Discrete Probability, Conditional Probability Bayes Theorem, Information and Mutual Information Planned Date 29/6/12 6/7/12 Class Name of Subject : S.E. : DS

Actual Date

Book/ Website Referred

Teachingaid Used C C

1. 2.

3. 4.

13/7/12 20/7/12

C C

5. 6.

27/7/12 3/7/12

C C

7.

10/7/12

C C

8.

17/7/12

C C

9. 10.

24/8/12 3/8/12

C C

11. 12.

Groups and Rings Field, Ring Homomorphism Polynomial Rings and Cyclic Codes

C 7/9/12 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- 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,2 nd 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,Pearson Education,2002, ISBN 81-7808-556-9 R6. N. Deo, Graph Theory with application to Engineering and Computer Science, Prentice Hall of India,1990, 0 87692 145 4

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 O: OHP V: Video Lectures

Date of Commencement: 21/06/2012

Date of Conclusion:10 /10/2012

JSPMS RAJARSHI SHAHU COLLEGE OF ENGINEERING Tathawade, Pune -33. Teaching Plan, Semester I (2012-13) Department : IT Name of Staff : Prof. V.D.Shinde No. of Lects. Planned : 39 Sr. No. Topic Name Planned Date Class Name of Subject : S.E. : DS

Actual Date

Book/ Website Referred

Teachingaid Used

13. 14. 15. 16. 17. 18.

Sets and Propositions Sets, Combination of sets Finite and Infinite sets Un-countably infinite sets Principle of inclusion and exclusion Multisets,Propositions, Conditional Propositions Logical Connectivity, Propositional calculus Graphs Basic terminology multi graphs and weighted graphs paths and circuits shortest path in weighted graph Hamiltonian and Euler paths circuits, factors of a graph Trees Trees, rooted trees, path length in rooted trees prefix codes, binary search trees spanning trees and cut set minimal spanning trees

21/6/12 25/6/12 27/6/12 28/6/12 2/7/12 4/7/12

19. 20. 21. 22. 23. 24. 25. 26. 27. 28.

5/7/12 9/7/12 11/7/12 12/7/12 16/7/12 18/7/12 19/7/12 23/7/12 25/7/12 26/7/12

29. 30. 31.

32. 33. 34.

35. 36.

37.

38. 39.

40. 41. 42. 43. 44. 45.

cut set, minimal spanning trees Kruskals algorithms for minimal spanning tree Relations and Functions Properties of Binary Relations, Closure of relations Warshalls algorithm, Equivalence Relations and partitions, Partial ordering relations and lattices, Chains and Anti chains Functions, Composition of functions Invertible functions, Pigeonhole Principle Recurrence Relations Recurrence Relation, Linear Recurrence Relations With constant Coefficients Homogeneous Solutions Total solutions, solutions by the method of generating functions Permutations, Combinations and Discrete Probability Permutations and Combinations: rule of sum Rule of product Permutations Combinations Algorithms for generation of Permutations Algorithms for generation of Combinations Groups and Rings Algebraic Systems, Groups, Semi Groups, Monoid

30/7/12 1/8/12 2/8/12

6/8/12 8/8/12 9/8/12

13/8/12 16/8/12

20/8/12

22/8/12 23/8/12

27/8/12 29/8/12 30/8/12 3/9/12 5/9/12 6/9/12

46.

10/9/12

47. 48. 49. 50. 51.

Subgroups, Permutation Groups Codes and Group codes Isomorphism and Automorphisms Homomorphism and Normal Subgroups Ring,Integral Domain

12/9/12 13/9/12 17/9/12 20/9/12 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,2 nd 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,Pearson Education,2002, ISBN 81-7808-556-9 R6. N. Deo, Graph Theory with application to Engineering and Computer Science, Prentice Hall of India,1990, 0 87692 145 4

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

O: OHP V: Video Lectures