silver oak college of engineering & technology aditya

7
Enroll. No. _____________ SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY BE - SEMESTER–III• MID SEMESTER-I EXAMINATION WINTER 2018 SUBJECT: Data Structure (2130702) (CE/IT) DATE: 08/08/2018 TIME:10:00 AM to11:30 AM TOTAL MARKS: 40 Instructions: 1. All the questions are compulsory. 2. Figures to the right indicate full marks. 3. Assume suitable data if required. Q.1 (a) Define data structure. List out types of Data Structure and explain it in brief. [03] (b) Discuss best case, average case and worst case time analysis with example. [03] (c) Write a short note on Deque. [04] Q.2 (a) Write sub algorithms for PUSH & PEEP Operations on Stack. [06] (b) Convert infix expression into Postfix format showing stack status after every step in tabular form.((( P ( Q *R))* S) $ ( T /U )+V [05] (c) Explain Tower of Hanoi in brief and write a recursive C function to implement Tower of Hanoi. [04] OR Q.2 (a) Write an algorithm to implement infix to postfix conversion with parentheses. [06] (b) Convert infix expression into Postfix format showing stack status after every step in tabular form. (A + B) * C D ^ E ^ (F * G) [05] (c) Explain applications of Stack. [04] Q.3 (a) Write sub algorithms to perform insert & delete operations on simple queue. [06] (b) Compare the following terms (i)Simple Queue & Circular Queue. (ii) Stack & Queue [05] (c) 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 operation take place: F is added to the queue, Two letters are deleted, R is added to the queue, S is added to the queue, One letter is deleted. [04] OR Q.3 (a) Write sub algorithms to perform insert & delete operations on circular queue. [06] (b) Evaluate the following expressions showing every status of stack. (i) 7 5 2 + * 4 1 1 + / - (ii)2 3 $ 5 2 2 $ * + 6 6 / - [05] (c) Enlist the applications of Queue. Explain Priority Queue. [04] Page 1 of 2 ----------------------------------------------------------------------------------------------------------------------------------------

Upload: others

Post on 03-Oct-2021

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA

Enroll. No. _____________

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

BE - SEMESTER–III• MID SEMESTER-I EXAMINATION – WINTER 2018 SUBJECT: Data Structure (2130702) (CE/IT)

DATE: 08/08/2018 TIME:10:00 AM to11:30 AM TOTAL MARKS: 40

Instructions: 1. All the questions are compulsory. 2. Figures to the right indicate full marks. 3. Assume suitable data if required.

Q.1 (a) Define data structure. List out types of Data Structure and explain it in brief. [03]

(b) Discuss best case, average case and worst case time analysis with example. [03]

(c) Write a short note on Deque. [04]

Q.2 (a) Write sub algorithms for PUSH & PEEP Operations on Stack. [06]

(b) Convert infix expression into Postfix format showing stack status after every step

in tabular form.((( P –( Q *R))* S) $ ( T /U )+V

[05]

(c) Explain Tower of Hanoi in brief and write a recursive C function to implement

Tower of Hanoi.

[04]

OR Q.2 (a) Write an algorithm to implement infix to postfix conversion with parentheses. [06]

(b) Convert infix expression into Postfix format showing stack status after every step

in tabular form. (A + B) * C – D ^ E ^ (F * G)

[05]

(c) Explain applications of Stack. [04]

Q.3 (a) Write sub algorithms to perform insert & delete operations on simple queue. [06]

(b) Compare the following terms

(i)Simple Queue & Circular Queue. (ii) Stack & Queue

[05]

(c) 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 operation take place:

F is added to the queue, Two letters are deleted, R is added to the queue, S is added

to the queue, One letter is deleted.

[04]

OR Q.3

(a) Write sub algorithms to perform insert & delete operations on circular queue. [06]

(b) Evaluate the following expressions showing every status of stack.

(i) 7 5 2 + * 4 1 1 + / - (ii)2 3 $ 5 2 2 $ * + 6 6 / -

[05]

(c) Enlist the applications of Queue. Explain Priority Queue. [04]

Page 1 of 2

----------------------------------------------------------------------------------------------------------------------------------------

Page 2: SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA

Enroll. No. _____________

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY

ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY

BE - SEMESTER–III • MID SEMESTER-I • EXAMINATION – WINTER 2018

SUBJECT: Digital Electronics (2131004) (CE/IT/EC)

DATE: 11-08-2018 TIME:10:00 am to 11:30 am TOTAL MARKS:40

Instructions: 1. All the questions are compulsory. 2. Figures to the right indicate full marks. 3. Assume suitable data if required.

Q.1* (a) Differentiate combinational and sequential circuits. [03]

(b) Explain full adder in detail [03]

(c) Conversions

1)Binary to Decimal – (1011.01)2

2) Given that (16)10 = (100)x, find the value of x.

3)Binary Division – (101101)2 / (110)2

4)Using 10’s compliment subtract : (2928.54 – 416.73)10

[04]

Q.2 (a) Explain NAND as a universal gates. [06]

(b) 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

[05]

(c) Use a 4 × 1 MUX to implement the logic function, F(A,B,C) = ∑m(1,2,4,7). [04]

OR

Q.2 (a) State and prove De-Morgan’s Theorems for two and three variables with

the help of Truth tables.

[06]

(b) Design and implement BCD to EX-3 code converter. [05] (c) Explain the 4 bit parallel binary substractor. [04]

Q.3 (a) Minimize the following Boolean expression using K – map and

