bca detailed syllabus

29
Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA) DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology D D E E T T A A I I L L E E D D S S Y Y L L L L A A B B U U S S

Upload: mahesh-ugale

Post on 27-Oct-2014

62 views

Category:

Documents


8 download

TRANSCRIPT

Page 1: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

DDDEEETTTAAAIIILLLEEEDDD SSSYYYLLLLLLAAABBBUUUSSS

Page 2: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

PPRROOGGRRAAMMMMIINNGG LLOOGGIICC UUSSIINNGG ''CC'' ((BBCCAA111111))

Module No. Content

Teaching Hours

I

Introduction :History, facilities, concepts, uses , Basic program structure, Header -Files, Comments, A Simple C program, identifiers, basic data types and sizes, Constants, variables, arithmetic, relational and logical operators, increment and decrement operators, conditional operator, bit-wise operators, assignment operators, expressions, type conversions, conditional expressions, precedence and order of evaluation. Decision and loop control structure: Data Input and Output getchar(), putchar(), scanf(), printf(), gets(), puts() functions Control Statements and blocks

14

II

Control Flow if-else, while, do-while, goto, for statements nested control structures, switch, break, continue statements comma operator. Arrays & Functions: Arrays Defining - processing array, ,Introduction to multidimensional arrays , Functions; Types, parameters, prototypes, passing arrays to functions, recursion, passing arguments to a function by value, storage classes, automatic, External, static, register variables in single file environment

13

III

Pointer: Usage Pointers, addresses and types, : Pointer and address arithmetic, pointer operations and declarations, using pointers as function arguments (call by reference),Call by value, Pointer - array duality Strings Arrays of pointers, Pointers to functions, Concept of Dynamic Allocation of Memory, Pre-processor Directives. Other Data Types: Structures, Member accessing, pointers to structures, Structures and functions, Arrays of structures, Unions, enumerations and bit fields, Typedef. File Handling: Introduction of File handling, modes of file handling Uses of fopen , fclose , putc , getc, putw, getw, fscanf, fprintf, ferror functions,

13

Reference Books:

Yashavant P. Kanetkar,( 2007), Let us ‘C’, BPB Publication. 8th.ed. Peter Van der Linden, Schaum's Outline of theory and problems of programming with C,

TMH Peter Van der Linden, Expert C programming, PHI Balagurusamy E., Computing Fundamentals and C Programming, TMH,

Credits: 04 L–T–P: 4–0–0Semester I

Page 3: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

FFUUNNDDAAMMEENNTTAALLSS OOFF CCOOMMPPUUTTEERR && IITT ((BBCCAA111122))

Module No. Content Teaching

Hours

I

Computer Fundamentals: Block structure of a computer, characteristics of computers, Generation of computers, and classification of computers. Number System: Bit, byte, binary, decimal, hexadecimal, and octal systems, conversion from one system to the other. Binary Arithmetic Addition, subtraction and multiplication. Representation of Information, Integer and floating point representation, Character codes (ASCII, EBCDIC, BCD, Excess-3, Grey). Information Concepts & Processing System: Evolution of Information Processing, Date, Information, Knowledge & wisdom. Elements of a computer processing system: Hardware – input-output devices, VDU, CPU storage devices and media, data communication equipment/devices.

14

II

Software concepts: Type of software, translator, compiler, interpreter, assembler, loader. Application Software - Office automation. Programming languages: classification, machine code, assembly language, higher level language, and fourth generation languages. Operating system: Concepts as resource manager, Batch Processing, Multiprogramming, Multiprocessing, Time Sharing , and real time system, DOS: Command interpreter, Booting internal & external commands, batch files, EXE, COM, System files BIN, TXT,BMP files.

13

III

Computer Network and Communication: Network types, Network topologies, Data communication – Mode, Channel, and Media. OSI reference model, TCP/IP. Internet and its Applications: E-mail, TELNET, FTP, World Wide Web, Internet and applications.

13

Reference Books:

P.K. Sinha, (2008), Computer fundamentals, BPB Publisher, New Delhi.4th.ed. Anita Goel ,Computer fundamentals, Pearson Education Peter Nortron, Inside PC, TMH, New Delhi Alexis Leon, Methews Leon, (1999), Fundamentals of Information Technology, Vikas

Publishing.New Delhi.

Credits: 04 L–T–P: 4–0–0Semester I

Page 4: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

IINNTTRROODDUUCCTTIIOONN OOFF LLOOGGIICCAALL CCIIRRCCUUIITT AANNDD DDIIGGIITTAALL DDEESSIIGGNN ((BBCCAA111133))

Module No. Content Teaching

Hours

I

Introduction to Digital Computer, Digital and analog signal, Block diagram of digital computer. Number systems: Data representation - binary, octal, decimal, hexadecimal, conversion from one to another number system. Representation of positive , negative numbers. r’s and r-1’s Compliment, uses of complement, Arithmetic operation on Binary numbers. Binary codes: BCD, ASCII, EBCDIC coding, Gray codes and Excess – 3 codes, alphanumeric representation in ASCII codes. Error-detection codes, even and odd parity.

14

II

Boolean Algebra Logic gates, truth table, logic expression, rules and laws of Boolean algebra, deMorgan's theorems, Boolean axioms. Minterms, Maxterms , Boolean expression in SOP form and POS form , conversion of SOP/POS expression to its standard SOP/POS form. universal gates. Simplifications of Logic equations using laws of Boolean algebra and Karnaugh map (up to 5 variables), Introduction of “Don’t Care” Conditions. Logic circuit implementation of Boolean expression, multilevel NAND and NOR implementation. Combinational circuits: Adder, subtractor, comparator, decoder, encoder, code conversion, multiplexer, demultiplexer, parity bit checker and generators. Parallel binary adder/Subtractor, ROM and PLA.

13

III

Sequential Circuits Flip Flops : Latch, Race around condition, Flip Flops - RS Flip flop using NAND/NOR gates, clocked RS, JK Flip flop, Master slave JK, D Flip flop, T Flip flop, edge triggered flip-flop, conversion of flip-flops, Register: - Definition, shift register with parallel load. Shift Registers: Shift registers function, serial and parallel shift registers, bi-directional shift registers with parallel load. Counters: Asynchronous and synchronous counters, up/down counters, modulo-n counters, BCD counters, a procedure for design of sequential circuit.

13

Reference Books: Morris Mano, (2005), Digital Logic and Computer Design, PHI, New Delhi,2005 R.P.Jain, (2006), “Digital Electronics”, Tata McGraw Hill, New Delhi,3rd.ed.2006 Anand Kumar, (2009), Switching Theory, , PHI Publication, New Delhi.

Credits: 04 L–T–P: 3–1–0Semester I

Page 5: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

RREEMMEEDDIIAALL EENNGGLLIISSHH ((AAHHEE111111))

Module No.

Content Teaching Hours

I

