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

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

R a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method

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

Digital logic fundamentals. Question Bank. Unit I

CS/IT DIGITAL LOGIC DESIGN

PART B. 3. Minimize the following function using K-map and also verify through tabulation method. F (A, B, C, D) = +d (0, 3, 6, 10).

QUESTION BANK FOR TEST

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS

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

HANSABA COLLEGE OF ENGINEERING & TECHNOLOGY (098) SUBJECT: DIGITAL ELECTRONICS ( ) Assignment

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

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

END-TERM EXAMINATION

NADAR SARASWATHI COLLEGE OF ENGINEERING AND TECHNOLOGY Vadapudupatti, Theni

SHRI ANGALAMMAN COLLEGE OF ENGINEERING. (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI

VALLIAMMAI ENGINEERING COLLEGE

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

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

Injntu.com Injntu.com Injntu.com R16

Code No: 07A3EC03 Set No. 1

DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY


10EC33: DIGITAL ELECTRONICS QUESTION BANK

VALLIAMMAI ENGINEERING COLLEGE

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

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

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

Computer Science and Engineering

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

2. (a) Compare the characteristics of a floppy disk and a hard disk. (b) Discuss in detail memory interleaving. [8+7]

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

COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS UNIT I

SUBJECT CODE: IT T35 DIGITAL SYSTEM DESIGN YEAR / SEM : 2 / 3

Madhya Pradesh Bhoj (Open) University, Bhopal

Code No: R Set No. 1

(ii) Simplify and implement the following SOP function using NOR gates:

R07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April

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

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Code No: R Set No. 1

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

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

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) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

Course Structure and Syllabus

Code No: R Set No. 1

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

DE Solution Set QP Code : 00904

R07

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK NAME OF THE SUBJECT: EE 2255 DIGITAL LOGIC CIRCUITS

BHARATHIDASAN ENGINEERING COLLEGE Degree / Branch : B.E./ECE Year / Sem : II/ III Sub.Code / Name : EC6302/DIGITAL ELECTRONICS

UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS PART-A (2 MARKS)

CS6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN I YEAR/II SEM PART-B UNIT-I BOOLEAN ALGEBRA AND LOGIC GATES.

Scheme G. Sample Test Paper-I

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

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

KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Hiranya Kumar Bhuyan School of Science and Technology

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

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

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

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

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

Note: Select one full question from each unit

Course Batch Semester Subject Code Subject Name. B.E-Marine Engineering B.E- ME-16 III UBEE307 Integrated Circuits

EE6301 DIGITAL LOGIC CIRCUITS UNIT IV ASYNCHRONOUS SEQUENTIAL CIRCUITSAND PROGRAMMABLE LOGIC DEVICES PART A

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


EECS150 Homework 2 Solutions Fall ) CLD2 problem 2.2. Page 1 of 15

ISC 2006 COMPUTER SCIENCE PAPER 1 THEORY PART I Answer all questions in this part

MaanavaN.Com CS1203 OBJECT ORIENTED PROGRAMMING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Assignment-I PGDCA 01- INFORMATION TECHNOLOGY

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

CS470: Computer Architecture. AMD Quad Core

Written exam for IE1204/5 Digital Design Thursday 29/

CDE-101 Discrete Mathematics ASSIGNMENT - I

Contents. Chapter 3 Combinational Circuits Page 1 of 34

II B. Tech I Semester Regular Examinations, Dec DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

Department Computer Science

Hours / 100 Marks Seat No.

B.Sc II Year Computer Science (Optional)

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT

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

COMPUTER SCIENCE. Paper 1

Recitation Session 6

UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan

CS 6456 OBJCET ORIENTED PROGRAMMING IV SEMESTER/EEE

LIST OF EXPERIMENTS. (1) (Office Automation)

DIGITAL ELECTRONICS. P41l 3 HOURS

Answer any Five Questions. All questions carry equal marks.

CS8803: Advanced Digital Design for Embedded Hardware

1. Mark the correct statement(s)

Chapter 2: Combinational Systems

3. The high voltage level of a digital signal in positive logic is : a) 1 b) 0 c) either 1 or 0

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:

CONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii)

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

Chapter 1 Introduction

Get Unique study materials from

(3 hours) [80 marks] NOTE: Question No 1 is compulsory Attempt any three questions from remaining. Assume suitable data if necessary.

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

