Scribd
Upload
37 views2 pages

Reg No

This document contains an exam for a Data Structures and Algorithms course, including: - A 20 question multiple choice section testing concepts like complexity analysis, logical operators, and evaluating expressions. - Instructions for a longer form question section worth 30 marks, asking students to answer 3 out of 5 questions. The questions cover topics like sorting algorithms, graph search techniques, minimum spanning trees, and combinatorial problems.

Uploaded by

shivanya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views2 pages

Reg No

This document contains an exam for a Data Structures and Algorithms course, including: - A 20 question multiple choice section testing concepts like complexity analysis, logical operators, and evaluating expressions. - Instructions for a longer form question section worth 30 marks, asking students to answer 3 out of 5 questions. The questions cover topics like sorting algorithms, graph search techniques, minimum spanning trees, and combinatorial problems.

Uploaded by

shivanya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SRINIVASA INSTITUTE OF TECHNOLOGY AND SCIENCE, KADAPA

IIIB.Tech II SEM - I MID Examination MARCH-2019


Branch: CSE Date: __2/19

1.
Sub: DAA Reg.No:

Time: 20min. Max.Marks:10 Sign of Invigilator


Choose the correct answer
1. There are__________ steps to solve the problem ( )
a) Six b) four c) seven d) Two
2. ____________ is the first step is solving the problem ( )
a) understanding the problem b) Identify the problem
c) Evaluate the solution d) None of these
3. __________ Solution requires reasoning built on knowledge and experience ( )
a) Algorithmic solution b) Random solution c) Heuristic solution d) none of these
4. The branch of computer that deals with heuristic types of problem is called______ ( )
a)System software b) real time software c) Artificial intelligence d)none
5. Artificial intelligence makes use of following prominently ( )
a) knowledge base b) Data warehouse c)Database d) None
6. The true and false values represent__________________ ( )
a) Logical data b) Numeric data c) Character data d) Alphanumeric data
7. following are called logical operators ( )
a) +,-,*,/ b) <,>,<=,>= c) AND,OR,NOT d) \,MOD
8. Evaluate 5*(x+y)-4y/(z+6) where x=2, y=3 and z=6 ( )
a) 1 b) 24 C) 5 d) 10
9. Evaluate a-2>b where a=6 ,b=8 ( )
a) False b) True c) 6 d) 7
10. The Worst – case time complexity of Quick sort ( )
a) 0(n2) b) 0(log n) c) 0(n) d) 0(n logn)
11. Which of the following sorting procedure is the slowest ? ( )
a) Quick sort b) Heap sort c) Shell sort d)Bubble sort
12. The Worst – case time complexity of Quick sort ________________
13. Two main measures for the efficiency of an algorithm are _________________
14. The correctness and appropriateness of ____________ solution can be checked very easily.
15. Artificial intelligence makes use of the following prominently____________________
16. _ _____ is the first step is solving the problem
17. The worst-case time complexity of merge sort is ________________ ( )
a) 0(n2) b) 0(log n) c) 0(n) d) 0(n logn)
18. The worst-case time complexity of Exchange selection sort is __________ ( )
a) 0(n2) b) 0(log n) c) 0(n) d) 0(n logn)
19. The worst-case time complexity of Bubble sort is _________________ ( )
a) 0(n2) b) 0(log n) c) 0(n) d) 0(n logn)
20. Evaluate for the equation e=5*a\d*(b+1) where a=5 , b=4 , c=3 , d=12 ( )
a) 10 b) 24 c) 0 d) 14

SRINIVASA INSTITUTE OF TECHNOLOGY AND SCIENCE, KADAPA


III B.Tech I SEM – II MID Examination MARCH-2019
Branch: CSE ESub: DAA
Time: 90min. Date:__/2/19 Max.Marks:30
Note: Answer any three of the following questions
1. (a) Finding the maximum and minimum?
(b) Stressen’s matrix multiplication?
2. Explain Quick sort?
3. Explain BFS AND DFS?
4. (a) Minimum cost of spanning tree?
(b) Explain prims algorithm and Kruskals algorithm?
5. (a) Explain sum of sub set problem?
(b) Explain 8 Queen problem?

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