COURSE: B.TECH-ECE. IV Sem. Data structure Using C. b) Deletion of element in an array

Similar documents
Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

DATA STRUCTURES USING C

Data Structure [Question Bank]

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

PES Institute of Technology-BSC QUESTION BANK

10CS35: Data Structures Using C

2. (a) Explain the strassen s matrix multiplication. (b) Write deletion algorithm, of Binary search tree. [8+8]

CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) Total 92.

Questions 1 through 25 are worth 2 points each. Choose one best answer for each.

Converting a Number from Decimal to Binary

Java Software Structures

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

Exam study sheet for CS2711. List of topics

Sample Questions Csci 1112 A. Bellaachia

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT. Course Curriculum. DATA STRUCTURES (Code: )

Lab Manual. Data Structures (Pr): COT-213 Data Structures (P): IT-215

Binary Search Trees CMPSC 122

To My Parents -Laxmi and Modaiah. To My Family Members. To My Friends. To IIT Bombay. To All Hard Workers

Binary Search Trees. Data in each node. Larger than the data in its left child Smaller than the data in its right child

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.

International Journal of Software and Web Sciences (IJSWS)

Data Structures. Level 6 C Module Descriptor

Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010

Binary Heap Algorithms

AP Computer Science AB Syllabus 1

University of Pune Revised Structure for the B. Sc. (Computer Science) Course (Second Year to be implemented from Academic Year )

Home Page. Data Structures. Title Page. Page 1 of 24. Go Back. Full Screen. Close. Quit

Exercises Software Development I. 11 Recursion, Binary (Search) Trees. Towers of Hanoi // Tree Traversal. January 16, 2013

Binary Search Trees (BST)

Unit Write iterative and recursive C functions to find the greatest common divisor of two integers. [6]

Any two nodes which are connected by an edge in a graph are called adjacent node.

Ordered Lists and Binary Trees

Atmiya Infotech Pvt. Ltd. Data Structure. By Ajay Raiyani. Yogidham, Kalawad Road, Rajkot. Ph : ,

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION /5:15-6:45 REC-200, EVI-350, RCH-106, HH-139

Mathematics for Algorithm and System Analysis

Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types

Previous Lectures. B-Trees. External storage. Two types of memory. B-trees. Main principles

Binary Trees and Huffman Encoding Binary Search Trees

Algorithms and data structures

Data Structures, Practice Homework 3, with Solutions (not to be handed in)

root node level: internal node edge leaf node Data Structures & Algorithms McQuain

Binary Search Trees. A Generic Tree. Binary Trees. Nodes in a binary search tree ( B-S-T) are of the form. P parent. Key. Satellite data L R

The following themes form the major topics of this chapter: The terms and concepts related to trees (Section 5.2).

Bangalore University B.Sc Computer Science Syllabus ( Semester System)

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

Algorithms and Data Structures

B-Trees. Algorithms and data structures for external memory as opposed to the main memory B-Trees. B -trees

Data Structures UNIT III. Model Question Answer

TREE BASIC TERMINOLOGIES

MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push)

Data Structures and Algorithms

A binary heap is a complete binary tree, where each node has a higher priority than its children. This is called heap-order property

EE2204 DATA STRUCTURES AND ALGORITHM (Common to EEE, EIE & ICE)

Data Structures Fibonacci Heaps, Amortized Analysis

BCS2B02: OOP Concepts and Data Structures Using C++

The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,

Heaps & Priority Queues in the C++ STL 2-3 Trees

The Tower of Hanoi. Recursion Solution. Recursive Function. Time Complexity. Recursive Thinking. Why Recursion? n! = n* (n-1)!

From Last Time: Remove (Delete) Operation

Sorting revisited. Build the binary search tree: O(n^2) Traverse the binary tree: O(n) Total: O(n^2) + O(n) = O(n^2)

MATHEMATICS Unit Decision 1

Persistent Binary Search Trees

COMPUTER SCIENCE. Paper 1 (THEORY)

CSE 326: Data Structures B-Trees and B+ Trees