Remedial English : Parts of Speech-Noun--Kinds, Gender, Number, Pronoun--kinds, Adjective--kinds, Verb—kinds, Adverb—kinds, Conjunction, Preposition, Interjection Phrase, Clause—noun clause, adjective clause, adverb clause, Sentence--kinds, Tenses--types, Voice—Active & Passive, Translation

14

II

Listening : What is listening, Importance, Difference between Hearing and Listening, Modes of Listening (Active & Passive), Measures to improve Listening Techniques of Paragraph Writing : Structure of paragraph, Construction of Paragraph; Techniques of Paragraph Writing, Unity; Coherence; Emphasis. Expansion; Definition, Making of Expansion From the Textbook ‘Improve Your Writing’ by V.N. Arora & Lakshmi Chand

1. The Effect of Scientific Temper on Man—Bertrand Russell 2. The Language of Literature and Science—Aldous Huxley

13

III Letter Writing : Letter, Resume & CV, Application Writing. Speaking : Introducing oneself, Pronunciation, Conversation, Basic Social Encounters, Describing events/ places/ experiences/ process

13

Reference Books:

V.N. Arora & Lakshmi Chand, (2006), Improve Your Writing’, Oxford university. press, new Delhi.

Wren & Martin, (2006), English Grammar and Composition, S. Chand publication, New Delhi.

Allen w. Standard, (2005), Living English Structure, Orient Logman,Mumbai,5th.ed.

Credits: 04 L–T–P: 4–0–0Semester I

Page 6: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

MMAATTHHEEMMAATTIICCSS –– II ((AAHHMM111111))

Module No. Content Teaching

Hours

I

Differential Calculus: Successive differentiation, Calculation of nth derivative Expansion of a function of one variable, Leibnitz theorem, Taylor's and Maclaurin's Series, Partial differentiation, Homogeneous function, Euler's theorem. Multiple Integrals: Double and triple integrals (Cartesian and polor Co-ordinates), change of order of integration (simple casses).

14

II

Matrices: Inverse by elementary transformations, rank, (normal form & echelon form), solution of system of simulation linear algebraic equations (Homogeneous & Non-homogeneous both), Eigen values and Eigen vectors, Cayley Hamilton theorem (without proof). Differential Equations: Introduction, Formation, Variables separable and linear form of differential equations of first order and first degree,

13

III

Differential Equations: Linear differential equation of nth order with constant coefficients, Complementary functions and particular Integrals. Convergence and Divergence of infinite series: Leibnitz test, Divergence test, Comparison test, p-test Cauchy's Root test, D' Alembert's Ratio test.

13

Reference Books: H.Kishan, (2005), Sure Success in Convergence, Atlantic Publishers and distributors,

New Delhi. E. Kreyszig : Higher Engg. Mathematics, John Wiley & Sons B.V. Ramanna : Higher Engg. Mathematics, TMH B.S. Grewal , (2006), Higher Engg. Mathematics, Khanna publishers, New Delhi,39th.ed. Chandrica Prasad, (1993), Mathematics for Engineers , Prasad Allhabad. 1st.ed.

Credits: 04 L–T–P: 3–1–0Semester I

Page 7: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

CC PPRROOGGRRAAMMMMIINNGG PPRRAACCTTIICCAALL ((BBCCAA118811))

Module No.

Content Teaching Hours

I

(1) Arithmetic operations a. WAP to perform arithmetic operation over the

variables. b. WAP to calculate area of the circle. c. WAP to find the sum of digits of a number. d. WAP to find the reverse of a string.. e. WAP to implement perimeter of a rectangle

(2) Decision Control Structure a. WAP to find the even & odd number. b. WAP to find greatest among three numbers.

14

II

(3) Loop Control Structure a. WAP to find the factorial of a given number by using

for loop and while loop. b. WAP to check whether the no. is prime or not. c. WAP to print the Fibonacci series. d. WAP to design the following pattern * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *

(2) Function a. WAP to call a function by reference. b. WAP to call a function by value. c. WAP to calculate factorial of a number. d. WAP to print a table of a user define number. e. WAP to generate Fibonacci Series

13

III

(3) Pointer a. WAP to display the contents of 2D array using pointer. b. WAP to sort an array in ascending order using dynamic

memory allocation and pointers. (4) Structure a. WAP to create a structure to print the employee details. b. WAP to create a union book to print the information of book. c. WAP to show the use of enum. (5) File Handling a. WAP to create a file to write a string using getc and putc function. b. WAP that will read a line of file and to copy it to another file.

13

Reference Books: Yashavant P. Kanetkar, (2008), Let us ‘C’, , BPB Publication.New Delhi,8th.ed. Peter Van der Linden, Schaum's Outline of theory and problems of programming with C, TMH. Peter Van der Linden, Expert C programming, PHI. Balagurusamy, Computing Fundamentals and C Programming, TMH.

Credits: 02 L–T–P : 0–0–4Semester I

Page 8: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

WWOORRKKSSHHOOPP OONN CCOOMMPPUUTTEERR HHAARRDDWWAARREE && AAUUTTOOMMAATTIIOONN ((BBCCAA118822))

Module No.

Content Teaching Hours

I

How a Computer System Works? Hardware Configuration, Introduction to basic components of a typical PC, Assembling a PC, Installing Operating System, Basic Trouble shooting during the assembling, Basic troubleshooting of PC, Introduction to various types of cables and connectors used in networking, Introduction to networking and networking concepts, Repeaters, Hubs, Switches, Bridges, Routers, Hubs vs Switches, Installing the NIC Card, MAC Address.

14

II

MS Office XP/2007 (a) MS Word Introduction to MS Word: Menu Bar, Menus, Submenus, Tool Bar, Tools, Customizing Toolbar, Hiding, Toolbar etc, Creating and Saving a documents, Working with an existing documents, Auto Text, Auto Complete and Auto Correct. Formatting a document : Change the appearance of text & paragraph, Copy, paste and paste special functions, Creating and Modifying a list, Change the way each page appears in the document giving stress to line and page break options and orientation, Changing the look of documents with styles. Using Tables and Columns: Table Creation and Modification giving stress to auto-fit, auto-format and table sort. Working with data in table giving stress to formulas, Presenting text in columns, Object Linking and Embedding, Inserting and Sizing Graphics, Hyperlink Envelopes & Label Creation, Grammar & Spell Check, Previewing and Printing Documents.

13

III

(b) MS Excel Introduction to Electronic Spreadsheet and Microsoft Excel : Creating and Formatting a Worksheet, Features of Excel, Inserting and Formatting data in a Worksheet, Working with an existing data list Autofill, Fill Series and AutoComplete Options, Formatting Cells Sorting & Filtering Data, Conditional Formatting, Formulas and Functions(Details usage of important data functions like sum, if, averageetc),Interlinking worksheets and files, Setting Filters and Performing Calculations on filtered data etc. (c) MS Power Point Introduction to Power Point Creating a Presentation: Features of Power Point, - Editing Master Slides, Viewing and Editing a Presentation, Inserting , Sorting, Hiding and Deleting Slides, Inserting Pictures. Clip Art and Movies in a Slide: Creating and Enhancing a Table, - Slide Layouts, Modifying the Slides and Title Master, Adding Transition and Animation Effect, Hyper linking Slides & Files.