Transcription:

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 2's complement of a binary number is obtained? Illustrate by an example. c) What is gray code? What are the rules to construct gray code? Develop the 4 bit gray code for the decimal 0 to 15. 2 a) Using K-map method determine the prime Implicant and obtain the possible minimal expression for the following function F(A,B,C,D) = Σ m(8,12,13) + d(1,2,4,6,7,11) b) Define the following terms with respect to K-Map with an example. i) Prime Implicant ii) Redundant terms iii) Essential Prime Implicant iv) Octet 3. a) Design 4 line to 16 line decoder using 2 line to 4 line decoders. b) Implement the following switching function using a Four input multiplexer F (A, B, C, D) = Σ m (0, 1, 2, 4, 6, 9, 10, 13, 14) c) Implement a full adder with two 4 1 multiplexers. d) Implement Half adder using NAND gates. 4. a) Draw and explain 4-bit universal shift register b) Explain different types of shift registers c) Explain the working of a master-slave JK flip flop. State its advantages d) Implement the following Boolean functions using PAL F 1 (x, y,z ) = m (0,1,3,6,7) and F 2 (x, y,z ) = m (0,2,3,5) 5. SECTION- B (5 3=15M) a) Perform (28) 10 (15) 10 using 6 bit 2 s complement representation. b) Convert (12.125) 10 into binary c) What are the limitations of K-maps? d) Convert the given expression in standard POS form. f(a,b,c) = (A+B) (B+C) (A+C) e) Explain about parallel adder. f) What is meant by encoder? g) Compare PLA with PROM? h) What is meant by race around condition in flip-flops?

ADIKAVI NANNAYA UNIVERSITY::RAJAMAHENDRAVARAM BTCSE302 OPERATING SYSTEMS 1. a) Explain different types of systems? b) Write a short notes on system calls? c) Briefly explain the classical problems of synchronization? d) Write a short notes on semaphores? 2. a) Explain in brief various scheduling algorithms? b) Write a short notes on co operating processes? c) Write a short notes on Deadlock Characterization, deadlock prevention and recovery from deadlock? 3. a) Explain segmentation and paged segmentation? b) Briefly explain page replacement algorithms? 4. a) Explain file structure and file access methods? b) Explain directory structure? c) Explain briefly the concept of disk scheduling? SECTION - B (5 3=15M) a) Storage Hierarchy b) Operating system services. c) Threads. d) Paging and demand paging. e) File operations. f) DMA. g) Critical section problem. h) Secondary storage structure.

ADIKAVI NANNAYA UNIVERSITY::RAJAMAHENDRAVARAM II BTech ( CSE ) I Semester BTCSE303 OBJECT ORIENTED PROGRAMMING USING C++ 1. a) Briefly Explain various features of Object iented Programming Language b) Define Function. Explain various types of functions used in C++ 2. a) What is Class? Explain data hiding in Classes b) What is Constructor? Write the syntax of declaring the Constructor and Explain various types of Constructors used in C++ 3. a) Explain different forms of Inheritance. Illustrate each type with an example b) What is Virtual Function? Why it is important to make a class virtual 4. a) What is file mode? Describe the various file mode options available in C++. b) Explain the various unformatted I/O Operations and Formatted Console I/O Operators c) What is Template? Explain the various templates with example d) Write a function template for finding the minimum value contained in an array SECTION - B (5 3=15M) a) Applications of OOP b) Scope Resolution Operator c) Friend Function d) Operator Overloading e) Virtual Base Class f) Pure Virtual Function g) Command Line Arguments h) Overloading of Template Functions

ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM BTCSE304 ADVANCED DATA STRUCTURES 1. a) What is skip lists? Explain about skip lists with examples. b) Explain about the analysis of skip lists. c) Explain about different hashing functions with examples. d) Explain about the analysis of closed hashing for unsuccessful search and insertion 2. a) Explain about the deletion procedure to delete an element from AVL Tree with examples b) Write a routine to delete an element from an AVL tree. c) What are the applications of binary heap. d) Write a routine for creating a binary heap and explain with example 3. a) Write a routine for shortest path algorithm with example b) Write a routine for warshall s algorithm. c) Explain about Knapsack problem using Greedy Paradigm d) Construct an Optimal Binary Search Tree for the following data: i 1 2 3 4 5 P i 0.24 0.22 0.23 0.3 0.01 4. a) Explain about amortized analysis of Binomial Queues. b) Explain about AA-Trees with examples. c) Explain about amortized analysis of Fibonacci Heaps d) Explain about k-d Trees with examples. a. Queue ADT b. LZW Compression c. Path Compression d. Huffman Codes e. Randomized Algorithms f. NP-Completeness g. Skew Heaps h. Treaps Section B (5 3=15M) Answer anyfive Questions

ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM BTCSE305 PROBABILITY, STATISTICS AND QUEUING THEORY 1. a) State and prove BAYE s theorem b) In a bolt factory machines A, B, C manufacture 20%, 30%, 50% of the total of their output and 6%,3% and 2% are defective. A bolt is drawn at random and found to be defective. What is the probability that it is manufactured by machines A, B and C? c) State and prove Boole s inequality d) There are 15 boys and 5 girls in a class. If three students are selected one after the other What is the probability that they are (1) All boys (2) 2 boys one girl (3) All girls. 2. a) A continuous random variables X is defined by f(x) = (3+x) 2 16 (6 2x 2 ) 16 (3 x) 2 if 3 x 1 if 1 x 1, 0 elsewhere. Verify that f(x) is a { 16 if 1 x 3 Density function also find the mean of X. b) Ten coins are thrown simultaneously. Find the probability of getting at least seven heads c) In a distribution exactly normal 7% of the items are under 35 and 89% are under 63. What are the mean and standard deviation of the distribution? d) Fit a Poisson distribution for the following data and calculate the expected frequencies, N = 200. X 0 1 2 3 4 F(x) 109 65 22 3 1 3. a) A lady stenographer claims that the she can take dictation at the rate of 120 words per minute. Can we reject her claim on the basis of 100 trails in which she demonstrates a mean of 116 words with a S.D of 15 words. b) Two independent samples of 8 and 7 items respectively had the following values. Sample1 11 11 13 11 15 9 12 14 Sample2 9 11 10 13 9 8 10 - Is the difference between the means of samples significant? c) A manufacturer of electric bulbs claims that the percentage of defectives in his product does not exceed 6. A sample of 40 bulbs is found to contain 5 defectives would you consider the claim justified d) Tests are made on the proportion of defective castings produced by 5 different molds. If there were 14 defectives among 100 costing mold I, 33 defectives among 200 costing mold II, 21 defectives among 180 costing mold III,

