FACTORES PREDICTORES DE TS

Christ University, Bangalore, India 38

• The output of the programs should be neatly formatted

• The source code should be indented

• The programs should be interactive

1. Aim : To learn about pointers and strings

a. Write a menu driven program to concatenate two strings and find the length of a string using pointers.

b. Write a menu driven program to find the index of a pattern in a given string and to extract a substring using pointers.

2. Aim : To learn about one and two dimensional arrays

a. Insertion b. Deletion

2. Aim : To learn about Searching Techniques

a.Write a program to implement Linear Search with sentinels

b. Write a program to implement Binary Search

3. Aim : To learn about singly linked list insertion and deletion

a. Creation of a linked list and insertion. b. Creation of a linked list and deletion.

4. Aim : To learn about recursion

a. Towers of Hanoi with 3 pegs and n disks. b. Fibonacci series using recursion.

5. Aim : To learn about stacks

a. Write a program to implement different operations on a stack using a linked list.

6. Aim : To learn about queues

a. Write a program to implement different operations on a queue using a linked list.

b. Write a program to implement different operations on a circular queue using an array.

7. Aim : To learn about binary search trees

a. Write a program to create a binary search tree and to perform Insertion and deletion

8. Aim : To learn about various sorting techniques

a. Write a program to implement insertion sort b. Write a program to implement merge sort.

c. Write a program to implement quick sort. d. Write a program to implement heap sort.

Christ University, Bangalore, India 39

BCA 331: GERMAN LANGUAGE

Total Teaching Hours: 45

UNIT 1: (08 Hours)

Greetings, Names of countries & nationalities, Introduction of people Grammar – Verb position, Variations of verbs & Subject, types of sentences

UNIT2: (09 Hours)

Describing a city, giving directions, placing order in a restaurant Grammar – Variations of verbs, Introduction to “Doch”

UNIT 3: (09 Hours)

Numbers, Months, using expresessions of times

Grammar - Definite & Indefinite articles, Nominativ & Akkusativ cases

UNIT 4: (09 Hours)

Weekdays, expressions of time, talking about daily routines Grammar - Breakable Verbs, Nouns (Article & Plurals)

UNIT 5 : (10 Hours)

Describing one’s profession, about courses. Grammar - Modal verbs & Prepositions

TEXT BOOK:

Moment Mal ! [1] Publisher – Langenscheidt

REFERENCE BOOKS:

Sprachkurs Deutsch [1], Grundkurs Deutsch

Exam Portions:

Grammer – Fill in the blanks Comprehension

Dictation/ Hearing Comprehension Passage writing/ Letter writing Viva

Christ University, Bangalore, India 40

BCA 332: GRAPH THEORY

Total Teaching Hours: 45

UNIT 1: Definition of a graph-finite and infinite graphs - incidence and degree - sum of degrees equals twice the no. of edges (Proof included) - Degree sequence - isolated vertex - pendant vertex – null graph - regular graph-isomorphic graph – sub graphs –walks – paths – circuits - connected graphs - disconnected graphs - components of a graph - operations on graphs – Euler path & Euler graphs – Hamiltonian Paths & Graphs – Weighted graphs (No Theorems)

Definition of Trees – Properties of Trees - Pendant Vertices in a Tree - Distance and centers in a Tree - Rooted and Binary Trees - Spanning Trees. (No theorems)

(10 Hours) UNIT 2 : Cut sets and Cut vertices – Fundamental circuits and cut sets – Edge Connectivity - Vertex connectivity – Separable Graphs – Planar Graphs - Kuratowski’s graphs – Different representations of Planar graphs (No Theorems).

Incidence Matrix A – Circuit Matrix B – Fundamental Circuit Matrix – Cut Set Matrix C

- Relationship between A,B and C - Path Matrix – Adjacency Matrix. (10 Hours)

UNIT 3 : Coloring of a Graph , Chromatic number - Chromatic Partitioning – Chromatic Polynomial – Coverings - Four Color Problem ( No theorems)

Definition of Directed Graphs & Related definitions - Directed path and connectedness - Euler digraphs - Trees with directed edges - Arborescence – fundamental circuits in digraphs- Matrices A,B & C of digraphs - Adjacency Matrix of digraphs (No Theorems).

(15 Hours) UNIT 4 : Graph Theory - an Algorithmic approach – Detecting a Spanning Tree - Detecting cut vertices and separability – Detecting a shortest path from a specified vertex to another specified vertex – Detecting a shortest path between all pairs of vertices –

Planarity testing.

(10 Hours) TEXT BOOK :

Narasingh Deo : “ Graph Theory with Applications to Engineering and Computer

Science” , PHI-India

REFERENCE BOOK:

Christ University, Bangalore, India 41

BCA 333: CORPORATE ACCOUNTANCY

Total Teaching Hours: 45

UNIT 1: INTRODUCTION

Meaning – accounting Principles- double entry system of accounting – Journal –

Subsidiary books – Four phases of Accounting (05 Hours)

UNIT 2: LEDGERING

Ledger – Posting – Trial Balance (05 Hours)

UNIT 3: CASH BOOK

Three Columns of Cash Book – Bank reconciliation- Purpose of Bank reconciliation (10 Hours) UNIT 4: DEPRECIATION ACCOUNTING

Meaning of depreciation – depreciation methods – straight line method – reducing

Balance method – depreciation fund – Annuity method (10 Hours)

UNIT 5: FINAL ACCOUNTS

Meaning – Trading account – Profit and Loss Account – Balance Sheets – Adjustments – Prepaid Expenses – Outstanding expense & income – Income received in advance – depreciation – bad debts – reserve for bad debts – reserve for discounts on debtors –

reserve for discount on creditors – Interest on capital and drawing (15 Hours)

TEXT BOOK:

1. Jain & Narang: “Financial Management”, Himalaya Publishing House

2. B.S. Raman: “Financial Management”, United Publication

REFERENCE BOOKS:

1. T. S Grewal : “ Introduction to Accounting”

2. S. N Maheswary and S. K Gupta “ Introduction to Accounting”

Christ University, Bangalore, India 42