13

Reference Books:

Rajaraman V , (2006), Computer fundamentals, PHI Publisher, New Delhi,4th.ed. Anita Goel ,Computer fundamentals, Pearson Education Peter Nortron ,inside PC, TMH, New Delhi P.K. Sinha, (2008)Computer fundamentals, , BPB Publisher, New Delhi,4 th ed.

Credits: 02 L–T–P : 0–0–4Semester I

Page 9: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

DDAATTAA SSTTRRUUCCTTUURREE UUSSIINNGG ''CC''((BBCCAA112211))

Module No. Content Teaching

Hours

I

Introduction: Data, Information, Introduction to Data Structure, Classification data Structure Primitive and Composite Data structure, Time and Space Complexity of Algorithms. Arrays: Characteristics of an array. Definition of an Array, Positional value of a member, Base address of array, indexing of an array, Index variable, Index type. Representation of array (single & multi dimensional arrays), String processing (String operation, Pattern matching Algorithm), Address calculation of array, Insertion and deletion on array, advantages and disadvantage of arrays.

14

II

Stack and Queue: The concept of List Introduction to stack & primitive operation on stack, Stacks application: Infix, post fix, Prefix and Recursion, Introduction to queues, Primitive Operations on the Queues, Circular queue, Dequeue, Priority queue, Applications of queue.

13

III

Linked List, Pointers, Dynamic Memory Allocation, singly Linked Lists, and Operations on linked lists, Insertion and deletion of a node, Introduction to circularly linked lists and doubly linked lists. Trees: - Basic Terminology, Binary Trees, Tree Representations as Array & Linked List, Basic operation on Binary tree, Traversal of binary trees:- In order, Preorder & post order, Application of Binary tree, representation of Binary tree Searching Techniques- Linear and binary search, Merging Algorithms, Sorting- Internal and External, Bubble, Insertion, Selection , Quick, Merge, Radix sorting. File structure

13

Reference Books: Lipschutz & Lipson, (2006), Data Structure using ‘C’ Schaum Series New Delhi. Tanenbaum, (2005), Data Structures Using "C" , Pearson education, new delhi,2nd.ed. Robert L. Kruse , (2005), Data Structures and Program Design in "C" Pearson education, new

Delhi,2nd.ed. Esakov and Weises, (2007), Data Structures: An Advanced Approach Using 'C', PHI

Publication,New Delhi,3rd.ed. D. Samantha , (2006), Classical Data Structure , PHI Publication, New Delhi. R. S. Baluja, Mike Murach, (2006), Data Structure using C & Associates.

Credits: 04 L–T–P : 4–0–0Semester II

Page 10: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

DDAATTAABBAASSEE MMAANNAAGGEEMMEENNTT SSYYSSTTEEMM ((BBCCAA112222))

Module No.

Content Teaching Hours

I

Basic Concepts: Database & Database users, Characteristics of the Database, DBA, Data models, Schema & Instances, DBMS Architecture & Data Independence, Data Base Languages, Data Modeling using the Entity Relationship Approach. Data Models- Relational, Network, Hierarchical.

14

II

File Organization Techniques: Sequential file organization, Index File Organization, Random file organization. Relational model concepts: Relational model constraints, SQL – Data definition in SQL, views and queries in SQL, Specifying Constraints & index in SQL.

13

III

Functional dependencies, normal forms based on primary keys (1NF, 2NF, 3NF & BCNF”), de-normalization, lossless join & dependency preserving decomposition. Concept of object oriented data base, distributed database and client server database.

13

Reference Books: Henry F. Korth Abraham silberschatz, (2006), Database system concepts - McGraw - Hill

International ,New Delhi,5 th.ed. Bipin Desai, (2006), An Introduction to Database System, West Pub. Co. Jeff Parkins and Bryan Morgan, Teach Yourself SQL in 14 days

Credits: 04 L–T–P: 3–1–0Semester II

Page 11: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

OOPPEERRAATTIINNGG SSYYSSTTEEMM ((BBCCAA112233))

Module No. Content Teaching

Hours

I

Basic elements, functions and types of operating system Serial Processing, multi- programmed, Batch System, Time sharing systems. System components, Operating system Services, Interrupts, Interrupt processing. Concept of process, process control block, performance criteria of process, schedulers, CPU scheduling algorithm.

14

II

Memory hierarchy, Cache memory, I/O Communication techniques, Memory management, DMA, command interpreter shell, layer architecture of UNIX, Paging, Segmentation, Segmentation with Paging, Virtual Memory, Demand Paging, , Page Replacement and its Algorithms.

13

III

Semaphores, Classical Problem Of Synchronization, Deadlock Characterizations, Method for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock, Concept of file system, function of file system, access methods, allocation methods, directory system, and protection. Disk Management:, scheduling algorithm

13

Reference Books:

Silberschatz & Galvin,Addison, (2006), Operating System Concepts - Wesley Publication, Singapore,7th.ed.

W. Stallings, (2006), Operating System - Second Edition, Prentice Hall of India. New Delhi, 6th.ed. Harold Lorin, Harvey M. Deitel, (2005), Operating systems -. Addison Wesley. New Delhi, 2nd.ed. M. Naghibzadeh, Operating System. University Press.

Credits: 04 L–T–P: 4–0–0Semester II

Page 12: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

MMAANNAAGGEEMMEENNTT CCOONNCCEEPPTTSS && PPRRAACCTTIICCEESS ((BBBBAA111111))

Module No. Content Teaching

Hours

I

Introduction & Planning Nature of Management: Concept, Nature & Importance Development of Management Thought: Contribution of Taylor and Fayol and their principles Management Process and Skills: Management Functions, Various Levels of Management, SWOT Anlaysis Fundamentals of Planning: Concept, Nature, Importance, Steps in Planning, Decision Making: Concept, Process of Decision Making, Techniques of Decision Making

14

II

Organizing & Staffing Fundamentals of Organizing: Concept, Departmentation, Matrix Organisation Structure Authority: Delegation of Authority, Centralization and Decentralisation Staffing: Concept, Importance, Factors affecting Staffing

13

III

Directing & Controlling Fundamentals of Directing: Concept, Importance, Principles Leadership: Concept, Importance and its theories Fundamentals of Controlling: Concept, Importance, Stages of Control, Essentials of Effective Control System, Causes of Resistance to Control

13

Reference Books:

L M Prasad, (2008), Principles and Practice of Management, , Sultan Chand & Sons., New Delhi, 7th.ed.

C B Gupta, Management Concept & Practices, Sultan Chand & Sons. Horold Koontz and Iteinz Weibrich, (2006), Essential of Management, McGraw hills

