Madhya Pradesh Bhoj (Open) University, Bhopal

Size: px
Start display at page:

Download "Madhya Pradesh Bhoj (Open) University, Bhopal"

Transcription

1 Subject : Discrete Mathematics Q1. We draw cards from an ordinary deck of 52 playing cards. The cards are to be drawn successively at random and without replacement. What is the probability that the second heart appears on the fifth draw? Q2. Prove that for any connected planar graph, V-e + r = 2where v, e, r are the number of vertices, edges and regions of the graph respectively. Q3. Simplify boolean function F given byf(a, B, C, Z)) = 2 (0, 2, 7, 8, ) using Karnaugh map. Q4. Define distributive lattice and complemented lattice. Prove that in a distributive lattice, if an element has a complement then this complement is unique. Q5. Let (A, <) and (B, <) be two posets. Prove that (AxB, <) is a poset, where (a, b) < (c, d) if and only if a <c, b <d Q1. Define and explain the following with suitable example : (a) Cyclic group (b) Zero divisor of a ring (c) Order of an element of a group (d) Field. Q2. Let A = {1, 2, 3, 4}, give an example of a mapping which is (i) neither symmetric nor antisymmetric, (ii) anti-symmetric and reflexive but not transitive. Q3. How many ways are there to seat 10 boys and 10girls around a circular table? If boys and girlsalternate, how many ways are there? Q4. there? Q5. Let A = {1, 2, 3, 4}, and R is a relation defined by a divides b. Write R as a set of ordered pair,draw directed graph. Also find R-1

2 Subject : Advanced Java Q.1 What is an Object? Explain Features of Object Oriented Programming. Q.2 What is method? difference between Methods Overloading and Methods Overriding? Q.3 Explain fundamentals and types of Exception? Q.4 Explain the Bit set Class in java? Q.5 Explain the Applet Stub interface? Q.1 Explain data types in JAVA? Q.2 What is Methods Overloading and Constructor Overloading? Q.3 Explain Java Thread Model? Q.4 What is Transient and Volatile Modifier? Q.5 What is input and output stream? Explain File input Stream throw a program?

3 Subject : Microprocessor and Assembly Language Programming Q.1 Explain Evolution of Microprocessor? Q.2 Describe Memory and Input/Output Interface? Q.3 What are Instruction Formats? Explain it? Q.4 Explain 8255 Programmable Interface? Q.5 Describe Assembler Directives and Operators? Q.1 Explain RISC & CISC Architecture Q.2 External System Bus Architecture? Q.3 Explain Organization of 8086? Q.4 Explain Programmable Timer? Q.5 Explain Assembly Language with example?

4 Subject : Numerical Methods and Statistical Analysis Q1. Find the root between (2,3) of x x - 5 = 0, by using regula falsi method. Q2. Explain Linear Regression and Polynomial Regression. Q3. Solve the initial value problem y' = -2xy 2, y(0) = 1 for y at x = 1 with step length using Taylor series method of order four. Q4. Explain following Term: Counting Techniques (ii) Discrete Random Variable Q5. Explain Theory of Estimation. Q1. Find the positive root of f(x) = x 3 6x x 6 = 0 using Bisection method. Q2. Explain Truncation Error in Interpolation. Q3. Using Taylor series method, find y(0.1) for y' = x - y2, y(0) = 1 correct upto four decimal places. Q4. Explain following Term: Uniform Distribution (ii) Normal Distribution Q5. What is Hypothesis Testing.

5 Subject : Artificial Intelligence Q.1 What is Search Knowledge? Explain Natural Language Processing? Q.2 What are the issues in Knowledge Representation? Q.3 Explain the Procedural and Declarative Knowledge? Q.4 Explain the Probabilistic Reasoning? Q.5 Explain the need of Expert Systems? Q.1 What is Abstraction? Explain Vision Processing and Speech Processing? Q.2 What is Constraint Satisfaction? Explain the Heuristic Search Techniques? Q.3 What is Natural Deduction? Explain the Dependency-Directed Backtracking? Q.4 What is Fuzzy Logic? Explain the Slots Exceptions? - Q.5 Explain the Neural Networks?

6 Subject : Computer Graphics Q 1. Q 2. Q 3. Q 4. Q 5. Explain Raster Scan Systems and Random Scan Systems? Briefly describe any five input devices. Explain collinear and coplanar vectors. Explain Three Dimensional Translation and 3D- Reflection. Describe Sound, Image, Animation and Video. Q 1. Q 2. Explain Professional Graphics adapter and color graphics adapter. Explain Collinear and Coplanar Vectors Q 3. Write short note on :- Q 4. Q 5. (i) Transpose of matrix (ii) Symmetric & skew symmetric matrix. Explain 2-D - Rotation, Reflection and Scaling. Write Painter's Algorithm.

