Bachelor of Computer Application Kerala University

This year I have passed First Semester of Bachelor of Computer Application Course of Kerala University. Now I am in 2nd Semester. I need syllabus of 2nd Semester Course of Bachelor of Computer Application, so please provide detailed syllabus in pdf format.

As you are looking for syllabus of 2nd Semester of Bachelor of Computer Application Course of Kerala University, so here I am providing following syllabus:

Kerala University Bachelor of Computer Application 2nd SEM Syllabus
Writing and Presentation Skills
Mathematics II
Computer Organization & Architecture
Object Oriented Programming
Data Structures
Programming Lab – II
Data Structure Lab

EN1211.4 WRITING AND PRESENTATION SKILLS
Module I: Writing as a skill – its importance - mechanism of writing – words and sentences -
paragraph as a unit of structuring a whole text - combining different sources – functional use of writing –personal, academic and business writing – creative use of writing.

Module II: Writing process - planning a text - finding materials - drafting – revising – editing - finalizing the draft - computer as an aid - key board skills - word processing - desk top
publishing.

Module III: Writing models – essay - précis - expansion of ideas – dialogue - letter writing -
personal letters - formal letters - CV – surveys – questionnaire - e-mail – fax - job application - report writing.

Module IV: Presentation as a skill - elements of presentation strategies – audience – objectives – medium- key ideas - structuring the material - organizing content - audio-visual aids - hand-outs - use of power point - clarity of presentation - non-verbal communication - seminar paper presentation and discussion.

MM1231.9 MATHEMATICS II
Module–I: Proof Methods, Logic: Formal proofs, Propositional reasoning, Proofs by
contradiction, False Proofs, Proofs by Induction, Symbolic Logic: Boolean expressions, Logical Equivalance, DeMorgan’s Law, tautologies, Implications, Arguments, Fallacies, Normal forms in prepositional logic, Resolution

Module–II: Set Theory, Relations, Functions: Review of Set theory concepts, set operations,
characteristic functions, fuzzy set theory basics, Relations: operations on relations, equivalence relations & partitions, partial orders, ordered sets, Warshal’s algorithm, Functions, Recursion.

Module–III: Algebraic Structures: Algebra, DeMorgan’s Law, Group, Ring, Polish
Expressions, Communication Model and error corrections, Hamming Codes

Module–IV: Graph Theory: Introduction, Graph Notation, Topological sort, Graph
Propagation algorithm, Depth First, Breadth-first searches, Shortest Path algorithms, Directed
acyclic graphs.

Module V: Miscellaneous Topics: Graphical representations of functions, Graphical
interpretation of convergence, Complex Mapping, Fractals, Grammars, Languages and
Automaton. Introduction to Matlab (Matrix, Linear Algebra, Graphics operations)

CP1241 COMPUTER ORGANIZATION & ARCHITECTURE
Module–I: Functional units of a PC; basic operational concepts; memory address, word,
instruction set, programs, assembly language instructions; CPU registers; addressing modes,
instruction format, system buses, instruction cycle, memory, example-organization of 8085
computer; encoding of information, unsigned numbers, signed numbers, operations, Booth’s
algorithm (circuit design and RTL not required), floating point number representation,
operations.

Module–II: Processing unit: Specifying a CPU, design of a simple CPU, fetching instructions, decoding and executing instructions, branching, design of a simple ALU, design of control unit, multiple buses in CPU, Micro-program, micro sequencer, micro subroutine, microinstruction format, design and implementation of a simple micro-sequencer; micro-programmed control and hardwired control, RISC & CISC (feature-wise comparison only); Pipelining and Parallel processing, Pentium microprocessor.

Module–III: Memory: memory hierarchy, speed, size, cost; RAM, ROM, internal chip
organization; cache memory, operations in cache memory, hit ratio, multilevel organization of cache memory; virtual memory, page fault, TLB, segmentation, memory protection, multiple module memories, memory interleaving.

Module–IV: Input Output operations: Accessing I/O devices; Asynchronous data transfers,
handshaking, programmed I/O (concept only), polling, interrupts: types of interrupts, processing interrupts, priority, interrupt hardware, ISR, daisy chaining; Direct memory access, DMA controller, transfer modes, I/O processors, serial communication, UART, standards: RS-232, USB.