International, New Delhi,6th.ed. Tripathi, Reddy, Principles of Management, Tata McGraw Hill.

Credits: 04 L–T–P: 4–0–0Semester II

Page 13: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

MMAATTHHEEMMAATTIICCSS ––IIII ((AAHHMM111122))

Module No. Content Teaching

Hours

I

Set Theory, Relations, order relation, binary operation, modulo system and functions. Groups, abelian groups, semi-groups and monoids, subgroups, permutation group.

14

II Cyclic groups, isomorphism, homomorphism, automorphism, cosets and Lagrange’s theorem, normal subgroup, Cayley’s Theorem.

13

III Definition and examples of rings, integral domain, fields, Skew fields, Vector Space, Sub Space, Linear dependence and independence.

13

Reference Books:

G. C. Sharma ,(2008), Modern Algebra, Shiv Lal & Sons., Agra. J.A. Gallian : Contemporary Abstract Algebra, Narosa pup. House Hoffman and Kunj , Linear Algebra, PHI A.R Vashishtha, (2007), Modern Algebra, Krishna Publications,Meerut,53rd.ed. Sachaum’s Series , Linear Algebra

Credits: 04 L–T–P: 3–1–0Semester II

Page 14: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

DDAATTAA SSTTRRUUCCTTUURREE UUSSIINNGG ''CC'' PPRRAACCTTIICCAALL ((BBCCAA119911))

Module No.

Content Teaching Hours

I

1. Accessing the elements of linear array. 2. Copying the elements from one array in to another array. 3. Merging two arrays in to one array. 4. Counting the no of characters, spaces and vowels in String. 5. To check the String is palindrome or not. 6. To check two strings are equal or not. 7. To reverse the String. 8. To change the case of the String. 9. To replace the character by another character in string. 10. To Accept a String and display its substring

(Accept parameters from user) ex. Substr (str,start_pos,no_of_chars)

14

II

1. Stack Operations (Push, Pop and Display) 2. Queue Operations - a. Insertion b. Deletion c. Displaying 3. Circular Queue Operations - a. Insertion b. Deletion c. Displaying 4. Doubly Ended Queue - a. Insertion b. Deletion c. Displaying

13

III

1. Use of calloc, malloc and free function. 2. Linked List Operations

a. Add at first b. Add at last c. Add at position d. Delete from first e. Delete from last f. Delete from position

g. Displaying 3. Circular Linked List

a. Add at first b. Add at last c. Add at position d. Delete from first e. Delete from last f. Delete from position g. Displaying

4. Doubly Linked list a. Add at first b. Add at last c. Add at position d. Delete from first e. Delete from last f. Delete from position g. Displaying a. Searching - Linear search b. Binary Search

5. Sorting a. Insertion Sort b. Bubble Sort c. Selection Sort d. Merge Sort e. Quick Sort f. Radix Sort

13

Reference Books:

Lipschutz & Lipson, (2006), Data Structure using ‘C’ Schaum Series New Delhi. Tanenbaum, (2005), Data Structures Using "C" , Pearson education, new delhi,2nd.ed. Robert L. Kruse , (2005), Data Structures and Program Design in "C" Pearson education,

new Delhi,2nd.ed. Esakov and Weises, (2007), Data Structures: An Advanced Approach Using 'C', PHI

Publication,New Delhi,3rd.ed. D. Samantha , (2006), Classical Data Structure , PHI Publication, New Delhi. R. S. Baluja, Mike Murach, (2006), Data Structure using C & Associates.

Credits: 02 L–T–P : 0–0–4Semester II

Page 15: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

SSPPOOKKEENN EENNGGLLIISSHH ((AAHHEE118833))

Module No. Content

Teaching Hours

I

Hurdles of the Path and Route Map Language Drills: Singular & Plural, countable & uncountable, Parts of speech, Tense-shift Routine Expressions: Greetings, Introducing yourself and others, Query—formal/informal, Replies-Positive, Neutral and Negative, Expressing surprise, regret, apology, seeking information. Tenses through simple presentations: Present: Introduction, Routine, My City, My Value System etc. Past: Describing events—marriage party, picnic, conference etc. Experience, Process, Movie Future: Goal of my life, India of my dreams etc. We will have to return to our roots, Cloning will make us immortal Technological Advancement: Man is on the verge of becoming Machine/God.

14

II

Virtual Speaking Extempore: 1 minute description of objects in the room. Picture Description: Flow of the idea, organization of the message, Crowded Pictures, Abstract Pictures (modern art etc.) Open ended-relationship based:

i. Mother (in Business suit) rushing outside while child is crying, goods in home are scattered

ii. Sibling Fight iii. Joint family—having fun

Cook a Story: ways of developing in prose, Jumbled Pictures, One person-one sentence, Tie-up the loose threads

13

III

Rapid Vocabulary & its Usage: Roots & word formation, commonly misused words, words with shades of meaning, Phrasal Verbs, Terms used as Noun & Verb, Noun & Adjectives. Speak Well: Ambiguity in conversation/comment, Reason & ways to root it out, commonly mispronounced words Phonetic symbols/ Pronunciation Drills Comprehension and Conversation Listening: Active & Passive listening; listening with Empathy, Listening Comprehension Reading Comprehension (pre-discussion and Post discussion) Telephonic Conversation: Greetings, putting the phone on hold, inquiry about the caller. Simple Role Play

13

Reference Books:

Balan. Spoken english. New Delhi: Tata McGraw Hill Allen, (2005), W S. Living english structure. New Delhi: Orient Longman Pvt. Ltd., Mumbai, 5th.ed. Martin, H. & Waren, (2006), P. C.English grammar & composition. S. Chand & Co. New Delhi.

Credits: 04 L–T–P: 0–0–4Semester II

Page 16: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

OOBBJJEECCTT OORRIIEENNTTEEDD PPRROOGGRRAAMMMMIINNGG && CC++++ ((BBCCAA221111))

Module No. Content Teaching

Hours

I

Fundamentals of object oriented programming – procedure oriented programming Vs. object oriented programming (OOP) Object oriented programming concepts – Classes, Objects, encapsulation, Inheritance, polymorphism, dynamic binding, message passing, Abstraction. Benefits and applications of object oriented programming. Basic of C++: What is C++, applications of C++, Structure of C++ program, data types and declaration, Tokens, keywords, identifiers, basic data types, users defined data types, type compatibility, declaration of variables, dynamic initialization of variables, reference variables, scope resolution operators, member dereferencing operators, memory management operator, operator precedence control structures. Functions in C++:- Defining a Function, return Statement, Types of Functions, Actual and Formal arguments, Local and Global Variables, Default Arguments, Multifunction Program, Storage Class Specifies, Recursive Function, Preprocessors Header Files, Standard Functions. Function prototyping, call by reference, inline function, function overloading.

14

II

