B.Sc. – Syllabus 2002-2003

Curriculum and Scheme of Examination

for

B.Sc. Programme

Class Paper Paper Name Max Time Paper Name Max Time

Code Marks Marks

I Introduction to Computer Fundamental 33 3 hrs.

II Digital Computer Organization 33 3 hrs. B. Sc. - I III Programming with ‘C’ 34 3 hrs.

IV Software Lab (Understanding of OSs like 50 4 hrs.

DOS, UNIX & Windows, Programming in

C)

I File Organization and Data Structure 33 3 hrs.

through C

B. Sc. - II II Data Base Management System 33 3 hrs.

III Computer- oriented Numerical Analysis 34 3 hrs.

IV Software Lab (Data structure problems & 50 4 hrs.

SQL Programming)

I Operating Systems 33 3 hrs.

II Internet & its Applications 33 3 hrs. B. Sc. - III III Object- oriented Programming with C++ 34 3 hrs.

IV Software Lab ( C++ &Mini- project) 50 4 hrs.

1

B.Sc. – Syllabus 2002-2003

Paper I- INTRODUCTION TO COMPUTER FUNDAMENTAL Paper I- INTRODUCTION TO COMPUTER FUNDAMENTAL

Time : 3 Hrs Max. Marks : 33

NOTE : Ten question are to be set taking two questions from each unit. The student has to attempt FIVE questions taking one question from each unit. The previous year paper/ model paper may be

used as a guideline and the following syllabus should be strictly followed while setting the question paper.

UNIT- I

[6 Marks]

Introduction : Introduction to computers & their uses; Historical development of hardware & software of Computer System up to fifth generation computers, Classification of Computers, Distributed computer systems.

Number systems & codes : Binary, Octal and Hexadecimal numbers & their arithmetic; Subtraction of binary numbers using one's & two's complements; EBCDIC & ASCII codes, Floating point numbers and their representation & arithmetic.

UNIT- II

[6 Marks]

Programming Language: Classification machine code, assembly language, higher level language, fourth generation languages;

System software tools : Assemblers, Linker, Loaders, Macros, Compilers, Formal system – a brief discussion

of each of these components.

UNIT– III

[7 Marks]

DOS and UNIX operating systems : Booting procedure, Components of DOS, Directory Structure, Internal and External Commands; Multi user and Timesharing systems, File system in Unix, Uprooted Tree Structure, Types of files – File system, Normal, Directory and special files, Permission on file, Security –

Owner, Group, others, Commands and filters Piping – Test for operations.

UNIT - IV

[7 Marks]

Computers and Communication : Single user, multi- user, work station, client server systems; Computer networks, Network protocols, LAN, WAN, Internet facilities through WWW, Mosaic, Gopher, Purposes and applications of HTML.

UNIT – V

[7 Marks]

Computer Memory & Storage Devices : Primary Memory & Secondary Memory; Methods of Sequential & Direct storage , Magnetic tape & Magnetic Disk Drive (Data Representation, Read/Write Mechanism), Floppy disk drives & Winchester Disk Drive.

RECOMMANDED BOOKS :

1. V. Rajaraman : Computer Fundamentals (PHI) 1998.

2. Peter Norton : Norton’s DOS Guide (PHI). 1998.

3. J. J. Manager : UNIX : The Complete Book (Sigma Galgotia Publication). 1997.

2

B.Sc. – Syllabus 2002-2003

PAPER II – DIGITAL COMPUTER ORGANIZATION

Time : 3 Hrs Max. Marks : 33

NOTE : Ten question are to be set taking two questions from each unit. The student has to attempt FIVE questions taking one question from each unit. The previous year paper/ model paper may be

used as a guideline and the following syllabus should be strictly followed while setting the question paper.

UNIT – I

[7 Marks]

