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.

Similar documents
CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Winter

Logic Design: Part 2

WYSE Academic Challenge Regional Computer Science 2008 Solution Set

Six Marks Questions: ( ) 3) Find the value of the derivative of f (z) = at z = i. r r r r. ( ) where C: z-a = r. (p). f ( z)

DISCRETE MATHEMATICS

SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

1. Mark the correct statement(s)

CS/IT DIGITAL LOGIC DESIGN

Injntu.com Injntu.com Injntu.com R16

Unit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers

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

Summary of Course Coverage

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

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

17CS33:Data Structures Using C QUESTION BANK

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

Circuit analysis summary

9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS

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

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

Sample Question Paper

Summary. Boolean Addition

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

B.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning

Code No: 07A3EC03 Set No. 1

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY

EE292: Fundamentals of ECE

R10. II B. Tech I Semester, Supplementary Examinations, May

COMPUTER SCIENCE PAPER 1

Design of the Power Standard Document

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

Lab 7 1 Due Thu., 6 Apr. 2017

CSC Discrete Math I, Spring Sets

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

ENGIN 112 Intro to Electrical and Computer Engineering

Moodle WILLINGDON COLLEGE SANGLI. ELECTRONICS (B. Sc.-I) Introduction to Number System

correlated to the Michigan High School Content Expectations Geometry

PESIT Bangalore South Campus Department of MCA Course Information for

COMPUTER SCIENCE Paper 1

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

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey

SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN

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

CS321 Introduction To Numerical Methods

Cecil Jones Academy Mathematics Fundamentals

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

Number System. Introduction. Decimal Numbers

1 P age DS & OOPS / UNIT II

Unit-IV Boolean Algebra

9.5 Equivalence Relations

Decimal Binary Conversion Decimal Binary Place Value = 13 (Base 10) becomes = 1101 (Base 2).

Bharati Vidyapeeth s College Of Engineering for Women Pune-43 Department E & TC. SE- Unit Test I Subject-DS

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

Mathematically Rigorous Software Design Review of mathematical prerequisites

Combinational Circuits Digital Logic (Materials taken primarily from:

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

ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY

Hybrid Electronics Laboratory

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

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

Boolean Algebra and Logic Gates

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

r=1 The Binomial Theorem. 4 MA095/98G Revision

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

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN

ADMINISTRATIVE MANAGEMENT COLLEGE

Principles of Digital Techniques PDT (17320) Assignment No State advantages of digital system over analog system.

Appendix 14C: TIMSS 2015 Eighth Grade Mathematics Item Descriptions Developed During the TIMSS 2015 Benchmarking

2.1 Binary Logic and Gates

8.NS.1 8.NS.2. 8.EE.7.a 8.EE.4 8.EE.5 8.EE.6

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

SWITCHING THEORY AND LOGIC CIRCUITS

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

Some Applications of Stack. Spring Semester 2007 Programming and Data Structure 1

TOPIC LIST GCSE MATHEMATICS HIGHER TIER (Bold HIGHER TIER ONLY) Number Topic Red Amber Green

Stacks. Chapter 5. Copyright 2012 by Pearson Education, Inc. All rights reserved

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

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

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

correlated to the Michigan High School Mathematics Content Expectations

Scheme G. Sample Test Paper-I

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

3 Solution of Homework

Digital Logic Design Exercises. Assignment 1

Applied Mathematics [AMT] S.Y. Diploma : Sem. III [CO/CM/IF/CD]

2.6 BOOLEAN FUNCTIONS

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

COMMUNITY UNIT SCHOOL DISTRICT 200

Stacks, Queues (cont d)

Mathematics Scope & Sequence Grade 8 Revised: June 2015

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

Note: Definitions are always reversible (converse is true) but postulates and theorems are not necessarily reversible.

Read this before starting!

Department Computer Science

Boolean Analysis of Logic Circuits

Philadelphia University Student Name: Student Number:

ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two Solutions 26 February 2014

Transcription:

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: 13/07/17 a) Write the iterative formula to compute 3 N by Newton s method. b) Write Newton s back ward interpolation formula. c) State divided difference formula. d) Write simpson s one-third rule. e) Write Lagrange interpolation formula. f) When can the Simpson s rule be applied to evaluate an integral? g) What is the order of the Newton iteration method. h) Can Lagrange interpolation method be used for the data in which x values are equally spaced? i) Distinguish between Newton s forward interpolation formula and Newton s divided difference interpolation formula. j) When can we use Newton s forward interpolation formula and Newton s backward interpolation formula? 3 2 Using fixed point iteration find a solution of x + x 1= 0 correct to 5 decimal places. 2. Find a root of 2x log10x= 7 using fixed point iteration. 3. Design a Newton iteration for cube roots and compute 7. 4. Find a positive root of xsinx+ cosx= 0 correct upto six decimal places by Newton-Raphson s method. 5. Find the real roots of the equation x 4 -x-9 = 0 by Newton-Raphson s method. 6. Use Newton s Divided difference formula to find f(7) if f(-4)=1245, f(-1)=33, f(0)=5, f(2)=9 and f(5)=1335. 7. Using Lagrange interpolation formula find f(0.75), given f(0.25) = 0.27633 f(0.5) = 0.52050 f(1) = 0.84270. 8. Find (410), f(210) by using Newton s interpolation formulas for the data: 200 250 300 350 400 () 15.04 16.81 18.42 19.9 227 4 9. Apply i) Trapezoidal rule ii) Simpson s one third rule of x dx, by taking six equal sub intervals. Compare it with the exact value. dx 10. Evaluate I = 1 + x 0 error correct to 6D. 1, using Trapezoidal rule and Simpson s Rule with h = 0.25 and find the 2 3 3