Classes and Objects: Creation, accessing class members, Private Vs Public, Objects, Member Functions , Method definition’ static data members, static member functions, arrays of objects, Constant member functions, Overloading Member Functions ,Friend functions, this pointer. Constructor and Destructor, copy constructors, dynamic constructors. Need of operator overloading, prefix and postfix, overloading binary operators, unary operator Overloading, overloading array operators, new & delete operators, comparison between structures and classes, Inheritance: Introduction, derived classes, types of inheritance (single, multiple, multilevel, hierarchical, hybrid), Visibility modes, virtual base classes, abstract classes, constructors to derived classes, private, protected inheritance, container classes.

13

III

Virtual Functions: Introduction, pure virtual function, virtual function in derived classes, object slicing. Polymorphism: I/O in C++: C++ stream, unformatted & formatted console I/O operations, managing o/p with manipulators. Advanced Features:, friend classes, over loading<<and>> operator templates function & class templates, exception handing, over riding. Output and input class streams, Ostream, Istream, File handling.

13

Reference Books: E. Balaguruswamy, (2006), Object Oriented Programming in C++ , TMH Publishing Co. Ltd..New

Delhi,4th.ed. Jense Liberty Tim Keogh, C++: An introduction to programming : BPB Publications, New Delhi Robert Lafore, (2006), OO Programming in C++: , Galgotia Publications Pvt. Ltd., Daryaganj, New

Delhi. Sanjeev Sofat, Object Oriented Programming Using C++, , Cyber Tech. Publication, New Delhi Stephen Parata, (1996) C++ Primier by, TMH Publishing Co. Ltd., New Delhi.1st.ed.

Credits: 04 L–T–P: 4–0–0Semester III

Page 17: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

MMIISS && EE--CCOOMMMMEERRCCEE ((BBCCAA221122))

Module No.

Content Teaching Hours

I

MIS: Introduction. System Implementation MIS frame work. Importance, Concepts, Management, information system. Definition, IT, Nature & Scope. Characteristics, function, Structure & Classification: Physical Components, processing functions, decision support, classification of MIS, DSS, ESS, OAS, RES, various information system. Decision making and MIS: Types, Level, Utility

14

II

Management of Information system: Implementation, planning, organization &development, user training, testing, changeover, procedures, evaluation. Information System Planning: Mission, objectives, strategies, policies, resource allocation, project planning.

13

III

Introduction: Elements of e-com, Types, Advantages & Disadvantages of e-com E-Business: E-Business Vs E-Commerce, EDI Electronic Payment System: Electronic payment system – Overview , Electronic or digital cash , Electronic Checks-Benefits , Online credit card based system , Debit card, Smart Cards. Security and Application: Need of computer security, Security strategies, Firewalls And Network security, Types of Firewalls, Transaction Security, Cryptography, Public key encryption, Private key encryption, Digital signatures,. Digital Certificates, Secure Electronic Transaction (SET).

13

Reference Books:

Ravi Kolkata & A.B. Whinstone, (2006), Frontiers of Electronic Commerce, Pearson Education, New Delhi.

W.S Jawadekar, (2007), Management Information Systems - TMGH, New Delhi.3rd.ed. Bharat Bhaskar, (2007), Electronic Commerce, Framework Technologies and Applications, Tata

McGraw Hill ,new delhi,2nd.ed. Agrawal Kamlesh, N and Agarwala Deeksha, Introduction to the E-Com., Macmillan India

Credits: 04 L–T–P: 4–0–0Semester III

Page 18: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

CCOOMMPPUUTTEERR OORRGGAANNIIZZAATTIIOONN AANNDD AARRCCHHIITTEECCTTUURREE ((BBCCAA221133))

Module No. Content Teaching

Hours

I

Introduction to computer organization and computer architecture: Introduction, Von-Neumann and Harvard architecture. Register transfer language, Register Transfer, Bus and memory transfer. Micro operations-Arithmetic, Logic micro operations and shift micro operations. Macro operations. Instruction code, Computer Registers, Computer Instructions, and Instruction types- memory reference instructions, input-output, Instruction Cycle, Timing and control, Interrupts and types of interrupt, Interrupt Cycle.

14

II

Introduction to CPU, General register organization, stack organization, Instruction formats, addressing modes, RISC vs CISC. Parallel processing, Applications, pipelining- arithmetic pipeline, instruction pipeline, Pipeline difficulties and resolution, Vector processing and its applications. Flynn’s Classification. Control unit, micro-programmed control, data path design, bus organization.

13

III

Peripheral devices, input output interface, asynchronous data transfer, modes of transfer- programmed I/O, interrupt I/O, Direct memory access(DMA). Memory hierarchy, Cache memory-Locality of references, Types of cache, Characteristics, Mapping of Cache, Cache coherency problem.

13

Reference Books:

M. Morris Mano, (2007), Computer System Architecture, Publication- PHI, New delhi,3rd.ed. Carl Hamacher, (2002), Computer Organization Author Publication- McGraw Hill, New Delhi,

5th.ed. John P. Hayes, (1998), Computer Architecture and Organization Author- Publication-McGraw-Hill.

New Delhi ,3rd.ed.

Credits: 04 L–T–P: 3–1–0Semester III

Page 19: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

DDIISSCCRREETTEE SSTTRRUUCCTTUURREE && GGRRAAPPHH TTHHEEOORRYY ((BBCCAA221144))

Module No. Content Teaching

Hours

I

Propositions – Logical connectives , Compound propositions , Conditional and biconditional propositions, Truth tables , Tautologies and contradictions, DeMorgan’s Laws , Rules of inference, Validity of arguments. Predicates –Quantifiers, Universe of discourse, Logical equivalences and implications for quantified statements, Theory of inference, the rules of universal specification and generalization Validity of arguments.

14

II

Graphs – Introduction, Sub graphs, Isomorphism, Walks, Paths, Circuits Connectedness, Components, Euler Graphs, Hamiltonian Paths and Circuits Trees – Properties of trees, Distance, Centers, radius and eccentricity in Tree, Rooted and Binary Trees. Incidence matrix Circuit Matrix, Path Matrix, Adjacency Matrix. Spanning tree – Finding all Spanning Trees of a Graph, Set of Fundamental Circuits, Cut Vertices, Dijkstra’s Algorithm, Prim’s Algorithm, Kruskal’s Algorithm

13

III

Introduction to Recurrence Relation, Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions, Generating functions, Solution of recurrence relation by the method of generating functions

13

Reference Books:

Satendra Bal Gupta, (2008), Discrete Mathematics , Laxmi publication. New delhi. D.K. Gupta ,Discrete Mathematics , KNRN Publishing, Delhi. Narsingh Deo Graph Theory, PHI, New Delhi. Adesh K. Pandey, S.K. Kataria, (2007), Discrete structure, Sons Publishing, New Delhi.

Credits: 04 L–T–P: 3–1–0Semester III

Page 20: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

ENVIRONMENTAL STUDIES (AHS113)

Module No. Content

Teaching Hours

I

