Ask Question / Post resume

Post a reply to the thread: Gujarat University MCA Syllabus : gujaratuniversity.ac.in

Your Message

Your Username:

Notes:-
1) You can copy and paste your full resume in the box below.
2) Or you can ask your question. We try to answer, as far as possible.

Title:

[QUOTE=ijt.Ranjani;315530][B][U]University [/U][/B]: Gujarat University
[B][U]Degree [/U][/B]: MCA
[B][U]Document Type [/U][/B]: Syllabus

[B][U]Website [/U][/B]: [URL]http://www.gujaratuniversity.ac.in/web/[/URL]
[B][U]Download Syllabus [/U][/B]: [URL]http://www.indianjobtalks.com/uploads/75889-MCA.pdf[/URL]

[B][U]MCA Syllabus [/U][/B]:
[B]Course Name [/B]: [B]Fundamentals of Programming[/B]  
[B]Course Code [/B]: MCA111 
[B][U]
Objectives [/U][/B]:  The aim of this course is to introduce the rudiments of programming to the students. Students will become familiar with problem solving techniques and algorithm development using computers. This will include structured programming using C, a high-level programming language. 
[B][U]
Contents [/U][/B]:  
1.Introduction to programming& Basics of C :  Concepts of Algorithm and Flowcharts, Process of compilation, Generation of languages, Basic features of C Language like Identifier, Keywords, Variable, data types, Operators and Expression. Basic screen and keyboard I/O

2.Control Statements : Test Conditions, Conditional execution and selection, Iteration and Repetitive Executions, Nested loops.  
3.Arrays : Introduction to contiguous data types. One dimensional arrays, multidimensional arrays, Array as strings, multidimensional character arrays. Operations on strings.

4.Functions : Concept of modular programming, Using functions, Scope of data, Recursive functions. Command line arguments.  
5.Pointers : Need of pointer, Types and uses of pointer, Array and Pointers, Pointers and strings, Pointer to Pointer, Pointers and functions, other aspect of pointers.

6.User Defined Data Types : Introduction to structures, usage of structure, nested structures, Union and its usage, Enumeration types, bit fields.  
7.Files : Types of files, working with files, usage of file management functions.

8.Linked List : Introduction to dynamic memory allocation, singly link list, operations on singly link list.  
9.Other features of C : Bitwise operators and its usage, C Preprocessor statements.

[B]Course Name [/B]: [B]Discrete Mathematics for Computer Science[/B] 
[B]Course Code :[/B]   MCA 112 
[B]
Objectives :[/B] The objective of this course is to present the foundations of many basic computer related concepts and provide a coherent development to the students for the courses like Fundamentals of Computer Organization,RDBMS, Data Structures, Analysis of Algorithms, Theory of Computation ,Cryptography, Artificial Intelligence and others. This course will enhance the student’s ability to think logically and mathematically.  
[B][U]
Prerequisites [/U][/B]: Knowledge of basic concepts on Sets, different operations on sets, binary operations, functions.

[B][U]Contents [/U][/B]:  
1.  Lattices and Boolean Algebra [20%] :  
Relation and ordering, partially ordered sets, Lattices as poset, properties of lattices, Lattices as algebraic systems, sublattices, direct product and homomorphism, complete lattices, bounds of lattices, distributive lattice, complemented lattices. Introduction, definition and important properties of Boolean Algebra, Sub Boolean algebra, direct product and homomorphism, join-irreducible, meetirreducible, atoms, anti atoms, Stone’s representation theorem. (Without Proof)  
[B][U]
Note [/U][/B]:
No proof is required for Theorems or Results on lattices and Boolean Algebra. Theorems should be justified and explained by suitable examples.   
 
2. Applications of  Boolean Algebra [20%] :  
Boolean expressions and their equivalence, Minterms  and Maxterms, Free Boolean algebra, Values of Boolean expression, canonical forms, Boolean functions, representation of Boolean function, Karnaugh maps, minimization of Boolean function, Quine_ Mccluskey algorithm.   
 
3.  Group Theory [20%] :  
Definition and example of groups, abelian group, cyclic groups, subgroups, permutation groups, cosets decomposition of groups, Normal subgroups, Lagrange’s theorem (Without proof)

4. Graph Theory [20%] :  
Basic concepts of Graph theory, paths, reachability and connectedness, matrix representation of graph, trees.

5. (a) Predicate Calculus [10%] :  
Introduction, predicates, statement functions, variable and quantifiers, predicate formulas, free and bound variables, the universe of discourse.   
(b) Algorithm and time complexity [10%][/QUOTE]

All times are GMT +5.5. The time now is 07:48 AM.