In this post, we have listed the Assignment [1] AND Assignment[2], II B.Tech CSE (NR23 Regulation). These questions are prepared from college lecture notes and are useful for assignments, mid exams, and sem exams.
CLICK HERE FOR ASSIGNMENT 1 ANSWERS
CLICK HERE FOR ASSIGNMENT 2 ANSWERS
DS UNIT1,2,3 Objective Questions
Assignment 1
`1.What is Data structure ? Explain the representation of data structure.
2.Write the differences between linear and non linear data structures.
3.Define LIFO and the applications
4.How is an array different from a linked list?
5.Explain the representation of data structure?
6.Explain the various operations that can be performed on Different Data Structures.
7.Define Stack and where it can be used
8.Demonstrate the inserting the new node at beginning of singly linked
list and end of Linked List.
9.Demonstrate deleting the new node at end of the singly linked list.
10.Distinguish between queues and linked list.
CLICK HERE FOR ASSIGNMENT 1 ANSWERS
Assignment 2
1.Define Dictionaries? Explain about different representations of Dictionaries?
2.Define Hashing ? Define collision and discuss any two collision resolution techniques?
3.Discuss any 2 different hashing functions with an example.
4.Use quadratic probing to fill the Hash table of size 11. Data elements are 23,0,52,61,78,33,100,8,90,10,14.
5.Consider a hash table of size 10 and a simple hash function h(key) =key % 10.
Use linear probing to insert the following keys: 25, 35, 45,55, 65
6.Use Separate chaining to fill hash table of size 7 and the following keys to be
inserted: {42, 38, 52, 10}.The hash function used is H(key) = key % 7.
7.Use quadratic probing to fill the Hash table of size 11. Data elements
are 23,0,52,61,78,33,100,8,90,10,14.
8.Explain about linear probing and quadratic probing with example
9.Distinguish between double hashing, rehashing, and Extendible hashing.
10.Distinguish between double hashing and rehashing.
CLICK HERE FOR ASSIGNMENT 2 ANSWERS
BITS
0 Comments
Post a Comment