Madhya Pradesh Bhoj (Open) University, Bhopal

Similar documents
M P BHOJ (OPEN) UNIVERSITY, BHOPAL ASSIGNMENT QUESTION PAPER

ADMINISTRATIVE MANAGEMENT COLLEGE

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

5. Give any three parts of the structure of business letter.

ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM II BTech (CSE) I Semester BTCSE301 DIGITAL LOGIC DESIGN MODEL QUESTION PAPER

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE

LOGIC AND DISCRETE MATHEMATICS

CS/IT DIGITAL LOGIC DESIGN

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

SUBJECT: INFORMATION TECHNOLOGY

Time : 3 hours. Full Marks : 75. Own words as far as practicable. The questions are of equal value. Answer any five questions.

Answer key SUBJECT : COMPUTER SCIENCE Time : 3 hour 15 min Max. marks : 70

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

Sai Nath University. Assignment For MCA 2nd Sem.

A Survey of Mathematics with Applications 8 th Edition, 2009

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:

Design and implement a program to solve a real-world problem using the language idioms, data structures,, and standard library.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

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

BCA (Part II) EXAMINATION, 2009 C++ PROGRAMMING Time allowed: Three Hours Maximum Marks: 50 Attempt any five questions

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

Duration: 2 hours Max. Marks: 60

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

The Course Structure for the MCA Programme

SIR C R REDDY COLLEGE OF ENGINEERING

Madhya Pradesh Bhoj (Open) University, Bhopal

BCA (Part II) EXAMINATION 2008 C++ PROGRAMMING Max Time : 3 Hours Max. Marks : 50

CONTENTS Equivalence Classes Partition Intersection of Equivalence Relations Example Example Isomorphis

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

JAIPUR NATIONAL UNIVERSITY, JAIPUR

Object Oriented Programming with c++ Question Bank

Punjab Technical University Bachelor in Mobile Computing & Internet Batch 2014 onwards THIRD SEMESTER

DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY ACADEMIC YEAR (ODD SEM)

Get Unique study materials from

Introductory Combinatorics

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Discrete Mathematical Structures. Answer ONE question from each unit.

Answer any Five Questions. All questions carry equal marks.

«Computer Science» Requirements for applicants by Innopolis University

Chapter 8: Data Abstractions

Propositional Calculus. Math Foundations of Computer Science

Preface to the Second Edition Preface to the First Edition Brief Contents Introduction to C++ p. 1 A Review of Structures p.

RAJIV GANDHI COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY OBJECT ORIENTED PROGRAMMING QUESTION BANK UNIT I 2 MARKS

B.Sc. (Part II) (Information Technology) EXAMINATION, 2009

(DMCA201) ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 Second Year SOFTWARE ENGINEERING. Maximum Marks 30 Answer all questions

VALLIAMMAI ENGINEERING COLLEGE

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics

Big Java Late Objects

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

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

DEPARTMENT OF COMPUTER APPLICATIONS CO 2009 REGULATION

About the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design

DE 6456 DISTANCE EDUCATION. M.Sc. (Software Engineering) (5 Years Integrated) DEGREE EXAMINATION, MAY DIGITAL COMPUTER FUNDAMENTALS

SYLLABUS. M.Sc. I.T. Ist Year

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

COURSE OUTCOMES OF M.Sc(IT)

ii) Do the following conversions: output is. (a) (101.10) 10 = (?) 2 i) Define X-NOR gate. (b) (10101) 2 = (?) Gray (2) /030832/31034

Syllabus Under Autonomy Mathematics

Combinational Circuits Digital Logic (Materials taken primarily from:

TECNIA INSTITUTE OF ADVANCED STUDIES

Government of Karnataka SYLLABUS FOR SECOND PUC - COMPUTER SCIENCE (41) SUB-UNITS

SECOND SEMESTER JAVA PROGRAMMING

Object Oriented Programming with Java. Unit-1

Venkateshwar International School Sector-18, Dwarka, New Delhi-78 SAT- PRELIMINARY ROUND Class XII

Propositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

M.C.A. FIRST YEAR DEGREE

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.

Lecture (04) Boolean Algebra and Logic Gates

Lecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee

CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards

DEPARTMENT OF INFORMATION TECHNOLOGY

CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK

B.Sc. Computer Science (Ancillary)

Course Text. Course Description. Course Objectives. StraighterLine Introduction to Programming in C++

SPLIT-UP SYLLABUS ----CHENNAI REGION COMPUTER SCIENCE (Code: 083) Class-XII Academic Session

UNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.0) Sessional Unit Code. Theory Unit Course

