July 2012 Masters in Computer Application (MCA) - Semester 2 MCA 2010 Operating System 4 Credits

Similar documents
R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

Question Paper Code : 97044

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)

JAIPUR NATIONAL UNIVERSITY, JAIPUR

MAHARAJA KRISHNAKUMARSINHJI BHAVNAGAR UNIVERSITY NAAC Accreditation Grade B (With effect from Academic Year: )

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis

12 Abstract Data Types

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

DATA STRUCTURES THROUGH C++

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

Course Name: B.Tech. 3 th Sem. No of hours allotted to complete the syllabi: 44 Hours No of hours allotted per week: 3 Hours. Planned.

CS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon

Course Review for Finals. Cpt S 223 Fall 2008

Note: Select one full question from each unit

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

PESIT Bangalore South Campus Department of MCA Course Information for

17CS33:Data Structures Using C QUESTION BANK

2 nd SEMESTER MCA F.M -70

CS 206 Introduction to Computer Science II

Course Review for. Cpt S 223 Fall Cpt S 223. School of EECS, WSU

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

First Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms...

ADMINISTRATIVE MANAGEMENT COLLEGE

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

CSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid

CSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid. Fall 2018

Sample Question Paper

VALLIAMMAI ENGINEERING COLLEGE

SAURASHTRA UNIVERSITY

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II

EC8393FUNDAMENTALS OF DATA STRUCTURES IN C Unit 3

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05

CS 445: Data Structures Final Examination: Study Guide

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK

DATA STRUCTURES USING C

Linear Data Structure

Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

Code No: R Set No. 1

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))

Course Review. Cpt S 223 Fall 2009

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.

CS2013 Course Syllabus Spring 2018 Lecture: Mon/Wed 2:00 P.M. 2:50 P.M. SH C259 Lab: Mon/Wed 2:50 P.M. 4:00 P.M. SH C259

Data Structures. 1. Each entry in a linked list is a called a (a)link (b)node (c)data structure (d)none of the above

Main Points of the Computer Organization and System Software Module

1) What is information system? Describe the basic concepts of information systems.

Draw a diagram of an empty circular queue and describe it to the reader.

INSTITUTE OF AERONAUTICAL ENGINEERING

INFORMATION TECHNOLOGY COURSE OBJECTIVE AND OUTCOME

Course Review. Cpt S 223 Fall 2010

SNS COLLEGE OF ENGINEERING

Computer Programming II C++ (830)

Table of Contents. Chapter 1: Introduction to Data Structures... 1

Silver Oak Engineering College and technology Information Technology Department

SARDAR RAJA COLLEGE OF ENGINEERING

Data Structures in C++ Using the Standard Template Library

Quantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2

MID TERM MEGA FILE SOLVED BY VU HELPER Which one of the following statement is NOT correct.

CS302 Data Structures using C++

M.C.A DEGREE EXAMINATION,NOVEMBER/DECEMBER 2010 Second Semester MC 9222-OBJECT ORIENTED PROGRAMMING (Regulation 2009)

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

1 PCA151C Data Structures Using C PCA152C Operating Systems PCA153C Introduction to Web Technologies

1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

Department of Computer applications. [Part I: Medium Answer Type Questions]

R. C. TECHNICAL INSTITUTE, SOLA

Discuss the following operations on One-Dimensional array with algorithms.

Prepared By: Ms. Nidhi Solanki (Assist. Prof.) Page 1

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

Problem solving using standard programming techniques and Turbo C compiler.

Cpt S 223 Fall Cpt S 223. School of EECS, WSU

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

IN COLLABORATION WITH IVTB. Diploma in Information Technology

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE

(PGDCA 01) ASSIGNMENT -1 PG DIPLOMA DEGREE EXAMINATION, DECEMBER 2017 COMPUTER APPLICATIONS Information Technology

Sub: EM-III (14MA301) Section: A & B Date: 13/07/17 One Mark Questions: 1. a) Write the iterative formula to compute 3 N by Newton s method.

CS 216 Fall 2007 Final Exam Page 1 of 10 Name: ID:

MNPE In Collaboration with. Karnataka State Open University. Manasagangotri, Mysore-6. Syllabus. Diploma in Computer Application

Post Graduate Diploma in Computer Applications I Semester INTERNAL ASSIGNMENT QUESTIONS (November, 2017)

Section I. 1 Review of user defined function,recursion, pointer, structure 05 2 Introduction to Data Structures and stack

Major Requirements of an OS

a) State the need of data structure. Write the operations performed using data structures.

Objective Questions for Online Practical Exams under CBCS Scheme Subject: Data Structure-I (CS-113)

CISC 3130 Data Structures Spring 2018

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

Sai Nath University. Assignment For BCA 3 RD Sem.

Time: 3 HOURS Maximum Marks: 100

Seth Jai Parkash Polytechnic, Damla

Operating System(16MCA24)

Transcription:

MCA 2010 Operating System 4 Credits (Book ID: B1405) Assignment Set 1 (60 Marks) Each question carries Ten marks 6 x 10 = 60 1. Explain a) Multi-programmed Batched Operating Systems b) Real - time Systems 2. Discuss on UNIX kernel components. 3. Explain process creation and process termination. 4. Discuss about priority scheduling. 5. What are Semaphores? Explain. 6. When Deadlock occurs? What are the Necessary Conditions for Deadlock?

