Subjects
Applied Mathematics for Electrical Engineering - 3130908
Complex Variables and Partial Differential Equations - 3130005
Engineering Graphics and Design - 3110013
Basic Electronics - 3110016
Mathematics-II - 3110015
Basic Civil Engineering - 3110004
Physics Group - II - 3110018
Basic Electrical Engineering - 3110005
Basic Mechanical Engineering - 3110006
Programming for Problem Solving - 3110003
Physics Group - I - 3110011
Mathematics-I - 3110014
English - 3110002
Environmental Science - 3110007
Software Engineering - 2160701
Data Structure - 2130702
Database Management Systems - 2130703
Operating System - 2140702
Advanced Java - 2160707
Compiler Design - 2170701
Data Mining And Business Intelligence - 2170715
Information And Network Security - 2170709
Mobile Computing And Wireless Communication - 2170710
Theory Of Computation - 2160704
Semester
Semester - 1
Semester - 2
Semester - 3
Semester - 4
Semester - 5
Semester - 6
Semester - 7
Semester - 8
Data Structure
(2130702)
DS-2130702
Summer-2017
Question-1-13
BE | Semester-
3
Summer-2017
|
05/31/2017
Q1) (13)
1 Marks
Consider a situation where swap operation is very costly. Which of the sorting algorithms should be preferred so that the number of swap operations are minimized in general?
Selection sort makes O(n) swaps which is minimum among all sorting algorithms
Questions
Go to Question Paper
Q1
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
Q2
(a)
(b)
(c)
(c)
(OR)
Q3
(a)
(b)
(c)
Q3
(a)
(OR)
(b)
(OR)
(c)
(OR)
Q4
(a)
(b)
(c)
Q4
(a)
(OR)
(b)
(OR)
(c)
(OR)
Q5
(a)
(b)
(c)
Q5
(a)
(OR)
(b)
(OR)
(c)
(OR)