7 Subject : Simulation and Modeling Q.1 Define Simulation. Also explain limitation of simulation. Q.2 Explain type of simulation and also define the type of models. Q.3 What are different methods of generating random numbers? Write the algorthim any one method Q.4 Use Mote Carlo method to approximate the value of x dx Q.5 Customer arrive at a milk booth for the required service. Assume that inter-arrival and service times are constant and given by 1.8 and 4 time units, respectively. Simulate the system by hand computations for 14 time units. What is the average waiting time per customer? What is the percentage idle time of the facility? (Assume that the system starts at t = 0). Q.1 Why to use simulation. Explain with example. Q.2 Write the advantages and disadvantages of simulation technique. Q.3 Define phases of simulation model in detail. Q.4 Consider a situation where customers arrive at a one-man barber shop for hair cutting. The problem is to analyse the system in order to evaluate the quality of service and the economic feasibility of offering the service. To measure the quality of service on e has to make the assessment of the average waiting time per customer and the percentage of time the barber remains idle. Construct the simulation model. Q.5 Mention any four reason for using simulation for solving management problems Akhilesh Srivastava

8 Subject : Software Engineering Q1. Explain Life Cycle model of software development? Q2. Explain configuration management issues. Q3. Write various requirement specification briefly. Q4 What is Risk Analysis? Q5. Write short note on: A. structure charts, B. data dictionaries Q1. What do you mean by software crisis? Q2. What is software process? Q3 Q4 What is prototyping techniques? What do you understand by principal and lows of project management? Q5. What do you mean by Data flow diagram?

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

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY (DMCA101) M.C.A. DEGREE EXAMINATION, MAY - 2017 First Year INFORMATION TECHNOLOGY Time : 3 Hours Maximum Marks : 70 SECTION - A (3 15 = 45) Answer any three of the following Q1) Discuss business pressures

More information

Madhya Pradesh Bhoj (Open) University, Bhopal

Madhya Pradesh Bhoj (Open) University, Bhopal 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

More information

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

B.Sc. (Part II) (Information Technology) EXAMINATION, 2009 1 COMPUTER ORIENTED STATISTICAL METHODS (B.Sc. I.T.-21) 1. What are the main characteristics of Numerical Computation? Explain them clearly. ( 10) 2. Factorize the matrix : as a product of lower and an

More information

1. (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying.

1. (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying. May 9, 2003 Show all work Name There are 260 points available on this test 1 (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying where

More information

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

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. (DMCA 101) ASSIGNMENT - 1, MAY-2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. 3) What is software?

More information

mrrj izns k jktf kz V.Mu eqdr fo ofo ky;]bykgkckn

mrrj izns k jktf kz V.Mu eqdr fo ofo ky;]bykgkckn dk;zdze vf/ku;kl सत र 2018-19 Course Code: PGDCA-01 Discrete Mathematics 1. Answer the following: a. Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be formed? b. In a

More information

COMPUTER SCIENCE TRIPOS

COMPUTER SCIENCE TRIPOS CST.98.8.1 COMPUTER SCIENCE TRIPOS Part II Wednesday 3 June 1998 1.30 to 4.30 Paper 8 Answer five questions. Submit the answers in five separate bundles, each with its own cover sheet. On each cover sheet,

More information

ADMINISTRATIVE MANAGEMENT COLLEGE

ADMINISTRATIVE MANAGEMENT COLLEGE First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and

More information

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

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75 M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the

More information

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

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions. ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 SOFTWARE ENGINEERING (DMCA201) Q1) Explain Spiral model with suitable example. Also explain how it differs from Software Prototyping model. Q2) a) Draw

More information

(3 Hours) N.B. (1) Question No. 1 is compulsory. (2) Attempt any four from the remaining six questions. (3) Figures to the right indicate full marks.

(3 Hours) N.B. (1) Question No. 1 is compulsory. (2) Attempt any four from the remaining six questions. (3) Figures to the right indicate full marks. Q. P. Code: 30990 (3 Hours) Total Marks: 0 N.B. (1) Question No. 1 is compulsory. (2) Attempt any four from the remaining six questions. (3) Figures to the right indicate full marks. Q.1 (a) What is flowchart?

More information

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

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit: JAVA PROGRAMMING UNIT-1: Introduction To Java, Getting Started With Java, Applets And Application, Creating A Java Application, Creating A Java Applets, Object Oriented Programming In Java, Object And

More information

