Courses

SYLLABUS FOR BACHELOR OF COMPUTER APPLICATIONS (BCA) PROGRAMME Uttarakhand Technical University Dehradun 2 Ordinance for Bachelor of Computer Applications (BCA) Programme 1. Admission Admission to the BCA Ist semester will be made as per rules prescribed by the Academic Council of the University or as per guidelines prescribed by the State Govt. from time to time. 2. Eligibility Intermediate Mathematics. 3. Attendance 3.1 Every candidate is required to attend all the lectures, tutorials, practical and other prescribed curricular and co-curricular activities. It can be condoned up to 25% on medical grounds or for other genuine reasons. 3.2 A further relaxation of attendance up to 15% can be given by Principal/Dean/ Director of the Institute for the students, who have been absent with prior permission, for reasons acceptable to Head of the Institution/ College/ University. 3.3 No candidate will be allowed to appear in the end semester examinations if he/she does not satisfy the overall average attendance requirements as per clause 3.1 and clause 3.2. 4. Duration 4.1 Total duration of the BCA Course shall be three years, each year comprising two semesters. 4.2 Each semester shall normally have teaching for the 90 working days. 4.3 A student failing 2 times in I and / or II semester (of first year) and ineligible for the carry over system (clause 8) shall not be permitted to continue studies further. 4.4 Maximum time allowed for completing the BCA course will be 5 (five) years. Those who are unlikely to satisfy the condition shall not be allowed to continue the studies any further. 5. Curriculum 5.1 The 3 (Three) years curriculum will be divided into six semesters. Each semester include lectures, tutorials, practical and seminars as defined in the scheme of instructions and examinations. 5.2 It will also include co-curricular and extra curricular activities as prescribed from time to time by the Institute/college/university. 3 6. Examination 6.1 Student's performance will be evaluated through continuous assessment in the form of Class Tests, Assignments, Quizzes, Viva voce/Practical etc. There shall also be an examination at the end of each semester in theory subjects, practical and project. 6.2 The distribution of marks for the class tests, quiz test, assignments, end semester theory, practical, project, seminar and other examination shall be as per the prescribed scheme of examination. 6.3 The maximum marks for the theory subjects shall consist of marks allotted for end semester examination and sessional work. 6.4 The maximum marks for the practical shall consist of marks allotted for practical examination and sessional work. 6.5 Pass/fail in a subject shall be declared on the basis of total marks obtained in theory/practical examination and the sessional award for theory/practical subjects. 6.6 The minimum pass marks in the theory subjects (including sessional marks) shall be 40%. 6.7 The minimum pass marks in the practical subjects (including sessional marks) shall be 50%. 6.8 The marks of the previous semester(s) shall not be added in declaring the result of any semester examination. 6.9 To pass a semester candidate must secure 50% of aggregate marks in that semester. 6.10 No merit position shall be awarded to a candidate who has qualified for promotion to higher classes with back papers. 6.11 The student failing in the project only but satisfying all other requirements including obtaining 50% or more marks in aggregate will be allowed to submit a new / modified project at any time after three months of the declaration of result without repeating the whole session. 7. Promotion Rules 7.1 A candidate satisfying all the conditions under clause 6 shall be promoted to the next semester. 7.2 A candidate not satisfying the above conditions but failing in not more than 2 subjects (Theory and/or practical) of a semester examination shall be governed by the clause No. 8. 7.3 All other candidates will be required to repeat the semester either as regular candidate, after re-admission or opting for ex-studentship. This facility is however subject to the time limits stipulated in clause No. 4. 4 8. Promotion under carry-over system 8.1 A candidate who fails in the category of clause No. 7.2 shall become eligible for provisional promotion to next semester and the carry-over system as per the following table. For promotion to & exam Max. permitted no. of carry over subjects of semester I II III IV V VI II 2 - - - - - III 2 2 - - - - IV 2 2 2 - - - V - - 2 2 - - VI - - 2 2 2 - Admission to & Carry over subjects not cleared of semester Semester Exams. not Permitted V I & II 8.2 No separate carry-over Examination will be held for any subject except for BCA Final year. Any candidate eligible for the carry-over system shall have to appear in the carry over subjects in the subsequent University Examination for the same semester. 9. Ex-studentship Sessional marks in the subject of an ex-student shall remain the same as those secured by him/her earlier. 10. Result Results at the end of final year will be declared with the following weightages: I year 100% II year 100% III year 100% 11. Award of Division 11.1 If candidate passes all examinations in single attempt and secures 75% or more in aggregate marks he/she shall be placed in the First Division with Honours. 11.2 If candidate passes all examinations and secures aggregate marks of 60% or more but less than 75% OR greater than or equal to 75% after back in any examination, he/she shall be placed in First Division. 11.3 If candidate passes all examinations and secures aggregate marks of 50% or more but less than 60%, he/she shall be placed in Second Division. 5 12. Seminar and Project 12.1 Candidate must secure 50% marks to pass in seminar and project. 13. Grace Marks A candidate shall be entitled to grace marks of a maximum of 5 in any one subject in a semester to enable him to pass, provided he is failing in only one subject and has secured the necessary minimum aggregate. The grace marks shall not be added to the marks of the subject or to the aggregate. The grace marks will not be awarded to enable a candidate to pass in a practical or project. 15. Scrutiny shall be allowed as per the rules of the University. Revaluation is not permitted. 6 Uttarakhand Technical University Dehradun Bachelor of Computer Application SEMESTER - I BCA101 : Programming in 'C' BCA102 : Fundamental of Computers BCA103: Mathematical foundation of Computer Science BCA104 : Business Communications BCAP11 : Programming in 'C' BCAP12 : PC Packages(Introduction to Operating system & MS Office) SEMESTER - II BCA201 : Data Structure & File Organization BCA202 : Programming in C++ BCA203 : System Analysis and Design BCA204 : Digital Electronics BCAP21 : Data Structure & File Organization BCAP22 : Programming in C++ SEMESTER - III BCA301 : Computer Based Numerical Techniques BCA302 : Data Base Management System BCA303 : Theory of Computation BCA304 : Organization Structure and Personnel Management BCAP31 : Computer Based Numerical Techniques BCAP32 : Data Base Management System Programme Structure 7 SEMESTER - IV BCA401 : Operating system Organization & UNIX BCA402 : Visual Basic Programming BCA403 : Software Engineering BCA404 : Data Communication & Computer Networks BCAP41 : Operating System Organization & UNIX BCAP42 : Visual Basic Programming SEMESTER – V BCA501 : Computer Graphics BCA502 : Web Programming using JAVA BCA503 : Management Information System BCA504 : .Net Technology BCAP51 : Programming in JAVA BCAP52 : Net Technology SEMESTER VI BCA601 : .Net Framework BCA602 : Network Security BCAP61 : .Net Framework BCASM : Seminar BCAPR : Project 8 FIRST SEMESTER: S. No Course No. Subject Evaluation – Scheme Period Sessional Examination L T P TA CT TOT ESE Sub. Total Theory 1. BCA101 Programming in 'C' 3 1 - 10 20 30 70 100 2. BCA102 Fundamental of Computers 3 1 - 10 20 30 70 100 3. BCA103 Mathematical Foundation of Computer Science 3 1 - 10 20 30 70 100 4. BCA104 Business Communication 3 1 - 10 20 30 70 100 Practical 1. BCAP11 Programming in 'C' - - 4 50 - 50 100 150 2. BCAP12 PC Packages(Introduction to Operating system & MS Office) - - 4 50 - 50 100 150 Total 12 4 8 - - 220 480 700 Total Period = 24 Total Marks = 700 SECOND SEMESTER: S. No Course No. Subject Evaluation – Scheme Period Sessional Examination L T P TA CT TOT ESE Sub. Total Theory 1. BCA201 Data Structure & File Organization 3 1 - 10 20 30 70 100 2. BCA202 Programming in C++ 3 1 - 10 20 30 70 100 3. BCA203 System Analysis and Design 3 1 - 10 20 30 70 100 4. BCA204 Digital Electronics 3 1 - 10 20 30 70 100 Practical 1. BCAP21 Data Structure & File Organization - - 4 50 - 50 100 150 2. BCAP22 Programming in C++ - - 4 50 - 50 100 150 Total 12 4 8 - - 220 480 700 TA : Teacher Assessment Total Period = 24 CT : Class Test Total Marks = 700 ESE : End Semester Examination SUB TOT. : Subject Total TOT. : Total 9 THIRD SEMESTER: S. No Course No. Subject Evaluation – Scheme Period Sessional Examination L T P TA CT TOT ESE Sub. Total Theory 1. BCA301 Computer Based Numerical& Statistical Techniques 3 1 - 10 20 30 70 100 2. BCA302 Data Base Management System 3 1 - 10 20 30 70 100 3. BCA303 Theory of Computation 3 1 - 10 20 30 70 100 4. BCA304 Organizational Structure & Personnel Management 3 1 - 10 20 30 70 100 Practical 1. BCAP31 Computer Based Numerical& Statistical Techniques - - 4 50 - 50 100 150 2. BCAP32 Data Base Management System - - 4 50 - 50 100 150 Total 12 4 8 - - 220 480 700 Total Period = 24 Total Marks = 700 FOURTH SEMESTER: S. No Course No. Subject Evaluation – Scheme Period Sessional Examination L T P TA CT TOT ESE Sub. Total Theory 1. BCA401 Operating System Organization & UNIX 3 1 - 10 20 30 70 100 2. BCA402 Visual Programming 3 1 - 10 20 30 70 100 3. BCA403 Software Engineering 3 1 - 10 20 30 70 100 4. BCA404 Data Communication & Computer Networks 3 1 - 10 20 30 70 100 Practical 1. BCAP41 Operating System Organization & UNIX - - 4 50 - 50 100 150 2. BCAP42 Visual Programming - - 4 50 - 50 100 150 Total 12 4 8 - - 220 480 700 TA : Teacher Assessment Total Period = 24 CT : Class Test Total Marks = 700 ESE : End Semester Examination SUB TOT. : Subject Total TOT. : Total 10 FIFTH SEMESTER: S. No Course No. Subject Evaluation – Scheme Period Sessional Examination L T P TA CT TOT ESE Sub. Total Theory 1. BCA501 Computer Graphics 3 1 - 10 20 30 70 100 2. BCA502 Web Programming using JAVA 3 1 - 10 20 30 70 100 3. BCA503 Management Information System 3 1 - 10 20 30 70 100 4. BCA504 .Net Technology 3 1 - 10 20 30 70 100 Practical 1. BCAP51 Programming in JAVA - - 4 50 - 50 100 150 2. BCAP52 .Net Technology - - 4 50 - 50 100 150 Total 14 4 8 - - 220 480 700 Total Period = 24 Total Marks = 700 SIXTH SEMESTER: S. No Course No. Subject Evaluation – Scheme Period Sessional Examination L T P TA CT TOT ESE Sub. Total Theory 1. BCA601 .NET framework 3 1 - 10 20 30 70 100 2. BCA602 Network Security 3 1 - 10 20 30 70 100 Practical 1. BCAP62 .NET framework - - 4 - - 50 100 150 2. BCASM Seminar - - 2 - - - 50 50 3. BCAPR Project - - 10 - - - 100 100 Total 6 2 16 - - 110 390 500 TA : Teacher Assessment Total Period = 24 CT : Class Test Total Marks = 500 ESE : End Semester Examination SUB TOT. : Subject Total TOT. : Total Note: The students with the help of the Institution may do summer training of 6-8 weeks duration, after II and IV Semester in an organization (academic or industrial) which will be submitted in the organization. 11 Each theory paper will of 100 marks comprising of 70 marks for University examination and 30 Marks for sessional. Each practical will be of 150 marks (100 marks of University examination and 50 Marks for sessional). The following in the distribution for marks (Semester wise): Theory Practical Total 1. Semester I 4x100 2x150 700 2. Semester II 4x100 2x150 700 3. Semester III 4x100 2x150 700 4. Semester IV 4x100 2x150 700 5. Semester V 4x100 2x150 700 6. Semester VI 2x100 1x150 350 6. Semester VI (a) Seminar 50 (b) Project 100 TOTAL 4000 12 BCA101 : Programming in 'C' Programming in C: History, Introduction to C Programming Languages, Structure of C programs, compilation and execution of C programms. Debugging Techniques, Data Types and Sizes, Declaration of variables, Modifiers, Identifiers and keywords, Symbolic constants, Storage classes (automatic, external, register and static), Enumerations, command line parameters, Macros, The C Preprocessor Operators: Unary operators, Arithmetic & logical operators, Bit wise operators, Assignment operators and expressions, Conditional expressions, precedence and order of evaluation. Control Statements: if-else, switch, break, continue, the comma operator, go to statement. Loops: for, while, do-while. Functions: built-in and user-defined, function declaration, definition and function call, parameter passing: call by value, call by reference, recursive functions, multifile programs. Arrays: Linear arrays, multidimensional arrays, Passing arrays to functions, Arrays and strings. Structure and Union: Definition and differences, self-referential structure. And address of (&) operator, pointer to pointer, Dynamic Momory Allocation, calloc and malloc functions, array of pointers, function of pointers, structures and pointers. File: File Handling in C References: 1. V. Rajaraman, "Fundamentals of Computers", PHI 2. Pater Norton's "Introduction to Computer", TMH 3. Hahn, "The Internet complete reference", TMH 4. Peter Nortton's, "DOS Guide", Prentice Hall of India 5. Gottfried, "Programming in C, Schaum's Series Tata McGraw Hill 13 BCA102 : Fundamental of Computers Introduction to Computers: Computer hardware Components, Disk Storage, memory, keyboard, mouse, printers, monitors, CD etc., and their functions, Comparison Based analysis of various hardware components. Basic Operating System Concepts: MS-DOS, WINDOWS, Functional knowledge of these operating systems. Introduction to Basic Commands of DOS, Managing File and Directories in various operating Systems, Introduction to internet, Basic terms related with Internet, TCP/IP. Algorithm development, techniques of problem solving, flowcharting, stepwise refinement algorithms for searching, sorting (exchange and insertion), merging of ordered lists. Programming : Representation of integer, character, real, data types, constraints and variables, arithmetic expressions, assignment statement, logical expression; sequencing, alteration and interaction, arrays, string processing sub programs, recursion, files and pointers. Structured programming concepts : Top down design, development of efficient programs; Program correctness; Debugging and testing of programs. Element of a computer processing system : Hardware CPU, storage devices and media, VDU, input-output devices, data communication equipment software-system software, application software. Programming languages : Classification, machine code, assembly language, higher level languages, fourth generation languages. References : Raja Raman V : Fundamentals of Com


News & Events