Bachelor of Computer Applications (BCA/B.Sc. (IT):-

Duration : Three years

Total Seats : 60 (Three seats are reserved for NRIs and seven sets are reserved for Industry Sponsored candidates. Ten additional seats are available for foreign national)
Eligibility

a) passed senior secondary (12th Standard/Intermediate) examination with Mathematics as one of the subjects from Central Board of Secondary Education or any other examination recognized by Jamia Hamdard as equivalent thereto, securing at least 50% marks.
b) not more than 23 years of age on October 1, 2003
c) appeared in the Entrance Test conducted by Jamia Hamdard for the purpose.

For admission against NRI/Industry Sponsored seats, written test is not required.
Selection Procedure

The admission to the BCA/B.Sc.(Computer Science/IT) programme will be on the basis of the merit determined by the marks of Physics, Chemistry, Mathematics obtained by the student at 10+2 level.

Detailed Syllabus

SEMESTER-I

BCA 1.1:   Introduction to Computer and IT

Computer Organisation:   Block Diagram, Basic Architecture etc.
Evolution and Different Types of Computer and then Characterizing features;
Functional unit of computers,  primary and secondary memory.
Number System:   Decimal, octal, binary and hexadecimal.
Representation of Integers, fixed and floating point, character representation scheme
Introduction to operating system:    DOS & Windows
Elements of IT:  Introduction to Range of Info Technologies;    Audio, video, multimedia, Internet and Intranets.
Introduction to Intelligent systems.  Expert systems, Virtual Reality
System Development life cycles : Waterfall methods, prototyping, JAD, RAD, etc.
BCA  1.2: Programming in C

Programming Fundamentals, algorithm development, techniques of problem solving, flowcharting, stepwise refinement; Programming in C including features of ‘C’, C tokens, data type, operators, expressions, Branching Constructs: if-else, switch, conditional operator & goto statements; Looping Constructs: while, do-while, for and Jumping statements; Arrays, string processing, Functions: categories of functions, recursion; Pointers: operations on pointers, pointers & structures; Structures and Unions; File Management: Defining & opening a file, closing a file, input/output operations. Development of efficient programs; Debugging, verification and testing of programs.
BCA 1.3 :  Mathematics 1

Differentiation and partial differentiation, derivative of sum, dot product and cross product of two vectors, gradient, divergence and curl;. System of circles, standard equations and properties of parabola and Ellipse; General equation of second degree in two variables, tracing of conic sections, sphere; Successive differentiation, Libneitz theorem, partial differentiation, curvature, asymptotes, singular points, concavity, points of inflexion and tracing of Cartesian curves; Differential equation of first order; Matrix Algebra including rank, inverse, linear system of equations, Eigen value & Caley Hamilton Theorem; team working and management.

BCA 1.4   Organizational Behavior

Psychological dimensions and relevance in the emerging society; Learning : styles and principles; Skinner, Thorndike and Piaget theories; Conditions of learning; Organizational behavior: essential attributes; Memory: short term and long term; Efficient and effective ways in respect of thinking, problem solving and decision making ; Stress management; models of personality, factors and desirable features of a healthy personality; Basic Needs and their hierarchy: Mallow model and self actualizing personalities.

BCA 1.5:    Communication Skills

English Language:

Review of English Grammar; Written and Spoken Language; Common Errors in language; Punctuation (purpose, role, importance and use); Effective use of dictionary, thesaurus, encyclopedia, OED; Figures of speech; Language Skills (Listening, Speaking, Reading, Writing); Meaning what you mean; Listening: Effective and efficient listening in various situations (discussions, lectures, news, seminars, speech, telephone calls etc.);Speaking: Phonetics, intonation, accent, usage; strategies for a good rhetoric; Reading: Purpose; Comprehension; Tactics and strategies for good reading; Writing: Guidelines for good writing; various writing styles (General and Technical writing styles);

Communication Skills:

Communication (purpose, role, importance, elements); Effective and efficient communication; Role of content, context and language; Spoken and written communication; Presentation and delivery; Role of speaker and audience; Style and body language; Planning, organization, presentation, participation, conduction and feedback of discussions, meetings, seminars etc; Effective and efficient presentation and discussion skills; Discussion and Presentation skills of conferences, meetings, seminars etc; General and Technical documents (correspondence (applications, letters, resumes, CV), drafts, essays, memos; minutes; notes, proposals, precis, reports, summary, synopsis,), appendices, references, table of contents, acknowledgements, prologue, epilogue, revision; Use of Audio-Visual Aids: OHP, Slides, Charts, Computers etc.
SEMESTER-II
BCA 2.1: Introduction to Data Structures

Representation of data , Data Types, ADT and Data Structures, Arrays : single and multidimensional arrays , Structures , Static and Dynamic implementations of data structures, Stacks and it’s applications ,infix, prefix and postfix notations and conversions ,Recursion, queues other general lists and applications; Linked Lists: dynamic memory allocation & pointers, linked stacks & queues. Trees : Binary Trees, Tree search ,tree traversals , threaded binary tree, Height Balancing- AVL trees;  graphs – BFS and DFS ; B-trees, b+ trees , searching and sorting techniques and their analysis of algorithms , searching : linear search, binary search, tree search. Sorting : bubble sort, quick sort, insertion sort, heap sort, shell sort , merge sort and radix sort .
BCA 2.2: Computer Organization