Introduction & Concept of Ecosystem Environment- Definition, Scope, Importance Natural Resources Forest Resources- Use & over-exploitation, deforestation, timber extraction, mining, dams & their effects on forest & tribal people Water Resources, Mineral Resources, Food Resources, Energy, Land Resources, Ecosystem- Concept, Structure & function, Producers, Consumers & decomposers. Energy flow in the ecosystem Ecological succession, Food chains, food webs & ecological pyramids

14

II

Types of Ecosystem & Environmental Pollution Introduction, types, characteristics, features, structure & functions of - Forest ecosystem, Grassland ecosystem, Desert ecosystem & aquatic ecosystems- ponds, streams, lakes, rivers, oceans, estuaries Definition, Causes, effects & control measures of – Air pollution, water pollution, land/ Soil pollution, Marine pollution, Noise pollution, thermal pollution, Nuclear Hazards Solid Waste Management- Causes, effects & control Measures of urban & industrial wastes Disaster Management- floods, earthquake, cyclone & landslides

13

III

Human Population & The Environment, Social Issues & The Environment Population Growth, Variation among nations Population explosion- Family Welfare programme, Environment & Human Health, Human rights. Value education, HIV/AIDS, Women & Child Welfare Role of Information Technology in Environment & Human Health From unsustainable to sustainable development, Urban problems related to energy Climate Change- Global Warming, Acid Rain, Ozone layer depletion, nuclear accidents & holocaust Water Conservation, Rain Water harvesting, Watershed Management Environmental Protection Act, Air (prevention & control of pollution) Act, Water (prevention & control of pollution) Act, Wildlife Protection Act, Forest Conservation Act

13

Reference Books: K.M. Gupta, (2009), Environmental Studies, Umesh Publications,New delhi,2nd.ed. Prof. Devendra S. Bhargava, (2005), Foundation of Environmental Studies, Galgotia Publications

Pvt. New Delhi,1st.ed. S. Deshwal & A. Deshwal, (2010), Environmental Ecology, Dhanpat Rai & co. New Delhi. M. Anji Reddy, (2008), Textbook of Environmental Science & Technology, BS Publications,

Hyderabad.

Credits: 04 L–T–P : 4–0–0Semester III

Page 21: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

CC++++ PPRROOGGRRAAMMMMIINNGG PPRRAACCTTIICCAALL ((BBCCAA228811))

Module No.

Content Teaching Hours

I

1. Write a program to swap two values a) Using Third variable b) Without using third variable 2. W.A.P. to enter three subject marks and calculate the grade on the basis of

following conditions: Per grade >85 S >=75 A >=65 B >=50 C <50 Fail

3. WAP to convert the temperature from Fahrenheit to Celsius and vice versa through class and object.

4. WAP to calculate the total amount of telephone bill on the basis of following conditions No. of Calls Total Amount <=100 1 Rs. /call <=200 Rs 100(100 Calls)+ Rs. 2 (Rest calls) <=300 Rs.300(200 calls)+ Rs. 3(rest calls) >300 Rs.600(300 calls)+ Rs. 4(rest calls)

5. WAP to calculate the area of circle and rectangle using Function overloading

14

II

6. WAP to create a class employee to print the detail of employees using objects. 7. WAP to addition and subtraction of two values using Constructor 8. WAP for parameterized constructor by using two objects. 9. WAP for parameterized constructor by using one objects. 10. WAP for Constructor Overloading. 11. WAP for copy Constructor. 12. WAP to overload Unary operator. 13. WAP to overload Binary operator. 14. Friend Function: Program to access the member of one class 15. Operator Overloading: Unary & Binary operator overloading with friend function 16. Program of Simple inheritance 17. Program of Hierarchical Inheritance. 18. Program for Hybrid Inheritance.

13

III

19.WAP to use the same function name in Inheritance using Virtual Function 20. WAP to show the use of various manipulators. 21. WAP to show the use of different IOS class Functions For formatting of output. 22.WAP to create the Template Function & classes 23.WAP to use Try & Catch Function in Exception Handling

13

Reference Books: E. Balaguruswamy, (2006), Object Oriented Programming in C++ , TMH Publishing Co. Ltd..New

Delhi,4th.ed. Jense Liberty Tim Keogh, C++: An introduction to programming : BPB Publications, New Delhi Sanjeev Sofat, Object Oriented Programming Using C++, , Cyber Tech. Publication, New Delhi Stephen Parata, (1996) C++ Primier by, TMH Publishing Co. Ltd., New Delhi.1st.ed.

Credits: 02 L–T–P: 0–0–4Semester III

Page 22: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

SSOOFFTT SSKKIILLLLSS –– II ((AAHHEE228811))

Module No.

Content Teaching Hours

I

Introduction: What are Soft Skills, Hard Skills, What is preferred over the other: A case study, Requirement & Significance in professional and personal spheres of life. Communication Skills: Important factors in Communication: purpose of communication Breaking the ice; Thought process; Linguistic competence; overcoming the tentative barriers Linguistic Performance: Face to Face conversations; Telephonic conversation; Role play activities; Describing common objects and daily incidents; Interpreting pictures and documentaries; American and British vocabulary; Error analysis Paralanguage skills: Overcoming mother tongue interference, neutralization, phonetics, stress, pitch, intonation, volume, rate of speech; American and British accents

14

II

The Art of Presentation: Meaning and importance of presentation, Analyzing Different types of Presentation, How to make an effective presentation, Body Language, Understanding Kinesics, Proxemics, Gestures, Eye contact in a presentation. Extemporaneous Presentation. Analyzing the importance of presentation strategies in our life through the study of various case studies

13

III

Group Discussions, Concepts of G.D.: Confidence, Self Awareness through Introspection, Skills of Communication: Structured G.D, Unstructured G.D, Case Study, Important tips for an Effective G.D Participation, How to give a Good Impact in a G.D Role Play

13

Reference Books:

Cook, S. The Effective Manager( e-book). IT Governance Publishing Lesikar, R. V., & Pettit J. B..Business Communication: Theory and Application. New Delhi: All India

Traveler Book Seller. Pillalamarri, J. K. , Management of Soft Skills Chennai: Schitech Publications. Poyatos, F. Non Verbal Communication Across Disciplines, University of New Brunswick. Rao, M.S. & Ramana, P.S.V., Soft Skills for Better Employability. ICFAI University Press.

Credits: 02 L–T–P : 0–0–4Semester III

Page 23: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

GGUUII BBAASSEEDD PPRROOGGRRAAMMMMIINNGG UUSSIINNGG VVIISSUUAALL BBAASSIICC ((BBCCAA222211))

Module No. Content Teaching

Hours

I

Visual Programming overview and environment : Graphical User Interface , need of Visual Programming , Event Driven Programming , Integrated Development Environment (Menu Bar, Title bar, tool bar ,tool box and Various types of windows) , Understanding Properties, Methods and Events, Types of events , Customize forms with its events, methods and properties, Basic ActiveX controls - Command Button, Text Box, Label, Check Box and Option Button and Frame.