Binary Heaps * * * * * * * / / \ / \ / \ / \ / \ * * * * * * * * * * * / / \ / \ / / \ / \ * * * * * * * * * *

Module 2 Stacks and Queues: Abstract Data Types

A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION

How To Create A Tree From A Tree In Runtime (For A Tree)

Data Structures and Algorithms Written Examination

CPSC 211 Data Structures & Implementations (c) Texas A&M University [ 221] edge. parent

Chapter 8: Structures for Files. Truong Quynh Chi Spring- 2013

Analysis of Algorithms I: Optimal Binary Search Trees

ER E P M A S S I CONSTRUCTING A BINARY TREE EFFICIENTLYFROM ITS TRAVERSALS DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A

Analysis of a Search Algorithm

Quiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING LESSON PLAN

2) What is the structure of an organization? Explain how IT support at different organizational levels.

Social Media Mining. Graph Essentials

Parallelization: Binary Tree Traversal

1 p a g e 1 1. Syllabus of 3 rd Semester of B.Tech. Information Technology (Batch 2014 Onwards)

Objected oriented Programming: C++ Unit 1 1. Introduction 1.1. Introduction to Object Oriented Programming C++ fundamentals.

Outline BST Operations Worst case Average case Balancing AVL Red-black B-trees. Binary Search Trees. Lecturer: Georgy Gimel farb

Learning Outcomes. COMP202 Complexity of Algorithms. Binary Search Trees and Other Search Trees

Analysis of Algorithms I: Binary Search Trees

Lecture 1: Data Storage & Index

A binary search tree is a binary tree with a special property called the BST-property, which is given as follows:

Chapter 8: Binary Trees

Data Structure with C

Introduction to Data Structures and Algorithms

Post Graduate Diploma In Computer Science (One Year Semester Scheme)

INDEX. 1 Write recursive program which computes the nth Fibonacci number,

6 March Array Implementation of Binary Trees

CS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week

Tables so far. set() get() delete() BST Average O(lg n) O(lg n) O(lg n) Worst O(n) O(n) O(n) RB Tree Average O(lg n) O(lg n) O(lg n)

Big Data and Scripting. Part 4: Memory Hierarchies

CS711008Z Algorithm Design and Analysis

S. Muthusundari. Research Scholar, Dept of CSE, Sathyabama University Chennai, India Dr. R. M.

Data Structures Using C++

Chapter 14 The Binary Search Tree

Chapter 3: Restricted Structures Page 1

Transcription:

COURSE: B.TECH-ECE. IV Sem Data structure Using C 1. Determine the formula to find the address location of an element in three dimensions array, suppose each element takes four bytes of space & elements are stored in column major order? 2. How can a polynomial equation be represented through link list? Explain the method to add two given polynomial equations using linked list? 3. Define the double link list? Write an algorithm to delete an element from the existing link list? 4. What is Sparse Matrices? Write an algorithm to implement it? 5. Write a program with two function A) insertion of element in an array b) Deletion of element in an array 6. What is circular linked list? What is the advantage of it? Write a program to implement CLL? 7. Write a program to multiply two matrix of 3*3 8. Write a program to calculate transpose of a matrix? 9. Write a program to insert in middle in doubly linked list and Single linked list? 10. Write a program to add two polynomial equations. (Stack) Q1.What is stack? Give an implementation of stack in C language? Q2. Explain the solution of the tower of Hanoi problem where the number of disks is 4 and Number of pegs are 3? Q3.Write an algorithm to evaluate an expression given in postfix Notation? A*(B+D)/E-F*(G+H/K) Q5. Write an algorithm to convert an infix expression to postfix expression. Q6. Define the recursion? Write a recursive and non-recursive program to calculate the factorial of the given number? Q7. Explain the tower of Hanoi problem and write a recursive algorithm to solve it?

