MCA PREVIOUS QUESTION PAPERS
IV SEM MCA QUESTION PAPERS
FOR 2012 YEAR click here...!
FOR 2010 YEAR click here...!
MCA I SEM Model Papers:
contact E-mail:kilarilokesh1@gmail.com
COMPUTER ORGAINIZATION:
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION
First Semester (2007-2008)
Paper-IV- COMPUTER ORGAINIZATION
Model Paper
Time:
3 Hrs Maximum:
70 Marks
Section-A
Answer Any Five
questions ( 5 X 4 = 20 )
1. Give a brief note on historical
perspective of computers
2. Write about the BUS Structures
3. Discus about the displacement
mode of addressing
4. Write about basic Input / Output
operations
5. Discus about the interrupts
6. Discus about the standard Input
/ Output Interfaces
7. Give a brief note on the
following
(a) Cache Memory
(b) Virtual Memory
8. Write about the addition of
positive Numbers
9. Discus about the Execution of a
complete Instruction
10. Write about the micro
programmed control
Section – B
Answer Any Five
Questions choosing one from each unit.
(5 X 10 = 50)
Unit – 1
11. Explain the different
functional units of a Computer
(or)
12. Explain the basic operational
concepts of a computer
Unit- II
13. Explain about the different
addressing modes
(or)
14. Explain about instructions and
instruction Sequencing
Unit-III
15. Explain about Input / Output
organisation
(or)
16. Explain about DMA
Unit – IV
17. Explain about the different
types of memories
(or)
18. Describe the operations on
floating point number
Unit – V
19. Describe the basic concepts of
pipelining
(or)
20. Describe the fundamental
concepts of a processing unit
 |
| posted by |
Meenakumari (III sem)
 |