2) Explain in detail about different AVL rotation applied on unbalanced trees.

2) Explain in detail about different AVL rotation applied on unbalanced trees. (DMCS 01) ASSIGNMENT - 1, MAY-2014. PAPER- I : DATA STRUCTURES 1) Define circular queue. Write an algorithm to describe insertion and deletion operation on a circular queue. Illustrate these operations

More information

SRM INSTITUTE OF SCIENCE & TECHNOLOGY Faculty of Science and Humanities Department of Computer Science UNIT I - INTRODUCTION TO JAVA

SRM INSTITUTE OF SCIENCE & TECHNOLOGY Faculty of Science and Humanities Department of Computer Science UNIT I - INTRODUCTION TO JAVA SRM INSTITUTE OF SCIENCE & TECHNOLOGY Faculty of Science and Humanities Department of Computer Science Subject code : UCS15301 Subject Name : Java Programming Staff Name : S.P.ANGELIN CLARET No. of : 5

More information

1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).

1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). Exercises Exercises 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). a) {(1, 1), (1, 2), (1, 3)} b) {(1, 2), (2, 1), (2, 2), (3,

More information

Fundamentals of Discrete Mathematical Structures

Fundamentals of Discrete Mathematical Structures Fundamentals of Discrete Mathematical Structures THIRD EDITION K.R. Chowdhary Campus Director JIET School of Engineering and Technology for Girls Jodhpur Delhi-110092 2015 FUNDAMENTALS OF DISCRETE MATHEMATICAL

More information

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS ASSIGNMENT - 1 Data Structures (DMCS01) Q1) a) Write a sub-routine to implement PUSH ( ) and POP ( ) operations using linked list. b) Explain about open hashing and closed hashing. Q2) How to create double

More information

Objective Questions. BCA Part III Paper XIX (Java Programming) page 1 of 5

Objective Questions. BCA Part III Paper XIX (Java Programming) page 1 of 5 Objective Questions BCA Part III page 1 of 5 1. Java is purely object oriented and provides - a. Abstraction, inheritance b. Encapsulation, polymorphism c. Abstraction, polymorphism d. All of the above

More information

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

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions) By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable

More information

SIR C R REDDY COLLEGE OF ENGINEERING

SIR C R REDDY COLLEGE OF ENGINEERING SIR C R REDDY COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY Course Outcomes II YEAR 1 st SEMESTER Subject: Data Structures (CSE 2.1.1) 1. Describe how arrays, records, linked structures,

More information

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

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I Paper I DATA STRUCTURES (DMCS 01) 1. Explain in detail about the overview of Data structures. 2. Explain circular linked list and double-linked list. 3. Explain CPU scheduling in Multiprogramming Environment.

More information

Course Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20

Course Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20 Course Code : MCA -1 Course Title : Computer Fundamentals & Programming in C SLM Code : C-101 Assignment No. : MCA -1/ C-101/C-2018 Q.1 What is the advantages of using Hexadecimal numbers? Q.2 What do

More information

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

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE. (DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75 M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES (DMCS 01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45)

More information

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.

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. Bapatla Engineering College:: Bapatla (Autonomous) Department of Information Technology Assignment-I Question Paper - III Sem Class: 2/4 B.Tech 2017-18 Section: A Sub: EM-III (14MA301) Section: A & B Date:

More information

Syllabus for Ph.D Entrance Test, RGPV. Common for CSE/IT/CA

Syllabus for Ph.D Entrance Test, RGPV. Common for CSE/IT/CA Syllabus for Ph.D Entrance Test, RGPV. Common for CSE/IT/CA Algorithms: Algorithms and complexity; Combinatorics and graph theory; Geometric Algorithms, Parallel and Distributed Algorithms, Randomized

More information

The Course Structure for the MCA Programme

The Course Structure for the MCA Programme The Course Structure for the MCA Programme SEMESTER - I MCA 1001 Problem Solving and Program Design with C 3 (3-0-0) MCA 1003 Numerical & Statistical Methods 4 (3-1-0) MCA 1007 Discrete Mathematics 3 (3-0-0)

More information

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

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following. Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors

More information

Department Computer Science

Department Computer Science Department Computer Science PROGRAMME OUTCOMES OF B.SC. PROGRAMMES Apply the broaden and in-depth knowledge of science and computing to analyse, think creatively and generate solutions to face the global

More information

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

DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY ACADEMIC YEAR (ODD SEM) DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY ACADEMIC YEAR 2018-19 (ODD SEM) DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING SUB: OBJECT ORIENTED PROGRAMMING SEM/YEAR: III SEM/ II YEAR

More information

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

ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM II BTech (CSE) I Semester BTCSE301 DIGITAL LOGIC DESIGN MODEL QUESTION PAPER ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM BTCSE301 DIGITAL LOGIC DESIGN 1. a) List out the Basic Theorems and Properties of Boolean Algebra. Justify with the Proof b) Explain how 1's complement and