(Queue) Q1. What do you mean by priority Queue? Explain the types to maintain the priority queue? Q2.What is a circular Queue? Write a C Program to insert an item in the circular queue? Q3. Define Queue? Formulate insertion and deletion algorithms for a circular queue? (Linked List) Q1.Give a dynamic implementation of singly linked list in C Language? Q2. Define the double link list.write an algorithm to delete an element from the existing Link list? Q3. How a polynomial equation can be represented through link list? Explain the method to add two given polynomial equations using linked list? Assignment: 1. Explain Height of tree? 2. Difference between Height and Depth of tree? 3. What is Time complexity? 4. Where we use BFS and DFS algo? 5. What is a complexity of Bubble sort? 6. What is a complete Binary tree? 7. What is average case and best case complexity of Bubble sort and Insertion sort? 8. Give one line difference between Warshall and Dijikstra algorithm? 9. Difference between preorder and post order? 10. What is IN order traversal? 11. Write an algorithm to determine the number of connected components in a given graph? 12. Explain Hashing? Explain all methods of hashing?

13. Explain threaded binary tree? Write a function to traverse a threaded binary tree in preorder? 14. Explain all cases to delete a node in an existing binary search tree? 15. The Preorder and In-order traversal of binary tree is given below, construct the tree- Preorder: FAEKCDHCB Inorder : EACKFHDBG Draw a tree T 16. What is adjacency matrix? How we calculate path matrix using adjacency matrix 17. How a node is deleted from the binary search tree? Explain the methods? 18. Explain B-Tree with the help of example? 19. Explain krushkal and prim s algorithm with the help of example. 20. Obtain the minimum cost spanning tree using Kruskal s algorithm for the given graph. 21. Write an algorithm of bubble sort and insertion sort. Explain their best case and worst case complexities.

22. Write an algorithm for the merge sort. Explain its complexities. Sort the following using merge sort method: 85, 20,30,80,90,100,110,50,20,40 23. Write a C program to search an element in a sorted set of integers using binary search algorithm? 24. Define AVL tree. starting with an empty tree, build the AVL tree by following sequence of insertions: E,J,A,M,J,O,F,P Also label the rotations according to their types. 25. Write an algorithm for insertion in a Binary search tree. Show the binary search tree built from a sequence of insertions for the following sequence keys: 9,18,11,16,6,3,17,18,13,1,5 26. Describe Huffman algorithm with the help of suitable example? 27. Write and Explain an algorithm of Heap sort with the help of suitable example? 28. Write an algorithm for sorting a set of positive integers in ascending order using Quick sort procedure. Give worst case and average case time complexity of the algorithm. Illustrate this procedure for following keys: 60, 88,18,21,13,95,75,36

29. Write a C program to search an element in a unsorted set of integers using Linear Search algorithim.? 30. Inorder and postorder traversal of a Tree T is given as follows; Inorder : B A E F D C G Postorder : F F A B G C D Draw the tree T 31. Determine in the terms of level 1 the maximum number of possible nodes at level 1 in the binary tree and also determine the maximum total number of possible nodes in a binary tree if the root node is at level 1. 32. How a node can be Inserted from the B-Tree? Explain the methods with example? 33. Write and explain the breadth first search and depth first search graph traversal algorithm? What are their complexities? 34. Describe the Dijikstra s algorithim algorithim for dinding shortest path with help of suitable example? 35. Define the spanning tree? Write the prim s algorithim to find the minimum cost spanning tree of the following:

36. Determine the formula to find the address location of an element in three dimensions array, suppose each element takes four bytes of space & elements are stored in column major order? 37. How a polynomial equation can be represented through link list? Explain the method to add two given polynomial equations using linked list? 38. Define the double link list? Write an algorithm to delete an element from the existing link list? 39. Write an algorithm to convert an infix expression to postfix expression? Convert the following infix expression into postfix expression? A*(B+D)/E-F*(G+H/K) 40. Define the recursion? Write a recursive and non-recursive program to calculate the factorial of the given number? 41. Explain the Tower of Hanoi problem and write a recursive algorithim to solve it? 42. Write an algorithm to evaluate an expression given in postfix Notation? 43.What is stack? Give an implementation of stack in C language?