assignmentssolution@gmail.com

Get Assignments and Projects prepared by experts at a very nominal fee.

More than 8 years in assisting assignments and projects/dissertation/thesis of MBA,BBA,BCA,MCA,PhD and others-

Contact us at : Email : assignmentssolution@gmail.com

Help for : SMU, IIBM,IMT, NMIMS, NIBM ,KSBM, KAIZAN, ISBM, SYMBIOSIS, NIMS, IGNOU, XAVIER, XIBMS, ISM, PSBM, NSBM, NIRM, ISBM, ISMRC, ICMIND, UPES and many others.

Help in : Assignments, projects, M.Phil,Ph.D disseration & thesis,case studies

Courses,MBA,BBA,PhD,MPhil,EMBA,MIB,DMS,MMS,BMS,GDS etc

Contact us at : Email : assignmentssolution@gmail.com



Monday 9 July 2012

Spring 2012 Master of Computer Application (MCA) – Semester II: FOR ANSWERS contact us at assignmentssolution@gmail.com

Spring 2012 Master of Computer Application (MCA) – Semester II MC0066 – OOPS using C++ – 4 Credits (Book ID: B0681 & B0715) Assignment Set – 1 (40 Marks) Questions From Book-ID : B0681 1. Distinguished between procedural language and OOP language. And Explain the key features of OOP. [ 5 Marks ] 2. What is function overloading? Write a c++ program to implement a function overloaded.
[ 5 Marks ] 3. Discuss the constructors and Destructors with suitable example. [ 5 Marks ] 4. What do you mean by operator overloading? Illustrate with suitable example for overloading Unary operators. [ 5 Marks ] Questions From Book-ID : B0715 5. Write C++ program which demonstrate the difference between static and dynamic binding. [ 5 Marks ] 6. Difference between a static member function and non-static member functions with appropriate example. [ 5 Marks ] 7. Writer C++ program to demonstrate the complete implementation of class template stack. [ 5 Marks ] 8. What is template specialization? Describe a scenario in which template class partial specialization is considered appropriate. [ 5 Marks ]Spring 2012 Master of Computer Application (MCA) – Semester II MC0066 – OOPS using C++ – 4 Credits (Book ID: B0681 & B0715) Assignment Set – 2 (40 Marks) Questions From Book-ID : B0681 1. Write advantage of multiple inheritances. And write ac++ program to implement the multiple inheritances. [ 10 Marks ] 2.. Discuss the types of Inheritance with suitable example for each. [ 5 Marks ] 3. Write a c++ program to implements the relational operator overloading for the distance class. [ 5 Marks ] Questions From Book-ID : B0715 4. Write the advantages of using exception handling with its basic models.[ 5 Marks ] 5. Discuss the various STL components in brief. [ 5 Marks ] 6. Describe the time overhead of operations on sequence containers. [ 5 Marks ] 7. Discuss how object diagrams are different from class diagram. [ 5 Marks ]
Spring 2012 Master of Computer Application (MCA) – Semester II MC0067 – Database Management – 4 Credits (Book ID: B0716 & BO717) Assignment Set – 1 (40 Marks) [Each Question carries 5 Marks] BOOK ID: B0716 & BO717 1. Write about:  Linear Search  Collision Chain With respect to Hashing Techniques 2. Write about:  Integrity Rules  Relational Operators with examples for each 3. Write about:  Three Level Architecture of a database  Services of a Database System 4. Explain the SQL syntax for:  Table Creation with constraint imposing using an example  Functions Count, Sum, Average with appropriate examples 5. Compare and Contrast the Centralized and Client / Server Architecture for DBMS. 6. Taking an example Enterprise System, List out the Entity types, Entity Sets, Attributes and Keys 7. Illustrate with an example of your own the Relational Model Notations 8. Consider a University Database System and develop the ER Conceptual Schema diagram i.e. E-R Diagram for the same
Spring 2012 Master of Computer Application (MCA) – Semester II MC0067 – Database Management – 4 Credits (Book ID: B0716 & BO717) Assignment Set – 2 (40 Marks) [Each Question carries 5 Marks] BOOK ID: B0716 & BO717 1. Write about:  Physical Storage Structure of DBMS  Indexing 2. Write about:  Application Logic  One Tier Architecture  Client / Server Architecture 3. Write about:  Basic Constructs of E-R Modeling  E-R Notations with examples 4. Write about:  Types of Discretionary Privileges  Propagation of Privileges using Grant Option with appropriate examples for each 5. Describe the following Association Rules:  Classification  Clustering 6. Write about:  Categories of Data Models  Schemas, Instances and Database States With an example for each 7. Taking an example Enterprise System, List out the Relationship types, Relationship sets and roles 8. With an example show that Serializability can be guaranteed with two – phase locking
Spring 2012 Master of Computer Application (MCA) – Semester II MC0068 – Data structutes using ‘C’ – 4 Credits (Book ID: B0701 & BO702) Assignment Set – 1 (40 Marks) Questions From Book-ID : B0701 1. Write the advantages of implementation checks preconditions. [ 5 Marks] 2. Discuss the STACK operation with Suitable example and Show how to implement stack operations of integer in C by using array. [ 10 Marks] 3. Discuss how Queues are differ from Stack. [ 5 Marks] Questions From Book-ID : B0702 4. Explain the AVL Tree with suitable example? [ 4 Marks] 5. Insert the keys in order show into an initially empty VAL tree. And show the sequence of trees produced by these insertions. A,Z,B,Y,T,M,E,W,D,G,X,F,P,O,C,H,Q,S [ 6 Marks] 6. Explain the adjacency Matrix and adjacency List with suitable example. [ 5 Marks] 7. Write a algorithm for the followings: i. Dijkstra Algorithm ii. Bellman-Ford Algorithm [ 5 Marks]
Spring 2012 Master of Computer Application (MCA) – Semester II MC0068 – Data structutes using ‘C’ – 4 Credits (Book ID: B0701 & BO702) Assignment Set – 2 (40 Marks) Questions From Book-ID : B0701 1. Illustrate to implement dqueue using circular linked list. [ 10 Marks] 2. .What do you mean by searching? Define searching problem and how do you evaluate the performance of any searching algorithm? [ 10 Marks] Questions From Book-ID : B0702 3. Compare and contrast DFS and BFS and DFS+ID approaches [5 Marks] 4. Discuss how Splay Tree differs from a Binary Tree? Justify your answer with appropriate example. [5 Marks] 5. Write note on : i. Threaded lists ii. Dynamic Hashing [ 10 Marks]
Spring 2012 Master of Computer Application (MCA) – Semester II MC0069 – System Analysis and Design – 4 Credits (Book ID: B0714) Assignment Set – 1 (60 Marks) Book ID: B0714 Each question carries six marks 10 x 6 = 60 1. Explain the four basic principles of modeling. 2. How do you model template classes in the UML? 3. Explain the significance of aggregation with an example. 4. Discuss UML’s extensibility mechanisms. 5. Give a brief note on the UML’s five behavioral diagrams. 6. Explain the necessary steps to reverse engineer an object diagram. 7. Explain the terms context, objects and roles, links, messages 8. Explain the five parts of a transition. 9. Explain the 3 steps to be considered to model an API. 10. Explain the importance of models.
Spring 2012 Master of Computer Application (MCA) – Semester II MC0069 – System Analysis and Design – 4 Credits (Book ID: B0714) Assignment Set – 2 (60 Marks) Book ID: B0714 Each question carries six marks 10 x 6 = 60 1. Explain the four kinds of relationships in UML. 2. What are the considerations that should be taken care to model the distribution of responsibilities in a system? 3. Explain dependency in detail and also how is it different from dependency. 4. Define stereotype, tagged value and constraint. 5. What is the main advantage of modeling a system at different levels of abstraction by presenting diagrams with different levels of detail? 6. Explain the process of modeling a logical database schema? 7. Explain the concept of sequencing. 8. Explain the different components of states with reference to state machines. 9. Explain behavioral aspects of collaboration with an example. 10. Explain with a neat diagram how you would model the architecture of a system.
MCA –New Operating Systems
Spring 2012 Master of Computer Application (MCA) – Semester II MC0070 – Operating System – 4 Credits (Book ID: B0682 & B0683) Assignment Set – 1 (60 Marks) Part-A (Each question carries equal marks) (1* 5) =5 marks 1. List out salient Operating System functions. 2. List out major components of Operating System 3. Define Process. 4. Define Threads. 5. Mention the necessary conditions for Deadlock occurrence. Part-B 1. Write a note on: (5+5) Marks  Real Time Operating Systems (RTOS)  Distributed Operating Systems 2. Write a note on: (5+5) Marks  Micro Kernel Architecture  Unix Architecture 3. Bring out the features of Best Fit, Worst Fit and First Fit with a block diagrams illustrating them (10) Marks 4. Bring out the salient features of: (2+3) Marks  Paging  Segmentation

MCA –New Operating Systems
5. Define Cache Memory: (10) Marks  Bring out the concepts of Basic Cache Memory structure  Concept of Associative mapping  Fully Associative mapping 6. For the following reference string with three page memory frame: 10 marks 6, 0, 1, 2, 3, 4, 2, 3, 6, 0, 3, 2, 1, 2, 0, 1, 6, 1, 0, 3 a. Apply FIFO algorithm b. Apply LRU algorithm c. Apply Optimal algorithm d. Apply Clock algorithm

MCA –New Operating Systems
5. Define Cache Memory: (10) Marks  Bring out the concepts of Basic Cache Memory structure  Concept of Associative mapping  Fully Associative mapping 6. For the following reference string with three page memory frame: 10 marks 6, 0, 1, 2, 3, 4, 2, 3, 6, 0, 3, 2, 1, 2, 0, 1, 6, 1, 0, 3 a. Apply FIFO algorithm b. Apply LRU algorithm c. Apply Optimal algorithm d. Apply Clock algorithm

 

No comments:

Post a Comment