jdbc5. CREATE TABLE USING JDBC
Total Pageviews
Tuesday, November 17, 2020
Friday, November 13, 2020
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 1. CLICK HERE
CHAPTER 2. CLICK HERE
CHAPTER 3. CLICK HERE
CHAPTER 4. CLICK HERE
CHAPTER 5. CLICK HERE
CHAPTER 7. CLICK HERE
CHAPTER 8. CLICK HERE
CHAPTER 9. CLICK HERE
CHAPTER 11. CLICK HERE
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 11:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 11:
1. ALGORITHM 1. NUMBER OF COMPONENTS OF GRPAH.
2. ALGORITHM 2. SPANNING TREE.
3. ALGORITHM 7. SHORTEST PATH.
4. DFS,BFS
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 9:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 9:
1. DIRECTED GRAPH
2. UNDIRECTED GRAPH.
3. ADJACENCY MATRIX OF DIGRAPH.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 8:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 8:
1. CHROMATIC NUMBER.
2. GRAPH COLORING.
3. THEOREM 8.1.
4. THEOREM 8.2.
5. BIPARTITE GRAPH.
6.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 7:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 7:
1. INCIDENCE MATRIX.
2. THEOREM 7.1.
3. THEOREM 7.2.
4. CIRCUIT MATRIX.
5. CUT SET MATRIX.
6. PATH MATRIX.
7. ADJACENCY MATRIX.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 5:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 5:
1. PLANAR GRAPH
2. NONPLANAR GRAPH
3. THEOREM 5.1.
4. THEOREM 5.2.
5. THEOREM 5.6.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 4:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 4:
1. CUT SET
2. THEOREM 4.1.
3. THEOREM 4.2.
4. THEOREM 4.3.
5. FUNDAMENTAL CUT SET.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 3:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 3 :
1.TREE
2. NULL TREE
3. THEOREM 3.1.
4. THEOREM 3.2.
5. THEOREM 3.3.
6. THEOREM 3.4.
7. THEOREM 3.5.
8. THEOREM 3.6.
9. THEOREM 3.7.
10. DISTANCE , CENTERS.
11. METRIC.
12. THEOREM 3.8.
13. THEOREM 3.9.
14. RADIUS , DIAMETER.
15. ROOTED AND BINARY TREE.
16. HEIGHT,LEVEL
17. WEIGHTED PATH LENGTH.
18. THEOREM 3.10.
19. UNLABELED TREE.
20. SPANNING TREE, MINIMAL SPANNING TREE.
21. THEOREM 3.11.
22. THEOREM 3.12.
23. RANK AND NULLITY.
24. MINIMAL SPANNING TREE ALGORITHM.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 2:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 2:
1. ISOMORPHISM
2. SUBGRAPH
3. VERTEX DISJOINT, EDGE DISJOINT.
4. WALK, PATH, CIRCUIT
5. OPEN WLAK, CLOSED WALK.
6. CONNECTED GRAPH, DISCONNECTED GRAPH
7. COMPONENT
8. THEOREM 2-1.
9. THEOREM 2-2.
10. THEOREM 2-3.
11. EULER LINE, EULER GRAPH
12. THEOREM 2-4.
13. UNICURSAL LINE ,UNICURSAL GRAPH..
14. THEOREM 2-5.
15. UNION, INTERSECTION,RING SUM, DECOMPOSITION,DELETION
16. FUSION.
17. THEOREM 2-6.
18. ARBITRARILY TRACEABLE GRAPH.
19. THEOREM 2-7.
20. HAMILTONIAN PATH AND HAMILTONIAN CIRCUIT.
21. COMPLETE GRAPH.
22. THEOREM 2-8.
23. THEOREM 2-9.
24. EXERCISE 2.5.
25. EXERCISE 2.6.
26. EXERCISE 2.8.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 1:
CHAPTER 1:
1. LINEAR GRAPH DEFINITION.
2. SELF LOOP.
3. PARALLEL EDGES.
4. SIMPLE GRAPH.
5. KONIGSBERG BRIDGE PROBLEM.
6. FINITE , INFINITE GRAPH.
7. INCIDENCE AND DEGREE.
8. THEOREM- 1.1
9. ISOLATED VERTEX, PENDANT VERTEX.
10. NULL GRAPH
11. EXERCISE - 1.9, 1.10, 1.11, 1.12
Software Lab Based on R Programming
Software Lab Based on R Programming ( UGC CBCS ASSIGNMENT)
1. Write a program that prints ‗Hello World‘ to the screen. CLICK HERE ( NO VOICE )
2. Write a program that asks the user for a number n and prints the sum of the numbers 1 to n. CLICK HERE
3. Write a program that prints a multiplication table for numbers up to 12. CLICK HERE
4. Write a function that returns the largest element in a list. CLICK HERE
5. Write a function that computes the running total of a list. CLICK HERE
6. Write a function that tests whether a string is a palindrome. CLICK HERE
7. Implement the following sorting algorithms:
i) Selection sort, CLICK HERE
ii) Insertion sort, - CLICK HERE
iii) Bubble Sort - CLICK HERE
8. Implement linear search. - CLICK HERE
9. Implement binary search. - CLICK HERE
10. Implement matrices addition, subtraction and Multiplication CLICK HERE
6. Write a function that tests whether a string is a palindrome.( R Programming )
6. Write a function that tests whether a string is a palindrome.( R Programming )
5. Write a function that computes the running total of a list.( R Programming )
5. Write a function that computes the running total of a list.( R Programming )
3. Write a program that prints a multiplication table for numbers up to 12.( R Programming )
3. Write a program that prints a multiplication table for numbers up to 12.( R Programming )
2. Write a program that asks the user for a number n and prints the sum of the numbers 1 to n. ( R Programming )
2. Write a program that asks the user for a number n and prints the sum of the numbers 1 to n. ( R Programming )
1. Write a program that prints ‗Hello World‘ to the screen. ( R Programming )
1. Write a program that prints ‗Hello World‘ to the screen.
Thursday, November 12, 2020
C++ question set (Balagurusamy)
CHAPTER 13
1. exception.
2. exception handling,
3. try , catch
4. multiple catch statement.
5. catch all exceptions.
6. rethrowing an exception.
7. specifying exceptions.
8. exceptions in constructors and destructors.
C++ question set (Balagurusamy)
CHAPTER 12
1. class template,class template with multiple parameters.
2. function template.
3. overloading template function.
C++ question set (Balagurusamy)
CHAPTER 15
1. creating string objects.
2. manipulating string objects.
3. relational operator overloading of relational operators
C++ question set (Balagurusamy)
CHAPTER 11
1. file stream classes - ifstream, ofstream, fstream.
2. opening and closing a file.
3. EOF.
4. reading character from a file and writing character to a file.
5. reading string from a file and writing string to a file.
6 .reading integer from a file and writing integer to a file.
7. update file,delete file,rename file.
8. command line argument.
C++ question set (Balagurusamy)
CHAPTER 10
1.C++ stream classes.
2. overloading << and >>.
3. put(),get(),getline(),write(),width(),fill().
C++ question set (Balagurusamy)
CHAPTER 9
1. Early binding and late binding.
2. compile time polymorphism and run time polymorphism.
3. pointer to an object.
4. this pointer.
5. virtual function and pure virtual function.
6. Virtual constructor and virtual destructor.
C++ question set (Balagurusamy)
CHAPTER 8
1. inheritance definition and properties.
2. base class and derived class.
3. single inheritance, multilevel inheritance, multiple inheritance, hierarchical inheritance, hybrid inheritance.
4. private member inheritable.
5. Virtual base class, Abstract class.
6. Constructor in derived class.
Subscribe to:
Posts (Atom)