Madhya Pradesh Bhoj (Open) University, Bhopal Class : MCA I st Year

Similar documents
DATA STRUCTURES USING C

Data Structure [Question Bank]

PES Institute of Technology-BSC QUESTION BANK

10CS35: Data Structures Using C

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

Binary Search Trees CMPSC 122

Data Structures. Level 6 C Module Descriptor

Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Question Bank Subject Name: EC Microprocessor & Microcontroller Year/Sem : II/IV

2) What is the structure of an organization? Explain how IT support at different organizational levels.

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur

Assessment for Master s Degree Program Fall Spring 2011 Computer Science Dept. Texas A&M University - Commerce

BCS2B02: OOP Concepts and Data Structures Using C++

Java Software Structures

CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) Total 92.

2. Advance Certificate Course in Information Technology

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT. Course Curriculum. DATA STRUCTURES (Code: )

University of Dayton Department of Computer Science Undergraduate Programs Assessment Plan DRAFT September 14, 2011

USTC Course for students entering Clemson F2013 Equivalent Clemson Course Counts for Clemson MS Core Area. CPSC 822 Case Study in Operating Systems

Binary Search Trees. A Generic Tree. Binary Trees. Nodes in a binary search tree ( B-S-T) are of the form. P parent. Key. Satellite data L R

Converting a Number from Decimal to Binary

Ordered Lists and Binary Trees

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

Division of Mathematical Sciences

COMPUTER SCIENCE. Paper 1 (THEORY)

MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push)

B.Sc.(Computer Science) and. B.Sc.(IT) Effective From July 2011

Embedded Software development Process and Tools: Lesson-4 Linking and Locating Software

Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010

University of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year )

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

The Elective Part of the NSS ICT Curriculum D. Software Development

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

AP Computer Science AB Syllabus 1

Questions 1 through 25 are worth 2 points each. Choose one best answer for each.

Class XII (Theory) C++

2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]

Data Structures and Algorithms

Information and Communications Technology Courses at a Glance

Department of Computer Science

CSE 544 Principles of Database Management Systems. Magdalena Balazinska Fall 2007 Lecture 5 - DBMS Architecture

1. Relational database accesses data in a sequential form. (Figures 7.1, 7.2)

ER E P M A S S I CONSTRUCTING A BINARY TREE EFFICIENTLYFROM ITS TRAVERSALS DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A

CS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week

Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types

Data Structure with C

Exercises Software Development I. 11 Recursion, Binary (Search) Trees. Towers of Hanoi // Tree Traversal. January 16, 2013

How To Teach C++ Data Structure Programming

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

KITES TECHNOLOGY COURSE MODULE (C, C++, DS)

Relational Databases

Please consult the Department of Engineering about the Computer Engineering Emphasis.

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION /5:15-6:45 REC-200, EVI-350, RCH-106, HH-139

Binary Heap Algorithms

Gates, Circuits, and Boolean Algebra

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

Weighted Total Mark. Weighted Exam Mark

Scheduling. Scheduling. Scheduling levels. Decision to switch the running process can take place under the following circumstances:

ML for the Working Programmer

Mathematics for Algorithm and System Analysis

Describe the process of parallelization as it relates to problem solving.

Data Structures, Practice Homework 3, with Solutions (not to be handed in)

International Journal of Software and Web Sciences (IJSWS)

root node level: internal node edge leaf node Data Structures & Algorithms McQuain

All JNTU WORLD. Wipro Previous Year Question Paper. Aptitude Questions :

Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme)

This tutorial will take you through step by step approach while learning Operating System concepts.

DE 6211 DISTANCE EDUCATION. M.Sc. (IT) DEGREE EXAMINATION, MAY PRINCIPLES OF INFORMATION TECHNOLOGY. (2002 onwards) PART A (10 3 = 30 marks)

Basic Logic Gates Richard E. Haskell

MULTIPLE CHOICE FREE RESPONSE QUESTIONS

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.

THREE YEAR DEGREE (HONS.) COURSE BACHELOR OF COMPUTER APPLICATION (BCA) First Year Paper I Computer Fundamentals

Computer Science. 232 Computer Science. Degrees and Certificates Awarded. A.S. Degree Requirements. Program Student Outcomes. Department Offices

Network Model APPENDIXD. D.1 Basic Concepts

Distributed Databases

Computer Science/Software Engineering

Embedded C Programming, Linux, and Vxworks. Synopsis

DATABASE DESIGN. - Developing database and information systems is performed using a development lifecycle, which consists of a series of steps.

Let s put together a Manual Processor

GCE Computing. COMP3 Problem Solving, Programming, Operating Systems, Databases and Networking Report on the Examination.

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Operating Systems CSE 410, Spring File Management. Stephen Wagner Michigan State University

COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM

Didacticiel Études de cas. Association Rules mining with Tanagra, R (arules package), Orange, RapidMiner, Knime and Weka.

A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION

OS OBJECTIVE QUESTIONS

Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries

FOPR-I1O23 - Fundamentals of Programming

ENGI 241 Experiment 5 Basic Logic Gates

Graduate Assessment Test (Sample)

List of courses MEngg (Computer Systems)

Chapter 2 Logic Gates and Introduction to Computer Architecture

COMBINATIONAL CIRCUITS

Data Structures and Data Manipulation

Chapter 3: Operating Systems

COURSE TITLE COURSE DESCRIPTION

Transcription:

