We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 41
Vikram University, Ujjain ~ BCA Syllabus (w.e. onwards)
BCA-Part-I Semester Wise Scheme tooo
Courses of Studies for BCA-1 Year
Semester — I (Theory : 300, Practical : 100)
‘Gourse : | Theory | Pra Max. | Min
Max. Max. | Marks | Marks
Marks | Marks |
| BCA-10Y Frtreduction—to—tnformation 50 cea |e 50) 7
Teshnology FOCS 4 TT _
BCA-102 Programming and Problem |! 50 50 7
Solving in C _
BCA-1Q3-Mathematical Foundations of | 50 > 30 7
Computer Science =
BCA-104 PC Packages 30 | 30 7
BCA-10S$-~— Accounting and Financial 50 50 7
Management _ _
BCA-106 Communication Skills-1 30 250 7
BCA-107 Practical-I ( Based on BCA- > 30 30 17
102)
BCA-108 Practical-Il ( Based on BCA- 30 50 i7
104) IE
Total Marks 300 100 {400 :
Semester - Il ( Theory : 300, Practical : 100)
‘Course Practical |
Max. Max. |
Marks_| Marks
BCA-201 Operating Systems 30 =
BCA-202 Advanced Programming in C 50
with UNIX/ LINUX
BCA-203 Digital Electronics
30
BCA-204 Object Oriented
Programming Methodology with C++_
50
BCA-205 - Data Base Management
| systent
50
BCA-206 Principles of Management &
Managerial Economics
30
BCA-207 Practical-I( Based on BCA” |
202)
BCA-207 Practical-I (Based on BCA-
204)
Total Marks
Seaton TUVikram University, Ujjain - BCA Syllabus (w.e.
BCA-Part-II Se
mester Wise Scheme
Courses of Studies for BCA-II Year
Semester — III ( Theory : 300, Praetical :
| Course
100)
BCA-302 Internet and E-Commerce
BCA-303 Information System Design
and Implementation
BCA-304 Data Communication and
| Computer Networks nes
“BCA-305 Computer Graphics & |
| Multimedi it ae
BCA-306 Communication Skills —I1_
‘BCA-307-Practical-I (Based on BCA
(301)
BCA.308-Practical-II (Based on BCA-
(305)
Semester — IV (Theory : 300, Practical :
‘Course
BCA
Basic
Programming with Visual|
BCA-402 Systems Analysis and Design |
I Intelligence &
Expert Systems
BCA- 404 RDBMS Using ORACLE _
[BCA-405 Enterprise Resouree Planning |
[BCA-406 Organizational Behavior
BCA-407-Practical-I (Based on BCA-
404)
Based BCA-401 or BCA-404 ) eat
‘Total Marks
BCA-409-Minor Project-I (Either Neee Vikram University, Ujjain ~ BCA Syllabus (w.e.£- 2010-11 & onwards)
4 BCA-Part-III Semester Wise Scheme
Courses of Studies for BCA-III Year
Semester — V (Theory : 250, Practical : 250)
[ | Theory | Practical) Max. | Min
< Max. | Max. | Marks | Marks
|_Marks | Marks :
_ _ | BCA-SOI Software Engineering 50 eees0le ied
i [BCA-S02 Programming With JAVA 50 - | 50 7
2 BCA-503 Microprocessor and 50 > 50 7
‘ Interfacing an]
a [BCA-504 Internet Technology with 50 - 50 7
| ASP.NET and C# saa | a7
BCA.505 Software Testing and Project 30 2 ae 7
| Management pl ie
BCA-506 Practical-I ( Based on BCA- 50 \7
502) = =
BCA-S07 Practieal-II ( Based on BCA- 30 so) |
504) ee . |
BCA-508 Minor Project-II (Based on > iso | 150 50 |
Either BCA-S02 ar BCA-504) | fe |
{ 300 |
Semester — VI ( Practical : 300)
Course Theory | Practical) Max. | Min
) Max. Max. Marks | Marks
A | eae ss Marks | Marks | |
== [a0 300 100
: BCA-601 Major Project | |
= [Total Marks alten es 300 | 300 | 100
Note >
1. For Minor Project-I and Minor Project-II and Practical Examinations kindly
follow the guidelines provided in Annexure-A.
2. For Major Project (MCA-601), the marks will be allotted on the basis of
performance in seminar, Viva and Demonstration separately.
3. Every student must remain present before the external examiner in Seminar and
‘Viva and Demonstration compuls.
4, Max Marks in Seminar is 150 ,in Viva Max. Marks is 75 and in Demonstration
Max. Marks is 75.
+ ens Bogle.~
. Peer ; ven
Wikram University, Ujjain - BCA Syllabus (w.e.f 2012-13 & onwards) WUE
‘A- 101 Fundamental of Computer Science & Information Technology
‘UNIT I
Computer Fundamental: Characteristics of Computers, History of ComputerEvolution of Computers,
Computer Generations, Types of Computer, Components of Computer: Registers, Instruction Set, Bus
Architecture, Computer Hardware: Input Devices, Output Devices, Storage Devices: Primary Storage capacity,
Memory Types, Memory Measuring Units, Secondary Storage Device
UNIT 1
Software and Computer Applications: Software &Software Types, Computer Languages, Compiler, Interpreter,
Editor, Computer Ethics, Computer applications, Introduction of Programming: Procedure Oriented Programming,
Object oriented programming, Concepts used in OOP, Benefite of OOP, Main advantages and disadvantage of OOP,
Applications of OOP,OOP Vs, POP.
UNIT DI
Operating System Overview: Computer System Startup, Computer System Structure, Computer System
Components, Operating System Classifications, Operating System Services, Major Functions of Operating
“Wstem, Process Management, CPU Scheduling, Scheduling Criteria.Memory and File Management: Memory
Management Requirements, Swapping, Memory Management Techniques , Virtual Memory, File Management, File
UNIT IV
Introduction to DBMS: File System, Traditional File Oriented Approach, DBMS- Advantages and Disadvantages,
Role of DBMS, Three views of data, DBMS Architecture, Data Models, Data Independence, Major components of
DBMS, Data Dictionary, Types of Users, DBMSApplications, Keys in Databases, Database Languages
UNIT V
Introduction to Computer Networks: Computer Network Definition, Importance of Networking, Types of
Networks, Network Topology, Advantages and Disadvantage of Coniputer Networks, Applications of computer
networks, Reference Model, Internet, Introduction to Internet Technology, Electronic Mail, World Wide Web.
Books:
J+ Operating Systems Concepts, A, Silberschaz, P.Glvin, G.Gagne, John Wiley & Sons
3 Qblect Oriented Programming in C+, Robert afore, Glgotia Pablonon
3. Data base management systems vol. 1., Date C)
* [udamental of Computer Scienee & IT, Singh Umesh Kumar, Jain S, Maheshwar A » SSDN Publications
New Delhi,
5. Data Commufications and Networks, Godbole A, Tata McGraw-Hill Publications,Vikram University, Ujjain — BCA Syllabus (w.e.f.- 2010-11 & onwards)
BCA-102 Programming and Problem Solving in C
Unit-l
Problem identification, analysis, design, coding, testing & debugging, implementation, modification &
maintenance; algorithms & flowcharts; Characteristics of a good program - accuracy, simplicity,
Tobustness, portability, minimum resource & time requirement, modularization; Rules/conventions of
Coding, documentation, naming variables; Top down design; Bottom-up design.
Unit-ll
History of C; Structure of a C Program; Data types; Constant & Variable; Operators & expressions:
Control Constructs — if-else, for, while, do-while; Case statement; Arrays; Formatted & unformatted VO;
‘Type modifiers & storage classes; Temary operator; Type conversion & type casting; Priority &
associativity of operators.
Unit
Functions; Arguments; Return value; Parameter passing — call by value, call by reference; Return
statement, Scope, visibility and life-time rules for various types of variable, static variable: Calling a
function; Recursion — basics, comparison with iteration, tail recursion, when to avoid recursion,
examples.
UnitV
Special constructs — Break, continue, exit(), goto & labels; Pointers - d&and * operators, pointer
expression, pointer arithmetic, dynamic memory management functions Tike malloc(), calloc(), free()
String; Pointer v/s array; Pointer to pointer; Array of pointer & its limitation; Function returning
pointers; Pointer to function, Function as parameter; Structure — basic, declaration. membership
Sperator, pointer to structure, referential operator, self referential structures, structure within structure,
array in structure, array of structures; Union — basic, declaration; Enumerated data type; Typedet,
command line arguments.
Unit-V
File handling and related functions; printf & scanf family;C preprocessor — basics, #lnclude, fidefine,
#undef, conditional compilation directive like #if, #else, Helif, Hendif, #ifdef and #ifndef, Variable
argument list functions.
Books
Kerninghan & Ritchie: The C programming language, PHL
Cooper Mullish: The Spirit of C, Jaico Publishing House, Delhi
Kanetkar Y.: Let us C
Kanetkar Y.: Pointers in C
Note: The question paper will have the usual note saying “ Attempt Five questions choosing one from
each Unit”. Thus, The paper will clearly specify Units and have a pattern of two questions per unit with
‘an option to attempt any one of these two within each unit. The balance of the paper will be maintained
by including appropriate ( numerical/ conceptual/analytical/ theoretical) combination of subsections of
each question.
Joo toons