Scribd
Upload
51 views31 pages

Cse Aids Dec 2022

Uploaded by

Ritika
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
51 views31 pages

Cse Aids Dec 2022

Uploaded by

Ritika
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/ 31
. Alps / ik ROI NO. cssscsssssosesersassoreeee Total Pages : 04 BT-3/D-22 43216 MATHEMATICS FOR BIG DATA AND OPTIMIZATION BS-CS-AIDS-201-A Time : Three Hours} [Maximum Marks : 75 Note : Attempt Five questions in ail, selecting at least one question from each Unit. All questions carry equal marks. Unit I 1. (a) Expand xsinx as sine seriesin00 G-61/9) L-43216 P.T.O. (b) 3 @ (b) 4. (@) (b) 5. @ L-43216 2 Show that the function e ? is self-reciprocal under Fourier transform. 15 Unit Ii Solve the differential equation : 75 (3x +6") dr-+(6x°y +4y* dy =0 . Solve the differential equation : 75 ay 1 2,3 St+Hy=6x°y". dk x? ¥ By variation of parameter, find the solution of 2 Fp sb sayasine 15 Solve : 15 2 (ay? SZ ern +y =Acoslog( +9. Unit HE Using the method of False position to find the root corrected to three places of decimal of the equation 2 ~7x-3=0. 15 (b) Find the value of sin (1.747) using the values given in the table below : 75 x cos x 1.70 0.9916 1.74 0.9857 1.78 0.9781 1.82 0.9691 1.86 0.9584 6. Find an approximate value of (0.1) in the steps of 0.1, 5 : Uy, & \ if Beg (0) =1, y'(0)=0 by Runge-Kutta Method of forth order. 15 Unit IV 7. (a) Give any five reasons why the study of unconstrained minimization methods is important. 75 (b) Define the following terms : 75 G@) ~~ ~Pattern directions Gi) Conjugate directions (iii) Simplex (iv) Gradient of a function (v) Hessian matrix of a function. (3-61 O)L-43216 3 P.T.O, 8. Minimize f =x? +2x3 +3x3 Subject to the constraints 8, =X — X_ ~— 2x3 < 12, 82 =X, + 2x, - 3x; < 8 using Kuhn-Tucker conditions. 15 L-43216 4 150 ROL NO. scsessscsscssnrercenceeeee Total Pages : 02 BT-3/D-22 43217 OBJECT ORIENTED PROGRAMMING PC-CS-AIDS-203A Time : Three Hours] [Maximum Marks : 75 Note : Attempt Five questions in all, selecting at least one question from each Unit. All questions carry equal marks, Unit I 1. What is Object-Oriented Programming ? Describe the following in the context of Object-Oriented Programming :. (a) Objects and Classes (b) Polymorphism (c) Inheritance. 2. (a) lustrate the structure of C++ program through an example application of your choice. (b) Bring out the distinction between abstraction and encapsulation using suitable examples. Unit IL 3. (a) Write a simple and complete C++ program to demonstrate Friend class. (S-30/3) L-43217 P.T.O. (b) How constructors are different from a normal member function ? Describe the characteristics and types of constuctors. 4. Why and when do we use inheritance ? What is public, private and protected inheritance ? Also describe the types of inheritance in C++. Unit D1 5. How is compile-time polymorphism achieved in C++ ? Illustrate using suitable examples. 6. (a) Describe the use of virtual functions, When is a virtual function called a pure virtual function ? (®) Describe how fractional numbers can be added using operator overloading. Unit IV 7, What is the advantages of exception handling and how is exception handling built up in C++ ? Give a brief description of standard exceptions. 8. Answer the following questions in brief : (a) What are the type of streams in C++ ? (b) What are templates and how do they work ? (c) Can there be more than one arguments to templates ? Justify using an example. L-43217 2 150 Roll No. ....... savenesasesesseoese : Total Pages : 02 BT-3/D-22 43218 DATA STRUCTURES AND ALGORITHMS PC-CS-AIDS-205A Time : Three Hours] [Maximum Marks : 75 Note : Attempt Five questions in all, selecting at least one question from each Unit. All questions carry equal marks. Unit I 1. (a) What is the importance of data structures in solving problems ? How are data structures classified ? Give two examples of each type to highlight their distinction. (b) What is meant by asymptotic analysis of an algorithm ? Describe the commonly used asymptotic notations used to represent the complexity of an algorithm. 2, (a) What are sparse matrix and two-dimensional arrays ? Explain using an example, how two-dimensional arrays and sparse matrix can be used to solve problems. {3-38/1)L-43218 P.T.O. 6. (b) Describe, how an array will be sorted using bubble sort. Unit If Show, how a stack is implemented using arrays. Write an algorithm for evaluating a postfix expression using a stack. Describe one more application of Stack. What is the difference between Linear Queue, Circular Queue and Priority Queue ? What operations can be performed on Queues ? Also describe any one applications of Queues. Unit I Describe the advantages of Linked Lists over arrays. How is an element inserted and deleted in a Linked List ? (a) What are Circular and Doubly Linked List ? (v) Describe one application where a linked list may be used. Unit IV Define binary tree and show how can it be traversed. Bring out the distinction between binary tree and threaded binary tree. How will a binary tree be created for a the following input. 10, 15, 12, 7, 8, 18, 6, 20 Describe the methods for representing graphs. What is depth first traversal of a graph ? L-43218 2 150 ROT NO. cescsssesoresecnseecsore Total Pages : 03 BT-3/D-22 43219 INTRODUCTION TO ARTIFICIAL INTELLIGENCE PC-CS-AIDS-207A Time : Three Hours] (Maximum Marks : 75 Note : Attempt Five questions in all, selecting at least one question from each Unit. All questions carry equal taarks. Unit I 1. (a) Explain the holistic view of expert systems with the help of some real time examples. 8 (b) Justify the basic usage of means-end analysis with the help of some practical examples. 7 2. (a) Elaborate the concept of theorem proving and abstraction in artifical intelligence. 8 (b) Differentiate between depth first search and breadth first search problem solving techniques. 7 Unit IT 3. (a) Why is predicate logic used ? Explain the process of unification and modus ponens. 8 (2-215) L-43219 P.T.O. ©) 4 @ (b) 5. (a) () 6. (a) () 7. (a) L-43219 Compare and contrast between declarative and procedural knowledge representation. 7 Why is Alpha Beta Cutoff method used ? Explain its significance in game playing. 8 Differentiate between forward chaining and backward chaining, 7 Unit DT Compare and contrast between prepositional versus first order logic. 8 Identify the relevance of first order logic, unification and lifting in knowledge engineering. 7 Explain the usage, significance and real time characteristics of using fuzzy logic. 8 Compare and contrast between semantic and pragmatic processing in natural language processing, 7 Unit IV Define neural networks and genetic algorithms. Explain with some real time applications where genetic algorithms and neural networks can be used. Also, identify the main technical differences among these two. 8 {b) Differentiate between inductive and ensemble learning. 7 8. (a) What are the various forms of learning ? Explain the concepts of explanation based learning methods and statistical learning methods with the help of some practical examples. 8 (b) Explain the case study of MYCIN with the help of its functional block diagram. 7 (2-216) L-43219 3 150 ROW NO. csssesessessseerenssssees Total Pages : 03 BT-3/D-22 43220 PROGRAMMING LANGUAGES PC-CS-AIDS-209A lime : Three Hours] [Maximum Marks : 75 Note : Attempt Five questions in ali, selecting at least one question from each Unit. All questions carry equal marks. Unit I i. (a) Differentiate between orthogonality and abstraction in the programming languages. 5 (b) What are the major cost measures of any programming language ? 3 (c) Define binding and binding times, What are the different design classes of binding times in the designing of programming languages ? 5 2. (a) Discuss the concept of optimization in a complier. 5 (b) Discuss the specification and implementation of subranges and enumerations in elementary data types. 5 5-31/2) L-43220 P.T.O. {c) @) (>) L-43220 Write down the BNF grammar and generate the parse tree for the following sentence : “We are playing the game of football for the last ten years.” 3 Unit What is the basic role of using structured data objects ? How to implement information hiding and overloaded subprograms ? 8 Discuss the specification and implementation of union, pointer and character strings. 7 What are the main problems which are associated with the complex structured data types ? 8 Differentiate between linked storage representation and sequential storage representation. 7 Unit HI What is basic role of referencing environment ? Explain the concepts of call by reference and call by name for transmitting parameters. 8 Discuss the following by taking their relevant significance and roles : 7 (i) Synchronization through semaphores Gi) Monitors Gii) Message passing. 8. @ () (b) @ () Explain the concept of static scoping and dynamic scoping by taking some practical examples of any programme language. 8 Discuss the role of short-circuit Boolean expressions in sequencing with the heip of suitable examples. 7 Unit IV Define garbage and dangling references in storage management. 8 Differentiate between stack based storage management and heap storage management for variable and fixed size elements. 7 Discuss the following concepts in relation to Ada aid Smalltalk : 8 (i) Subprograms and storage management (i) Abstraction and encapsulation. Differentiate between structural and logical programming languages by taking some programming examples. 7 (5-31/2) L-43220 3 150 ROILNO, cescccscessesreseeseones Total Pages : 02 BT-3/D-22 43221 BUSINESS INTELLIGENCE AND ENTREPRENEURSHIP HM-902-A ‘Time : Three Hours] [Maximum Marks : 75 Note : Attempt Five questions in all, selecting at least one question from each Unit. Unit I 1. What is entrepreneurial training ? Which entrepreneurial competencies or traits can be learnt through training and are required for successful entrepreneur ? 2. Which factors (economic and non-economic) affect the entrepreneurial growth ? Which challenges are faced by entrepreneurs now-a-days ? Unit II 3. How search and identification of entrepreneurial opportunity is done ? How an entrepreneur can develop business idea and implement that idea ?_ 4, How market research is conducted ? How is industry analysis and competitor analysis done ? (2-40/5) L-43221 P.T.O. Unit TN 5. Why are SSIs needed in India ? Which challenges are faced by SSIs in availing MSME schemes ? 6. How SSIs get registration ? What is the role of SSIs in economic development of the country ? Unit IV 7. Which institutions are working in India to support MSMEs ? Write on the functions of SIDBI and DIC. 8. What are the requirements for the formation of private/ public limited companies in India ? Which legal issues are involved in the process of formation of company ? 1L-43221 2 150 Roll NO. cssessesssesee Total Pages : 3 BT-5/D-22 45261 THEORY OF COMPUTATION Paper-PC-CS-AIDS-301A Time : Three Hours} (Maximum Marks : 75 Note ; Attempt five questions in all, selecting at leastone question from each unit. Each question carry equal marks. UNIT-I 1. (a) IfLis accepted by an NFA with €-transition then show that L is accepted by an NFA without ¢-transition. (b) Construct a DFA equivalent to the NFA. M = ({p, q, r}, {0, 1}, 5, p, {q, s}). Where 8 is defined in the following table. [sto | | Lp | tas) | | jaf [tant (748=15) 2. (a) Write short notes on precedence of Regular expression operators. Construct an NFA equivalent to the regular expression (0+1)*(00+11)(0+1)*. 45261/150/KD/687 2 T.O. av [P.T.0. 4. 5. 6. (b) (@) (b) (c) @) (b) Write about equivalence and minimization of NFA and DFA automata. Obtain the regular expression that denotes the language accepted by the following DFA. 1 f) 0,1 88 (748515) UNIT-IT Let G be the grammar S->aB/bA, A->a/aS/bAA, B->b/bS/aBB. Obtain parse tree for the string aaabbabbba. Discuss closure properties of CFL. Convert the grammar S->AB, A->BS/b, B->SA/a into Greibach Normal Form. (5+5+5=15) Discuss Pumping lemma along with its advantages. State Pumping Lemma for Context free languages. Define a Regular set using pumping lemma. Show that the language L = {0i? / i is an integer i >= 1} is not regular. (7+8=15) UNIT- Wi Write a detailed note on the representation, equivalence and designing of Mealey and Moore machines. (15) What are the different ways in which a PDA accepts the language? Define them. Is it true that non-deterministic PDA is more powerful than that of deterministic PDA? Justify your answer and explore the potential applications of PDA. (15) 45261/150/KD/687 2 UNIT- IV 7. (a) What is Turing machine? Explain in detail : "The Turing Machine as a Computer of integer functions”. (b) Explain time and tape complexity measures of Turing machines. (7+8=15) 8. (a) Whena problem is said to be decidable or undecidable? Give an example of decidable and an undecidable. (b) What is Post's Correspondence problem (PCP)? Discuss. (74+8=15) 45261/150/KD/687 _ 3 ROM NO. wecseceeesssseeens Total Pages : 4 BT-5/D-22 45262 DESIGN AND ANALYSIS OF ALGORITHMS Paper—PC-CS-AIDS-303 A Time : Three Hours] [Maximum Marks : 75 Note : Attempt any five questions. 1. Answer following questions in brief. Each part is of 3 marks. (a) What is prority queue? Explain with the help of example, {b) Write the master theorem for solving recurrence relation. (c) What is topological sort? Show with example. (d) What is merging network? Illustrate with example. (e) Define Binomial heap with example. (3x5=15) 2. (a) Explain Big-oh, Big-omega and Big-theta notations of the complexity. Also show each with the help of example and graph. oa) (b) What is task scheduling problem? Compute the optimal sequence of task for following deadlines. (8) 45262/150/KD/708 [P.T.O. as ; 3. (@) (b) (a) (b) ee ee ae ee re a ee ar a | |e | [o6 | uw | Explain Strassen's matrix multiplication algorithm and compute the matrix multiplication of following using Strassen's algorithm. 3.2 15 X= Y= F i sl: o Define Fibonacci heap. Write the pseudo code for insertion and union operation in the Fibonacci heap. ®) What is the minimum spanning tree? Explain the Kruskal's Algorithm to find the minimum cost spanning tree with its steps. 7) Write the properties of red-black tree. Explain the insertion and deletion operation of red-black tree in detail. (8) 45262/150/KD/708 2 5. 6. (a) (b) (a) (b) (a) (b) Explain Dijkstra's algorithm for single source shortest path. Find shortest path from vertex A to each other vertex using Dijkstra's algorithm. (8) Explain the following terms with example: class P, class NP, NP hard problem. Also draw the overlapping sets of P, NP, NP hard, and NP complete. (7) Explain Bitonic sorting network with example. 7) Explain Floyd-Warshail Algorithm to find all pair shortest path. Find all pair shortest path of following problem also analyze its complexity. (8) Explain breadth first search algorithm for graph traversal and write its pseudo code. Also analyze its time complexity. (8) Explain Quick sort algorithm with example. Also write pseudo code and analyze its complexity. {7) 45262/150/KD/708 3 [P.T.O. 8. (a) What is greedy algorithm? Explain travelling salesman problem using greedy approach. Write its basic steps. (8) (b) Solve following recurrence relation using substitution method. (7) 1 ifn=1 To) = ar{ 2} +e ifn>1, 45262/150/KD/708 4 Roll No. Total Pages : 2 BT-5/D-22 45263 COMPUTER NETWORK Paper-ES-CS-AIDS-305A Time : Three Hours] [Maximum Marks : 75 Note : Attempt any five questions. 1. Answer each part in brief. Each of it is of 3 marks. (a) (b) (©) @ () 2 @ ) 3. (a) (b) What is ALOHA? Compare different ALOHA protocols. Explain the meaning of P/F field in HDLC control field. Discuss the MAC sublayer Design issues. Write the HTTP Response message formats. What is Medium Access Control Sublayer? (3x5) Explain IEEE 802.11 architecture and addressing mechanism in detail. (8) What is CSMA? Explain CSMA with Collision Detection. (7) Describe the functional differences between statistical and synchronous time division multiplexing. (7) Show the generation of codeword at the sender site and check the same at the receiver site using CRC where data word is 1010011010 and the deviser is 10111, (8) 45263/150/KD/847 498 [P.T.O. 8. (a) (b) (a) (b) {a) (b) @ ) (@) (b) Differentiate static, dynamic and active documents used in World Wide Web. (7) What is public key encryption algorithm? Explain RSA cryptosystem with encryption and decryption in details. @) List the similarities and dissimilarities between OSI & TCPAP reference models. 1) Explain Leaky bucket algorithm and token bucket algorithm for congestion control. Also write its steps. (8) What is the relevance of sliding window protocol in the improvement of link utilization? Explain sliding window protocol in detail. (8) What is the difference between symmetric key and asymunetric key cryptography? Explain it with example. Mm What are responsibilities of data link layer? Explain each of the reasonability of data link layer in details with is associated mechanism. (8) What is the working mechanism of ISDN? Explain the conceptual difference between narrowband ISDN and broadband ISDN. @) What is HTTP? Explain Non-persistent and Persistent connections of HTTP. M What is IPv6 addressing? Explain the concept behind unicast and multicast protocol with example. (8) 45263/150/KD/847 2 Roll No. Total Pages :.2 BT-5/D-22 45264 MACHINE LERNING WITH USING PYTHON Paper-PC-CS-AIDS-307-A Time : Three Hours} (Maximum Marks : 75 Note : Attempt five questions in all, selecting atleast one question from each unit. All questions carry equal marks. UNIT-I (a) What is the list data structure in Python? What are its characteristic features? Write the code in Python to access the list elements using for loop. (b) What is function? How is it defined in Python? How is the default value passed as parameter to a function in Python? Hlustrate. (a) What do you understand by dictionary? Explain the following methods with an example : @ pop(), Gi) update}, Gii) clear(), (iv) get(). (6) What is a class? How is it defined in Python? Discuss the use of _.init_() method using suitable example. UNIT-IE (a) What is the difference between supervised and unsupervised learning? Discuss. (bo) Write a note on significance of numPy in deep learing. 45264/150/KD/993 woe PTO. 4. (a) (b) 5. (a) (b) 6. (a) (b) How are the data files read using pandas? Also illustrate the procedure of feature extraction. . Write a detailed note on applications of Machine Learning. UNIT- What is logistic regression? What is the use of it in learning? Discuss its implementation in Python. What do you understand by decision tree? Write a code in Python illustrating the use of decision tree. What is the K means clustering algorithm? How is the elbow method used to decide the value of K? Explain. What is a recommender system? Explain the methodology of collaborative filtering in recommender system. UNIT -IV 7. What is IBM systemML? What are its characteristic features? Discuss. 8. What is Apache Spark? Discuss the use of Scala in machine learning in Spark. 45264/150/KD/993 2 Roll NO. ssesessseseseasicons Total Pages : 2 BT-5/D-22 45265 COMPUTER ARCHITECTURE Paper — ES-CS-AIDS-309-A Time : Three Hours} [Maximum Marks : 75 Note : Attempt any five questions selecting at least one question from each unit. UNIT-I 1. Explain memory hierarchy in detail with a neat and clean diagram. (15) 2. Explain : {a) Principal of locality of reference in detail. (b) Perform addition and substraction using BOOTH's algorithm. (c) Explain Von Neumann architecture. (15) UNIT-II 3. Explain: {a) Addressing modes in detail with examples. {b) How address mapping works in associative memory? (1045=15) 4. Explain: (a) Memory read, memory write and opcode fetch using timing diagrams. 45265/150/KD/1087 a® pro. 5. 6. (b) Explain instruction cycle and also write difference between hardwired and micro programmed control unit. (8+7=15) UNITAD Explain : (a) Explain Zero, One, Two and Three address instructions with a suitable example. (b) Write a detailed note on array processors, (10+5=15) Write detailed notes on : (a) Differences between RISC and CISC instruction set. (b) Vector processors and also highlight key points of pipeline processing. (7+8=15) UNIT-1V Explain in detail ; (a) Interrupt and its types. (b) Programmed IO and interrupt driven 10. (5+10=15) Write notes on (any four) : (a) Daisy chaining. (b) DMA and its controller. (c) Serial Communication. (d) Handshaking. (e) Types of buses in the system. : (15) 45265/150/KD/1087 2 Roll NO. ceereseeeeeeseseeee Total Pages : 2 BT-5/D-22 45266 ARTIFICIAL NEURAL NETWORKS Paper-PC-CS-AIDS-S-31L1A Time : Three Hours] [Maximum Marks : 75 Note : Attempt five questions in all, selecting atleast one question from each unit. All questions carry equal marks. UNIT-I 1. (a) What do you mean by biological neurons? What are the issues on which biological networks proves to be superior than AJ networks? (7) (b) What is the role of activation function in neural networks? List down the names of some popular Activation Functions used in Neural Networks. (8) 2. Explain various Optimization Algorithms for Training Neural Network with its advantages and disadvantages. (5) “UNIT-II 3. (a) How the feedforward neural network works ? (7) (b) Explain the backpropagation algorithm. How it train the ANN? (8) 45266/150/KD/1102 [P.T.O. (a) What is RBFN? What are its advantages over MLP with error backpropagation learning? (8) {b) Explain approximation properties of RBNF. (7) UNIT-IN What is pattern association in associative memory network? Explain Hebb and Delta rule with its implementation. (15) (a) Write retrieve algorithm for recurrent associative memory. (7) (b) Discuss the architecture of Bi-directional associative memory in detail. {8) UNIT-IV Explain Perceptron neural network algorithm with its implementation in Python. (15) Write short notes on : {a) Adaline Network. (b) Recall Neural Network. (c) BPN. (15) 45266/150/KD/1102 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy