Interested to Buy Any Domain ? << Click Here >> for more details...
-
Dot Net Code (114) - Visual Basic Code (11)
- Programming Code AllOther (62)
Performance Algorithm A performs 10n2 basic operations and algorithm B performs 300 lg n basic operations. For what value of n does algorithm B start to show its better performance?
7892Complexity T(n) What is the time complexity T(n) of the following portions of code? For simplicity, you may assume that n is a power of 2. That is, n = 2k for some positive integer k. a) ? for (i = 1; i <= n; i++) { j = n; cout << i << ? ? j << ? ? << endl; } b) ? for (i = 0; i <= n; i += 2) { j = n; cout << i << ? ? j << ? ? << endl; } c) ? for (i = n; i >= 1; i = i/2) { j = n; cout << i << ? ? j << ? ? << endl; } d) for (i = 1; i <= n; i++) { j = n; while (j >= 0) { cout << i << ? ? j << ? ? << endl; j = j - 2; } }
3136Complexity T(n) Write a linear-time algorithm that sorts n distinct integers, each of which is between 1 and 500. Hint: Use a 500-element array. (Linear-time means your algorithm runs in time c*n + b, where c and b are any constants that do not depend on n. For example, your algorithm can run in time n, or time 2n + 1, or time 5n + 10, or time 100n + 6, but not time c*n*n = c*n?.)
1 7359Subsets Write an algorithm that prints out all the subsets of 3 elements of a set of n elements. The elements of the set are stored in a list that is the input to the algorithm. (Since it is a set, you may assume all elements in the list are distinct.)
1 14307Min-Max Write an algorithm that finds both the smallest and largest numbers in a list of n numbers and calculate its complexity T(n).
1 7305Min-Max Write an algorithm that finds both the smallest and largest numbers in a list of n numbers and with complexity T(n) is at most about (1.5)n comparisons.
ABC, College School Exams Tests, ITC Infotech, Kyambogo University, Qatar University,
10 47131Faster Computers Suppose you have a computer that requires 1 minute to solve problem instances of size 1000. What instance sizes can be run in 1 minute if you buy a new computer that runs 1000 times faster than the old one, assuming the following time complexities T(n) for our algorithm? (a) T(n) = O(n). (b) T(n) = O(n3). (c) T(n) = O(10n).
1 11731Algorithm in O(2n) Presently we can solve in our hypothetical machine problem instances of size 100 in 1 minute using algorithm A, which is a O(2n). We would like to solve instances of size 200 in 1 minute using algorithm A on a new machine. What is the speed of the new machine should be?
2 7111How do you sort a Linked List (singly connected) in O(n) please mail to pawan.10k@gmail.com if u can find an anser...i m desperate to knw...
6 16326write the function. if all the character in string B appear in string A, return true, otherwise return false.
11 19569Write a Program in Visual Basic by means of which we can send any data from Visual basic program to any other application running on that machine whether that application supports OLE or not.....
1 3988
U hv to enter a range from a and b and search hw many no. of times a pattern n. occurs between the range a and b. Eg :i/p:enter range :0 100 Enter pattern: 13 o/p: the no. times 13 occurred betwwn 0 to 100:1 Eg :i/p:enter range :100 1000 Enter pattern: 13 o/p: the no. times 13 occurred betwwn 100 to 1000: (in this 13,113,131,132,133…139,213,313,…913 all these will be counted)
1.What type of material can be sent from a Java servlet to a browser ? How does the browser know how to deal with the material? 2.Explain what happens to a servlet when a servlet engine is sent a GET request.
plzzzzzzzzz xplain this code import java.awt.*; import java.util.Date; import java.awt.event.*; import java.awt.MenuItem.*; import java.sql.*; import sun.jdbc.odbc.*; import java.io.*; public class NewConnection extends Frame implements ActionListener { Label l1,l2,l3,l4,l5,l6,l7,l8,l9,l10,l11,l12,l13; Button exit,save,bnext,top,prev,botm,ad,edit; TextField txtSvNo,txtConsNo,txtSvDt,txtConsName,txtAddr1,txtPhNo,txtCy lQty,txtCylDep,txtRegDep,txtRegQty,adr2,adr3,tot,stnry,rmrk; Date date=new Date(); String ConsName; String Addr1; public static void main(String sr[]) { new NewConnection().setVisible(true); } public NewConnection() { super("New Connection"); Statement stmt; ResultSet rs; //PreparedStatement pst; Connection con; try { Class.forName ("sun.jdbc.odbc.JdbcOdbcDriver"); con=DriverManager.getConnection("jdbc:odbc:Agency"); if (con!=null); System.out.println ("connected"); stmt =con.createStatement (); } catch(Exception e1) { System.out.println (e1); } setSize(1280,800); setBackground(Color.lightGray); setLayout(null); l1=new Label("SV NO"); l1.setBounds(260,60,90,30); l1.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l1.setAlignment(Label.CENTER); add(l1); l2=new Label("CONSMR NO"); l2.setBounds(30,60,90,30); l2.setFont(new Font("TimesRoman",Font.PLAIN,15)); l2.setAlignment(Label.CENTER); add(l2); l3=new Label("SV DATE"); l3.setBounds(520,60,90,30); l3.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l3.setAlignment(Label.CENTER); add(l3); l4=new Label("NAME"); l4.setBounds(30,150,45,30); l4.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l4.setAlignment(Label.CENTER); add(l4); l5=new Label("ADRS"); l5.setBounds(30,220,45,30); l5.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l5.setAlignment(Label.CENTER); add(l5); l6=new Label("PH NO"); l6.setBounds(500,150,45,30); l6.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l6.setAlignment(Label.CENTER); add(l6); l7=new Label("CYLDR"); l7.setBounds(30,390,55,30); l7.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l7.setAlignment(Label.CENTER); add(l7); l8=new Label("DEPOSIT"); l8.setBounds(320,390,65,30); l8.setFont(new Font("TimesRoman",Font.PLAIN,15)); l8.setAlignment(Label.CENTER); add(l8); l9=new Label("DEPOSIT"); l9.setBounds(320,440,65,30); l9.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l9.setAlignment(Label.CENTER); add(l9); l10=new Label("RGLTR"); l10.setBounds(30,440,55,30); l10.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l10.setAlignment(Label.CENTER); add(l10); l11=new Label("TOTAL"); l11.setBounds(320,480,55,30); l11.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l11.setAlignment(Label.CENTER); add(l11); l12=new Label("Cur.Statn.NO."); l12.setBounds(290,550,85,30); l12.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l12.setAlignment(Label.CENTER); add(l12); l13=new Label("REMARKS"); l13.setBounds (30,630,85,30); l13.setFont(new Font ("TimesRoman",Font.PLAIN,15)); l13.setAlignment (Label.CENTER); add(l13); txtSvNo=new TextField(); txtSvNo.setBounds(375,60,80,30); txtSvNo.setBackground(Color.white); add(txtSvNo); txtConsNo=new TextField(); txtConsNo.setBounds(130,60,80,30); txtConsNo.setBackground(Color.white); add(txtConsNo); txtSvDt=new TextField(); txtSvDt.setBounds(635,60,80,30); txtSvDt.setBackground(Color.white); add(txtSvDt); txtConsName=new TextField(); txtConsName.setBounds(100,150,200,30); txtConsName.setBackground(Color.white); add(txtConsName); txtAddr1=new TextField(); txtAddr1.setBounds(100,220,350,30); txtAddr1.setBackground(Color.white); add(txtAddr1); adr2=new TextField(); adr2.setBounds(100,250,350,30); adr2.setBackground(Color.white); add(adr2); adr3=new TextField(); adr3.setBounds(100,280,350,30); adr3.setBackground(Color.white); add(adr3); txtPhNo=new TextField(); txtPhNo.setBounds(570,150,150,30); txtPhNo.setBackground(Color.white); add(txtPhNo); txtCylQty=new TextField(); txtCylQty.setBounds(100,390,60,30); txtCylQty.setBackground(Color.white); add(txtCylQty); txtCylDep=new TextField(); txtCylDep.setBounds(410,390,60,30); txtCylDep.setBackground(Color.white); add(txtCylDep); txtRegDep=new TextField(); txtRegDep.setBounds(410,440,60,30); txtRegDep.setBackground(Color.white); add(txtRegDep); txtRegQty=new TextField(); txtRegQty.setBounds(100,440,60,30); txtRegQty.setBackground(Color.white); add(txtRegQty); tot=new TextField(); tot.setBounds(410,490,60,30); tot.setBackground(Color.white); add(tot); stnry=new TextField(); stnry.setBounds(410,550,60,30); stnry.setBackground(Color.white); add(stnry); rmrk=new TextField(); rmrk.setBounds(140,630,600,30); rmrk.setBackground(Color.white); add(rmrk); exit=new Button("EXIT"); exit.setBackground(Color.orange); exit.setBounds(760,700,40,40); exit.addActionListener(this); add(exit); save=new Button("SAVE"); save.setBackground(Color.orange); save.setBounds(715,700,40,40); save.addActionListener(this); add(save); bnext=new Button("NEXT"); bnext.setBackground(Color.orange); bnext.setBounds(90,700,40,40); bnext.addActionListener(this); add(bnext); top=new Button("TOP"); top.setBackground(Color.orange); top.setBounds(0,700,40,40); top.addActionListener(this); add(top); prev=new Button("PREV"); prev.setBackground(Color.orange); prev.setBounds(45,700,40,40); prev.addActionListener(this); add(prev); botm=new Button("BOTM"); botm.setBackground (Color.orange); botm.setBounds (135,700,40,40); botm.addActionListener (this); add(botm); ad=new Button("ADD"); ad.setBackground (Color.orange); ad.setBounds (300,700,40,40); ad.addActionListener (this); add(ad); edit=new Button("EDIT"); edit.setBackground (Color.orange); edit.setBounds (345,700,40,40); edit.addActionListener (this); add(edit); } public void actionPerformed(ActionEvent e) { if(e.getSource()==exit) { this.dispose(); System.exit(0); } if(e.getSource()==save) { try { Connection con=DriverManager.getConnection("jdbc:odbc:Agency"); PreparedStatement pst=con.prepareStatement("INSERT INTO NewCon values (?,?,?,?,?,?,?,?,?,?,?,?,?,?,?)"); pst.setInt (1,Integer.parseInt(txtConsNo.getText())); pst.setInt (2,Integer.parseInt(txtSvNo.getText())); pst.setString (3,txtSvDt.getText()); pst.setString (4,txtConsName.getText()); pst.setInt(5,Integer.parseInt (txtPhNo.getText())); pst.setString(6,txtAddr1.getText()); pst.setString(7,adr2.getText()); pst.setString(8,adr3.getText()); pst.setInt(9,Integer.parseInt (txtCylQty.getText())); pst.setInt(10,Integer.parseInt (txtCylDep.getText())); pst.setInt(11,Integer.parseInt (txtRegQty.getText())); pst.setInt(12,Integer.parseInt (txtRegDep.getText())); pst.setInt(13,Integer.parseInt (tot.getText())); pst.setInt(14,Integer.parseInt (stnry.getText())); pst.setString(15,rmrk.getText()); pst.executeUpdate (); con.close(); } catch(Exception e2) {System.out.println(e2);} } if(e.getSource()==ad) { int newcono=60000,newsvno=10000; System.out.println("entered if body"); try { System.out.println("entered the try:"); Connection con1=DriverManager.getConnection("jdbc:odbc:Agency"); Statement stmt1=con1.createStatement(); ResultSet rs1=stmt1.executeQuery("SELECT Cons_No,Sv_No FROM NewCon "); while(rs1.next()) { //System.out.println(rs1.getInt("Cons_No")); txtConsNo.setText(""+rs1.getInt(1)); txtSvNo.setText(""+rs1.getInt(2)); //newcono=rs1.getInt("Cons_No"); } //rs1.last(); newcono=Integer.parseInt(txtConsNo.getText ()); newsvno=Integer.parseInt(txtSvNo.getText ()); //newcono=rs1.getInt("Cons_No"); System.out.println(newcono); newcono=newcono+1; newsvno=newsvno+1; txtConsNo.setText (""+newcono); txtSvNo.setText(""+newsvno); txtSvDt.setText(""+ date); txtConsName.setText(""); txtAddr1.setText(""); txtPhNo.setText(""); txtCylQty.setText(""); txtCylDep.setText(""); txtRegDep.setText(""); txtRegQty.setText(""); adr2.setText(""); adr3.setText(""); tot.setText(""); stnry.setText(""); rmrk.setText(""); con1.close(); } catch(Exception e4){System.out.println (e4);} } if(e.getSource()==bnext) { try{ Connection con2=DriverManager.getConnection ("jdbc:odbc:Agency"); Statement stmt2=con2.createStatement (); ResultSet rs2=stmt2.executeQuery("SELECT * FROM NewCon "); rs2.next(); { txtConsNo.setText(rs2.getInt(1)+""); txtSvNo.setText (rs2.getInt(2)+""); txtSvDt.setText (rs2.getString(3)+""); txtConsName.setText (rs2.getString(4)+""); txtPhNo.setText (rs2.getInt(5)+""); txtAddr1.setText(rs2.getString(6)+""); adr2.setText (rs2.getString("Address2")+""); adr3.setText (rs2.getString("Address3")+""); txtCylQty.setText (rs2.getInt(9)+""); txtCylDep.setText (rs2.getInt(10)+""); txtRegDep.setText (rs2.getInt(11)+""); txtRegQty.setText (rs2.getInt(12)+""); tot.setText(rs2.getInt (13)+""); stnry.setText(rs2.getInt(14) +""); rmrk.setText(rs2.getString (15)+""); } } catch(Exception e5){} } } }
1+1/2!+1/3!+...+1/n!
In a gymnastic competition, scoring is based on the average of all scores given by the judges excluding the maximum and minimum scores. Let the user input the number of judges, after that, input the scores from the judges. Output the average score. Note: In case, more than two judges give the same score and it happens that score is the maximum or minimum then just eliminate two scores. For example, if the number of judges is 5 and all of them give 10 points each. Then the maximum and minimum score is 10. So the computation would be 10+10+10, this time. The output should be 10 because 30/3 is 10.
Is there any static classes are in java give some examples
c# code to Count number of 1's in a given range of integer (0 to n)
i am trying to intigrate ejb and hibernate ,from session facade i am callind dao implemented through hibernate,i am getting a ClassDefNotFoundException for this org/hibernate/Session i ve set the class path at build path and in setEnv in weblogic still .........
find out the list of users who have access to all t-codes starts with 'SU'? thanks in advance all.
How do you verify if the two sentences/phrases input is an anagram using predefined functions in string.h and by using arrays?
ArrayList declaration in .net
how exactly is the lngColour used?
Write a (n) algorithm that sorts n distinct integers, ranging in size between 1 and kn inclusive, where k is a constant positive integer. (Hint: Use a kn-element array.)
How to add a value from textBox over an existing certain column in SQL Server
how to test pierrot divisor
