TECHNICAL INFORMATION

First Year BCS(FYBCS) Passed Out Year 1999 onwards

Course	Name with brief contents	Hours
1	Mathematics-I (Discrete Mathematics)	120
2	Mathematics-II (Algebra)	120
3	Mathematics-III (Geometry & Calculus)	120
4	Electronics-I (Linear Electronics)	120
5	Electronics-II (Digital Electronics)	120
6	Statistics-I (Statistical Methods I)	120
7	Statistics-II (Statistical Methods II)	120
8	Computer Science-I (Introduction to Computers & Data Processing)	120
9	Computer Science-II (Introduction to Programming)	120
10	Lab Course in Electronics	108
11	Lab Course in Statistics	108
12	Lab Course in Computer Science	144

Appendix to T.Y.B.A. & F.Y.B.C.S. Statistics UNIVERSITY OF PUNE
The nature of the question papers from F.Y. to T.Y.B.A., B.Sc. and F.Y.B.C.S. Statistics.
(1) There should be in all six questions which are all Compulsory.
(2) The distribution of marks would be as follows.

Question No	Marks
1.	18
2.	16
3.	16
4.	16
5.	16
6.	18

(3) The First Three questions should be preferabally based on approximately the first half of the syllabus and last three questions on the 2nd half of the syllabus.
(4) The 50% internal option should be given in each question i.e. two out of four etc. be asked. It is also resolved that the above change will come into effect from April 1999, Examination onwards office should get the approval of higher authorities this should be brought to the notice of concerned Heads of Depts. & Principal of the Colleges using a circular.

DETAILED SYLLABUS FOR EACH PAPER
Computer Science
Notes :
   (1) There will be Three papers in Computer Science :
        PAPER-I & PAPER-II will be theory, Each Of 100 marks & PAPER-III will be a lab course of 100 marks.
   (2) Work Load :
      (a) THEORY : Three lectures per theory course per week.
      (b) LAB COURSE : Four lectures ( three hours ) per week, per batch, per lab course .

PAPER I : INTRODUCTION TO COMPUTER & DATA PROCESSING

1. COMPUTER SYSTEM CHARECTERSTICS & CAPABILITY (TOTAL LECTURES: 4)
     1.1 BASIC STRUCTURE, ALU, MEMORY, CPU, 1/0 DEVICES.
     1.2 DEVELOPMENT OF COMPUTERS.
     1.3 CLASSIFICATION OF COMPUTERS (PC, SERVER, WORK STATION)
2. DATA REPRESENTATION WITHIN COMPUTER. (TOTAL LECTURES 6)
     2.1 BIT, BYTE, WORD.
     2.2 ASCII, EBCDIC, BCD CODE,
     2.3 DATA MANIPULATION (BINARY ARITHMETIC).
3. OPERATING SYSTEM (DOS) (TOTAL LECTURES : 6)
     3.1 FUNDAMENTAL OF DOS.
     3.2 PHYSICAL STRUCTURE OF DISK DEVICE NAMES.
     3.3 GETTING STARTED WITH DOS.
     3.4 FILES & DIRECTORY.
     3.5 DOS COMMANDS (INTERNAL & EXTERNAL).
4. OPERATING SYSTEM (UNIX) (TOTAL LECTURES : 4)
     4.1 BATCH PROCESSING, ONLINE PROCESSING, MULTIPROGRAMMING, TIME SHARING, REAL TIME.
5. INPUT DEVICES (TOTAL LECTURES : 4)
     5.1 KEYBORD ENTRY.
     5.2 DIRECT ENTRY : CARD READERS, SCANNING DEVICES (BAR CODE, OMR, MICR), VOICE INPUT DEVICES POINTING DEVICES (LIGHT PEN, MOUSE, TOUCH SCREEN, DIGITIZER).
