This action might not be possible to undo. Are you sure you want to continue?
Sem No. I Paper No. BCA101(A) BCA101(B) BCA102(A) BCA102(B) BAC103 BCA104 BCA104 BCA105 BCA107 II BCA201(A) BCA201(B) BCA202 BCA203 BCA204 BCA205 BCA206 BCA207 III BCA301 BCA302 BCA303 BCA304 BCA305 BCA306 BCA307 Title of Paper Mathematics 1* Accounting & Financial ** Management-I Functional Kannada Kannada Kali Basic Electrical and Electronics Computer Concepts and CProgramming Indian Constitution Computer Lab 1.1 (Based on BCA 104) Computer Lab1.2(Based on BCA 103) Mathematics-II* Accounting And Financial Management-II ** English Numerical and Statistical Methods Data Structures Using C Human Rights and Environmental Studies Computer Lab 2.1(Based on BCA204) Computer Lab 2.2(Based o BCA 201(B) and BCA 203) Computer Organization and Architecture OOPS Using C++ Discrete Mathematical Structures Visual Programming Personality Development and Communication Skills Computer Lab3.1 (Based on BCA 302) Computer Lab3.2 (Based on BCA 304) Hrs/Wk 4 4 4 4 4 4 4 6 6 4 4 4 4 4 4 6 6 4 4 4 4 4 6 6 Marks Max Min 80 32 80 32 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 IA 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 Total Marks Max Min 100 40 100 40 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40
Note: Duration of Examination of each Theory / Practical shail be of 3 (Three) hours duration. *BCA 101(A) & BCA 201 (A) ** BCA 101 (B) & BCA 201 (B) for those who have studied Mathematics at PUC or qualifying level. for those who have not studied Mathematics at PUC or qualifying level.
BCA-FIRST SEMESTER & SECOND SEMESTER (w.e.f. Academic year 2005-2006)
Sem No. I Paper No. BCA101(A) BCA101(B) BCA102(A) BCA102(B) BAC103 BCA104 BCA104 BCA105 BCA107 II BCA201(A) BCA201(B) BCA202 BCA203 BCA204 BCA205 BCA206 BCA207 Title of Paper Mathematics 1* Accounting & Financial ** Management-I Functional Kannada Kannada Kali Basic Electrical and Electronics Computer Concepts and CProgramming Indian Constitution Computer Lab 1.1 (Based on BCA 104) Computer Lab1.2(Based on BCA 103) Mathematics-II* Accounting And Financial Management-II ** English Numerical and Statistical Methods Data Structures Using C Human Rights and Environmental Studies Computer Lab 2.1(Based on BCA204) Computer Lab 2.2(Based o BCA 201(B) and BCA 203) Hrs/Wk 4 4 4 4 4 4 4 6 6 4 4 4 4 4 4 6 6 Marks Max Min 80 32 80 32 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 IA 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 Total Marks Max Min 100 40 100 40 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40
*BCA 101(A) & BCA 201 (A) ** BCA 101 (B) & BCA 201 (B)
for those who have not studied Mathematics at PUC or qualifying level.
for those who have studied Mathematics at PUC or qualifying level.
BCA-First Semester BCA 101 (A) Mathematics-I* Total: 50Hrs
1) ALGEBRA: Partial fractions. Indices and logarithms with standard problems. Progressions: AP, GP, HP. Mathematical induction, Theory of equation- solution of Quadratic. Cubic and biquadratic equations, Permutations and combinations Binomial theorem. Binomial coefficients. (14 Hrs) 2) TRIGONOMETRY: Angles and their measurements. Radian measure. Trigonometric functions of standard angles. Compound angles, multiple and submultiple angles. Transformation formula. Htights and distance, graphs of trigonometric functions, Relation between sides and angels of a triangle, solution of triangles. (14 Hrs) 3) GEOMETRY: Coordinate system, distance formula, section formula, locus of a point. Equations of straight lines, angle between two straight lines. Pairs of lines. (8 Hrs) 4) CALCULUS Limits, continuity Differentiation. Application of derivatives and Maxima and Minima (14 Hrs)
1. P.G. Umarani and B.G. Umarani: A Test of Mathematics of PUC I and II. Prism PUB 2005 2. S.S. Bosco: Test of Mathematics for PUC I and II Bosco Pub. (2005) 3. G.K. Ranganath: Test of Mathematics for PUC I and II Himalaya Publishing Co. (2005) 4. B.M. Shrinivasrao: A text book of Mathematics: Excellent Publication (2005) 5. S.L. Loney: The Elements of Co-ordinate Geometry, Surjeet Pub. (1989) 6. Shanti Narayan: Differential Calculus, S. Chand and Co. (1974) 7. S.L. Loney: Trigonometry. Surjeet Publications (1989) * BCA 101 (A)-for those who have not studied Mathematics at PUC or qualifying level. BCA 101 (B)-for those who have studied Mathematics at PUC or qualifying level.
BCA-First Semester BCA 201 (A) Mathematics-II* Total: 50Hrs
1. ALGEBRA: Matrices and Determinants, solution of Linear Equations by Cramer’s Rule and matrix method, Eigen values and Eigen vectors, Cayley – Hamilton Theorem, diagonalization of matrices. Algebraic Structures. Groups, Properties of group, subgroups, permutation groups. Scalars Vectors, Algebra of Vectors, Scalar and Vector products, scalar and Vector triple products, work done by a force, moment of a force and couple. (20 Hrs) 2. TRIGONOMETRY: Inverse trigonometric function, general solutions of trigonometric equations, Complex Numbers and De’Moiver’s Theorem, roots of a complex number, cube roots of unity. (10 Hrs) 3. GEOMETRY: Circles, equations of circles, tangents and normals radical axis, orthogonality, Conic sections, Parabola ellipse. Hyperbola. – equations. Tangents and Normals. (10 Hrs) 4. CALCULUS Integral calculus; Indefinite integrals, standard intergrals of algebraic, logarithmic, exponential and trigonometric functions. Integration by parts. Definite integrals and their applications. (10 Hrs)
1. P.G. Umarani and B.G. Umarani: A Test of Mathematics of PUC I and II. Prism PUB 2005 2. S.S. Bosco: Test of Mathematics for PUC I and II Bosco Pub. (2005) 3. G.K. Ranganath: Test of Mathematics for PUC I and II Himalaya Publishing Co. (2005) 4. B.M. Shrinivasrao: A text book of Mathematics: Excellent Publication (2005) 5. Shanti Narayan: First course in Algebra S. Chand and Co. (1974) 6. Shanti Narayan: Vector Algebra, S. Chand and Co. (1974) 7. S.L. Loney: The Elements of Co-ordinate Geometry, Part-I-Surjeet Pub. (1989) 8. S.L. Loney: Trigonometry, Surjeet Publications (1989) 9. Shanti Narayan: Differential Calculus, S. Chand and Co. (1974) 10. Shanti Narayan and Others: Integral Calculus S Chand and Co. (1974) * BCA 201 (A)-for those who have not studied Mathematics at PUC or qualifying level. BCA 201 (B)-for those who have studied Mathematics at PUC or qualifying level.
Regulations, Scheme of Study and Examamination for BCA Degree Course Under Semester System
(Revised w.e.f. 2005-2006)
R1. a) Title of the course: Bachelor of Computer Applications b) Duration of the Course: The course Shall be of three year duration spread over six semesters c) Scheme of study: i. There shall be five-theory papers and two-practicals each carrying 100 marks (80+20), from first semester of fifth semester. ii. There shall be five theory papers and one project work during sixth semester. iii. The project work shall be carried out either independently or jointly (maximum of two students) iv. Medium of Instruction: The medium of instruction shall be English. d) Scheme of Examinations: i. At the end of each semester there shall be university examination of three hours duration in each of the theory paper/practical carrying 80 marks. ii. Internal assessment (IA) carrying 20 marks in each of theory paper/practicasl shall be based on the performance of the students in two written tests of one hour duration. No minimum marks for passing is required in IA. iii. At the end of the sixth semester each student shall have to submit the completed project report for the evaluation which shall be certified by internal and/external guide and duly signed by the Principal/Chairman/Head/Course Coordinator. The project report shall be evaluated by two examiners for 200 marks and Viva-voce shall carry 100 marks. R 2. Each semester shall be of 4 months duration R.3. Attendance: Every student must have at least 75% attendance in each of the course (Theory and Practical) in each semester. Shortage of attendance will be dealt with as per University rule from time to time. R 4. A Candidate is allowed to carry over all the pervious uncleared (failed) theory papers and/Practicals to subsequent semesters form the first to sixth semester R 5. The maximum period for completion of the course shall be six years from the date of admission. R 6. Eligibility for admission: a. Any student who has passed PUC-II Science or Commerce securing a minimum of 35% of marks OR b. Any student who has passed JODC or Diploma in Engg. (of three year duration of Govt. of Karnataka) with minimum of 35% of marks in aggregate in all the semesters/years. R 7. There shall be an Entrance test for admission. The fees for this test and prospectus shall be as prescribed by the University. R 8. Admission Procedure: a. Through an Entrance test of duration two hours and 100 marks. b. 501% weightage for Entrance test c. 50% weightage for performance at qualifying examination. d. Merit list shall be prepared based on item No. 8 (b) and 8 (c) e. Reservation: As per the notifications/Govt. orders from the University/Govt. from time to time. f. Tuition and other fees: As fixed by the University from time to time R 9. The total number of students to be as decided by the University. R 10. Results: a) Minimum for pass in each of theory paper/Practical (Computer Lab)/Project Report shall be 40% at the University b) The aggregate minimum for pass in each of the Theory/Practical (Computer Lab)/Project work shall be 40% of marks in each course including IA/Vica-voce. No minimum marks in required in IA/Viva-voce. R 11. Classification of Results: Results of candidate are declared and the classes are awarded as per the following classification based on the marks obtained in all the semesters. (I to VI) in all the subjects/courses. Marks obtained Results i. 70 and above First Class with Dist ii. 60% and above but less than 70% First Class iii. 50% and above but less than 60% Second Class iv. 40% and above but less than 50% Pass Class v Less than 40% Fails
.2(Based o BCA 201(B) and BCA 203) Computer Organization and Architecture OOPS Using C++ Discrete Mathematical Structures Visual Programming Personality Development and Communication Skills Computer Lab3.e. I Paper No.1 (Based on BCA 104) Computer Lab1.1 (Based on BCA 302) Computer Lab3.2 (Based on BCA 304) Hrs/Wk 4 4 4 4 4 4 4 6 6 4 4 4 4 4 4 6 6 4 4 4 4 4 6 6 Marks Max Min 80 32 80 32 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 IA 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 Total Marks Max Min 100 40 100 40 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 Note: Duration of Examination of each Theory / Practical shail be of 3 (Three) hours duration.2(Based on BCA 103) Mathematics-II* Accounting And Financial Management-II ** English Numerical and Statistical Methods Data Structures Using C Human Rights and Environmental Studies Computer Lab 2.1(Based on BCA204) Computer Lab 2. BCA101(A) BCA101(B) BCA102(A) BCA102(B) BAC103 BCA104 BCA104 BCA105 BCA107 II BCA201(A) BCA201(B) BCA202 BCA203 BCA204 BCA205 BCA206 BCA207 III BCA301 BCA302 BCA303 BCA304 BCA305 BCA306 BCA307 Title of Paper Mathematics 1* Accounting & Financial ** Management-I Functional Kannada Kannada Kali Basic Electrical and Electronics Computer Concepts and CProgramming Indian Constitution Computer Lab 1.Title of Papers and Scheme of Study and Examination for BCA (Bachelor of Computer Applications) Revised w. 2005-2006 Sem No.f.
The contents of “Computer Applications” compulsory paper of Group III is spread over the various computer papers in earlier semesters of BCA and hence it is not included in BCA IV Semester. Duration of Examination of each Theory / Practical shail be of 3 (Three) hours duration.1 (Based o BCA 502) BCA507 Computer Lab 5.1 (Based on BCA 401 & BCA 404) BCA407 Computer Lab4.Sem No. BCA401 Title of Paper Hrs/Wk 4 4 4 4 4 6 6 4 4 4 4 4 6 6 4 4 4 4 4 12 ----- V VI Design & Analysis of Algorithms BCA402 System Analysis and Design BCA403 System Programming BCA404 Data Communications BAC405 Microprocessors BCA406 Computer Lab 4.2 (Based on BCA 503) BCA601 Computer Graphics BCA602 E-Commerce and Wed Designing BCA603 Introduction to UNIX BCA604 Object Oriented System Design BCA605 Computer Networks Project Work BCA606 (A) Project Report: BCA606 (B) Viva-Voce GRAND TOTAL MARKS Marks Max Min 80 32 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 200 100 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 80 --- IA 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 ----- Total Marks Max Min 100 40 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 200 100 4300 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 120 Note: 1.2 (Based on BCA 405) BCA501 Operating Systems BCA502 Internet Programming BCA503 Data Base Management Systems BCA504 Software Engineering BCA505 Operations Research BCA506 Computer Lab 5. IV Paper No. 2. BCA-FIRST SEMESTER and SECOND SEMESTER .
f. I Paper No.2(Based o BCA 201(B) and BCA 203) Hrs/ Wk 4 4 4 4 4 4 4 6 6 4 4 4 4 4 4 6 6 Marks Max Min 80 32 80 32 80 80 80 80 80 80 80 80 80 80 80 80 80 80 80 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 IA 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 20 Total Marks Max Min 100 40 100 40 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 40 40 40 40 40 40 40 40 40 40 40 40 40 40 40 BCA-FIRST SEMESTER .1 (Based on BCA 104) Computer Lab1.e. BCA101(A) BCA101(B) BCA102(A) BCA102(B) BAC103 BCA104 BCA104 BCA105 BCA107 II BCA201(A) BCA201(B) BCA202 BCA203 BCA204 BCA205 BCA206 BCA207 Title of Paper Mathematics 1* Accounting & Financial ** Management-I Functional Kannada Kannada Kali Basic Electrical and Electronics Computer Concepts and CProgramming Indian Constitution Computer Lab 1.1(Based on BCA204) Computer Lab 2. Academic year 2005-2006) Sem No.(w.2(Based on BCA 103) Mathematics-II* Accounting And Financial Management-II ** English Numerical and Statistical Methods Data Structures Using C Human Rights and Environmental Studies Computer Lab 2.
8.2.3 15. – illustrative examples from Engg. Vi – Edition. 6. Infinite Series: Convergence. Differential Equations: Solutions of 1st order and 1st degree equations – variables separable homogeneous and no Homogeneous. Jon Wiley and Sons. Analytical Geometry in 3 dimensions: Direction cosines and direction ratios – planes – straight lines – angle between planes/straight lines – coplanar lines – shortest distance between skew lines. (10 Hrs) 2. Alternating series.9.C. 6. 15.11 6. Exact equations and reducible to exact form. Raabe’s test. Tracing of Standard curves in Cartesian form.1. length. 11 and 12 B.3.12 11. 2/e Pearson Education.13 9.C.2. (10 Hrs) 5.10 and 11.10 and 4.7. Partial Differentiation: Euler’s Theorem.12 12. Oriented problems. 5. B.A.9 and 6.: 101 (B): ACCOUNTING AND FINANCIAL MANAGEMENTS – I .4.8. secn x.” 36th Edition – July 2001 3. “Elementary Engineering Mathematics” 11. Differential Calculus: Determination of nth derivatives of standard functions. to 3. Linear and Bernoulli’s equations. Orthogonal trajectories of Cartesian and polar forms.D. “Higher Engineering Mathematics. 11. Field.7 E. 4. conn x.11 5.1. Absolute and conditional convergence.22 4. Integral Calculus: Reduction formulae for the functions sinn x. 11. 4. right circular cone and right circular cylinder.2. cosn x – evaluation of these integrals with standard limits – Problems. 9. 4.6 to 11. S. volume and surface area.13. Grewal. (11 Hrs) 4. 2) Greenberg. 5.2 and 14. 5.2.A. tann x. (7 Hrs) Tex Books: 1) Chapter – 3: Chapter – 4: Chapter – 5: Chapter – 6: Chapter – 9: Chapter – 11: Chapter – 12: 2) Chapter – 11: Chapter – 14: Chapter – 15: 3) Chapter – 2: References: 1) E. “A short course in Differential Equations”-4th Edition-1969 6. divergence and oscillation of an infinite series. Parametric form and Polar form.3. 3.4. P – series.B. 5.3 to 9.5. Comparison Test. – 101(A): Mathematics-I Total: 50 Hrs 1. 6. “ Advanced Engineering Mathematics. 5.8. (Use of initial condition should be emphasized). Kryszig.10 and 5. D’ alembert’s ration test. Total differentiation.3 B. Polar curves – angle between the radius vector and the tangent pedal equations of polar curves only. Leibnitz’s theorem (without proof) – problems only. Advanced Engineering Mathematics.11 14. 15. (12 Hrs) 3. 10. Rainville.3 and 15. Grewal. 5.1.S. Applications to find area. Differentiation of Composite and implicit functions – Jacobians – errors and approximations – illustrative Engg. Cauchy’s root test. cotn x. Cauchy’s integral test (all test without proof) for series of positive terms.12. cosecn x and sinn x. Leibnitz’s test (without proof).17 and 3.
Accouning and Finacial Management – I: Financial Accounting – Person Education . Tulsian. Principles of Accountancy. Renewal.Total: 50 Hrs Introduction: History and Development of Accounting – Meaning. Vithal. Accommodation Bills. Meerut) 3. B. Sharma: Accounting for Management. Raman.S. Purchase Returns Day Book. Objectives and functions of Accounting – Book – keeping V/s Accounting – Users of accounting data – systems of book – keeping and accounting – branches of accounting – advantages and limitations of accounting. Preparation of Different Subsidiary Books: Purchase Day book Sales Day Book.S. Endorsement. 2. Accountancy. need and classification. Book – keeping and accounting. Kadkol. M. Delhi). Sales Returns Day Book.A. Lit. Profit and loss account and Balance – Sheet of sale-trabers and partnership firms. Bill Receivable Book and Payable Book. Financial Accounting Process: Classification of accounting transactions and accounts. Journalisation and Ledger posting. A Text Book of Accountancy. B. Discounting. B. S.S. Accounting principles V/s Accounting standards. Ramesh. Book – Keeping and Accountancy. Account Procedure: Honour of the Bill. (Renuka Prakashan. Bank Reconciliation Statement: Meaning. Preparation of Trial Balance: Rectification of errors and Journal Proper. need and classification of Indian accounting standards. (R. Macmillan Publishers. Singhal. Chandrashekar. Mumbai 5. Accounting standards – meaning. Preparation of Final Accounts: Meaning. Preparation of Manufacturing. Chand and Co. Accounting Concepts and Convention: Meaning. (United Publishers. (Nageen Prakash pvt. rules of debit and credit as per Double Entry System. Retirement of the Bill. Korihalli. Cash Book. Causes of Difference – Advantages – Preparation of Bank Reconciliation Statements. References: 1. Bill for collection. Patil and J. V. Test Book: 1) S. Trading. need and classification. Hubil) 4. R. Mangalore) 6. Dishonour of the Dill.
BCA – 102 (A): Functional Kannada (For those who have studied Kannada at S. ¨É¼ÀUÀ° CAPÀUÀ¼À «ªÀgÀ Total: 50Hrs ¥Àæ±Éß – 1. £ÁV : PÀÄªÉA¥ÀÄ 2.DgÀ. JA.S. ºÀAf qÁ.ªÀiÁ. JA JA.«. «. qÁ.: PÀxÀ£À PÀªÀ£À ºÁUÀÆ ªÀåQÛ avÀæUÀ¼ÀÄ ¥ÀoÀåªÀ£ÀÄß DzsÀj¹zÀ 10 CAPÀUÀ¼ÀÄ 10 ªÀ¸ÀÄÛ¤µÀ× ¥Àæ±ÉßUÀ¼ÀÄ ----------------MlÄÖ CAPÀUÀ¼ÀÄ . J¸ï. ªÀåQÛ avÀæ ¸ÀAZÀAiÀÄ: ¸ÀA. £ÁAiÀÄPÀ 5.«. ¹.¦.: PÀxÀ£À PÀªÀ£À ¥ÀoÀåPÉÌ ¸ÀA§AzsÀ¥ÀlÖAvÉ ¤§AzÀgÀÆ¥ÀzÀ ¥Àæ±Éß. ¥ÀqÀ±ÉnÖ ªÀÄvÀÄÛ qÁ.L. zÉÃ±ÁZÁgÀ : ²æÃ¤ªÁ¸À 5.S. CAPÀUÀ¼ÀÄ 20 (EzÀPÉÌ 2 CxÀªÁ 4 ¥ÀAiÀiÁðAiÀÄ ¤§AzsÀgÀÆ¥ÀzÀ ¥Àæ±Éß PÉÆqÀ¨ÉÃPÀÄ) ¥Àæ±Éß – 2.Dgï. UÀÄAeÉnÖ 2. ®PÀëªÀÄtgÁªï 8.: ªÀåQÛ avÀæUÀ¼ÀÄ ¥ÀoÀåPÉÌ ¸ÀA§AzsÀ¥ÀlÖAvÉ ¤§AzÀgÀÆ¥ÀzÀ ¥Àæ±Éß. ªÀÄAdÄ UÀqÀgÀPÀxÉ : ¸ÀÄgÀA JPÀÄÌAr 2. £ÁªÀ®V ¥Àæ: ¥Àæ¸ÁgÁAUÀ.J¸ï.w. ºÉÆ¸ÀUÀ£ÀßqÀ PÁªÀå: PÀzÀ£À PÀªÀ£À ¸ÀAZÀAiÀÄ ¸ÀA. wÃ¥ÀÄ9 : ZÀ£Àß«ÃgÀ PÀt« 6.«. ¥sÀ. ¹zÁÝ9xÀ : r. ¨É¼ÀUÀ° 4. ²æÃ¤ªÁ¸ÀªÀÄÆwð 7.PÀQ9 4.: PÀxÀ£À PÀªÀ£À ¥ÀoÀåPÉÌ ¸ÀA§AzsÀ¥ÀlÖAvÉ n¥ÀàuÉ (¨ÉÃPÁzÀ-2PÉÌ) CAPÀUÀ¼ÀÄ 10 (4 n¥ÀàuÉUÀ¼À£ÀÄß PÉÆlÄÖ ¨ÉÃPÁzÀ 2PÉÌ GvÀÛj¸ÀÄªÀÅzÀÄ) ¥Àæ±Éß – 3. PÀ. ªÀÄ°èPÁdÄð£À ªÀÄ£ÀÆìgÀ .£ÀA 3.«. «±ÉéÃ±ÀégÀAiÀÄå – J. ºÀ¼ÀPÀnÖ zÀA. gÀAUÀªÀ°è : ¥ÀÄ. «.: ªÀåQÛ avÀæUÀ¼ÀÄ ¥ÀoÀåPÉÌ ¸ÀA§AzsÀ¥ÀlÖAvÉ n¥ÀàuÉ (¨ÉÃPÁzÀ2PÉÌ) CAPÀUÀ¼ÀÄ 20 (4 n¥ÀàuÉUÀ¼À£ÀÄß PÉÆlÄÖ ¨ÉÃPÁzÀ 2PÉÌ GvÀÛj¸ÀÄªÀÅzÀÄ) ¥Àæ±Éß – 5. gÁd±ÉÃRgÀ EZÀÑAV ¥Àæ: ¥Àæ¸ÁgÁAUÀ. ªÁAiÀiï. PÉ. ºÀqÉðPÀgÀ ªÀÄAd¥Àà – zÀÄ. ¥ÉÆæ.ºÀÄ. r.¹ ¥ÁªÀmÉ . zsÁgÀªÁqÀ 2001 ¥ÀoÀå «ªÀgÀ: 1. ¤A. PÀ.ºÀ. and PUC level) 1.80 .©. CAPÀUÀ¼ÀÄ 20 (EzÀPÉÌ 2 CxÀªÁ 4 ¥ÀAiÀiÁðAiÀÄ ¤§AzsÀgÀÆ¥ÀzÀ ¥Àæ±Éß PÉÆqÀ¨ÉÃPÀÄ) ¥Àæ±Éß – 4.¤A.»gÉÃªÀÄ®ÆègÀ F±ÀégÀ£ï 6. zsÁgÀªÁqÀ 2001 ¥ÀoÀå «ªÀgÀ: 1. ¹. gÁªÀÄ£ï – f. C®âlð L£ï¹ÖÃ£À – f. ®PÀëªÀÄtgÁªÀ 3. QvÀÆÛgÀ ZÀ£ÀßªÀÄä .
§ºÀÄªÀZÀ£ÀUÀ¼ÀÄ. ¸ÀA§A¢üÃ £ÁªÀÄUÀ¼ÀÄ. Past tense. ¥ÁoÀ-6 : ºÉÆÃmÉ°£À°è ZÀvÀÄxÀð «¨sÀQÛ. Predicative forms. £ÀPÁgÁvÀäPÀ. Verbal participle. ¥ÁoÀ-10 : gÉÆÃVUÉ ªÉÊzÀågÀ ¸À®ºÉ ±ÀQÛ ±Á° gÀÆ¥ÀUÀ¼ÀÄ. EvÁåxÀð. £ÀPÁgÁvÀäPÀ. Lesson-8 : Planning for a Picnic Imperative. : ¥ÀgÀ¥ÀìgÀ ¥ÀjZÀAiÀÄ – 1 ¸ÀªÀð£ÁªÀÄUÀ¼ÀÄ.L. : ¥ÀgÀ¸ÀàgÀ ¥ÀjZÀAiÀÄ -2 ¸ÀªÀð£ÁªÀÄUÀ¼ÀÄ. Lesson-10 : Doctors advise to Patient Potential forms. Non-past continuous. DvÁäxÀðPÀgÀÆ¥À. ¨sÀÆvÉÃvÀgÀPÁ®. Negation ¥ÁoÀ-12 : §ÈAzÁªÀ£À GzÁå£ÀªÀ£À ¨sÀÆvPÁ®À. DeÁÕxÀðPÀ. Negation-illa. Negation ¥ÁoÀ-11 : ZÀ®£ÀavÀæ PÀÄjvÀÄ ZÀZÉð ¨sÀÆvPÁ®À. Permissive. Past Continuous and their Neagtion. Dubitive question. £ÀÆå£À QæAiÀiÁ¥ÀzÀUÀ¼ÀÄ Lesson-7 : Vegatable Market Numeral. ¨sÀÆvÉÃvÀgÀ gÀÆ¥ÀUÀ¼ÀÄ. ¥Àæ±ÁßxÀðPÀ Introducting each other-2 Personal Pronouns. ¥ÁoÀ-9 : ªÉÊzÀå-gÉÆÃVAiÀÄgÀ ¸ÀA¨sÁµÀuÉ. Yes/No Type Interrogation. µÀ¶×«¨sÀQÛgÀÆ¥ÀUÀ¼ÀÄ.BCA – 102 (A): Kannada Kali (For those who have studied Kannada either at S. Lesson-12 : About Brindavan garden Past tense. ¥ÁoÀ-7 : PÁ¬Ä¥À¯Éå ªÀiÁgÀÄPÀmÉÖ CAQ ¸ÀASÉå. UÀÄuÁvÀäPÀ ºÁUÀÆ ¥ÀjªÀiÁuÁvÀäPÀ £ÁªÀÄ«±ÉÃµÀtUÀ¼ÀÄ Lesson-5 : Enquiring about the College. and PUC level) Total: 50Hrs Lesson-1 ¥ÁoÀ-1 ±À§ÝUÀ¼ÀÄ. Past and Present perfect. ¥ÁoÀ-8 : ªÀ£À¨sÉÆÃd£À. Non-past tense. Reflexive form. Lesson-4 : Enquiring about a room rent Qualitative and Quantitative Adjectives ¥ÁoÀ-4 : ¨ÁrUÉPÉÆÃuÉ «ZÁj¸ÀÄªÀÅzÀÄ. Lesson-11 : Discussing about a film. Possessie forms. ¥ÁoÀ-3 : gÁªÀiÁAiÀÄtªÀ£ÀÄß PÀÄjvÀÄ £ÁªÀÄ¥ÀzÀUÀ¼À µÀ¶×gÀÆ¥ÀUÀ¼ÀÄ. Possessie forms. ¸À¥ÀÛ«ÄÃ «¨sÀQÛ. Lesson-2 : ¥ÁoÀ-2 : Introducing each other – 1 Peronal Pronouns. EgÀÄ QæAiÀiÁ¥ÀzÀ. ¥ÁoÀ-14 : zÀÆgÀªÁtÂ ¸ÀA¨sÁµÀuÉ . Plurals. ¥ÁoÀ-5 : PÁ¯ÉÃf£À §UÉUÉ «ZÁj¸ÀÄªÀÅzÀÄ PÀªÀÄð gÀÆ¥ÀUÀ¼ÀÄ. E®è £ÀPÁgÁvÀäPÀ. Hortative. Lesson-9 : Conversation between Doctor and Patient. £ÀPÁgÁvÀäPÀgÀÆ¥À. ¸ÀA¨sÁªÁåxÀð. Negation. Verb-iru. Lesson-14 : Telephone conversation. Lesson-13 : About routine activities of a student.S. ¥ÁoÀ-13 : «zÁåyðAiÀÄ zÉÊ£ÀA¢£À ZÀlÄªÀnPÉUÀ¼ÀÄ C¥ÀÆtð QæAiÀiÁgÀÆ¥À. µÀ¶×«¨sÀQÛgÀÆ¥ÀUÀ¼ÀÄ ºËzÀÄ / C®è ªÀiÁzÀj¥Àæ±Éß Lesson-3 : About Ramayana Possessive forms of Nouns. ¥Àæ±ÁßxÀðPÀ ±À§ÝUÀ¼ÀÄ-¥Àæ±ÉßUÀ¼ÀÄ. Lesson-6 : In a Hotel Dative case defective verbs. Relative Nouns. Locative case.S. Interrogative words.
PÀ£ÀßqÀ «±Àé«zÁå®AiÀÄ. Belur Relative participle. Hampi PÀ£ÀßqÀ PÀ° : ¯ÉÃ. : : : : : : : : : : : About Halebid. £ÀPÁgÁvÀäPÀ.¥ÀÆtð ¨sÀÆvÀ ºÁUÀÆ ªÀvÀðªÀiÁ£ÀPÁ®. °AUÀzÉÃªÀgÀÄ ºÀ¼ÉªÀÄ¤ ¥Àæ. ¨sÀÆvÀ C¥ÀÆtð ºÁUÀÆ £ÀPÁgÁvÀäPÀ. Negation ºÀ¼É©ÃqÀÄ. Discussing about Examination and future plan. ¨ÉÃ®ÆgÀÄ PÀÄjvÀÄ £ÁªÀÄ C¥ÉÃQëvÀ. ºÀA¦. Simple Conditional and Negative ¥ÀjÃPÉë ºÁUÀÆ ¨sÀ«µÀå AiÉÆÃd£É PÀÄjvÀÄ ZÀZÉð ¸ÁªÀiÁ£Àå ¤§ðA¢üvÀ. Lesson-15 : ¥ÁoÀ-16 Lesson-16 ¥ÁoÀ-16 Lesson-17 ¥ÁoÀ-17 Lesson-18 ¥ÁoÀ-18 Lesson-19 ¥ÁoÀ-19 Lesson-20 ¥ÁoÀ-20 Text Book: Kannada Kali : by Lingadevaru Halemani Pub: Prasaranga. Kannada University. : ¥Àæ¸ÁgÀAUÀ. £ÀPÁgÁvÀäPÀ. Karnataka (Lesson for Reding) PÀ£ÁðlPÀ (NzÀÄªÀÅzÀPÁÌV ¥ÁoÀ) Kannada Bhaashe (Lesson for Reding) PÀ£ÀßqÀ ¨sÁµÉ (NzÀÄªÀÅzÀPÁÌV ¥ÁoÀ) MA nataruva Sangatialla (Lesson for Reading) ªÀiÁ£ÀªÀvÀgÀÄ ¸ÀAUÀw C®è (NzÀÄªÀÅzÀPÁÌV ¥ÁoÀ) bEku bEDagaLu (Lesson for Reading) ¨ÉÃPÀÄ ¨ÉÃqÀUÀ¼ÀÄ (NzÀÄªÀÅzÀPÁÌV ¥ÁoÀ) .
C series circuit – R-L-C series circuit. MOS. Holtan. Millman and Hawkies: Integrated Electronics. (6 Hrs) 5. Krishamurthy. Basic Electrical Engineering – Tata – McGraw Hill Publishing Com. (6 Hrs) 2.Raghuveer: Electrical and Electronics Engineering for scientists and Engineers. values (6 Hrs) 3. Mittle. A Full Adder.C. valueof sinusoidal current – Importance of R. terminology ad their Important relations – Values of alternating voltage and current – Peak value – Average value of sinusoidal current – importance of R. H.BCA – 103: Basic Electricals and Electronics Total: 50Hrs 1. Semi-conducting Devices: Atomic Structure. R-L Series Circuit – Impedance triangle – Power factor – True power nd Reactive power – Significance of power factor R-C series circuit – R. logic and gates. (4 Hrs) 4. Full Wave Bridge Rectifier.J. Zener Diode. values – Form factor and Peak factor –m Phase. 3. Bangalore 4. Operational Amplifiers: The Ideal Operational Amplifier.S. Fractional Numbers. 555 as a mountable multivibrator.s. Network theorems: Introduction – Kirchoff’s law: Loop and nood method of analysis. Shunt Capacitor Filter.M. 2. (5 Hrs) Text Book: 1. Counters. Ripple. Voltage Regulation. Semiconductors. Binary Subtraction. binary coded decimal numbers. Kennedy and Davie: Electronic Communication systems. The Full Wave Diode Rectifier. OPAMP Applications. Basic Electrical Engineering. cerystal oscillator. Polyphase Circuits: Polyphase system – Reasons for use of 3-phase system – Elementary 3-pase alternator – Some Concepts – Interconnection of three phases – Star or Y-connection – Voltage and Current in balanced Y-connection – How to apply load? – Dealt or Mesh connection – Voltages and currents in balanced delta connection – Advantages of star and delta connected system. 2. COMS. Saturable Property of an OPAMP. The Electron. M.R. Expression for amplitude modulated wave and frequency modulated wave. (6 Hrs) 8. Digital IC families DTL. Cotton.c. (1990) Horwitz: Art of Electronics (1990) . A. V. Ltd. 8/e. TMH Publication (1999) 5. definition of amplitude modulation and frequency modulation. Zener Diode Voltage Regulator. TTL. Hexadecimal Number System. (5 Hrs) 7. Phsor diagrams using r. Oxfprd University Press (1998) 6. Communication Systems: Basic Block diagram of communication system.R. astable multi vibrator using op amp.S. Pitman Publication. (6 Hrs) 6. flip-flops and registers: Decimal System. OPAMP Characteristics. Driscoll and Cognation : Op Amplifiers and liman intergrated circuits. NEW AGE INTERNATIONAL (P) LTD. Binary Number System. Logic Gates. Diode Characteristics. value of sinusoidal current – importance of R.H. Energy Band Theory of Crystals. Hughes: Hughes Electrical and Electronics Technology.M. Ripple Factor. Binary Addition. Octal Number System. The Comparator. Boolean Algebra. Superposition Theorem – Thevenin’s Theorems – Maximum Power Transfer Theorem – Reciprocity Theorem – Delta/Star and Star/Delta Transformation.M.m. The Non Inverting OPAMP Circuit. Nortons Theorem. K. Diode Characteristics. or effective value – R. A. for B. Square Wave Oscillators: Working of RC wien Network oscillator. Sedra / Smith : Microelectronic circuits. IC Timer Circuits: The IC – 555 timer. Need for modulation.S. TMH Edition IV (1998) 9. Advanced Electrical Technology. Die fender: Principles of Electronic Instrumentation. The Halfwave Diode rectifier. A Half Adder.N. Fundamentals: Alternating voltage and current – Sinusoidal alternating voltage and current – Generation of altering voltages and currents – Equation of alternating voltage and current – important a. PHI Publications. Allen Mottershead: Electronic Devices and Circuits: PHI Publications (1997) 8. Saunders College Publication (1998) 7. V.L. Diode Forward Resistance. 2/e Pearson Education References: 1. Mehta.S.M. 555 timer applications (2 Hrs) 10. Storey: Electronics: A Systems Approach . Number systems. Sinusoidul. K. Pearson Education 3. The Inverting OPAMP Circuit. ECL. comparison between AM and FM Modulating and demodulating circuits. (4 Hrs) 9. Phase difference – Representation of alternating voltages and currents – Phasor representation of sinusoidal quantities.
reading a character. Ritchie “ANSI C Programming “(PHI) .2 Overview of C: Introduction. writing characters. CD ROM. (5 hrs) 2. Von Neuman concept of computer system. Kamthane. Pearson Education 2003 References: 1. Secondary storage devices – Floppy disk. (2 Hrs) 1. declaration of variables. defining symbolic constants. Lightpen.3 Constants. type conversion in expressions.1 Problem solving using Computers. array as structure. Logical operators. nesting of IF . The FOR statement. operator precedence and associativity. (3 Hrs) Text Books: 1.10. The GOTO statement.4 Computer Programming: Basic Programming concepts – Algorithm. handling of noninteger functions. (4 Hrs) 2. (4 Hrs) 2. assigning values to variables. Joystick. Importance of ‘C’. some computational problems. constants. CU. conditional operators. formatted input. arguments but no retuen values. Simple IF statement. (2 Hrs) 2. Variables and Data Types: ‘C’ Tokens.. (2 Hrs) 2. (5 Hrs) 2. Application Software. structure initialization. formatted output statements. Digitizer.: “Programming in C”. (4 Hrs) 2. The DO statement. Flowcharts. string handling functions-strlen. The?: operator. giving values to members. Spencer: introduction to Electronic Circuit Design Pearson Education 2003 11. array within structure. (3 Hrs) 1. 5/e Pearson Education 2004 BCA – 104: Computer Concepts and C. putting strings together. functions with arrays. The While statement.2 Hardware: Input devices keyboard. variables. Compilers and editors. special operators. strcmp. 3. Sample ‘C’ Programs. (3 Hrs) 1.4 Operators and expression: Arithmetic operators. Assembly language. Higher level programming languages. comparison of structure variables. recursion. Programming with ANSI and Turbo C. bitwise operators. Multidimensional arrays. data types. 2. calling a function. Programming style. E Balaguruswamy. keywords. Assignment operators. Return values and their types. Mathematical functions. jumps in loops. writing string to screen. Plotters.8 Handling of Character Strings: Declaring and initializing string variables. The IF-ELSE statement. Modular Programming and Structured Programming. 2/e. Merits and demerits of all the languages. arithmetic operations on characters.Programming Total: 50Hrs 1.: “Programming with C”. Central Processing Unit (CPU). The switch statement. arguments with return values. ELSE statements. the form of ‘C’ function.7 Arrays: One dimensional arrays. Computer Concepts: 1. initializing two-dimensional array. reading string from terminal. V. a multi-functional program. Tata McGraw-Hill (2000) Yashawant Kanetkar: “Let us C” Rajesh Hongal: “Computer Concepts and C Language” Brain verminghan and Dennis M. Comparison of two strings. increment and decrement operators.9 User defined functions: Need for user-defined functions. Machine Level Language. Main memory. union. 4.10 Structure and Union: Structure definition. 6. PHI (EEE) (2000) S. : Programming in ANSI C” Tata Mc Graw-Hill (1998) 2. ‘C’ Programming 2. Input/Output unit. ALU.(2 Hrs) 2. accessing a variable through its pointer. declaring and initializing pointers. Hard disk. Relations operators. Output devices – Various types of printers. Branching and Looping: Decision making with IF statement. and identifiers. Assemblers. Tomasi: Electronic to Communications Systems. Scanner.11 Pointers: Understanding pointers. category of functions – No arguments and no return values. Operating System. PHI (EEE) (1999) V. nesting of functions. Witter Electronic to Instruments. Concept of Flowcharts and algorithms. Mouse. strcpy (4 Hrs) 2. (2 Hrs) 2. Brief history of computer generation. accessing the address of variables.5 Managing input and output operators: Input and Output statements.6 Decision making. Executing a ‘C’ Program. (5 Hrs) 2. Basic structure of ‘C’ Programs. stract. 5. Block diagram of computer system.3 Software: System Software.1 Introduction To Computer: System logical organization. Two-dimensional arrays. Person Education 2004 12. Rajaraman. The ELSE – IF ladder. Rajaraman: “Fundamentals of Computers”. ByronGottfried. Optical disk.
the Prime Minister. ¨sÁgÀvÀzÀ ¸ÀA«zsÁ£À (1975gÀ CUÀ¸ïÖ 10gÀªÀgÉUÉ ªÀiÁ¥ÁðlzÀAvÉ). the Right against Exploitation. QgÀt ¥ÀæPÁ±À£À. ¨sÁgÀvÀ ¸ÀgÀPÁgÀzÀ ¥ÀgÀªÁV. 2003. Local Government and the Constitution. New Delhi. Indian Government and Politics. gÁd±ÉÃRgÀ. Union Government – Powers and Functions of the President. VIII Edition. Salient features. 2004. Kernighan. New Delhi. Briji Kishore Sharma. Working of Democratic Constitution: The Indian Experience. Allahabad: Central Law Agency. V. 2004. 1994. (12 Hrs) 5. Introduction to the Constitution of India (Second Edition). Prentice Hall of India. Constitution Assembly Debates. powers and functions of the Parliament. S.7.N. M. 2001 4. Constitutional Development and National Movement in India. National Book Trust 2000. Sterling Publishers. (10 Hrs) 3. Vikas 2005. ¨sÁgÀvÀ ¸ÀgÀPÁgÀ ªÀÄvÀÄÛ gÁdQÃAiÀÄ. 1999. Prabodha. Avasthi.C.C. Venkateshmurthy. Pearson Education. the Right to Freedom of Religion. New Dilhi.C. India Government and Politics. 2. B. Relation between the Union and the States.V. An Introduction to the Constitution of India. the Right to Equality. 1976 . 14. Granville Austin. J. Johari. New Delhi. 5. New Delhi. Procedure for amendment of the Constitution (10 Hrs) 2. Our Constitution: An Introduction to India’s Constitution and Constitutional Law. Organization of Judiciary. – 105: Indian Constitution Total: 50Hrs 1. JZï. Ramkumar and Rakesh Aggarwal “ANSI C Programming” Tata McGraw Hill 8. Pearson Education. 9. the Right to Freedom. Lok Sabha Secretariat. New New Delhi. Gupta. Chief Minister. 3. Durga Das Basu. 10. New Delhi. Understanding the Indian Constitution. Serials Publication. 6. Indian Government and Politics. Composition. 2004. H. Mahajan.P. Composition. Mysore. Pylee. Kashyap. 13. 1989. D. Council of Ministers. Citizenship. A. Powers and Functions of State Legislature. 12. Fundamentals Rights.M. Independence of Judiciary. Indian Constitution. Oxford University Press. Pandey. 11. C – Programming Language ANSI C Version. 15. New Delhi. Programming Techniques through C. Significance of the constitution: Making of the Constitution Role of the Constituent Assembly. S. Latest edition. Prentice-Hall of India. the Preamble. 2004. the Right to Constitutional Remedies.. PÀ£ÁlðPÀ ¸ÀgÀPÁgÀzÀ ªÀÄÄzÀæt. Introduction to the Constitution of India. Agra Naveen Grawal.A.A. Difference between of Fundamental Right and Directive Principles of State Policy – Implementation of Directive Principles of State Policy. Cultural and Educational Rights. Vikas. ¯ÉÃRPÀ ¸ÁªÀÄVæ ªÀÄvÀÄÛ ¥ÀæPÀvÀuÉUÀ¼ÀÄ ¤zÉðÃ±ÀPÀjAzÀ ªÀÄÄ¢ævÀªÁV ¥ÀæPÀnvÀªÁVzÉ. Palikar. (10 Hrs) References: 1. 9. 2004. State Government – Powers and Functions of Governor. 8. Constitutional Law of India. 2005. Delhi. JA. Council of Ministers. New Delhi. Fundamental Duties (8 Hrs) 4. Jurisdiction of the Supreme Court. Nature of the Directive Principles of State Policy. ªÉÄÊ¸ÀÆgÀ.D. J. Subhash C. 7. Rajasekhar. Chand and Co.
and U. It is a text that engages with India’s profound diversity and complexity but at the same time lays down an authorities framework for a life lived in common. The objective of this course is to familiarize the students of various degree courses with the Indian constitution and its values. Each paper shall have 10 questions carrying 16 marks each. Marks secured in this paper shall be considered for the award of class/rank.P. b. out of which students have to attempt 5 questions. Each paper shall have 80 marks for semester examination and 20 marks for internal marks. f. The should be introduced in the first semester of respective degree programmes. Objectives of teaching the paper: a) To provide constitutional literacy for every students at the graduate level. need to be acquainted with its structure and important provisions. a. c. b. .. d.G. Medium of instruction shall be English and Kannada. The composition of marks shall be as under: a.Ed. This paper is compulsory for all degree courses except B.Indian Constitution Compulsory Paper for all Degree Courses (Except B. This course should to be taught in non-technical manner as to be comprehensible for student other than from the social sciences. b) To make the student conversant with the citizenship role as prescribed under the constitution. particularly those endowed with higher education in India. Eligibility for Teaching: Those who have the Post-Graduate degree in Political Science or Law are eligible to teach the paper Scheme of Examination: There shall be University examination at the end of the semester. Internal assessment shall be conducted by arranging two class test of 10 marks each. The approach of teaching the course is to communicate the basic ideas contained in the constitution in a simple manner. It upholds the rights and reasonable claims of citizens. c) To make a student understand appreciate and internalize the glorious struggles for freedom that culminated in the formulation of the constitution and to emulate the constitutional values enshrined in the preamble of the constitution. e. B. This paper shall have four lecture hours of teaching per week. This paper shall be of 100 marks out of which 20 marks shall be for internal assessment. Each class test shall consist of Multiple Choice Question (MCQ) (10 questions) carrying 5 marks and short note carrying 5 marks. Law Courses) Course Rationale: It is essential for every citizen of the country to be aware of the constitution.Ed. And UG Law courses. Duration of examination shall be of three hours. The constitution of India is a law that all Indians have collectively given to themselves and one expected to regulate and orient their public life on that basis. Calendar of tests shall be notified in the first week of each semester. Ed.
Write a C Program to read a string and check whether it is palindrome or not. 6. 2.. Realization of Logic gates (NOT. Zener diode a characteristics 13.2 (Based on BCA – 103) List of Experiments: (At least any twelve experiments to be conducted) 1. 3. Zener diode as a voltage regulator. Energy gap of semiconductor (Thermistor) 11. B.A.L. Halfwave/Fullwave (Bridge Rectifier) using semiconductor diode. Demorgan’s laws and given Boolean Expressions. Capacity of Condenser by charging and discharging 2. 9. 5. 18. OR. Sensitivity and figure of merit of mirror galvanometer. Write a C Program to input numbers and to find mean variance and standard deviation. ..107 Computer Lab – 1. Write a C Program to find trace and normal of square matrix using functions. IC 555 timer as a Monostable Multivibrator.1 (Based on BCA – 104) Sample Programs: 1. 11.B. 12. 14. 7. 15.C. Impedance matching (Maximum power transfer theorem) 4. Write a C Program to find the length of a string without using the built – in function. 13. 15. NOR and XOR using NAND gates) 9. and C in a black box. Write a C Program to accept different goods with the number.A. price and date of purchase and display them. Write a Program to find the root of the given quadratic equation using switch case. NAND gates. Identification and Measurement of R. 10. Thevenin’s and Norton’s Theorem. 7. price and date of purchase and display them.106 Computer Lab – 1. OP-AMP as an amplifier and study of gain – bandwidth product. LCR series and parallel resonance circuit. 16.C. Design of Half adder/Full Adder using NAND gates. 8. 3. Write a C Program to read two matrices and perform addition and subtractions of two matrices. Write a C Program to find the factorial of a number using function. Write a Program to find whether a given number is prime number or not 6. Write a C Program to find trace and normal of square matrix using functions. 8. Write a Program to accept different goods with the number. Write a C Program to compute the sum of even numbers and the sam of odd numbers using a function. 10. 5. AND. Write a C Program that reverse a given integer number and check whether the number is palindrome or not. Write a Program to find the GCD and LCM of two integer numbers 4. Write a C Program to generate and print first N FIBONACCI numbers. Study of Lesazies figure. Design and test adder circuit using IC 741 17. 14. NAND. 12. Inverting and Non-inverting amplifier using IC 741.
Calculus and Analytical Geometry. E. B. Maximum and minimum for a functions of two variables – Langrages’ Method of undetermined multipliers (with one subsidiary condition). Vector – integration – Line integral – Greens.1 to 13. 5. Applications of differential equations and simultaneous differential equations.C. Solenoidal and Irrotational Vectors and their properties.9 Chapter – 12: 21.12 to 4. Problems. Divergence. parametric polar and pedal forms.5.19 2. (8 Hrs) nd 4.S.6. Periodic functions. Vector Calculus: a..12. Laplacian.. Langrange’s and Cauchy’s value theorems. 14.4. 39. 36th Edition. – 201 (A) : Mathematics – II Total: 50Hrs 1.4 to 4.7. . Grewal “Higher Engineering Mathematics”.15 Chapter – 13: 13. Inverse differential operator. 9/e Pearson Education. Stokes theorem (without proof) simple problems with application to Engg. Taylors Theorem for a function of single variable (without proof). Beta and Gamma functions (8 Hrs) 3. Laplace Transforms: Definitions. b. John Wiley and Sons VI Edition. transforms of elementary functions – transforms of derivatives and integrals – properties.14 Chapter – 5: 5. 37. Thomas. 126.96.36.199 to 8. 5. Grewal. Chapter – 12: 14. 14.8 3.13 Chapter – 7: 7. 7.: 34.8. Solutions of Cauchy’s homogeneous liner equation and Legendres equation – Solutions with initial and boundary conditions.7.8. “A Short course inDifferential Equation”. Maclaurin’s series expansions. (11 Hrs) 5. 43 to 49 References: 1. Indeterminate Forms – L Hospital’s rule (without proof) Taylor’s Theorem for a function of two variables (without proof) – problems only. 15.A.4 and 7. Inverse transforms – properties – Convolution Theorem. Kreyszig. Gauss.5. b.S. Method of variation of parameters and undetermined coefficients.6(2).15 and 7. Multiple Integral – Evaluation by change of order of integration – change of variables and applications to area and volume. “Elementary Engineering Mathematics”. Acceleration of a vector point function – Gradient. b.2 to 21. 8. 3.6.BCA – Second Semester B.1. Curl. (11 Hrs) 2. Rolle’s theorem (without proof).1 to 7. and 4. Differential Calculus: (a) Derivatives of Acrs – radius of curvature – Cartesian. Velocity.16 Chapter – 8: 8. Chapter – 6. Differential Equations: Differential equations of 2 and higher order Lineat Differential equations with constant coefficients. Rainville E. Integral Calculus: a. 7. Advanced Engineering Mathematics. unit step functions and Unit impulse functions. 2. 15. 4th Eedition. (12 Hrs) Text Books: 1. B. Chapter – 4: 4. 40. 5.D.
Van Horne. objectives and classification of labor cost. Fundamentals of Financial Management 1 1/e Pearson Education. premium and at discount preparation of company final account. Variability. solvency. Electronic data processing. Accounting system and MIS. premium and discount Forfeiture of Shares – Re – issue of forfeited shares. behavioral. Overhead Cost Control – Classification and collection of overhead cost. Jain and Narang. New Delhi 6. prices of materials issues (FIFO and LIFO methods only) Direct Labour Cost Control – Meaning. place rate (including differential piece-rates)incentive Plans-Halsay and Rowan plans only. Pearson Education. Advance Accounting. References: 1. R. purchase routine and determination of various levels. Bhar. activity and profitability ratios. time element-wise classification. Kolkatta) 7. Arora : Cost Accounting. (Academic Publication. Computation of total direct labor cost Methods of remuneration – time rate. House. Management Accounting. Sharal. Fundamentals of Financial Management. 12. Maheshwari. Sharan.N. Pearson Education 2005 . IKalyani Publishers) 2. Dutta: Cost Accounting Pearson Education 2003 5. Kalyani Publisher. Preparation of cost sheets. B. Financial Accounting. Maheshwari: Advance Accounting (S. (S. Advanced Accounting 4. Feature. Financial statements analysis and Interpretation meaning. Company Account: Issue of shares at par.B. S. Cost Accounting. advantages and disadvantages. Tulsian. New Delhi 10. advantages and limitations of ratio analysis. cost classification for managerial purposes. Chand and Sons) 3. M. Jain. objectives and classification of material cost. Madegound. Issue of debentures at par. Vikas Publication.Concept and nature. Chand and Sons) 8. objectives and classification of ratios-liquidity. S. Narang: Cost Accounting. Management Accounting.C. Primary and Secondary distribution of overheads. Material Cost Control – Meaning. Pearson Education 2005 13.N. overheads absorption methods-direct labor hour rate and achine hour rate method only. Mumbai) 9. controllability. J. Fundamentals of Financial Management.A. (Himalaya Pub. Hupt.L. 11. 201 (B): ACCOUNTING AND FINANCIAL MANAGEMENT-II Total: 50 Hrs Accounting as an information system .N. Cost Classification – Need and significance and methods of classification-Functional. K. Segregation methods of semi-variable costs into variable and fixed components.
Stopping by wood on a Snowy Evening – Robert Frost 3. Addone Publishing Group. Its Importance as a link Language for effective Communication A Textual : Prose 1. Oxford Guide to speaking and writing.. Where the Mind is without Fear Rabindranath Tagore Grammar: Prepositions. 3. 4. Kerala. Abu Ben Adam (Leigh Hunt) 2. Poetry (G. Software and Medicine.BCA 202: English Syllabus Introduction: 1. Importance of English as a lingua franca (Language for communication) 2.K. Snakaran. Thiruvananthapuram. General Character of English 5. Shall I Compare Thee…. john Seely. Gardnier) 2. (A Shakespearean Sonnet) 4. Chesterton) Poetry: 1. Its flexibility heterogeneity copiousness and Adaptability etc. English Rank Scorer by G. My Last Day in School (C Smith) 3. . Transformation of Sentences Active – Passive Affirmative – Negative Assertive – Exclamatory Assertive – Interrogative Vocabulary – a) Synonyms b) Antonyms c) Homonyms d) Idioms and Phrases e) One word equivalents Transformation: Sentence: Direct. 2000. The Golden age (A. Forgeeting (Robert Lynd) 4. Its unility in the field of Science. Technology. 2. Indirect Speech Essay / Report Writing Precis Writing Letter Writing Personsal/Official/Application Letter Total Total: 50 Hrs Allotted Allocation of Teaching Hours Marks 3 3 3 3 3 2 2 2 2 4 6 5 5 5 5 5 5 5 5 6 4 1 1 1 1 1 3 3 3 3 50 Hrs 2 2 2 2 2 5 5 5 5 80 Marks References: 1. English as a World Language 6.G. Articles and Punctuations.
2 Solution of System of liner equation. Trapezoidal and Simpson’ formula. parallel and series system. Ltd.5 . ---. Shirley Taylor: Communication for Business. Regula Falsi. New Delhi 5. Vik Kapoor and Gupta: Mathematical Statistics S. Fixed point iteration method. standard deviation. Rank correlation and illustrated examples. New International Business English Published by Cambridge University Press. Curve fitting by least squares method. – 203: Numerical and Statistical Methods. M. illustrative examples.1 2. Shastry.. Pvt.Text Books: 1.K. Newtons-Raphon methods. Carl pearson Correlation. Conditional probability Boy’s theorem. Interval halving methods. Jain. Normal and weibul Distribution applications and problems. (8 Hrs) 1. secant. Application and problems (3 Hrs) References: 1. Y. Probability mass / density function Discrete Distribution – Bernoulli Binomial. Basic Grammar. 3. Statistical Mthods: Basics Concepts and Definition of statistics.3 2. Jain Numerical methods for Scientific and engineering computation: Wiley Eastern (1198) 2. Laws of probability (based on set theory concepts). Problems and application. Gaussian elimination method. ( 6 Hrs) Random variable and Expectation: Discrete and continuous random variables. New Delhi 6.1 Solution of equations (polynomial and transcendental equation). Shina and B. LU Decomposition method. IFR and DFR. 1. SLN Sharma and K. Romberg Integration.2 2. Total: 50Hrs Numerical Methods: 1. S. K.4 2. Jones.4 Numerical Differentiation. Trevedi (1198) Probability and statistics with Relability Queing and computer Science application Prentice Hall of India. theorems on expectation.A. (8 Hrs) 1. (3 Hrs) Probability Distribution: Probability function.C. P. Shaknaranarayana. Gauss-Siedal iteration methods. (7 Hrs) Relability: Basic concepts and definition of reliability.--. Pearson Education B. Integration. K. S. Pvt Ltd. : Introductory methods of numerical Analysis PHI (New Delhi) 2001) 3. 2..S.Geometric distributions continuous distribution – exponential. Applications and Computations Sterling Pub. Agarwal: Statistical methods. skewness and kurtosis. Eigen values and Eigen vectors of a Square matrix. Navakarantaka Publications 2. (5 Hrs) 1. SRK Iyengar and R. Interpolation formula – Lagrange interpolation. corfficient of variation. Gauss-Jordan. Gale: Theory and Relability 2. hazard. Probability: Basic concepts and definition of probability Probability axioms. Mean. New Delhi 4. K. K. Chand and Co.3 Newtons forward and backward differences. S. expectation of random variables.
Defining. Node. Complete binary tree. Depth. rewind functions. Path. putc. Writing Recursive programs – Binomial coefficient. circular queue. advantages and Disadvantages of linked list and circular doubly linked list. GCD.Definition: Tree. Fibonacci. fscang. deletion. Pearson Education 205. Non-terminal nodes. Operation on data structures. Ausenstein Maoshe and M. (7 Hrs) Tree . putw. getw. Opening and closing a file. 7. Binary search tree. Level. Weiss. Types of queue: Simple queue. Quick sort (10 Hrs) Stack – Definition. Recursion in C. (4 Hrs) Searching and Sorting Search: Basic Search Techniques: Search algorithm searching techniques: Sequential search. double ended queue (deque) priority queue. search and display. 6. (7 Hrs) Text Books: 1. (4 Hrs) Recursion: Definition. Binary Search – Iterative and Recursive Methods. Error handling during I/O operations: Common errors during I/o operations. Parent node. (6 Hrs) Linked List – Definition.General Background: Definition. Terminal nodes. Binary tree: Array representation of tree. Kamthane: Introduction to Data Structures in C. Components of linked list. (4 Hrs) Files – Introduction: Definition Basic file operations: Naming a file. Operations on singly linked list: creation. Meaning of static and dynamic memory allocation. Degree of a node and tree. Array representation of queue. Inorder and postorder. References: 1. Lipschutz: Schaum’s Outline series Data Structures Tata McGraw-Hill Robert Kruse Data Stuctures and program designing using ‘C’ Trembley and Soresnson Data Structures E.B. Reading data from file. different types: Bubble sort. Creation of binary tree. ancestors of a node. 5. Input / output operations on files: getc. Accessing a variable through its pointer. insertion. 3. (2 Hrs) Dynamic Memory Allocation and Pointers: Definition Accessing the address of a variable. Edge. and closing a file. ftell. Array representation of stack. Declaring and initializing pointers. prefix and postfix notations Conversion of an arithmetic expression from Infix to postfix. fprintf. operations on all types of queues. Traversal of Binary Tree: Preorder. Data Structures Using C Pearson Education Tenenbaum. Applications of staks. Data Structures and Algorithm Analysis in C. Classification of data structures: primitive and nonprimitive. 4. writing data to a file. feof. 2. II Edition.A. Memory allocation functions: malloc calloc. Opening a file. Heap Tree terminology: Root. Bandyopadhyay. Data Structures Using C. – 204: Data Structures Using C Total: 50 Hrs Introduction to Data Structures: Definition. Pearson Education . Operations on stack: Infix. Binary tree. (6 Hrs) Queue – Definition. Merge sort. Sort. Comparison between sequential and binary search. free and realloc. Tanenbaum Aaron Data Structures using C and C++ Pearson Education. Selection sort. Pearson Education.Blaguruswamy Programming in ANSI C. Insertion Sort. Siblings. ferror Random Access to files: fseek. 2. Representation of linked list. Langsam.C.
. birds. environmental effects of extracting and using mineral resources. (3 Hrs) Unit 7: Field work: Visit to a local area to document environmental assetsriver/forest/grassland/hill/mountain. consumers and decomposers. Natural Resources and associated problems: (a) Forest resources: Use and over-exploitation. Ecological succession. productive use. effects and control measures urban and industrial wastes. Bikaner. estuaries) (4 Hrs) Unit 3: Biodiversity and its conservation: Introduction-Definition: genetic. Value Education. fertilizer-Pesticide problems. causes. Solid waste management: causes. Vist to a local polluted site-urban/ Rural/Industrial/ Agricultural. Air (prevention and control of pollution) Act. consumerism and waste products. Family welfare programme. K. man-wildlife Conflicts. Biogeographical Classification of India. use of alternate energy sources. (d) Food resources: World food problems. Energy flow in the ecosystem. dams and their effects on forests and tribal people. Text book of Environmental studies AITBS Publishers.. deforestation timber extraction. ethical. Introduction. wasteland reclamation. watershed management.. Biodiversity at global. Environment protection Act. acid rain. Climate change. Endangered and endemic species of India. Role f an individual in prevention of pollution. Study of common plants. ozone layer depletion. Hot-spots of biodiversity. soil erosion and desertification. (5 Hrs) Unit 4: Environmental Pollution: definition. poaching of wildlife. (f) Land resources: Land as resources. 2001 Environmental Biology.. lakes. global warming. earthquake. effects and control measures of: a) Air pollution b) Water pollution c) Soil pollution d) Marine pollution e) Noise pollution f) Thermal pollution g) Nucleat hazards. mining. Role of information technology in Environmental and human health. changes caused by agriculture effects of modern agrticulture. hill slopes. species and ecosystem diversity. Value of Biodiversity: consumptive use. Population explosion. Tsunami. Wildlife protection act. Women and Child Welfare.. structure and function of the following ecosystem: a) Forest ecosystem b) Grassland ecosystem c) Desert ecosystem d) Aquatic ecosystems (Ponds. Disaster management. Delhi. Forest conservation Act. streams. (3 Hrs) 1. insects. M. study of simple ecosystem-ponds. Sinha. etc. and land degradation. Western ghat as a bio-diversity. Shukla. dams-benefits and problems. (b) Water resources: Use and over-utilization of surface and ground water. (4 Hrs) Unit 6: Human Population and the Environment: Population growth. Conservation of biodiversity: In-situ and Ex-situ. Resettlement and rehabilitation of people. Shukal and R. man induced landslides. Urban problems related to energy. (e) Energy resources: Growing energy needs.BCA 205: Human Rights and Environmental Studies Total: 60Hrs Section A: Environmental Studies Unit 1: Bature of Environmental studies: Definition. Issues involved in enforcement of environmental legislation public awareness. floods. renewable and non renewable energy sources. river. Nidi Publ. Food chains. India as a mega-diversity nation. Environment and human health. . nuclear accidents and holocaust. drought. (6 Hrs) Unit 2: Ecosystems: Concept of an ecosystem.C. types. Environmental ethics: Issues and possible solution. (2005) Agarwal. oceans. its problems and concerns. (c) Mineral resources: Use and exploitation. rain water harvesting. need for public awareness. Water conservation. Water (Prevention and control of pollution) Act. scope and importance.: flods. Threats to biodiversity: habitat loss. Role of an individual in conservation of natural resources Equitable use of resources for sustainable lifestyles. Characteristic features. 2. social. variation among nations. Structure and function of an ecosystem. rivers. conflicts over water. national and local levels.. References: S. Conservation of biodiversity. Producers. food weds and ecological pyramids. Ltd. cyclone and landslides. aesthetic and option value. Multimedisciplinary nature of environmental studies. (5 Hrs) Unit 5: Social Issues and Environment: From Unsustainable to Sustainable development.
Ltd. 8. (10 Hrs) References: 1. Odum E. Essesetials of Ecology Blackwell Science. guidelines. 9.S. Vol I and II Enviro Media. tribal and the disabled. 5. Section B: Human Rights Unit 1: Nature of Human Rights. Functions of Human rights in modern society. 20. House. Civil and Political Rights-Nature and functions:. Environmental Science Wadsworth publishing co. Renforecement of Human rights in peace and war the futre of Humanity. Horhani. 1989. Gleick. Marine pollution. 1 should be short answer type questions of 2 marks each (5 out of 7)10 Marks . Miller T. and School R.A. Marks 40 40 80 Internal Assessment Marks 10 10 20 Total Marks 50 50 100 Question paper pattern (Model): The examination question paper will carry total 80 marks which is divided into two section A and B. ompliances and Standards. 1978... Allahabad. House Delhi. 22. Environmental and Security. Jaico Publ. 1998 Environemnt. Cooper. 17. USA 574p Rao M. 1987 Waste Water treatment. Co pvt. Oxford University press 473p.P. Himalayas Pub. Hazardous Waste Incineration.B. 3. 1986. children minorities. 16.K. 1993 Water in crisis. 15. 21. H. Central Law Publications.P. H. Encyclopedia of Indian Natural History. Townsend C.G.O. Cunningham. (10 Hrs) Unit 3: :Enforcement of human rights-Basic principles governing enforcement of human rights at national.D.. Heywood.. Question No. Jadhav H and Bhosle V. Bharucha Erach. Techno-Science Publication. 6. The Biodiversity of India. 7.3. 2001 Environmental chemistry Goel publ. 480p.E. 1995 Global Biodiversity Assement Cambridge Univ. Meerut. Hose. Agarwal-Human Rights. Matter Hazardous Techno-Science Publications.C. and P. Saunders Co. Regional and International levels. Centre for Science and Environment. Henkin Luise. Clark R. 2. Hawkins R. 13.M. McGraw Hill Inc. each carrying 40 marks.net Brunner R. Enhanced edition 639p. Vh and Watson R. Wagner K. Institute. Durga Das Basu-Human Rights in Constitutional Law (Relevant Chapters). Trivedi R. A. 18. E and Hepworth. Jr. 499p.K. W. functions and powers. Social and Economic Right. Ahmedabad-380013. 1995 Environmental Protection and laws. Handbook of Environmental Laws. W.K. Wiley Eastern Ltd. 2001 Environmental Encyclopedia. press 1140p Mhaskar A. Clanderson Press Oxford. London: Steven. (10 Hrs) Unit 2: Classification of Human Rights. Origin and development of the concept of Human Rights. Eastern Law House. 1971 Eundamental of Ecology W. 4. J.M. Goel introducation to air pollution. and Data A. rules. Environmental Chemistry. ltd 345p Sharma B. T.N. 10. Stockholm Env.S. 1196p.K.H. and Michel Begon. Bombay. 12. India E mail: mapin@icenet. M. Right of vulnerable group such as women. Human rights and democratic governance: Limitation of Human Rights. 5. Mumbai. 14. Trivedi R. 284p Mackinney M. Philadelphia. Calcutta. Mapin publishing Pvt. Right of Man toady. De. Bombay Natural History Society. Harper.T. Oxford and IBH Publ. U.B. Down to Earth. Singh Nagendra. National Human Rights Commission-Organisation. The question paper pattern for each section should be as given below.K. 1996 Environmental Science system and Solutions Web.T. 1.L. 4. Pacific institute for studies in Dev.K.P. 11.K. Saundrs Co. 19. Answer to Section A and Section B should be written in two separate answer books. Relevant international Instruments. Total Teaching Hours Section A Environmental Studies Section B Human Rights Total 30 30 60 Hrs Exam. Constitutional incorporational of Human Rights in India.
Write C functions to do the following. LDISPLAY Displaying all the nodes in the list 7. Write a C program to simulate the working of an Circular Queue using an array. . create an out put file which contains Roll-No. POP 3.1 (Based on BCA 204) Sample Programs: 1. Total and Average. the operations to be. SDELETE and CQDISPLAY. Roll – No (Integer). Provide the operations CQINSERT. 9. 3. BCA – 206: Computer Lab 2. Name. Write a C program to sort a list of N elements using Bubble sort Technique 3. PUSH 2. 11. 3 & 4 $ should be short notes of 5 marks each (2 out of 3)10 Marks. 6. -. / as operators. Marks in two subjects. Using Dynamic variables and pointers construct Binary search tree of integers. LINSERT Inserting a node in the front of the list 2. Name (Character string) The operations to be supported are. under flow and empty. Using dynamic variable and pointers Write a C program to construct a singly linked list consisting of the following information in each node. DISPLAY. Write a C program to find the Binomial coefficient using recursion 13. The program should print appropriate messages for STACK overflow. print the total number of moves taken by the program. Check the Circular Queue Status for empty and full. Write a C program to sort a list of N elements of integer type using quick sort Algorithm 12. it should contain Roll-No. Provide the operation QINSERT. the expression consists of single character (letter or digit) as operands and +. Write a C program to simulate the working of Towers of Hanoi problem for N disks.2. Write a C program to convert and print a given valid fully parenthesized in fix arithmentic expression to post fix expression. Write a C program to sort a list of N elements of integer type using heap sort Algorithm 10. supported are 1. 1. Write a C program to search for an element in an array using Binary search 2. CQDELETE and CQDISPLAY. Write a C program to demonstrate the working of staff of size N using an array The elements of the staff may assume to be of type integer or real. Write a C program to create file for N students. 5. LDELETE Deleting the node based on Roll – No 3. Question No. *. Using the above created file. assume that only binary operators are allowed in the expression 14. Marks in subjects. Write a C program to sort a list of N elements using Merge sort Algorithm 8. Question No. Check the Circular Queue status for empty and full.20 Marks. Write a C program to simulate the working of an ordinary Queue using an array. 2 & 3 should be essay type questions of 10 marks each with internal choice. Write a C program to search for an element using sequential search 15. use separate functions to detect these cases 4. Name. LSEARCH Searching a node based on Roll – No 4.
Issue of Debentures. 8. Wrote a program to interchange primary and secondary diagonal elements of a squre matrix. 12. Write a program to find the roots of an equation f (x) = 0 using Bisection method. 12. Preparation of primary distribution summary for determining overhead cost of production and services departments. Write a program for the addition. Write a program to solve the system of equation Ax = b using Gauss Seidel method. 2. Write a program to find the roots of an equation f (x) = 0 using regular – False method. 6. Calculation of cost of good sold. Write a program to write a program to find the roots of an f (x) = 0 using \Newton – Rephson method.BCA-207: Computer Lab 2. 3. Recording of transaction relating to issue of shares. column sum. 1. Write a program to construct a continuous frequency distribution table for given data and find mean and standard deviation. Write a program to construct a discrete frequency distribution table and find mean and standard deviation. Preparation of cost-sheet 6. 7. 9. 1. Write a program to solve the system of equation Ax = b using Jacodi Iteration method. Sample programs on BCA 203: Numerical Methods. primary diagonal sum and secondary diagonal sum of a matrix. 11. 9. Write a program to accept a square matrix and determine whether it is an identify matrix of not. 11. Write a program to solve the system of equation Ax = b using Gauss Elimination method. Preparation of secondary distribution summary considering and without considering inter-service of the service departments. Determination of Machine –hour Rate. 7. 2. . Calculation of different rations and their interpretation. 4. Write a program to find Arithmetic mean. Calculation of different levels of stock. forfeiture of shares and Re-issue of forfeited shares. Calculation of earnings of employees as per time – rate. 5. Sample Programs On BCA 203: Statistical Methods. Write a program to find the row sum. Management information Systems and data Processing. 4. inventory turnover ratios and other sundry problems. Write a program to check whether the given matrix is singular or not. Problems of purchase of materials. Write a program to find the integral of a function using Trapezoidal rule. subtraction and multiplication of two matrices using functions. Preparation of final accounts of Joint stock companies. 3. 5. Geometric mean and Harmonic mean of a given numbers. 8. Piece – rate (including differential piecerates) 10. 2. 3. Preparation of stores ledger accounts as per FIFO and LIFO prices. Calculation of earning of employees by applying Halsay and Rowan incentive plans.2 (Based no BCA 201 (B) and BCA 203) Sample Programs on BCA 201 (B): 1. Write a program to find the integral of a function using Simpson’s 1/3rd and 3/8th rule using switch case. 13. 13. 10. value of stock and profit as per the above methods.
5. Write a program to find trend values using 3 year and 4 year moving average method. III Paper No.4.2 (Based on BCA 405) Hrs/Wk 4 4 4 4 4 6 6 Marks Max Min 80 32 80 80 80 80 80 80 32 32 32 32 32 32 IA 20 20 20 20 20 20 20 Total Marks Max Min 100 40 100 100 100 100 100 100 40 40 40 40 40 40 IV BCA401 BCA402 BCA403 BCA404 BAC405 BCA406 BCA407 4 4 4 4 4 6 6 80 80 80 80 80 80 80 32 32 32 32 32 32 32 20 20 20 20 20 20 20 100 100 100 100 100 100 100 40 40 40 40 40 40 40 . Write a program to fit Poisson distribution.e. Write a program to find the rank correlation. 7. mode and median of continuous frequency distribution. 9.1 (Based on BCA 302) Computer Lab3.2 (Based on BCA 304) Design & Analysis of Algorithms System Analysis and Design System Programming Data Communications Microprocessors Computer Lab 4. 12. Write a program to fit exponential equation and obtain trend values. Write a program to fit binomial distribution.f. 10. Write a program to find the Karl Pearson correlation coefficient between two variables. BCA – THIRD SEMESTER AND FOURTH SEMESTER (w. 11. Write a program to fit the regression equation X on Y and Y on X. Write a program to find the mean. coefficient between two variables. Write a program to fit straight line equation and obtain trend value. BCA301 BCA302 BCA303 BCA304 BCA305 BCA306 BCA307 Title of Paper Computer Organization and Architecture OOPS Using C++ Discrete Mathematical Structures Visual Programming Personality Development and Communication Skills Computer Lab3.1 (Based on BCA 401 & BCA 404) Computer Lab4. 6. 8. Academic Year 2006 – 2007) Sem No.
map simplification. binary counters. cache memory. error detection codes. design of computer. Moris Mano. stack organization. Pearson Education (2003) 3. timing and control. INPUT OUTPUT ORGANIZATION: Peripheral devices. Pearson Education (2003) 4. Tenenbaum. INTERGRATED CIRCUITS AND DIGITAL FUNCTIONS: Digital integrated circuits. execution and instruction. addressing modes. 3rd Edition. computer instruction. William Stalling. MEMORY ORGANIZATION: Auxiliary memory. of Indian (1991). memory management hardware. BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes. virtual memory. input-output and interrupt. Floyd. 8th Edition. Computer systems design and Architecture. random-access memories (RAM) read-only memories (ROM) DATA REPRESENTATION: Data types. program control. IC flip-flops and registers. M. microprocessor organization. microcomputer. Prenticfe Hall of India (1990) . 2nd Edition Prentice Hall. CENTRAL PROCESSOR ORGANIZATION: Processor but organization. Digital Fundamentals. Computer system architecture. instruction formats. virtual memory. Andrew S. Structured Computer Organization.BCA – THIRD SEMESTER BCA 301: Computer Organization and Architecture Total: 50 Hrs. Pearson Education (2003) 5. DIGITAL LOGIC CIRCUITS: Logic gates Boolean algebra. fixed-point representation. Computer Organization and Architecture. floaing-point representation. input-output processor (IOD). memory hierarchy. direct memory access (DMA). combinational circuits. arithmetic logic unit (ALU). data transfer and manipulation. sequential circuits. asynchronous data ansfer. associative memory. flip-flop. decoders and multiplexers. 2. References: 1. other binary codes. I/O interface. Heuring and Jordan. priority interrupt. shift registers.
Class members. Reusability. (4 Hrs) 9. Overloading. The scope of the class object constructors.BCA 302: OOPS USING C++ Total: 50 Hrs 1. passing structure variables. pure virtual functions. Array of objects. Data conversion. member functions defined outside the class. pass by reference. Class member visibility. Classes and Structures. Overloaded constructor. Closing Files. The scope resolution operator. Variable declaration. string J/O: Writing strings. The tellg function. Objects and Classes: Classes and Objects. Level of inheritance. Functions : Simple Functions: Function declaration. Operator Arguments. Inheritance: Derived Class and Base Class: Specifying the Derived class accessing base class members. Dynamic binding and Message passing. (8 Hrs) 7. Data Constructors. The Endl. Templates. reading an object from. function template. Streams: The Stream class Hierarchy. definition of OOP. Dynamic binding. Detecting End – of – file. (7 Hrs) 4. protected. Classes within classes. objects and memory. Destructors. array as class member data. Variables. the f offset. Operator Overloading: Overloading unary operator: Operator Keyword. Objects as arguments. writing an object ot disk. Default arguments. Data Hiding member functions. Passing argument to returning value from function. Class Templates. overloaded functions Different number of arguments. Inheritance and Program Development. (5 Hrs) 8. disk. copy constructor. overloading binary operator. The Const Qualifier. passing constants. friend classes. the this pointer. Friends for functional notation. Disk J/O with Memory Functions. Set W. Member function templates. string as class member (12 Hrs) 5. Data Encapsulation. Object J/O. Class Data Abstraction. Destructors. return statements. virtual member functions assessed with pointer. Introduction: Procedural Languages. Derived class constructor. Conversion between objects and Basic types. the protected access specifier. Stream classes Header file. Error Handling Command Line Arguments. Overriding members functions. Inheritance creating new Data Types. Assessing Member Data with this. set precision. Manipulators. Access Combinations. (6 Hrs) 6. C== Comments. Default Constructor. Basic concept of OOP. The new and delete Operators. Multilevel inheritance. function definition. Operator return value. Object. C++ Features: The iostream class. C++ Keywords. limitations of increment operator. constructor. Constructor with argument. calling the function. conversion between Basic type. containership. constructors in multiple inheritance. J/O with multiple objects. comparison operator. conversion between objects of different classes. Exception Handling. (1 Hrs) 3. arithmetic assignment operator. public and private inheritance. using this for returning values. returning objects from functions. Character J/O. reading strings. Different Kinds of arguments. arithmetic operators. Objects as function arguments. public. inline function. (5 Hrs) . Polymorphism. Template arguments. Templates and Exception Handling: Introduction. (2 Hrs) 2. private. Classes. Access Specifiers. Member functions. Virtual Functions: Normal member function accessed with pointers. return by reference. pass by value. Friend function. Nameless temporary objects. class conversion manipulating private Data members.
(7 Hrs) 2. Set Theory: Sets and Subsets. Ralph. Discrete and Combinatorial Mathematics. the Binomial Theorem. . (Chapter 1 to 5). 3. the Pigeonhole Principle. 4/e Pearson Education 2. Lippman: C++ Primer. McGraw Hill. Strousstrup: The C++ Programming Language. Pearson Education BCA 303 Discrete Mathematical Structures Total: 50 Hrs 1. 2004. Pearson Educations. the fundamental theorem of Arithmetic. 6th Indian Reprint. Analysis of Algorithms. P. 3. Galgotia Publications References: 1. References: 1. Plain and One-One functions. use of quantifiers. Pearson Edition. set operations and the laws of set theory. Logical equivalence. computational complexity. (7 Hrs) 4. C++ Primer Plus. Relations and Functions: Cartesian Products and relations. 3/e Pearson Education 2. the GCD. Discrete Mathematics. Pearson Education 5. Onto functions. Functions. Busby and ross.Text Books: 1. Bhave: Object Oriented Programming Using C++. Permutations. Recursive definitions. Euclid’s Algorithm. prime numbers. Rajendra Akerkar and Rupali Akerkar. Balagurauswamy: Object Oriented Programming with C++ Tata. (15 Hrs) 3. Kolman. Mathematical induction. stirling numbers of the second kind. Lafore Robert: Object Oriented Programming in Turbo C++. Fundamental Principles of Counting: The rules of sum and product. C. spectial functions. counting and venn diagrams. Pearson Education (LPE) Fourth Edition. 3rd Edition 4. 1985. Discrete Mathemaitcal. probability. Combinations with repetitions. lofical implication. 2. Liu Elements of Discrete Mathematics. McGraw Hill Publications. Discrete Mathematics. 2. quantifiers. the division algorithm. functions composition and inverse functions. Properties of Integers and Mathematical Induction: The well – ordering principle. Grimaldi. Fundamentals of Logic: Basic connectives and truth Tables. definitions and proofs of theorems. 5/e Pearson Education 2003. (10 Hrs) 5. rules of inference. (11 Hrs) Text Books: 1.L. E. combinations. the laws of logic. Pearson Education (LPE) 2003. Kamthane: Object Oriented Programming with ANSI and Turbo C++ . Richard Johnsonbaugh. An applied introduction. Prata. 2004. 5th Edition.
If – Then. OOP methods and properties of an object class modules. Deitel. Select Case-different forms. (5 Hrs) The Form Object: Properties. Schaum’s Series – Tata McGraw Hill. width. frames. image controls. Reselman. Peasley and Pruchniak. Static and dynamic array. Main () procedure. Borderstyle.Creating menus and toolbars. events and methods of forms. methods-Show. unload. Dynamic Link Libraries (DLLs) and Windows API. Pearson Education References: 1. variables. tool bar. window state. print. menus and toolbars. hide. Database connectivity-DAO and ADO Tables and Queries. (15 Hrs) Predefined Dialog Boxes – MsgBox and InputBox. Working with the menu editor Designing Multiple Document interface forms. Click. from layout window. ActiveX Data Objects. Deactivate. The VB editor. BPB Publications (2001). Arraysdeclaration. Vikas Publishing House (2003) 4. arithmentic operations. private and public procedures. for-next. Tata McGraw Hill (1999). Backcolor. Resize. Branching and Looping Statements. Properties-Name. Mathematical and string Functions. Visual Basic 6 How to program. height. V. timer. properties window. Microsoft common controls. left. Events – load. Study of form and code modules. scalemode. Encapsulation and Inheritance characteristics. Designing Help files. 2. project explorer. horizontal and vertical scroll bars. startup position. top. Neol Jerke. 5. moveable. PHI (2000). Array() Function. Programming In VB: Data types. Subs and Functions. labels. Programming with visual Basic. Using Visual Basic 6. check boxes. lists and combo boxes.BCA 304: VISUAL PROGRAMMING Total: 50 Hrs Introduction To VB: The intergrated Development Environment – menu bar. option buttons. unload. textboxes. Controls-Properties and events of different controls such as commond buttons. 1st Edition. maxbutton. from designer. If – Then – Else and Nested If Statements. Random access and Binary files. While-Wend and Do-Loops statements. controlbox. Evangelas and Petroutsos. K. Mastering VB 6. Gottfried. Introducation to OOP and VB. 3. . Jain. declaration and scope. cls. File handling – Sequential. Caption. (30 Hrs) Text Books: 1. minbutton. Activate. The Complete Reference Visual Basic 6.
New York. MCGraw Hill. Emotional. Personality: Theory. Kagan. Jerome (1969). Theories of Personality. Elizabeth. Anita et al (1992). Assessment and Research. Communication. The process of attitude formation. New York. Susan C. . New Jersey. Personality Development. Pervin Lawrence A. Rychamn. How to face personal interview and group discussion. Phenomenological theory (Care Rogers) Cognitive Theory (George A. 4. importance of personality development. (2000). Prentice Hall. Learning processes. Johnson. intellectual. Theories of Personality. A trait factor. Educational. Psychological theory (Sigmund Freud).BCA 305: PERSONALITY DEVELOPMENT AND COMMUNICATION SKILLS. New York. Communication: Handling Ideas Effectively. What is attitude. Prentice – Hall. Karin (1979) Communication Skills for Human Services. interpersonal and intrapersonal intergroup. the art of public speaking. Cattel). Process of listening body language or non verbal communication. Roy Ivan (1956). (1978). Profiles of great personalities. Kundu. Smith. Henry Clay (1968). Reston 3. New York 10. Hurlock. Richard M. 7. 6. Social. New York. Van Nostrand. MacGraw Hill. Career planning and role of career planning and role of career planning in personality development. 2. 8. Leadership as a process: Working in a team. C. Meaning and definition of Personality: Personality development as a process.Analytic approach (Raymond B. L. Personality Development. Prentice – Hall. Communication and its importance: Process of Communication. 5. Determinants of Personality: Physical. Process of perception cognition and their impact. Taylor. Cloniger. Sterling Bangalore. Written and oral communication. (1980). London. Kelly). 9. Personality Development. Familial. John Wiley and Sons. Harcourt Brace. Eriksen. D. (10 Hrs) 5. The self concept: Individual as a self sculptor. theories of Personality. B. (8 Hrs) 4. Personality Development. (?).(7 Hrs) 3. Management of conflict. (10 Hrs) References: 1. Psychosocial Development theory (Erickson) (15 Hrs) 2. Total: 50 Hrs 1. (1989).
he has to be psychologically healthy. To create awareness about physical intellectual. which can be developed through practice. 3. emotional. parents society and nation at large in facing the difficult challenges in the course of student life as well as post student life. Unless an individual looks at himself with an objective to assess what personality inputs he possess and what he needs to develop. . In the process of one’s personality development it is necessary for an individual to know the psychological processes that lead to personality development which are best explained by theories of personality. doing public speaking are skills that can considerably alter the landscape of one’s personality. Most of the time an individual is communicating either in written or oral form. citizen and so on. To provide an understanding of what is personality and what are the processes of developing one’s personality. He must have awareness of ethical values in life and he should be able to provide a framework for a just society. familial. Another most important dimension of personality is communication. The aspects of working in a team. brother. 2. processes of perception and cognition will enable an individual to understand inherent limitations of an individual and make him more open-minded. The philosophy of human resource development embraced by Government of India two Decades back intends to stimulate an all round holistic development of the individual is so as all to enable him to play his role effectively. neighbour. He must be socially as well as culturally healthy. collaborative processes managing intra personal. Similarly. submitting a paper. To provide skills of written and oral communication with a focus on skill development. which play an important role. Presentation skills such as conducting or giving a seminar. Objective on the course: 1. daughter. An individual if he has to contribute meaningfully to society. the process of developing one’s personality will not start. The communication process needs to be property understood and the individual must and should develop necessary skills. 4. Make the student aware of his or her role in different settings such as son. sister. social. building interpersonal relation leadership skills. educational aspects of personality. inter personal and group conflict are aspects. it is not enough that he is healthy physically.PERSONALITY DEVELOPMENT AND COMMUTATION SKILLS Preamble: The objective of every educational system is to prepare capable young men and women who can come up to the expectations of their teachers.
Field assignments will also be given to student to meet people in the field and assess their personality development experience. feelings and opinion. Write a program to find sum of complex number using friend function. Application to design a calculator using design scrollbar. using friend function. case method as well as role play. Write a program to perform addition of two matrices using operator overloading. The paper pattern will be as follows: 40 Marks for Theory 40 Marks for Applications There will be six questions each carrying 15 marks out of which candidates have to answer four. Eminent personalities should be invited to class room to present and interact with students. Write a program to implement area of geometrical figures. Write a program to find the maximum of two numbers using template 15. Scheme of Examinations: 20 internal marks will be given as below: Class participation 5 Marks Seminar 5 Marks Class Test 5 Marks Field Assignment 5 Marks s 20 Marks The final paper will be 80 Marks. Write a program to create electricity bill 5. Write a program to perform bank transaction 7. 16. Write a program to concatenate e two strings. Write a program to swap two numbers using friend function 3. Write a program to create a student report using inheritance technique. Eligibility Conditions for Teachers: Teachers with Masters degree in Psychology. student presentation. a case also be given for discussion wherever students are exposed to case method. Application to change the calculator using design array. 14. . Write a program to perform multiplication of two matrices using operator overloading. 12. 18. 11. Write a program to implement operation on queue. Sociology. 2. case discussion.7) which will have four short notes each carrying 5 marks. Write a program to find maximum of 2 Nos.2 (Based on BCA 304) Sample programs: 1. class room discussion. 17. Write a program to calculate area and circumference of circle using inline function 4. Write a program to sort elements using templates. font and style of a text string using combo boxes. Application to change the font size.1 (Based on BCA 302) Sample Programs: 1. 9. 19. 4. Teacher shall provide an open environment where students will freely discuss and debate on various experiences. BCA – 306: COMPUTER LAB 3. 10. Write a program to compare two string using equal to operator. 3. Write a program to implement operation on stack. Write a program to add two distance variable. Instead of this. Write a program to prepare a shopping lists 6. 13.Methodology of teaching: This course will be taught through lectures. Management. BCA -307: COMPUTER LAB 3. Write a program to implement digital clock 2. Social Work and English with a flair for Human Resource Development are eligible to teach. Write a program to add two time variable 20. There will be a compulsory question (no. 8. Videocassettes. Design an application to validate the user name and password and display appropriate message using message box control. films on the topic can shown.
Definition types. Program to convert a number to wording (up to 1000). Sanguthevar rajasekarn. Terms related to graph. Sum of Subsets. 13. Introduction: definition of algorithm. Application to play media file using active movie control or media player. Merger Sort. (10 Hrs) 4. Addison Usekey. Design 7 Analys of alogorithm-horowing. Optimal binary Search Trees. (10 Hrs) 5. sahni. 6. Multistage Graphs. Finding Maximum & Minimum. 2. Program to display the message “welcome to Visual Basic” in a label box. 17. BCA – FOURTH SEMESTER BCA 401: DESIGN AND ANALYSIS OF ALGORITHMS Total: 50 Hrs 1. References: 1. Job Sequencing with deadline. The traveling salesperson problem.5. Search & traversal techniques for graphs. Information Systems. Different Control Structures. 9. The label box should scroll form right to left. Application to design a screen saver (using timer). Design an application to demonstrate the encryption and decryption in VB 14. Code Optimization. Design an application to establish connection to data base (Using data control). Game trees. Program to display the message “welcome to Visual Basic” at the center of the Window with random fore color for the message and random back color for the form 16. The 8 – Queens Problem. General Method. Single . 2.. 6. 8. Dynamic Programming: Introduction to Graphs. Flow Shop Scheduling. Backtracking: General method. Fundamentals of Computer algorithm – Ellis horowing.Sour Shortest Paths. Knapsack Problem. Alter. (10 Hrs) 3. Sartaj Sahni. Greedy Method: General method. AND/OR Graphs. The design & analysisof Computer algorithms. 7. Graph Coloring. writing Structured Programs. Quick Sort. Application to design MDI form to child and design the menu. Binary Search. Program to display the message “welcome to Visual Basic” through out the Window with random fore color for the message. Selection Sort. 15. 20. minimumcost Spanning trees. Design an application to demonstrate sequential file assess in VB. Windows API: Program to display a form always on the top of other Windows. Application to play AVI file containing audio and video using MCI control. 0/1 – knapsack. Optimal merge patterns. aho. Alfred V. Characteristic of algorithm. 19. Hamiltonian Cycles. . Knapsack Problem. John. Analysis of algorithm (5 Hrs) 2.. Dixide and Conquer: General Method. Basic Traversal and Search Techniques: Search & traversal techniques for trees. (7 Hrs) Text Books: 1. Application to animation using animation control. All pair Shortest Paths. E-hopocraft & 3. 12. 11. 10. Strassen’s Matrix multiplication. Program to accept only numbers with fractional part using text box. Program to display a working anolog clock at the center the form 18. Application to move an image using a timer and command button controls.
The Systems Concept: Definition. The Process and Stage of System Design: The process Design. format of data bases algorithm. Sorting. Major Development Activities. Assembler. linear Search. hash or random entry searching. System Planning and the Initial Investigation: Introduction Bases for Planning in System Analysis. linking loaders. specification of Data structure. Input/output and Forms Design: Introduction. Machine Structure. Relocating Loaders. (1995) References: 1. Types of a System. Assemblers: General Design Procedure. Dynamic binders. Problem4: Code Generation . interchange sort. PHI (1198) 2. Analysis. The Role of the Systems Analyst: Historical Perspective. The Tools of Structured Analysis: Introduction. Business Data Systems. Design of absolute loader. Design of a Direct Linking loader Specification of problem. Data Structure. Searching a table. Tools of Structured Analysis. James A. Initial Investigation. Design and Implementation of Information Systems. Machine Language and Assembly Language: General Machine Structure. Features of macro facility. Compilers. Implementation. Direct linking loaders. System Performance Definition. Lucas. (10 Hrs) COMPILERS: Statement of problem. Clifton H. Background: Machine Structure.. The System Development Life Cycle: Introduction the System Development Life Cycle. Considerations for Candidate Systems.. The Multifaceted Role of the Analyst: The Analyst/User Interface. Henry C. A single pass algorithm. macro calls within macros. Characteristics of a System: Organization. Compile & go. look for modularity. address calculation sort. Assembly Language (8 Hrs) 3. Macros. Radix Exchange Sort. analysis and Design of Information System. Text Books: 1.BCA 402: system analysis and design Total: 50 Hrs Systems Concepts and the Information systems Environment: Introduction. Bucket Sort. Format of databases. Problem2: Recognizing Syntactic cutis and interpreting meaning. Implementation within an assembles. algorithm.. Design Methodologies.D. Macro Expansion. Problem3: Storage allocation. Tools of Structured Analysis Feasibility Study: Introduction. (3 Hrs) 2. Elements of a System: Inputs and Outputs. Problem1: Recognizing basic Elements.. Statement of Problem.. Elias M. macro instructions defining macros. Interaction. Design of assembler. Overlays. (1996) BCA 403: System Programming Total: 50 Hrs 1. implementation of a restricted facility. Awad. (10 Hrs) MACRO LANGUAGE AND THE MACRO PROCESSOR: Macroinstruction. formal Systems. Golgotia. Integration. Machine Language. Sen Analysis and Design of Information Systems – McGraw Hill Int. Central Objective. Table Processing: Searching and Sorting. A two pass algorithm. Information Gathering: Introduction. Interdependence. implementation of macro calls within macros. PHI (1996) 4. (10 Hrs) LOADERS: Loader schemes. System Implementation: System Testing and Quality Assurance. binary Search. Loaders. General loading Scheme. comparison of sorts. comparison of sorts. Evolution of the Components of Programming System. Input Design. other loading schemes-Binders.Ed. System Analysis and Design. Subroutine Languages. PHI (1999) 3. absolute loaders. Shell Sort. Statement of Problem. Raja Raman V. The problem.
Key factors in Communication Network Reference Model. Polynomial codes. Go-back-N Selective Repeat. Polling. Statistical Multiplexing. Telephone Networks and Circuit Switching. comparison of Random access and Scheduling access control’ Comparison of Random access and Scheduling medium access controls. Channelization-FDMA. (16 Hrs) 3. Scheduling approaches to medium assess control-Reservation Systems. Peer-to-Peer Protocols: Peer-to-peer Protocols and Service models ARQ Protocols stop and wait. Satellite Cellular Networks. Two-dimensional parity checks. Internet Checksum. The Shannon Channel Capacity. Other adaptation function. Error detecting capability of a polynomial code. Time-Division SONET. Line coding. Wavelength Division Multiplexing. PPP. CDMA. CSMA/CD. Dhambhere: System Programming and Operating System TMH 2. Coaxial Cable. Random Access protocols ALOHA. (3 Hrs) Text Books: 1. Multiplexing-frequency-Division. Beck: System Software. 2. Brief introduction to 7 Phases of Compilers. 3/e Pearson Education References: 1. Assembly Phase. Local Area Networks and Medium Access Control Protocols: Multiple access communications. Slotted ALOHA. properties of media and digital transmission Systems-Twisted Pair. Pearson Education BCA 404: DATA COMMUNICATION Total: 50 Hrs 1. Telephone network. Token passing rings. Packet and Circuit Switching. TDMA. Characterization of Communication Channels Frequency Domain and Time Domain. Fundamental limits in Digital Communication – The Nyquist Signaling rate. Circuit switches. Telegraph Networks and Message switching. Laudon and Laudon. Modems & digital Modulation.Optimization (Machine independent) Optimization (machine Dependent). HDLC. John J. Digital Transmission and Transmission Systems: Digital Representation of Information: Properties of Digital Transmission. CSMA. Data Link Control. Introduction: Communication Network and Services: Approaches to Network Design-Network Functions and Network Topology. Optical Fibre. TCP/IP Model Telnet FTP and IP Utilities. MAC Sublayer. (6 Hrs) 2. The Internet and Packet Switching. standardized Polynomial codes. (10 Hrs) 4. Signaling Traffic and Overload Control in Telephone Networks. System Programming. Message. Donowon. Radio Transmission Infrared Light. Management Information Systems. Sliding window flow control. Logical link control layer. Transmission efficiency of ARQ Protocols. General Model of Complier (6 Hrs) PHASE OF COMPILERS: Simple Structure of Compiler. . 8/e. Error detection and correction-Error detection. Timing Recovery in Synchronous Services Reliable Stream Service. Local Area Network – LAN Structure. TATA McGraw-Hil.
7/e. Mixed-media Bridges. memory interfacing. Restart as Software instructions. BCD addition and subtraction. (5 Hrs) 2. 8259 PIC. Datagrams and Virtual Circuits. RS232 serial communication standards. Stacks and subroutinesconditional CALL and RETURN instruction. Computer Networks and Open Systems. Understanding Data Communications. A to D Converters and interfacing. S. 8255 PPI. Connectionless packet switching. Hierarchical routing. Packet Switching Networks: Network services and Internal Network Operation. basic interfacing concepts. (5 Hrs) 5. logic operations. Source Routing Bridges. Counting and Indexing. Mc.3 DAN Standard. 4. 6. Data Communication. Interfacing of Peripherals (I / Os) and Applications: Interfacing Keyboard (linear and matrix) and 7 segment display including multiplexes. (12 Hrs) 5. Computer Networks Second Edition. (15 hrs) . Interrupts: 8085 vectored interrupts. Pearson Education. (5 Hrs) 4.LAN Standards-Ethernet and IEEF. Memory Interface: Memory and I / O mapping interfacing concepts. DMA and 8257 DMA controller. 16 bit arithmetic operations. multiplication and division. Held.11 Standard. Morgan Kaufman. Behrouz Ferouzan. BCD to Binary and Binary code conversion. Distance vector routing. D to A converters. Halsa. BCA 405: MICROPROCESSORS Total: 50 Hrs 1. Microprocessor organization / architecture and its operation. Microprocessor based system. 5. Counters and Time delays. Addressing modes. structure of switch/Router. (20 Hrs) 3. Arithmetic. 8279 programmable keyboard/display interface. 802. Data transfer. Virtual-Circuit packet switching. Instruction format. Routing Table. 1999. FDDI.Graw Hill-2000. Link state routing. References: 1. 2000. (6 Hrs) Text Books: 1. Communication Networks-Fundamental Concepts and Key archetectures. Token Ring and IEEE 8025 LAN standard. instruction classification. LAN Bridges-Transparent Bridges. interfacing I/O devices. Serial communication using 8251. Wireless LAN’s and IEEE 802. 2003 2. Pearson Education. Stallings. Introduction to Data Communications and Networking TMH. timing diagrams. Architecture and Operation: Introduction to 8085. Advanced subroutine concepts. Generation of pulse waveforms. Alberto Leon-Garcia and Indra Widjaja. Compare and rotate operations. Packet Network Topology. writing assembly level programs-overview of instruction set. Additional I / O concepts and processes. Logic branch operations. Flooding. Pearson Education 2. An Engineering Approach to Computer Networks. 4/e. Overview of Routing and congestion in packet networksRouting algorithms classification. 3. Data and Computer Communications. Keshav. Programming techniquesLooping. Programming the 8085: Programming model. Larry and Peterson and Bruce S Davis. congestion control algorithms. Andrew S Tanenbaum Computer Network. shortest path routing algorithms.
4. 5. ii. 15. Write a Program to Sort N Numbers Using Quick Sort Technique. 13. Pair Shortest Path Algorithm).1-5: Ch 6. Write a Program for N-Queens Problem. Pentium Pro. MH. (The Output Should be in the form of Checker Board). b. 7. Douglas V. 4. 3. Write a Program to Find the Shortest Path from Each Vertex to all Other Vertices (Al. 3. Calculate the Feasible Solution with Profit.2 (Based on BCA 405) List of Experiments: 1. 14. Gaonkar – Microprocessor Architecture.4 4. 6. a. a.406 COMPUTER LAB 4. Hall-Microprocessors and digital systems. 9. 10.1. a. Ch 7. ‘N’ Decimal Number addition. 5. Processor. 3rd Edn. 2. Addition of HEX numbers until FF is encountered. Kenneth L. 3. a. 10. Write a Program to Sort N Numbers Using Merge Sort Technique. Two n-byte Number addition.3 . Implementation of Full Adder b.1-4. Largest and Smallest number in an Array 9. Ch 10.1 (Based of BCA 401) Sample Programms: 1. Addition and Substraction of two 8-bit HEX numbers. 14.1-5. 1 . 7. 7.1-3. 80386. Short – Microprocessor and Programmed Logic”. Aditya P. 2. 2. Block Transfer in reverse order. 6. Pearson Education. b. 80286. Exchange of Blocks in reverse order . b.21-25: CH 5. System Analysis and Design BCA . Write a Program to Find the Minimum Spanning Tree for the Given Graph Using Prim’s Algorithm. b. PHI. 15. Write a Program to Find the Optimal Merge Pattern for the Given Files. Write a Program to Find the Feasible Solution for Job Sequencing with Deadlines. Write a Program to Illustrate the Knapsack Problem for N Objects with M Weights.1-8 Memory Interface: Ch 3. Write a Program to Find the Minimum and Maximum Number in a Set of N Numbers Using Divide and Conquer Method. Block Transfer. Brey B Brey. Write a Program to Find the Minimum Spanning Tree for the Given Graph Using Kruskal’s Algorithm. The Intel Microprocessor 8086/8088. a. Penram Int. Addition of two 16-bit numbers. 2nd Edn. 6. TMH Coverage in the Tex Book: Architecture and Operatio: Ch-1. 11. Write a Program for Optimal Binary Search Tree. i. 80186/80188. Ch 15-15. 2’s Complement of 8 & 16 bit number. Ch3-3. 4-Digit BCD Addition.1.1-6. Substraction of 16-bit number b. 8.12. 6. R. a.2.1 Programming the 8085: Ch3. b. Programming and Application with 8085. 6th Edition. 80486 Pentium.4-6: Ch 16. Write a Program to Multistage Graph. 12. BCA 407: COMPUTER LAB 4. 5. 9. Ch 8. Antonakos: Introduction to Intel family of Microprocessors Pearson Education Hoffer: Modern Systems Analysis and Design Pearson Education Kendall. Write a Program to Sort N Numbers Using Selection Sort. Write a Program to Find the Shortest Path from the Specified Vertex to all other Vertices (Single Source Shortest Path Algorithm).S. Using Backward Approach. 3rd Edn.3. a.4 Interfacing of peripherals (I/os) and Applications: Ch 14-14.1-5. 1-3. Ch 4. Using Forward Approach. Ch 9. References: 1. a. Exchange of two 16-bit numbers. Mathur – Introduction to Microprocessors. Block Exchange 8.Text Book: 1. Interrupts: Ch 12 .1-4. Ch2-2. 2. 3. Substraction of two 16-bit numbers. 8. Also Calculate the Weighted External Path Length. 5.
Division of 2 digit BCD 13.Conversion of HEX to ASCII. d. Addition and Substraction of signed Numbers. Program to Barcode indicator. Academic year 2007-2008) Sem No. Conversion of ASCI to Hex. b. Multiplication by successive addition ii. Check 2 out of 5 11. a. BCA501 BCA502 BCA503 BCA504 BCA505 BCA506 BCA507 VI BCA601 BCA602 Title of Paper Operating Systems Internet Programming Data Base Management Systems Software Engineering Operations Research Computer Lab 5. Program to generate Rectangular wave. Division of 16-bit by 8-bit HEX. Display 8-bit HEX counter. h. 22. Sum and Average of n-one byte numbers i. Multiplication of 16-bit by 8-bit HEX. Conversion of Centigrade to Fahrenheit. a. Program for staircase wave. 12.1 (Based o BCA 502) Computer Lab 5. a. 20. 19. Program to generate Square wave. Multiplication by shift and add method b. b. Conversion of Packed BCD to HEX. Converging and Diverging Techniques. Conversion of HEX to packed BCD.To Calculate y=Xn f. Frequency of occurance of element. Evaluate expression (A+B)*(C+D) g. Display Real time clock. Interfacing Experiments 17. 14. Factorial of a given number.f. a. Multiplication of 2 digit BCD b. j.2 (Based on BCA 503) Computer Graphics E-Commerce and Wed Hrs/Wk 4 4 4 4 4 6 6 4 4 Marks Max Min 80 32 80 32 80 32 80 80 80 80 80 80 32 32 32 32 32 32 IA 20 20 20 20 20 20 20 20 20 Total Marks Max Min 100 40 100 40 100 40 100 100 100 100 100 100 40 40 40 40 40 40 . V Paper No. a. 21. c.b. Program for sine wave. b. Counting of +ve. i. Inserting a given element. Square root of a given number. 15. e. BCA. -Ve and Zeros b. Sorting of array in ascending order 10. a. a. Display 8-bit BCD counter 18. c.e. a. Addition of 2’s Complement Numbers. b. b. Division by successive substraction. ON and OFF LED’s. a. 16. d. Flafsh and Scroll ‘GOODLUCK’. a.FIFTH SEMESTER AND SIXTH SEMESTER (w. b. b.
CPU Scheduling Criteria. Paging. Combined approach to deadlock handling. Multiple Processor Scheduling. Virtual memory – Demand . Contiguous allocation.BCA603 BCA604 BCA605 BCA606 (A) BCA606 (B) Designing Introduction to UNIX Object Oriented System Design Computer Networks Project Work Project Report: Viva-Voce 4 4 4 12 ----- 80 80 80 200 100 32 32 32 80 --- 20 20 20 ----- 100 100 100 200 100 40 40 40 120 BCA. Dead lock prevention. Process Scheduling. Algorithm evolution. Recovery from dead lock. Segmentation with paging in Mastics and Intel 386. Distribute and real time Systems. Characterization.FIFTH SEMESTER BCA 501: OPERATING SYSTERMS Total: 50 Hrs 1) Introduction: Batch Systems. Components and Services. Critical regions. Classical problems of synchronization. Virtual machines (6 Hrs) 2) Process Management: Process Concept. Real time Scheduling. Dead locks – System model. Inter process communication. Synchronization hardware. Swapping. monitors. System calls. Parallel. Scheduling algorithm. (10 Hrs) 4) Memory Management: Logical and Physical address space. Semaphores. (8 Hrs) 3) Process Synchronization and Deadlocks: The Critical Section Problem. operating System Structures. Co-Operating process. Concepts of Multiprogramming and Time Sharing. System programs. Threads. avoidance and detection. Segmentation.
Relational Operators. An Application with Two Classes Java Program Structure. Secondary Storage Structure): File Concepts. Arithmetic Operators. Linux-The complete reference. Operating System Concepts and design. thrashing. 6. Access methods. (8 Hrs) 6) Disk Management (Structure. 4. Operators and Expressions. 20. 23) 2. Java and World Wide Web.9). 3.3. File system structure. One time password.8. 3. BCA 502: INTERNET PROGRAMMING Total: 50 Hrs 1.6). Java and Internet. System threads. Stalling. Pearson Education. (4 Hrs) 7) Protection and Security: Goals of protection. page size and other considerations. Variables and Data Types. How Java Differs from C and C++. Command /line Arguments.8. Java Tokens. Free space management.4. Declaration of Variables. Introduction. Overview of JAVA Language: Introduction. Disk Scheduling Methods): Disk Structure and Scheduling methods. allocation methods. More of Java. Allocation of frames. 7. Fifth Edition. Milan Milonkovic. Directory Structure. Security Problem. 1992. Nutt: Operating Systems. Page replacement algorithms. Pearson Education.8. Demand Segmentation (10 Hrs) 5) File Management (Systems. Addision-wesley 19989(Chapter 1.4. 5. (4 Hrs) Test Books: 1.1. Efficiency and Performance. Domain Protection. Standard Default Values.10. Operating System Concepts. Recovery. Programming Style. Operation System Concepts. Authentication. II nd Edition. Operating Systems. Hardware and Software requirements. Java Virtual Machine. 3. Symbolic Constants. Java Statements. Implementing a Java Program.11.6. Simple Java Program. 6 (Except 6. Swap-Space management. Nutt. Introduction of JAVA: JAVA Evolution: Java History. Introduction: Internet origin and development-internet architecture frame work-world Wide Web. Java Environment. 20 (Except 20. Logical Operators. 3.2. Directory Implementation. 22. Assignment Operators. 3. Scope of variables. 3/e Pearson Education 2004 References: 1. Special Operators. Operating Systems. Abraham Silberschatz and peter Baer Galvin.13. Getting Values of Variables.3. Constants. 2. Access matrix. McGraw Hill Richard Peterson.9.9). Type Casting. program threats. Web Browsers.paging and its performance. Protection and Consistency Semantics. Tanenbaum. Java Features. (Except 13. Pearson Education. Java Support Systems. 2. Giving Values of Variables. Arithmetic . Disk management. 5.6) 19 (Except 19.
Evaluation Of Expressions. (1996). Methods Overloading. (1998). KenArnold and James Gosling. Applet Programming: Managing Errors and Exception: Introduction. Strings. Database System Concepts and Architecture: Data Models. Thread Priority. ER Model Concepts. Applet Tag. (1999). More About HTML Tags. Exceptions. Entity sets. Creating an Array. Constructors. Lines and rectangles. Characteristics of the Database Approach. Strings and Vectors: Arrays. Strings and Vectors: Classes. Wrapper Classes. Decision Making and Branching: Introduction. Line Graphs. Nesting of if …. (Second Edition). More about Applet Tag. Accessing Class Members. Two-dimensional Arrays. The Switch Statement. One-dimensional Arrays.. The Graphics Class. Schemas. Using Finally Statement. Drawing Polygons. Using Exceptions for Debugging. Advantages of Using DBMS. When not to use a DBMS. CGI Programming on the World Wide. The do Statement. TMH (1999). Adding Applet to HTML File. Concepts of Streams. Defining Interfaces.Expressions. 2nd Edition. circles. Relationship types of degree higher than two. Nesting of Methods. The if …. Attributes. and Multithreaded Programming: Interfaces: Multiple Inheritance: Introduction. Shishir Gundavaram. Classes. Arrays. Notation for ER Diagrams. 4. Types of Errors. (12 Hrs) 3. Using Thread Methods. Graphics Programming. Packages: Putting Classes together: Introduction. Accessing a Package. 3. Other Useful I/O Classes.(8 Hrs) Test Books: 1. (8 Hrs) 4. Programming with JAVA. Patrick Naughton & Herbert Schildt. Interfaces. Packages. (5 Hrs) 2. (Chapter 1-7) 2. Stopping and Blocking a Thread. Defining a Class. Introduction: Database and Database Users. Final Variables and Methods. Precedence of Arithmetic Operators. Managing Exceptions. Passing Parameters to Applets. The else if adder. Simple if Statement. Using CGI. E. Addison--Wesley. (12 Hrs) 6. Synchronization. Ojects and Methods: Introduction. and Ellipses. Extending the Thread Class. Using a Package.. Mathematical Functions. Syntax of Exception Handling Code. Applet Programming: Introduction. (Chapter 2-16) References: 1. Byte Stream Classes. and Instances. Static Members.. Using Control Loops in Applets. Inheritance: Extending a Class Overriding Methods. Implications of Database Approach. Jefry Dwight et al. The Java Programming Language. (4 Hrs) 3. The Database system Enviournment. Naming Conventions. Thomas Boutel. and Keys. Creating Objects. Implementing the ‘Runnable’ Interface. Using Streams. Darrel Ince & Adam Freeman. Throwing Our Own Exceptions. Interactive Input and Output. Displaying Numerical Values. Finalizer Methods. (1997).(1998) 5. Reading/Writing Characters. Different People Behind DBMS. Input/Output Exceptions. Drawing Arcs. How Applet Life Cycle. else Statements. (5 Hrs) . Hiding Classes. Managing Input/Output Files in JAVA: Introduction. Balagutuswamy. DBMS Architecture and Data Independence. Concatenating and Buffering Files. Adding a Class to a Package. Multiple Catch Statements. TMH. Programming the Internet with Java. Adding Variables. (10 Hrs) 5. Reading/Writing Bytes. running the Applet. A Primer. Input/Output: Graphics Programming: Introduction.. O’Reilly and Associates. Multithreaded Programming: Introduction. Extending Interfaces. Creating Packages. Creation of Files. Vectors. Implementing Interfaces. Arrays. Visibility Control. CGI programming in C and Perl. Prentice Hall. Adding Methods. Aligning the Display. Stream Classes. Data Modeling Using the Entity-Relationship Model: High level Conceptual Data Models for Database Design with an example. Proper naming of schema Constructs.. Character Stream Classes. Database languages and interface.. Creating Threads. Other Stream Classes. Drawing Bar Charts. The for Statement. Assessing Interface Variables. Handling Primitive Data Types. Designing a Web Page. Type conversion and Associativity. else Statement. JAVA 2: The Complete Reference. Addison--Wesley. Using System Packagers.. Thread Exceptions. Java API Packages. Classification of Database Management Systems... 3rd Edition. Creating an Executable applet. 2. Abstract Methods and Classes. India. Getting Input form the Usr. Jumps in Loops Labeled Loops. BCA 503: DATABASE MANAGEMENT SYSTEMS Total: 50Hrs 1. (1996). Using the File Class. Entity types. Life Cycle of a thread. Addison-Wesley. Decision Making with if Statements.
(5 Hrs) 8. Record Storage and Primary File Organization: Secondary Storage Devices. Overview of risk management. Concurrency Control.. Database System Concepts. Examples of Queries in the Relational Algebra. F. Relational Database design Using ER-to-Relational Mapping. 1995. Pearson Education.. Process models: Waterfall modal. Embedded SQL.graw hill. Using locks for Concurrency Control in Indexes. Transaction Processing Concepts: Introduction. Update Operations on Relations. Other Primary File Organization. Locking Techniques for Concurrency Control. Additional Relational Operations.. C. Desirable properties of transaction. Delete and Update Statements in SQL. References: 1. Introduction to Database Management System. Mc. Elmasri and Navathe. Oracle Press” ORACLE-Computer reference 5. Database Management Systems. Raghu Ram Krishan. Serializability of Schedules. Pearson Education 2004. Sudarshan.. Sixth Edition. Mc. Byoce-Codd Normal Forms. Function. Transaction Support in SQL. Placing file Records on Disk. S. (7 Hrs) Test Book: 1. (6 Hrs) 5. Views in SQL. Kahate. (4 Hrs) . Concurrency Control based on time stamp ordering. Defining Relations.. Ullman. Bohemia’s Spiral model. Functional Dependencies and Normalization for Relations Databases: Informal Design Guidelines for Relational Schemas.4. Professional responsibility. (6 Hrs) 7. Specifying indexes. 2000. Queries in SAL. 2. Fundamentals of Database Systems (Fourth Edition). Optimistic Concurrency control techniques. (4 Hrs) 6. Jefry. Files of Ordered Records (Sorted files). File of Unordered Records (Heap files). Specifying General Constraints as Assertions. Sundrraman.J. Schedules and Recoverability. Procedures and packages. Henry. Evolutionary Development. Relational Model Constraints and Relational Database Schema.. Second Edition. Hashing Techniques. Introduction to database systems. Introduction: Software Products and Software process. D. addisonwesley. Graw Hill. Relational Data Model and Relational Algebra: Relations Model Concepts. Relational Database Language: Data Definition in SQL. (8 Hrs) 9. 3. Korth. Buffering of Blocks. General Definitions of Second and Third Normal Forms.. Process Visibility. Oracle 9i programming A Primer. Insert. 4. Date. Database Triggers. Silberschatag. Transaction and System Concepts. Functional Dependencies. 1/e Pearson Education. Operations on Files. Basic Relational Algebra Operations. 6. Exceptions and Cursor Management. Principles of database system. 2003 2. Normal Forms Based on Primary Keys. Abrahamsi. PL/SQL: Introduction. BCA 504: SOFTWARE ENGINEERING Total: 50 Hrs 1.
The Software requirement document. 2001 References: 1. A. Theory of simplex method. Introduction to Operations Research. Duality theory and Sensitivity Analysis. Algorithm and flow chart for CPM and PERT. Requirement definition. Software Design: Design Process. Game without saddle points. (8 Hrs) III. TahaOperations Research. Theory of Games: Two-person Zero-sum Games.(6 Hrs) Text Books: 1. System architecture modeling Human Factors. North West corner rule. Data flow design. Software Verification and Validation: The testing Process. System Engineering Process. Quality management. Sultan Chand and Sons. Sultan Chand and Sons. Reference: 1. Mathematically based verification. Statistical testing. Collin Mac Millan 1982. social 7 organizational factors. 3. (8 Hrs) 4. Holden Day Inc. 2. New Delhi – 110 002 4. Gupta and Man Mohan Operations Research. User System Interaction. Validation of Evolution of requirements. Software Reliability and Reusability: Software Reliability metrics. Himalyal Publishing House. Vogal approximation method. Software development for reuse. Panakaj Jalote. Data flow. Use of artificial variables and their solution. System Structuring. (4 Hrs) Text Book: 1. (8 Hrs) 10. Requirements and Specification: The requirement Engineering Process. BCA 505: OPERATIONS RESEARCH Total: 50 Hrs I. Rules for drawing Network diagram. Information Presentation. A Comparison of design Strategies. Domain Specific architecture.1 (Based on BCA 502) Sample Programs: 1. 3. Structural. Narag. Pearson Education. (3 Hrs) 8. Black Box. Requirement Specification. Frederick S. Non functional requirement. (2 Hrs) 5. 6th Edition. Semantic. user interface prototyping. Reliability Growth modeling.Engineering. Clean room Software development. Linear Programming Problems: Origin and development of operations research. (20 Hrs) II. Linear programming method their solutions.. Control models. Static analysis tools.K. Linear Programming and Decision Making. Matrix minima method. Linear Programming Problem-formulation of linear Programming problem. Kani Swarup. An object oriented design example. Gillett. J. Time calculation in Networks. for balanced Transportation Problem only. Software Prototyping: Prototyping in software process. Roger Pressman. Application System Portability. 7/e. Test Planning and Strategies. New Delhi-110 002. Billey E. 2. Deibermann. Carlo Ghejgietal. Computer based System Engineering: System and their environment. Software cost estimation. Models. Pearson Education. 1974. Software Engineering – A practitioner’s approach (Mc Grew Hill). Software reliability Specification. Software Development with reuse. Delhi 1979. 4793/23. Viewpoint-oriented and method based analysis. Initial Basic Feasible Solution. Design Quality. (8 Hrs) 9. Pearson Publication Lid. Detailed Design. System Procurement. Graphical solution. Management Issues: Project management. Transportation Problem: Mathematical formulation of transportation problem. Ian Sommerville. (5 Hrs) 7. 2. Assignment algorithm and simple illustrations. Object Classes and inheritance Object identification. Optimization in Operations Reaearch. Software Engineering. Saddle point and value of the Fame. Gaxald. Exception handling and defensive programming. 3. Concurrent Objects. Assignment Problem: Mathematical formulation of an Assignment problem. Fault avoidance and tolerance.S. Program Inspections. Interface Testing. Fundamentals of Software. Prototyping techniques. Hiller. Network Analysis: Basic components of Net Work. 4793/23. (3 Hrs) 3. User Guidance. Object. mixed strategies. Taha: Operations Research. Graphical method Dominance property. Operations Research. Darya Ganj. System contexts. Hamady A. Generator based reuse. Modular decomposition. (8 Hrs) IV. Rardin. . Write a program to find factorial of list of number reading input as command line argument. (5 Hrs) 6. Software maintenance. Interface Evaluation. System reliability Engineering. solution for 2 x 2 games. BCA-506: COMPUTER LAB 5. Structural Decomposition. Design Strategies. Object Oriented and Function Oriented Design: Objects. User Interface Design: Design Principles. Critical Path Methods and Project Evaluation and Review Techniques. An Integrated Approach to Software Engineering – Narosa Publishing house. Darya Ganj. (8 Hrs) V. the maximin and Minimax principle.2. P.
3. Write a program to sort list of elements in ascending and descending order and show the exception handling. Write a program to implement all bitwise operations read the input form user and display input. Write a program to implement all string operations. Write a program to implement keyboard events. Write a program to find prime series reading N as command line argument. Write a program to implement Thread priorities. Write a program to find area of geometrical figures using method. BCA – 507: COMPUTER LAB 5. 14. 13. 8. 12. 7.2. output errors. Write a program to calculate bonus for different departments using method overriding. 11. 4. read the input using text boxes and display the o/p using buttons. 9. Write a program to implement thread. Write a program to implement an applet by passing parameter to HTML. 15. applets and graphics by implementing animation of ball moving. Write a program to implement constructor overloading by passing different number of parameter of different types. Write a program to implement mouse events. 5. Write a program to create student report using applet.2 (Based On BCA 503) Sample Programs: . 6. Write a program to implement Rhombus pattern reading the limit form user. 10.
Demonstrate how the delete item# 10 from the Item table and make that field null in the ORDER_ITEM table. Update the damage amount for the car with a specific Regno in the accident with report number 12 to 25000. country: string) CATALOG (book – id: int. date: date. The following tables are maintained by a book dealer. Regno: string) PARTICIPTATED (driver – id #: string. vi. Book – ISNB. Give the details of the authors who have 2 or more books in the catalog and the price of the books is greater than the average price of the books in the catalog and the year of publication is after 2000. Create the above tables by properly specifying the primary keys and the foreign keys ii. Add a new accident to the database. iv. description: string) ORDER – DETAILS (order – no: int. year: int. book-title:string. Create the above tables by properly specifying the primary keys and the foreign keys. location: string) OWNS (driver-id #: string. book – id: int. List the order# for orders that were shipped from all the warehouses that the company has in a specific city. b. publisher: string. title: string. Demonstrate how you add a new text book to the database and make this book be adopted by some department. AVG_ORDER_AMT. Create suitable front end for querying and displaying the results. . country: string) PUBLISHER (publisher – id: int. Enter atleast five tuples for each relation. #oforders. category – id. v. Find the number of accidents in which cars belonging to a specific model were involved vi. badate: date) COURSE (course #: int. vi. dept: string) ENROLL (regno: string. Enter atleats five tuples for each relation. book-ISBN: int) TEXT (book – ISBN: int. Demonstrate how you a. List any department that has all its adopted books published by a specific publisher. 2. vii. Consider the Insurance database given below. PERSON (DRIVER – ID #: string. Enter atleast five tupels for each relation/ iii. report – number: int. major: string. iv. sem: int.1. vii. 4. price: int) CATEGORY (category – id: int. author: string) i. Create suitable front end for querying and displaying the results. name: string. Find the total number of people who owned cars that were involved in accidents in 2002. Consider the following relations for an order processing database application in a company. cname: string. Generation of suitable reports. Product a listing: CUSTNAME. year: int) ACCIDENT (report-number: int. author – id: int. sem: int. 3. Regno: string. publisher – id: int. i. Create suitable front end for querying and displaying the results. Generation of suitable reports. vii. name: string. Create suitable front end for querying and displaying the results. name: string. Produce a list of text books (include Course#. STUDENT (regno: string. ii. address: strong) CAR (Regno: string. where the middle column is the total average order amount for that customer iv. city: string. Generation of suitable reports. v. v. AUTHOR (author – id: int. Create the above tables by properly specifying the primary keys and the foreign keys. Demonstrate how you increase the price of books published by a specific publisher by 10%. ii. Consider the following database of students enrollment in courses and books adopted for each course. vi. vii. Create the above tables by properly specifying the primary keys and the foreign keys. city: string. name: string. marks: int) BOOK_ADOPTIO (course: int.: int. ii. model: string. damage amount: int) i. Find the author of the book which has maximum sales. v. Enter atleast five tuples for each relation iii. iii. iii. Generation of suitable reports. The primary keys are underlined and the data types are specified. iv. Book – title) in the alphabetical order for courses offered by the ‘CS’ department that use more than two books. course#: int. quantity: int) i.
Computer Graphics. James D Foley. McGraw Hill 2. customer – street: string. (6 Hrs) Text Books: 1. 3. polygon surfaces. Circle generating algorithms.S. composite transformation-translation. 4. Steven K Feiner. 1997. Create the above tables by properly specifying the primary keys and the foreign keys. Interactive Input Devices. Shading and Color Mode: User interface. Three Dimensional Concepts: Three-dimensional co-ordinate systems. iv. line pens. area filling. curved surfaces. Interactive Input Methods: Physical input devices: keyboards. scan line methods. Graphics Under C. vii. TMH. line color. touch panels. loan – number: int) i. Attributes of output primitives. Principles of Interactive Computer Graohics – Newman and Sproull. Version. assets: real) ACCOUNT (accno : int. A programming Approach. perspective and parallel projections. (8 Hrs) 8. References: 1. amount: real) BORROWER (customer – name: string. Roster methods for transformation. Shcan line algorithm. Addison Wesley. v. three-dimensional transformations. scaling and rotations. Dr. Consider the following database for a banking enterprise. trackball. branch – name: string. Find all the customers who have atleast two accounts at the main branch. Demonstrate how you delete all account tuples at every branch located in a specific city. Vemala. Syeda Noor Fathima. customer – city: string) LOAN (loan – number: int. Create suitable front end for querying and displaying the results. Scaling and Rotation. (6 Hrs) 7. translation. Donald Hearn and M. Output Primitives: Points and Lines. (4 Hrs) 2. (8 Hrs) 3. iii.Yeshwant Kanetkar. BRANCH (branch – name: string. DDA and Bresenham’s line algorithms. branch – city: string.5. Adries Van Dam. Windowing and Clipping: Windowing concepts clipping algorithms. H. graphics tablets. (8 Hrs) 4. Hidden Surface and Hidden Line Removal: Back-face removal. accno: int) CUSTOMER (customer – name: string. Enter atleast five tuples for each relation. Graphics Systems: Display Devices. Find all the customer who have an account at all the branches located in a specific city. Banking window to view port transformations. BCA – SIXTH SEMESTER BCA 601: COMPUTER GRAPHICS Total: 50 Hrs 1. Line Drawing Algorithms. McGH 3.Pauline Baker. Generation of suitable reports. branch – name: string. Ellipses. area clipping. Cooley: The Essence of Computer Graphics Pearson Education . Hard Copy Devices. line type. three-dimensional display techniques. mouse. Display Processors and Graphic software. line width. joysticks. Matrix representations and homogeneous co-ordinates. Venugopal K. vi. Computer Graphics – Steven Harrington. John F Hughes. ii. programming with Fortran with Fortran Pascal and C. (4 Hrs) 6. Pearson Education/PHI 2. depth buffer methods. (6 Hrs) 5. interactive picture construction techniques. octrees.R. Two Dimensional Transformations: Basic transformations. line clipping. BPB Publications. Computer Graphics C. balance: real) DEPOSITOR (customer – name: string.
Mercantile Models from the Consumer’s Perspective and form the Merchant’s Perspective. Asia . MIME. Electronic marketplace technology. Navigation Theory and practice. Master Card/Visa Secure Electronic Transaction: Introduction. Value-added Networks. Comparisons of security methods. Pearson Education. for Authentication.2. (1996) 2. Linkage: Text. (10 Hrs) 3.10. Digital Token-Based Electronic Payment Systems. (7 Hrs) 5. Secure Transport Protocols. Certificates. e-Commerce Catalogs or Directories. Ravi Kalakota. Web Commerce Technology Handbook.6. (10 Hrs) 2. Addison Wesley. Information Filtering. Frontiers of Electronic Commerce. The Electronic Commerce environment. Emma Minoli. Migration to open EDI.8. Web Commerce going Forward. Legal. Payments and Security: Electronic Payment systems: Types.11) 3.3. Consumer-Data Interface: Emerging Tools. Pearson Education. Secure Electronic Payment Protocol. Daniel Lynch and Leslie Lundquist. Introduction: Electronic Commerce Environment and opportunities: Background. Web Design: Web design. Electronic Publishing: EP and Wed – Based EP. Application – II: Advertising and Marketing: The New Age of Information – Based Marketing. Commerce Net advocacy. Information Search and Retrieval. A Model for Message Handling. Designing for others.7. MIME and Related facilities for EDI over the Internet. Concepts. The means of Distribution. Internet-Based EDI Intraorganizational Ecommerce. John Wiley. Electronic Data Interchange (EDI). Asia.BCA 602: E-COMMERCE & WEB DESIGNING 1. Designing Electronic Payment Systems. Internet and World Wide Web How to Program. Advertising on the Internet. Smart Cards and Electronic Payment Systems. E-Commerce. Laudon. Consumer Search and Resource Discovery: Search and Resource Discovery Paradigms. EDI Envelope for Message Transport. Applications – 1: Consumer-Oriented e-Commerce: Application. (15 Hrs) Text Books: 1. Business Requirements. Designing Electronic Payment Systems. Web design Process. Indexes. S/MIME: and MOSS. Digital Money: The New Era of Internet Commerce.9. Daniel Minoli. Buttons. 2. EDI and e-commerce. Working of e-mail. Search and design. EDI Software Implementation. e-commerce with Internet/WWW. Marketing Research. Mercantile Process Models. Tata McGraw Hill. (1998) (Chapter 1. (Chpater 1. Security and Privacy Issues. Approaches to safe ecommerce: Overview. Whinston. Standardization and EDI. Site types and architectures.11. Interorganizational Commerce and EDI: EDI. Charting the On-Line Marketing Process. Secure Transactions. Applications of EDI in business. (8 Hrs) 4.14) References: 1. Payment Processing e-mail and Secure e-mail Technologies: Introduction. Icons and Graphics. site maps. Security on Web Servers and Enterprise Networks.7.13. (1996). Deitel. Andrew B. Secure Electronic Transaction. Modes of electronic commerce: Overview. and navigational and use aids. Risk and Electronic Payment Systems.
Customizing vi. listing timestamps. Absolute Pathnames. Undoing Last Editing Instructions. Man: Browsing and Manual Pages On Line. File Systems and Inodes. Substitution – Search and Replace (:s). References: 1. Passwd: Changing your pass word. gunzip. System Processes (-eor-a). 2. bc: The Calculator. tail: Displaying the End of a File. Understanding the man Documentation. Navigation. Basic Regular Expressions (BRE) – An Introduction. Hard Links. cmp: Comparing Two Files. Modification and Access Times. 3/e Pearson Education 2. Is: Listing Directory a File. Pearson Education. comm. Internal and External Commands. Saving Text and Quitting-The ex Mode. File Permissions. Relative Pathnames. find: Locating Files. The – d Option: Listing Directory Attributies. who: Who are the Users?. talk: Online Communication. Compressing Files. and unzip commands. wc: Counting Lines. od: Displaying Data in Octal. Killing Processes with Signals. An Example: Displaying a Word – count List. The Art of UNIX Programming. Pearson Education. Communication In Unix: finger: Details of Users. more: Paging Output. The spell and ispell. The mail command. Pattern Matching – The Wid – cards.). paste: pasting Files.. 5. nice: Job Execution with Low Priority. Shell variables. The UNIX Architecture. sty: Displaying and setting Terminal Characteristics. rm: Deleting Files. cd: Changing the Current Directory. Salient features of UNIX system. Venkateshm. POSIX and the Single UNIX Specification. dis2unix: and unix2dos: Converting between DOS and UNIX. Raymond. Email Basics. gzip.urthy. The Ip Subsystem: Printing a File. diff: Converting One File to other.BCA 603: INTRODUCTION TO UNIX Total: 50 Hrs 1. fg and bg commands at and batch: Execute Later. Directory Permissions. Uniq: Locate Repeated and Non repeated Lines. tr: Translating Characters. Listing inode number. The File System and Some File Handling Commands: The File. printf: An alternative to echo. Job Control. Test Books: 1. time: Timing Processes. The vi Editor: vi Basic. chmod: Changing File Permission. Locating commands. redirection: The three Standard Files. cut: Slitting a File Vertically. 7. Words and Characters. File Attributes: is-I: Listing File Attributes. Searching for a Pattern (/ and ?). corn: Running Jods Periodicall. echo: Displaying a message. Dead: Displaying the Beginning of a File. The HOME Variable: The Home Directory. Escaping and quoting. Pipers. file: Knowing the File Types. Asia. Glass: Unix for Programmers and Users. listing hidden file. mesg: Your Willingness to communicate write: communication alternately.: What ic Common?. What’s in a (file) name? The Parent – Child Relationship. pwd: Checking your Current Directory. . date: Displaying and system Date. 4. Command Substitution. Input Mode-Entering and Replacing Text. Script: Recording your session. ps: Process Status. rmdir: Removing Directories. pr: Paginating Files. mkdir: Making Directories. /dev/null and /dev/tty: Two Special Files. Kernighan: The Unix Programming Environment 3. 3. Flexibility of Command Usage. Extended Regular Expressions (ERE) and egrep. umask: Default File and directory Permission. tty: Knowing your Terminal. tee: Creating a Tee. mv: Renaming Files. time associated with a file. Editing Text. Simple Filters and grep Family of Commands: The Sample Database. uname: Knowing your Machine’s Characteristics. The Shell: The Shell’s Interpretive Cycle. Symbolic Links and In. Cal: The Calendar. Background and some Basic Commands: Brief History. Kochan: Unix Shell Programming Pearson 4. (u and U) Repeating the Last Command (. Running Jobs in Background. news: knowledge the local events. Introduction to Unix and Shell Programming. 6. The Process: Process Dasic. sort: Ordering a file. Mechanism of Process Creation. changing File ownership. Internal and External Commands. File ownership. Grep: Searching for a Pattern. writing on all terminals. 8. wall. The Directory.
Model Management: packages and Model Organization. Approaches for Identifying Classes. The UML Class Diagram Notation. Designing Methods for the ViaNet Bank Objects. Expert Creator. Why Modeling. Developing Effective Documentation Case Study: ViaNet Bank ATM. Object Oriented Database Management Systems. Prentice-Hall India 1990 3. Role Playing and CRC cards. The Booch Methodology. Naming Classes. Object Store. Pearson Educations. an Introduction to Object-Oriented Analysis and Design. why and object Orientation?. and Methods: Introduction. An Object-Oriented Philosophy. Packages and managing Classes. Scheduling Development Architecture Layers. Objects. UML. Super-Sub Class Relationshipds. State(GoF) polymorphisom (GRASP) singleton (Gof) Command (Gof) Development process Issues: Introduction. pure Fabrication. 1999 2. Designing Attributes. Class Responsibility: Defining Attributes by analyzing Use Case and other UML Diagrams. Attributes. and Associations. Grady Booch: Unified modeling Language User Guide. Classes. The Software Development Process.37) References: 1. associations. Designing Classes: The Process. Prientice Hall. Controller. UML class Diagram.35. Overview of the Unified Approach. Case Study: A payroll program. Multidatabase Systems Designing Access Layer Classes Case Study. (12 Hrs) Test Books: 1. Gamma: Design patterns: Elements of Reusable Object Oriented Software. . Object-Relational Systems. Shalloway: Design Patterns Explained Pearson Education 6. Object Oriented Design Axioms. Interactive and Incremental Development. Object-Oriented Systems Development: A Use Case Driven Approach Reusability (6 Hrs) Methodology Modeling And Uml: Object Oriented Methodology: Introduction: Survey of Some of the Object-Oriented Methodologies.BCA 604: OBJECT ORIENTED SYSTEM DESIGN Total: 50Hrs Introduction: An overview of Object oriented Systems Development. Responsibilities. 4. Object Basics: Introduction. patterns. J: object oriented methods: a Foundation. Polymorphism. Criag Larman: Applying UML and Patterns. Defining Attributes of ViaNet Bank objects. access Layer-Object Storage and object Interoperability: Introduction. Aggregations and Object Containment. Methodologies. Object Analysis-Classification: Theory. extensibility UML Meta-Model (8 Hrs) Object Oriented Analysis: Object Oriented Analysis Process – Identifying Use Cases: Introduction. indirection. Object Responsibility: Methods and messages. McGraw hill. Rumbaugh et al’s. Use-Case Model. Distributed Databases and Client-Server Computing. (12 Hrs) Designing With Patterns: GRASPPatterns for assigning Responsibilities: Introduction. UML. Low Coupling High Cohension. Case Study. Booch: Object Oriented Analysis and Design Pearson Education 2. Why? Guiding Principles of a Successful Process. UML Object Constraint Language. Identifying Object Relationships. Case study. Pearson Education 5. Common Class Patterns Approach. Object Modeling Technique. (12 Hrs) Object Oriented Design: The Object-Oriented Design process ad Design Axioms: Introduction. Distributed Objects computing. A-part-of RelationshipsAggregations. J. extensibility. More Patterns and Designing with Patters: GRASP: general Responsibility Assignment software Patters. Designing Methods and Protocols. The Object-Oriented Design Philosophy. Attributes. 1995. Object-Oriented Systems Development life Cycle: Introduction. Class Hierarchy.34. Designing the Access Layer for the ViaNet Bank ATM. Pearson Education 1998 (Chapters 18. Microlevel Process. Rebecca Wirfs-Brock et al: Designing Object-Oriented software. Defining Methods for ViaNet Bank Objects. Organization and Access Control. Responsibilities and Methods. Business Object Analysis: Understanding the Business Layer. Prototyping the Use Interface. Use – Case Diagram. Class Visibility. Business Process Modeling. Development Cycle issues. Use – Case Driven Object – Oriented Analysis: the Unified Approach. Model Management: packages and Model Organization. Refining attributes for the ViaNet Bank Objects. Use Case Driven Development Cycles. and Persistence: Database Management systems. View Layer Classes by Analyzing Use Case. Designing Classes: Introduction. Don’t Talk to Strangers. Object Behavior and methods. Frameworks. Classes. Well-Designed Interaction Diagrams are Valuable. Introduction to the Unified Modeling Language. Responsibilities and Interaction Diagrams. Responsibilities and Collaborators. The Purpose of a View Layer Interface. The Unified Approach. Activities and Dependencies. The Jacboson et al. Unified Modeling Language: Introduction Static and Dynamic Models. Ali Bahrami: Object Oriented Systems Development. Design Patterns. advanced Topics. The Object Oriented Design Process. Encapsulation and Information Hiding. GRASP: patterns of General Principles in Assigning Responsibilities. Patterns. Martin. Object Relationships. Building High Quality software. UML Dynamic Modeling. polomorphism. Noun Phrase Approach. Use-Case Driven Approach Identifying Classes and Their Behaviours through Sequence / Collaboration Modeling. Corollaries. and Odell.
network architecture. Network structure. BCA 606: PROJECT WORK BCA 606 (A) Project Report BCA 606 (B) Viva-voce ***** Question Paper Pattern for all the Semesters: (except BCA 105. 4. packet switching. W. (8 Hrs) 6. Internet transport protocol (TCP and UDP). (4 Hrs) 2. ISDN signaling. (10 Hrs) 3. Hierarchial routing. Topologies. network standards. Transport protocols. Circuit switching.10 Marks. the digital PBX. ISDN system architecture.40 Marks (15 each) iii. example networks. (10 Hrs) 5. The Physical Layer: Transmission and Switching. Polling Multiplexing versus concentration. collision freeprotocols Limited Contension protocols. Introductions: computer networks and its applications. Stallings. Error detection and correction. (10 Hrs) 4. hybrid switching ISDN-integrated services digital networks. Data and Computer Communications. James Martin. protocol specification and verifications. TMH. 2. Local area networks: Architecture and implementation. The TCP/IP reference model.30 Marks (15 each) ii. Terminal handling. 3. Frequency and time division multiplexing. standard and interface. Writing two programs including algorithms / flow chart------------. The Transport Layer: Transport service. Kurose and Keith W Ross. protocol performance. Internetworking Network layer in the internet and ATM Networks. BCA 205 & BCA 305) 1. Routine algorithms: Optimality principle shortest path routing Flooding Flow based routing. Computer Networking A TOP DOWN Approach Featuring the Internet. Multicast Routing. Congestion control algorithms. Elementary data link protocols. 5. Evolution of ISDN. PHI 2. Ulyses Black. Pearson Education. The students have to answer any five questions. Carrier Sense multiple access protocols.BCA 605: COMPUTER NETWORKS Total: 50 Hrs 1. Theory: There shall be eight question in the question paper each carrying 16 marks. 2002 References: 1. The medium access sub layer: The local metropolitian area networks. Laboratory record/journal and Viva – voce ---------------------------. The OSI reference model. ISDN service. Pearson Education. Behrous Fruzan. sliding window protocols. Total: 80 Marks. Data Communications. ISDN interface. Computer Networks: Protocols. The data link Layer: Data link Layer design issues. The Network Layer: Network layer design issue. Computer Networks: Fourth Edition. Services. PHI. LAN VAN MAN. Anderw S Tenebaum. LAN protocols. Prakash Gupta. Data Communication and Networking. Execution of two programs ----------------------------------------------. James F. (8 Hrs) Text Books: 1. Pearson Pub. Practical: The Practical marks of 80 shall be distributed as follows i. ************** . Broadcast Routing. Perspective on ISDN. 2nd Edition. PHI. 6. the ALOHA protocols.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.