More information

B.Sc II Year Computer Science (Optional)

B.Sc II Year Computer Science (Optional) Swami Ramanand Teerth Marathwad University, Nanded B.Sc II Year Computer Science (Optional) (Semester Pattern) ( W.E.F. June 2010) Paper No VI VII Paper Title Digital Electronics & 8085 Microprocessor

More information

(l) Represent each of the sets A, B and C using bit strings. Then, use bit string representation and bitwise logical operations to find

(l) Represent each of the sets A, B and C using bit strings. Then, use bit string representation and bitwise logical operations to find Fall 2004 Ahmed Elgammal CS 205: Sample Final Exam December 6th, 2004 1. [10 points] Let A = {1, 3, 5, 7, 9}, B = {4, 5, 6, 7, 8}, C = {2, 4, 6, 8, 10}, D = {1, 2, 3} and let the universal set be U = {1,

More information

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

Design and implement a program to solve a real-world problem using the language idioms, data structures,, and standard library. Course Outcome Second Year of B.Sc. IT Program Semester I Course Number: USIT301 Course Name: Python Programming Understanding basic fundamentals of programming using Python. Recognize and construct common

More information

MLR INSTITUTE OF TECHNOLOGY DUNDIGAL , HYDERABAD QUESTION BANK

MLR INSTITUTE OF TECHNOLOGY DUNDIGAL , HYDERABAD QUESTION BANK MLR INSTITUTE OF TECHNOLOGY DUNDIGAL - 500 043, HYDERABAD QUESTION BANK Course Name : EMBEDDED SYSTEMS Course Code : A57043 Class : IV B. Tech I Semester Branch : ECE Year : 2015 2016 Course Faculty :

More information

CORE JAVA TRAINING COURSE CONTENT

CORE JAVA TRAINING COURSE CONTENT CORE JAVA TRAINING COURSE CONTENT SECTION 1 : INTRODUCTION Introduction about Programming Language Paradigms Why Java? Flavors of Java. Java Designing Goal. Role of Java Programmer in Industry Features

More information

Duration: 2 hours Max. Marks: 60

Duration: 2 hours Max. Marks: 60 I. (a) Determine the number of positive integers n where 1 and n is not divisible by 2 or 3 or. (b) How many integers between 1 and 2000 are divisible by 2, 3, or 7? (c) Let S = {1, 2, 3, 4,, 6, 7, 8,

More information

All questions carry equal marks. Total Marks : 20. Q.1. (a) Define Computer Graphics (CG). What are the major application area of computer graphics?

All questions carry equal marks. Total Marks : 20. Q.1. (a) Define Computer Graphics (CG). What are the major application area of computer graphics? Course Title : Computer Graphics SLM Code : C-122 Assignment No. : BCA-17-A/C-122/A-2017-2018 Q.1. (a) Define Computer Graphics (CG). What are the major application area of computer graphics? (b) Explain

More information

Program: BCA-Semester-II

Program: BCA-Semester-II Program: BCA-Semester-II Code No: 2.1 Digital Computer Design and Computer Organisation What is logic gate? Explain the basic operations of Boolean algebra. Define the role of a boostrap loader Discuss

More information

A Parallel, In-Place, Rectangular Matrix Transpose Algorithm

A Parallel, In-Place, Rectangular Matrix Transpose Algorithm Stefan Amberger ICA & RISC amberger.stefan@gmail.com A Parallel, In-Place, Rectangular Matrix Transpose Algorithm Description of Algorithm and Correctness Proof Table of Contents 1. Introduction 2. Description

More information

2HS306 Applied Engineering Mathematics [ ]

2HS306 Applied Engineering Mathematics [ ] HS0 Applied Engineering Mathematics [ 0 ] Learning outcomes: Upon completion of this course, students will be able to: Understand all basic fundamentals of numeric methods transforms. Prepare him/her self

More information

Contents Computing with Formulas

Contents Computing with Formulas Contents 1 Computing with Formulas... 1 1.1 The First Programming Encounter: a Formula... 1 1.1.1 Using a Program as a Calculator... 2 1.1.2 About Programs and Programming... 2 1.1.3 Tools for Writing

More information

Updated Review Content and Added-on Practice Problems

Updated Review Content and Added-on Practice Problems Updated Review Content and Added-on Practice Problems Underlined below is the added review content which supplements the original review package. The added sample questions are also presented in tandem.

More information

CHAPTER 3 FUZZY RELATION and COMPOSITION

CHAPTER 3 FUZZY RELATION and COMPOSITION CHAPTER 3 FUZZY RELATION and COMPOSITION Crisp relation! Definition (Product set) Let A and B be two non-empty sets, the prod uct set or Cartesian product A B is defined as follows, A B = {(a, b) a A,

More information

ощ 'ршорвшэш! цвн-эориэу ощ 'sajbpossv # PIPG DUJ 'ssjmoossv ^ PIPG pipa w н OX ЛЮН VAV

ощ 'ршорвшэш! цвн-эориэу ощ 'sajbpossv # PIPG DUJ 'ssjmoossv ^ PIPG pipa w н OX ЛЮН VAV ощ 'ршорвшэш! цвн-эориэу ощ 'sajbpossv # PIPG DUJ 'ssjmoossv ^ PIPG pipa w н OX ЛЮН VAV Contents Preface Chapter 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 1.10 1.11 1.12 1.13 1.14 1.15 1.16 1.17 1.18 1.19

More information

CS/B.TECH/CSE(OLD)/SEM-6/CS-605/2012 OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70

CS/B.TECH/CSE(OLD)/SEM-6/CS-605/2012 OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70 CS/B.TECH/CSE(OLD)/SEM-6/CS-605/2012 2012 OBJECT ORIENTED PROGRAMMING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers

More information

CISC 1400 Discrete Structures

CISC 1400 Discrete Structures CISC 1400 Discrete Structures Chapter 4 Relations CISC1400 Yanjun Li 1 1 Relation A relation is a connection between objects in one set and objects in another set (possibly the same set). age is a relation

More information

[Course Overview] After completing this module you are ready to: Develop Desktop applications, Networking & Multi-threaded programs in java.

[Course Overview] After completing this module you are ready to: Develop Desktop applications, Networking & Multi-threaded programs in java. [Course Overview] The Core Java technologies and application programming interfaces (APIs) are the foundation of the Java Platform, Standard Edition (Java SE). They are used in all classes of Java programming,

More information

VidyaVikas Education Trust s Universal College of Engineering, Kaman Road, Vasai Department- Computer Engineering

VidyaVikas Education Trust s Universal College of Engineering, Kaman Road, Vasai Department- Computer Engineering Course Outcomes: Subject- ECCF CO1 :To understand the use of semiconductor devices in circuits and modify it as per requirement. CO 2 : To understand the significance of power amplifiers in day to day

More information

FPGA for Dummies. Introduc)on to Programmable Logic

FPGA for Dummies. Introduc)on to Programmable Logic FPGA for Dummies Introduc)on to Programmable Logic FPGA for Dummies Historical introduc)on, where we come from; FPGA Architecture: Ø basic blocks (Logic, FFs, wires and IOs); Ø addi)onal elements; FPGA

