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

Similar documents
Silver Oak College of Engineering & Technology

END-TERM EXAMINATION

1. Mark the correct statement(s)

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

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

Philadelphia University Student Name: Student Number:

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

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

Scheme G. Sample Test Paper-I

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

R07

DE Solution Set QP Code : 00904

Information and Network Security

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

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

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

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

Injntu.com Injntu.com Injntu.com R16

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

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-II COMBINATIONAL CIRCUITS

Code No: R Set No. 1

CS/IT DIGITAL LOGIC DESIGN

Hours / 100 Marks Seat No.

COMPUTER SCIENCE Paper 1

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

Code No: 07A3EC03 Set No. 1

Digital logic fundamentals. Question Bank. Unit I

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

Sankalchand Patel College of Engineering, Visnagar B.E. Semester III (CE/IT) Database Management System Question Bank / Assignment

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).

Note: Select one full question from each unit

VALLIAMMAI ENGINEERING COLLEGE

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

VALLIAMMAI ENGINEERING COLLEGE

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

Chapter Three. Digital Components

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

Objectives. After completing this lesson, you should be able to do the following:

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.

COMPUTER SCIENCE PAPER 1

Sample Question Paper

GUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING (07) / INFORMATION TECHNOLOGY (16) / INFORMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES

ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012


DIRECTORATE OF TECHNICAL EDUCATION DIPLOMA IN ELECTRICAL AND ELECTRONICS ENGINEERING II YEAR M SCHEME IV SEMESTER.

ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY

COMPUTER SCIENCE. Paper 1

Sai Nath University. Assignment For MCA 1 st

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

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

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

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

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

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

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

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

SECOND SEMESTER BCA : Syllabus Copy

DKT 122/3 DIGITAL SYSTEM 1

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

COMBINATIONAL LOGIC CIRCUITS

Code No: R Set No. 1

Ch. 5 : Boolean Algebra &

Assignment For Fresh (Session ) admitted students Of MCA 5-year (Through Distance Education)

LIST OF EXPERIMENTS. (1) (Office Automation)

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

ENEL 353: Digital Circuits Midterm Examination

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

Sample Question Paper

Read this before starting!

[Note: each line drawn must be a single line segment satisfying x = 3] (b) y = x drawn 1 B1 for y = x drawn

Review. EECS Components and Design Techniques for Digital Systems. Lec 05 Boolean Logic 9/4-04. Seq. Circuit Behavior. Outline.

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

2 SEMESTER EXAM CLASS : 12 DECEMBER 2016 TIME : 3 Hrs MAX MARKS : 70

P.G.D.C.M. (Semester I) Examination, : ELEMENTS OF INFORMATION TECHNOLOGY AND OFFICE AUTOMATION (2008 Pattern)

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

Code No: R Set No. 1

1. Draw general diagram of computer showing different logical components (3)

1. What is y-chart? ans: The y- chart consists of three domains:- behavioral, structural and geometrical.

Schema And Draw The Dependency Diagram