14

II

Program Elements and Controls : Variables, Constant , Operators ,Data Types, Statements in VB, Procedures, User defined functions, In-Built functions, Customizing focus , Array - static and dynamic, Image control, Picture Box ,List Box, Combo Box , HScrollBar, VScrollBar, DriveListBox, DirListBox, FileListBox, Timer, Shape , Line, OLE Control and Trapping run time errors.

13

III

Database Controls and Connectivity : Dialog Boxes - Inputbox(), Msgbox() and Common Dialog Boxes ,Modules, SDI, MDI and EDI , Menu Editor, OLE concepts , usage of COM & DCOM, Accessing Data Using Data Access Objects, Data Control, ADODC control and Grid Control

13

Reference Books:

Evangelos & Petroutsos, (2005), Mastering Visual Basic 6 - BPB Publication. New Delhi,1st.ed. Gary Cornell, (2005), Visual Basic 6 - Tata McGraw Hill,New Delhi,20th.ed. Noel Jerke - Visual Basic 6 (The Complete Reference) - Tata McGraw Hill, New Delhi Eric A. Smith (1998), Visual Basic 6 Programming Bible - Wiley India, New Delhi.

Credits: 04 L–T–P : 4–0–0Semester IV

Page 24: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

SSYYSSTTEEMM DDEESSIIGGNN && SSOOFFTTWWAARREE EENNGGIINNEEEERRIINNGG ((BBCCAA222222))

Module No. Content Teaching

Hours

I

Introduction: System, Components, characteristics, Types of systems, SDLC. Software characteristics, Software Crisis, Software engineering definition. Software life cycle models, Waterfall, Incremental, Iterative enhancement, Prototype, RAD and Spiral Models. Software Requirements analysis & specifications: Requirement engineering, requirement, elicitation techniques like FAST, QFD, requirements analysis using DFD, Data dictionaries & ER Diagrams, Decision tree, Decision table, Requirements documentation, SRS.

14

II

Software Project Planning: Size Estimation like lines of Code & Function Count, Cost Estimation Models: - COCOMO (Basic, Intermediate and detailed), Putnam resource allocation model, Software Risk Management. Software Design: Cohesion & Coupling, Classification of Cohesiveness & Coupling, Function Oriented Design, Object Oriented Design, Structure chart. Coding: - Coding style, correctness of coding. Software Metrics: Software measurements, Token Count, Halstead Software, Measures.

13

III

Software reliability & quality: -Introduction of Mc Call’s & Boehm’s quality model, Capability maturity models, Software reliability models - Basic execution time model and logarithmic Poisson execution time model. Software Testing: Testing Process, Design of Test Cases, Types of Testing, Functional Testing, Structural Testing, Test Activities, Unit Testing, Integration Testing and System Testing. Software Maintenance: Management of Maintenance, Maintenance Process, and maintenance cost estimation-Belady and Lehman model, Boehm model. Regression testing, Software Configuration Management. Implementation, Introduction to Reengineering and Reverse engineering.

13

Reference Books:

P Jalote, (2006), Integrated Approach To Software Engineering, , Narosa Book Distributors Pvt Ltd, New Delhi,3rd.ed.

K. K. Aggarwal & Yogesh Singh, (2008) “Software Engineering”, New Age International, 3rd. Ed. R. S. Pressman, (2001), “Software Engineering – A practitioner’s approach”,., McGraw Hill Int.

5th Ed. Stephen R. Schach, (1996), “Classical & Object Oriented Software Engineering”, IRWIN. James Peter, W. Pedrycz, “Software Engineering: An Engineering Approach”, John Wiley &

Sons. I. Sommerville, (2004), “Software Engineering”, Addison Wesley, New Delhi, 7th.ed.

Credits: 04 L–T–P: 3–1–0Semester IV

Page 25: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

CCOOMMPPUUTTEERR GGRRAAPPHHIICCSS && MMUULLTTIIMMEEDDIIAA TTEECCHHNNIIQQUUEESS ((BBCCAA222233))

Module No. Content Teaching

Hours

I

Introduction to Computer graphics : Types of computer graphics, application area, Graphics display devices-CRT, raster-scan device, random scan device, Color CRT monitors-beam penetration and shadow-masking, Direct view storage tubes, Flat-panel displays-emissive and non-emissive, Character-generation method, Frame-buffer, Color-lookup table.

14

II

Interactive input and output devices, Logical classification of input devices, Interactive -techniques-Echoing, point-plotting, inking, rubber-band, dragging, painting and drawing. Line-drawing algorithms- DDA and Brasenham’s line drawing algorithms, Mid-point circle algorithm, Transformation-translation, rotation, scaling, and reflection. Polygon: Inside and outside test of polygon.

13

III

Windowing and clipping-window, viewport, viewing transformation, line clipping-Cohen-Sutherland algorithm, polygon clipping-Sutherland and Hodgeman algorithm, Curve clipping, text and exterior clipping. Introduction to Multimedia, Multimedia Information, Multimedia Objects, Multimedia application, Multimedia hardware, Memory & storage devices, presentation tools, video, sound, image capturing, authoring tools, card and page based authoring tools. Introduction about Digital representation of sound, Musical Instrument and digital interface (MIDI), digital Video and image compression, JPEG image compression, DVD technology.

13

Reference Books:

M. Pauline Baker and Donald Hearn, (2006), Computer Graphics , Pearson, New Delhi,2nd.ed. Tay Vaughan, (2005), Multimedia-Making it works, Mc GrawHill, New Delhi,7th.ed. Steven Harrington, (1987), Computer Graphics: McGraw Hill, New Delhi,2nd.ed. David F. Rogers, (1997), Procedural Elements for Computer Graphics : Tata McGraw Hill,

New Delhi,2nd.ed.

Credits: 04 L–T–P : 4–0–0Semester IV

Page 26: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

ORGANIZATIONAL BEHAVIOR(BBA112)

1.

Module No. Content

Teaching Hours

I

Introduction: Meaning & Nature of Organizational Behaviour, Contributing Disciplines, Organizational Models, Challenges & Opportunities of OB. Personality: Meaning & Importance, Determinants of Personality. Perception: Meaning, Perceptual Process, Factors influencing Perception, Perceptual Distortion. Attitude: Meaning, Components, Factors in Attitude Formation

14

II

Learning: Meaning, Factors affecting Learning, Theories of Learning Motivation: Meaning & Concept, Primary & Secondary Motive, Theories, Concept of Morale. Group Dynamics- Formal & Informal Groups, Stages of Group Development, Group v/s Team, Types of Team, Creating Effective Teams, Group Decision Making.

13

III

Conflicts: Concept & Meaning, Different Levels of conflict, Conflict Resolution. Stress: Potential Sources, Consequences & Coping Strategies. Organizational Change: Concept, Resistance to Change, Overcoming Resistance to Change. Organizational Development: Concept & Characteristics of OD, Benefits & Limitations of OD.