MCA2010 Operating Systems 4 Credits (Book ID: B1405) Assignment Set 2 (60 Marks) Each question carries Ten marks 6 x 10 = 60 1. Discuss about Demand paging. 2. What are the different file access methods? Explain. 3. Explain program-controlled I/O? 4. List and explain the main functions of Network Operating System (NOS). 5. Write a note on computer virus. 6. What are the advantages of multiprocessors? Explain. 1

MCA 2020 Advanced Data Structure 4 Credits (Book ID: B1476) Assignment Set 1 (60 Marks) Each question carries ten marks 6 x 10 = 60 marks 1. Write a short note on operations of data structures. 2. Explain the various mathematical function and notation in detail. 3. Discuss the insertion and deletion operation of linked list in detail. 4. Discuss the process of Infix to postfix conversion. Also explain Postfix evaluation. 5. Explain the different types of traversal on binary tree. 6. Discuss the algorithm with example to insert and delete an element into BST.

MCA 2020 Advanced Data Structure 4 Credits (Book ID: B1476) Assignment Set 2 (60 Marks) Each question carries ten marks 6 x 10 = 60 marks 1. Discuss the insertion and deletion process in AVL tree. 2. Explain Breadth-first and depth-first search algorithm. 3. Explain how Dijkstra s algorithm is used to find the shortest path of Directed weighted graph. 4. Explain the meaning of dynamic storage management. 5. Explain merge sort with example. Also discuss binary search with example. 6. Explain sequential file structure. What do you mean by sorting on disks? 1

MCA 2030 Object Oriented Programming- C++ 4 Credits (Book ID: B1641) Assignment Set 1 (60 Marks) Each question carries ten marks 6 x 10 = 60 1. Write a program that accepts two numbers from the user and swaps the two numbers without using a temporary variable. 2. Write a program that stores 100 numbers in the array. The user should be able to search a particular number in the array. Implement sequential search for this purpose. 3. Define a structure named product with elements productcode, description, unitprice and qtyinhand. Write a C++ program that implements the structure and enables to store atleast 100 product data. 4. Explain Brief about class and objects. 5. Implement a class stack which simulates the operations of the stack allowing LIFO operations. Also implement push and pop operations for the stack. 6. Create a class string which stores a string value. Overload ++ operator which converts the characters of the string to uppercase (toupper library function of ctype.h can be used). Also discuss the advantage and disadvantage of operator overloading in brief.

MCA 2030 Object Oriented Programming- C++ 4 Credits (Book ID: B1641) Assignment Set 2 (60 Marks) Each question carries Ten marks 6 x 10 = 60 1. Explain the concept of virtual function. Discuss the role of polymorphism in OOPS. 2. Write a program that opens a text file named sample.txt and then prints the contents to the printer. 3. Explain the standard Input/Output iostream library 4. Explain the types of methods to open a file. 5. How are static members declared within a template class? Explain with an example 6. Name and describe the STL components. Also describe the two basic exception handling models. 1

Masters in Computer Application (MCA) Semester 2 MCA 2040 - Communication Skills 2 Credits (Book ID: B1026) Assignment Set -1 (30 Marks) Answer all the questions: 1. Give five examples for non-verbal communication. [5marks] 2. What are the prosodic features of speech? [5marks] 3. Is Facebook a means of oral communication? Elaborate. [5marks] 4. Explain semantic markers. [5marks] 5. Differentiate between evaluative listening and comprehensive listening. [5marks] 6. How is hearing different from listening? [5marks]

Masters in Computer Application (MCA) Semester 2 MCA 2040 - Communication Skills 2 Credits (Book ID: B1026) Assignment Set -2 (30 Marks) Answer all the questions: 1. What are the key elements to be included in a resume? [5marks] 2. What are the qualities of a good paragraph? [5marks] 3. In what way is a Fax message different from a telegram? Elaborate. [5marks] 4. Cite two examples for complex sentences. [5marks] 5. Differentiate between extensive reading and intensive reading. [5marks] 6. What is a subject and a predicate in a sentence? Exemplify. [5marks]

MCA 2050 Computer Architecture 4 Credits (Book ID: B1648) Assignment Set 1 (60 Marks) Each question carries ten marks 6 x 10 = 60 marks 1. Explain the concept of Computational Model. Describe its various types. 2. What are the components of Instruction Set architecture? Discuss in brief. 3. Explain the different types of addressing modes. 4. Describe pipelining processing. Explain the sequence of instructions in pipelining. 5. Describe the logical layout of both RISC and CISC computers. 6. Explain the Tumasulo approach

MCA 2050 Computer Architecture 4 Credits (Book ID: B1648) Assignment Set 2 (60 Marks) Each question carries ten marks 6 x 10 = 60 1. Explain the concept of Trimedia TM32 Architecture. 2. What is meant by direct mapping? Discuss the various types of mapping? 3. Explain the various types of vector instructions in detail. 4. Explain the hardware architecture of parallel processing. 5. Describe the various problems of scalable computers. Explain the ways to resolve them. 6. Discuss scalable and multithreaded architectures. Define RAID. Also explain the levels of RAID. 1