Sub: DMS (14IT302) Section: A & B Date: 15/07/17 a) What is discrete mathematics? b) What is the power set of the empty set? What is the power set of the set {Փ}? c) Define subset and proper subset. d) How many elements does each of these sets have where a and b are distinct elements? e) P({Փ, a, {a}, {{a}}}) b) P(P(Փ)) f) Prove B-A c =B A g) Prove that the empty set is unique. h) What do you mean by well defined or single valued. i) Give one example for the relation does not satisfy symmetric and anti symmetric. j) Define constructive dilemma. k) Give contra positive, converse and opposite of the following: If triangle ABC is a right triangle, then AB 2 + BC 2 = AC 2. l) Define Pigeonhole principle. m) Construct truth table for (pᴧ q) q n) What is inference pattern? o) Define proposition and open proposition. p) Identify the type of fallacy for the following: AB is parallel to EF or CD is parallel to EF. AB is parallel to EF. Hence, CD is not parallel to EF. a) List the several ways of describing a set with suitable example. b) Describe various properties of binary relation with suitable examples. 2. a) Discuss about the types of functions with suitable example. b) Define Congruence relation. Check which of the following pairs is congruence modulo 5. (i) (-19,19) (ii) (-11,19) (iii) (7,19) (iv) (54,19) 3. a) Prove distributive and demorgan s laws using set builder notation. b) Prove that B-A is subset of AC. 4. Explain in detail about various methods of proof of an implication. 5. Prove or Disprove the following statements (i) The governor will call a special session only if the Senate cannot reach a compromise. If a majority of the cabinet are in agreement, then the governor will call a special session. The senate can reach a compromise. Hence, the governor will not call a special session. (ii) r pᴠq q->r p. 6. Check whether the following are tautologies or not (i) {[(pᴠq)->r]ᴧ( p)}->(q->r) (ii) [(p->q)ᴧ(r->s)ᴧ(pᴠr)]->(qᴠs) 7. a) Describe the rules of inferences for quantified propositions.