Number System, complements, binary arithmetic, and logic gates. Boolean functions. Dual of a Boolean function. Inverse of a Boolean function. Boolean function representation: canonical form, standard form. Boolean function Simplification: Algebraic method, Karnaugh Map method. Boolean function implementation: NAND implementation, NOR implementation. Binary codes: BCD, EBCDIC, ASCII, Excess-3, gray code. Combinational circuits: adder, subtractor, decoder, and encoder, MUX/DEMUX etc. Sequential circuits: Flip-flops, registers and Counters.
BCA 2.3: Mathematics II

Sets and related operations, Relations and their properties, matrix of relations, functions and its properties, Introduction to graph theory, Significance of graph theory for computer science, matrix representation of graphs, Path Matrix, Shortest path algorithm, Introduction to recurrence relation, Formulation of recurrence relations, Characteristic equation and Characteristic roots of recurrence relation, Solution of recurrence relations, Introduction to prepositional calculus, logical operations, Truth tables of logical identities, Equivalence of logical identities, Introduction to Boolean Algebra.
BCA 2.4 :   Business Data Processing and File Systems

Data Processing: Concept, relevance and cycle; Organisation and attributes of business data processing; Computing environments; Programming methodologies: structured, object oriented etc.; Programming Principles: style, coding, testing and refinements; Input and output devices: an overview; Business Systems; Business computing: characteristics, significance and distinguishing features; Physical storage devise and their characteristics, File : fields, records, fixed and variable length records, primary and secondary keys; File operations, Basic file system operations; File organisations: Sequential, indexed Sequential, Direct, relative etc; Data processing using COBOL/FoxPro , Introduction to database design .

BCA 2.5 Computer Based Financial Accounting and Management

Conceptual Framework, Nature and Scope of accounting information; Identifying and recording accounting transactions using traditional and accounting equations approach; Generally accepted accounting principles; Accounting standards in India; Bases of accounting-cash and accrual; Capital and revenue items. Fundamentals of computerized accounting system: concept of grouping the accounting heads; Schemes of assigning the codes to accounting heads, maintaining the hierarchy of ledger accounts for preparing control accounts; Case Study and use of a software tool.
SEMESTER III
BCA 3.1:    Numerical Methods and Statistical Techniques

Numerical Methods

Numerical methods versus numerical analysis, Errors and Measure of Errors.
Non-linear Equations, Iterative solutions, multiple rocks and other difficulties, interpolation methods of BI-section, false position methods, Newton Raphson-Methods. Simultaneous Solutions of Equations, Gases Elimination Methods Gaues Jordan methods Gaues seedily methods. Interpolation and curve fitting, Lagrangian polynomials, Newton’s methods: Forward Difference methods, Backward Difference methods Divided difference methods. Numerical Integration and Different Trapezoidal Rule, Simpson 1/3 Rule Simpson’s 3/8 Rule. Numerical differentiation by polynomial Fit.

Statistical Techniques

Measure of Central Tendency, Preparing frequency distribution table, Mean Arithmetic mean harmonic, mean medial mode. Measure of dispersion, skewness and kurtosis Ranges, Mean deviation.  Standard deviation, co-efficiency of variation, Moments skew ness kurtosis. Correlation. Regression linear; Regression. Least square fit liner trend, Non-linear trend

Y=axb; Y=axx; Y=aex

Polynomial fit: Y=a+bx+cn2

Note: Per Paper Matter

I.                    That the program for numerical and statistical methods are to be written in ”Fortran-90C”.

II.                 Paper setter-indicting thereby that the greater weightage is to be given to exercise rather than theoretical derivation of all numerical and statistical methods.

Book Recommended

1.      R.S. Salaria : computer Criented Numerical Methods, Khanna Publishing company  (P) Ltd, New Delhi.
2.      V. Rajaraman : Computer oriented Numerical Methods, Prentice Hall of India Private Ltd. New Delhi.
BCA 3.2:   Fundamental Concepts of Operating Systems

Operating systems overview: Computer System Structure, operating systems structure, OS functions, facilities; Processes: introduction, concurrency, inter process communication, classical problems, process scheduling, Memory management: swapping, virtual memory, segmentation. File systems: files, directories, file system implementation, security, and protection mechanism. Input / output: principles of input / output hardware and software, disks, clocks, terminals. Deadlocks: introduction, detection, recovery, and prevention; Coordinated Case Study of Unix and Windows.
BCA 3.3:   Introduction to Object Oriented Programming  using  C++

OOP  :  Programming methodologies: concepts of structured and object oriented programming; advantage of OOP methodologies, characteristics of OOP languages: objects, classes, Data Abstraction , Encapsulation ,inheritance, reusability, polymorphism and operator overloading, function overloading;

Programming in C++ :data types, constants, expressions and statements, Arrays Strings, function overloading, functions, friend functions , in line functions constructors and destructors,  derived classes, friend classes , operator overloading , support for data abstraction,  derived class, base class, pointers and arrays, pointers and functions, support for OOP.

BCA 3.4 :   System Programming concepts & Compiler Design

Mathematical preliminaries, sets, relations and functions, graphs and trees, strings, theory of automata, DFA, NFA, acceptability of a string by finite automata,

Categories: bcapapers
Tags: