Computer Science
Study Material For BSc(CS) students.
Home
B.Sc.(CS)
»
F.Y.B.Sc(CS)
»
Problem Solving using Computer and ‘C’ Programming
S.Y.B.Sc(CS)
»
Data Structures and Algorithms I
»
Notes
Lab Assignments
Data Structures and Algorithms II
»
Notes
Lab Assignments
T.Y.B.Sc(CS)
»
Operating System I
»
Notes
Lab Assignments
Operating System II
»
Notes
Lab Assignments
M.Sc.(CA)
»
F.Y.M.Sc(CA)
»
Operating System
»
Notes
S.Y.M.ScCA)
»
Python Programming
»
Notes
Lab Assignments
Downloads
»
Syllabus
MCQs
Practice Tests
»
OS
DS-(I) Assignment 1: Searching Algorithms
Set A.
a) Create a random array of n integers. Accept a value x from user and use linear search algorithm to check whether the number is present in the array or not and output the position if the number is present.
b) Accept n values in array from user. Accept a value x from user and use sentinel linear search algorithm to check whether the number is present in the array or not and output the position if the number is present.
c) Accept n sorted values in array from user. Accept a value x from user and use binary search algorithm to check whether the number is present in sorted array or not and output the position if the number is present.
Set B.
a) Read the data from file 'cities.txt' containing names of cities and their STD codes. Accept a name of the city from user and use linear search algorithm to check whether the name is present in the file and output the STD code, otherwise output “city not in the list”.
b) Read the data from file 'cities.txt' containing names of cities and their STD codes. Accept a name of the city from user and use sentinel linear search algorithm to check whether the name is present in the file and output the STD code, otherwise output “city not in the list”.
c) Read the data from file ‘sortedcities.txt’ containing sorted names of cities and their STD codes. Accept a name of the city from user and use binary search algorithm to check whether the name is present in the file and output the STD code, otherwise output “city not in the list”.
0 Comments:
Post a Comment
Home
Subscribe to:
Posts (Atom)
Popular
Tags
Blog Archives
Followers
ABOUT
Rahul Sonawane
Nashik, Maharashtra, India
Qualification: M.Tech (IMCA), NET, SET
View my complete profile
Popular Posts
DS LAB (II) Assignment 1 Binary Search Tree and Traversals
Binary Search Tree and Traversals It is a binary tree with the property that the value in a node is greater than any value in a node's...
FCFS Disk Scheduling algorithm
//I) Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14, 124, 65, 67. The head is initially at cylinder...
Powered by
Blogger
.
Wikipedia
Search results
Blog Archive
March
(1)
January
(1)
January
(5)
June
(13)
April
(3)
March
(2)
February
(1)
November
(1)
October
(3)
0 Comments:
Post a Comment