Logic and Computation

Introduction to Computer Architecture

B.Sc II Year Computer Science (Optional)

RAJIV GANDHI COLLEGE OF ENGINEERING AND TECHNOLOGY

LIST OF EXPERIMENTS. (1) (Office Automation)

Course list for the Bachelor of Computer Science in INFORMATION SYSTEM

Govt. of Karnataka, Department of Technical Education Diploma in Information Science & Engineering. Fifth Semester

Assignment No.1 What is ADT? Explain stack as an ADT with suitable example.

Computer Science (CS)

Name of subject: JAVA PROGRAMMING Subject code: Semester: V ASSIGNMENT 1

Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification

Fundamental of I.T. (c) Application of computer *************

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London


Fast Track to Core Java 8 Programming for OO Developers (TT2101-J8) Day(s): 3. Course Code: GK1965. Overview

4. BOOLEAN ALGEBRA 8 5. NETWORKING AND OPEN SOURCE SOFTWARE 10

CHOICE BASED CREDIT SYSTEM (With effect from )

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions.

GARDEN CITY UNIVERSITY. Bachelor of Computer Applications SEMESTER- I. Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++

(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY

Transcription:

Subject- Optimization Techniques Maximum Marks: 20 Q.1 Explain the concept, scope and tools of O.R. Q.2 Explain the Graphical method for solving Linear Programming Problem. Q.3 Discuss the Two phase method for solving Linear Programming Problem by Simplex method. Q.4 Write Note on Vogel s approximation method. Q.5 Distinguish between Transportation and Assignment problem. I Q.1 Discuss the importance of Quantitative Techniques for Marketing, Advertisement and financial planning. Q.2 What is Linear Programming? What are the characteristics of Linear Programming? Q.3 Explain the condition of Degeneracy in Linear Programming. Q.4 What is meant by sensitivity analysis? How sensitivity of a linear programming model is tested? Explain with an example. Q.5 Write Note on MODI method. Q.1 In a Railway marshalling yard, goods trains arrive at rate of 30 trains per day. Assume that the inter arrival time follows an exponential distribution and the service time distribution is also exponentialwith an average of 36 minutes. Calculate: a) Expected queue size(queue length). b) Probability, the queue size exceeds 10. If the input of trains increases to an average of 33 per day, what will be the change in (a) and (b). Q.2 Solve the following Linear Programming Problem by Simplex method: Z=3X1+2X2 Subject to: x1+x2 <= 4; x1-x2 <= 2; x1,x2 >= 0;

Subject- Discrete Structure and Graph Theory Maximum Marks: 20 Q.1 Explain duality law, free and bound variables and universe of disclosure Show that- (P Q) ( P ( P Q)) ( P Q) Q.2 Given to us a diagraph G in the following figure V1 V2 V3 Find all the in-degree and out-degree of the node. List all the nodes which are reachable from another node of digraph. Q.3 Describe following: (i) Spanning tree (ii) Path, Length in Rooted Tree Q.4 Explain permutation group and Burnside s theorem. Q.5 Explain the Design and Implementation of Digital Network. I Q.1 Explain the concept of Negation, conjunction and disjunction? Construct the truth table for the following (A) (P Q) ( P Q) (P Q) ( P Q) (B) P (P Q) Q.2 Explain the following: (i) Directed Graph (ii) Multigraph (iii) Isomorphic graph, path and circuit Q.3 Explain Binary Search tree and Transport Network Q.4 Explain Rings homomorphism, polynomial Rings and cyclic code? Q.5 Explain Boolean Lattices and Boolean algebra? Show that in a lattice if a b c Then (a b) = (b*c) And (a*b) (b*c)=b=(a b)*(a c) Q.1 Describe predicate calculus and axiom system for predicate calculus. Q.2 Describe the gates and logical circuits. V5