implement the same using gates. F = ∑m(0,2,6,10,11,12,13) + d(4,5,14,15)

[06]

(b) Design and explain 4-bit magnitude comparator. [05]

(c) Reduce the expression F = ((AB)'+A'+AB)' and draw the logic diagram

for the given expression.

[04]

OR a) Explain JK Flip flop with necessary circuit diagram and tables.

(b) Explain the conversions of T to D Flip-flop [05]

(c) Explain the 3*8 decoder [04]

Page 3: SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA

Enroll. No. _____________

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

BE – SEMESTER–III • MID SEMESTER-I EXAMINATION – WINTER 2018

SUBJECT: ENGINEERING ECONOMICS AND MANAGEMENT (2130004) (CE/IT/EC/EE)

DATE: 07-08-2018 TIME: 10:00 am to 11:30 am TOTAL MARKS:40

Instructions: 1. All the questions are compulsory. 2. Figures to the right indicate full marks.

Q.1 (a) Give the differences between microeconomics and

macroeconomics.

[03]

(b) Discuss the managerial skills. [03]

(c) Define GDP and GNP. [04]

Q.2 (a) Discuss in details the determinants of supply. [06]

(b) Distinguish between Perfectly Competitive Market and Monopoly

Market.

[05]

(c) Define economics. Why is the study of Economics useful in

engineers?

[04]

OR

Q.2 (a) Define Demand. Explain law of demand with the help of a diagram. [06]

(b) How is economics important to engineers? [05]

(c) Explain the factors of production. [04]

Q.3 (a) Explain scientific principles of management in details. [06]

(b) Differentiate between Management and Administration. [05]

(c) List down the 14 principles of management given by Henri Fayol. [04]

OR Q.3 (a) Explain Maslow’s need Hierarchy theory in detail with diagram. [06]

(b) Discuss the 10 managerial roles given by Henry Mintzberg. [05]

(c) Write a short note on “Levels of Management”. [04]

Page 4: SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA

Enroll. No. _____________

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY

ADITYA SILVER OAK INSTITUTE OF TECHNOLOGY

BE - SEMESTER–III • MID SEMESTER-I EXAMINATION – WINTER 2018

SUBJECT: ADVANCED ENGINEERING MATHEMATICS (2130002) (ALL BRANCHES)

DATE: 09-08-2018 TIME: 10:00 am to 11:45 am TOTAL MARKS: 40

Instructions: 1. All the questions are compulsory. 2. Figures to the right indicate full marks. 3. Assume suitable data if required.

Q.1*

(a) Find the Laplace Transform of the function

. [03]

(b) Find . [03]

(c) Find a Fourier Series for , where . [04]

Q.2

(a) Find

using Convolution theorem. [06]

(b) State the convolution theorem and verified it for and . [05]

(c) Find the Fourier integral representation of the function

. [04]

OR Q.2 (a) Solve using Laplace transform: . [06]

(b) Find (i)

(ii)

. [05]

(c) Find the Fourier cosine series of , where . [04]

Q.3

(a) Expand in Fourier series in the interval if

.

Hence show that

.

[06]

(b) Find the Fourier Series for in (0,2π); a>0. [05]

(c) Find the Laplace Transform of tt 3sin 2

. [04]

OR

Q.3

(a) Express the function

as a Fourier integral.

Hence, evaluate (a)

(b)

[06]

(b) Find Fourier series of . Hence deduce that

.

[05]

Page 5: SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA

(c) Find

t t

dtt

teL

0

sin

[04]

Page 6: SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA

Enroll. No. _____________

SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY BE – SEMESTER–3rd • MID SEMESTER-I EXAMINATION – WINTER 2018

SUBJECT: Database Management System (2130703) (CE/IT) DATE: 10/08/2018 TIME: 10:00 To 11:30 AM TOTAL MARKS: 40

Instructions: 1. All the questions are compulsory. 2. Figures to the right indicate full marks. 3. Assume suitable data if required.

Q.1 (a) Define Following terms. a)Primary Key b)Candidate Key c)Generalization d)Super Key e)Relational Algebra

[5]

(b) Solve following SQL queries with following tables, where underlined attributes are prime. Person(ss#,name,adrs),Car(license,year,model),Accident(date,driver,damage-amnt) 1. Find the model of car whose license number is '12345'. 2. Find the name of persons whose name starts with 'A'. 3. List drivers who did accidents between date 1/02/2017 to 1/02/2018.

[5]

Q.2 (a) What is Database Management System? What are the possible applications of DBMS?.

[6]

(b) Who is DBA? Discuss the role of database administrator (DBA). [5]

(c) Draw and explain three level architecture of DBMS. [4]

OR

Q.2 (a) List the relational algebra operators. Discuss any Three such algebra operator with suitable example.

[6]

(b) Explain disadvantages of conventional file-based system compared to Database Management System.

[5]

(c) Enlist and briefly explain categories of database users. [4]

Q.3 (a) What is meant by normalization? Write its need. List all and discuss any three normalization forms.

[6]

(b) Draw E-R diagram for bank management system [5] (c) List and explain various mapping cardinalities of E-R diagram. [4]

OR

Q.3

(a) What is functional dependency? List all and Explain any three types in detail. [6]

(b) Draw E-R diagram for Library management system. [5]

(c) Explain closure of Attributes. [4]

-------------------------------------------------------------------------------------------------------------------------------------

Page 7: SILVER OAK COLLEGE OF ENGINEERING & TECHNOLOGY ADITYA