0% found this document useful (0 votes)
4 views

DIscrete and Java

The document outlines the syllabus for MCA 524 Java Programming and MCA 530 Discrete Structures courses. It covers key concepts in object-oriented programming, exception handling, collections, GUI programming, set theory, relations, functions, algebraic structures, Boolean algebra, propositional and predicate logic, trees, and graphs. Each unit consists of 9 sessions focusing on foundational knowledge and practical applications in these areas.

Uploaded by

nishul2507
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

DIscrete and Java

The document outlines the syllabus for MCA 524 Java Programming and MCA 530 Discrete Structures courses. It covers key concepts in object-oriented programming, exception handling, collections, GUI programming, set theory, relations, functions, algebraic structures, Boolean algebra, propositional and predicate logic, trees, and graphs. Each unit consists of 9 sessions focusing on foundational knowledge and practical applications in these areas.

Uploaded by

nishul2507
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MCA 524 JAVAPROGRAMMING

UNIT I [SESSIONS: 9]
OOP concepts – Data abstraction, encapsulation, inheritance, benefits of inheritance,
polymorphism, classes and objects, Procedural and object oriented programming paradigms
Java programming – History of Java, comments, data types, variables, constants, scope and
life time of variables, operators, operator hierarchy, expressions, type conversion and
casting, enumerated types, control flow – block scope, conditional statements, loops, break
and continue statements, simple java stand alone programs, arrays, console input and
output, formatting output, constructors, methods, parameter passing, static fields and
methods, access
control, this reference, overloading methods and constructors, recursion, garbage collection,
building strings, exploring string class.
UNIT II [SESSIONS: 9]
Super and sub classes, Member access rules, super keyword, preventing inheritance: final
classes and methods, the Object class and its methods Polymorphism-dynamic binding,
method over riding, abstract classes and methods. Interfaces – Interfaces vs. Abstract
classes, defining an interface, implementing interfaces, accessing implementations through
interface references, extending interface. Inner classes – Uses of inner classes, local inner
classes, anonymous inner classes, static inner classes, examples. Packages-Defining,
Creating and Accessing a Package, Understanding Class path, importing packages.
UNIT III [SESSIONS: 9]
Exception handling–Dealing with errors, benefits of exception handling, the classification of
exceptions- exception hierarchy, checked exceptions and unchecked exceptions, usage of
try, catch, throw, throws and finally, re-throwing exceptions, exception specification, built-in
exceptions, creating own exception sub classes. Multi threading–Differences between
multiple processes and multiple threads, thread states, creating threads, interrupting threads,
thread priorities, synchronizing threads, inter-thread communication, producer consumer
pattern.
UNIT IV [SESSIONS: 9]
Introduction to Java Collections, Overview of Java Collection framework, Generics,
Commonly used Collection classes– Array List, Vector, Hashtable, Stack, Enumeration,
Iterator, String Tokenizer, Random, Scanner, calendar and Properties Files–streams-byte
streams, character streams, text Input/output, binary input / output, random access file
operations, File management using File class. Connecting to Database – JDBC Type 1 to 4
drivers, connecting to a database, querying a database and processing the results, updating
data with JDBC
UNIT V [SESSIONS:9]
GUI Programming with Java–The AWT class hierarchy, Introduction to Swing, Swing vs.
AWT, JSP, EJB: Introduction, Comparison of EJB & Java Beans, Applications, Drawbacks,
Different types of enterprise beans, Services provided by EJB container. TEXT BOOKS:
1. Naughton,Schildt,“TheCompleteReferenceJAVA2”,TMH
2. Deitel & Deitel,“ The Complete Java”
3. “Professional JAVA Server Programming”,Allamaraju and Buest, SPD Publication.
4. “AdvancedProgrammingforJAVA2platforms”AustinandPawlan, Pearson.
5. Internet&JavaProgrammingbyKrishnamoorthy&S.Prabhu(NewAgePublication)
MCA 530 DISCRETE STRUCTURES
UNIT I [SESSIONS: 9]
Set Theory: Introduction, Combination of sets, Multi sets, ordered pairs, Set Identities.
Relations: Definition, Operations on relations, Properties of relations, Composite Relations,
Equality of relations, Order of relations.
Functions: Definition, Classification of functions, Operations on functions, Recursively
defined
functions.
Natural Numbers: Introduction, Mathematical Induction, Variants of Induction,
Induction with Non-zero Base cases.
UNIT II [SESSIONS: 9]
Algebraic Structures: Definition, Groups, Sub groups and order, Cyclic Groups, Cosets,
Lagrange's theorem, Normal Subgroups, Permutation and Symmetric groups, Group
Homomorphisms, Definition and elementary properties of Rings and Fields, Integers Modulo.
UNIT III [SESSIONS: 9]
Partial order sets: Definition, Partial order sets, Combination of partial order sets,
Hassediagram.
Lattices: Definition, Properties of lattices–Bounded, Complemented, Modular and Complete
Lattice, Morphisms of lattices.
Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic
manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps,
Logic gates, Digital circuits and Boolean algebra.
Combinational and sequential Circuits
UNIT IV [SESSIONS: 9]
Propositional Logic: Proposition, well-formed formula, Truth tables, Tautology, Satisfiability,
Contradiction, Algebra of proposition, Theory of Inference, Natural Deduction.
Predicate Logic: First order predicate, well-formed formula of predicate, quantifiers, Inference
theory of predicate logic.
UNIT V [SESSIONS: 9]
Trees: Definition, Binary tree, Binary tree traversal, Binary search tree. Graphs: Definition
and
terminology, Representation of graphs, Multi graphs, Bipartite graphs, Planar graphs,
Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring.
Recurrence Relation & Generating function: Recursive definition of functions, Recursive
algorithms, Method of solving recurrences

You might also like