# PRODUCT DETAILS

Online-Typing-and-Filling

 Title Name Amity Solved Assignment BSC IT for Data Structure through C Language University AMITY Service Type Assignment Course B.Sc-(IT) Semester Semester-III Course: B.Sc-(IT) Session 2016-2017 Short Name or Subject Code Data Structure through C Language Commerce line item Type Semester-III Course: B.Sc-(IT) Product Assignment of B.Sc-(IT) Semester-III (AMITY) Price PRICE INR Click to View Price

# Solved Assignment

Questions :-

Data and File Structure

Assignment A

1.A two-dimensional array defined as a [4…7, -1 …….3] requires 2 bytes of storage space for each element. If the array is stored in row-major form, then calculate the address of element at location a[6,2]. Give the base address is 100.

2.Write a C program to implement bubble sort.

3.Write a program in C to show PUSH and POP operations in a stack.

4.Write the algorithms for the insertion and deletion operations performed on the circular queue.

6.What is a binary search tree? Construct a binary search tree from these numbers – 50, 30, 60, 22, 38, 55, 34.

7.Explain the Dijkastra’s Algorithm.

8.What do you mean by the Hashing? Explain different method of hashing.

Assignment B

1.If you are using C language to implement the heterogeneous linked list, what pointer type will you use?

2. What is the binary tree? What are threaded and properties of binary trees?

3. What is directed graph? Explain the various types of graph and traversal of directed graph.

ASSIGNMENT C-
1. The memory address of the first element of an array is called
Options

2. Memory address of fifth element of an array can be calculated by the formula
Options
A. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
B. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
C. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
D. None of above
E. a. LOC (Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

3. Which of the following data structures are indexed structures?
Options
A. linear arrays
C. both of above
D. none of above

4. Which of the following is not the required condition for binary search algorithm?
Options
A. The list must be sorted
B. There should be the direct access to the middle element in any sublist
C. There must be mechanism to delete and/or insert elements in list
D. none of above

5. Which of the following is not a limitation of binary search algorithm?
Options
A. Must use a sorted array
B. requirement of sorted array is expensive when a lot of insertion and deletions are
C. There must be a mechanism to access middle element directly
D. Binary search algorithm is not efficient when the data elements are more than

6. Two dimensional arrays are also called
Options
A. Tables arrays
B. Matrix Arrays
C. both of above
D. none of above

7. A variable P is called pointer if
Options
A. P contains the address of an element in DATA.
B. P points to the address of first element in DATA
C. P can store only memory addresses
D. P contain the DATA and the address of DATA

8. Which of the following data structure can´t store the non-homogeneous data elements?
Options
A. Arrays
B. Records
C. Pointers
D. None

9. Which of the following data structure store the homogeneous data elements?
Options
A. Arrays
B. Records
C. Pointers
D. None

10. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
Options
A. Elementary items
B. Atoms
C. Scalars
D. All of above

11. The difference between linear array and a record is
Options
A. An array is suitable for homogeneous data but the data items in a record may have
B. In a record, there may not be a natural ordering in opposed to linear array.
C. A record form a hierarchical structure but a lienear array does not
D. All of above

12. Which of the following statement is false?
Options
A. Arrays are dense lists and static data structure
B. data elements in linked list need not be stored in adjecent space in memory
C. pointers store the next data element of a list
D. linked lists are collection of the nodes that contain information part and next pointer

13. Binary search algorithm can not be applied to
Options
B. Sorted binary trees
C. Sorted linear array
D. Pointer array

14. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
Options
A. Underflow
B. Overflow
C. Houseful
D. Saturated

15. The situation when in a linked list START=NULL is
Options
A. Underflow
B. Overflow
C. Housefull
D. Saturated

16. Which of the following is two way lists?
Options
D. none of above

17. Which of the following name does not relate to stacks?
Options
A. FIFO lists
B. LIFO list
C. Piles
D. Push-down lists

18. The term "push" and "pop" is related to the
Options
A. Array
B. Lists
C. Stacks
D. All Of Above

19. A data structure where elements can be added or removed at either end but not in the middle
Options
B. Stacks
C. Queues
D. Deque

20. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
Options
A. FAEKCDBHG
B. FAEKCDHGB
C. EAFKHDCBG
D. FEAKDCHBG

21. Value of the first linked list index is________
Options
A. One
B. Zero
C. –1
D. None of these

22. A linked list index is ____ that represents the position of a node in a linked list
Options
A. An Integer
B.  A variable
C.  A character
D.  A Boolean

23. Why is the constructor of the Queue Linked List class empty?
Options
A. Because initialization of data members of the Linked List class is performed by the constructor of the Linked List class.
B. Because initialization of data members of the Linked List class is performed by the destructor of the Linked List class.
C. Because initialization of data members of the Queue Linked List class is performed by the constructor of the Linked List class.
D. Because initialization of data members of the Queue Linked List class is performed by the destructor of the Linked List class

24. _______ form of access is used to add and remove nodes from a queue
Options
A. LIFO Last In First Out
B. FIFO, First In First Out
C. Both 1 and 2
D. None of these

25. ______ form of access is used to add and remove nodes from a stack
Options
A. LIFO
B. FIFO
C. Both 1 and 2
D. None of these

26. New nodes are added to the _____ of the queue.
Options
A. Front
B. Back
C. Middle
D.  Both 1 and 2

27. A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Options
C. Both of them
D.  Neither of them

28. In an array queue, data is stored in an _____ element
Options
A. Node
C. Array
D. Constructor

29. The pop () member function determines if the stack is empty by calling the _____ member function
Options
A. removeback()
B. isEmpty()
C. removedfront()
D. hasNext()

30. What happens when you push a new node onto a stack?
Options
A. The new node is placed at the front of the linked list
B. The new node is placed at the back of the linked list.
C. The new node is placed at the middle of the linked list.
D. No Changes happens

31. Which of the following algorithm solves the all – pair shortest path problem?
Options
A. Dijkstra,s algorithm
B. Floyd’s algorithm
C. Prim’s algorithm
D.  Warshall’s algorithm

32. The operation of processing each element in the list is known as
Options
A. Sorting
B. Merging
C. Inserting
D. Traversal

33. To delete a dynamically allocated array named `a`, the correct statement is
Options
A. delete a;
B. delete a[0];
C. delete []a;
D. delete [0]a;

34. The memory address of the first element of an array is called
Options

35. Which of the following data structure store the homogeneous data elements?
Options
A. Arrays
B. Records
C. Pointers
D. None

36. The number of possible binary trees with 4 nodes is
Options
A. 12
B. 13
C. 14
D. 15

37. Which of the following data structure is not linear data structure?
Options
A. Arrays
C. Both of above
D. None of above

38. Finding the location of the element with a given value is:
Options
A. Traversal
B. Search
C. Sort
D. None of above

39. Preorder is same as
Options
A. depth-first order
C. topological order
D. linear order

40. Which of the following is the feature of stack?
Options
A. All operations are at one end
B. It cannot reuse its memory
C. All elements are of different data types
D. Any element can be accessed from it directly

Only after macking the payment you would be able to see the answer...!!!

## 4.8 / 5

#### Rating breakdown

5
80% Complete (danger)
1
4
80% Complete (danger)
1
3
80% Complete (danger)
0
2
80% Complete (danger)
0
1
80% Complete (danger)
0

January 29, 2015