Q.3 Explain the Disjunctive and conjunctive normal forms with example. Q.4 What is a tree? Explain spanning trees and cut-sets. Q.1 Define Boolean algebra and give two examples. Q.2 Explain Cossets and Lagrange s Theorem. Q.3 Define vector space giving suitable examples. Q.4 Describe Bounded and Isomorphic lattices. Madhya Pradesh Bhoj (Open) University, Bhopal Subject- Structure System Analysis and Design Maximum Marks: 20 Q. 1 Explain all stems of system development life cycle. Q. 2 Write short note on- (a) (b) (c) Security and privacy Is Building blocks Asset management. Q. 3 Explain rapid application development strategy with example. Q. 4 Define project plan. How can you analyze business process in a project? Explain it. I Q. 1 What Is the Role of Technology drivers in current information system? Explain it. Q. 2 Explain cross life cycle activities. Q. 3 Explain following- (a) (b) Decision Analysis phase Problem Domain Q. 4 Explain different types of functional requirements. Q. 1 What do you understand by application development environment? Explain it. Q. 2 Explain scope definition phase in detail. Q. 1 Explain work of Project Manager in Information system development. Q. 2 Define FAST System analysis strategies.

Subject- Java Programming Maximum Marks: 20 1. What is object oriented programming? Explain is features. 2. What is the Class? Difference between function and operator overloading. 3. What is Thread? Explain life cycle of thread along with the concept of Multithreading. 4. Define File Input Stream & File Output Stream? Explain with example. 5. What are JDBC? Write down its applications. I 1. What are the basic features of Java? Why it is called secure? Explain. 2. Explain the concept of exception handling in java? Differentiate between throw and throws with the help of a program? 3. What is Abstract data type? Explain with Example. 4. What is TCP/IP Socket? Explain with Example. 5. What is Java Beans? Practical Assignment- First 1. What are the various stream classes available in Java? Write a program to copy characters of one file into another. 2. Explain JDBC architecture. Write a program to delete a row into an access table Student. Practical Assignment- Second 1. Write a program to print the grade of students as first, second, third or fail. 2. Explain life cycle of applets.write a program to show the use of <PARAM.> tag.

Subject- Data Communication and Networks Maximum Marks: 20 Q1. What is Data Transmission? Explain suitable example.. What do you mean by LAN? Explain it. Q3. Explain OSI Model with graphical mode. Q4. What do you mean by TCP/IP model? Explain Application Protocols. Q5. Explain Basic Requirement of Network Security? I Q1. What do you mean by Transmission Media? Explain Suitable Example.. Explain Transmission Concepts and Terms? Q3. Explain Queuing Theory with Suitable example? Q4. What do you mean by WAN? Explain it. Q5. What do you mean by Wireless Local Loop? Explain it. Q1. Explain various network topologies? Difference between LAN & WAN. Q1. Explain various transmission media?. Difference between LAN & MAN.

Subject- Computer Graphics and Multimedia Maximum Marks: 20 Q1 Explain the working of raster and random scan system. Explain interactive input and output devices. Q3 Explain the working of DDA Line Drawing Algorithm. Q4 What do you mean by Transformation? Explain its working. Q5 Explain the multimedia and Animations with examples. I Q1 Q3 Explain the working of CGA and MDA. Explain interactive input and output devices any four. Explain the working of Circle Drawing Algorithm. Q4 What do you mean by Transformation? Explain working Translation. Q5 Explain Bezier Curve with examples. Q1 Q1 Explain Brasham Algorithm with implement. Explain Back Face Removal Algorithm. Explain the working of Homogeneous Transformation. Explain Line Clipping Algorithm.

Subject- Object Oriented Programming Using C++ Maximum Marks: 20 Q.1 Explain Basic concept of OOP? Q.2 Note on following: (i) (ii) Overload function Inline function Q.3 Write about the constructor and destructor? Q.4 Explain about the Inheritance? Q.5 Creating the manipulation functions by the example? I Q.1 Write different data type in c++ Q.2 Explain the concept of class Q.3 Write a syntax string class assignment? Q.4 What is Pointer? Q.5 Brief explains the comment line argument. Practical Assignment Q.1 Write a program for friend function Q.2 Create the class Shape ()