| posted by Meenakumari(III sem) |
DISCRETE MATHEMATICAL STRUCTURES:
MASTER OF COMPUTER APPLICATIONS DEGREE EXAMINATION
FIRST SEMESTER
MCA 1. 1 : DISCRETE MATHEMATICAL STRUCTURES
(New Regulation W.E.F 2007-08)
Time : Three Hours Max
Marks : 70
PART-A
Answer any FIVE questions.
Each Question carries
FOUR Marks 5 x 4: 20
1. Show that ~(Pv(~P^Q)) and ~P^~Q are logically equivalent.
2. What is indirect proof of a theorem?
4. What is Recursive Subroutine?
3. Define and explain Strong Mathematical Induction.
5. How many ways 3 integers be selected from the integers 1,
2,…….,30 so that their sum is
even?
6. State and Prove Generalized Pigeonhole Principle.
7. Define an Equivalence Relation and give an example of it.
8. Define Join Semi Lattice and
9. How many edges are there in a graph with 10 Vertices each
of Degree 6?
10. Explain (a) Eulerian Path (b) Hamilton
PART-B
Answer
any FIVE Questions choosing ONE from each unit.
Each
Question carries TEN Marks 5 x 10:50
Unit- I
11. Prove or disprove the intersection of two equivalence
relation is also an equivalence relation
12. (a)
State all Rules for Logical inference.
(b) Show that the hypothesis. If you send an email message I will finish
writing the program. If you do not send me an email message then I will go to
sleep early. If I go to sleep early I will wake up feeling refreshed. Lead to
the conclusion if I don’t finish writing the program then I will wake up
feeling refreshed.
Unit-II
13. Prove that 11 n+2+12 2n+1 is
divisible by 133, where n € I+ by Mathematical Induction.
14. Using CP Rule Show that ~Av~C is
a valid conclusion from A->B,C->D,( D^B)->E and ~E .
Unit-III
15. How many cards must be selected from a standard deck of
52 cards to guarantee that at
least 3 cards of the same suit are chosen? How many must be selected to
guarantee that at least 3 hearts are selected.
16. Solve the Recurrence Relation
a n = 6a n-8a n-2
for n ≥ 2, a 0 =4,a 1 =10
Unit-IV
17. (a) Define Transitive closure of
relation.
(b) Draw the Hasse diagram for (D 24,1) where D 24
is the set of all divisors of 24 and
1 denotes the operation “divisor of “.
18. Define Finite State Machine and
find a Turing Machine that recognizes the set
{0 n 1 n / n ≥
1 }.
Unit –V
19. (a) Define
1. Degree
2. Complete Graph
3. Connected Graph
4. Cycle and give an example of each.
(b) Show that a connected graph with ‘n’ vertices has at least ‘n-1’
edges.
20. (a) Define a Chromatic number and
find the chromatic number of complete graph of ‘n’ vertices k n .
(b) Explain Traveling Salesman Problem.
INTRODUCTORY PROGRAMMING:
MASTER OF COMPUTER
APPLICATIONS DEGREE EXAMINATION
FIRST SEMESTER
MCA1.3 INTRODUCTORY
PROGRAMMING
(New Regulation W.E.F
2007-08)
Time : 3 hrs Max
Marks : 70
PART-A
Answer any 5 questions
Each question carries 4 Marks 5X4=20
1 . What is the difference between conventional &
object- oriented programming languages?
2. What is the hierarchy of Stream classes?
3. What is Type casting 8: explain its Types?
4. Explain (1)
Pass By Value
(2)Pass By Address
(3)Pass By Reference
5. Explain this pointer, Void pointer, Wild pointer?
6. Describe about pure VIRTUAL Functions
7. What are the merits & demerits ofa FRIEND function?
8. What is difference between class & a structure? How
to define a member functions of a class?
9. List out characteristics of Constructor, Destructor?
I 0. What is the difference between view & delete
operators with simple example?
PART -B
Answer Any 5
Questions choosing one from each unit
Each question carries
4 Marks
UNIT —I 5X10=50
1 1 . a) Difference in using C& C++ I/O functions?
b) What are member functions of ISTREM class?
12. Explain briefly all Decision Making & Loops in C++?
UNIT -II
1 3 . a) Principles and Precautions of Function Overloading?
b) Write a program to define Overloaded function to add ()
for integer & float to Perform the addition?
1 4. Write a program to declare an integer array? Display
the contented of array using Pointers?
UNIT —III
1 5 . What is Inheritance & Explain the type of
Inheritance with Examples?
16. What is OOP & Explain its key concepts of OOP?
UNIT- IV
17. a) Describe about friend function with example?
b) Write a program to show difference b/n static & non-
static member variables?
18. What is
overloading? Explain overloading with friend function with example.
UNIT- V
19 .a) Describe ruler for collating visual functions.
b) Write a program to declare virtual function & execute
the same function defined in Base & derived classes.
20. What are the principles of Exception Handling? Explain
Exception 1-landling mechanism with example?
ORGANIZATION AND MANAGEMENT:
MASTER OF COMPUTER APPLICATIONS DEGREE EXAMINATION - JAN,
2008
FIRST SEMESTER
PAPER - I .5
ORGANIZATION AND MANAGEMENT
(Under CBCS
w.e.f. 2007-2008)
Time: 3 Hours Max.
Marks: 70
PART-A
Answer any lIVE questions
All Questions carry equal marks
(Marks: 5x420)
1. What is “Management by Exception”?
2. What is principle ofnavigational change?
3. What is Delphi technique
ofdecision niaking?
4. What is Line and staff organization?
5. Distinguish between delegation and decentralization.
6. What is expectancy theory of motivation?
7. What are the barriers to effective communication?
8. What is trait approach to leadership?
9. Explain Man power planning.
10. Distinguish between job description and job
specification.
PART — B
Answer any FIVE questions choosing ONE from each unit.
All questions carry equal marks.
(Marks: 5x1050)
UNIT I
11. Discuss the principles of management as propounded by
Henri Fayol.
12. What are the various steps involved in the process of
planning? What should a manager do to ensure the effective implementation of
plans?
UNIT—TI
13. Discuss the main stages in the process ofrational
decision making.
14. What is line organization? What are its limitations? How
does the line and staff structure remove these limitations?
UNIT - III
15. Discuss Maslow’s need hierarchy theory of motivation.
How can a manager use this theory for motivating his employees?
16. Explain the importance of decentralization of authority
in an organization. What are the factors which tend to promote
decentralization?
UN iT - IV
17. What are the essential characteristics of a good
communication system? Distinguish between formal and informal communication.
18. Discuss the need for coordination in formal
organizations. How is it achieved?
UNIT-V
19. What is recruitment? Discuss the various sources of
recruitment used in India
20. What are the essentials of an adequate and sound wage
and salary policy?
2)
 |
