UNIVERSITY COLLEGE OF SCIENCE

MOHAN LAL SUKHADIA UNIVERSITY

Udaipur 313002 (Rajasthan)

ADMISSION NOTICE

Bachelor of Computer Science (B.C.A.)

(Three Year Professional Degree Course)

Application are invited for admission in B.C.A. course for the session 2006-07 under “Self Finance Scheme”

Number of Seats:- 120(Reservation for SC/ST/OBC and others as per Govt. Rajasthan Rules. NRI/Foreign will be admitted directly against available under NRI/Foreign students quota as per university rules

Eligibility:- Students  who have passed/appeared 10+2 school examination in Arts/Commerce/Science and having secured a minimum of 50 % marks will be eligible for admission. Candidate  from outside state with a minimum of 60% marks (First Division) will be eligible for admission.

Entrance Test:- The admission will be made through an Entrance test to be conducted on 16^th  June,2007 from 11.00 AM to 1.00 PM at
University College of Science Campus (Old M.B College).

COURSE FEES:- Rs 18,000/-per annum each + Appx. Rs 1000 p.a Local fund fees.

Application form along with Information booklet containing details of Entrance Test etc. can be obtained from COMPUTER CENTER of the college  during office hours by paying Rs. 500/- in cash(Inclusive of /Entrance Test Fee) or by sending a Demand Draft for Rs.550/- in favour  of Head ,Department of Physics MLSU drawn at any bank in Udaipur (Rs.250 cash or Rs 300 by post for SC/ST candidates).

Last Date:-The completed Application form Should reach the office of the Course Director on or before 10^th June,2006

E-mail:bca@mlsu.org, Website:www.mlsu.org                                            

               BACHELOR OF COMPUTER APPLICATION (BCA) 2006-2009

1.  Duration of the Course : The BCA course will be of three years duration. Each year will be approximately 10 months (minimum 150 working days) duration.

2. Medium of Instruction : The medium of instruction and examination shall be English/Hindi.

3.Eligibility:The candidate must have passed 10+2 examinations with at least 50% marks in aggregate (45% in case of SC/ST and OBC candidates).

4.Courses of Study and Examination

  I Year

  II Year

  III Year

5. Scheme of Instruction :

Each year shall be of ten months (150 working days) duration. Details of lecture hours per week shall be as follows:
Theory :  Three hours/week for each Paper
Practical : Students are required to work in the Laboratory for 10 hours/week for each practical under four hours/week faculty guidance for each practical paper.

6. Examination Scheme:

1.University shall conduct examinations only after completion of  150 working days  of   instruction in a year.
2.Each theory paper shall be of 100 marks (75 marks for written examination of 3 hrs duration and  25 marks for internal assessment).

3. Each practical paper shall be of 200 marks (150 marks for practical examination of six hours duration and 50 marks for internal assessment)

4.The internal marks will be awarded by  committee consisting of   Head of the Department, the faculty concerned  and  one of the external practical examiner/University observer  as per following norms.  

5. Total eight questions will be set in each paper out of which students are required to attempt any five

Theory:

1.  Assignments : 40% of the Internal assessment marks for each theory paper will be awarded on the basis of performance in the assignments regularly given to the students, and its records.

2.Internal Examination: 40% of the total Internal Assessment marks for each theory paper will be awarded on the basis of performance in written examination conducted by the faculty, one at the end of  fourth month and another at the end of eighth month.

3. Seminar/Oral examination : 10% of the total internal assessment marks for each paper will be awarded on the basis of performance either in a seminar or internal viva-voce.

4.Overall performance : 10% of the total internal assessment marks will  be awarded for each paper on the basis of performance and conduct in the classroom.

Practical:

Internal marks for each practical paper will be awarded by the faculty through assessment of regularity of the students in completing assignments , submitting reports and records, number of hours spending in the lab ,conduct in the lab etc. The instructing teacher will regularly assess the performance of the candidates. However, Zero marks shall be awarded to the candidates who have not completed  50% of the prescribed practicals

Zero Internal marks will be awarded  to the  candidates whose attendance is below  50% of  the total classes conducted in the concerned theory and practical papers.  

Note: Detailed breakup of Internal Marks awarded as per above guidelines must be submitted to the university in a  tabular format  fro each paper.  Department/College must preserve answer books of internal examination for a period one  year from the date of examination  and must be presented to the university as and when required.

Project

Project evaluation shall be carry out as follows :

(i)                Project Report                    :                50 marks

(ii)                Presentation                         :                50 marks

(iii)                Work Assessment                :                50 marks

Only the projects submitted by the candidates as per following guidelines will be evaluated.

1. The project must be of approximately 500 man hours and so certified by the supervisor of the project.

2.The project must be submitted in the form in consonance with the format enclosed.

3.Project must be submitted before the prescribed last date .

4.Candidates are required to make a presentation of their project work during their project examination

5.Examination of the project work will be conducted by a committee consisting of at least two internal examiners and one external examiner. 

Minimum passing marks and classification of Successful Candidates:

  I Year:

(a) The minimum marks for passing I year shall be 40% in each paper and 40% marks in the aggregate of papers.

(b) A candidate may be promoted to II year if he has/she secured at least 40% marks in at least six papers/practicals out of 8 theory/practical papers and more than 40% in aggregate. Such candidate shall be required to appear in papers in which he has secured less than 40% marks along with papers of II year when these courses are offered again, so as to satisfy the passing criteria laid in I(a).

(c) A candidate fails to satisfy the criteria I(a), I(b) for promotion to II year shall be required to rejoin the course in Ist year, if otherwise eligible in accordance with the University regulations laid in this regard.

II Year:

 (a) The minimum marks for passing II year shall be 40% in each paper and 40% marks in the aggregate of papers.
(b) A candidate may be promoted to III year if he has/she secured at least 40% marks in at least six papers/practicals out of 8 theory/practical papers and more than 40% in aggregate. Such candidate shall be required to appear in papers in which he has secured less than 40% marks along with papers of III year when these courses are offered again, so as to satisfy the passing criteria laid in II(a).
(c) A candidate fails to satisfy the criteria II(a), II(b) for promotion to III year shall be required to rejoin the course in II year, if otherwise eligible in accordance with the University regulations laid in this regard.

III Year:

(a) The minimum marks for passing III year shall be 40% in each paper and 40% marks in the aggregate of papers.
(b) A candidate may be allowed to reappear in two papers of III year if he has/she secured at least 40% marks in at least six papers/practicals/project out of 8 theory/practical/project papers and more than 40% in aggregate. Such candidate shall be required to appear in papers in which he has secured less than 40% marks along with due papers of I & II year (if any) when these courses are offered again, so as to satisfy the passing criteria laid in III(a).
(c) A candidate fails to satisfy the criteria III(a), III(b) shall be required to rejoin the course in III year, if otherwise eligible in accordance with the University regulations laid in this regard.

 No candidate shall be deemed to have satisfied examination requirement for the award of BCA degree unless he fulfills the criteria for passing I year, II year and III year examinations, as laid in I(a), II(a) and III(a).

Candiadate will not be allowed to reappear in any papers of I,II & III year to improve the percentage.

At the end of final examination, the candidates eligible for the award of B.C.A. degree shall be classified on the basis to the marks obtained in the I,II & III year examinations, taken together, as follows:

(a)      I division with distinction : 75% or more marks in the aggregate and provided the candidate has passed all the papers and examinations in the first attempt.

(b)     I division : 60% or more marks but fails to satisfy the criteria for being classified as first division with distinction laid in (a).

(c)       II division : All other than those included in (a) and (b) above.  A candidate must pass the examinations within five years of the initial admission to the first year of the course.

                                                First Year B.C.A.  2005-06

                      BCA 101: Introduction to Information Technology

  Computer Basics: Algorithms, A Simple Model of a Computer, Characteristics of Computers, Problem-solving Using Computers.

Data Representation: Representation of Characters in computers, Representation of Integers, Representation of Fractions, Hexadecimal Representation of Numbers, Decimal to Binary Conversion, Error-detecting codes.

Input & Output Devices: Description of Computer Input Units, Other Input Methods, Computer Output Units.

 Computer Memory: Memory Cell, Memory Organization, Read Only Memory, Serial Access Memory, Physical Devices Used to Construct Memories, Magnetic Hard Disk, floppy Disk Drives, Compact Disk Read Only Memory, Magnetic Tape Drives.

Processor: Structure of Instructions, Description of a Processor, A Machine Language Program, An Algorithm to Simulate the Hypothetical computer.

Binary Arithmetic: Binary Addition, Binary Subtraction, Signed Numbers, Two’s Complement Representation of Numbers, Addition/Subtraction of Numbers in 2’s Complement Notation, Binary Multiplication, Binary Division, Floating Point Representation of Numbers, Arithmetic Operations with Normalized Floating Point Numbers.

Computer Architecture: Interconnection of Units, Processor to Memory communication, I/O to Processor Communication, Interrupt Structures, Multiprogramming, Processor Features, Reduced Instruction , Set Computers (RISC), Virtual Memory.

Software Concepts: Types of Software, Programming Languages, Software (Its Nature & Qualities), Programming Languages.

Operating Systems: History & Evolution, A Brief Hotory of Linux, A Brief History of MS-DOS, A Brief History of Windows System.

  Database Management System

 Computer Generation & Classifications: First Generation of Computers, The Second Generation, The Third Generation, The Fourth Generation, The Fifth Generation, Moore’s Law, Classification of computers, Distributed Computer System, parallel computers.

Computers & Communications

Internet: Network, Client and Servers, Host & Terminals, TCP/IP, World Wide Web, Hypertext, Uniform Resource Locator, Web Browsers, IP Address, Domain Name, Internet Services Providers, Internet Security, Internet Requirements, Web Search Engine, Net Surfing, Internet Services, Case Study, Intranet.

 Suggested Books

 1. V. Rajaraman, Fundamentals Of Computers, 3^rd Edition , PHI Publications

2. Nasib S. Gill, Essentials of Computer & Network Technology, Khanna Publications.

3. Deepak Bharihoke, Fundamentals of Information Technology, Excel Books.

BCA 102: PC Software Packages

DOS: Introduction, history & versions of DOS, DOS basics- Physical structure of disk, drive name, FAT, file & directory structure and naming rules, booting process, DOS system files, DOS commands- internal & external.

 Windows 95/98: Windows concepts, Features, Windows Structure, Desktop, Taskbar, Start Menu, My Computer, Recycle Bin, Windows Accessories- Calculator, Notepad, Paint, Wordpad, Character Map, Windows Explorer, Entertainment, Managing Hardware & Software- Installation of Hardware & Software, Using Scanner, System Tools, Communication, Sharing Information between programs.

Word Processing; MS-Word: Features, Creating, Saving and Opening Documents in Word, Interface, Toolbars, Ruler, Menus, Keyboard Shortcut, Editing, Previewing, Printing,& Formatting a Document, Advanced Features of MS Word, Find & Replace, Using Thesaurus, Using Auto- Multiple Functions, Mail Merge, Handling Graphics, Tables & Charts, Coverting a word document into varipus formats like- Text, Rich Text format, Word perfect, HTML etc.

Worksheet- MS-Excel: Worksheet basics, creating worksheet, entering into worksheet, heading information, data, text, dates, alphanumeric values,  saving & quitting worksheet, Opening and moving around in an existing worksheet, Toolbars and Menus, Keyboard shortcuts, Working with single and multiple workbook, working with formulae & cell referencing, Auto sum, Coping formulae, Absolute & relative addressing, Worksheet with ranges, formatting of worksheet, Previewing & Printing worksheet, Graphs and charts, Database, Creating and Using macros, Multiple worksheets- concepts, creating and using.

Introduction to Power Point: Creating slide show with animations.

Introduction to Front Page and Microsoft Access: Creating & using databases in Access.

BCA 103: Problem Solving through C Programming

Algorithm and algorithm development: Definition and properties of algorithm, flow chart symbols, conversion of flow chart to language, example of simple algorithms. Program design, errors : syntax error, runtime error, logic error, debugging, program verification, testing, documentation and maintenance.

Introduction to C: Variables and arithmetic expressions, the for statement, symbolic constants, character input and output, arrays, functions, arguments- call by value, character arrays, external variables and scope.

Types, Operators and Expressions: Variable names, data type and sizes, constants, declarations, arithmetic operators, relational and logical operators, type conversions, increment and decrement operators, bitwise operators, assignment operators and expressions, conditional expressions, precedence and order of evaluation.

 Control Flow: Statements and blocks, if-else, else-if, switch, loops- while and for, loops- do-while, break and continue, goto and labels.

 Functions and Program Structure: Basics of function, functions returning non-integers, external variables, scope rules, header files, static variables, register variables, block structure, initialization, recursion, the C preprocessor.

 Pointer and Arrays: Pointers and addresses, pointers and function arguments, pointers and arrays, address arithmetic. Character pointers and functions, pointer arrays: pointers to pointers, multi-dimensional arrays, pointers vs. multi-dimensional arrays. Pointers to functions. Complicated declarations.  

Structures: Basics of structures, structures and functions, arrays of structures, pointers to structures, self-referencial structures, table lookup, typedef, unions, bit-fields.

  Input and Output: Standard input and output. Formatted output- printf, variable length argument lists. Formatted input- scanf, file access, error handling- stderr and exit, line input and output, miscellaneous functions.

Suggested Books

1.  Deendayalu R., Computer science Volume I and II, Second Edition,Tata McGraw-Hill Publishing Company Limited, New Delhi.

2.  Rajaraman V., Fundamentals of computers, Second Edition, Prentice Hall of India Private Limited, New Delhi.

3.  Kernighan B.W. and Ritchie D.M., The C Programming Language, Prentice Hall of India Private Limited New Delhi.

4.  Drogmey R., How to solve it by computers. Prentice Hall of India Private Limited , New Delhi.

BCA 104: Basic Physics

Suggested Books

1. Physics, A textbook for class XI, Part I&II [NCERT]

2. Physics , A textbook for class XII, Part I&II [NCERT]

3. Physics,Part-1,Kumar,Mittal;Nageen Publication,Meerut.

4. Physics, Part-I Kumar, Mittal; Nageen Publication, Meerut.

5. Concepts Of Physics, Part 1, H C Verma; Bharati Bhawan.

6. Concepts of Physics, Part2, H C Verma; Bharti Bhawam.

BCA 105: Basic Mathematics

SETS: Sets, subsets, equal sets, null set, universal set, finite & infinite sets, open & closed sets etc., operations on sets, partition of sets, cartesian product.

 RELATIONS AND FUNCTIONS: relation, properties of relations, equivalence relation, equivalence relation with partition, partial order relation, maximal and minimal points, glb, lub, chains and antichains, pigeonhole principle. Function, domain & range, onto, into and one-to-one functions, composite functions, inverse functions, introduction of algebraic, trigonometrical, logarithmic, exponential, hyperbolic functions, zeroes of functions.

LIMITS & CONTINUITY: Limit at a point, properties of limit, computation of limits of various types of functions. Continuity at a point, continuity over an interval, intermediate value theorem. Type of discontinuities.

DIFFERENTIATION: Derivative, derivatives of sum, differences, product & quotients, chain rule, derivatives of composite functions, logarithmic differentiation, Rolle’s theorem, mean value theorem, expansion of functions (Maclaurin’s & Taylor’s.), indeterminate forms, L’Hospitals rule, maxima & minima, concavity, asymptote, singular points, curve tracing, successive differentiation & liebnitz theorem.

 INTEGRATION: [TF – (4.1-)], [SNI – ()] Integral as limit of a sum, Riemann sum, fundamental theorem of calculus, indefinite & definite integrals, methods of integration substitution, by parts, partial fractions, integration of algebraic and transcedental functions, , reduction formulae for trigonometric functions, Gamma and Beta functions.

 PLANE CURVES & POLAR COORDINATES: Polar coordinates, curve tracing in polar coordinates, area in polar coordinates, Arc length, area & volume of surface of revolution in Cartesian and polar coordinates.

FUNCTIONS OF SEVERAL VARIABLES : Limits & continuity, partial differentiation, chain rule , Euler’s theorem, Maxima & Minima, Lagranges method of undetermined multipliers, Taylor’s formula for functions of two variables.

DOUBLE & TRIPLE INTEGRALS: Double & Triple Integrals in cartesian , cylindrical polar and spherical polar coordinates, Application of Double & Triple Integrals to area, volume, substitution in multiple integrals.

Suggested Books

1. C. L. Liu.: Elements of Discrete Mathematics , Tata Mac-Graw Hill.

2. Thomas, G.B. and R. L. Finney: Calculus & Analytical Geometry, Addison-Wesley , 9^th edition.

3. Chandrika Prasad : Mathematics for Engineers, Prasad Mudranalaya, Allahabad, 19^th edition

4. Shanti Narayan: Differential Calculus, S.Chand & Co.

5. Shanti Narayan: Integral Calculus, S.Chand & Co.

BCA 106: Digital Electronics

Number systems: Data representation - binary, octal, decimal, hexadecimal, conversion from one to another number system. Representation of positive , negative numbers, integers, real, and characters, digital codes: BCD , ASCII, EBCDIC coding, binary arithmetic in 1's and 2's complement.

Boolean Algebra : Logic gates, truth table, logic expression, rules and laws of Boolean algebra, deMorgan's theorems, Boolean expression for gate networks, simplification of Boolean expression using Karnaugh map (up to 4 variables).

Flip Flops : Latches, edge-triggered flip flop, pulse triggered flip flop, R-S flip flop, JK Master-slave flip flop, D flip flop, T flip flop.

Shift Registers : Shift registers function, serial and parallel shift registers, bi-directional shift registers.

Counters : Asynchronous and synchronous counters, up/down counters, modulo-n counters, BCD counters, A procedure for design of sequential circuit.

Combinational circuits : Adder, subtractor, comparator, decoder, encoder, code conversion, multiplexer, demultiplexer, parity bit checker and generators.

Suggested Books :

1. Thomas L Floyd, Digital fundamentals, Third edition, United Book Stall, New Delhi.

2. Malvino and Leach, Digital principles and applications, (1991) Tata McGraw-Hill Edition New Delhi.

3. Rajaraman V. and T. Radhakrishanan, An introduction to digital computer design, Third Edition, 1995,    Prentice Hall of India Private Limited, New Delhi.

4. Mano M. M., Digital logic and computer design,1996, Prentice Hall of India Private Limited, New Delhi.

BCA 106: Practical I: PC Software and Basic Elctronics Lab.

Experiments based on papers BCA 102 and BCA 106.

BCA 107: Practical II: C Programming Lab.

Experiments based on paper BCA 103.

Second Year B.C.A. 2006-07

BCA 201: Computer Organization

Overview of electronics : Electronic components-Resistor, capacitor and Inductors, Semiconductor devices: Diodes, transistors (BJT and FET). Integrated circuits, Popular IC packages, Analog vs digital electronics, Transistor as a switch.

 Boolean algebra and Logic gates: Representation of values and complements, AND, OR, NOT operators, D'Morgans theorem-simplifying expressions-simple problems

Logic gates: Truth tables of AND, OR, NOT, XOR, XNOR, NAND, NOR gates, Combining logic circuits for expressions using NAND and NOR gates, Logic circuit families and characteristics, SSI,, MSI, LSI and VLSI circuits.

Combination and sequential circuits : (Simple block diagrams , truth tables and IC packages only required). Adders, decoders, multiplexers, encoder circuits , Flip-flops: different types-RS, clocked RS, JK, D and T flip flops, Master slave flip flops, edge and level triggering, Multivibrators- astable, bistable, monostable, counters-ripple and decade. Registers, latches and Tristate buffers

Building blocks of a computer system: Basic building blocks-I/O, memory, ALU, Control and their interconnections, Control unit and its functions- Instruction-word, Instruction and execution cycle, organizational sequence of operation of control registers; controlling of arithmetic operations; branch, skip, jump and shift instructions, ALU-its components

 Addressing techniques and registers: Addressing techniques-Direct, immediate addressing; paging, relative, Indirect and indexed addressing. Memory buffer register; accumulators; Registers-Indexed, General purpose, Special purpose; overflow, carry, shift, scratch registers; stack pointers; floating point; status information and buffer registers

Memory: Main, RAM, static and Dynamic, ROM, EPROM, EAROM, EEPROM, Cache and Virtual memory.

 Interconnecting System components: Buses, Interfacing buses, Bus formats-address, data and control, Interfacing keyboard, display, auxiliary storage devices, and printe