Your title goes here

DATA STRUCTURE

Home RESUME DATA STRUCTURE OBJECT ORIENTED PROGRAMMING DATA BASE C PROGRAM Aptitude Daily Status ENGLISH

s.no	question	Answer	Learnings	time
1)	What is Array?	array is set of finite number of data items of same type	an array is computer programming are series of object of the same type &size	5MIN
2)	what is queue	A Queue is a sequential organization of data. A queue is a first in first out type of data structure. An element is inserted at the last position and an element is always taken out from the first position.	fifo(car in a traffic ,printer machine)	5MIN
3)	linked list?	linked list consists of series of nodes .each node contains the element and a pointer to its sucessor node the pointer of the last node points to null	insertion and deletion opertions are easily performed using linked list.	5MIN
4)	type of linked list?	singly linked list, doubly linked list ,circular linked list	type of linked list	5MIN
5)	singly linked list	A singly linked list is a linked list in which each node contains only one link field pointing to the next node in the list	example: null	5MIN
6)	doubly linked list	A doubly linked list is a linked list in which each node has three fields namely data field ,forward link (Flink) and backward link(Blink).Flink points to the successor node in the where Blink point to the predecessor node.	real time example: train	5MIN
7)	circular linked list?	In circular linked list the pointer of the last node pointto the first node	circular linked lit can be implemented as singly linked list & doubly linked list with or without header	5MIN
8)	tree	a tree is finite set of one or more nodes such that there is a specially designated node called root and zero or more non empty sub tree t1,t2,Е.tk each of whose root are connected by a directed edge from root R	tree is a collection of node :real time example tree	5MIN
9)	binary tree	A binary tree is a tree in which each node can have maximum two children.	not more than two children	5MIN
10)	two type of representating binary tree	1)linear representation 2) linked representation		5MIN
11)	linear representation	the element are represented using arrays	for any element in position I ,left child is 2i ,right chlid is (2i+1),parent is in position (i/2)	5MIN
12	linked representation	the element are represented using arrays	each node representation has three field 1)pointer to the left sub tree 2)data field 3)pointer to the right sub tree	5MIN
13	binary tree ADT	A binary tree is a tree in which no node can have more than two children.		5MIN
14)	binary search tree?	Binary Search tree is a binary tree in which each internal node x stores an element such that the element stored in the left sub tree of x are less than or equal to x and elements stored in the right sub tree of x are greater than or equal to x. This is called binary-search-tree	the left sub tree of x are less than or equal to x and elements stored in the right sub tree of x are greater than or equal to x	5MIN
15)	Types of binary search trees?	i) Performance comparisons ii) Optimal binary search trees	type in binary search trees	5MIN
16)	List the Operations of binary search tree?	Make Empty Find Insert Delete Search Display	operations in binary search tree	5MIN
17)	spanning Tree	A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.	All the nodes of the graph appear on the tree once	5MIN
18	Define node	An element or node consists of two fields namely an information field called INFO and a pointer field called LINK. The name of the element is denoted by node	information field called INFO and a pointer field called LINK.	5MIN
19	debugging	Debugging is defined as the process of carrying out a number of tests to ensure that theprogram in behaving correctly according to its specification. It is also used for detecting logical errors.	finding a logical error	2MIN
20	ASCII	One of the most widely used coding systems is called the American standard Code for information interchange	ASCII. It is fixed 8 Ц bit cone used for representing characters	5MIN
21	Storage structure.	The Representation of a particular data structure in the memory of a computer is called a storage structure.	data structure in the memory location in computer	5MIN
22	file structure.	A storage structure representation in auxiliary memory is often called a file structure.		5MIN
23	flip Ц flop?	The state of information associated with a memory unit is stored in a piec of sequential circuitry called flip Ц flop	It is a simple two state device.	5MIN
24	Fibonacci sequence	Each element in this sequence is the sum of the two preceding elements	0,1,1,2,3,5,8,13,21,34,ЕЕЕ.	5MIN
25)	What is a dequeue?	A dequeue is a double-ended queue. This is a structure where in elements can be inserted or removed from either end.	double-ended queu	5min
26)	ordered list?	An ordered list is a list in which each nodeТs position in the list is determined by the value of its key component,	so that the key values form an increasing sequence, as the list is traversed	5min
27)	merge sort?	Merge sort takes a divide-and-conquer approach to sorting data. In a sequence of data, adjacent ones are merged and sorted to create bigger sorted lists. These sorted lists are then merged again to form an even bigger sorted list,t	which continuous until you have one single sorted list	5min
28)	free pool?	Pool is a list consisting of unused memory cells which has its own pointer	unused memory cells	5min
29)	recursive	The definition which defines an object in terms of simpler cases of itself is called recursive definition.		5min
30)	sequential search	In sequential search each item in the array is compared with the item being searched until a match occurs.	It is applicable to a table organized either as an array or as a linked list	5min
31)	The priority queue	The priority queue is a data structure in which the intrinsic ordering of the elements.	priority order of list	5min