(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.

Department of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.

Seat No. Total No. of Questions : 6] [Total No. of Printed Pages : 2 [4189]-101. P. G. D. C. M. (Semester - I) Examination

17CS33:Data Structures Using C QUESTION BANK

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

Read this before starting!

Set theory is a branch of mathematics that studies sets. Sets are a collection of objects.

Read this before starting!

Computer Science and Engineering

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

. : B.Sc. (H) Computer Science. Section A is compulsory. Attempt all parts together. Section A. Specialization lattice and Specialization hierarchy

QUESTION BANK FOR TEST


DIGITAL ELECTRONICS. P41l 3 HOURS

SQL Structured Query Language Introduction

DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY

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

Databases. Relational Model, Algebra and operations. How do we model and manipulate complex data structures inside a computer system? Until

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

Transcription:

BE - SEMESTER III MID SEMESTER-I EXAMINATION WINTER 2017 SUBJECT: ENGINEERING ECONOMICS AND MANAGEMENT (2130004) (CE/IT/EC/EE) DATE: 04/08/2017 TIME: 10:00 am to 11:30 am TOTAL MARKS:40 Instructions: 1. All the questions are compulsory. Q.1 (a) 1. National Income is concept. 2. Define Economics. 3. Rent is an example of cost. 4. is the father of Scientific Management. 5. The market with a single seller is known as market. (b) Differentiate between Management and Administration. Q.2 (a) Define Demand. Explain law of demand with the help of a diagram. (b) Discuss the levels of management. (c) Explain the factors of production. Q.2 (a) Write a detailed note on Break Even Analysis with its assumptions. (b) Explain the following income concepts: 1. GDP 2. GNP 3. Per capita income (c) Explain the equilibrium between demand and supply. Q.3 (a) Explain Maslow s need Hierarchy theory in detail with diagram. (b) Give the differences between microeconomics and macroeconomics. (c) Explain various cost concepts. Q.3 (a) Discuss the 10 managerial roles given by Henry Mintzberg. (b) State the difference between Perfect Competition and Monopolistic Competition. (c) What is elasticity of demand? Explain its types.

BE - SEMESTER 3 MID SEMESTER-I EXAMINATION WINTER 2017 SUBJECT: Advanced Engineering Mathematics (2130002) (All Branches) DATE: 08-08-2017 TIME:10:00 am to 11:45 pm TOTAL MARKS:40 Instructions: 1.Q. 1 is compulsory. Q.1 (a) Short Questions. (i) 3t 3 Find L{ e } (ii) Find the Convolution of 1*1 (iii) State the relationship between beta and gamma function. (iv) Define Heaviside s unit step function (v) Define Fourier series for even & odd function (b) Obtain the following function by Convolution Theorem L 1 1 ( (s 2)(s + 2) 2) Q.2 (a) Solve the differential equation using Laplace Transform: y 2y = e t sint, y 0 = y 0 = 0 (b) Obtain the Inverse Laplace transform of following function L 1 ln 1 + w 2 s 2 (c) Solve the following function by Laplace Transform f(t) = t 2 sinπt Q.2 (a) Solve the differential equation using Laplace Transform y" 3y + 2y = 12e 2t, y(0) = 2, y (0) = 6 (b) Obtain the Inverse Laplace Transform of following functions L 1 s (s+1)(s 1) 2 (c) Obtain the Laplace Transform (By Integral Property) L 0 t e u u + sinu du Q.3 (a) Find the Fourier series expansion for the 2π-periodic function f x = x x 2 in the interval π x π and show that 1 1 2 1 2 2 + 1 3 2 1 4 2 + = π2 12

(b) Obtain Fourier Series of f( x)= π + x, -π < x < 0 = π x, 0 < x < π (c) Find the Fourier cosine integral of f(x) = e -x x 0 Q.3 (a) Obtain the Fourier series to represent the function 1 2 f ( x) ( x),0 x 2 4 (b) Find the Fourier series of f ( x) x x where x (, ) (c) sin x Express the function f (x) 0 and evaluate sin x sin d 2 1 0. 0 x as a Fourier sine integral x BEST OF LUCK

BE - SEMESTER III MID SEMESTER-I EXAMINATION WINTER 2017 SUBJECT: Data Structure (2130702) (IT/CE) DATE: 09/08/207 TIME:10:00 AM to11:30 AM TOTAL MARKS: 40 Instructions: 1. All the questions are compulsory. Q.1 (a) Define following Terms: 1)Define Sparse Matrix. 2) What is Linked List? 3) Define Time & Space Complexity. 4) Define Storage Structure. 5) What is Active & book-keeping operation? (b) Define data structure. List out types of Data Structure and explain them in brief. Q.2 (a) Differentiate following: (i) Array Linked List (ii) Simple Queue Circular Queue (b) Consider the following queue, where queue is a circular queue having 6 memory cells. Front=3, Rear=4 Queue: _, _, C, D, _, _ Describe queue as following operations take place: A is added to the queue, Two letters are deleted, B is added to the queue, One letter is deleted, E is added to the queue (C) Write an algorithm to implement PUSH and POP Operations on Stack. Q.2 (a) Write Short notes on following: (i) DEQUEUE (ii) Priority Queue (b) Convert a b / c * d + e * f / g infix expression into postfix format showing stack status after every step in tabular form. (c) Explain basic primitive operations which can be performed on linear data structure. Q.3 (a) Write sub algorithms to implement insert & delete operations into a Circular Queue using array representation of Queue. (b) Write an algorithm to convert infix expression into equivalent postfix expression. (c) Differentiate Stack and Queue. [03] Q.3 (a) Write sub algorithms to implement insert & delete operations into simple queue using Array. (b) Convert (A + B) * C D ^ E ^ (F * G) infix expression into postfix format showing stack status after every step in tabular form. (^ denotes exponent) (c) Enlist and briefly explain various applications of stack. [03]

