-
N be the number of nodes and m be number of edges in a graph
n be the number of nodes and m be number of edges in a graph.
The number of edges in any undirected connected graph is at least
Select one:
a) n
b) n-1
c) None of the above
d) n(n-1)/2
-
A multi-way search tree
A multi-way search tree has n items. The number of external nodes is Select one:
a) n2
b) logn
c) n
d) n+1
-
How can a node be inserted in the middle of a linked list?
Skill/Topic: Linked ListA) by repointing the previous and the next elements of existing nodes to the new nodeB) by repointing only the next elements of existing node to the new nodeC) by repointing only the Previous elements of existing node to the new nodeD) None of the above Explanation: by repointing the previous and the next elements of existing nodes to the new node You can insert a node in the...
manishmodgil
- Dec 28th, 2007
1. Identify where to be inserted.2. nxt pointer of the new node to the next node.3. nxt pointer of the previous node to the new node.Do consider spl. cases :1. to insert at the start of the list2. to insert at the end of the list
sri
- Nov 11th, 2007
Firstly, create a temporary node say "temp"!!!so, prev->link=temp; temp->link=next;
-
If the depth of a tree is 3 levels, then what is the Size of the Tree?
Skill/Topic: TreeA) 8Explanation: You calculate the size of a tree by using the following formula: size = 2 ^ depth If the depth is 3 levels, then the size is 8, as shown here: 8 = 2 ^ 3
-
What happens when you push a new node onto a stack?
Skill/Topic: Stacks using Linked ListA) 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
samba.bbs@gmail.com
- Jun 24th, 2023
The new node is placed at the front of the linked list
Softwaredeveloper
- Mar 27th, 2010
With a linked list Push: Insert at front of list. Pop: Remove from front of list.
-
Static Queue Items
Write an algorithm to calculate the number of items in a static queue?
rupaliverma.iti
- Feb 13th, 2010
[F front R rear P pointer q[] is the array variable] Algorithm: if (F != R)P= Fcount =0 while(P <= R) {count count + 1;P P+1; }//Display count which shows number of element
boyanamadhavilatha
- Sep 23rd, 2009
[F=front, R=rear, P= pointer, q[] is the array variable] Algorithm: if F != R P= F count = 0 &...
-
Time Complexity of Adding Three Matrices
What is the time complexity of adding three matrices of size NXN cell-by-cell?
Manish Yadav
- Oct 15th, 2011
Time Complexity of Adding Three Matrices because there is only two loop are needed for adding the matrix so complexity will be o(n^2), there is no effect for increase the number of matrix. it will be same for n number of matrix.
Codesonia_mehta
- Jul 6th, 2010
Program looks like......for(i=0;i<n;i++){ for(j=0;j<n;j++) { result[i][j]=a[i][j]+b[i][j]+c[i][j]; }}loop will execute n*n times...and 2 add operations..if 1 add op takes 'c' time, thentotal time= 2*c*n*nthus, time complexity= n*n......
-
What is a user-defined data type?
Skill/Topic: Variables and PointersA) A user-defined data type is a group of primitive data types defined by the programmer.
-
Marbles and Floors
You have a 100-story building and a couple of marbles. You must identify thelowest floor for which a marble will break if you drop it from this floor. How fastcan you find this floor if you are given an infinite supply of marbles? What if youhave only two marbles?
-
-
What is the difference between bubble sort & quick sort?
aahwini m
- Feb 8th, 2016
Quicksort is faster than bubble sort and the main difference is time complexity.
Aqan12
- May 26th, 2010
Bubble sort is a very simple algorithm which compares two neighbouring elements and swaps them if they are not in the right order. In a worst case scenario when the list is alrea...
-
Data Structure - character that repeats itself
Given a string of characters (let us say there are about 100 characters or more in the string), what is the most efficient method to use for finding out the character that repeats itself the most?Is it possible for us to use some kind of data structure for this?, if this is so,which is the best one that needs to be used?
vinod148
- Oct 23rd, 2009
There is no way for less that O(n) solution as we have to traverse the string atleast once.By traversing only once we can find the solutionKeep another variable which tracks the current highest occured character.
pvsola
- Apr 3rd, 2008
There is an way to solve this issue with complexity of O(n).1. MAke an array size of 2562. Using each charater read from the string as an index incremented the counter ...
-
-
Explain about Linear and Nonlinear data structures
sureshds
- Dec 26th, 2009
If the elements/nodes have a single successor and predecessor then the list is said to be linear.Stacks and queues are Linear.Linked lists are linear in terms of accessing and non-linear interms of storage.Trees and graphs are pure non-linear.?
vinod148
- Oct 23rd, 2009
Linear: May not need pointers to access Need more time for searching than non-linear Easier to access Non-linear: &nb...
-
What is the running time to find the depth (dv) of a node v in a binary tree?
Select one:
O(1+dv)
O(n)
O(1)
O(dv) -
How is memory reserved using a declaration statement?
Skill/Topic: Variables and PointersA) Memory is reserved by using a data type in a declaration statement.Explanation: The form of a declaration statement varies depending on the programming language you use. For example, here is a declaration statement for C, C++, and Java:int myVariable;
as_hmr
- Mar 11th, 2008
Just to add on.in Cint i; // it is both declaratoin and definationextern int i; // this is only declaration
manishmodgil
- Dec 28th, 2007
In C if we write int a; this statement does both viz. declaration and definition. It first created a variable named a and then defines it be of type int and allocated memory. Although we have not spec...
-
A linked list index is ____ that represents the position of a node in a linked list.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) An IntegerB) a variableC) a characterD) a boolean
-
What is a Register?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) A register is a small amount of memory within the CPU that is used to temporarily store instructions and data.Explanation: Random Access Memory is also called a Main Memory. It is called a Volatile memory because; instructions and data contained in main memory are lost once the computer is powered down.
chitraadevi
- Jun 1st, 2008
Register is a storage area.which is represented by the amount of flip flops.
deepak
- Aug 24th, 2007
Register basically a group of flip flop . flip flop is the single bit storage cell or it is the smallest memory? cell .so register is no of flip flop arranged in sequence, if there is 5 flip flop then register is called 5 bit register .
-
What are the various kinds of sorting techniques? Which is has least worst case?
These are some sorting techs,bubble sortquick sortinsertion sortselection sortmerge sortheap sorttell me any more sorting is found..... ad which is best....
akshay
- Aug 25th, 2011
BUBBLE SORT:
Code- BUBBLE SORT:
- #include<iostream.h>
- #include<string.h>
- #include<math.h>
- #include<stdlib.h>
- "Enter number of elements:""Enter no's: ""Sorted list is:"
vinod148
- Oct 23rd, 2009
HEAP sort is the best algorithmO(n log n) time for best, avg and worst caseO(1) spacelet me know if any other sorting algorithm present if that exceeds the limit i gave
Without using /,% and * operators. write a function to divide a number by 3.
Alok Mishra
- Aug 4th, 2011
"c #include #include void main() { int i,n; float m,j=0; clrscr(); printf("enter the no"); scanf("%d",&n); if(n==1) { m=0.3333; printf("%f",m); } if(n==2) { m=0....
Satish Anjaneyappa
- Apr 8th, 2011
Int quoitent=-1, rem=0;int number;while(number>=0){ rem=number; quoitent +=1; //quoitent= quoitent+1; number -=3; //number=number-3;}
Ans