More information

Image Analysis, Classification and Change Detection in Remote Sensing

Image Analysis, Classification and Change Detection in Remote Sensing Image Analysis, Classification and Change Detection in Remote Sensing WITH ALGORITHMS FOR ENVI/IDL Morton J. Canty Taylor &. Francis Taylor & Francis Group Boca Raton London New York CRC is an imprint

More information

Syllabus & Curriculum for Certificate Course in Java. CALL: , for Queries

Syllabus & Curriculum for Certificate Course in Java. CALL: , for Queries 1 CONTENTS 1. Introduction to Java 2. Holding Data 3. Controllin g the f l o w 4. Object Oriented Programming Concepts 5. Inheritance & Packaging 6. Handling Error/Exceptions 7. Handling Strings 8. Threads

More information

2. The vertices of Δ ABC are A( 1, 2), B( 1,2), and C(6,0). Which conclusion can be made about the angles of Δ ABC?

2. The vertices of Δ ABC are A( 1, 2), B( 1,2), and C(6,0). Which conclusion can be made about the angles of Δ ABC? 1 Line k is drawn so that it is perpendicular to two distinct planes, P and R. What must be true about planes P and R? A. Planes P and R are skew B. Planes P and R are perpendicular. C. Planes P and R

More information

Object Oriented Programming

Object Oriented Programming Program Structure for Master of Computer Application (MCA) Mumbai University (With Effect from 2012-2013) Semester I Object Oriented Programming 1 C++ Fundamentals: Data types, Operators, Preprocessor

More information

TEACHING & EXAMINATION SCHEME For the Examination COMPUTER SCIENCE. B.Sc. Part-I