Class : MCA I st Year 201415 Subject : Computer Organization and System Software 3& l=h; dk;z tek djus dh vafre frffk 30092015 gsa Q.1 Explain the Combinational Logic Circuit Design in detail. Q.2 Explain Multiplexer and DE multiplexers. Q.3 What do you mean by Microinstructions? Explain Microinstruction Format. Q.4 What is Parallel Processing? Describe Flynn's Classification, Q.5 What is a Loader? Explain Linking and Loading Schemes. Q.1 Explain various logic gates with suitable diagram and truth table. Q.2 Write a detail note on Microprocessor? Q.3 What is Memory? Explain its types. Q.4 What is System Software? Explain Assembly Language Programming. Q.5 What is an Operating System? Explain Kernel of an Operating System.

Class : MCA I st Year 201415 Subject : Programming In C 3& l=h; dk;z tek djus dh vafre frffk 30092015 gsa Q.1. Discuss programming languages and its various types. Q.2. Explain different data types in C. Q.3. Q.5. Explain Array with the help of a program. Write a program in C to calculate the sum of matrix A and matrix B Write a program in C to find the factorial of a given number. Q.1. What is an algorithm? Discuss with an example. Q2. Explain different string manipulation function with suitable examples. Q.3. Q.5. What is Storage Classes? Explain operations on pointers and array of pointers. Write a program in C for addition of three number using function

Class : MCA I st Year 201415 Subject : Data Structure and Algorithms 3& l=h; dk;z tek djus dh vafre frffk 30092015 gsa Q 1. Q 2. Q 3. Q 4. Q 5. Explain the Array Data Structure and its Memory Representation. Explain Simple Linked List and its Application Explain Binary Tree and its Representation Write a procedure to sort the following sequence using Heap Sort. 25 57 48 37 12 92 86 33.. Sort the following list using Bubble sort algorithm: 7, 9, 20, 2, 16, 5, 50 Also show the steps in sorting process. Q 1. Q 2. Write short note on abstract data types? Explain the ADT Queue. Q 3. Write the algorithms for each of the following for binary trees : (i) Inorder traversal (ii) Preorder traversal (iii) Postorder traversal Q 4. Q 5. Explain Spanning Trees with example. Given an array of 6 elements: 15, 19, 10, 7, 17, 16 sort it in ascending order using heap sort.

Class : MCA I st Year 201415 Subject : Operating System 3& l=h; dk;z tek djus dh vafre frffk 30092015 gsa Q1. What is an Operating System? Explain Operating System Structure? Q2. Write short note on : a) Semaphores b) Dispatcher Q3. Explain Deadlock Avoidance and Dead lock Detection. Q4. Describe Cryptography. Q5. Write short note on : Remote File Access File Replication Q1. What is process Scheduling? Compare FCFS and SJF scheduling? Q2. What is deadlock? Discuss methods of handling deadlock? Q3. Write about paging and segmentation? Q4. Discuss Functions and Requirements of Multiprocessor Operating systems. Q5. Describe Bottlenecks and Saturation.

Class : MCA I st Year 201415 Subject : Database Management Systems 3& l=h; dk;z tek djus dh vafre frffk 30092015 gsa Q.1. Q.2. Q.3. Explain Data Base Management SystemArchitectures and Features. Explain following Term with suitable example (a) Weak Entity Sets (b) EER model What is database schema? Explain the select, project, natural join, union and Cartesian product operations. Explain normalization and Why should normalization be performed on a table and what are its benefits. Q.5. Explain BoyceCodd Normal Form. Q.1. What is data independence? Explain the difference between physical and logical data independence with example. Q.2. What is EntityRelationship model? Explain the steps to reduce the ER diagram to ER database schema. Q.3. Explain the Selection Operator and the Projection Operator. Q.5. Explain normal forms with example. What is a transaction? Explain the ACID properties.

Class : MCA I st Year 201415 Subject : Progrmming in Visual Basic 3& l=h; dk;z tek djus dh vafre frffk 30092015 gsa Q.1 What is Integrated Development Environment? Explain it? Q.2 Explain Control Flow Statements with example. Q.3 Explain Object Linking and Embedding. Q.4 Diffence between the List Box and Combo Box Controls? Q.5 Explain any five ActiveX Controls. Q.1 How can we create a New Project in VB? Q.2 Expalin User Defined Data Types in VB. Q.3 What is Form? Describe the Properties of Forms? Q.4 Diffence between the Radio Buttons and Check Boxes? Q.5 Explain any five Enhanced Control.

Class : MCA I st Year 201415 Subject : Mathematical Foundation of Computer Science 3& l=h; dk;z tek djus dh vafre frffk 30092015 gsa 1. Solve the recurrence relation ar + 5ar 1 + 6 ar2 =3r2 2r +1 2. State and prove Demorgan law. 3. Show that cube root of unity to form a group. 4. Derive inclusion and exclusion principal 5. Prove the following equation (1 + 00 * 1) + (1 + 00 * 1) (0 + 10* 1) (0 + 10* 1) = 0 * 1 (0+10*1)* 1. Solve the following difference equation by the method of generating function. ar 7ar1 + 10 ar2 = 3r r >/2 with the boundary condition a0 = 0 & a1= 1 2. State and prove absorption law and involution law. 3. Define Abelian Group with an example. 4. Write shots note of the following terms: (a) Equivalence Relation (b) Type of Relation (c) Function ( Mapping) 5. Explain Properties of ContextFree Languages