13

Reference Books:

Stephen P. Robbins, (2005), Organizational Behavior, Pearson Education, New Delhi,11th.ed. L M Prasad, (2008), Organizational Behavior , Sultan Chand & Sons , New Delhi,4th.ed. Udai Pareek, (2009), Understanding Organizational Behavior, Oxford, New Delhi,2nd.ed. Fredrick Luthans, (2005), Organizational Behavior, Tata McGraw Hill, New Delhi,10th.ed.

Credits: 04 L–T–P: 4–0–0Semester IV

Page 27: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

NNUUMMEERRIICCAALL AANNDD SSTTAATTIISSTTIICCAALL TTEECCHHNNIIQQUUEESS ((AAHHMM221111))

Module No.

Content Teaching Hours

I

NUMERICAL TECHNIQUES I : Solution of Algebraic & Transcendental equations : Bisection, Regula – Falsi, Newton – Raphson methods and their order of convergence. Interpolation : Finite differences, Relation between Operators, Missing Term Technique, Newton forward and backward difference interpolation formulae, Lagrange’s interpolation formula, Newton’s divided difference formula.

13

II

NUMERICAL TECHNIQUES II : Numerical Integration: Newton – Cote’s Quadrature formula, Trapezoidal rule, Simpson’s 1/3rd and 3/8th rules, Boole’s ,Weddle’s rule. Numerical solution of Ordinary Differential Equations : Picard, Euler, Improved Euler, Modified Euler and Runge – Kutta IV order method.

13

III

STATISTICAL TECHNIQUES : Curve – fitting : Method of Least squares, Fitting of straight lines, polynomials and exponential curves etc. Correlation, Linear regression analysis, Binomial, Poisson and Normal distributions. Testing of Hypothesis : Sampling, Level of significance, Type I and II errors, t – test, 2 test as a goodness of fit and as a test of independence.

14

Reference Books:

1. Goyal M. : Numerical Methods and Statistical Techniques using C, Laxmi Publications 2. Jain, Iyenger, Jain: Numerical Methods for Sci. & Engg. Comput., New Age International 3. Sastry S.S. : Introductory methods of Numerical Analysis, PHI 4. Conte, de Boor : Elementary Numerical Analysis - An Algorithmic Approach, TMH 5. Gupta and Kapoor : Fundamentals of Mathematical Statistics, Sultan Ch. & Sons

Credits: 04 L–T–P : 3–1–0Semester IV

Page 28: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

VVIISSUUAALL BBAASSIICC PPRROOGGRRAAMMMMIINNGG PPRRAACCTTIICCAALL ((BBCCAA229911))

Module No.

Content Teaching Hours

I

1. WAP that will change caption, fore colour, back colour, font style of a text by using textbox and command button.

2. WAP that will change the caption and interchange the position of two command buttons.

3. WAP that will change different text in a label control by using option controls, frame and command button.

4. WAP that will calculate the following a. sum of individual digit of a given number. b. display number of even and odd digits of a given number.

5. WAP that will accept two Positive numbers and find their Greatest Common Divisor(GCD).

6. WAP that will print the series of prime number up to the given limit on a form. 7. WAP that will change the font style and fore colour of a text by using textbox,

checkbox and frame control.

14

II

8. WAP that will Display the ASCII Chart with its Character and ASCII value in a listbox.

9. WAP that will calculate the factorial of the given no. by using function(i.e. call by Value)

10. WAP that will check a input number is palindrome or not(without using In-built function strReverse).

11. WAP that will check frequency of desired character in a input string. 12. WAP that will sort an array. 13. WAP that will print the sum of diagonal elements of a matrix. 14. WAP that will print the sum of each column of a matrix. 15. WAP that will perform following functionalities by using two List boxes.

a. Add items in the both List boxes b. Remove Selected Items from both List box C. Remove all items from List boxes. d. Move selected items from one List Box to another List Box .

16. WAP for a Simple calculator that will perform +, - , / , * 17. WAP that will display different pictures one by one by using timer control. 18. WAP that will extract the first, middle and last name from the textbox and print the

extracted names in a picture box. 19. WAP that will display the pattern of files in FileListBox by using Drive, DirList,

FileListBox , Combo and Textbox control.

13

III

20. WAP that will change the back ground coour of a form by using menu editor. 21. WAP that will perform following operations by using common dialog control

a. Open a file. b. Save a file. c. modify the font, font style, size of a text. 22. WAP that will perform following operations by using data control and dataGrid

control. a. Display all records of a table. b. Search a particular record and display it in DataGrid control.

23. WAP that will add, update and delete records from a database by using data control.

24. WAP that will demonstrate the methods of recodrest.

13

Reference Books: Evangelos & Petroutsos – Mastering Visual Basic 6 - BPB Publication. Gary Cornell - Visual Basic 6 - Tata McGraw Hill Noel Jerke - Visual Basic 6 (The Complete Reference) - Tata McGraw Hill Eric A.Smith - Visual Basic 6 Programming Bible - Wiley India .

Credits: 02 L–T–P : 0–0–4Semester IV

Page 29: BCA Detailed Syllabus

Department of Computer Engineering & Applications (w.e.f. Session 2011-12) Bachelor of Computer Applications (BCA)

DEPARTMENT OF COMPUTER ENGINEERING & APPLICATIONS, Institute of Engineering & Technology

SSOOFFTT SSKKIILLLLSS –– IIII ((AAHHEE228822))

25.

Module No.

Content Teaching Hours

I

Behavioral Skills: Leadership: Self development, Interpersonal development, Group organizational development, Essential skills: leader’s opinion vs. people’s opinion: A comparative study, Effective communication: a tool to leadership, Factors affecting leadership, Motivation, Team Sprit. Time Management: What is time management, Importance of Time in the professional world, challenges, Identifying priorities, prioritizing priorities, multitasking ,Time management and Pressure handling, Conflict Handling: What is conflict? , Characteristics, advantages and drawbacks, perception and prejudices, Understanding people, facilitating effective conflictive resolution, functional Strategies, Reward and Punishment.

14

II Introducing yourself in the Professional World, Meaning and Importance of Professional Communication, Communication Vs. E Communication, E mail Etiquettes, Drafting Effective Letters.

13

III Interviews: What is interview? Various types of Interviews, Tips for preparing Interviews, Drills required for Interviews Mock Interviews

13

Reference Books:

Gopalswami, R., Mahadevan, R. The ACE of Soft skills: Attitude, Communication and Etiquette for Success: Dorling Kindersley (India) Pvt. Limited of Pearson Education.

Yate, M. Hiring the Best: A Manager’s Guide to Effective Interviewing and Recruiting. Adam’s Media

Glen, P. Leading Greeks: How to Manage and Lead the people to deliver Technology. San Francisco: Jossey-Bass.

Denson, L. K. The Power of E Communication. HRD Press.

Credits: 02 L–T–P : 0–0–4Semester IV