Activities and Assignments:; parallelism in uniprocessor systems, organization of generalpurpose multiprocessors; RTL, VHDL; hardware essentials: CPU sockets; FDC, HDC, I/O cards, display adapter, modem; motherboard architecture; bus system: PCI, AGP, USB; clustering, grid computing; Computer faults: hardware & software; types of faults; diagnostic programs and tools; printer problems; monitor problems, problem diagnosis, organization of a modern PC.

CP1242 OBJECT ORIENTED PROGRAMMING
Module–I: Concept of Object orientation – why related data and methods should be kept as a
single unit – comparison with procedural and structured programming – Classes and objects –
data abstraction, encapsulation, inheritance, polymorphism, dynamic binding, message passing. Advantages of object orientation – reusability, maintenance, security, comfort in programming. Input and output streams in C++; Basic data types and declarations.

Module–II: Classes and objects in C++, access modifiers, static members, friend functions,
Constructors and Destructors, polymorphism, Operator Overloading and type conversion,
anonymous objects

Module-III: Inheritance- parent and child classes, private, public and protected inheritance,
Multiple inheritance and multi-level inheritance, Virtual base classes. C++ and memory models – new and delete operators, Heap, dynamic objects.

Module–IV: Binding & Polymorphism: Early binding, Late Binding, Pointers to derived class
objects, virtual functions, Pure virtual functions, abstract classes, object slicing, exception
handling in C++: try, throw and catch.

Assignments and activities: Evolution of OOP – history of C and C++, Review of features of
C++ common with C and also minor variations; study of File stream classes in C++. Templates – class and function templates, Templates versus macros, String objects in C++, Standard Template Library in C++ - containers, associative containers Name spaces.

CP1243 DATA STRUCTURES Module–I: Linked Lists: Concept of static versus dynamic data structures, implementation of
linked lists using pointers, operations on linked lists: insertion, deletion and traversing. Doubly linked lists and circular linked lists, applications of linked lists.

Module- II: Stacks and Queues: FIFO and LIFO data structures – stacks using (i) pointers and
(ii) arrays. Queues using (i) pointers and (ii) arrays, applications, polish notation.
Module-III: Trees: Concept of linear versus non-linear data structures, various types of trees – binary, binary search trees. Creating a binary search tree, traversing a binary tree (in-order, preorder and post-order), operations on a tree – insertion, deletion and processing, expression trees, implementation using pointers, applications.

Module–IV: Searching: sequential searching, binary searching, Hashing – linear hashing, hash functions, hash table searching, Sorting: exchange sort, selection sort and insertion sort, Graphs, graph traversal- depth-first and breadth-first traversal of graphs, applications.

Assignments and Activities: Multi-way search trees, B-trees, Huffman trees, case studies.

CP1244 PROGRAMMING LAB – II Part A
1. Testing out and interpreting a variety of simple programs to demonstrate the syntax and use of
the following features of the language: basic data types, operators and control structures.
2. Solving a problem using (i) structures and (ii) classes and comparison between the two (the
problem logic and details should be kept minimal and simple to enable focus on the contrast
between the two methods, for example declaring result of a set of students defining the name and total marks in the program itself).
3. Class definitions and usage involving variety of constructors and destructors Part B
4. Programs involving various kinds of inheritances,
5. Programs involving operator overloading and type conversions
6. Programs involving virtual base classes, friend functions
7. Program to demonstrate early and late binding
8. Program to allocate memory dynamically
9. Program involving class and function templates
10. Programs to demonstrate(i) string processing (ii) file streams (iii) a variety of selected library functions
11. Exception handling
12. Handling of 2-D arrays using pointers
13. Debugging programs involving syntactic and/or logical errors

CP1245 DATA STRUCTURES LAB Part A
Linked list: traversal, node deletion, node insertion in singly, doubly and circular lists
Implementation of different searching techniques
Implementation of different sorting techniques
Part B
Stacks: matrix representation and linked list representation: Push, Pop
Queues: matrix representation and linked list representation: Add, delete
Circular queue implementation
Evaluation of expression using stacks
Tree traversal
Evaluation of expression using binary trees.
Infix to postfix and prefix conversion
Creating and processing binary search tree

__________________
Answered By StudyChaCha Member