17 defectives among 120 costing mold IV and 25 defectives among 150 costing mold V. Use the 0.01 level of significance to test whether the true proportion of defectives is the same for each mold. 4. a) Fit a second degree parabola to the following data using method of least squares. X 0 1 2 3 4 Y 1 1.8 1.3 2.5 6.3 b) The equations of two regression lines obtained in a correlation analysis are 3x + 12y = 19, 3y + 9x = 46. Find (i) coefficient of correlation, (ii) Mean values Of x and y and (iii) The ratio of the coefficient of variability of X to that of Y. c) Derive expressions for P o, P n for the (M/M/1): ( /FCFS) queuing model. d) In a railway marshalling yard, good trains arrive at a rate of 30 trains per day. Assuming that the inter arrival time follows an exponential distribution and the service time distribution is also exponential with an average of 36 minutes, Calculate (i) expected queue size (line length) (ii) Probability that the queue size exceeds 10. If the input of trains increases to an average of 33 per day, what will be the change in(i) and ii)? 5. Section B (5 3=15M) a) Two cards are selected at random from 10 cards numbered 1 to 10. Find the probability that the sum is even if the two cards are drawn one after the other with replacement. b) Prove that, for any two events A and B; P(A B) = P(A) + P(B) P(A B) c) A random variables X has the following probability function X - 3-2 -1 0 1 2 3 P(x) K 0.1 K 0.2 2K 0.4 2K Find Mean and variance. d) Use Poisson recurrence formula to find probabilities x = 0,1,2 with mean 3 e) Define type-1 error and type-2 error. f) If we can assert with 95% that the maximum error is 0.05 and P is given as 0.2. Find the size of the sample. g) Write the normal equations of straight line by using method of least square h) What is queuing theory? Explain transient and steady state.

ADIKAVI NANNAYA UNIVERSITY::RAJAMAHENDRAVARAM BTCSE306 MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS 1. a) Define Managerial Economics, Explain Nature and Scope of managerial economics? b) What is Demand Forecasting? What are the methods of Demand forecasting? 2. a) Explain Economies of scale and diseconomies of scale. b) Explain the features of Short run average cost curve and Long run average cost curve. 3. a) Differentiate between Perfect and Imperfect markets. b) Explain any four Methods of Pricing based on strategy. 4. a) What are the Types of Account and rules governing each account? b) Journalise the following transactions in the books of madhu and prepare necessary ledger accounts. 2014 January 1. Madhu commenced with Rs.15,000/- 2. Paid into bank Rs. 10,000/- 3. Purchased goods from B for Rs. 2,000/- 4. Returned goods to B for Rs. 200/- 5. Paid to B in full settlement of A/c Rs 1,700/- 7. Received interest from the bank Rs.750/- 9. Sold goods for cash Rs. 7,000/- 12. Sold goods for Don for Rs. 4,000/- 15. Received goods worth Rs. 100/- from Don with a complaint about damage. 16. Paid salaries Rs. 400/- 17. Entertainment Rs. 50/- 20. Received a cheque from Don Rs. 500/- 25. Issued a cheque for Rs. 100/- towards rent to landlord Section B (5 3=15M) a) Law of equi marginal utility b) Barometric techniques c) Cobb- Douglas production function d) Isoquants and their features e) Equilibrium price f) Joint stock company g) Double -entry book keeping h) Types of shares