DS UNIT V

DS-UNIT V

Comments

Post a Comment

Popular posts from this blog

RDBMS LAB EXERCISES WITH ANSWER

  EXERCISE:1 Create a table called Customer table   Name Type   Cust_name Varchar2(20)   Cust_street Varchar2(20)   Cust_city Varchar2(20)   (i) Insert records into the table.   (ii) Add salary column to the table.   (iii) Alter the table column domain.   (iv) Drop salary column of the customer table.   (v) Delete the rows of customer table whose cust_city is  “New York”. 💠 Step-by-step SQL Queries: ✅ (1) Create the Customer table SQL> CREATE TABLE Customer (     Cust_name VARCHAR2(20),     Cust_street VARCHAR2(20),     Cust_city VARCHAR2(20) ); ✅ (2) Insert records into the table SQL> INSERT INTO Customer (Cust_name, Cust_street, Cust_city) VALUES ('Alice', '1st Avenue', 'New York'); INSERT INTO Customer (Cust_name, Cust_street, Cust_city) VALUES ('Bob', '2nd Street', 'Los Angele...
Read more

DATA STRUCTURES-UNIT IV

Image
  UNIT IV   INTRODUCTION TO ALGORITHMS: Definition   of   Algorithms-   Overview   and   importance   of   algorithms-   pseudocode conventions, Asymptotic notations, practical complexities. Graph   Applications:   Breadth   first   traversal   –   Depth   first   traversal-   -Single   source shortest path – Minimal spanning trees – prim’s and kruskal’s algorithms   INTRODUCTION TO ALGORITHMS   4.1)Definition   of   Algorithms   ●       An algorithm is a well-defined, step-by-step procedure or set of rules used to solve a particular problem or perform a specific task. ●       Algorithms are widely applied in various fields like mathematics, computer science, and data processing. 4.2)Overview   and   importance   of   algorithms ●       In data...
Read more

DATA STRUCTURES-UNIT V

Image
                                                                                                      UNIT V DIVIDE AND CONQUER ALGORITHMS: General Method – Binary Search- Quick Sort- Merge Sort. BACKTRACKING: General method, 8 Queens, Graph coloring, Hamiltonian cycle. DIVIDE AND CONQUER ALGORITHMS: General Method Divide and Conquer   Algorithm  is a problem-solving technique used to solve problems by dividing the main problem into subproblems, solving them individually and then merging them to find solution to the original problem. Divide and Conquer is mainly useful when we divide a problem into independent subproblems. If we have overlapping subproblems, then w...
Read more