Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
58 views
Daa, Computer Networking, C++
na
Uploaded by
nikhil rai
AI-enhanced title
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
Download now
Download
Save Daa, computer networking,c++ (2) For Later
Download
Save
Save Daa, computer networking,c++ (2) For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
58 views
Daa, Computer Networking, C++
na
Uploaded by
nikhil rai
AI-enhanced title
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
Download now
Download
Save Daa, computer networking,c++ (2) For Later
Carousel Previous
Carousel Next
Save
Save Daa, computer networking,c++ (2) For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 25
Search
Fullscreen
B.TECH TT ODD SEM-VATS01 R18 2022 GURU NANAK INSTITUTE OF TECHNOLOGY An Autonomous Institute under MAKAUT 2022 DESIGN AND ANALYSIS OF ALGORITHMS IT501 HIME ALLOTTED: 3Hours FULL MARKS:70 Z, ST] Ss The figures in the margin indicate full marks. fates are reqiticed 10 give their answers in their own words as far as practicable GROLP-A (Multiple Choice Type Questions) Answer any ten from the following, choosing the correct alternative of each question: Hee pee jars 0 aX @ Which one of the following is the recurrence equation for the worst ease 1 cos \ time complexity of the Quicksort algorithm for shorting n(n=2) numbers? In the recurrence equationsgiven in the option below, ¢ is a constant a) T(n)= 2T(n-1) sen b) T(n)= 9T(n 3) + en2 €) Ten)=T(n-1+T()-en 4) T(n)= Ten) + en Consider the given graph. Cox o_ 0 1 eee . What is the weight of the minimum spanning tree using the Prim's algorithm, starting from vertex a? queens so that no two queens attack each other is called 1 co2 \"s problem 1's problem n circuit problem problem two matrices with its dimension given as follows: | cot Page 1014” wi tv) (siti) ax) tx) ai (xii) The running time of Bea SCS a) Qyplogn) by On) 3) Om) d) doth bande Je source shortest path oy a graph having negative edge can be solved by— Single so rs 2) Bellman-Ford algor b) Dijkstra’s algorithm: ¢) Floyd Warshat! algorthn @) both (a) and (b) Which of the following is not a characteristic of goodalgorithm? a) Precise : b) finite number of steps c) Ambiguous ) logical flow of control Which among the following is the best when the list isalready sorted— a) Selection sort b) Merge sort ¢) Bubble sort ¢) Insertion sort Feasible solution in fractional knapsack problem withknapsack size M, refers to a solution that is- a) Maximum profit with weight less than M b) Maximum profit only ©) Maximum profits with weight less than equal to M d) All of these Vertex cover problem belongs to? 4) Approximation Approach b) Greedy approach ©) Backtracking Method 4) Dynamic Approach mina lling methods Can be used to solve the matrix chain a) Dynamic Programming b) Brute force ©) Recursion 4) Dynamic Programming, Brute force, Recursion We use dynamic Programming ay » ms need an optimal ohio nee ) the solution has optimal Subst c) It's faster than Greedy pee 4) The given problem can be reduced to 3-SATproblem leB.TECH/IT/ODDISEM-V/ITS01/R 18/2022 GROUP -B (Short Answer Type Questions) Answer any three from the following: 3x5=15 Marks = CONo (@) Discuss difference between Branch and Bound Technique and Backtracking 3 CO? Technique. (0) Define Big-O notation with suitable example 2h he COD 3 Find recurrence relation for binary search algorithm Findrecurrence relation for 5 COS binary search algorithm 4, (a) Apply Master Method and find the time complexity for the following recurrence 3 CO3 relation: 3T(1/4) + cn? (b) _Draw the recursive tree and find the time complexity for the following recurrence = 2 CO3 relation: 2T(n/2)+ cn _ Explainthe solution to the graph coloring problem usingbacktracking $ co3 dee lexity (best and worst case) of Quick sort 5 col GROUP -C (Long Answer Type Questions) ‘Answer any three from the following: 3*1S=48 Marks CO No. 8 COs plication using dynamic programming 0x1, C1x10, D10x 20, £20*100 gorithm for N-Queen problem using back trackingand draw the state 7 cos for 4-queens problem e followi Pe fe] 4 5 20__[30 40 50 30_ [66 40 60 (capacity 100), then find out the maximum profit that fractional knapsack problem. (Show the necessary steps solving all pair shortest path problem in a directed graph 7 cod formulation . Explain the technique with algorithm 9 cod Page 3 of +Wy Cees S * Www B.TECH/AT/ODD/SEM-V/ITS04A/R18/2022 GURU NANAK INSTITUTE OF TECHNOLOGY An Autonomous Institute under MAKAUT 2022 PROGRAMMING PRACTICE WITH C++ IT504A, IME ALLOTTED: 3Hours FULL MARI The figures in the margin indicate full marks. Candidates are required to give their answers in their own words as far ax practicable GROUP-A (Multiple Choice Type Questions) ‘Answer any fen from the following, choosing the correct alternative of each question: 1ox1=10 Marks CO No i) Reusability of the code can be achieved in CPP through | col a) Polymorphism ae b) Encapsulation ¢) Inheritance d) Bothaandc ii) In which type do the enumerators are stored by the compiler? 1 co4 a) string b) integer c) float 4) none of the mentioned ine functions may not work 1 col If function contain static variables. if function contain global and register variables. tf funetion returning value consists looping construct(.. for. while). Ifinline functions are recursive If function contains const value. a) Only 14.5 b) Only 2.3 ©) Only 1,34 d) Allofthese ‘many types of polymorphism are there? \ co3 a) | ce modifier is used to define the reference variable? 1 co2 Page 1 of 4vi) What is th vii) viii) ix) x) xi i 2 output of the following program? e Hinclude
Bees using namespace std; int x = 1; int maing)B.TECH /T/ODD/SEM-V/ITS04A/R18/2022 int x= 2; mx << endl; return 0; } a) 1 b) 2 °) 3 d) 123 xii) A Constructor that does not have any parameters is called = 1 col Constructor. a) Custom b) Dynamic ¢) Static 4) Default GROUP -B (Short Answer Type Questions) (Answer any three of the following) 3xS=15 Marks CO No nce between public, private. and protective data 3 coz ‘program to illustrate reference variables? 2 coz lention the basic properties of OOP $ co2 Acept of destructor with proper example 3 co2 {ferences between return by value and return by reference. 4 CO3 e ambiguity problem arise? 1 co3 structor with example. 5 col GROUP-C ong Answer Type Questions) rany three of the following) 3x 18=45 Marks CO No lass for pre and post-increment? 3 co3 umbers(both real and ime inary parts) using 5 cos 5 cosGURU NANA ITUTE OF TECHNOLOGY An Autonomous Institute under MAKAUT 2022 INDUSTRIAL & FINANCIAL MANAGEMENT H TIME ALLOTTED: 3HR Le FULL MARKS:70 The figures in the margin indicate full marks. Candidates are required to give theit answers in their own words as far as practicable GROUP-A (Multiple Choice Type Questions) ‘Answer any fen from the following, choosing the correct alternative of each question: 10*1=10 : Marks CO No. Which of these methods DOES NOT follow Time Value of Money 1 cos principle? a) NPV b) ARR e) IRR 4) Pl Break-Even Point Revenue > Cost Revenue < Cost Revenue = Cost 1) No relation between revenue & cost 1.) 1 co2 lation makes 1 cos Future rupees less valuable than present rupees Future rupees more valuable than present rupees Future rupees equal to present rupees None of these ‘hich of these is NOT a major function of financial management? 1 CO3 ) Investment decisions y) Dividend decisions Financial decisions ‘Manpower decisions 1 col, co4 1 co2(ii) (viii) (ix) to) (xi) (ii) Budge isthe most important tol of a) Cost Planning b) Production Planning ©) Sales Planning d) Allof these ‘A large Margin of Safety means a) Over production b) Under production €) A favourable condition for the business 4) Under capitalization ATIRR, NPV ts a) Zero b) Positive ot d) Negative Working capital is a) CASCL b) CA-CL s) CACL BRAF > 4) CAXCL i s GST stands for aie a) Govt Sales Tax 5) Goods & Supply Tax ©) Goods & Services tax 4) General Sales Tax Which of the following is also known as Benefit Cost 8. ay NPV by ARR ©) Return on Investment 4) Pt GROUP -B (Short Answer Type Questions) (Answer any three of the following) ‘S15 M. Define financial management, State its objectives Reuschtine costs Rs 30,000 with an estimated life of $ yrs. Calculus NPV of the project, assuming a scrap value of Rs 1000 and a disc rate of 10%. The expested cash flow 4 are given below: Year | Annual Cashflow (Rs) D.Fa10% | 1 5000 i 0909 2 10,000 0826 | 3 10,000, 40.751} 3000 0683 $ and the discounting factors.B.TECH/T/ODD/SEM-V/HUS03/R18/2022 ‘A company eams a profit of Rs 40,000 in a year, ‘The variable cost & selling price of a product are Rs 10 & 12 per unit respectively. Caleulate the Margin of Safety 5, From the following information calculate the Sales required! fo eum 4 profit of Rs 1,20,000; Sales: Rs 6,00,000 FC: Rs 1,80,000, VC: Rs 3,75,000 6 “Contribution is a better indicator of profitability of a business than 5 Sales"—Do you agree? Justify your answer, GROUP -C (Long Answer Type Questions) (Answer any three ofthe following) 3x 15=45 Marks From the following information calculate : 1 {)Contrbution i) P/V Ratio ii) Break-Even Sales iv) Margin of Safety = Rs 40,000 ; Fixed Cost = Rs 12,000 ; Variable Cost = Rs calculate the revised values of these if: Fixed cost increases by 10% Variable Cost decreases by 10% Sales increases by 10% (Consider all changes are happening together) pact on profitability of a firm due to changes in costs and 5 swing information calculate the IRR for 13% and 14% 10 Net Cash Flow (Rs) 5000 8000 10,000 4000 8s 20,000. [pra | 0.877 0.770 0.675 0.592 flexible budget. ‘ cor CO4 C03 CONo co2 Page 3 of 410. a, = | GST Zero base budgeting . Operating Cycle » MoS ji ut of the 10 help in selection of profitable projects ABC Ltd needs your a details given below: ss eae los nual _| Cont (Rs ra : F $6,000 | 7 ‘enor i 4,000 90.000 u ; 150,000 30,000 a i is 14%, Advise the management ‘The company’s required rate of return is ation the oflibhe projects within a budget of Rs 6,00,000. | Annuity factor @14% | Write the major points of distinction between NPV & IRR. Prepare an estimate of working capital requirement from the following 10 information of a trading concem: ; poets Paes of pion cea Selling price Rs. 10 per unit foodaiwaly aon’ Wate me # Woes Averge ed Teter coningeign OT auiremens 12 Werks Allow State the major impontance of Working Capita 5 o Write shorts notes on any three of the following: eo co s Ti 5 co 4 5 me Value of Money principle 09 co: C08BTR CHATEVEN/SEM-VUTTOOL/R 8/2022 GURU NANAK INSTITUTE OF An Autonomous Institute 2022 DATABASE ) AGEMENT SYSTEM MEALLOTTED: 1 HOURS IToo1 The figures in the margi ~ ® in the margin indicate full marks. Cendidated Are reeuired ve give theiranse nan te far as practicable TECHNOLOGY under MAKAUT. FULL MARKS: 70 ina GROUP A tiple Cholee type Questions) Angwer any den from the ene eee Following, choosing the gorrect altemative of each question: 10%1=10 Marks CO No Ogram is abnormally terminated, the equivalent ofa___ command 1 col form is dependent on co? Dependency FD if elements of the domain are considered to be indivisible 1 col is also called as , ; re bes what type of data is available in a \ coch is responsible for assigning cey Value and pointers to one or more value.B.TECH/TT/EVEN/SEM-VU/1T601/R 18/2022 GROUP -B (Short Answer 1; bs ‘ype Questions) Answer any three trom the following: 3*S=15 ® pee various indexes based on ordering of the key Fie (by ixplain the roles and responsibilities of DBA. (a) _ Consider the following “Sailor” and “Reserve" relation Reserve (sid, bid, day) Sailor (sid, sname, rating, age) Formulate relational algebra Query: ie Find names of sailors who have reserved boat #xxx i> Find names and ages of sailors who have reserved a boat (b) What is Blocking factor? What is block anchor? protocol with proper and shrinking phase of two phase locking id problem with example Summary problem and Lost update problem GRrour-C (Long Answer Type Questions) Answer any three from the following: 3*15=45 tyiprecedence) graphs for SI & state whether the or not. If the schedule is serializable then write down ‘how recovery in a database system can be done ing techniques are used- Marks Marks 5 CON cos co3 cor cos co2 cos COs Coa C03 CO No. co4 co3 co3 cos co2zés japeper ctl) and the set of functional ider the relation 3 Jow: a sopendenis are ane f,FOGH. DAU! DB, Ba as F= {ABOC, © ecompose R into 3NF- . 1 the Following ab olor) a Vehicle(reg_No, makes be Person(end. name,address Owner( eno, reg M0) 4 s! lowing qui ae name, feg_no FROM Person,Owner WHERE Person.eno-Ownereno and Person.name= RIA’ Draw the Query Wee. Optimize the query and draw the optimized query tree. You are give Draw ER diagram with cardinality: bill may send to a customer. A customer may receive many bills ii, A clerk works ina bank. A bank has many clerks. iii, Students appear for seats in a college. Each student can get one seat iv. Accollege has many seats in different departments. A student can apply in more than one department Consider the following: (b) i, © a Tr Tl [Tz Lo Read(x) | Write(x) | T | Write) i | Readix) T Renda Read(y) Ready) | 7 fi Write(x) | Writes | et | | commit: commit; | abort; | ey He | Commit; Schedule2 Schedule 1 | _;-———____] 4) SI Recoverable ,$2 »S2 Non- 5) SI Non-Recoverable $9 pie mee ©) Both are Recoverable a. 4) Both are Non- Recoverablelain the Di : . ean eadlock Prevention Technique with proper example. What is Consider the relation schema EMP-DEPT{ ENO, ENAME, DOB, ADDRESS. DNO, DNAME, DMGRNO}. With the following set G of functional dependencies on EMP-DEPT: G={ENO> {ENAME,DOB,ADDRESS, DN a ¥ “$S,DNO},DNO- >{DNAME,DMGRNO} }. Calculate the ciosure {ENO} + Sis conflict serializable or not ‘on any three of the following: B.TECH/IT/EVEN/SEM-VI/IT601/R18/2022 C03 co2 Cco3 co4 col co2 co2 co3B.TECH/IT/EVEN/SEM-VI/11603/R18/2022 GURU NANAK IN STITUTE OF TECHNOLOGY An Autonomous Institute under MAKAUT 2022 COMPUTER NETWORKING 11603 TIME ALLOTTED: 3HR The figures in the Candidates are required to give their FULL MARKS:70 ‘margin indicate full marks. ; answers in their own words as far as practicable A pe Questions) ya choosing the correct alternative of each question: 10%1= ae Marks CONo GROUP (Multiple Choice Answer any ten from the following, 1 C03 As f) When data and acknowledgement are sent on the same frame, this is . zi a hy Aeeiiecking 1 C02 1 C03 448 for hopping and control 1 co4 cO3¢ objectives/requirements ofB.TECH/T/EVEN/SEM-V 1/1 1603/R18/2022 b) What is the difference betw. id connec i ence betwee oriented protocols? © Between connection-less and connection- : 3 §, a) For seven devices in a network, wi mber of cable s an cable : ate work, what ig the number of eable links 2 ©. vy Whar aes mh bs igang? pe 6 Describe Two-Dimensional Parity Checkey 5 COs GRoUP-C (Long Answer Type Questions) (Answer any three of the following) 3x 15 = 45 Marks CO No Dataword: 100100, Divisor: 1101. What will be the codeword? How 8 col to check if there is some error or not? ‘What are the transmission impairments in data communication? 5 cos ‘Draw the line coding using Manchester encoding and AMI for a bit 2 co2 110011. 4, ifevery 6th packet that is being transmitted is lost and 5 co4 ber of packets to be sent is 10, then how many i$ will be required? a block of addresses starting with 190,100.0.0/16 10 col }). The ISP needs to distribute these addresses to of customers as follows. has 64 customers; each needs 256 addresses group has 128 customers; cach needs 128 addresses yp has 128 customers; each needs 64 addresses, ubblocks and find out how many addresses are still 5 col Repeat ARQ. M=1110100001 is transmitted but the 10 cos ‘sequence with any one bit corrupted. Use the corrupted bit position so that it can be i co2 8 col 3*5=15 5 co2 5 cO3 5 co4 5 co3 5 CO3NG HCH LY ANNE NINEND = O/T OALU720 TROT 2019 DATABASE MANAGEMENT SYSTEM Hro01 TIME ALLOPTED: Mir, FULL MARKE:70 The figures tn the margin indicate full marke Candidates ave eequired t0 give thele answers in their own wards ay fur as prmette able GROUP A (Multipte Choice Hype Questions) sanfoio 1. Answer any fe from the following, choosing the core! aliernative af e vel question a (i) The employee salary should not be greatoy thaw Ry. 50000, Tip 49 ! “ a) Integrity Constraint Feasibility Constraint erential Constraint \lOle & a (LIBRARY },) valued Dependency 4 fi) vial FD re these a felements of the domain are considered to be indivisible units b) Subatomic d) Subset Re JENF, then it is also in ©) 3 NE d) All of the mentioned can be viewed as Is. ¢) three levels: d) one level on is used if We are interested in only certain columns c) Union d) Join on operator in SQL? ET WEEN d) All of the aboveiid (ix) ) (i) (xii) consists of a search-key value and pointers 10 on o, . Ore At __———~= ir search-key Vale. Ne, swith that dec hash ¢) Index cluster 4) tnd a) Index entry ie “SX May ideres equate for normal relational data) ie js considered adequate latabase g Which or EN o)aNF d3Nr a) 2NF Which of the following is a procedure for acquiring the necessary locks fy, a transaction where all necessary locks are acquired before any are release? 4) Record controller b) Exclusive lock ¢) Authorization rule d) Two phase lock What are the after triggers? a) Triggers generated after a particular operation b) These triggers run after an insert, update or delete on a table % These triggers run after an insert, views, update or delete on a tab'e All of the mentioned, ee SS \ ¥ hn condition contalisan equality operator: ak " eee HAsO ¢) Natural d) Len GRoUP-B © Short Answer Ty i ‘YPe Questions (Answer any three of the follow FD Tight outer join y a Outer join with examples. 4 c 'S block anchor? baseg in Odes dering oF the key fieldGROLP-C (Long Answer Type Questions) (Answer any three of the following) 3x 18=45 e co No. 7a) Explain Insertion, deletion & modification anomalies of a database system. What $2 is full functional dependency? 5) Explain Dense index and Sparse index with proper example. Baer £) Define the importance of DBMS over normal file processing system 51 8a) Construct an E-R diagram for the follow ing problem: ¥ 2 A store has different counters managed by different employees. A counter has different items, but no two counters have common items. Customers buy from 0 But bills are prepared at bill counter only. Once in a month (persons managing counters is evaluated in terms of sales. Items [and slow-moving items are identified. B Why is foreign key needed? How does it play a role in the 4 3 of aggregation with a suitable example a 2 6 table: eg. no FROM Person.Owner WHERE Person.name= “RIA” optimized query tree. erializability checking is more powerful 5 4B.TECH IT/EVEN/SEM ~ 6/1T603/2018-2019 2019 COMPUTER NETWORKING 1T603 TIME ALLOTTED: 3 Hours FULL MARKS:70 The figures in the margin indicate full marks. Candidates are required 10 give their answers in their own words as far as practicable GROUP -A (Multiple Choice Type Questions) 3 swer any fen from the following, choosing the correct alternative of each questi jon; 10*1=10 CONo. 0 Transport layer Protocol is connectionless iv n IPV6 address 603.2 IT 603.2 IT 603.2 etn device using Mesh topology is IT (n-1)/2 603.3GROUP-B (Short Answer Type Questions) (Answer any three of the following) 3x5=15 2, Identify the similarit i CONS ._ Identify the similarities and difference between OSI and TCP/IP model. 3 Ir Differentiate between Internet and Intranet. 2 603.2 3. What is ephemeral and well-known port number, explain with example. 3 IT ‘What is super netting? Explain with example. 2 603.1 4, Explain with proper diagram, the working principle of Leaky Bucket 5 IT Algorithm 603.1 5, Explain the RIP routing procedure with an example 5 T 603.1 ries the four basic topologies and identify the advantage ofeach 5 a A 103 . GROUP-C (Long Answer Type Questions) (Answer any three of the following) 3x15=45 E CO No. JObit sequence 1010011110 and a divisor 1001 Find the CRC 2 IT he answer. " 603.3 details mechanism of ARP (with proper diagram) 5 ne ; 3.2 als Beet e working principle of CSMA/CA 603.1 Sy UDP and TCP yf ae ing principle of ‘Stop and Wait ARQ protocol 5 603.2 tine? How do the subnet mask and supernet Peevitier > sk, Explain with example. a 2 603.2 to a small organisation. One ofthe address 6 IT 603.3 Jast address in the block. Find the number ome 603.2 IT Fast Ethernet, and Gigabit Ethernet. 3 603.1 Multicasting, and Broadcasting. Ffstypoper es ample diagram, highlight the working Principle of , a. Explain W! Jephone network : , hen the following encoding scheme for the bi 10. t stream 011011001 NRZ NRZ-I Manchester Encoding Difference Manchester cn c. Difference between IPV4 and IPV6 " a 11. Write down the short notes on any three of the followings. ae SMTP DNS FTP TELNET BLUETOOTH
You might also like
Ay 2024-2025 III-i Daa Question Bank
PDF
No ratings yet
Ay 2024-2025 III-i Daa Question Bank
16 pages
ADA SolBank Final
PDF
No ratings yet
ADA SolBank Final
80 pages
III-II CSE DAA QUESTION BANK updated 2024 (2)
PDF
No ratings yet
III-II CSE DAA QUESTION BANK updated 2024 (2)
17 pages
CST306 ALGORITHM ANALYSIS AND DESIGN, MAY 2024
PDF
No ratings yet
CST306 ALGORITHM ANALYSIS AND DESIGN, MAY 2024
4 pages
DAA QB ALL Six Unit
PDF
No ratings yet
DAA QB ALL Six Unit
8 pages
DAA 6TH.pyq
PDF
No ratings yet
DAA 6TH.pyq
5 pages
Ada see
PDF
No ratings yet
Ada see
4 pages
2marks DAA
PDF
No ratings yet
2marks DAA
9 pages
Algorithm Design Analysis
PDF
No ratings yet
Algorithm Design Analysis
11 pages
ADA1
PDF
No ratings yet
ADA1
9 pages
DAA - QuestionBank - CSIT
PDF
No ratings yet
DAA - QuestionBank - CSIT
6 pages
Question papers & MCQ VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
PDF
No ratings yet
Question papers & MCQ VIGNAN INSTITUTE OF TECHNOLOGY AND SCIENCE
15 pages
Daa Obj-17
PDF
100% (1)
Daa Obj-17
20 pages
QP2
PDF
No ratings yet
QP2
44 pages
Question Bank 1to11
PDF
No ratings yet
Question Bank 1to11
19 pages
Mrcet R22 Ii - I QB
PDF
No ratings yet
Mrcet R22 Ii - I QB
38 pages
2020 Daa End-Autumn Solution
PDF
No ratings yet
2020 Daa End-Autumn Solution
22 pages
CT2 - D - Answer Key
PDF
No ratings yet
CT2 - D - Answer Key
5 pages
ADA Question Bank
PDF
No ratings yet
ADA Question Bank
8 pages
DAA Previous Paper
PDF
No ratings yet
DAA Previous Paper
14 pages
Rich Dad Poor Dad (PDFDrive)
PDF
No ratings yet
Rich Dad Poor Dad (PDFDrive)
9 pages
Daa It III Answer Key
PDF
No ratings yet
Daa It III Answer Key
11 pages
Ugc Papers
PDF
No ratings yet
Ugc Papers
171 pages
UnivQP Alg AK
PDF
No ratings yet
UnivQP Alg AK
3 pages
DAA Question
PDF
No ratings yet
DAA Question
32 pages
QP1
PDF
No ratings yet
QP1
29 pages
BT0080 - Fundamentals of Algorithms-MQP
PDF
No ratings yet
BT0080 - Fundamentals of Algorithms-MQP
19 pages
Pcc Cs 404 Cse Co Mapped21 22
PDF
No ratings yet
Pcc Cs 404 Cse Co Mapped21 22
8 pages
DAA Imp QP CIE2
PDF
No ratings yet
DAA Imp QP CIE2
14 pages
Unit Test 2 Daa
PDF
No ratings yet
Unit Test 2 Daa
2 pages
CS3CO13-IT3CO06 Design and Analysis of Algorithms
PDF
No ratings yet
CS3CO13-IT3CO06 Design and Analysis of Algorithms
4 pages
DAA_Question Bank
PDF
No ratings yet
DAA_Question Bank
7 pages
Design%20of%20Algorithm%20Sep%202020%20(2017%20Scheme)
PDF
No ratings yet
Design%20of%20Algorithm%20Sep%202020%20(2017%20Scheme)
4 pages
Daa Detention Work
PDF
No ratings yet
Daa Detention Work
7 pages
DaaS
PDF
No ratings yet
DaaS
5 pages
Department of Computer Science and Engineering
PDF
No ratings yet
Department of Computer Science and Engineering
10 pages
II DAA-K Module bank (1)
PDF
No ratings yet
II DAA-K Module bank (1)
4 pages
Daa All
PDF
No ratings yet
Daa All
24 pages
short ans DAA
PDF
No ratings yet
short ans DAA
4 pages
DAA SEM4
PDF
No ratings yet
DAA SEM4
4 pages
DAA FJ1_Set D Key
PDF
No ratings yet
DAA FJ1_Set D Key
11 pages
Daa QB
PDF
No ratings yet
Daa QB
16 pages
FIT2004 Past Year Paper
PDF
No ratings yet
FIT2004 Past Year Paper
19 pages
ADA Que
PDF
No ratings yet
ADA Que
104 pages
DAA Important Questions
PDF
No ratings yet
DAA Important Questions
7 pages
ADA PYQs List
PDF
No ratings yet
ADA PYQs List
8 pages
Design Analysis of Algo MCQS
PDF
100% (1)
Design Analysis of Algo MCQS
12 pages
HW2
PDF
No ratings yet
HW2
5 pages
Dynamic Programming
PDF
No ratings yet
Dynamic Programming
12 pages
CSE - CS402 - DESIGN AND ANALYSIS OF ALGORITHMS - R21 - Booklet
PDF
No ratings yet
CSE - CS402 - DESIGN AND ANALYSIS OF ALGORITHMS - R21 - Booklet
2 pages
Daa Bits
PDF
100% (1)
Daa Bits
44 pages
2-1-Ads r23 Mid-2 Question Bank 2024-25
PDF
No ratings yet
2-1-Ads r23 Mid-2 Question Bank 2024-25
4 pages
ECE 6th sem
PDF
No ratings yet
ECE 6th sem
12 pages
final
PDF
No ratings yet
final
6 pages
Midt1 13wi
PDF
No ratings yet
Midt1 13wi
5 pages
UNIT-1 2 Mark Questions
PDF
No ratings yet
UNIT-1 2 Mark Questions
11 pages