6. MEMORY (TOTAL LECTURES: 4)
     6.1 RAM, ROM, PROM, FPROM, Etc.
     6.2 BASE MEMORY, EXTENDED MEMORY, ENHANCED MEMORY.
     6.3 STORAGE DEVICES (TAPE, FDD HDD
     6.4 CD-ROM.
7. OUTPUT DEVICES (TOTAL LECTURES : 4)
     7.1 PRINTERS : DOT MATREX, INK-JET, LASER,.PLOTTERS
     7.2 CRT, LCD, PLASSMAA DISPLAY.
8. DATA PROCESSING. (TOTAL LECTURES: 6)
     8.1 DATA INPUT, MANIPULATION, INFORMATION.
     8.2 FILES AND RECORDS.
     8.3 FILE CREATION, ACCESS, MANIPULATION AND MAINTENANCE.
     8.4 FILE ORGANIZATION.
9. OPERATING ENVIRONMENT (WINDOWS). (TOTAL LECTURES: 1O)
     9.1 FEATURES OF MS-WINDOWS : GUI MULTITASKING ETC.
     9.2 MAIN MODULES OF WINDOWS O.S. PROGRAM MANAGER, FILE MANAGER PRINT MANAGER, CONTROL PANEL, NETWORKS
     9.3 ELEMENTS OF WINDOWS: DESKTOP, WINDOWS, APPLICATION, ICONS, GROUP WINDOW.
     9.4 SWITCHING BETWEEN APPLICATIONS, RUNNING MS-DOS APPLICATIONS, WINDOWS HELP. 9.5 WINDOWS ACCESS-ORIES : WRITE, NOTEPAD, PAINTBRUSH ETC.
     9.6 NETWORKING ENVIRONMENT CONCEPT OF INTERNET, INTERANET, THEIR USES AND BENEFITS..
10. EDITOR AND WORDPROCESSUR. (TOTAL LECTURES:8)
     10.1 BASIC CONCEPTS.
     10.2 COMMANDS.
     10.3 EXAMPLES : NE, WORDSTAR, MS- WORD, VI EDITORS.
     10.4 INTRODUCING DESKTOP PUBLISHING, INDIAN LANGUAGE WORD PROCESSORS.
11. SPREADSHEET AND DATABASE PACAKAGES. (TOTAL LECTURES 8)
     11.1 PURPOSE, USAGE.
     11.2 ELEMENTARY COMMANDS.
     11.3 MS-EXCEL.
     11.4 CREATION AND MANIPULATION OF FILES IN MS-ACCESS.
REFERENCE BOOKS
     1. COMPUTERS TODAY BY S. BASANDRA.
     2. FUNDAMENTALS OF COMPUTERS BY V. RAJARAMAN.
     3. COMPUTER AND COMMONSENSE BY R. HUNT AND SHELLY.

PAPER II : INTRODUCTION TO PROGRAMMING

1. ALGORITHM (TOTAL LECTURES : 6)
     1.1 DEFINITIONS & PROPERTIES.
     1.2 DEVELOPING WELL KNOWN ALGORITHMS.
2. FLOWCHARTS (TOTAL LECTURES :4)
     2.1 PRINCIPLES OF FLOWCHARTING.
     2.2 FLOWCHARTING SYMBOLS.
     2.3 CONVERTING ALGORITHMS TO FLOW CHARTS.
3. INTRODUCTION (TOTAL LECTURES: 2)
     3.1 HISTORY, HIGHLEVEL, LOW LEVEL, ASSEMBLY & Etc.
     3.2 COMPILERS,INTERPRETERS, ASSEMBLERS, LINKERS, LOADERS.
     3.3 INTRODUCTION TO PASCAL.
     3.4 PASCAL PROGRAM STRUCTURE.
4. SIMPLE DATA TYPES (TOTAL LECTURES: 2)
     4.1 INTEGER, REAL, CHAR, BOOLEAN, CONSTANT.
     4.2 SIMPLE ASSIGNMENTS.
5. DATA INPUT & OUTPUT (TOTAL LECTURES:4)
     5.1 INPUT, OUTPUT FILE.
     5.2 READ, READLN, WRITE, WRITELN.
     5.3 EOLN, & EOF FUNCTIONS.
     5.4 FORMATTED OUTPUT.
6. CONTROL STRUCTURES. (TOTAL LECTURF-S:8)
     6.1 IF, WHILEDO, REPEAT UNTIL, FOR CASE, GOTO.
     6.2 CONVERTING FLOWCHART TO PROGRAMME.
7. FUNCTIONS & PROCEDURES. (TOTAL LECTURES:8)
     7.1 PROCEDURE DECLARATION.
     7.2 PARAMETER PASSING.
     7.3 FUNCTION.
     7.4 RECURSION.
8. ARRAYS. (TOTAL LECTURES: 8)
     8.1 ONE DIAMENSIONAL - CONCEPT, DECLARATION, ACCESS.
     8.2 MULTIDIMENSIONAL - CONCEPT, DECLARATION, ACCESS.
     8.3 STRINGS.
     8.4 SUBRANGE & ENUMERATED TYPES.
9. RECORDS. (TOTAL LECTURES: 7)
     9.1 DEFINITION & DECLARATION.
     9.2 VARIANT & INVARIANT.
     9.3 PROCESSING A RECORD.
     9.4 WITH STRUCTURE.
10. POINTERS & LISTS (TOTAL LECTURES 8)
     10.1 DEFINITION & DECLARATIONS.
     10.2DYNAMIC ALLOCATIONS.
     10.3 LINKED LIST HANDLING.
11. SETS. (TOTAL LECTURES : 4)
     11.1 DEFINITION, CONSTRUCTING A SET.
     11.2 OPERATIONS WITH SETS.
12. FILES. (TOTAL LECTURES 5)
     12.1 DEFINITION.
     12.2 FILE OF RECORDS.
     12.3 TEXT FILES.
REFERENCE BOOKS
     1. ART OF COMPUTER PROGRAMMING VOL-I (FUNDAMENTAL ALGORITHM)- BY KNUTH
     2. PROGRAMMING WITH PASCAL BY GOTTFRIED.
     3. PROGRAMMING WITH PASCAL BY K. T. SHRIDHAR.
     4. PROGRAMMING & PROBLEM SOLVING WITH PASCAL BY SCHNEIDER & BRUELL.
     5. ALGORITHMS BY Dr, MUKUND SANGLIKAR, PUBLISHED BY BOMBAY MATHEMATICAL COLLOGIUM.

PAPER III : LABORATORY COURSES IN COMPUTER SCIENCE

FIRST TERM

DOS & PASCAL.

ALGORITHMS & FLOWCHARTS - EXAMPLES INVOLVING CONDITIONS, INTERACTION & ERROR CHECKING. DOS - IMPORTANT

INTERNAL & EXTERNAL COMMAND.

INTRODUCTION TO TURBO EDITOR COMMANDS, BLOCK COMMANDS.

PROGRAMMING INVOLVING IF & CASE CONSTRUCT.

PROGRAMMING INVOLVING FOR, WHILE REPEAT.

PROGRAMS HAVING FUNCTIONS & PROCEDURES.

SECOND TERM

DATA PROCESSING & PROGRAMMING PRACTICALS.

INSTALLING A COMPUTER SETUP : ATTACHING PHERIPHERALS SUCH AS MOUSE, PRINTER, FORMATTING FLOPPY & HARD

DISKS, INSTALLING DOS & OTHER SOFITWARE.

PROGRAMS INVOLVING ARRAYS.

UNIX BASIC COMMANDS.

WINDOWS BASIC OPERATING COMMANDS.

USING EDITORS & WORD PROCESSORS.

USING SPREADSHEETS.

PROGRAMS INVOLVING RECORDS & FILES.

CREATING & MANIPULATING FILES WITH ANY DATABASE PACKAGE.

INTERNET BROWSING, EMAIL.

USAGE OF MULTIMEDIA.

Electronics
Note.: There will be three papers in Electronics, paper I and II will be theory papers each of 100 marks. Paper III will be Practical course of 100 marks.

PAPER I : ELECTRONICS (LINEAR ELECTRONICS)

FIRST TERM

1. INTRODUCTION TO COMPONENTS

Resistors, Capacitors, Inductors, Transformers, Charging and Discharging of Condensers, Decay and growth in L-C and R-C circuits. LCR series and parallel circuits. (10)
2. NETWORK THEOREMS

Ohms Law, Kirchhoff s laws, Thevenins Theorem, Norton's Theorem, Superposition Theorem, Maximum power transfer Theorem, Substitution theorem (only statements and applications to problems, no proof) (applications to d.c.only) (12)
3. SEMICONDUCTORS

Classification on the basis of band theory, Intrinsic and Extrinsic Semiconductors, p-n junction (basic principle of operation), p-n junction diode and its applications (Rectification, clipping, clamping), zener diode and its use as a voltage regulator (Concept of Load and Line regulation), Light emitting diodes and seven segment displays, photo diodes and photo-resistors (only principle of operation) (10)
4. BIPOLAR JUNCTION TRANSISTORS

Types, (power and RF type), Symbols and identification, Configuration (C-B, C-C, C-E), Biasing method (Potential divider type for C-E only), Load line concept for A.C. and D.C. (Q-Point concept and stability). (6)

SECOND TERM

1. FET, MOSFET

(Types, Working principles and characteristics and applications) (4)
2. AMPLIFIERS

Classification of amplifiers depending on coupling, frequency range, mode of operation and frequency response, CE amplifier, Gain (voltage, current power), frequency response, Types of Amplifiers (concepts only) (8)
3. DIFFERENTIAL AMPLIFIERS

Basic Circuit and principle, Different modes of operation, terms (CMRR, Ad, Ac, TIP bias current, offset current, Input and Output impedance) related with differential amplifier. (4)
4. OPERATIONAL AMPLIFIERS

Symbols, Block diagram, negative feedback, virtual ground concepts, parameters, general applications Inverting, non-inverting amplifier, Adder, Subtractor, Integrator.

Differentiator and comparator. (8)
5. OSCILLATORS

Feedback concept (positive and negative), Basic principle, Barkhausen criteria, Types of Oscillators (RC, LC) (Wein Bridge, Phase Shift, Hartley, Collpitt's and crystal oscillator), Multivibrators (using IC 741, 555) (Derivations expected) applications of oscillators and multivibrators. (12)
RECOMMENDED BOOKS
     1. Principle of Electronics :. V. K. Mchta (New Edition).
     2. Electronics Principle : Malvino.
     3. Basic Solid State Electronics : B. L. Theraja.
     4. Electronic Components : Madhuri Joshl.
     5. Principles of Electronics: B. V. Narayan Rao (Vol. 1, 11, III (New Age Int.).
     6. Text book of F.Y.B.C.S. (Electronics) : Mrs. Deuskar, Prof. Shaligram, Prof. Lele and others.

PAPER II : ELECTRONICS (DIGITAL ELECTRONICS)

FIRST TERM

1. NUMBER SYSTEMS & DATA REPRESENTATION

Binary, BCD, hexadecimal & Octal. Conversion from one another, character codes, excess 3 code, gray codes, error detection & correcting code (parity bits, Hamming codes) (8)
2. LOGIC GATES

Introduction to gates, De Morgan's theorems, conversion of one gate to another, Boolean algebra/ identities, Karnaugh's map (3 & 4 variables,) simplification & logic diagram, half adder, full adder, subtractor, Parallel adders, Introduction to logic families and comparative study (TTL, MOS) and applications of Logic Gates. (16)
3. COMBINATIONAL CIRCUITS

Multiplexers (Principle & tree multiplexing), Nibble multiplexer, IC 74150, Dernultiplexer (Principle & tree demultiplexing), IC 74154, Encoders IC 74148, Decoders IC 74138, IC 7447. (12)

SECOND TERM

1. SEQUENTIAL CIRCUITS

Flip flops (Principle of operation, Types), IC 7474, 7475, Counters (Syncronous, Asyncronous concepts only) IC 7490, Modular counters, Shift register IC 7495, Ring counter, shift counter. (16)
2. DATA CONVERTER

D to A converster (R-2R & Binary weighted), A to D converster (All Types) (14)
3. MEMORY DEVICES

RAM, ROM, EPROM, PROM, Principle of static & dynamic memories. (10)
RECOMMENDED BOOKS
     1 Digital principle & Applications Malvino Leech.
     2 Digital Principles Floyd
     3 Digital Electronics C. F. Strangio
     4 Modem Digital Electronics R. P. Jain
     5 Principles of Electronics B. V. Narayan Rao (III Edition)

PAPER III : ELECTRONICS (LAB WORK)

GROUP A

1. Study of components like R. L. C. Transistors, Diodes, FET, LED'S, (Identification, noting parameter using manual)
2. Study of Instruments & measurement techniques (P/S, Multivibrators, C.R.O. Signal Generator, Dimmerstat)
3. KCL, KVL.
4. Zener Diode (Characteristics) as a voltage regulator.
5. CE Amplifier (Gain & Bandwidth).
6. Use of C. R. 0. for amplitude, frequency & Phase Measurement.
7. Rectifier circuits with filter.
8. Regulators using zener & 3 pin IC's.
9. Phase shift oscillator.
10. Op.Amp. as an adder, subtractor.

GROUP B TERM

1. Transistor as a switch
2. Logic gates AND, OR, NOT, EXOR, NAND, NOR
3. Study of Flip Flop (R-S and D Type)
4. IC 7490 as a scalar
5. Verification of De Morgan's Theorem.
6. Multiplexer, Demultiplexer using gates.
7. IC 555 Multivibrator, (Astable).
8. Half adder & Full adder, (Using logic gates)
9. Interconversion of one gate into other.

ALL THE STUDENTS SHOULD DO 16 EXPERIMENTS, OUT OF WHICH, EIGHT EXPERIMENTS SHOULD BE FROM GROUP A AND OTHER EIGHT FROM GROUP B

Mathematics
Note.:1. There will be three theory papers in Mathematics each of 100 marks.
2. In all papers, emphasis shall be on studying mathematical concepts and tchniques.

PAPER I : DISCRETE MATHEMATICS

FIRST TERM

Revision : Set Theory (1 lecture)

1. Finite Induction (3 lectures)
     1 Revision of first principle
     2 Generalised first principle of finite induction
2. Elementary Counting Principles (8 lectures)
     1 Functions and counting.
     2 Combinatorial arguments.
     3 Principle of Inclusion and Exclusion.
     4 Infinite sets and countability.
3. Generating Functions (12 lectures)
     1 Ordinary and exponential generating functions
     2 Basic properties of generating functions
     3 Enumerators
     4 Applications to partitions, Ferrer's graphs, dual partitions
     5 Probability generating functions
     6 Applications to solving recurrence relation.
4. Recurrence Relations (8 lectures)
     1 Recurrence relations : Introduction
     2 Linear recurrence relation with constant coefficients
     3 Homogeneous solutions and total solutions.
     4 Particular solutions and total solutions.
5. Logic (8 lectures)
Revision: Propositions, Logical connectives, truth tables, propositional form, logical equivalence, tautology and contradiction
     1 Predicates
     2 Valid arguments and proofs
     3 Proofs in Mathematics.

SECOND TERM

6. Graphs (6 lectures)
     1 Definition and elementary results
     2 Types of graphs
     3 Isomorphism
     4 Adjacency and incidence matrix
     5 Degree sequence and Havel-Hakimi theorem (without proof).
7. New Graphs from old ones (3 lectures)
     1 Subgraphs, induced subgraphs
     2 Complement of a graph, self-complementary graphs
     3 Union, intersection, ring-sum of two graphs.