Boolean Algebra and Logical gates : Logical statements, Boolean algebra; De Morgan's Theorems, Logical circuits & logical gates, AND, OR, XOR, NOT, NAND, NOR gates & their uses in logical design. Circuit designing techniques: SOP, POS and K-map. Applications : Adder, Multiplier, Decoder, MUX and DMUX,

UNIT – II

[7 Marks]

Flip-flops : RS, D , JK, T, Master - Slave.

Applications of flip-flops : Registers, Synchronous and Asynchronous Counters (Designing method), Down Counter, Shift Registers,

UNIT – III

[7 Marks]

Central Processing unit : Introduction; General Register organization; Stack organization; Instruction format and Addressing modes, data transfer and manipulation, Program Control. Control unit : Control memory; Address Sequencing, Micro program example, Design of control unit.

UNIT– IV

[6 Marks]

Arithmetic Algorithms : Integer multiplication using shift and add; Booth’s algorithm; Integer division; Floating point representations and arithmetic algorithms.

I/O Organization : Strobe based and handshake based communications; Modes of transfer, Vector and priority interrupt; DMA based data transfer.

UNIT V

[6 Marks]

Memory Organization : Basic cell of static and dynamic RAM; Building large memories using chips; Associative memory; Cache memory organization and Virtual memory organization.

RECOMMANDED BOOKS :

1. M.M. Mano : Digital Logic and Computer Design (PHI). 1998.

2. M. M. Mano : Computer System Architecture (PHI). 1998.

3

B.Sc. – Syllabus 2002-2003

PAPER III – PROGRAMMING with ‘C’

Time : 3 Hrs Max. Marks : 34

NOTE : Ten question are to be set taking two questions from each unit. The student has to attempt FIVE questions taking one question from each unit. The previous year paper/ model paper may be

used as a guideline and the following syllabus should be strictly followed while setting the question paper.

UNIT – I

[7 Marks]

History of C, Structure of a C program, Data types, Constants, Variables, I/O functions, Arithmetic operators, Unary operators, Relational and Logical Operators, The conditional operators, Operators precedence, Control Statements.

UNIT – II

[7 Marks]

Functions: Defining and accessing a function, Passing arguments to a function, Specifying argument data types, Function Prototypes and Recursion.

Arrays : Defining an array, Processing an array, Passing arrays to a functions, Multi dimensional arrays, Arrays and strings.

UNIT – III

[7 Marks]

Pointers : Fundamentals, Pointer declaration, Passing pointers to a function, Pointer and one- dimensional arrays, Operations on pointers, Pointers and multidimensional arrays, Arrays of pointers, Passing functions to other functions.

Structures & Union: Defining and processing a structure, User- defined data types(typedef); Structures and pointers, Passing structure to a function, Self- referential structures and Unions.

UNIT – IV

[7 Marks]

Data files : Opening and closing a data file, Creating a data file, Processing a data file, Unformatted data files; Storage classes : Automatic, External, Register and Static.

UNIT – V

[6 Marks]

Low- level programming : Register variables, Bit wise operations, Bit fields.

Additional Features of C : Enumerations, Command line parameters, Macros and The C processor.

RECOMMANDED BOOKS :

1. B.S. Gotterfried : Programming with C (Schaum’s Outline Series : TMH).

nd2. Kernighan & Ritchie : The C Programming (PHI), 2 Edition.

4

B.Sc. – Syllabus 2002-2003

PAPER – IV: SOFTWARE LAB PAPER – IV: SOFTWARE LAB

Time : 4 Hrs Max. Marks : 50

1. Familiarizing with PC, MS DOS, MS WINDOWS and UNIX commands. File creation, editing and

directory creation. Mastering of MS DOS commands. Learning to use MS office : MS WORD.

2. Preparing Flow charts, writing Algorithms and programming simple numerical problems in C

Language.

3. Writing, Debugging and running string manipulation programs in C Language.

Note : The list of all assignment is to be prepared by the in- charge of practical lab.

5

B.Sc. – Syllabus 2002-2003