TEACHING & EXAMINATION SCHEME For the Examination COMPUTER SCIENCE. B.Sc. Part-I TEACHING & EXAMINATION SCHEME For the Examination -2015 COMPUTER SCIENCE THEORY B.Sc. Part-I CS.101 Paper I Computer Oriented Numerical Methods and FORTRAN Pd/W Exam. Max. (45mts.) Hours Marks 150 2 3

More information

2. (a) Explain the concept of virtual functions in C++ with suitable examples. (b) Explain the concept of operator overloading in C++.

2. (a) Explain the concept of virtual functions in C++ with suitable examples. (b) Explain the concept of operator overloading in C++. Code No: R059211201 Set No. 1 1. (a) What is a friend function? Explain the advantages and disadvantages of it? (b) What is static member function? Explain it s limitations. [8+8] 2. (a) Explain the concept

More information

FORM 5 COMPUTING TIME: 1h 45min

FORM 5 COMPUTING TIME: 1h 45min DIRECTORATE FOR QUALITY AND STANDARDS IN EDUCATION Curriculum Management and elearning Department Educational Assessment Unit Annual Examinations for Secondary Schools 2014 Track 3 FORM 5 COMPUTING TIME:

More information

AFN-1255 PCA131 P.G.D.C.A. DIPLOMA EXAMINATION, MAY 2011 First Semester Computer Applications FUNDAMENTALS OF DIGITAL COMPUTER (Non-CBCS 2004 onwards) Time : 3 Hours Maximum : 100 Marks Part A (15 1 =

More information

Big Java Late Objects

Big Java Late Objects Big Java Late Objects Horstmann, Cay S. ISBN-13: 9781118087886 Table of Contents 1. Introduction 1.1 Computer Programs 1.2 The Anatomy of a Computer 1.3 The Java Programming Language 1.4 Becoming Familiar

More information

CONTENTS Equivalence Classes Partition Intersection of Equivalence Relations Example Example Isomorphis

CONTENTS Equivalence Classes Partition Intersection of Equivalence Relations Example Example Isomorphis Contents Chapter 1. Relations 8 1. Relations and Their Properties 8 1.1. Definition of a Relation 8 1.2. Directed Graphs 9 1.3. Representing Relations with Matrices 10 1.4. Example 1.4.1 10 1.5. Inverse

More information

CS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation

CS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation CS 441 Discrete Mathematics for CS Lecture 24 Relations IV Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Equivalence relation Definition: A relation R on a set A is called an equivalence relation

More information

Sleeping Barber CSCI 201 Principles of Software Development

Sleeping Barber CSCI 201 Principles of Software Development Sleeping Barber CSCI 201 Principles of Software Development Jeffrey Miller, Ph.D. jeffrey.miller@usc.edu Sleeping Barber Outline USC CSCI 201L Sleeping Barber Overview The Sleeping Barber problem contains

More information

Fatima Michael College of Engineering & Technology

Fatima Michael College of Engineering & Technology DEPARTMENT OF ECE V SEMESTER ECE QUESTION BANK EC6502 PRINCIPLES OF DIGITAL SIGNAL PROCESSING UNIT I DISCRETE FOURIER TRANSFORM PART A 1. Obtain the circular convolution of the following sequences x(n)

More information

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours CE161-4-AU UNIVERSITY OF ESSEX Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE Time allowed: TWO hours The following items are provided: Graph paper (available on invigilator s desk) Candidates

More information

Computer Graphics Hands-on

Computer Graphics Hands-on Computer Graphics Hands-on Two-Dimensional Transformations Objectives Visualize the fundamental 2D geometric operations translation, rotation about the origin, and scale about the origin Experimentally

More information

UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE

UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE UNIVERSITY OF SOUTH ALABAMA COMPUTER SCIENCE 1 Computer Science CSC 108 Intro to Computer Science 3 cr An introduction to the major areas of computer science, such as computing systems, the binary number

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 PRINT Your Name:, (last) READ AND SIGN The Honor Code: As a member of the UC Berkeley community, I act with honesty,

More information

COMPUTER SCIENCE PAPER 1

COMPUTER SCIENCE PAPER 1 COMPUTER SCIENCE PAPER 1 (THEORY) (Maximum Marks: 70) (Time allowed: Three hours) (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time.)

More information

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

(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY 1 (DMCA 101) PAPER - I - INFORMATION TECHNOLOGY 1. What is a computer based information system? Discuss the general technological trends for information technology. 2. (a) Describe the four main types

More information

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

1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram? (DMCA 101) ASSIGNMENT - 1, DEC - 2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with

More information

COURSE: NUMERICAL ANALYSIS. LESSON: Methods for Solving Non-Linear Equations

COURSE: NUMERICAL ANALYSIS. LESSON: Methods for Solving Non-Linear Equations COURSE: NUMERICAL ANALYSIS LESSON: Methods for Solving Non-Linear Equations Lesson Developer: RAJNI ARORA COLLEGE/DEPARTMENT: Department of Mathematics, University of Delhi Page No. 1 Contents 1. LEARNING

More information

1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This is from Bona Chapter 1 (1).

1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This is from Bona Chapter 1 (1). Math/CS 415 Combinatorics and Graph Theory Fall 2017 Prof. Readdy Homework Chapter 1 1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This

More information

Huei-Huang Lee. Programming with MATLAB2016 SDC ACCESS CODE. Better Textbooks. Lower Prices. UNIQUE CODE INSIDE

Huei-Huang Lee. Programming with MATLAB2016 SDC ACCESS CODE. Better Textbooks. Lower Prices.   UNIQUE CODE INSIDE Programming with Huei-Huang Lee MATLAB2016 SDC P U B L I C AT I O N S Better Textbooks. Lower Prices. www.sdcpublications.com ACCESS CODE UNIQUE CODE INSIDE Powered by TCPDF (www.tcpdf.org) Visit the following

More information

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

Govt. of Karnataka, Department of Technical Education Diploma in Information Science & Engineering. Fifth Semester Govt. of Karnataka, Department of Technical Education Diploma in Information Science & Engineering Fifth Semester Subject: Programming With Java Contact Hrs / week: 4 Total hrs: 64 Table of Contents SN

More information

Introduction p. 1 Java Features p. 2 Java Expansion p. 4 Getting, Setting Up, and Using Java p. 5 The Java Language p. 5 Java Swing Components p.

Introduction p. 1 Java Features p. 2 Java Expansion p. 4 Getting, Setting Up, and Using Java p. 5 The Java Language p. 5 Java Swing Components p. Introduction p. 1 Java Features p. 2 Java Expansion p. 4 Getting, Setting Up, and Using Java p. 5 The Java Language p. 5 Java Swing Components p. 6 Components, Containers, and Layour Management p. 6 Checkboxes,

More information

Graphical Approach to Solve the Transcendental Equations Salim Akhtar 1 Ms. Manisha Dawra 2

Graphical Approach to Solve the Transcendental Equations Salim Akhtar 1 Ms. Manisha Dawra 2 Graphical Approach to Solve the Transcendental Equations Salim Akhtar 1 Ms. Manisha Dawra 2 1 M.Tech. Scholar 2 Assistant Professor 1,2 Department of Computer Science & Engineering, 1,2 Al-Falah School

More information

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

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY (DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section- A Answer any Three of the following (3 15=45) 1) What is the

More information

CS/B.TECH/CSE(New)/SEM-5/CS-504D/ OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70 GROUP A. (Multiple Choice Type Question)

CS/B.TECH/CSE(New)/SEM-5/CS-504D/ OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70 GROUP A. (Multiple Choice Type Question) CS/B.TECH/CSE(New)/SEM-5/CS-504D/2013-14 2013 OBJECT ORIENTED PROGRAMMING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK B.E. - Electrical and Electronics Engineering IV SEMESTER CS6456 - OBJECT ORIENTED

More information

Graph Theory: Introduction

Graph Theory: Introduction Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab

More information

Beginning Programming (Two Semesters) Semester One. Module One: Intro to Beginning Programming. Module Two: Computer Careers

Beginning Programming (Two Semesters) Semester One. Module One: Intro to Beginning Programming. Module Two: Computer Careers Beginning Programming (Two Semesters) Description: The major goal of this course is for students to develop the computer science skills of algorithm development problem solving and programming. While the

More information

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

(DMCA201) ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 Second Year SOFTWARE ENGINEERING. Maximum Marks 30 Answer all questions ASSIGNMENT 1 M.C.A. DEGREE EXAMINATION, MAY 2018 SOFTWARE ENGINEERING Q1) Explain about software process frame work in detail. (DMCA201) Q2) Explain how both waterfall model and prototyping model can be

