Scribd
Upload
8 views

Cse 3 RD 2020

Paper

Uploaded by

hiteshsahu0231
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
8 views

Cse 3 RD 2020

Paper

Uploaded by

hiteshsahu0231
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 27
Printed Pages — 5 Roll No. 322351(14) B. E. (Third Semester) Examination, April-May 2020) (New Scheme) NOY -PEC 20% (CSE Engg. Branch) MATHEMATICS-III Time Allowed : Three hours Maximum Marks : 80 Minimum Pass Marks : 28 Note : Part (a) of each question is compulsory. Attempt any two part from (b), (c) and (d) of each question. 1. (a) Define Fourier Series and write Euler’s formula for Fourier series. 2 322351(14) PTO (21 (b) Prove that yr COS +e eek ead 1) 7, -M Find Mean and Variance. (c) The probability that a pen manufactured by a company will be defective is 1/10. If 12 such pens are manufactured, find the probability that @) exactly two will be defective (i) at least two will be defective ii) none will be defective (d) Fit a Poission distribution to the set of observations : x: 0 1 2 3 f :122 60 15 2 100] 322351(14) ney Printed Pages — 5 ROI ING! F csesrverssvrvesasersecerorer B022312(022) B.Tech. (Third Semester) Examination Nov.-Dec. 2020 (CSE Branch) DATA STRUCTURE & ALGORITHMS Time Allowed : Three hours Maximum Marks : 100 Minimum Pass Marks : 35 , Note: Attempt all questions. Part (@ is compulsory & Attempt any two parts from (b), (c) and (d) of each questions. Unitd 1. (a) Explain asymptotic notations & also. explain Big o notation & check whether this relation is valid or not with explanation f(n, =3x7+ an = o(n? )). 4 B22312(022) PTO [2] {31 (b) Consider the linear array 4 [S : 50], 6 [-5 : 10] & Unit-I [18] 3. (a) Write short notes on: 4 (i) Find the number of elements in each array. (ii) Suppose base (A) = 300 & w= 4 byte for 4. Find the address of A [15], A [40] & A [55] 8 @ Full Binary Tree (i), Complete Binary Tree ls . 8 (©) What is the ways to insert a node in link list? Write (b) Convert the following list into AVL Tree : an algorithm for inserting a node at first position. 8 64, 1, 44, 26, 13, 110, 98, 85 (d) Write an algorithm to delete the last node from a (c) Convert the following list into B Tree of order=5: 8 circular link list. 8 10,25,15,4,3,5,9,2,7, 11, 12,50,26,23,22, 13,24,6,8 Unit-IT (d) Short the following list by using Heap short algorithm : 8 2. (a) Evaluate the given postfix expression 4 10, 20, 50, 30, 15, 55, 25, 65, 45 93.44 8 44 /- __ Unit-IV (b) Write an algorithm to convert the infix to postfix 4. (a) Write short notes on the following : 4 expression & write all the steps involved in evaluating @ Directed graph the postfix expression, 8 i) Adjacency matrix atb*(c-dy/etf % g il) Degree or graph (c) Write an algorithm to traverse the circular queue. 8 (iv) Complete graph (d) Write an algorithm for Tower of Hanoi & give (b) Find the shortest path from vertex A to all the vertex example for n=3 disk. 8 in the given graph by using Djkstra algorithm. 8 B022312(022) B022312(022) PTO [4] [5] Unit-V 5. (a) Explain various types of time complexity and write down time complexity for Linear and Binary search. (b) Consider inserting the key - 29, 46, 18, 36, 43, 21, 24, 54 into hash table of size (‘M’=11) using linear probing consider the primary hash ( ) is H(k)=k (Mod m). (c) Search the item 80 from the following list using binary search 11,22,30,35,42,45,53,63,65,78,80,90,95 following graph : 8 (d) Sort the following series by using selection sort and : write time complexity for selection sort. 32,51,27,85,66,23, 13,57 (d) Distinguish between Breadth First Search and Depth First Search. ‘ “ 8 B022312(022 (022) 100) B022312(022) Printed Pages — 6 Roll No. B022313(022) B.Tech. (Third Semester) Examination Nov.-Dec. 2020 (AICTE Scheme) (Computer Science and Engg. Branch) PRINCIPLES of PROGRAMMING LANGUAGES Time Allowed : Three hours Maximum Marks : 100 Minimum Pass Marks : 35 Note: Attempt all questions. Part (a) is of 4 marks and Part (b), (c) and (d) are of 8 marks. Part (a) is compulsory and attempt any two parts Jrom (b), (c) and (d). Assume any missing data. Use diagrams wherever required. 1. (a) True/ False? @ Full form of DFD is Data Flow Diagram. (i) The flowchart depicts flow of control in program modules. B022313(022) PTO 12] (ii) We should try to minimize coupling. (iv) We should try to maximize cohesion (b) Explain : @ Operational Acceptance Testing i) Alpha Testing (ii) Beta Testing (iv) Software Maintenance phase (c) Explain following points about DFD : (i) Definition, purpose and symbols used. Gi) Purpose of Level-0 and Level-1 DFD (d) Explain about : @ Abstraction (i) Refinement (iii) Modularity. (iv) Software Architecture 2. (a) True / False? (i) Relative addréss is a memory address that represents some distance from a starting point or the base address. B022313(022) (3] (ii) The variable names, constants and instruction labels are the basic elements of the symbolic address space. (ii) In late binding the calling of the function gets bound with the definition of the function at compile time. (iv) In early binding the binding of the function call to the respective definition during runtime. (b) Answer the following : (i) What is the need of Assembler? . (i) Compare Compiler and Interpreter. (c) Answer the following : @ Draw that diagram of Water fall model, and Prototyping model. , i) Compare Water fall model and Prototyping model. (d) Answer the following : @ Draw the Scrum Development Model. (i) Explain the components of Soran Development Model, iy B022313(022) PTO [4] 3. (a) True / False? [5] (@) Java is an example of Imperative programming Gi) Clause or rule language. ite 4, (a) True/ False? Gi) Java is an example of Functional programming . . (@) C++ is an object oriented programming Lenguigs ) Pp : language. (iii) LISP is an example of Imperative programming . i c tg i) C++ is a procedural programming language. age. . 4 . . (ii) Objects are created using class. (iv) LISP is an example of Functional programming language (iv) Objects are created using functions. (b) Answer the following : (b) Answer the following : @_ Explain Imperative programming () What are Static members in a class? (i) Explain Functional programming (i) Write a program in C++ to demonstrate the use of static members in a class. (c) Explain following about LISP : (c) Answer the following : @_ Executor @ At (i) What are Nested class? i) toms i) Lists Gi) Write a program to demonstrate the use of i) List Nested class. (iv) Strings (d) Answer the following : é ¥ (d) Explain following about PROLOG : > (i) Compare New and Delete operators. i Variable and Atom 0 Gi) Write a program in C++ to demonstrate the use B022313(022) of New and Delete operators. B022313(022) PTO 16] 5. (a) True / False? (i) Try-Catch are part of exception handling in C++. (i) Throw-Try-Catch are part of exception handling in C++. Gii) During inheritance un-named instance of child class in gets created in parent class instance. (iv) Templates implement runtime polymorphism. (b) Answer the following : @ Explain function templates with code example in Crt. Gi) Explain class templates with code example in CH. (c) Answer the following: . (@® Explain Abstract class in C++, Gi) Write a program to create an Abstract class in CtHt, (d) Answer the following : @ Explain Hybrid inheritance in CH. (i) Write a program in C++ to demonstrate Hybrid inheritance, 100) B022313(022) Printed Pages— 4 Roll No. B022314(022) B. Tech. (Third Semester) Examination, Nov.-Dec. 2020 (Computer Science and Engg. Branch) DIGITAL ELECTRONICS and LOGIC DESIGN Time Allowed : Three hours Maximum Marks : 100 Minimum Pass Marks : 35 Note ; Attempt all questions. Each question carries equal makrs. Part (a) is compulsory and answer any two parts from (b), (c) and (d). 1. (a) Fillin the blanks : @ (84-2-1) code for decimal digit 3 is .......... (i) 2’s complement of 101100.is ............. (ii) Binary of gray code 00110110 is ........... (iv) Excess 3 code of decimal number 9 is ......,.... (b) Solve the following using K-map : B022314(022) PTO [2] [3] @) FI(A,B,C, D) = Em(1, 5, 6,12, 13,14) + Ea (24) (b) With the help of neat diagram, explain the working of: di) F2(A, B,C, D) =Tln(0, 1. 2, 4, 6, 8.9, 11, 12) () CMOS inverter and (ii) CMOS NOR gate 8 (c) Simplify the following using Tabulation method 8 F(A, B,C, D) = Ein(1, 3,5,8,9, 11,15) +4(2,13) (c) Explain the working of TTL circuit with Totem pole output configuration. 8 (d) The message below coded in the 7-bit hamming code is transmitted through channel. Decode the (d) Implement the fgollowing Boolean function using: 8 PLA message assuming that single error occurred in each 9 code word. di) PLA @ 1001001 ' F1(A, B, C)= Zm(3, 4, 5, 6, 7) Gi) 0111001 F2(A, B,C) = Zm(2, 5,6, 7) Gi) 1110110 (iv) 0011011 3. (a) Fill in the blanks : 4 Find the correct code in each case. 8 @ consists of logic gates where output at any instant is determined by present combination 2. (a) Compare RTL, DTL, TTL and ECL on the basis of : 4 of input as well as previous state of output. (i) Component used Gi) ...uu... is an example of combinational @i) Fan out circuit. (ii) Propagation delay and | (ii) Logical expression of carry out in half adder is (iv) Application B022314(022) BO022314(022) PTO 5. 100} 14) (iv) Minimum number of NAND gates required for designing Half Adder is .............. (b) Design 4-bit look ahead carry adder with suitable diagram. (c) Design full adder using 4 : 1 MUX, (d) Design and implement comparator. (a) Convert SR flip-flop to T flip-flop. (b) What is race around condition for J-K flip-flop? How it can be avoided in master slave flip-flop? (c) Design and implement 4 bit synchronous up counter, (d) Design Serial in Serial Out (SISO) and parallel in Serial Out (PISO) shift register using D flip-flop. (a) Discuss the various operators used in VHDL. (b) Write short notes on Mealy and Moore machine. (c) Write a program in VHDL using data flow modelling for half adder. (a) Write a program in VHDL using behavioural modelling for AND gate. B022314(022) Printed Pages ~— 6 Roll NO. ¢ eecseeestereeeees B022315(022) B.Tech: (Third Sentester) Examination, Nov.-Dec. 2020 (CSE 'Branch) “(Specialization y CSE) OPERATING SYSTEMS Time Allowed. : Three hours _ Maximum Marks : 100 Note : Attempt, all, questions. Part (a) af. each . question, is compulsory. Attempt any twa parts from (b), (c) and (d). ° dal Late lowe antioee [rot Unitd, 1. (a) Explain how' Opetating, systent ete dsa Resource Manager? sain int 4 (b) The services and functions provided by an operating BO022315(022) PTO [2] [3] system can be divided into different components (d) What is CPU scheduling? If the different jobs and Briefly explain all the components of Operating their arrival time and burst time are given below : System, 8 Pp. No nap " Arrival time avait Burst time (c) Analyze different types of operating systems with an 1 0 6 example. Which type of operating system is most 2 1 4 suitable for the modern computer system and why? 8 3 2 3 (d) Name and discuss the range of system calls that may 4 3 1 be supplied by an operating system under various 5 4 2 circumstances. List the sequence of system call required 6 Ys 1 to copy content ofa file to another file. 8 . ot Find the average turnaround time, average waiting Unit-IT time and throughput using Round Robin (with time en .. quantum = 2) and SRTF. 8 2. (a) Give Five State model of process state transition. 4 (b) What are the two models of inter-proces communication? Unit-IIT What are the strengths and weakeness of the two 3. (a) What is Deadlock? Give characteristics of deadlock. 4 approaches? 8 (b) What are the four necessary conditions for (c) Discuss critical section problem and how this can characterizing deadlock? What is the only reasonable be overcome using semaphores. Write the solution condition that can be used to prevent deadlocks ftom for achieving mutual exclusion requirement in a occurring? 8 producer consumer problem. 8 (c) Explain Banker’s algorithm and safety algorithm with pseudo code, 8 B022315(022) B022315(022) PTO {41 (d) Write an algorithm to determine whether a given system is in a deadlock and explain. Consider resource A has total 7 instances, B has 2 instances and C has 6 instances the following snapshot of a system : Process | Allocation | Request Available ABC A BC/ABC i 010 /000}000 : 200/202 P, 303 |0 00 P, 211 100 P, 002/002 Answer the following using Banker’s algorithm : (i) Is the system in a safe state? (i) If Yes, mention the safe sequence. (ii) Ifa process P2 makes a request of one additional request for an instance of type C, will the system lead to deadlock state then. Unit-IV 4, (a) What is virtual memory? B022315(022) [5] (b) What is the need of page replacement? Consider the following page references string : 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Find out the no. of page fault by LRU, OPT replacement, FIFO algorithm. Assume there are four page frames. (c) Explain the difference between internal and external fragmentation : Given five variable sized memory partitions of 100 kb, 500 kb, 200 kb, 300 kb, 600 kb (in order), how would each of the first fit, best fit and worst fit algorithm place processes of 212 kb, 417 kb, 112 kb and 426 kb (in order)? Which algorithm makes most efficient use of memory? (d) Why are segmentation and paging sometimes combined into one scheme? Explain the paged seg- mentation. Unit-V 5. (a) What are the different files allocation methods? (b) Considering SCAN disk scheduling algorithm. How B022315(022) PTO 4 {6] is it possible to reduce the time required to finish off? Explain with an example. (c) Describe various file accessing methods with its advahiages and disadvantages. part (d) Suppose ia the head of a moving head disk with 200 tracks, 0 to 199, is currently serving a request at'143 and tias just finished’a request at'frack 125, The queue of request is kept in FIFO’ order’ 86, 147, 91;177, 94 130, 102, 175, 130. What is the total number of head movement needed'to specify these tequest for the following disk a ‘algorithms? * ‘ : , @ SSTF scheduling ‘Caran sta (i) SCAN scheduling 100}: B022315(022) {21 determine the Thevenin’s equivalent network for the load Ry, (c) In the network of the figure shown below, find Yo using Superposition theorem. (d) The network of: the forel is s operated in the sinusoidal steady with the element values given ad = ‘100 cos 2¢. Determine (a) the complex pow generated by the source, (b) the effective current in each of the passive elements, ‘and (c) the complex power for each of the passiye elements,in the network... by Fie B028314(028) [3] Unit-Il 2. (a) @) How is the behaviour of an cnergized and an Unenergized inductor at t= 0+ and t= ~, Gi) Howa charged and an uncharged capacitor behaves at r= 0+ and t= °, (b) In the network of the figure, switch K is changed ftom position a to b at t= 0: Solve for i di/dt and llth, att=0+ifR= - 1000 2, L=14,.¢=0.) HF and VY = 1000 V. EOP ES fal (c) In the circuit shown in the figure, the switch K is closed at += 0 connecting a voltage V, sinot , to the parallel RL-RC circuit. Find (a) di, /ar and (b) di,{dt at 7=0+. B028314(028) PTO (d) In the network given, the initial voltage on C, is Y,_ and on C,, is V,-such that .,(0)=Yxand v,(0)=V,. At /=0, the switch is closed, determine the values of dy/at and dv, /atat t= 0+. If Unit-T 3, (a) State and prove Time Shifting Theorem. RAIR7tA MIR) {5] (b) In thenetwork of the figure, the switch K is moved from position a to position b at t= 0, a steady state having previously been established at position a, Solve for current j(/), using the Laplace transformation method. (©) The network of the figure reaches a steady state with the switch K aa At t meals switch K is (@) The waveform: shown in Peng is.that of a full- {B028314(028) ?TO 16] wave rectified, voltage. The equation for the Br} waveform is sin¢ from 0'to nm, —sin ¢ from x to (c) The accompanying figure shows two two-port networks connected in parallel. One two-port 27, etc, Show that the transform of this function is contains only a gyrator and the other is a resistive ‘network containing a single controlled source, For this network, determirie the y-parameters. r an Sxrt Unit-IV (a) Why h-parameters are called hybrid parameters? i Write the application of h-parameters? @ The esa of the figure represent a certain transistor over a given range of frequencies, For this (b) Why the z-parameters are called open circuit network, determine the h parameters, 5 impedance parameters? The network shown below contains a voltage controlled source and a current controlled source. For the element values specified, _determine the y and z parameters. wie Veeeihe ay vote able tA HY Unit-V 5, (@) Define Sinusoid. What is the relation between B028314(028) B028314(028) : PTO Printed Pages — 3 Roll No. : B033313(033) B. Tech. (Third Semester) Examination, Nov.-Dec. 2020 (New Scheme) OBJECT ORIENTED CONCEPTS & PROGRAMMING USING JAVA Time Allowed : Three hours Maximum Marks : 100 » Minimum Pass Marks : 35 Note : Attempt all the questions. Part (a) is compulsory from each unit and carries 4 marks, Attempt any two parts from (b), (c) and (d). Each part carries 8 marks. Unit-I 1. (a) What do you mean by class and object? (b) What are the features of OOP’s in Java? B033313(033) PTO [2] (c) Explain command line argument with suitable code. (d) Explain ‘this’ keyword with suitable program. Unit-II (a) What is packages in Java? (b) What is abstract classes in Java? (c) What is ‘Final’ keyword? Explain is uses. (d) What is methods overriding? Explain with program. Unit-I (a) What do you mean by exception? (b) How we can handle an exception in Java? (c) What is user defined exception? Write a suitable code. (d) What are the different string handling method in Java? Unit-IV |. (a) What is thread priority? (b) What do you mean by thread synchronization? BO033313(033) 13] (c) How we can create a thread? (d) Explain life cycle of thread. Unit-V 5. (a) What is AWT? (b) Explain life cycle of applet. (c) What are the JDBC drivers? (d) What are the basic steps to connect Java application with database. 100] B033313(033) Printed Pages — 4 Roll No. B033314(033) B. Tech. (Third Semester) Examination, Nov.-Dec. 2020 (New Scheme) COMPUTER NETWORKS Time Allowed : Three hours Maximum Marks : 100 Minimum Pass Marks : 35 Note : All questions are compulsory. Part (a) is compulsory from each unit and carries 4 marks, Attempt any two parts from (b), (c) and (d). Each part carries 8 marks. Unit-I 1. (a) What are the applications of Computer Networks? (b) Define computer networks? Discuss various types of networks topologies in computer network. Also BO033314(033) PTO [2] discuss various advantages and disadvantages of each topology. (c) What is OSI Model? Explain the functions, protocols and serivces of each layer. (d) Explain the following transmission media. Twisted pair, coaxial cable and fiber optics. Unit-II 2. (a) What is Multiplexing? (b) Discuss about physical properties of Ethemet 802.3 with necessary diagram of Ethernet transceiver. (c) Explain different error detection and correction mechanisms with examples. (d) Explain CSMA/CD and protocols with collision detection and Avoidance. Unit-I 3. (a) Define Masking. (b) Explain : (i) Repeater B033314(033) {3] (i) Bridge (iii) Router (iv) Gateway (c) What is IP addressing method and write the difference between IPv4 and IPv6. (d) Write short notes on : (i) Distance vector routing Gi) Link state routing Unit-IV (a) What is segmentation? (b) Write the difference between UDP & TCP protocols. (c) What is the function of X-25? Explain in detail. (d) Write short notes on ATM? Unit-V (a) What is Cryptography? (b) What is network security explain in detail BO033314(033) PTO [4] (c) What is meant by cryptography explain with the help of suitable examples, (d) Explain detail about Domain Name System 100) BO033314(033)

You might also like