FACULTY OF ENGINEERING & TECHNOLOGY

SYLLABUS

FOR

BACHELOR OF COMPUTER APPLICATIONS
(Semester: I–VI)
Session: 2016-17

____________________________________________________________________________________

GURU NANAK DEV UNIVERSITY
AMRITSAR
____________________________________________________________________________________

Note: (i) Copy rights are reserved.
Nobody is allowed to print it in any form.
Defaulters will be prosecuted.
(ii) Subject to change in the syllabi at any time.
Please visit the University website time to time.

1
Bachelor of Computer Applications
SCHEME
SEMESTER – I:
Paper No.

Paper

M. Marks

Paper–I

Introduction to Programming C - I

75

Paper–II

Introduction to Computers and Information Technology

75

Paper–III

Mathematical Foundation of Computer Science

75

Paper–IV

Communication Skills in English – I

50

Paper–V

Punjabi / Basic Punjabi (Mudhli Punjabi) (Compulsory)

50

Paper–VI

Practical–I (MS Office 2010 and Basic C Programming)

75

SEMESTER – II:
Paper No.

Paper

M. Marks

Paper – I

Introduction to Programming C – II

75

Paper – II

Principles of Digital Electronics

75

Paper – III

Numerical Methods & Statistical Techniques

75

Paper – IV

Communication Skills in English – II (Th.35+Pr.15)

50

Paper – V

Punjabi/Basic Punjabi (Mudhli Punjabi) (Compulsory)

50

Paper – VI

Practical – I (Advanced C Programming)

75

2
Bachelor of Computer Applications
SEMESTER – III:
Paper No.

Paper

M. Marks

Paper–I

Computer Architecture

75

Paper–II

Database Management System & Oracle

75

Paper–III

C++ (OOP Language)

75

Paper–IV

* Environmental Studies – I (Compulsory)

50

Paper–V

Programming Lab – C++

50

Paper–VI

Programming Lab – Oracle

25

SEMESTER – IV:
Paper No.

Paper

Paper – I

Data Structure & File Processing

75

Paper – II

Information Systems

75

Paper – III

Internet Applications

75

Paper – IV

System Software

75

Paper – V

* Environmental Studies – II (Compulsory)

50

Paper – VI

Lab – Data Structures Implementation using C++

50

Paper – VII

Lab – Web Designing and use of Internet

50

* Marks of Paper EVS will not be included in Grand Total.

M. Marks

3
Bachelor of Computer Applications
SEMESTER – V:
Paper No.

Paper

M. Marks

Paper – I

Computer Networks

75

Paper – II

Web Technologies using ASP.NET

75

Paper – III

Operating System

75

Paper – IV

JAVA Programming Language

75

Paper – V

Lab based on JAVA Programming Language

50

Paper-VI

Lab based on ASP.NET

50

SEMESTER – VI:
Paper No.

Paper

M. Marks

Paper – I

Computer Graphics

75

Paper – II

Software Engineering

75

Paper – III

Lab. Implementation of Applications of Computer

50

Graphics in C++/C
Paper – IV

Project

200

Break – Continue statements. Eight questions are required to be set giving equal weightage to all the units. 3. Statements. Pseudo code and algorithms. 2. more about print functions. multi–dimensional arrays. Symbolic Constants. specifying argument data types. Do–while and For statements. Control Statements: Preliminaries. 2. Data types. Identifiers and Key Words. If–else. Assignment and Conditional Operators. The student can use only Non–programmable & Non–storage type Calculator. more about scan functions. Balaguruswamy: “Programming in ANSI C”. While. Relational Operators. defining. Expressions. Library functions. processing an arrays. function prototypes. . Kochar: “C Programming”. Nested loops. 4. UNIT–I Logic Development and Program Development Tools: Data Representation. Switch. References: 1. passing arrays to a function. Flowcharts. Arrays: Defining. gets and puts functions. Scaum Outline Series: “Programming in C”.4 Bachelor of Computer Applications (Semester – I) Paper–I: Introduction to Programming (C) – I Time: 3 Hours M. Operations and Expressions: Arithmetic operators. UNIT–III Functions: Brief overview. interactive programming. All questions carry equal marks. Variables. The candidates will have to attempt any five. UNIT–II Data Input and Output: single character Input. entering input data. Dennis & Ritchie: “Programming in C”. Problem Analysis. single character output. accessing functions. Constants. Decision Trees/Tables. passing arguments to function. Fundamentals: Character set. Stephen G. writing output data. recursion. Unary operators. Marks: 75 Note: 1. Logical Operators.

vision input systems. mouse. MS–Office _ 5. voice response units. paragraphs and sections. Finding and replacing text. opening. Sinha. Kalyani Pub. Gurvinder Singh & Rachpal Singh. UNIT-I Introduction to Computers and its Applications:  Computer as a system.  Batch oriented / on–line / real time applications. BPB Publications. . UNIT-II Interacting with the Computer: Input Devices: Keyboard. Introduction to Computers – 3. Windows Based Computer Courses P. touch screens. exporting and inserting files. indents and outdents. fonts and font size Editing. pens. Data Storage Devices and Media: Primary storage (Storage addresses and capacity. inserting audio and video Text/References: 1. functional units and their inter relation. creating. joystick. 2. Bar Code reader. saving. inserting page breaks. symbols and dates. importing. source data automation. footer and printing MS–Power Point: Presentation overview. Using tabs and tables. Marks: 75 Note: 1. All questions carry equal marks. book marks. Computer Fundamentals – 2. positioning and viewing texts.  Application of computers. Magnetic storage devices and Optical Storage Devices UNIT-III MS–Word: Overview. Introduction to Computers – 4. creating lists and numbering. Headings. opening and saving presentation. type of memory). Presentation creation. plotters. basic concepts.5 Bachelor of Computer Applications (Semester – I) Paper–II: Introduction to Computers and Information Technology Time: 3 Hours M. OMR. header.K. Peter Norton Mcgraw Hill. N. page numbers. styles. Eight questions are required to be set giving equal weightage to all the units. screen assisted data entry: portable / handheld terminals for data collection. OCR). formatting pages. Subramanian. Output Devices: Monitor. (MICR. The candidates will have to attempt any five. Secondary storage. Serial line page printers.  Milestones in Hardware and Software. The student can use only Non–programmable & Non–storage type Calculator. entering information.

UNIT-I Matrices and Determinants: Introduction and definition of matrices . The student can use only Non–programmable & Non–storage type Calculator. All questions carry equal marks.6 Bachelor of Computer Applications (Semester – I) Paper – III: Mathematical Foundation of Computer Science Time: 3 Hours Max. UNIT-II Set Theory. characteristics polynomial. types of sets. Marks: 75 Note: 1. inverse and composite relations).P.S. duality. Logarithmic and Exponential function. transpose and inverse of matrix. eigen values. addition law of probability. Mutually exclusive. graphs of relations. Baye’s Theorem. Eight questions are required to be set giving equal weightage to all the units. definition and properties of determinants ( statement only ). Definite integral Probability: Mathematical and Statistical probability. Higher Engineering Mathematics by B. Bali 2. solution of system of linear equations using matrices and Cramer rule. operation on sets – union. Compound events. nature of eigen values . Distributive laws. Integration of functions using partial fraction (Simple form using properties). Multiplication theorem of probability. Differentiation using log. UNIT-III Differentiation and Integration: Laws of derivative. Text Book of Engineering Mathematics by N. Conditional probability. Integration of functions by parts. intersection and difference of sets. Elementary events. matrix addition and scalar multiplication . Books Recommended: 1. Independent events. Integration of algebraic. Sample space. Grewal . certain types of matrices. Chain rule. Associative laws. Venn diagrams. types of matrices. derivatives of implicit functions. repeated derivatives. DeMorgan’s laws. Cayley – Hamilton theorem. Types of events. Relation: Elements of a set. statement problems. axiomatic approach to probability. methods of describing a set. properties of relations (domain. range. partitioning of a set. Basic definition of Relation and types of relations. The candidates will have to attempt any five. 2.

outline and revision. Oxford Guide to Effective Writing and Speaking by John Seely. Reading Skills: Reading Tactics and strategies. ii) Comprehension questions with short answers on content. details. using appropriate tense. progression of ideas. The questions shall be phrased in a manner that students know clearly what is expected of them. There will be internal choice wherever possible. Reading for understanding concepts. official/ business letter. writing styles for application. notices etc. resume. personal letter. 2. coherence. subject-verb agreement. Reading purposes–kinds of purposes and associated comprehension. CUP . Activities: a) Formatting personal and business letters. 10x5=50 Marks i) Multiple choice questions on the language and meanings of an unseen passage. Activities: a) Active reading of passages on general topics b) Comprehension questions in multiple choice format c) Short comprehension questions based on content and development of ideas 2. Reading for direct meanings.7 Bachelor of Computer Applications (Semester – I) PAPER – IV: COMMUNICATION SKILL IN ENGLISH – I Time: 3 Hours Max. narration. iii) Personal letter and Official/Business correspondence iv) Making point-wise notes on a given speech/ technical report OR Writing notices for public circulation on topics of professional interest v) Do as directed (10x1= 10 Marks) (change of voice. Recommended Books: 1. Marks: 50 Course Contents: 1. forms of verbs. memo. of an unseen passage. Each question will carry 10 marks.. combination of 2 simple sentences into one. b) Organising the details in a sequential order c) Converting a biographical note into a sequenced resume or vice-versa d) Ordering and sub-dividing the contents while making notes. Writing Skills: Guidelines for effective writing. English Grammar in Use (Fourth Edition) by Raymond Murphy. e) Writing notices for circulation/ boards Suggested Pattern of Question Paper: The question paper will consist of five skill–oriented questions from Reading and Writing Skills. purpose of writing etc. logical progression and meanings of phrases/ expressions.

