## Solution of Assignment Synopsis & Project Dissertation Report

Without time Running Time running is not applicable for old student.

 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) 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

## Questions:-

Data Structure Through C Language

Section – A

Question Section

Marks - 10

; ; ; ; ; ; ; ;

 Sr. No Question 1 Give the difference between Recursion and Iteration. Write the codes to display the reversing the string. 2 Convert the following infix notation to postfix notation (A + B)  * C /D 3 What is a Stack ? Write C function to push item into the stack. 4 Define array? Write a program to store 10 salesmen’s amount in an array and find out total sale & best sales amount. 5 What do you mean by Time and Space complexity and how to represent these complexity? 6 Write pseudo code to add node at the end in circular linked list. 7 Write algorithm to perform inorder traversal of binary tree. 8 Trace quick sort on the list L= {11, 34, 67, 78, 78, 78, 99}. What are your observations?

Section –B

Draw the binary search tree whose elements are inserted in the following order:
50 72 96 94 107 26 12 11 9 2 10 25 51 16 17 95

Q.No 1: What is the height of the tree?

File Name :

Q.No 2: Which levels have the maximum number of nodes that they could contain?

File Name :

Q.No 3: What is the maximum height of a binary search tree containing these nodes?  Draw such tree.

File Name : .

Section-C

Question

 1)      Which of the following statements about binary trees is NOT true? (A): Every binary tree has at least one node. (B): Every non-empty tree has exactly one root node. (C): Every node has at most two children. (D): Every non-root node has exactly one parent.

2)      What is the expected time required to search for a value in a binary search tree containing n nodes?

(A): O(1)

(B): O(log n)

(C): O(n)

(D): O(n log n)

3)      Which among the following is odd one out?

(A): printf

(B): fprintf

(C): putchar

(D): scanf

 4)      To represent hierarchical relationship between elements, Which data structure is suitable? (A): Dequeue (B): Priority (C): Tree (D): Graph

What is the infix version of the following postfix expression? x 12 + z 17 y + 42 * / +

(A): (x + 12 + z) / (17 + y * 42)

(B): x + 12 + z / 17 + y * 42

(C): x + 12 + z / (17 + y) * 42

(D): x + 12 + z / ((17 + y) * 42)

6)      Which of the following data structure is non linear type?

(A): Strings

(B): Lists

(C): Stacks

(D): Graph

7) the data structure which allows deletions at both ends of the list but insertion at only one end.

(A): Input restricted dequeue

(B): Output restricted qequeue

(C): Priority queues

(D): Stack

8)Header node is used as sentinel in .....

(A): Graphs

(B): Stacks

(C): Binary Tree

(D): Queues

9)      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.

(C): Both of them

(D): None of them

 10)………… is very useful in situation when data have to stored and then retrieved in reverse order. (A): Stack (B): Queue (C): list (D): linked list 11)  Stack is also called as (A): Last in first out (B): First in last out (C): Last in last out (D): First in first out
 12) An array is a collection of (A): Different data types scattered throughout memory (B): The same data type scattered throughout memory (C): The same data type placed next to each other in memory (D): Different data typed placed next to each other in memory

## 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