| Posted by Meenakumari(III Sem) |
 |
Operational Research:
 |
| Posted by Meenakumari(III Sem) |
 |
| Posted by Meenakumari(III Sem)
Accounting and Financial management:
|
 |
| Posted by Meenakumari(III Sem) |
 |
| Posted by Meenakumari(III Sem) Data Structures: |
 |
| Posted by Meenakumari(III Sem) |
 |
| Posted by Meenakumari(III Sem)
File Structures:
|
 |
| Posted by Meenakumari(III Sem) |
 |
| Posted by Meenakumari(III Sem)
Operating System:
|
 |
| Posted by Meenakumari(III Sem) |
 |
| Posted by Meenakumari(III Sem) |
MCA III SEM QUESTION PAPERS:
Data Base Management Systems
posted By
sireesha(III sem)
MCA November 2009
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION October 2009
Third Semester (2007-2008)
Paper-301- Data Base Management Systems
Time:
3 Hrs Maximum:
70 Marks
Section-A
Answer Any Five questions ( 5 X
4 = 20 )
1) What are the advantages of DBMS?
2) what is meant by Transaction management?
3) Discuss and distinguish between
generalization and specialization.
4) Explain various user interface and tools?
5) Discuss array and multi set in SQL.
6) Discuss structure of XML data.
7) Explain view and join with example.
8) Discuss about shadow paging.
9) How to handle dead locks in transaction
management?
10) Write various advanced recovery techniques?
Answer any five questions
11) Explain the structure of DBMS with neat
diagram.
Or
12) A).explain various relational algebra
operations.
b).discuss various integrity constraints
with examples.
13).what is normal form? explain
various normal forms with examples?
Or
14).explain the data base design for bank using ER model.
15). A).what are persistent programming languages?
b).explain inheritance in
SQL.
or
16).write the features of O-R and how to implement.
17).what is query processing? discuss sorting techniques in query
processing.
Or
18).what is query optimization? discuss various query optimization
techniques.
19).a).explain various ACID properties.
b).discuss two-phase
locking protocols.
Or
20).what is concurrency control? explain various concurrency control
protocols?
Data communications and computer networks
posted By
sireesha(III sem)
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION , october 2009
Third Semester (2007-2008)
Paper-302- Data communications and computer
networks
Time:
3 Hrs Maximum:
70 Marks
Section-A
Answer Any Five questions ( 5 X
4 = 20 )
1).explain various
transmission methods.
2).what is
SONET? Explain with example.
3).explain
various error detection techniques.
4).briefly
explain about Bluetooth.
5).what is ARP
and RARP?
6).write a
short note on class full address.
7).what is
congestion? How to avoid?
8).briefly
explain virtual private networks.
9).explain
client server model.
10).write a
short note on voice over IP.
Part B 5x10=50
11.explain different layers in TCP/IP model.
or
12.Explain
various transmission media.
13.explain
various data link control protocols.
or
14.briefly
explain various types of LANs.
15.What is
routing? explain various types of routing algorithms.
or
16.explain
various network layer protocols
17.explain TCP
and UDP.
or
18.what is
public key cryptography?explain with example.
19.briefly
explain the following:
a.DNC b.DDNS
c.SMTP d.FTP
or
20.explain various
techniques for compression of audio and video.
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION , November 2010
Third Semester (2007-2008)
Paper-302- Data communications and computer
networks
Time:
3 Hrs Maximum:
70 Marks
Section-A
Answer Any Five questions ( 5 X
4 = 20 )
1.what is data communication and what are possible ways of data
transmission?
2.what do you mean by modulation
and demodulation and explain working of modem?
3.writ a short note on 10 base2,10 base 5 and 10 base T standards.
4.explain piconet and scatternet.
5.explain different notations for IPV4 addressing and mention their
classes.
6.differerentiate unicast,broadcast and multicast routing.
7.what do you mean by cryptography and write short notes on
cryptographic algorithms.
8.eplain server model and mention ranges of well known and registered
ports.
9.write short notes on TCP and UDP.
10.write a short notes on DNS and firewalls.
Part B 5x10=50
11.explain OSI reference model.
or
12.elucidate FDM,WDM and TDM multiplexing techniques.
13.explain data link control protocols
or
14.explain different types of LAN with example and mention their
characteristics.
15.explain the structure of IVP6.
or
16.explain about ARP and RARP network protocols.
17.explain three way hand shaking techniques.
or
18.elucidate about PGP.
19.Explain the architecture of E-mail.
or
20.explain voice over IP.
SOFTWARE ENGINEERING
posted By
sireesha(III sem)
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION , October 2008
Third Semester (2007-2008)
Paper-303- SOFTWARE ENGINEERING
Time:
3 Hrs Maximum:
70 Marks
Section-A
Answer Any Five questions ( 5 X
4 = 20 )
1.write short notes on object-oriented model.
2.write short notes on win-win spiral model.
3.List out software myths.
4.discuss about the function-oriented analysis.
5.write a snall note on SADT.
6.Describe Risk Analysis in
Software design.
7.Describe the incremental approach to software design.
8.Explain Glass box testing.
9.Define regression testing.
10.Explain Reverse Engineering.
(5x4=20
marks)
Part-B
Answer any five questions,choosing one
from each unit.
All
questions carry equal marks.
UNIT
I
11. (a) What ate the main features of software Project Plan ?
(b)Describe any two
Software Life Cycle models.
Or
12. Write short notes on the following:
(a) Waterfall model.
(b) Object-oriented model.
UNIT
II
13. How to translate the analysis model in Design model.
Or
14. (a) How is the function
oriented approach to behavioural specification useful ?
(b) Lidt the measures of
Good Requirements Specifications. Turn
over
15. How Categorize the Software Measurement
Or
16. (a) Describe User-Interface
analysis and design methods.
(b) Describe the
incremental approach too software design.
UNIT
IV
17. Explain the following giving
examples:
(a) Black Box testing.
(b) white box testing.
Or
18. (a) Discuss how Mutation Testing and Control flow based criteria
are useful in white box-testing.
(b) Explain :
(i) Regression testing.
(ii) Data-flow
testing.
UNIT V
19. (a) Describe the W5 HH Principales.
(b) Explain in detail
Reverse Engineering.
Or
20. (a) With examoles explain software Re-engineering.
(b) What are McCall’s
quality factors.
(5x10=50
marks)
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION NoVEMBER 2010
Third Semester (2007-2008)
Paper-303- SOFTWARE ENGINEERING
Time:
3 Hrs Maximum:
70 Marks
Section-A
Answer Any Five questions
Each
question carries 4 marks.
1. What is Software Engineering
? What is the difference between Software Engineering and Systems
Engineering ?
2. How do software Engineer characterize software ?
3. Software doesn’t wear out, so why would it conform to the bathtub
curve.
4. What is software process model ? What are the benfits of using
software process model ?
5.Write the different phases of waterfall model.
6. What is software Requirement Engineering ? When does Requirements
Engineering start ?
7. Exp;ain differen types cohesion?
8. What is Reuirement Elicitation ?
9. What are the different
Teasting strategies ?
10. Define software Re-engineering.
(
5 X 4 = 20 marks)
Part-B
Answer any five questions,choosing one
from each unit.
All
questions carry equal marks.
UNIT
I
11. (a) Explain spiral model for a software. Is apiral model widely
used ? (5 marks)
(b) Explain about prototype
model. (5
marks)
12. What is CMM? Explain the different levels of it. (10
marks)
Turn
over
UNIT
II
13.How can you Build Analysis model ?
14. Discuss Web engineering process and Analysis models for web apps. (10 marks)
UNIT
III
15. explain the difference between Architectural Design and component-level design.
Or
16. Explain the Design concepts in Design Engineering.
(10
marks)
UNIT
IV
17. Discuss Basis Path Testing.
Or
18. List out Various objects-oriented Testing methods.
(10
marks)
UNIT
V
19. (a) What is software quality ?What are McCall’s quality
factors. (5
marks)
(b) Describe the W5HH
principales. (5
marks)
Or
20. Explain Function-Based Matrics for Requirements model.
(10
marks)
DESIGN AND ANALYSIS OF ALGORITHMS
posted By
sireesha(III sem)
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION OCTOBER 2009
Third Semester (2007-2008)
Paper-304- DESIGN AND ANALYSIS OF
ALGORITHMS
Time:
3 Hrs Maximum:
70 Marks
Part A
Answer Any Five questions
Each question carries 4 marks.
1. Explain space and time complexity with examples.
2. Explain tree vertex splitting with algorithm.
3. What reliability Design problem?
4. Describe nranch and bound.
5. Explain multi stage graph.
6. Wrote a short note of String editing.
7. What is hypercube ? Give an example.
8. What are the NP-HSRD code generation problem ?
9. What are techniques for algebraic problems ?
10. What is mean by bi-connected greaphs ? Exp;ain the procedure of
transformation of a graph into
Bi-connected.
Part-B
Answer any five questions,choosing one
from each unit.
All
questions carry equal marks.
UNIT
I
11. Exp;ain Knapsack problem using Greedy method.
Or
12. Define the Asymptotic Notation used for best case, average case and
worst case analysis of algorithms.
Turn
over
UNIT II
13.explain traveling salesman problem using dynamic programming
approach.
Or
14.describe various traversal techniques for graphs.
UNIT III
15.discuss back tracking algorithm for the graph coloring problem.
Find its time complexity.
Or
16. Explain 8 Queens Problem in details.
UNIT IV
17.state and prove cooks theorem.
Or
18.explain NP-Hard scheduling problem.
UNIT V
19.Discuss packet routing in mesh.
Or
20.Discuss various PPR routing algorithms.
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION NOVEMBER 2010
Third Semester (2007-2008)
Paper-304- DESIGN AND ANALYSIS OF
ALGORITHMS
Time:
3 Hrs Maximum:
70 Marks
Part A
Answer Any Five questions
Each question carries 4 marks.
1.write and explain the control abstraction for divide and conquer.
2.differentiate between priori analysis and posteriori analysis.
3.write a algorithm for binary search.
4.write a Greedy algorithm.
5.Explain the BFS algorithm.
6.Explain space and time complexity with an example.
7.describe graph coloring problem.
8.Describe hypercube? Give an example.
9.Explain the Strassen’s matrix multiplication.
10.Differentiate between NP-complete and NP-Hard.
PART B
UNIT I
11.write an algorithm to sort N number in ascending order using Merge
Sort.
Or
12.Write the Quick Sort Algorithm?
Analyze the time complexity in
Worst case.
UNIT II
13.What is travelling sales persons problem and what are its
applications?
Or
14.write Prim’s Algorithm under the assumption that the graphs are
represented by adjacency lists.
UNIT III
15.Describe graph coloring problem and its time complexity.
Or
16.write an algorithm of 8-queens problem using background.
UNIT IV
17.State and prove Cooks theorem.
Or
18.Explain the classes of P and NP.
UNIT V
19.Discuss packet routing in mesh.
Or
20.Discuss various PPR routing algorithms.
TECHNICAL COMMUNICATION AND COMPUTER ETHICS
posted By
sireesha(III sem)
MASTER OF COMPUTER APPLICATIONS DEGREE
EXAMINATION OCTOBER 2009
Third Semester (2007-2008)
Paper-305-TECHNICAL COMMUNICATION AND
COMPUTER ETHICS
Time:
3 Hrs Maximum:
70 Marks
Part A
Answer Any Five questions
Each question carries 4 marks.
1.explain phonemes.
2.explain the word accent.
3.explain the techniques for effective speaking.
4.write short note on technical reports.
5.what are the steps involved in writing user manuals.
6.what are the features of connected speech?
7.Explain philosophical ethics.
8.write a short note on Netiquette.
9.Explain about software piracy.
10.Explain the rights of Engineering Professionals.
PART B
UNIT I
11.Explain the features of connected speech and list some suggestions
for improvement of Indian English.
Or
12.Explain the human speech production mechanism with sketch.
UNIT II
13.Explain the techniques for Writing effective E-mail.
Or
14.Explain the objectives of writing technical reports and summaries.
UNIT III
15.Discuss about professional ethics.
Or
16.Discuss about utilitarianism and social policy ethics.
UNIT IV
17.Discuss about various issues in software piracy.
Or
18.Explain about ethical hacking.
UNIT V
19.Discuss the professional
Responsibilities of engineers.
Or
20.Explain the Ethics and Rights Ethics in research and
Experimentation.
No comments:
Post a Comment