Rajiv Gandhi Technical University Bhopal MCA 1st Semester Syllabus MCA-102 Mathematical Foundation of Computer Science
Rajiv Gandhi Technical University Bhopal
MCA 1st Semester Syllabus
MCA-102 Mathematical Foundation of Computer Science
UNIT-I- Sets,Relations & Functions:Sets,Subsets,Power sets,Complement, Union & Intersection, Demorgan’s law Cartesian products,Relations, relational matrices, properties of relations, equivalence relation, functions ,Injection, Surjection and Bijective mapping, Composition of functions,the characteristic functions & Mathematical induction.
- Proportions & Lattices :Proposition & prepositional functions, Logical connections Truth-values and Truth Table, the algebra of prepositional functions-the algebra of truth values-Applications (switching circuits, Basic Computer Components). Partial order set, Hasse diagrams, upper bounds, lower bounds, Maximal & minimal element, first and last element,Lattices, sub lattices,Isotonicity ,distributive inequality,Lattice homomorphism, lattice isomorphism ,complete lattice ,complemented lattice distribution lattice .
- Groups and Fields:Group axioms,permutation group,sub group,co-sets,normal subgroup, semi group, Lagrange theorem, fields, minimal polynomials, reducible polynomials, primitive polynomial, polynomial roots, applications.
- Graphs: Finite graphs, incidence and degree, isomorphism, sub graphs and union of graphs, connectedness, walk, paths, and circuits Eulerian graphs ,tree properties of trees, pendant vertices in tree, center of tree ,spanning trees and cut vertices, binary tree ,matrix representation of graph, incidence and adjacency matrix and their properties, applications of graphs in computer science.
- Discrete Numeric function & Recurrence relation:Introduction to discrete numeric functions and generating functions introduction to recurrence relations and recursive algorithms, linear recurrence relations with constant coefficients, homogeneous solutions, particular solutions and total solutions
- J.P.Trembley & R.P.Manohar “Discrete Mathematical Structure with applications to Computer Science”.
- Kenneth H. Rosen-203 “Discrete Math & its Applications” 5th ed.
- K.A. Ross and C.R.B. Writht “Discrete Mathematics “.
- Bernard Kolman & Robert C. Busby “Discrete Mathematical Structures for Computer Science”.
RGPV BHOPAL,MP
M.C.A.(5th Semester) Examination
Embedded System [MCA-505]
Time: 3 Hrs Max Marks: 100 Min: 40
Note :Attempts Any 5 Questions.All Question carry equal marks.
Q.1.(a) What is DRAM?How is it better from S-RAM?
(b) What are the different typical hard-wares used in embedded microcomputer system?
Q.2.(a) Give Harvard architecture of micro-controller. What is the concept of pipe-lining?
(b) What are the different addressing modes used in micro-controller system?
Q.3.(a) Give brief details of MC68HC11F Series. ?
(b) What is the concept of I/O bound and CPU bound?
Q.4.(a) Define software abstraction with example. ?
(b) What are the different debugging strategies? Give details of debugging tools.?
Q.5.(a) Give details and code of real time operating system architecture.?
(b) How the semaphore works with RTOS?
Q.6.(a) Give details of logic analyzer (debugging tool).?
(b) What are the different rules of layered software system?
Q.7.(a) Describe the concept of shared memory. Give characteristics of shared memory. ?
(b) Give brief description of parallel slave port. ?
Q.8. Write short notes on any three of the following:
(i) Analog to digital converter
(ii) Analog interfacing applications
(iii) Design using RTOS
(iv) Simulators
(b) What are the different typical hard-wares used in embedded microcomputer system?
Q.2.(a) Give Harvard architecture of micro-controller. What is the concept of pipe-lining?
(b) What are the different addressing modes used in micro-controller system?
Q.3.(a) Give brief details of MC68HC11F Series. ?
(b) What is the concept of I/O bound and CPU bound?
Q.4.(a) Define software abstraction with example. ?
(b) What are the different debugging strategies? Give details of debugging tools.?
Q.5.(a) Give details and code of real time operating system architecture.?
(b) How the semaphore works with RTOS?
Q.6.(a) Give details of logic analyzer (debugging tool).?
(b) What are the different rules of layered software system?
Q.7.(a) Describe the concept of shared memory. Give characteristics of shared memory. ?
(b) Give brief description of parallel slave port. ?
Q.8. Write short notes on any three of the following:
(i) Analog to digital converter
(ii) Analog interfacing applications
(iii) Design using RTOS
(iv) Simulators
META TAGS:-RGPV MCA-505 OLD PAPERS I RGTU MCA-505 EMBEDDED SYSTEM GUESSING PAPERS I RGTU MCA 5TH SEM GUESS PAPERS I RGTU MCA-505 EMBEDDED SYSTEM QUESTION PAPERS I RGPV MCA-505 EMBEDDED SYSTEM LAST 5 YEAR PAPERS I RGTU MCA 5TH SEM OLD PAPERS I RGPV MCA 5TH SEM EMBEDDED SYSTEM SAMPLE PAPERS I RGTU MCA 5TH SEM QUESTION PAPERS I RGTU MCA 5TH SEM ALL PAPERS I RGPV MCA-505 EMBEDDED SYSTEM PREVIOUS YEAR PAPERS I RGTU MCA 5TH SEM LAST YEAR PAPERS I RGPV MCA-505 EMBEDDED SYSTEM OLD EXAM PAPERS I RGTU MCA-505 EMBEDDED SYSTEM PAST YEAR PAPERS I GPV MCA 5TH SEM MODEL TEST PAPERS I RGTU MCA-505 EMBEDDED SYSTEM IMPORTANT QUESTIONS I MCA-505 EMBEDDED SYSTEM QUESTION PAPERS
rgpv mca 3rd semester exam paper : Object Oriented Methodology C++[MCA-303] , download rgtu mca 3rd sem papers,
RGPV BHOPAL,MP
M.C.A.(3RD Semester) Exam Dec 2009
Object Oriented Methodology C++[MCA-303]
Time: 3 Hrs Max Marks: 100 Min: 40
Note :Question number 1 is compulsory. Answer any three questions from the rest.
Note :Question number 1 is compulsory. Answer any three questions from the rest.
Q.1. (a) What is a global variable ? Explain two major problems that may occur due to global variables. (5)
(b) What is inheritance ? Explain two benefits of inheritance, with an example of each. (5)
(c) “One object in Java can be assigned as reference to another object of the same type.” To explain this concept write a complete Java program and explain how a reference object works. (5)
(d) What is a constructor ? Write a Java program to explain how super class constructors are called in their subclasses. (5)
(e) What is multithreading ? Explain this with an example of how inter-thread communication takes place in Java. (5)
(f) Explain how a string class object can be created using an existing ‘String Buffer’ object. Also, explain how can you find the location of the last occurrence of ‘a’ in the string “Java Programming”.
(g) What is a check-box ? How would you put check-boxes on an applet ? Explain how checkbox group is created in Java. (5)
(h) What is a datagram?Explain how objects of the class Datagram Packet can be created. (5)
Q.2. (a) What is an instance variable ? Explain how an instance variable of a class can have different value for each object of that class. (5)
(b) What is encapsulation ? Explain how encapsulation provides modularity and information hiding. (5)
(c) What is a URL connection ? Write a Java program to explain the processes of reading from and writing to a URL. (5)
(d) What is a language paradigm ? Explain two basic features of an object oriented paradigm. (5)
Q.3. (a) List four differences between a Java applications program and Java applet program, with an example of each type of program. (8)
(b) Find the errors in the following Java program, and correct them. (6)
public class My_String
{
public vold main(string)
{ String str = “Java Programming”;
Str.reverse();
System.out.println(“Capacity:” + str.capacity());
}
}
{
public vold main(string)
{ String str = “Java Programming”;
Str.reverse();
System.out.println(“Capacity:” + str.capacity());
}
}
(c) Write a program in Java which creates a file reference and finds the following :
(i) Path of the file;
(ii) Whether file exists or not;
(iii) Whether the file is writable or not;
(iv) Size of the file.
(i) Path of the file;
(ii) Whether file exists or not;
(iii) Whether the file is writable or not;
(iv) Size of the file.
Q4. (a) What is multithreaded programming ?Explain how threads are created in Java. Explain the need lot thread synchronization,with an example. (10)
(b) What is a package?Explain,with an example,how name conflicts are resolved during package import.(4)
(c) Write a program to explain how parameters are passed in an applet Program. (6)
Q.5. (a) What is a container ? Explain how components are added to a container. What is a default layout of an applet ? How can you change it ? (5)
(b) What is a bitwise operator ? If i is int i = 32, what will the value of i be after (5)
(i) i = < < < 3 ;
(ii) i = i + i < < < 2 ?
(i) i = < < < 3 ;
(ii) i = i + i < < < 2 ?
(c) What is JDBC ? Explain how SQL statements are written and executed in Java. (5)
(d) What is an exception ? write an exception subclass which throws an exception if the variable age passed as argument to a method and the value of age is less than 20. (5)
rgpv mca 4th sem exam papers : Artificial Intelligence & Application MCA-401 , download rgtu mca 4th sem papers,
R.G.P.V. BHOPAL
M.C.A.(4th Semester) Exam,June,2009
Artificial Intelligence & Application MCA-401
Time:3 Hrs Max Marks:100 Min Marks : 40
Note :Attempt any one question from each Unit. All questions carry equal marks.
UNIT-I
Q.1.(a) Differentiate the concepts of optimal behaviour and human like behavior.?
(b) What a physical symbol system is and what the various components do ?
(b) What a physical symbol system is and what the various components do ?
OR
Q.2.(a) List examples of intelligent systems that depend on models of the world.
(b) How does (defun car(x) (car x)) work ?
(b) How does (defun car(x) (car x)) work ?
UNIT-II
Q.3.(a) Describe the way in which a problem should be represented in order to allow its solution
using a heuristic search technique. ?
(b) Define what is meant for a search algorithm to be complete and to be optimal ?
(c) Define what it means for a heuristic function to be admissible and to be monotonic ?
(d) Describe the operation of the A* heuristic search algorithm.
(e) Prove that the A* heuristic search algorithm is optimal when applied in conjunction with a
monotonic heuristic. State the conditions under which the algorithm is also complete and
explain why this is the case ?
using a heuristic search technique. ?
(b) Define what is meant for a search algorithm to be complete and to be optimal ?
(c) Define what it means for a heuristic function to be admissible and to be monotonic ?
(d) Describe the operation of the A* heuristic search algorithm.
(e) Prove that the A* heuristic search algorithm is optimal when applied in conjunction with a
monotonic heuristic. State the conditions under which the algorithm is also complete and
explain why this is the case ?
OR
Q.4. This question considers the monkey-and-bananas problem, in which there is a monkey in a room with some bananas hanging out of reach from the ceiling, but a box is available that will
enable the monkey to reach the bananas if the climbs onto it. Initially the monkey is at
location A, the bananas at B and the box at C. The monkey and box have height x, but if the
monkey climbs onto the box he will have height y, the same as the bananas. The actions
available to the monkey include Go from one place to another. Push an object from one place
to another, Climb onto an object and Grasp an object. Grasping results in holding the object
if the monkey and object are in the same place at the same height.
(i) Write the initial state description using a representation of your choice.
(ii) Write definitions of the four actions, providing at least some obvious preconditions, additions and deletions.
(iii) Suppose the monkey wants to fool the observers, who have gone to lunch, by grabbing the bananas but leaving the box in its original place. Write this as a goal (but not
assuming the box is necessarily at location C) in the language of situation calculus.
(iv) If the box is filled with bricks,its position will remain the same when the Push operator is applied. Is this an example of the frame problem or the circumscription problem ?
Justify your answer.
enable the monkey to reach the bananas if the climbs onto it. Initially the monkey is at
location A, the bananas at B and the box at C. The monkey and box have height x, but if the
monkey climbs onto the box he will have height y, the same as the bananas. The actions
available to the monkey include Go from one place to another. Push an object from one place
to another, Climb onto an object and Grasp an object. Grasping results in holding the object
if the monkey and object are in the same place at the same height.
(i) Write the initial state description using a representation of your choice.
(ii) Write definitions of the four actions, providing at least some obvious preconditions, additions and deletions.
(iii) Suppose the monkey wants to fool the observers, who have gone to lunch, by grabbing the bananas but leaving the box in its original place. Write this as a goal (but not
assuming the box is necessarily at location C) in the language of situation calculus.
(iv) If the box is filled with bricks,its position will remain the same when the Push operator is applied. Is this an example of the frame problem or the circumscription problem ?
Justify your answer.
UNIT-III
Q.5.(a) Explain what the terms ontological commitment and epistermological commitment mean in the context of a language for knowledge representation and reasoning. What are the ontological and epistemological commitments made by propositional logic and by first order logic ?
(b) You wish to construct a robotic pet cat for the purpose of entertainment. One purpose of the cat is to scratch valuable objects when the owner is not present.Give a brief general
description of situation calculus and describe howit might be used for knowledge representation by the robot. Include in your answer one example each of a frame axiom an effect axiom, and a successor-state axiom, along with example definitions of suitable predicates and function.
(c) Give a brief description of the representational frame problem, the inferential frame
problem, the qualification problem and the ramification problem.
(b) You wish to construct a robotic pet cat for the purpose of entertainment. One purpose of the cat is to scratch valuable objects when the owner is not present.Give a brief general
description of situation calculus and describe howit might be used for knowledge representation by the robot. Include in your answer one example each of a frame axiom an effect axiom, and a successor-state axiom, along with example definitions of suitable predicates and function.
(c) Give a brief description of the representational frame problem, the inferential frame
problem, the qualification problem and the ramification problem.
OR
Q.6. What problems would be encountered in attempting to represent the following statements in
predicate logic ? It should be possible to deduce the final statement from the others :
(i) John only likes to see French movies.
(ii) It's safe to assume a move American unless explicitly told otherwise.
(iii)The Playhouse rarely shows foreign films.
(iv) People don't do things that will cause them to be in situations that they don't like.
(v) John doesn't go to the Playhouse very often.
predicate logic ? It should be possible to deduce the final statement from the others :
(i) John only likes to see French movies.
(ii) It's safe to assume a move American unless explicitly told otherwise.
(iii)The Playhouse rarely shows foreign films.
(iv) People don't do things that will cause them to be in situations that they don't like.
(v) John doesn't go to the Playhouse very often.
UNIT-IV
Q.7. Explain how the Alpha-Beta Algorithm is a better way to search game trees. These two algorithms depend on certain assumptions about how the game is played ? What are they ?
OR
Q.8.(a) Identify the classic parsing algorithms for parsing natural language.?
(b) Make the augmented transition network for the following sentence 'The dog likes a man' explain steps.?
(b) Make the augmented transition network for the following sentence 'The dog likes a man' explain steps.?
UNIT-V
Q.9.(a) Would an expert system be a suitable technique for implementing an automate travel agent ?
(b) Explain how Bayesian Statistics provides reasoning under various kinds of uncertainty.?
(b) Explain how Bayesian Statistics provides reasoning under various kinds of uncertainty.?
OR
Q.10.(a) Explain the differences among the three mains styles of learning :supervised, reinforcement and unsupervised.
(b) Give short definitions of the following :
(i) Maximum Expected Utility
(ii) Intelligent Agent Architecture
(iii) Fuzzy control
(iv) Constraint
(v) Problem Space(or Search Space)
META TAGS:-RGPV MCA-401 LAST 5 YEAR PAPERS I RGTU MCA-401 PREVIOUS YEAR PAPERS I RGPV MCA-401 ARTIFICIAL INTELLIGENCE MODEL PAPERS I RGTU ARTIFICIAL INTELLIGENCE AND APPLICATION MCA-401 PAPERS I RGPV ARTIFICIAL INTELLIGENCE GUESSING PAPERS I MCA-401 ARTIFICIAL INTELLIGENCE GUESS PAPERS I MCA ARTIFICIAL INTELLIGENCE AND APPLICATION OLD EXAM PAPERS I RGTU MCA-401 LAST 5 YEAR PAPERS I ARTIFICIAL INTELLIGENCE QUESTION PAPERS IRGTU ARTIFICIAL INTELLIGENCE SAMPLE PAPERS I ARTIFICIAL INTELLIGENCE MODEL PAPERS I RGTU MCA-401 ARTIFICIAL INTELLIGENCE TEST PAPERS I RGTU MCA-401 ARTIFICIAL INTELLIGENCE SAMPLE PAPERS I(b) Give short definitions of the following :
(i) Maximum Expected Utility
(ii) Intelligent Agent Architecture
(iii) Fuzzy control
(iv) Constraint
(v) Problem Space(or Search Space)