More information

TECNIA INSTITUTE OF ADVANCED STUDIES

TECNIA INSTITUTE OF ADVANCED STUDIES Assignment1(UNIT1) Paper Code:MCA201 Paper: Theory of Computation (a) Positive closure. (b) Automata. Lexical analyzer. (d) Transition table. (e) Final state. Chomsky Classification. (ii) Regular Expressions.

More information

A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions

A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions 1 Distance Reading [SB], Ch. 29.4, p. 811-816 A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions (a) Positive definiteness d(x, y) 0, d(x, y) =

More information

COMPUTER SCIENCE TRIPOS

COMPUTER SCIENCE TRIPOS CST.2003.1.1 COMPUTER SCIENCE TRIPOS Part IA Monday 2 June 2003 1.30 to 4.30 Paper 1 Answer two questions from Section A, and one question from each of Sections B, C, D and E. Submit the answers in six

More information

PROGRAMMING AND ENGINEERING COMPUTING WITH MATLAB Huei-Huang Lee SDC. Better Textbooks. Lower Prices.

PROGRAMMING AND ENGINEERING COMPUTING WITH MATLAB Huei-Huang Lee SDC. Better Textbooks. Lower Prices. PROGRAMMING AND ENGINEERING COMPUTING WITH MATLAB 2018 Huei-Huang Lee SDC P U B L I C AT I O N S Better Textbooks. Lower Prices. www.sdcpublications.com Powered by TCPDF (www.tcpdf.org) Visit the following