PAPER – I : FILE ORGANIZATION & DATA STRUCTURE PAPER – I : FILE ORGANIZATION & DATA STRUCTURE

THROUGH ‘C’ THROUGH ‘C’

Time : 3 Hrs Max. Marks : 33

UNIT – I

[6 Marks]

File System : Files, File Organizations, File Operations, File system, File Directories; Various approaches of File Organization : Sequential File, Relative file and indexed sequential file organizations.

UNIT – II

[7 Marks]

Arrays, Stacks and Queues : Representation of array (single & multi dimensional arrays), Address calculation using column & row major ordering, Representation of stacks & Queues using arrays, circular queues, Applications of stacks, Conversion from Infix to Postfix & prefix and evolution of prefix expressions using stack.

UNIT – III

[7 Marks]

Linked list : Singly linked list (operations on list), Linked stacks and queue, Polynomial representation and manipulation using linked list, Circular linked list and doubly linked list, Generalized list.

UNIT – IV

[6 Marks]

Trees : Logical level of binary search tree, BST transversal methods(Preorder, Post order and In order), Recursive algorithms for traverse methods, Insertion into and deletion from a BST and their implementation, Conversion of a forest into a tree.

UNIT – V

[7 Marks]

Searching and Sorting : Sequential & binary searches, Hashing schemes, Sorting methods(Insertion, selection, Bubble, Quick, Merge and Heap sorts).

RECOMMANDED BOOKS :

1. Langsam, , Moshe, and Tanenbaum : Data Structures Using C and C++ (PHI). 1997.

2. Krush, Leung and Tondo : Data Structures and Program Design in ‘C’ (PHI). 1997.

3. Loomis : Data Management and File Structures (PHI) 1995

6

B.Sc. – Syllabus 2002-2003

PAPER – II : DATABASE MANAGEMENT SYSTEMS PAPER – II : DATABASE MANAGEMENT SYSTEMS

Time : 3 Hrs Max. Marks : 33

UNIT – I

[6 Marks]

Overview of concepts: Definition of DBMS, data independence, Relational Systems and other, Architecture for a Database system - levels, DBA, DBMS, Client server Architecture, Distributed processing.

Relational Data Base: Relational system and its terminology, Relational Model, Optimization, Base Tables and views.

UNIT – II

[6 Marks]

Relational Data objects : Domains and Relations, Kinds of Relations and predicate, Relational Data bases, Relational data Integrity : Candidate keys, Primary keys and Alternate keys, Foreign keys, Foreign keys rules.

UNIT – III

[7 Marks]

Relational Operators : Relational Algebra: Closure , A Syntax for relational Algebra, Traditional Set Operations , Special Relational Operations, Examples, What is the Algebra for?., EXTEND and SUMMARIZE, Update Operations, Relational Comparisons, Tuple Oriented relational Calculus, Example, Relational Calculus vs Relational Algebra, Domain Oriented relational calculus

UNIT – IV

[7 Marks]

Trivial and Non Trivial Dependencies, Closure of a set of Dependencies, Closure of a set of Attributes, Irreducible set of Dependencies.

Database Design: Definition of Functional Dependencies, Normalization, Normal forms based on primary keys(1 NF, 2NF, 3NF & BCNF).

UNIT – V

[7 Marks]

SQL Language : Introduction, Data Definition, Data Manipulation: Retrieval Operations and Update Operation Table Expressions, Conditional Expressions, Scalar Expression, Embedded SQL.

RECOMMANDED BOOKS :

1. Date, C.J. : An Introduction to Database Systems ( Addition- Wesley) 2000.

2. Desai. B. : An Introduction to Database Concepts (Galgotia Publications). 1998.

7

B.Sc. – Syllabus 2002-2003

PAPER – III : COMPUTER- ORIENTED NUMERICAL ANALYSIS PAPER – III :

Time : 3 Hrs Max. Marks : 34

UNIT – I

[7 Marks]