SILVER OAK COLLEGE OF ENGINEERING &TECHNOLOGY BE - SEMESTER III MID SEMESTER - I EXAMINATION WINTER 2017 SUBJECT: DATABASE MANAGEMENT SYSTEM (2130703) (CE/IT) DATE: 10/08/2017 TIME: 10:00 am to 11:30 am TOTAL MARKS: 40 Instructions: 1. All the questions are compulsory. Q.1 (a) i. Define Primary Key. ii. Identify this symbol and Define. iii. NOT NULL Constraints in DBMS. iv. Advantages of DBMS. v. Write down any example query to delete a table with its data. (b) Who is DBA? Discuss the role of database administrator (DBA). Q.2 (a) Explain three tier architecture of DBMS with proper diagram. (b) List out various steps to reduce ER diagram to schema. (C) Discuss following terms with proper example(s). i. Default constraint ii. Check constraint Q.2 (a) List the relational algebra operators. Discuss any two such algebra operators with suitable example. (b) What is mapping cardinality and Explain its types with suitable example. (c) Write difference between traditional file processing system and database management system. Q.3 (a) Explain generalization and specialization in E-R diagram with suitable diagram. (b) Write following SQL Queries for given table: STUDENT(ROLLNO,NAME,SEM,BRANCH,PERCENTAGE) i. Write a query to create above table. ii. Write a query to insert the details in above table. iii. Find all the students whose are in CE branch. iv. Find all the students whose name starts with A and third character is I. v. Delete the records of the students who are having percentage less than 35. (c) Explain various categories of Database users. Q.3 (a) Draw E-R diagram for Hospital management system. (b) Write following SQL Queries for given table: EMP (EMPNO, ENAME, JOB, MGR, HIREDATE, SAL,COMM, DEPTNO) i. Write a query to create above table. ii. Find all the employees whose name begins or ends with M iii. Give maximum salary from department in 20,30 and 10. iv. Find the names of employees who earn between 1200/- and 1400/-. I. Give the names of employee whose department number is 20 and salary is greater than 10000 (c) List out various types of joins. Explain inner and outer join with example.

BE - SEMESTER III MID SEMESTER-I EXAMINATION WINTER 2017 SUBJECT: DIGITAL ELECTRONICS (2131004) (CE/IT/EC) DATE: 11-08-2017 TIME: 10:00 am to 11:30 am TOTAL MARKS: 40 Instructions: 1. All the questions are compulsory. Q.1 (a) Perform Following Operations. 1. Hexa to binary (2DB)16 2. Binary Multiplication (1101)2 * (110)2 3. Convert (69)10 to its equivalent gray code and EX-3 code. 4. Given that (16)10 = (100)x, find the value of x. 5. Octal to binary (367.52)8 (b) Explain all gates with respective truth tables. Q.2 (a) Explain full adder and design it using two half adder and one gate. (b) Reduce the following expression using K-MAP, F = m(1, 2, 4, 6, 7, 11, 15) + d(0, 3) (c) Minimize the following Boolean expressions. X = ( (A'B'C')' + (A'B)' )', Y = AB + ABC' + A'BC + A'BC' Q.2 (a) Using D as the VEM, reduce Y = A'B'CD + A'B'CD' + ABC'D' + ABCD' + ABCD + AB'CD' + A'BCD + A'BC'D' + AB'C'D + ABC D. (b) Use a multiplexer having 3 data select inputs to implement the logic for the function given below. Also realize the same using 16:1 MUX, F = m(0,1,2,3,410,11,14,15). (c) Differentiate combinational and sequential circuits. Q.3 (a) Design and implement BCD to EX-3 code converter. (b) Design 3 8 decoder with necessary logic diagram. (c) State and prove De-Morgan s Theorems for three variables with the help of Truth tables. Q.3 (a) Design and explain 4-bit magnitude comparator. (b) Design and explain 4-bit binary parallel substractor. (c) Convert the decimal number 250.5 to base 3, base 4, base 7 and base 16.