More information

Electrical Engineering

Electrical Engineering Electrical Engineering Computer Fundamentals Comprehensive Theory with Solved Examples and Practice Questions Publications Publications MADE EASY Publications Corporate Office: 44-A/4, Kalu Sarai (Near

More information

The Algorithm Design Manual

The Algorithm Design Manual Steven S. Skiena The Algorithm Design Manual With 72 Figures Includes CD-ROM THE ELECTRONIC LIBRARY OF SCIENCE Contents Preface vii I TECHNIQUES 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 1.10 2 2.1 2.2 2.3

More information

Lecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool

Lecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool SMA6304 M2 ---Factory Planning and scheduling Lecture Discrete Event of Manufacturing Systems Simulation Sivakumar AI Lecture: 12 copyright 2002 Sivakumar 1 Simulation Simulation - A Predictive Tool Next

More information

CS/IT DIGITAL LOGIC DESIGN

CS/IT DIGITAL LOGIC DESIGN CS/IT 214 (CR) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester CS/IT DIGITAL LOGIC DESIGN Time: Three Hours 1. a) Flip-Flop Answer

More information

CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK

CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems

More information

Computer Graphics Hands-on

Computer Graphics Hands-on Computer Graphics Hands-on Two-Dimensional Transformations Objectives Visualize the fundamental 2D geometric operations translation, rotation about the origin, and scale about the origin Learn how to compose

More information

Lesson Plan #31. Class: Geometry Date: Tuesday November 27 th, 2018

Lesson Plan #31. Class: Geometry Date: Tuesday November 27 th, 2018 Lesson Plan #31 1 Class: Geometry Date: Tuesday November 27 th, 2018 Topic: Properties of parallel lines? Aim: What are some properties of parallel lines? Objectives: HW #31: 1) Students will be able to

More information

Motion Synthesis and Editing. Yisheng Chen

Motion Synthesis and Editing. Yisheng Chen Motion Synthesis and Editing Yisheng Chen Overview Data driven motion synthesis automatically generate motion from a motion capture database, offline or interactive User inputs Large, high-dimensional

More information

Creating Ontology Chart Using Economy Domain Ontologies

Creating Ontology Chart Using Economy Domain Ontologies Creating Ontology Chart Using Economy Domain Ontologies Waralak V. Siricharoen *1, Thitima Puttitanun *2 *1, Corresponding author School of Science, University of the Thai Chamber of Commerce, 126/1, Dindeang,

More information

COMPUTER SCIENCE Paper 1

COMPUTER SCIENCE Paper 1 COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) -----------------------------------------------------------------------------------------------------------------------

More information

Semester Wise Schema BS Computer Science

Semester Wise Schema BS Computer Science Semester I (Credit Hours: 15) 1 CSC-101 Introduction to Information and Communication Technology (ICT) 4(3 + 1) -NONE- 2 CSC-102 Introduction to Programming 4 (3 + 1) -NONE- 3 ENG-101 Functional English

More information

CS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University

CS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University 9/5/6 CS Introduction to Computing II Wayne Snyder Department Boston University Today: Arrays (D and D) Methods Program structure Fields vs local variables Next time: Program structure continued: Classes

More information

JAVA CONCEPTS Early Objects

JAVA CONCEPTS Early Objects INTERNATIONAL STUDENT VERSION JAVA CONCEPTS Early Objects Seventh Edition CAY HORSTMANN San Jose State University Wiley CONTENTS PREFACE v chapter i INTRODUCTION 1 1.1 Computer Programs 2 1.2 The Anatomy

More information