Approximation and Errors in Computation : Accuracy of numbers : Approximate numbers, significant figures, Rounding off; Errors : Inherent error, Rounding error, Truncation error, Absolute error, Relative error, Percentage error; Error in the approximation of a function.

Solution of Algebraic & Transcendental Equations : Iteration method of form x = f(x), Newton-Raphson method & their convergence criteria; Bisection method; Regula- False method, Secant method.

UNIT – II [7 Marks]

Solution of Simultaneous Equations : Direct methods: Gauss Elimination method, Gauss- Jordan method, Pivoting; Iterative method : Jacobi's method, Gauss Seidal method

bbx, Curve Fitting: Principles of least squares, method of Least Squares, Fitting of other curves: y = ax, y = ae

UNIT – III [7 Marks] Operators : Shift, Forward Difference, Backward Difference, Central Difference, Averaging and their relationships, Difference Tables and propagation of error in difference table.

Interpolation: Interpolation with equal intervals : Newton forward & backward difference formula, Stirling’s formula, Bessel’s formula;

Interpolation with unequal intervals : Lagrange's Interpolation formula, Newton's divided difference formula.

UNIT – IV [7 Marks]

Numerical Differential : Formula for First & second derivatives using Newton's forward and backward difference formula...

Numerical Integration: Newton-cote's formula, Trapezoidal rule, Simpson’s 1/3 rule and

Simpson’s 3/8 rule with their error expressions.

UNIT – V [6 Marks]

Numerical Solution of ordinary differential equation : Taylor’s series method, Euler’s method, Modified

thEuler’s method, Runge’s Kutta method of 4 order and Predictor-Corrector method.

RECOMMANDED BOOKS :

1. B.S.Grewal : Numerical Method in engineering & science (Khanna Publishers)

2. M.K.Jain, R.K.Jain, Iyenger : Numerical Methods for Scientific and Engineering Applications (New Age

Publication Ltd.).

8

B.Sc. – Syllabus 2002-2003

PAPER – IV : SOFTWARE LAB PAPER – IV : SOFTWARE LAB

Time : 4 Hrs Max. Marks : 50

1. To develop programs in C using data processing and data structure.

2. Creations of database file, writing SQL queries to retrieve information from the

database and simple processing programs in Fox pro .

Note : The list of all assignment is to be prepared by the in- charge of practical lab.

9

B.Sc. – Syllabus 2002-2003

PAPER I : OPERATING SYSTEMS PAPER I : OPERATING SYSTEMS

Time : 3 Hrs Max. Marks : 33

UNIT – I

[6 Marks]

Operating system definition and concepts : Operating System as resource manager, Operating system classifications- Simple monitor, Multiprogramming, Time sharing, Real time systems, Multiprocessor systems.

Components of operating system, Operating system services.

UNIT – II

[6 Marks]

CPU scheduling : Basic scheduling concepts, Process overview, process states, Schedulers and scheduling algorithms, Multiple-processor scheduling.

UNIT – III

[7 Marks]

Deadlocks : Deadlock characterization, Deadlock Prevention, Avoidance Deadlock, Deadlock Detection and Recovery.

UNIT - IV

[7 Marks]

Memory Management : Introduction, Single contiguous memory management, Fixed partitioned memory management, Variable partitions, Non- contiguous allocation, Paging, Segmentation, Virtual memory management Systems, Demand paging..

UNIT – V

[7 Marks]

File systems: File supports, access methods, allocation methods-contiguous, linked and index allocation; Directory systems-single level, tree-structured, a cyclic graph and general graph directory, file protection.

Security and Resource Protection : Security threats, Attacks on security, Security Violation through parameters, Security design principles, Authentication, Protection Mechanisms, Policies and domain of protection, Access matrix and its implementation, Dynamic protection structures.

RECOMMANDED BOOKS :

1. Silberschatz, Galvin - Operating System Concepts (Addition Wesley).1998.

2. Mednick and Donowon :Principles of Operating Systems (TMH).

10