b) Prove the validity of the following arguments: Every living thing is plant or an animal. David s dog is alive and it is not a plant. All animals have hearts. Hence, David s dog has a heart. Sub: DLD (14IT303) Section: A Date: 18/07/17 a) What do you mean by a positional weighted system? b) Why is the binary number system used in digital systems? c) How negative numbers are represented and give one example? d) What do you mean by end around carry? e) State the principle of duality? f) Find x if (A2C) 16 =(x) 8? g) If 52/4=12 find the base of this number system? h) What is the minimum number of bits required to encode the decimal digits 0 through 9? Justify your answer. i) What do you mean by sequential code? Name two sequential codes. j) What do you mean by self-complementing code? k) What do you mean by reflective code? l) Disadvantages of BCD code. m) What are the applications of gray code? Discuss about r s and (r-1) s complement methods of subtraction with an example. 2. Explain about the following conversions with suitable examples. a) Binary fraction to decimal b) octal to hexadecimal c) decimal fraction to octal 3. a) Write a short note on self complementing and reflected codes with an example? b) Differentiate 1 s and 2 s complement methods. 4. How to perform binary to gray and gray to binary code conversions. Explain with an example? 5. State and prove demorgan s laws using postulates of an algebra. 6. State and prove a) commutative b) distributive c) consensus theorem 7. Explain in detail about three variable and four variable k-map with suitable examples. Sub: OS (14IT304) Section: A Date: 20/07/17 One mark questions: a) Define Operating System. b) Define Process. c) What is Dual mode Operation? d) What is system call?

e) List any two Operating System goals. f) List any three Scheduling Queues. g) What is the work of scheduler? h) Differentiate mechanism and policy. i) Differentiate Command Interpreter and GUI j) What is process control block? Six mark questions: Discuss various services of operating system. 2. Explain following a) Storage management b) Process management 3. Demonstrate various structures of operating system. 4. Explain about Interprocess communication. 5. Discuss Multithreading Models 6. Explain Process concept. Sub: DS (14IT305) Section: A & B Date: 22/07/17 Part-I Answer any four questions. a) Need of data structure with an example. b) What is Stack Data Structure? Is stack a linear or non-linear? c) Mention the applications of Stack ADT. d) What are the different notations to represent a mathematical expression?which notation is most suitable for use in Computers? e) Convert infix expression c^d-e*(a+b) into post fix. f) Basic features of post fix expression. g) List the operations performed on Stack and Queue ADT. h) How circular queue is different than linear queue. i) Give any two applications of linear queue. j) Define delimiter. Name any four. k) Write the condition which satisfies Stack empty and Queue empty. l) Give the limitation of a linear queue and how to overcome. m) Write a formula to find the position at anytime of the REAR in circular queue. n) What is sorting? Name any four sorting techniques. o) Give the purpose of pivot element in quick sort. Answer any one question. Part-II a) Write a C-routine to implement PUSH and POP operations of a stack. b) Explain how to convert infix expression to postfix expression with an example. 2. a) Write a C-program to implement the conversion of infix to postfix expression. b) Describe the algorithm for evaluating post fix expression.

3. a) Write a C-routine for delimiter matching using stack. b) Implement the evaluation of post fix expression using C. 4. a) Explain in detail about Linear queue and Circular Queue ADT. b)write a C-routine to implement Circular Queue. 5. a) Perform merge sort on the following values 37,95,85,15,66,42,52,72,8,25. b) Implement merge sort algorithm using C. 6. Write a C-program to implement Quick Sort. Sub: OOP (14IT306) Section: A & B Date: 25/07/17 Answer any four questions. a) What is the use of this keyword? b) What the jagged array? c) Define class and object? d) Pillar of oops? Define each? Part-I e) What is the use of the break, continue, and exit? f) What is a constructor? Type of constructors. g) What is implicitly typed variable? h) What are short circuit logical operators? i) What is implicitly typed arrays with example? j) What is polymorphism? Type of polymorphism? Answer any one question. Part-II List and write about various data types, literals and variables in c# with their usage example. 2. List and write about various program control statements in c# with example program. 3. Define an Array and Type of arrays? Write a c# program to reverse the list of numbers by using one dimensional array. 4. a) Define class and Explain in details about class and object with example. b) Explain about static class and static members with example. 5. Explain about constructor overloading and method overloading with example. 6. What is string? Different string handling methods with suitable example?