wK L 3 xzN/ 1H gkm-eqw ns/ gkm-g[.kbh o{g. Go{D j`fsnk d/ d/F ftu. J/v} L fJe rzGho . (n) GkFk tzBrhnK L GkFk dk Ne. ftnziB.zgH .wki-ftfrnkBe b/yK dk . nzfwqs.Nh.zrqfj).EkB s/ ftXhnK.o.zX{) (gq'H w'jB f.zx. GkFk ns/ T[g-GkFk dk nzso. b/y L gjhnk gqd{FD.[fjzdo pho ns/ tfonkw f.zx . tksktoDh gqd{FD ns/ wB[`y.8 Bachelor of Computer Applications (Semester – I) Paper-V: gzikph (bkiawh) . . gkF) r[o{ BkBe d/t :{Bhtof. nzfwqsk gqhsw. (.to.[oihs gkso. r[o{ BkBe d/t :{Bhtof.fszdo f. gq'H wfjzdo f.zeN. .seK e[b nze L 50 frnkB wkbk (ftfrnkBe s/ . fFt e[wko pNkbth.[o. nzfwqs.zx. Bkoh Fesh. 5H (T)gzikph X[Bh ftT[_s L T[ukoB nzr. 6H wks GkFk dk nfXnkgB (T) gfjbh GkFk d/ s"o T[`s/ (n) d{ih GkFk d/ s"o T[`s/ . . 2H nksw nBksw (.Nh. T[ukoB . gzikph T[g-GkFktK d/ gSkD-fuzBQ.zgkH vkH .o.zx pBt?s). 3H g?oQk ouBk 4H g?oQk gVQ e/ gqFBK d/ T[`so.

ko iK T[./ fBpzX dk .zr ./ fJe T[s/ g?oQk fbyD bJh 05 nze fejk ikt/ . 10 nze 2H nksw nBksw L . 5%2=10 nze .nktK pko/ uko gqFB g[`S/ ikDr/. 10 nze 6H Bzpo 6 ftu wks GkFk d/ gfjbh GkFk ns/ d{ih GkFk ti'_ nfXnkgB. wjZst ns/ . ebk g`y 10 nze 3H g?oQk ouBk L fszB ftfFnK ftu'I fe. pko/ gzi gqFBK d/ T[`so.dk ftFk t. fiBQK ftu'_ ftfdnkoEh B/ d' dk T[`so d/Dk j't/rk.ko. gq. ftFk-t.fjs ftnkfynk.s{ (d' ftu'I fJe) .wZf. 4H g?oQk d/ e/ T[.9 Bachelor of Computer Applications (Semester – I) nze–tzv ns/ gohfyne bJh jdkfJsK: 1H fe.s{. 05 nze 5H Bzpo 5 T[s/ fd`sh ftnkeoD d/ nkXko ’s/ toDBkswe gqFB.

edk j?. fefonk.zpzXh w[`Ybh fe. fN`gh.w d/ gqFB (d' ftu'_ fJ`e eoBk j't/rk) 10 nze . Ntor nkfd . g?o ftu g?D tkb/ toD ns/ brK wksoK dh tos'_ Bkb .10 Bachelor of Computer Applications (Semester – I) PAPER – V: w[ZYbh gzikph (In lieu of Compulsory Punjabi) .?No bJh jdkfJsK 1H g?_sh n`yoh dh pDso ns/ soshp Bkb .zpzXh gqFB 10 nze 3H (T) ftFokw fuzBQK dh tos'_ . gVBKt. 10 nze (d' gqFBK ftu'_ fJ`e eoBk j't/rk) etor. ftF/FD ns/ fbzr tuB . fefonk. brK wksoK 2H brkyo (fpzdh.zpzfXs gqFB. ftF/.zpzXh gqFB g[`fSnk ik . fbzr ns/ tuB nze tzv s/ g/go . (n) BKt. utor. stor.zpzXh gqFB 10 nze (n) BKt gVBKt. n`Xe) 3H (T) ftFokw fuzBQK dh tos'_. fN`gh ns/ n`Xe dh tos'_ .wK L 3 xzN/ e[b nzeL 50 pkm-eqw 1H g?_sh n`yohl g?o fpzdh tkb/ toD ns/ g?o ftu g?D tkb/ toD.D.zpzfXs gqFB (d' ftu'_ fJ`e eoBk j't/rk) 10 nze 2H fpzdh.

C Programming 2. MS – OFFICE (Word and Power Point) . Marks: 75 Operational Knowledge of: 1.11 Bachelor of Computer Applications (Semester – I) Paper – VI: Practical – I (MS Office 2010 & Basic C Programming) M. Windows Based Operating System 3.

The candidates will have to attempt any five. user defined data types. Scaum Outline Series: “Programming in C”. processing and unformatted data files. Eight questions are required to be set giving equal weightage to all the units. multiple programs. Stephen G. pointers & multi–dimensional arrays of pointers. creating. pointer and one dimensional arrays. 4. operation on pointers.II Time: 3 Hours M. string functions and string manipulation Program Structure Storage Class: Automatic. All questions carry equal marks.12 Bachelor of Computer Applications (Semester – II) Paper–I: Introduction to Programming (C) . Pointers: Fundamentals. 2. self referenced structure. Dennis & Ritchie: “Programming in C”. more about library functions. Strings: String declaration. other functions. external and static variables. Balaguruswamy: “Programming in ANSI C”. References: 1. Marks: 75 Note: 1. structures and pointers. unions. Data Files: Opening. 2. passing functions. passing pointer to a function. passing structures to functions. The student can use only Non–programmable & Non–storage type Calculator. pointer declaration. 3. Kochar: “C Programming”. . Structures & Unions: Defining and processing a structure. more about pointer declarations. closing.

Ujjenbeck. Demultiplexer. Analysis and Design of Integrated Circuits. clocks and timers. M. Boolean algebra and Minimization techniques. 1’s and 2’s complement. 6. 2. Malvino: Digital Computer Electronics. Digital Principles and Practices. John: Digital Electronics: A Modern Approach. 1994. Codes: straight binary code. Edition. Encoder Sequential Circuits: Flip-flops. 5.G. PROMS and EPROMS Address selection logic. BCD Code Excess3 Code. Grey Code ASCII. number conversion system . canonical forms of Bookean expressions. 4. The student can use only Non–programmable & Non–storage type Calculator. Integer and floating point representation Logic Gates and Boolean Algebra: Logic gates.A. Multiplexer. Morris: Digital Logic and Computer Design. . K-Map UNIT-II Combinational Circuits: Adder. International. counter UNIT-III Semiconductor memories: Introduction. Universal Gates. read only & random access memory chips. Static and dynamic devices. Hodges & H. McGraw Hill. Integrated Electronics by Millman. Eight questions are required to be set giving equal weightage to all the units. Decoeer. Jackson. Subtracter. Marks: 75 Note: 1. 1993. 3.13 Bachelor of Computer Applications (Semester – II) Paper–II: Principles of Digital Electronics Time: 3 Hours M. Wakerley. registers. 1983. . All questions carry equal marks. The candidates will have to attempt any five. binary arithmetic. representation of signed binary numbers. Read and write control timing diagrams for ICs References: 1. Mano. 2. F. Prentice Hall. UNIT-I Number System: Introduction. Halkias McGraw Hill. D. Joph.

Gauss Elimination Method Gauss Jordan Method. Simultaneous Solution of Equations. Eight questions are required to be set giving equal weightage to all the units. Methods of bi–section.14 Bachelor of Computer Applications (Semester – II) Paper–III: Numerical Methods & Statistical Techniques Time: 3 Hours M. Multiple roots and other difficulties. 2. Mean deviation. Numerical Integration and different Trapezoidal Rule. Median. UNIT-I Introduction: 1. Interpolation methods. Prentice Hall of India Private Ltd. Mean. Newton’s Methods: Forward Difference Method. Non–linear trend. Mean Arithmetic. II. Y = axb Y = abx Y = aex Polynomial fit: Y = a+bx+cn2 UNIT-III Statistical Techniques: 1. Marks: 75 Note: 1. 2. Mean geometric. Errors and Measures of Errors. Numerical methods versus numerical analysis. Iterative Solutions. All questions carry equal marks. B. 2. Grewal. That the program for numerical and statistical methods are to be written in C. 3. Lagrangian Polynomials. Sultan Chand Publication.. Newton Raphson – Method. . 3. Co–efficient of variation. Non–linear Equations. Correlation. Measure of Central Tendency. Mean harmonic. Numerical Methods for Engineering. The student can use only Non–programmable & Non–storage type Calculator. Books Recommended: 1. Measures of dispersion. Paper setter indicating thereby that the greater weightage is to be given to exercises rather than theoretical derivation of all numerical and statistical methods. False position method. Numerical Methods. Note for Paper Setter: I. V. 2. Rajaraman: Computer Oriented Numerical Methods. 6 Least square fit linear trend. The candidates will have to attempt any five. Simpson’s 3/8 Rule. Backward Difference Method Divided Difference Method. New Delhi. UNIT-II 4. 5 Interpolation and Curve Fitting. Standard deviation. Mode.S.

The nature of the questions will be as given below:Two questions requiring students to give descriptive answers. note taking. Each question will carry 5 marks. For example. The study of sounds of English. forms of polite speech. effective listening skills. marking stress. situation or concept c) Giving interviews Suggested Pattern of Question Paper: The question paper will consist of seven questions related to speaking and listening Skills. Listening Skills: Barriers to listening. understanding the cue and making appropriate responses. the paper setter may give a proposition and ask the students to agree or disagree with it or introduce a character giving invitations and ask the students to accept or refuse it etc. Activities: a) Listening exercises – Listening to conversation. News and TV reports b) Taking notes on a speech/lecture 2. feedback skills. a proposal. a proposition. stress Situation based Conversation in English Essentials of Spoken English Activities: a) Making conversation and taking turns b) Oral description or explanation of a common object. Three questions in the form of practical exercises requiring students to give an appropriate response to a question.15 Bachelor of Computer Applications (Semester – II) PAPER–IV: COMMUNICATION SKILLS IN ENGLISH – II Time: 3 Hours Max. Speaking and Conversational Skills: Components of a meaningful and easy conversation. Marks: 50 Theory Marks: 35 Practical Marks: 15 Course Contents: 1. Attending telephone calls. . an invitation etc. asking and providing information on general topics. Two questions requiring students to transcribe simple words in IPA symbols.

Group Discussion. Oral Presentation with/without audio visual aids. Time for each group will be 15 to 20 minutes. Listening to any recorded or live material and asking oral questions for listening comprehension. Group discussion comprising 8 to 10 students on a familiar topic. 2. (Topic can be given in advance or it can be of student’s own choice). Use of audio visual aids is desirable. Oral Presentation will be of 5 to 10 minutes duration.16 Bachelor of Computer Applications (Semester – II) PRACTICAL / ORAL TESTING Marks: 15 Course Contents: 1. 2. Questions: 1. . Note: Oral test will be conducted by external examiner with the help of internal examiner. 3.

pko/ gzi gqFBK d/ T[`so 05 Bzpo 7 ftu n`m nykD ns/ nZm w[jkto/ g[`S/ ikDr/.Nh.zrqfj) (. T[ikV (e[btzs f.wki-ftfrnkBe b/yK dk .zX{) r[o{ BkBe d/t :{Bhtof. gkso fusoD.kfjs.Nh.zebg Fpd Fq/DhnK g?oQk ouBk g?oQk gVQ e/ gqFBK d/ T[`so w[jkto/ ns/ nykD nze–tzv ns/ gohfyne bJh jdkfJsK: 1H 2H 3-4H 5H 6H 7H fe. Fpd-pDso ns/ Fpd ouBk L gfoGkFk.s{ (d' ftu'I fJe) . w[`Yb/ .zgH vkH . g'qH wfjzdo f. dbdb (tfonkw f.zx ftoe).o.o.fszdo f. 10 nksw nBksw L ./ fJe T[s/ g?oQk fbyD bJh 05 fejk ikt/ .zx pBt?s).wK L 3 xzN/ e[b nze L 50 gkm-eqw ns/ gkm-g[.gZFN eoB/ j'Dr/. g?oQk d/ e/ T[.17 Bachelor of Computer Applications (Semester – II) PAPER–V: gzikph (bkiawh) .zX{) (ejkDhnK) gmkD dh Xh (.kfjs s/ b'e . nksw nBksw (.seK 1H 2H 3H 4H 5H 6H 7H frnkB wkbk (ftfrnkBe s/ .dk ftFk t.zgH . ezfgT{No ns/ fJzNoB?`N. wB[`yh nfXeko. nu/sB dk r[D s/ . .s{.kfjs ~ d/D 10 3-4 Bzpo T[`s/ fd`sh ftnkeoD d/ nkXko s/ toDBkswe gqFB.zx Xho).[ikB f. 10 g?oQk ouBk L fszB ftfFnK ftu'I fe.zx).zx .[Gkn. ftFk t.[fjzdo pho ns/ tfonkw f./ fBpzX dk .KRh ezX (. r[o{ BkBe d/t :{Bhtof.ko iK T[. 2007 b/y L .zx .ko. . x'NDk (w'jB Gzvkoh).zs'y f.zx. 5+ 5=10 nze nze nze nze nze nze . nzfwqs. nzfwqs. nZyK. fiBQK ftu'_ ftfdnkoEh B/ gzi-gzi ~ tkeK ftu tos e/ noE .

imSrq SbdW dI bxqr/isrjnw. ivAwh ivc. 3. smwn (qy/Aqy) Aqy ADIn (jo/ik) XojkW dI vrqoN. igxqI nwl sMbMiDq [ 2. Dwrimk sQwnW ivc. 3. swDwrn vwk. in`q vrqoN dI pMjwbI SbdwvlI: ru`qW. dohry Sbd / duhrrukqI (ijvyN DUV DwV / Br Br). 2. ikirAw/shwiek ikirAw dy rUp. pRSnvwck. dosqW nwl Awid[ . suqMqr Aqy ADIn aupvwk. ibAwnIAw. pMjwbI vwkW dI vrqoN: iviBMn smwjk/siBAwcwrk pRsMg. AwigAwvwck. smwsI Sbd (ijvyN lok sBw). pMjwbI Sbd-bxqr sMXukq Aqy imSrq Sbd in`q vrqoN dI pMjwbI SbdwvlI BwSw Aqy pMjwbI BwSw mu`FlI jwx pCwx gurmuKI ilpI dIAW ivSySqwvW pMjwbI vwk bxqr swDwrn vwk: iksmW sMXukq vwk: iksmW imSrq vwk: iksmW pMjwbI vwkW dI vrqoN dy iviBMn smwijk pRsMg 20 AMk 15 AMk 15 AMk XUint Aqy QIm 1. mhIinAW. ipCyqrW rwhIN (ijvyN rMglw). sMXukq Aqy imsrq vwkW dIAW iksmW. SoipMg mwl/isnmy ivc. mOsmW. bwzwr ivc. pMjwbI Sbd bxqr: sMXukq Sbd. gurmuKI ilpI dIAW ivSySqwvW sMbMDI pRSn pMjwbI vwk bxqr: krqw krm ikirAw. pMjwbI Sbd rcnw: pVnwvIN rUp. Gr ivc. BwSw Aqy mwq BwSw dy mh`qv sMbMDI pRSn II. myly ivc. AgyqrW rwhIN (ijvyN aup BwSw).18 Bachelor of Computer Applications (Semester – II) PAPER – V: w[ZYbh gzikph (In lieu of Compulsory Punjabi) smW: 3 GMty kul AMk: 50 pwT – kRm 1. I.

ijs ivc ividAwrQI nMU iksy smwijk/siBAwcwrk pRsMg ivc vrqy jWdy pMj vwk ilKx leI ikhw jwvygw[ pRSnW dI BwSw srl Aqy spSt r~KI jwvy[ 15 AMk .19 Bachelor of Computer Applications (Semester – II) AMk-vMf Aqy prIiKAk leI hdwieqW 1. dUsry XUint iv~c BwSw Aqy pMjwbI BwSw mu`FlI jwx pCwx nwl sMbMiDq 5-5 AMkW dy iqMn ivhwrk pRSn pu~Cy jwxgy[ AMkW dI vMf A~goN ie~k-ie~k jW do-do AMkW dy Coty pRSnW iv~c kIqI jw skdI hY[ 15 AMk 3. qIjy XUint iv~c pMjwbI vwk-bxqr nwl sbMiDq 5-5 AMkW dy do ivhwrk pRSn pu~Cy jwxgy[ AMkW dI vMf A`goN iekiek jW do-do AMkW dy Coty pRSnW ivc kIqI jw skdI hY[ pMjwbI vwkW dI ivhwrk vrqoN nwl sbMiDq 5 AMkW dw iek pRSn pu~iCAw jwvygw. pihly XUint iv~coN pMjwbI Sbd bxqr Aqy Sbd rcnw nwl sbMiDq 5-5 AMkW dy iqMn ivhwrk pRSn pu~Cy jwxgy[ AMkW dI vMf A~goN iek-iek jW do-do AMkW dy Coty pRSnW ivc kIqI jw skdI hY[ in`q vrqoN dI SbdwvlI nwl sbMiDq iek-iek AMk dy pMj (AwbjYkitv) pRSn pu~Cy jwxgy[ 20 AMk 2.

20 Bachelor of Computer Applications (Semester – II) Paper – VI: Practical–I (Advanced C Programming) M. . Marks: 75 Operational Knowledge and Implementation of Numerical Methods & Statistical techniques using C language.

Instruction Cycle. SIMD & MISD. MIMD Machines. Arithmetic & Shift Micro – operations. Designs & Concepts of Main Memory. Implementing Common Bus Using Multiplexers: Logical. Pipeline & Vector Processing Parallel Processing Pipelining. Vector Processing. Memory Organization Memory Hierarchy. DMA & I/O Processor. 2. References: Computer System Architecture: M. Interfacing various Registers. Various Registers. Mano (PHI) Computer Architecture: J. Program Control.M. Program Interrupt. All questions are to be of equal marks. Basic Computer Design Instruction Codes. Marks: 75 Note: 1. Computer Instructions. Timing Signals. Hardwired & Microprogrammed (Wilhe’s Design) Control Unit. Auxiliary Memory. UNIT-I Information Representation : Register Transfer.P. UNIT-III I/O Organization I/O Interface. Instruction Formats. SISD. Computer Architecture: Patterson & Hemessy. Cache and Virtual Memory. Hayes. The student can use only Non–programmable & Non–storage type Calculator. In theory eight questions are to be set in all. Addressing Modes.21 Bachelor of Computer Applications (Semester – III) Paper – I: Computer Architecture Time: 3 Hours M. . The candidates are required to attempt five of them. Design of a Basic Computer. UNIT-II CPU Design Stack Organized CPU. Modes of Transfer. Parallel & Distributed Computers. The maximum marks of the paper is 75. Associative Memory.

Views. levels of database system. 5th NF. BCNF. security. hierarchical model. 4th NF. concurrency control and its management. Cursors– Implicit & Explicit. SQL. Books: 1. database management system. field. All questions are to be of equal marks. comparison of these models. DBTG. UNIT-III ORACLE 10g SQL *PLUS : Introduction to Oracle–8. Procedures.22 Bachelor of Computer Applications (Semester – III) Paper – II: Database Management System & Oracle Time: 3 Hours M. PL/SQL : Introduction to PL/SQL. database. Sequences.J. record. file. 2.C. Built in Functions. Date. 3. Advantage and disadvantage. 2NF. Database Concept by Korth. The students can use only Non–Programmable & Non–Storage Type Calculators. Marks: 75 Note 1: In theory eight questions are to be set in all. network model. Tree Walking. Introduction to Database System By C. SQL–DDL. Desai. UNIT-I Introduction to data. Relational model. Object Oriented Features of Oracle 10g. Database System concepts & Oracle (SQL/PLSQ) – AP Publishers. 3NF. E–R diagram. The candidates are required to attempt five of them. Join methods & sub query. . UNIT-II DBA. 6. Oracle – Developer – 2000 by Ivan Bayross. protection. Union Intersection. Simplified Approach to DBMS– Kalyani Publishers 5. Indexing. DCL. Minus. Database Management System By B. Relational form like INF. Security amongst users. Structure of database system. responsibilities of DBA. 4. 2. DML. Functions & Packages Database Triggers. recovery of database. different keys used in a relational system.

saving your program. Assignment. .5. do loop.5. Variable.2. Accessing and averaging array elements. 1.3. 1. linker and runtime.2. Introduction. array type. library function. 3 Decision Making Looping Statement Inputting using in and outputting using cout statements.2. array of strings.4. UNIT-II 1 Arrays 1. constant. 1. String handling. switch statement. and 3. Conditional.23 Bachelor of Computer Applications (Semester – III) Paper – III: C++ (OOP Language) Time: 3 Hours M. Precedence of Operators.3.1. All questions are to be of equal marks. Relational. Increment/Decrement. go to statement.1. 3. naming your program. running the program.2. using the editor. conditional operator statement. Type Conversion. opening an existing file.. nesting of loops.else statement. DOS shell. 2 Input / Output Statements 1. Marks: 75 Note 1: In theory eight questions are to be set in all. array elements. Logical. Errors : Compiler. Comments and keywords of C++ 1. Data type. Statements. Preprocessor directives. 1. 1.4. A brief history of C++ 1.6. A Complete C++ Program: Invoking Turbo C++. 2. 1. If. break and continue statement. UNIT-I 1 Getting Started 1. compiling and linking.1. initializing array. 1. 1. If Statement. examining files. The students can use only Non–Programmable & Non–Storage Type Calculators. Expression. Defining an array. 1. Operator: Arithmetic. The candidates are required to attempt five of them.3. Basic program construction. Programming of C++ with array. While loop. nesting of if statement.1. for loop. Other IDE Features : Compiling and linking shortcut exiting from IDE.

Inheritance a) Derived class and Base Class. UNIT-III 1. global variables. Inline function and default parameter. C++ & Graphics by Vijay Mukhi’s 2.2. Variable and storage classes.8. Passing argument to function. Other structure features. class hierarchies. 7. execution of function.4. 1. 1. Mastering C++.6. 1.1. 1. a) Overloading unary operators.3. defining a structure variable. 1. 7. 7. A simple structure. Overloading functions. Operator overloading. Return values. Structure within structure. f) Level of inheritance. .9.1. Objects & Classes. b) Overloading binary operators. Reference arguments. c) Data conversion. 7. Accessing Structure member. c) Overriding member functions. d) Inheritance in the English distances class.3.24 Bachelor of Computer Applications (Semester – III) 2 Functions 1 Object Oriented Programming 2 Structures 5. Constructor & Destructor. Books: 1. 1. C++ Programming Language by Schaum’s outline series.2. e) Public and Private inheritance. 4.2. 1.4. d) Pitfalls operator overloading and conversion. 7. Arrays of structure.5. Local. 1.5. Polymorphism a) Problems with single inheritance.4. What is a function? Declaring and defining function. 3. Structure and classes. b) Multiple inheritance. 1. b) Derived Class Constructors. specifying the structure.6.5. Turbo C++ by Robert Lafore. 1. 1.1. 1.3. 7.7.

Answer to the question should not exceed 5 pages. structure and function of the following ecosystems: a. Marks: 50 Section–A: (15 Marks): It will consist of five short answer type questions. mining. deforestation. each question carrying ten marks. fertilizer–pesticide problem. f) Land Recourses: Land as a resource. Ecosystem:  Concept of an ecosystem. use of alternate energy sources. Answer to any of the questions should not exceed four pages. Answer to any of the questions should not exceed two pages. floods. food webs and ecological pyramids. e) Energy Resources: Growing of energy needs. Candidates will be required to attempt three questions. environmental effects of extracting and using mineral resources. case studies. each question carrying five marks. dams–benefits and problems. Candidate will be required to attempt one question only. Timber extraction. The Multidisciplinary Nature of Environmental Studies:  Definition. soil erosion and desertification. c) Mineral Resources: Use and exploitation. Section–C: (15 Marks): It will consist of two questions. salinity. scope & its importance. d) Food Resources: World food problems. conflicts over water.  Role of an individual in conservation of natural resources. consumers and decomposers. 1. b) Water Resources: Use and over–utilization of surface and ground water. Grassland ecosystem . Section–B: (20 Marks): It will consist of four essay type questions. 3. drought.  Equitable use of resources for sustainable lifestyles. effects or modern agriculture. characteristic features.  Ecological succession.25 Bachelor of Computer Applications (Semester – III) PAPER–IV: ENVIRONMENTAL STUDIES-I Time: 3 Hrs.  Structure and function of an ecosystem. 2. change caused by agriculture and overgrazing. renewable and non–renewable energy resources. Candidates will be required to attempt two questions.  Producers.  Introduction. Theory Lectures: 1½ Hours/ Week Max. dams and their effects on forests and tribal people.  Energy flow in the ecosystem. Natural Resources:  Natural resources and associated problems: a) Forest Resources: Use of over exploitation.  Food chains. types.  Need for public awareness. case studies. case studies. case studies. land degradation. Forest ecosystem b.

2000. Hygiene & Sanitation: Definition. Perspective in Environmental Studies. motto.  Urban problems related to energy. Emblem. watershed management. aims & objectives of NSS. 5. New Delhi. 1995.  Wasteland reclamation. Food and Nutrition. Environmental Protection and Laws. ozone layer depletion. H. 2012. 10. 8.. Social Issues and Environment:  From unsustainable to sustainable development. Ecology and Environment. 9. lakes. oceans. ABS Publications. Essentials of Environmental Studies. song. rain water harvesting.  Issues involved in enforcement of environmental legislation. Essentials of Environmental Studies. . C. Centre for Science and Environment. 7. T. philosophy.  Public awareness. Wadsworth Publishing Co.  Consumerism and waste products. Bikaner. Safe drinking water.  Environmental ethics: Issues and possible solutions. nuclear accidents and holocause. Delhi. Amritsar. badge etc. Miller. P.  Wildlife Protection Act. 2001. 6. Jalandhar. estuaries) 4. C. Sharma.26 Bachelor of Computer Applications (Semester – III) c. Universities Press. global warning.  Climate change. P. New Age International (P) Ltd. water borne diseases and sanitation (Swachh Bharat Abhiyan). Bharucha. 2004. Case studies. Environmental Science.  Resettlement and rehabilitation of people. D. Aquatic ecosystems (ponds. 5. Environmental Biology. flag. roles and responsibilities of various NSS functionaries.  Water conservation. Agarwal. Desert ecosystem d. Nidhi Publications Ltd.  Forest Conservation Act. 2005. & Bhosale. and Nagendran. G.  Environmental Protection Act:  Air (prevention and Control of Pollution) Act. Ltd. E. Jadhav. National Health Programme. District Court Complex. 2005. 4. New Delhi. needs and scope of health education. Sukhmani Society (Suvidha Centre). Rastogi Publications. Jr. V. Meerut. National Service Scheme  Introduction and Basic Concepts of NSS: History. Booklet on Safe Driving. Kanta. Pearson Education (Singapore) Pte. 2. Joseph. K. K. Organizational structure. Kaushik. rivers. streams. Case studies. S. A. its problems and concerns. Down to Earth. 3. References/Books: 1.. Reproductive health. 2004. Hyderabad. R. M.  Water (prevention and Control of Pollution) Act. Himalaya Pub.  Health. Textbook of Environmental Studies.. & Kaushik. acid rain.

27 Bachelor of Computer Applications (Semester – III) Paper – V (Programming Lab-I) Lab – I: Based on C++ Programming Language : 50 Marks : 25 Marks Paper – VI (Programming Lab-II) Lab – II: Practical in Oracle .

Text/References: 1. complexity of Algorithms and Time space trade off. Insertion Sort. file. Queues. 2. 2. Quick Sort. record. . Trees Binary Trees & Binary Search Trees. Marks: 75 Note 1: In theory eight questions are to be set in all. string processing. Sorting Techniques: Bubble Sort. Hashing. indexed. UNIT-I Basic Data Structures: Introduction to elementary Data Organization and operations. Loomis. Graphs and Algorithms to manipulate them. Schaum Outline Series. indexed sequential. The students can use only Non–Programmable & Non–Storage Type Calculators. Direct. The candidates are required to attempt five of them. Linked Lists. Selection Sort. UNIT-II Searching Techniques: Linear and Binary Search. File Structure & Data Structures by E. All questions are to be of equal marks. UNIT-III File Organization: Concept of field. Data Structure – Seymour Lipschutz. Merge Sort. Arrays. Stacks. Heap Sort. Concept of master and transaction files. 3.28 Bachelor of Computer Applications (Semester – IV) Paper – I: Data Structures and File Processing Time: 3 Hours M. Data Structures by Trabley & Soreuson. File Organization Techniques: Sequential. blocking and compaction.

Case studies of the Information System: Accounting Information systems. “Information Systems” by Mudride & Ross. Marks: 75 Note 1: In theory eight questions are to be set in all. UNIT-II What are systems? Information Systems? Categories of Information Systems. Ashok Arora and A. The students can use only Non–Programmable & Non–Storage Type Calculators. Shaya Bhatia. Development Life Cycle of Information system. All questions are to be of equal marks. Muneesh Kumar. on–line Information access and capture. Capturing of Information.K. . References: 1. office Automation systems. “Information Systems for Managers”. 2. Technologies for Information System: Latest trends in Hardware and Software. Converting Information to Computer – readable form. “Business Information Systems”. UNIT-III Various types of information systems: Transaction processing systems. UNIT-I Fundamental aspects of Information.29 Bachelor of Computer Applications (Semester – IV) Paper – II: Information Systems Time: 3 Hours M. 3. 2. Inventory control systems & Marketing systems. MIS and decision support system. The candidates are required to attempt five of them. source of Information.

filtering messages) Implementation of outlook express. 3. S. forwarding messages. role of extranet. web designing using HTML. Butterworth-Heinemann. Web browsing (opening. UNIT-I Introduction: About internet and its working. “Understanding The Internet”. References: 1. internet addressing (DNS) and IP addresses). working of search engine. . WWW: Introduction. file transfer protocol (FTP). managing e–mail (creating new folder. structure of an e–mail message. business value of intranet. business use of internet. Advantage and disadvantage. UNIT-II Internet Protocol: Introduction. component of search engine. evaluation of internet. 1st Edition (October 31. The candidates are required to attempt five of them. “Internet Technologies”. UNIT-III Search Engine: About search engine. services offered by internet. working of extranet. APH Publishing Corporation (April 1. working of e–mail (sending and receiving messages). Kieth Sutherland. Telnet. 2. saving and printing a web page and bookmark). deleting messages. difference between search engine and web directory. 2002). DHTML with programming techniques. The students can use only Non–Programmable & Non–Storage Type Calculators. 2. All questions are to be of equal marks. application of intranet. Bansal. K. Behrouz A. “Data Communications and Networking”. E–Mail Basic Introduction. Forouzan. 3 rd Edition. audio on internet. viewing. difference between intranet and extranet. other protocols like HTTP and TCPIP. Intranet and Extranet: Introduction.30 Bachelor of Computer Applications (Semester – IV) Paper – III: Internet Applications Time: 3 Hours M. Gopher. working of intranet. 2000). working of WWW. windows environment for dial up networking (connecting to internet). internet service provider (ISP). Marks: 75 Note 1: In theory eight questions are to be set in all.

Stern Nancy Assembler Language Programming for IBM and IBM Compatible Computers. conditional macro expansion. Dhamdhere: System Software and Operating System. John Wiley. D. McGraw Hill. Storage Management Optimization Incremental Compilers. 2. 1992. The candidates are required to attempt five of them. Marks: 75 Note 1: In theory eight questions are to be set in all. Cross Compilers. design of one pass and two assemblers Macroprocessors Macro definition and expansion. loaders. 5. 4. editors. An Introduction to System Programming. generations of unique labels.M. program linking. 2. concatenation of macro parameters. assemblers UNIT-II Assemblers Overview of assembly process. The students can use only Non–Programmable & Non–Storage Type Calculators. Lexical Analysis. compiler. Tata McGraw Hill. Tata McGraw Hill. Leland L. linkage. Beck: System Software. interpreters. 3. Bootstrap loaders References: 1. Stuarte: Operating Systems. Loaders and Linkage editors Basic loader functions. dynamic linking. Dhamdhere: Introduction to System Software. Madrich. 1974. All questions are to be of equal marks. D.31 Bachelor of Computer Applications (Semester – IV) Paper – IV: SYSTEM SOFTWARE Time: 3 Hours M. Parsing. Relocation. UNIT-I Introduction to System Software Introduction to System Software and its components Translators. Recursive macro expansion UNIT-III Compilers Phases of Compilation Process. Addison Wesley. 1991. .M.

Answer to the question should not exceed 5 pages. 1. Cyclone and Landslides. National and local levels. Theory Lectures: 1½ Hours/ Week Max.  Endangered and endemic species of India. Candidate will be required to attempt one question only. Marks: 50 Section–A: (15 Marks): It will consist of five short answer type questions. Section–B: (20 Marks): It will consist of four essay type questions. effects and control measures of urban and industrial wastes. poaching of wild life.  India as mega–diversity nation.  Conservation of Biodiversity: In situ and Ex–situ conservation of biodiversity.  Pollution case studies. Section–C: (15 Marks): It will consist of two questions. Earthquake. Environmental Pollution:  Definition.  Biogeographical classification of India.32 Bachelor of Computer Applications (Semester – IV) PAPER–V: ENVIRONMENTAL STUDIES-II Time: 3 Hrs. each question carrying five marks. Answer to any of the questions should not exceed four pages. productive use. Candidates will be required to attempt two questions. man wildlife conflicts. causes. ethical. effects and control measures of: a) Air Pollution b) Water Pollution c) Soil Pollution d) Marine Pollution e) Noise Pollution f) Thermal Pollution g) Nuclear Hazards h) Electronic Waste  Solid Waste Management: Causes. aesthetic and option values. Answer to any of the questions should not exceed two pages. species and ecosystem diversity. Biodiversity and its Conservation:  Definition: Genetic. 2.  Disaster Management: Floods. Candidates will be required to attempt three questions. each question carrying ten marks. social.  Value of Biodiversity: Consumptive use.  Role of an individual in prevention of pollution.  Hot–spots of biodiversity. .  Threats to Biodiversity: Habitat loss.  Biodiversity of global.

 Population explosion–Family welfare programme. Sharma. Kaushik. Environmental Biology. Down to Earth. 2005. 7. Universities Press. Ltd. Essentials of Environmental Studies. Bharucha.  Study of common plants. Perspective in Environmental Studies. Environmental Science. 9. aims and objectives of civil defense. Note: In this section the students will be required to visit and write on the environment of an area/ ecosystem/vi1lage industry/disaster/mine/dam/agriculture field/waste management/ hospital etc. 5. New Age International (P) Ltd. K. birds. Kanta.  Road Safety Rules & Regulations: Use of Safety Devices while Driving.  Role of information technology in environment and human health. 3. Human Population and the Environment  Population growth. Jadhav.  Value education. Rastogi Publications.  Contribution of the student to NSS/any other social cause for service of society. 2000. Do’s and Don’ts while Driving.  Environment and human health. S. Wadsworth Publishing Co. hill slopes etc. ABS Publications. New Delhi. Delhi. 5. Himalaya Pub. Responsibilities of Public under Motor Vehicle Act. Textbook of Environmental Studies. and Nagendran.  Case studies. 1988. District Court Complex. limitations. Nidhi Publications Ltd. Agarwal. D. insects. Calling Patrolling Police & Ambulance. A. Pearson Education (Singapore) Pte. C. Needs for self defense training. with its salient features. Joseph. M. Centre for Science and Environment. G. Jalandhar. Qualities of good entrepreneur. 2012. P. Field Visits:  Visit to a local area to document environmental assets–river/forest/grassland/hill/ mountain. Bikaner. Steps/ ways in opening an enterprise. 8. P. 2001. Ecology and Environment.  HIV/AIDS. E. H. Jr. variation among nations.  Accident & First Aid: First Aid to Road Accident Victims. Role of financial and support service Institutions. V.  Human rights. Hyderabad.  Civil/Self Defense: Civil defense services. Amritsar 10. R. Sukhmani Society (Suvidha Centre). National Service Scheme  Entrepreneurship Development: Definition & Meaning.. Role of Citizens or Public Participation. . 4. & Bhosale. References/Books: 1. General Traffic Signs. river. T. 2. Environmental Protection and Laws.  Study of simple ecosystems–pond. 2004. New Delhi. 1995. K. Miller. 2004..  Visit to a local polluted site–Urban/Rural/Industrial/Agricultural. 4. C. 2005.33 Bachelor of Computer Applications (Semester – IV) 3. Essentials of Environmental Studies. 6. their implications and suggestion for improvement.  Women and child welfare. & Kaushik. Booklet on Safe Driving. Meerut.

Marks: 50 Lab – Data Structure implementation using C++ Paper – VII: LAB .II Time: 3 Hours Lab – Web Designing and use of Internet M. Marks: 50 .34 Bachelor of Computer Applications (Semester – IV) Paper – VI: LAB .I Time: 3 Hours M.

The candidates are required to attempt five of them. . Token Ring.S. Modems. Local Area Network Protocols: CSMA Protocols. Elementary Datalink Protocols. Macmillan Publishing Co. All questions are to be of equal marks. 4. Design Issues of Network Layer: Services provided to transport layer. Introduction: Network Definition. TCP/IP reference model.35 Bachelor of Computer Applications (Semester – V) Paper – I: Computer Networks Time: 3 Hours M. 2. flow control. Access & Management. William: Local Networks: An Introduction: Macmillan Publishing Co. Types of modems. 3. Network types and topologies. Network Services: File transfer. UNIT – II 3. Error detection & correction. Electronic Mail. Introduction to Analog and Digital Transmission: Telephone system. Stallings. pulse code modulation. William: Data Computer Communication. MLMA. 5. 1992. FDDI. Tannanbum. comparison of OSI and TCP reference model. Uses of Computer Networks. Transmission & Switching: Multiplexing. packet switching. Stallings. BRAP. 2. UNIT – I 1. UNIT – III 6. A. The students can use only Non–Programmable & Non–Storage Type Calculators. 3rd Edition. OSI reference model. Token Bus. Data Link Layer Design Issues: Services provided to Network layer framing. link management. fibre optics & satellites. hybrid switching.: Computer Networks. ISDN service transmission. internet & World Wide Web. Transmission Media: Coaxial cable. twisted pair cable. Basic Components of a Network. Network Architecture. Prentice Hall. 7. connection. error control. IEEE standards 802. circuit switching. Marks: 75 Note 1: In theory eight questions are to be set in all. Remote login References: 1. Network Security and Privacy: Brief Introduction to Cryptography. routing. 2.

Executing database commands. . custom list controls. Accepting user input. UNIT-III Grid View Controls: Grid view control fundamentals. List Controls: Dropdown list control. Cashing database data with the SQL data Source controls. UNIT-II Designing Website with Master Pages: Creating master pages.NET Time: 3 Hours M. Displaying images. 5. Marks: 75 Note 1. Using the custom validator control. Radio button list controls. All questions are to be of equal marks. Introduction to Rich Controls: Accepting file uploads .II: Web Technologies using ASP. Executing a synchronous database commands. 8. Using ASP. Using the range validator controlusing the compare validator control. UNIT-I Introduction to Standard Controls: Display information. 1. In theory eight questions are to be set in all.36 Bachelor of Computer Applications (Semester – V) Paper. Programmatically executing SQL data source commands. Modifying master page content. Disconnected data access.NET 3. list box controls. Displaying different page views. 6.5: Stephen Walther. Displaying a wizard. Using the validation summary controls. Building data base objects with the . 2005. 2. 4. 7. Pearson Education.Displaying a calendar. 3. The candidates are required to attempt five of them. SQL Data Source Control: Creating database connections. bulleted list controls. Working with grid view control events extending the grid view control.NET parameters with the SQL data source controls.NET: Connected the data access. Using field with the grid view control. Loading master page dynamically. 2. Using the panel control. Using the regular expression validator control. Reference: ASP. Submitting form data. Building Data Access Components with ADO.NET framework. Using the hyperlink control. Introduction to Validation Controls: Using the required field validator control. The students can use only Non–Programmable & Non–Storage Type Calculators. Displaying advertisement.

page replacement. Scheduling Algorithms. References: 1. Unit – III Secondary Storage Structures: Disk structures. Operating System Concepts. Disk Reliability. Fourth Edition by Silberschatz Galvin Addison Wesley. page replacement algorithms. CPU–Scheduling: Basic concepts. Deadlock detection. Introduction: Definition. classical problem of synchronization.37 Bachelor of Computer Applications (Semester – V) Paper – III: Operating System Time: 3 Hours M. 3. methods for handing deadlocks. Real–time Systems. Published by Tata McGraw Hill. 5. segmentation. Unit – I 1. swapping. The students can use only Non–Programmable & Non–Storage Type Calculators. The candidates are required to attempt five of them. semaphores. continuous allocation. Deadlocks Prevention. Simple Batch system. Memory Management: Background. combined approach to deadlock handling. 8. Unit – II Process Synchronization: Critical – section problem. Distributed Systems. Processes: Process concepts. Deadlock avoidance. demand paging. Virtual Memory: Background. All questions are to be of equal marks. Time Sharing Systems. Multi programmed Batch. Operating Systems. Parallel Systems. performance of demand paging. . Threads. 7. Deadlocks: System Model. Logical v/s Physical address space. Marks: 75 Note 1: In theory eight questions are to be set in all. 2. 4. A Design Oriented Approach” by Crowley. Personal Computer System. 2. Operating Systems. Process Scheduling. 3. Algorithm Evaluation. paging. Second Edition by Dietel. 2. Addison Wesley. Recovery from deadlock. thrashing. Scheduling Criteria. Disk scheduling. allocation of frames. Early Systems. Deadlock characterization. 6.

Multithreading in Java. Hurbert Schildt. Packages & Interfaces. Inheritance & Polymorphism. Control statements. constructors. 06 Aug. UNIT-III Exception Handling. 2004. . Daniel Mliang. 2. Platform Independence & Cross Platform Computing. “Introduction to Java Programming”. Y. Pearsons Publications. John Wiley & Sons. The student can use only Non–programmable & Non–storage type Calculator. Marks: 75 Note: 1. UNIT-I Introduction to JAVA: Object Orientation Concepts. The maximum marks of the paper is 75.38 Bachelor of Computer Applications (Semester – V) Paper – IV: JAVA PROGRAMMING LANGUAGE Time: 3 Hours Max. and CSS”. “Beginning Web Programming with HTML. Tata MacGraw Hill. XHTML. In theory eight questions are to be set in all. UNIT-II Classes & Methods. All questions are to be of equal marks. 2. String handling in Java & Input/Output in Java. Jon Duckett. References: 1. 3. Operators & Data types. The candidates are required to attempt five of them. “Java–The Complete Reference”.

39 Bachelor of Computer Applications (Semester – V) Paper–V Time: 3 Hours Lab : Marks: 50 Lab based on JAVA Programming Language Paper–VI Time: 3 Hours Lab : Marks: 50 Lab based on ASP.NET .

Circle generating algorithms. Computer Graphics by Donal Hearn M. arc and spiral 5. Overview of Graphics system: Computer Graphics and their applications. Scaling. 3. Two Dimensional Transformations: Basic Transformations. UNIT – III 6. rotation. Perspective projection. UNIT – II 4. 2. Graphics Software. arc. Windowing concepts. Rotation. Elementary Drawing: Points and various line drawing Algorithms and their comparisons.40 Bachelor of Computer Applications (Semester – VI) Paper – I: Computer Graphics Time: 3 Hours Total Marks: 75 Note 1. C Programming for 2–D and 3–D transformations. The students can use only Non–Programmable & Non–Storage Type Calculators. Display Devices: CRT Monitors (Random – Scan and Raster Scan. parallel projections. 2. Three Dimensional concepts. Implementation in C: C programming for drawing 2 D objects – line rectangle. scaling. . 3. Algorithms for ellipse. Plastock and Gordon Kalley – Schaum’s Series. Composite Transformations: Windowing and clipping. 3 transformations. translation. 7. UNIT – I 1. Pardive Baker (PHI) Easter Economy Edition. The paper setter is required to set eight questions in all and the candidates will be required to attempt any five. LED and LCD Monitors. Shear. References: 1. Reflection. 3 D Coordinate Systems. Window–to–view port transformations. All questions carry equal marks. DVST. Computer Graphics by Roy A. clipping and its algorithms. Plasma – Panel Display. Matrix representation of Basic transformations and homogenous coordinates. Computer Graphics by Marc Berger. Translation. projections. circle and ellipse. 2.

Test cases and test criteria. The students can use only Non–Programmable & Non–Storage Type Calculators. Structural Testing. Abstraction. Integrated Approach to Software Engineering. Metrics for software quality. All questions are to be of equal marks. Metrics for software productivity and quality. total number of modular. Single variable model. COCOMO model. function oriented metrics. Software Engineering Paradigms. Rayleigh curve. . Functional Testing. Software Applications. References: 1. Data flow diagram and data dictionary. Pankaj Jalote. Introduction to Software Engineering: Definition. Coding: Coding by Top–down and Bottom–up. Partitioning. problem. structured analysis. Software Metrics: Role of Metrics and measurement. Personal Plan. prototyping. System Design: Design Objectives. On software size estimation. Design Principles. Software characteristics. 2. inspection & review. Structure Design. 5. size–oriented metrics. Pressman. Information Hiding. Matrix. Structure Charts. 9. Design Methodology. Specifying functional module. Introduction to Software: Definition. UNIT – I 1. interactive Enhancement. UNIT – III 7. Verification & Validation (V & V). 8. Testing: Level of testing. Design Review. The Spiral model. Software Requirement Specification (SRS): Problem analysis. Detailed Design: Module specification. 6. structuring information. Quality Assurance Plan. Programming style.41 Bachelor of Computer Applications (Semester – VI) Paper – II: Software Engineering Time: 3 Hours M. UNIT – II 4. specifying data abstraction. Automated Cross Checking. Roger S. Characteristics and component of (SRS). 3. Structured Programming. Marks: 75 Note 1. Measurement software. Software Engineering. uncertainties in cost estimation. Internal Documentation. Fourth Generation Technique. Software & Personal Planning. In theory eight questions are to be set in all. number of parameters. 2. 2. waterfall method. Software components. Planning a Software Project: Cost estimation. Project scheduling and milestones. The candidates are required to attempt five of them. Top Down and Bottom–up techniques. PDL and Logic/Algorithim Design.

42 Bachelor of Computer Applications (Semester – VI) Paper – III: Programming Laboratory Time: 3 Hours Lab: Implementation of Applications of Computer Graphics in C++/C Marks: 50 .

The software module shall be developed in groups. The guide/supervisor shall clarify that the work done is original & authenticated. 5. 3. 4. The evaluation of the module shall be done as per the common ordinance of UG/PG w. The certificate found to be incorrect at any stage shall attract the proceedings against all the stakeholders. A software module based on the work done in the entire course is to be developed.f. as per the University rules. . consisting of at most two students in a group. The soft copy of the module shall be submitted to the College/Institute till April 30 of the respective semester. The respective college shall depute guide(s)/supervisor(s) under whose supervision the software module shall be developed. 2012–2013 under semester system. 2. Marks: 200 General Instructions: 1.e.43 Bachelor of Computer Applications (Semester – VI) Paper – IV: PROJECT Max.