Showing preview only (216K chars total). Download the full file or copy to clipboard to get everything.
Repository: omkar98/InfyTQ-Answers
Branch: master
Commit: aecf36380295
Files: 251
Total size: 167.1 KB
Directory structure:
gitextract_9es3xsz4/
├── .github/
│ └── workflows/
│ └── greetings.yml
├── DBMS/
│ ├── Day-2/
│ │ ├── Assignment-10.txt
│ │ ├── Assignment-11.txt
│ │ ├── Assignment-12.txt
│ │ ├── Assignment-13.txt
│ │ ├── Assignment-14.txt
│ │ ├── Assignment-2.txt
│ │ ├── Assignment-3.txt
│ │ ├── Assignment-4.txt
│ │ ├── Assignment-5.txt
│ │ ├── Assignment-6.txt
│ │ ├── Assignment-7.txt
│ │ ├── Assignment-8.txt
│ │ ├── Assignment-9.txt
│ │ ├── Exercise-3.txt
│ │ ├── Exercise-4.txt
│ │ ├── Exercise-5.txt
│ │ ├── Exercise-6.txt
│ │ ├── Exercise-7.txt
│ │ ├── Exercise-8.txt
│ │ └── Exercise-9.txt
│ ├── Day-3/
│ │ ├── Assignment-15.txt
│ │ ├── Assignment-16.txt
│ │ ├── Assignment-17.txt
│ │ ├── Assignment-18.txt
│ │ ├── Assignment-19.txt
│ │ ├── Assignment-20.txt
│ │ ├── Assignment-21.txt
│ │ ├── Assignment-22.txt
│ │ ├── Assignment-23.txt
│ │ ├── Assignment-24.txt
│ │ ├── Assignment-25.txt
│ │ ├── Assignment-26.txt
│ │ ├── Assignment-27.txt
│ │ ├── Assignment-28.txt
│ │ ├── Assignment-29.txt
│ │ ├── Assignment-30.txt
│ │ ├── Assignment-31.txt
│ │ ├── Assignment-32.txt
│ │ ├── Assignment-33.txt
│ │ ├── Assignment-34.txt
│ │ ├── Assignment-35.txt
│ │ ├── Assignment-36.txt
│ │ ├── Assignment-37.txt
│ │ ├── Assignment-38.txt
│ │ ├── Assignment-39.txt
│ │ ├── Exercise-10.txt
│ │ ├── Exercise-11.txt
│ │ ├── Exercise-12.txt
│ │ ├── Exercise-13.txt
│ │ ├── Exercise-14.txt
│ │ ├── Exercise-15.txt
│ │ ├── Exercise-16.txt
│ │ ├── Exercise-17.txt
│ │ ├── Exercise-18.txt
│ │ ├── Exercise-19.txt
│ │ ├── Exercise-20.txt
│ │ ├── Exercise-21.txt
│ │ └── Exercise-22.txt
│ ├── Day-4/
│ │ ├── Assignment-40.txt
│ │ ├── Assignment-41.txt
│ │ ├── Assignment-42.txt
│ │ ├── Assignment-43.txt
│ │ ├── Assignment-44.txt
│ │ ├── Assignment-45.txt
│ │ ├── Assignment-46.txt
│ │ ├── Assignment-47.txt
│ │ ├── Assignment-48.txt
│ │ ├── Assignment-49.txt
│ │ ├── Assignment-50.txt
│ │ ├── Assignment-51.txt
│ │ ├── Assignment-52
│ │ ├── Assignment-55.txt
│ │ ├── Assignment-56.txt
│ │ ├── Assignment-57.txt
│ │ ├── Assignment-58.txt
│ │ ├── Exercise-23.txt
│ │ ├── Exercise-24.txt
│ │ ├── Exercise-25.txt
│ │ ├── Exercise-26.txt
│ │ ├── Exercise-27.txt
│ │ ├── Exercise-28.txt
│ │ ├── Exercise-29.txt
│ │ ├── Exercise-30.txt
│ │ ├── Exercise-31.txt
│ │ ├── Exercise-32.txt
│ │ ├── Exercise-33.txt
│ │ ├── Exercise-34.txt
│ │ ├── Exercise-35.txt
│ │ ├── Exercise-36.txt
│ │ ├── Exercise-37.txt
│ │ ├── Exercise-38.txt
│ │ └── Exercise-39.txt
│ ├── Day-5/
│ │ ├── Assignment-67.txt
│ │ ├── Assignment-68.txt
│ │ ├── Assignment-69.txt
│ │ ├── Assignment-70.txt
│ │ ├── Assignment-71.txt
│ │ ├── Assignment-72.txt
│ │ ├── Assignment-73.txt
│ │ ├── Assignment-74.txt
│ │ ├── Assignment-75.txt
│ │ ├── Assignment-76.txt
│ │ ├── Assignment-77.txt
│ │ ├── Assignment-78.txt
│ │ ├── Assignment-79.txt
│ │ ├── Assignment-80.txt
│ │ ├── Assignment-81.txt
│ │ ├── Assignment-82.txt
│ │ ├── Assignment-83.txt
│ │ ├── Assignment-84.txt
│ │ ├── Assignment-85.txt
│ │ ├── Exercise-40.txt
│ │ ├── Exercise-41.txt
│ │ ├── Exercise-42.txt
│ │ ├── Exercise-43.txt
│ │ ├── Exercise-44.txt
│ │ ├── Exercise-45.txt
│ │ ├── Exercise-46.txt
│ │ ├── Exercise-47.txt
│ │ ├── Exercise-48.txt
│ │ ├── Exercise-49.txt
│ │ ├── Exercise-50.txt
│ │ ├── Exercise-51.txt
│ │ ├── Exercise-52.txt
│ │ ├── Exercise-53.txt
│ │ ├── Exercise-54.txt
│ │ ├── Exercise-55.txt
│ │ ├── Exercise-56.txt
│ │ ├── Exercise-57.txt
│ │ ├── Exercise-58.txt
│ │ ├── Practice-1 Self Join.txt
│ │ ├── Practice-2 Outer Join.txt
│ │ └── readme.md
│ └── Day-6/
│ ├── Assignment-100.txt
│ ├── Assignment-102.txt
│ ├── Assignment-103.txt
│ ├── Assignment-104.txt
│ ├── Assignment-105.txt
│ ├── Assignment-106.txt
│ ├── Assignment-93.txt
│ ├── Assignment-94.txt
│ ├── Assignment-95.txt
│ ├── Assignment-96.txt
│ ├── Assignment-98.txt
│ ├── Assignment-99.txt
│ ├── Exercise-59.txt
│ ├── Exercise-60.txt
│ ├── Exercise-61.txt
│ ├── Exercise-62.txt
│ ├── Exercise-63.txt
│ ├── Exercise-64.txt
│ ├── Exercise-65.txt
│ ├── Exercise-66.txt
│ └── readme.md
├── DSA in Python/
│ ├── Day-1/
│ │ ├── Assignment 1.txt
│ │ ├── Assignment 2.txt
│ │ ├── Assignment 3.txt
│ │ └── Assignment 4.txt
│ ├── Day-2/
│ │ ├── Assignment 10.txt
│ │ ├── Assignment 5.txt
│ │ ├── Assignment 6.txt
│ │ ├── Assignment 7.txt
│ │ ├── Assignment 8.txt
│ │ └── Assignment 9.txt
│ ├── Day-3/
│ │ ├── Assignment-11.py
│ │ ├── Assignment-13.py
│ │ ├── Assignment-14.py
│ │ └── Assignment-15.py
│ ├── Day-4/
│ │ ├── Assignment-16.py
│ │ ├── Assignment-17.txt
│ │ ├── Assignment-18.txt
│ │ └── Assignment-19.txt
│ ├── Day-5/
│ │ ├── Assignment-20.py
│ │ ├── Assignment-21.py
│ │ ├── Assignment-22.py
│ │ ├── Assignment-23.py
│ │ ├── Exercise-17.py
│ │ ├── Exercise-18.py
│ │ ├── Exercise-19_SELECTION-SORT-ALGO.py
│ │ ├── Exercise-20_BUBBLE-SORT-ALGO.py
│ │ ├── Exercise-21_MERGE-SORT-ALGO.py
│ │ ├── Exercise-22.py
│ │ └── Exercise-23.py
│ └── Day-6/
│ ├── Exercise-24.py
│ └── Exercise-25.py
├── OOP in Python/
│ ├── Day-1/
│ │ ├── Assignment-1.txt
│ │ ├── Assignment-2.txt
│ │ ├── assignment-3.py
│ │ ├── assignment-4.py
│ │ ├── assignment-8.py
│ │ └── assignment-9.py
│ ├── Day-2/
│ │ ├── assignment-10.py
│ │ ├── assignment-11.py
│ │ └── assignment-12.py
│ ├── Day-3/
│ │ ├── Assignment-19.txt
│ │ ├── Assignment-20.txt
│ │ ├── Assignment-21.txt
│ │ ├── assignment-15.py
│ │ ├── assignment-16.py
│ │ ├── assignment-17.py
│ │ └── assignment-18.py
│ ├── Day-4/
│ │ ├── Assignment-24.py
│ │ ├── Assignment-25.py
│ │ └── Assignment-27.py
│ └── Day-5/
│ ├── Assignment-29.py
│ ├── Assignment-30.py
│ └── Assignment-31.py
├── Programming in Python/
│ ├── Day-2/
│ │ ├── PF-Assgn-15.py
│ │ ├── PF-Assgn-16.py
│ │ ├── PF-Assgn-17.py
│ │ ├── PF-Assgn-18.py
│ │ ├── PF-Assgn-19.py
│ │ ├── PF-Assgn-20.py
│ │ └── PF-Assgn-21.py
│ ├── Day-3/
│ │ ├── PF-Assgn-22.py
│ │ ├── PF-Assgn-23.py
│ │ ├── PF-Assgn-24.py
│ │ ├── PF-Assgn-26.py
│ │ ├── PF-Assgn-27.py
│ │ └── PF-Assgn-28.py
│ ├── Day-4/
│ │ ├── PF-Assgn-29.py
│ │ ├── PF-Assgn-30.py
│ │ ├── PF-Assgn-31.py
│ │ ├── PF-Assgn-32.py
│ │ └── PF-Assgn-33.py
│ ├── Day-5/
│ │ ├── PF-Assgn-3.py
│ │ ├── PF-Assgn-34.py
│ │ ├── PF-Assgn-35.py
│ │ ├── PF-Assgn-36.py
│ │ ├── PF-Assgn-37.py
│ │ ├── PF-Assgn-38.py
│ │ └── PF-Assgn-39.py
│ ├── Day-6/
│ │ ├── PF-Assgn-40.py
│ │ ├── PF-Assgn-41.py
│ │ ├── PF-Assgn-42.py
│ │ ├── PF-Assgn-43.py
│ │ └── PF-Assgn-44.py
│ ├── Day-7/
│ │ ├── PF-Assgn-46.py
│ │ ├── PF-Assgn-47.py
│ │ ├── PF-Assgn-48.py
│ │ ├── PF-Assgn-49.py
│ │ ├── PF-Assgn-50.py
│ │ └── PF-Assgn-51.py
│ └── Day-8/
│ ├── PF-Assgn-52.py
│ ├── PF-Assgn-53.py
│ ├── PF-Assgn-53_1.py
│ ├── PF-Assgn-54.py
│ └── PF-Assgn-56.py
├── README.md
└── _config.yml
================================================
FILE CONTENTS
================================================
================================================
FILE: .github/workflows/greetings.yml
================================================
name: Greetings
on: [pull_request, issues]
jobs:
greeting:
runs-on: ubuntu-latest
steps:
- uses: actions/first-interaction@v1
with:
repo-token: ${{ secrets.GITHUB_TOKEN }}
issue-message: 'Message that will be displayed on users'' first issue'
pr-message: 'Message that will be displayed on users'' first pr'
================================================
FILE: DBMS/Day-2/Assignment-10.txt
================================================
ALTER TABLE Supplier DROP (Emailid)
================================================
FILE: DBMS/Day-2/Assignment-11.txt
================================================
CREATE TABLE City(
City VARCHAR2(20) UNIQUE
);
================================================
FILE: DBMS/Day-2/Assignment-12.txt
================================================
ALTER TABLE CITY DROP(CITY);
or you can also do:
ALTER TABLE CITY DROP COLUMN CITY;
================================================
FILE: DBMS/Day-2/Assignment-13.txt
================================================
CREATE TABLE Address(
HouseNo NUMBER,
Street VARCHAR2(30),
city VARCHAR2(20) REFERENCES City(city),
zip NUMBER(6) CHECK(zip>=0),
State VARCHAR2(5),
CONSTRAINT address_pk PRIMARY KEY(HouseNo, Street, City)
);
================================================
FILE: DBMS/Day-2/Assignment-14.txt
================================================
ALTER TABLE Address MODIFY state VARCHAR2(20)
================================================
FILE: DBMS/Day-2/Assignment-2.txt
================================================
CREATE TABLE Shopper(
Shopperid INTEGER PRIMARY KEY,
ShopperName VARCHAR2(20) NOT NULL,
Gender CHAR(6) CHECK(GENDER IN ('Male', 'Female')),
MobileNo NUMBER NOT NULL,
Address VARCHAR2(50)
)
================================================
FILE: DBMS/Day-2/Assignment-3.txt
================================================
ALTER TABLE Shopper MODIFY MobileNo VARCHAR2(15)
================================================
FILE: DBMS/Day-2/Assignment-4.txt
================================================
CREATE TABLE Article(
ArCode CHAR(5) CONSTRAINT arcode_article_pk PRIMARY KEY,
CHECK(ArCode LIKE 'A%'),
ArName VARCHAR2(30) CONSTRAINT article_name NOT NULL,
Rate NUMBER(8,2),
Quantity NUMBER(4) DEFAULT 0,
CHECK(Quantity >=0),
Class CHAR(1) CONSTRAINT Artice_class_ch CHECK(Class IN('A', 'B', 'C'))
)
================================================
FILE: DBMS/Day-2/Assignment-5.txt
================================================
CREATE TABLE Store(
Name VARCHAR2(20) PRIMARY KEY,
Location VARCHAR2(30) NOT NULL,
ManagerName VARCHAR2(30) UNIQUE
)
You can also check the schema of the table using the following commandl:
describe Store
================================================
FILE: DBMS/Day-2/Assignment-6.txt
================================================
ALTER TABLE Store RENAME COLUMN NAME TO STORENAME
================================================
FILE: DBMS/Day-2/Assignment-7.txt
================================================
CREATE TABLE Bill(
BillNo NUMBER PRIMARY KEY,
StoreName VARCHAR2(20) REFERENCES Store(StoreName),
Shopperid NUMBER REFERENCES Shopper(ShopperId),
ArCode CHAR(5) REFERENCES Article(ArCode),
Amount NUMBER,
BillDate DATE,
Quantity NUMBER(4) DEFAULT 1 CHECK(Quantity>0)
);
================================================
FILE: DBMS/Day-2/Assignment-8.txt
================================================
CREATE TABLE Supplier(
Supplierid VARCHAR2(6) PRIMARY KEY,
Name VARCHAR2(30),
ContactNo VARCHAR2(15) NOT NULL,
Emailid VARCHAR2(30)
);
================================================
FILE: DBMS/Day-2/Assignment-9.txt
================================================
ALTER TABLE Supplier ADD City VARCHAR2(10)
================================================
FILE: DBMS/Day-2/Exercise-3.txt
================================================
CREATE TABLE Player (
PId INTEGER CONSTRAINT player_pid_pk PRIMARY KEY,
PName VARCHAR2(20) CONSTRAINT player_pname NOT NULL,
Ranking INTEGER
)
================================================
FILE: DBMS/Day-2/Exercise-4.txt
================================================
CREATE TABLE Tournament(
TId INTEGER PRIMARY KEY,
TName VARCHAR2(30) NOT NULL,
StartDt DATE NOT NULL,
EndDt DATE NOT NULL,
Prize INTEGER NOT NULL
)
================================================
FILE: DBMS/Day-2/Exercise-5.txt
================================================
CREATE TABLE Match(
MId INTEGER,
TId INTEGER REFERENCES Tournament(TId), PRIMARY KEY(MId, TId),
Player1 INTEGER REFERENCES Player(PId),
Player2 INTEGER REFERENCES Player(PId),
MatchDt DATE NOT NULL,
Winner INTEGER REFERENCES Player(PId),
Score VARCHAR2(30) NOT NULL,
CONSTRAINT playler_id_ck CHECK(Player1 <> Player2)
)
================================================
FILE: DBMS/Day-2/Exercise-6.txt
================================================
ALTER TABLE Player ADD(
MatchesPlayed NUMBER,
MatchesWon NUMBER
)
================================================
FILE: DBMS/Day-2/Exercise-7.txt
================================================
ALTER TABLE Player DROP(ContactNo)
================================================
FILE: DBMS/Day-2/Exercise-8.txt
================================================
ALTER TABLE Player RENAME COLUMN PId TO PlayerId
================================================
FILE: DBMS/Day-2/Exercise-9.txt
================================================
ALTER TABLE Player MODIFY PName VARCHAR(50)
================================================
FILE: DBMS/Day-3/Assignment-15.txt
================================================
Actual Answer should be:
INSERT INTO Shopper
(ShopperId, ShopperName, Gender, MobileNo, Address)
VALUES
(101, 'Mark Jane', 'M', 1234567890, 'Allen Street, New York')
But we get a 'Check Constaint' Error:
Check can be applied on Gender, hence we change its data.
INSERT INTO Shopper
(ShopperId, ShopperName, Gender, MobileNo, Address)
VALUES
(101, 'Mark Jane', 'Male', 1234567890, 'Allen Street, New York')
================================================
FILE: DBMS/Day-3/Assignment-16.txt
================================================
INSERT INTO Article VALUES('A1001', 'Mouse', 500, 0, 'C')
================================================
FILE: DBMS/Day-3/Assignment-17.txt
================================================
INSERT INTO Store VALUES('Loyal World', 'Infy Campus, Mysore', 'Rohan Kumar')
================================================
FILE: DBMS/Day-3/Assignment-18.txt
================================================
INSERT INTO Bill
VALUES
(1001, 'Loyal World', 101, 'A1001', 1000, '20-OCT-15', 2)
;
Here Article Code - 'A1002' is not present in Article Table.
Hence we get Constraint Error - Parent Key not found.
================================================
FILE: DBMS/Day-3/Assignment-19.txt
================================================
INSERT INTO Supplier VALUES
('S501', 'Avaya Ltd', 9012345678,'Mysore')
================================================
FILE: DBMS/Day-3/Assignment-20.txt
================================================
SELECT DESCR, PRICE FROM ITEM WHERE DESCR LIKE '%Hard disk%'
================================================
FILE: DBMS/Day-3/Assignment-21.txt
================================================
Method - 1:
SELECT * FROM Quotation WHERE QSTATUS IN ('Rejected','Closed')
OR
Method - 2:
SELECT * FROM Quotation WHERE QSTATUS <> 'Accepted'
OR
Method - 3:
SELECT * FROM Quotation WHERE QSTATUS='Rejected' OR QSTATUS='Closed'
================================================
FILE: DBMS/Day-3/Assignment-22.txt
================================================
SELECT DESIGNATION, SALARY FROM EmpDetails WHERE DESIGNATION IN ('Manager','Billing Staff')
================================================
FILE: DBMS/Day-3/Assignment-23.txt
================================================
SELECT ROId, Location FROM RetailOutlet WHERE Managerid IS NULL
================================================
FILE: DBMS/Day-3/Assignment-24.txt
================================================
SELECT OrderId, QuotationId, Status FROM Orders WHERE OrderDate BETWEEN '1-DEC-2014' AND '1-JAN-2015'
================================================
FILE: DBMS/Day-3/Assignment-25.txt
================================================
Method 1:
Here, output matches but it has Logical Errors
SELECT ItemCode, Descr, Price FROM Item WHERE
Descr LIKE '%Shirt%'
OR
Descr LIKE '%Skirt%'
AND
Category='B'
Method - 2:
Matches Exactly
Reason: This is an optimized query because we are searching from a small list of items filtered using Category first and then Descr.
SELECT ItemCode, Descr, Price FROM Item WHERE
Category='B' AND
Descr LIKE '%Shirt%'
OR
Descr LIKE '%Skirt%'
================================================
FILE: DBMS/Day-3/Assignment-26.txt
================================================
SELECT DISTINCT DESIGNATION, SALARY FROM EmpDetails
================================================
FILE: DBMS/Day-3/Assignment-27.txt
================================================
SELECT ITEMCODE, DESCR, PRICE FROM ITEM
================================================
FILE: DBMS/Day-3/Assignment-28.txt
================================================
SELECT QUOTATIONID, SNAME FROM Quotation WHERE QSTATUS in ('Accepted','Rejected')
================================================
FILE: DBMS/Day-3/Assignment-29.txt
================================================
SELECT Itemcode, descr, price FROM Item WHERE DESCR LIKE '_r%'
================================================
FILE: DBMS/Day-3/Assignment-30.txt
================================================
SELECT DISTINCT ITEMTYPE FROM ITEM
================================================
FILE: DBMS/Day-3/Assignment-31.txt
================================================
SELECT orderid, quotationid, status, pymtdate FROM Orders WHERE pymtdate IS NULL
================================================
FILE: DBMS/Day-3/Assignment-32.txt
================================================
SELECT DISTINCT ITEMTYPE, CATEGORY FROM ITEM
================================================
FILE: DBMS/Day-3/Assignment-33.txt
================================================
SELECT
EMPID,
Salary AS "Current Salary",
Salary*1.10 AS "New Salary",
Salary*0.1 AS "Incremented Amount"
FROM EmpDetails
================================================
FILE: DBMS/Day-3/Assignment-34.txt
================================================
INSERT INTO City VALUES('Mysore')
================================================
FILE: DBMS/Day-3/Assignment-35.txt
================================================
INSERT INTO Address VALUES
(350,'Electronics City','Mysore',570018,'Karnataka')
================================================
FILE: DBMS/Day-3/Assignment-36.txt
================================================
INSERT INTO Article VALUES
('A1002','Keyboard',1000,10,'B')
================================================
FILE: DBMS/Day-3/Assignment-37.txt
================================================
SELECT quotationid, qdate, quotedprice FROM Quotation WHERE quotedprice>1400 AND quotedprice<2150
================================================
FILE: DBMS/Day-3/Assignment-38.txt
================================================
SELECT itemtype, descr, price FROM Item WHERE price > 4000
================================================
FILE: DBMS/Day-3/Assignment-39.txt
================================================
SELECT designation, salary FROM EmpDetails WHERE designation IN ('Manager', 'Billing Staff') AND salary BETWEEN 2500 AND 5000
================================================
FILE: DBMS/Day-3/Exercise-10.txt
================================================
INSERT INTO Salesman
(SId, SName, Location)
VALUES
(11, 'Elizabeth', 'London')
================================================
FILE: DBMS/Day-3/Exercise-11.txt
================================================
INSERT INTO Product VALUES
(110, 'Bat', 50, 'Sports', NULL)
================================================
FILE: DBMS/Day-3/Exercise-12.txt
================================================
SELECT * FROM Product
================================================
FILE: DBMS/Day-3/Exercise-13.txt
================================================
SELECT Prodid, price, category from Product
================================================
FILE: DBMS/Day-3/Exercise-14.txt
================================================
SELECT DISTINCT Category FROM Product
================================================
FILE: DBMS/Day-3/Exercise-15.txt
================================================
SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE CATEGORY='Apparel'
================================================
FILE: DBMS/Day-3/Exercise-16.txt
================================================
SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM Product WHERE PDESC IS NULL
================================================
FILE: DBMS/Day-3/Exercise-17.txt
================================================
SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM Product WHERE CATEGORY='Apparel' AND DISCOUNT>5
================================================
FILE: DBMS/Day-3/Exercise-18.txt
================================================
UPDATE Product SET DISCOUNT = 25 WHERE CATEGORY='Sports'
================================================
FILE: DBMS/Day-3/Exercise-19.txt
================================================
UPDATE Product SET PRICE=50 WHERE PDESC='Trouser' AND CATEGORY='Apparel'
================================================
FILE: DBMS/Day-3/Exercise-20.txt
================================================
UPDATE Salesman SET SNAME='Jenny', LOCATION='Bristol' WHERE SID=3
================================================
FILE: DBMS/Day-3/Exercise-21.txt
================================================
DELETE FROM SaleDetail WHERE SaleId = 1004
================================================
FILE: DBMS/Day-3/Exercise-22.txt
================================================
DELETE FROM SaleDetail WHERE QUANTITY>5
================================================
FILE: DBMS/Day-4/Assignment-40.txt
================================================
SELECT DISTINCT ITEMTYPE,
CASE
WHEN PRICE BETWEEN 0 AND 499 THEN 'Cheap'
WHEN PRICE BETWEEN 500 AND 1999 THEN 'Affordable'
WHEN PRICE BETWEEN 2000 AND 4999 THEN 'Expensive'
WHEN PRICE>=500 THEN 'Very Expensive'
END AS CLASSIFICATION
FROM ITEM ORDER BY ITEMTYPE
================================================
FILE: DBMS/Day-4/Assignment-41.txt
================================================
SELECT TO_CHAR(QDATE, 'Month') MONTH, COUNT(QUOTATIONID)QUOTATIONCOUNT FROM QUOTATION GROUP BY TO_CHAR(QDATE, 'Month')
================================================
FILE: DBMS/Day-4/Assignment-42.txt
================================================
SELECT ORDERID, ROUND(MONTHS_BETWEEN(PYMTDATE, ORDERDATE),2) "No of Months" FROM ORDERS WHERE ROUND(MONTHS_BETWEEN(PYMTDATE, ORDERDATE),2)>0.1 AND STATUS='Delivered';
================================================
FILE: DBMS/Day-4/Assignment-43.txt
================================================
SELECT EMPID, SALARY "Current Salary", ROUND(SALARY*1.2,2) "New Salary", SALARY*0.2 "Incremented Amount" FROM EmpDetails WHERE Designation='Manager'
================================================
FILE: DBMS/Day-4/Assignment-44.txt
================================================
SELECT ITEMCODE FROM ITEM WHERE ABS(QTYONHAND - REORDERLEVEL)>50
================================================
FILE: DBMS/Day-4/Assignment-45.txt
================================================
SELECT ITEMCODE, AVG(QTYAVAILABLE) "Average Quantity" FROM RETAILSTOCK GROUP BY ITEMCODE HAVING AVG(QTYAVAILABLE)<75
================================================
FILE: DBMS/Day-4/Assignment-46.txt
================================================
SELECT PYMTMODE, COUNT(*) PYMTCOUNT FROM ORDERS WHERE TO_CHAR(PYMTDATE, 'YYYY')<'2015' GROUP BY PYMTMODE HAVING COUNT(*)>1
================================================
FILE: DBMS/Day-4/Assignment-47.txt
================================================
SELECT SNAME, AVG(QUOTEDPRICE) "Average quoted price" FROM QUOTATION WHERE QSTATUS='Closed' GROUP BY SNAME HAVING AVG(QUOTEDPRICE)>500
================================================
FILE: DBMS/Day-4/Assignment-48.txt
================================================
SELECT ITEMTYPE, CATEGORY, ROUND(AVG(PRICE),2) "AVG_PRICE" FROM ITEM WHERE ITEMTYPE IN ('FMCG','Computer') GROUP BY CATEGORY, ITEMTYPE HAVING ROUND(AVG(PRICE),2) < 2000;
================================================
FILE: DBMS/Day-4/Assignment-49.txt
================================================
SELECT JOB, AVG(SAL) "Average Salary" FROM EMP WHERE JOB IN ('MANAGER', 'ANALYST') GROUP BY JOB HAVING AVG(SAL)>1500
================================================
FILE: DBMS/Day-4/Assignment-50.txt
================================================
SELECT JOB, DEPTNO, AVG(SAL) AS "AVGSALARY" FROM EMP WHERE DEPTNO IN (10,20) AND SAL>2000 GROUP BY JOB, DEPTNO HAVING AVG(SAL)>2500
================================================
FILE: DBMS/Day-4/Assignment-51.txt
================================================
SELECT EMPID, EMPNAME, SALARY,
CASE DESIGNATION
WHEN 'Administrator' THEN SALARY * 1.10
WHEN 'Manager' THEN SALARY * 1.05
WHEN 'Billing Staff' THEN SALARY * 1.2
WHEN 'Security' THEN SALARY * 1.25
ELSE SALARY * 1.02
END "increased salary"
FROM EmpDetails
================================================
FILE: DBMS/Day-4/Assignment-52
================================================
SELECT Empid,Salary,
CASE
WHEN Salary > 5000 THEN 'Class 1'
WHEN Salary BETWEEN 2500 AND 5000 THEN 'Class 2'
WHEN Salary <2500 THEN 'Class 3'
END SALGRADE
FROM Empdetails;
================================================
FILE: DBMS/Day-4/Assignment-55.txt
================================================
SELECT ORDERID "ORDER ID", STATUS "ORDER STATUS",
CASE
WHEN PYMTMODE IS NULL THEN 'Payment yet not done'
ELSE PYMTMODE
END "PAYMENT MODE"
FROM ORDERS
================================================
FILE: DBMS/Day-4/Assignment-56.txt
================================================
SELECT DESCR FROM ITEM WHERE LENGTH(DESCR)>15
================================================
FILE: DBMS/Day-4/Assignment-57.txt
================================================
SELECT SUBSTR(ROID,2) AS "Numeric Part" FROM RETAILSTOCK GROUP BY ROID
================================================
FILE: DBMS/Day-4/Assignment-58.txt
================================================
SELECT TO_CHAR(SYSDATE,'Mon/dd/yyyy Day') AS CURRENTDATE FROM DUAL
================================================
FILE: DBMS/Day-4/Exercise-23.txt
================================================
SELECT PRODID, PDESC, CATEGORY FROM Product WHERE UPPER(Category)='ELECTRONICS'
================================================
FILE: DBMS/Day-4/Exercise-24.txt
================================================
SELECT PRODID, SUBSTR(PDESC, 1,5) PDESC_FIVE, CATEGORY FROM Product
================================================
FILE: DBMS/Day-4/Exercise-25.txt
================================================
SELECT COUNT(SALEID) SALE_COUNT FROM Sale WHERE MONTHS_BETWEEN(SYSDATE, SLDATE)<=60
We consider 60 because there are no rows that has value for the last 40 months starting from 2019.
Will work as required if the current year had been 2017-2018.
================================================
FILE: DBMS/Day-4/Exercise-26.txt
================================================
SELECT NVL(PDESC, 'No Description') PDESC, DISCOUNT FROM Product
There is no Expected Result given for the question.
================================================
FILE: DBMS/Day-4/Exercise-27.txt
================================================
SELECT PRODID, CATEGORY, PRICE, DISCOUNT FROM Product ORDER BY CATEGORY DESC, PRICE
================================================
FILE: DBMS/Day-4/Exercise-28.txt
================================================
SELECT PRODID, CATEGORY, DISCOUNT FROM Product WHERE CATEGORY IN ('Sports', 'Apparel') ORDER BY CATEGORY, DISCOUNT
================================================
FILE: DBMS/Day-4/Exercise-29.txt
================================================
Both the queries are same, but the resultant outputs(order) is different.
Required Output:
SELECT TO_CHAR(SLDATE, 'Month') AS MONTH, COUNT(*) AS NUMBER_SALE FROM SALE GROUP BY TO_CHAR(SLDATE, 'Month') ORDER BY COUNT(*) DESC
Output values are same but order is different:
SELECT TO_CHAR(SLDATE, 'MONTH') AS MONTH, COUNT(*) AS NUMBER_SALE FROM SALE GROUP BY TO_CHAR(SLDATE, 'MONTH') ORDER BY COUNT(*) DESC
================================================
FILE: DBMS/Day-4/Exercise-30.txt
================================================
SELECT PRODID, SUM(QUANTITY) QTY_SOLD FROM SALEDETAIL WHERE QUANTITY>1 GROUP BY PRODID HAVING COUNT(*)>1
================================================
FILE: DBMS/Day-4/Exercise-31.txt
================================================
SELECT PRODID, PDESC, PRICE AS "Old_Price", ROUND(PRICE*0.775,2) AS "New_Price" FROM Product WHERE CATEGORY='Sports'
================================================
FILE: DBMS/Day-4/Exercise-32.txt
================================================
SELECT SALEID, ROUND(MONTHS_BETWEEN(SYSDATE,SLDATE),1) AS "MONTH_AGED" FROM Sale
================================================
FILE: DBMS/Day-4/Exercise-33.txt
================================================
SELECT ROUND(AVG(PRICE), 2) "Avg", MIN(PRICE) "Min", MAX(PRICE) "Max", COUNT(PRODID) "Total" FROM Product
================================================
FILE: DBMS/Day-4/Exercise-34.txt
================================================
METHOD 1:
SELECT SNAME||' is from ' ||Location AS "RESULT" FROM SalesMan
METHOD 2:
SELECT CONCAT(SNAME,CONCAT(' is from ', LOCATION)) "RESULT" FROM SalesMan
================================================
FILE: DBMS/Day-4/Exercise-35.txt
================================================
SELECT TO_CHAR(TO_DATE('Jan/10/2015', 'MON/DD/YYYY'), 'Month') MONTH, TO_NUMBER('2,50,000', '9,99,999') AMOUNT FROM DUAL
================================================
FILE: DBMS/Day-4/Exercise-36.txt
================================================
SELECT PRODID, PDESC, PRICE FROM Product ORDER BY PRICE DESC, PRODID DESC
================================================
FILE: DBMS/Day-4/Exercise-37.txt
================================================
SELECT PRODID, PDESC, PRICE FROM Product ORDER BY PDESC
================================================
FILE: DBMS/Day-4/Exercise-38.txt
================================================
SELECT LOCATION, COUNT(SID) "NUMBER_SMAN" FROM Salesman GROUP BY LOCATION
================================================
FILE: DBMS/Day-4/Exercise-39.txt
================================================
SELECT CATEGORY FROM PRODUCT GROUP BY (CATEGORY) HAVING COUNT(PRODID) > 1
================================================
FILE: DBMS/Day-5/Assignment-67.txt
================================================
SELECT E.ENAME, E.SAL, D.DNAME
FROM EMP E INNER JOIN DEPT D
ON E.DEPTNO=D.DEPTNO AND E.SAL>2000
================================================
FILE: DBMS/Day-5/Assignment-68.txt
================================================
SELECT E.ENAME, D.DNAME
FROM EMP E INNER JOIN DEPT D
ON E.DEPTNO=D.DEPTNO AND E.JOB='MANAGER'
================================================
FILE: DBMS/Day-5/Assignment-69.txt
================================================
SELECT D.DNAME
FROM EMP E, DEPT D
WHERE D.DEPTNO = E.DEPTNO AND SAL>1500
GROUP BY D.DNAME HAVING COUNT(*)>1
================================================
FILE: DBMS/Day-5/Assignment-70.txt
================================================
Step 1: Fetch all the employee no's (including NULL) an their vehicle ids
SELECT E.EMPNO, EV.VEHICLEID FROM EMP E
LEFT OUTER JOIN EMPVEHICLE EV
ON E.EMPNO = EV.EMPNO
Step 2: fetch all the vehicle names from the vehcile no's
SELECT E.ENAME, V.VEHICLENAME FROM EMP E
LEFT OUTER JOIN EMPVEHICLE EV
ON E.EMPNO = EV.EMPNO
LEFT OUTER JOIN VEHICLE V
ON EV.VEHICLEID = V.VEHICLEID
================================================
FILE: DBMS/Day-5/Assignment-71.txt
================================================
SELECT I.ITEMCODE, I.DESCR, Q.SNAME
FROM ITEM I INNER JOIN QUOTATION Q
ON I.ITEMCODE = Q.ITEMCODE
================================================
FILE: DBMS/Day-5/Assignment-72.txt
================================================
SELECT C.CUSTID "Customer Id", C.CUSTNAME "Customer Name"
FROM CUSTOMER C INNER JOIN EMPDETAILS E
ON C.CUSTNAME=E.EMPNAME AND C.EMAILID=E.EMAILID
================================================
FILE: DBMS/Day-5/Assignment-73.txt
================================================
SELECT I.ITEMCODE, I.DESCR, I.CATEGORY, Q.QUOTEDPRICE
FROM ITEM I INNER JOIN QUOTATION Q
ON I.ITEMCODE=Q.ITEMCODE WHERE Q.QSTATUS = 'Accepted'
================================================
FILE: DBMS/Day-5/Assignment-74.txt
================================================
SELECT R1.ROID, I.DESCR, I.ITEMTYPE, R2.UNITPRICE
FROM ITEM I,RETAILOUTLET R1,RETAILSTOCK R2
WHERE I.ITEMCODE=R2.ITEMCODE AND R1.ROID=R2.ROID AND R2.UNITPRICE>1500
================================================
FILE: DBMS/Day-5/Assignment-75.txt
================================================
SELECT Q.ITEMCODE, Q.SNAME, SUM(O.QTYORDERED) TOTALQUANTITY
FROM QUOTATIOn Q, ORDERS O
WHERE Q.QUOTATIONID=O.QUOTATIONID
GROUP BY Q.ITEMCODE,Q.SNAME
HAVING SUM(O.QTYORDERED) >=100
================================================
FILE: DBMS/Day-5/Assignment-76.txt
================================================
SELECT I.ITEMCODE, I.DESCR
FROM ITEM I,QUOTATION Q
WHERE I.ITEMCODE=Q.ITEMCODE
AND I.PRICE=Q.QUOTEDPRICE
GROUP BY I.ITEMCODE, I.DESCR
HAVING COUNT(*)>1
================================================
FILE: DBMS/Day-5/Assignment-77.txt
================================================
SELECT Q.SNAME, Q.QUOTATIONID
FROM QUOTATION Q, ORDERS O
WHERE Q.QUOTATIONID=O.QUOTATIONID
AND O.DELIVEREDDATE-O.ORDERDATE<=5
================================================
FILE: DBMS/Day-5/Assignment-78.txt
================================================
SELECT NVL(E.EMPNAME,'No Manager') EMPNAME, I.CATEGORY, SUM(R2.QTYAVAILABLE) TOTALQUANTITY
FROM RETAILOUTLET R1 INNER JOIN RETAILSTOCK R2 ON R1.ROID=R2.ROID
LEFT OUTER JOIN EMPDETAILS E
ON R1.MANAGERID=E.EMPID
INNER JOIN ITEM I
ON I.ITEMCODE=R2.ITEMCODE
GROUP BY E.EMPNAME, I.CATEGORY
================================================
FILE: DBMS/Day-5/Assignment-79.txt
================================================
Step 1: Fetch Locations, customer types and quantity
SELECT R1.LOCATION, C.CUSTTYPE, P.QUANTITY
FROM RETAILOUTLET R1, PURCHASEBILL P, CUSTOMER C
WHERE R1.ROID=P.ROID AND C.CUSTID=P.CUSTID
Step 2: Group data together as per location and customer type
SELECT R1.LOCATION, C.CUSTTYPE, SUM(P.QUANTITY)
FROM RETAILOUTLET R1, PURCHASEBILL P, CUSTOMER C
WHERE R1.ROID=P.ROID AND C.CUSTID=P.CUSTID
GROUP BY R1.LOCATION, C.CUSTTYPE
Step 3: Apply Filters
SELECT R1.LOCATION, C.CUSTTYPE, SUM(P.QUANTITY) TOTALQUANTITY
FROM RETAILOUTLET R1, PURCHASEBILL P, CUSTOMER C, ITEM I
WHERE R1.ROID=P.ROID
AND C.CUSTID=P.CUSTID
AND I.ITEMCODE=P.ITEMCODE
AND C.GENDER='M'
AND I.ITEMTYPE IN ('Apparels','Computer')
GROUP BY R1.LOCATION, C.CUSTTYPE
================================================
FILE: DBMS/Day-5/Assignment-80.txt
================================================
Important: Given -> all items of type 'FMCG'
For this, we will fetch all the items belonging to type 'FMCG' and apply left outer join.
SELECT I.ITEMCODE, I.DESCR, P.BILLAMOUNT
FROM ITEM I LEFT OUTER JOIN PURCHASEBILL P
ON I.ITEMCODE=P.ITEMCODE
WHERE ITEMTYPE='FMCG'
Final Query:
SELECT I.ITEMCODE, I.DESCR, NVL(P.BILLAMOUNT,0) BILLAMOUNT, NVL(C.CUSTID,0) CUSTID
FROM ITEM I LEFT OUTER JOIN PURCHASEBILL P
ON I.ITEMCODE=P.ITEMCODE
LEFT OUTER JOIN CUSTOMER C
ON C.CUSTID=P.CUSTID
WHERE ITEMTYPE='FMCG'
NOTE:
This query gives partial output:
SELECT I.ITEMCODE, I.DESCR, NVL(P.BILLAMOUNT,0) BILLAMOUNT, NVL(C.CUSTID,0) CUSTID
FROM ITEM I, PURCHASEBILL P, CUSTOMER C
WHERE I.ITEMCODE=P.ITEMCODE
AND C.CUSTID=P.CUSTID
AND ITEMTYPE='FMCG'
The above query doesnot map the itemcodes with NULL values.
================================================
FILE: DBMS/Day-5/Assignment-81.txt
================================================
Important points to note:
Given:
1) For each item -> requires left outer join
2) Specific Outlet ONLY -> use AND Operator
3) If no stock display N.A. -> requires NVL()
SELECT I.ITEMCODE, I.DESCR, NVL(TO_CHAR(R.QTYAVAILABLE), 'N.A.') AS "QTYAVAILABLE"
FROM ITEM I LEFT OUTER JOIN RETAILSTOCK R
ON I.ITEMCODE=R.ITEMCODE AND R.ROID='R1001'
NVL Function doesnot accept data of different data types.
R.QTYAVAILABLE is NUMBER while 'N.A.' is char datatype.
Hence we convert using TO_CHAR(R.QTYAVAILABLE) and use NVL(TO_CHAR(R.QTYAVAILABLE), 'N.A.')
================================================
FILE: DBMS/Day-5/Assignment-82.txt
================================================
Given:
1) details of retailoutlet should be displayed even if no employee is working in it -> indicating Left outer join
SELECT E.EMPID, E.EMPNAME, R.ROID, R.LOCATION
FROM RETAILOUTLET R LEFT OUTER JOIN EMPDETAILS E
ON R.ROID=E.WORKSIN
================================================
FILE: DBMS/Day-5/Assignment-83.txt
================================================
Given,
1) ..of those employees who work in same retail outlet where George works... -> Self join
2) Do not display George in result -> operator: <>
SELECT E1.EMPNAME, E1.DESIGNATION, E1.EMAILID
FROM EMPDETAILS E1 INNER JOIN EMPDETAILS E2
ON E1.WORKSIN=E2.WORKSIN
WHERE E2.EMPNAME='George'
AND E1.EMPNAME <> 'George'
E1 should be the final output table that doesnot contain the name 'George'
To fetch the retail outlet where George works we take another similar table E2 with only one tuple of George
and match it with the worksin with other employees.
================================================
FILE: DBMS/Day-5/Assignment-84.txt
================================================
SELECT C1.CUSTID, C1.CUSTNAME
FROM CUSTOMER C1 INNER JOIN CUSTOMER C2
ON C1.CUSTID <> C2.CUSTID
WHERE C1.ADDRESS=C2.ADDRESS
ORDER BY C1.ADDRESS
================================================
FILE: DBMS/Day-5/Assignment-85.txt
================================================
SELECT C.CUSTNAME, P.BILLAMOUNT
FROM CUSTOMER C, PURCHASEBILL P
WHERE C.CUSTID=P.CUSTID
AND P.BILLAMOUNT>5000
Didnot solve Optional Assignments from 86 onwards.
The assignments seem similar to the previous mandatory exercises and assignments,
hence skipped them.
================================================
FILE: DBMS/Day-5/Exercise-40.txt
================================================
SELECT SID, SNAME, LOCATION FROM Salesman WHERE SNAME LIKE '%e%' AND LOCATION LIKE '%o%'
UNION ALL
SELECT SID, SNAME, LOCATION FROM Salesman WHERE SNAME LIKE '%a%' AND LOCATION LIKE '%a%'
================================================
FILE: DBMS/Day-5/Exercise-41.txt
================================================
SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE DISCOUNT<10
UNION ALL
SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE CATEGORY = 'Sports'
================================================
FILE: DBMS/Day-5/Exercise-42.txt
================================================
Method - 1:
SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE DISCOUNT<10
UNION
SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE CATEGORY = 'Sports'
Method - 2:
SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE DISCOUNT<10 OR CATEGORY = 'Sports'
================================================
FILE: DBMS/Day-5/Exercise-43.txt
================================================
SELECT 'S' TYPE , SID ID, SNAME DETAILS FROM Salesman
UNION ALL
SELECT 'P' TYPE , PRODID ID, CATEGORY DETAILS FROM Product
================================================
FILE: DBMS/Day-5/Exercise-44.txt
================================================
SELECT ID, ENAME, DEPT, E.COMPID, MAKE
FROM EMPLOYEE E INNER JOIN COMPUTER C
ON E.COMPID = C.COMPID
================================================
FILE: DBMS/Day-5/Exercise-45.txt
================================================
SELECT ID, ENAME, E.COMPID, MAKE
FROM EMPLOYEE E INNER JOIN COMPUTER c
ON E.COMPID=C.COMPID AND MODEL IN ('Precision','Edge')
================================================
FILE: DBMS/Day-5/Exercise-46.txt
================================================
SELECT DEPT, COUNT(C.COMPID) "NUMBER OF COMPUTERS"
FROM EMPLOYEE E INNER JOIN COMPUTER C
ON E.COMPID = C.COMPID AND MAKE='Dell'
GROUP BY DEPT
================================================
FILE: DBMS/Day-5/Exercise-47.txt
================================================
SELECT S1.SALEID, S1.SLDATE
FROM Sale S1, Salesman S2
WHERE S1.SID = S2.SID
AND S2.Location = 'London'
================================================
FILE: DBMS/Day-5/Exercise-48.txt
================================================
SELECT S1.SID, S1.SNAME, S1.LOCATION
FROM SALESMAN S1 INNER JOIN SALESMAN S2
ON S1.LOCATION=S2.LOCATION AND S1.SID<>S2.SID
================================================
FILE: DBMS/Day-5/Exercise-49.txt
================================================
SELECT S1.SNAME, S2.SALEID
FROM Salesman S1 FULL OUTER JOIN Sale S2
ON S1.SID=S2.SID
ORDER BY S1.SNAME DESC
================================================
FILE: DBMS/Day-5/Exercise-50.txt
================================================
Loved this Exercise! Found this the most challenging and interesting Exercise in SQL till now.
Will be a lot useful for Project.
This exercise has given good revision of my basics in JOINS, GROUP BY Function.
Estimated Time is 8 mins, however took 45 mins to resolve!
STEP 1: Fetch all the SaleId's of individual Salesman
SELECT S1.SID, S1.SNAME, S2.SALEID FROM Sale S2 INNER JOIN Salesman S1 ON S1.SID=s2.SID
STEP 2: Fetch all the ProductId's of individual SaleId's
SELECT S1.SID, S1.SNAME, S2.SALEID, S3.PRODID FROM SALE S2 INNER JOIN SALESMAN S1 ON S1.SID=s2.SID INNER JOIN SALEDETAIL S3 ON S2.SALEID=S3.SALEID ORDER BY SNAME DESC
STEP 3: Fetch the prices of all the Product Ids Obtained in Step2
SELECT S1.SID, S1.SNAME, S2.SALEID, S3.PRODID, P1.PRICE FROM SALE S2 INNER JOIN SALESMAN S1 ON S1.SID=s2.SID INNER JOIN SALEDETAIL S3 ON S2.SALEID=S3.SALEID INNER JOIN PRODUCT P1 ON S3.PRODID = P1.PRODID ORDER BY SNAME DESC
STEP 4: Group the data corresponding to each Salesman and calculate TAMOUNT using PRICE * QUANTITY
NOTE:
We get the 'Not a group by function' if we group the data only by using S1.SID or S1.NAME
We need to use all the columns present in the SELECT Statement.
Reference: https://stackoverflow.com/questions/15870331/inner-join-with-group-by-expression-in-oracle-sql
SELECT S1.SID, S1.SNAME, SUM(P1.PRICE*S3.QUANTITY) TAMOUNT
FROM SALE S2 INNER JOIN SALESMAN S1 ON S1.SID=s2.SID
INNER JOIN SALEDETAIL S3 ON S2.SALEID=S3.SALEID
INNER JOIN PRODUCT P1 ON S3.PRODID = P1.PRODID
GROUP BY S1.SID, S1.SNAME
ORDER BY SUM(P1.PRICE*S3.QUANTITY) DESC
STEP 5: Finally calculate Discount:
FINAL QUERY:
SELECT S1.SID, S1.SNAME, SUM(P1.PRICE*S3.QUANTITY) TAMOUNT, SUM((P1.PRICE*S3.QUANTITY)*P1.DISCOUNT/100) TDISCOUNT
FROM SALE S2 INNER JOIN SALESMAN S1 ON S1.SID=s2.SID
INNER JOIN SALEDETAIL S3 ON S2.SALEID=S3.SALEID
INNER JOIN PRODUCT P1 ON S3.PRODID = P1.PRODID
GROUP BY S1.SID, S1.SNAME
ORDER BY SUM(P1.PRICE*S3.QUANTITY) DESC
================================================
FILE: DBMS/Day-5/Exercise-51.txt
================================================
This is the same query which we have obtained in the previous exercise(EXERCISE 50) STEP 2:
SELECT S2.SALEID, S3.PRODID, S1.SID, S1.SNAME FROM SALE S2 INNER JOIN SALESMAN S1 ON S1.SID=s2.SID INNER JOIN SALEDETAIL S3 ON S2.SALEID=S3.SALEID ORDER BY SNAME DESC
================================================
FILE: DBMS/Day-5/Exercise-52.txt
================================================
This query is exactly similar to Exercise 50, except that we use LEFT OUTER JOIN
Further we use NVL Function to display '0' instead of NULL in the output
FINAL QUERY:
SELECT S1.SID, S1.SNAME, NVL(SUM(P1.PRICE*S3.QUANTITY),0) TAMOUNT, NVL(SUM((P1.PRICE*S3.QUANTITY)*P1.DISCOUNT/100),0) TDISCOUNT
FROM SALESMAN S1 LEFT OUTER JOIN SALE S2 ON S1.SID=s2.SID
LEFT OUTER JOIN SALEDETAIL S3 ON S2.SALEID=S3.SALEID
LEFT OUTER JOIN PRODUCT P1 ON S3.PRODID = P1.PRODID
GROUP BY S1.SID, S1.SNAME
ORDER BY SUM(P1.PRICE*S3.QUANTITY) DESC
================================================
FILE: DBMS/Day-5/Exercise-53.txt
================================================
SIMILAR TO Exercise-50 Query:
SELECT S1.LOCATION, P1.CATEGORY, SUM(S3.QUANTITY) "Total Quantity"
FROM SALE S2 INNER JOIN SALESMAN S1 ON S1.SID=s2.SID
INNER JOIN SALEDETAIL S3 ON S2.SALEID=S3.SALEID
INNER JOIN PRODUCT P1 ON S3.PRODID = P1.PRODID
GROUP BY S1.LOCATION, P1.CATEGORY
================================================
FILE: DBMS/Day-5/Exercise-54.txt
================================================
SELECT E.ENAME, E.DEPT, NVL(C.MODEL,'Not allocated') "MODEL"
FROM EMPLOYEE E LEFT OUTER JOIN COMPUTER C
ON E.COMPID=C.COMPID
================================================
FILE: DBMS/Day-5/Exercise-55.txt
================================================
SELECT E.ID, E.ENAME, E.DEPT, C.MODEL
FROM EMPLOYEE E FULL OUTER JOIN COMPUTER C
ON E.COMPID=C.COMPID
================================================
FILE: DBMS/Day-5/Exercise-56.txt
================================================
E2 Table is taken for fetching Managers. Hence E2 denotes Managers.
E1 Tables denotes employees which are not managers.
SELECT E1.ID, E1.ENAME, E2.ID MGRID, E2.ENAME MGRNAME, C1.MODEL E_MODEL, C2.MODEL M_MODEL
FROM EMPLOYEE E1 INNER JOIN EMPLOYEE E2
ON E1.MANAGER=E2.ID AND E2.COMPID IS NOT NULL
INNER JOIN COMPUTER C1 ON
C1.COMPID = E1.COMPID
INNER JOIN COMPUTER C2 ON
C2.COMPID = E2.COMPID
================================================
FILE: DBMS/Day-5/Exercise-57.txt
================================================
Method - 1:
SELECT s3.SID, S3.SNAME FROM Salesman S3
MINUS
SELECT S1.SID, S1.SNAME
FROM Salesman S1 INNER JOIN Sale S2
ON S1.SID=S2.SID GROUP BY S1.SID,S1.SNAME
Method - 2:
SELECT x.SID, x.SNAME FROM
(SELECT s3.SID, S3.SNAME FROM Salesman S3) x
LEFT OUTER JOIN
(SELECT S1.SID, S1.SNAME FROM Salesman S1 INNER JOIN Sale S2 ON S1.SID=S2.SID GROUP BY S1.SID,S1.SNAME) y
ON
y.SID = x.SID
WHERE y.SID IS NULL
Method - 3:(which I realized after 1 hour!)
SELECT S1.SID, S1.SNAME
FROM Salesman S1 LEFT OUTER JOIN Sale S2
ON S1.SID=S2.SID WHERE S2.SALEID IS NULL
Remember: AND and WHERE operators give different results...
SELECT S1.SID, S1.SNAME
FROM Salesman S1 LEFT OUTER JOIN Sale S2
ON S1.SID=S2.SID WHERE S2.SALEID IS NULL
SELECT S1.SID, S1.SNAME
FROM Salesman S1 LEFT OUTER JOIN Sale S2
ON S1.SID=S2.SID WHERE S2.SALEID AND NULL
================================================
FILE: DBMS/Day-5/Exercise-58.txt
================================================
SELECT P1.PRODID, P1.CATEGORY, P1. PRICE
FROM PRODUCT P1 INNER JOIN PRODUCT P2
ON P1.PRICE=P2.PRICE WHERE P1.PRODID <> P2.PRODID
================================================
FILE: DBMS/Day-5/Practice-1 Self Join.txt
================================================
Another Alternative to Practice Question of Self Join:
Method - 1:
SELECT E.ID, E.ENAME
FROM EMPLOYEE E INNER JOIN EMPLOYEE D
ON E.DEPT=D.DEPT AND D.ENAME LIKE '%Jack%' AND E.ENAME NOT LIKE '%Jack%';
Method-2:
SELECT E.Id, E.ENAME
FROM Employee E INNER JOIN Employee J
ON E.Dept = J.Dept AND E.Id <> J.Id AND J.ENAME='Jack Abraham';
================================================
FILE: DBMS/Day-5/Practice-2 Outer Join.txt
================================================
QUESTION: Display computer id, make, model of computers along with the id of the employee it is assigned to. Display Not assigned against id column if the computer is not assigned to anyone.
Practice: Outer Join
Method - 1:
SELECT C.COMPID, C.MAKE, C.MODEL,
CASE
WHEN E.ID IS NULL THEN 'Not assigned'
ELSE TO_CHAR(E.ID)
END ID
FROM COMPUTER C LEFT OUTER JOIN EMPLOYEE E
ON C.COMPID=E.COMPID
Method 2:
SELECT C.CompId, C.Make, C.Model, NVL(TO_CHAR(E.Id), 'Not assigned') AS ID FROM Employee E RIGHT JOIN Computer C ON C.CompId = E.CompId;
================================================
FILE: DBMS/Day-5/readme.md
================================================
This is Day-5 DBMS
================================================
FILE: DBMS/Day-6/Assignment-100.txt
================================================
Fetch the empno from EmpVehicle that share same vehcile:
SELECT EV1.EMPNO FROM EMPVEHICLE EV1, EMPVEHICLE EV2 WHERE EV1.VEHICLEID=EV2.VEHICLEID AND
EV1.EMPNO<>EV2.EMPNO
GROUP BY EV1.EMPNO
Step2:
SELECT EMPNO, ENAME FROM EMP WHERE EMPNO IN (
SELECT EV1.EMPNO FROM EMPVEHICLE EV1, EMPVEHICLE EV2 WHERE EV1.VEHICLEID=EV2.VEHICLEID AND
EV1.EMPNO<>EV2.EMPNO
GROUP BY EV1.EMPNO
)
================================================
FILE: DBMS/Day-6/Assignment-102.txt
================================================
SELECT I.ITEMCODE, I.DESCR, Q.QDATE
FROM ITEM I, QUOTATION Q
WHERE I.ITEMCODE=Q.ITEMCODE
AND Q.QUOTEDPRICE <
(
SELECT MAX(QUOTEDPRICE) FROM QUOTATION Q1
WHERE Q1.QDATE=Q.QDATE
AND Q1.QUOTATIONID<>Q.QUOTATIONID
)
================================================
FILE: DBMS/Day-6/Assignment-103.txt
================================================
Identify purchase bills in which -> Lets assign PURCHASEBILL 'P' table to the outer query
the bill amount is less than or equal to -> P.BILLAMOUNT<=
the average bill amount -> AVG(P1.billamount) (lets assign PURCHASEBILL 'P1' to the inner query)
of all the items -> GROUP BY ()
purchased in the same retail outlet. -> P1.ROID=P.ROID (The ROID which refers to the outer query must be the same as the inner query)
and GROUP BY function must group item prices as per ROID
Display billid and itemcode for the same.
SELECT P.BILLID, P.ITEMCODE
FROM PURCHASEBILL P
WHERE P.BILLAMOUNT<=
(
SELECT AVG(P1.BILLAMOUNT)
FROM PURCHASEBILL P1
WHERE P1.ROID=P.ROID
GROUP BY ROID
)
================================================
FILE: DBMS/Day-6/Assignment-104.txt
================================================
Lets divide the question:
Identify the supplier who has submitted --> SELECT Q1.SNAME (Outer query : QUOTATION Q1)
the quotation for an item -->
with the quoted price, less than --> Q1.QUOTEDPRICE<
the maximum quoted price submitted by all other suppliers,
--> MAX(Q2.QUOTEDPRICE)(inner query: QUOTATION Q2)
GROUP BY(Q2.ITEMCODE)
for the same item. --> Q2.ITEMCODE = Q1.ITEMCODE
Display sname, itemcode and item description for the identified supplier.
Do not display duplicate records. --> USe DISTINCT
SELECT DISTINCT Q1.SNAME, Q1.ITEMCODE, I.DESCR
FROM QUOTATION Q1, ITEM I
WHERE Q1.ITEMCODE=I.ITEMCODE
AND Q1.QUOTEDPRICE<
(
SELECT MAX(Q2.QUOTEDPRICE)
FROM QUOTATION Q2
WHERE Q2.ITEMCODE=Q1.ITEMCODE
AND Q2.SNAME<>Q1.SNAME
GROUP BY (Q2.ITEMCODE)
)
================================================
FILE: DBMS/Day-6/Assignment-105.txt
================================================
The payroll department requires the details of those employees
who are getting the highest salary --> MAX(SAL)
in each designation. -> Outer Query's Designation must match the inner query
Display empid, empname, designation and salary as per the given requirement.
SELECT E1.EMPID, E1.EMPNAME, E1.DESIGNATION, E1.SALARY
FROM EMPDETAILS E1
WHERE E1.SALARY =
(
SELECT MAX(SALARY)
FROM EMPDETAILS E2
WHERE E2.DESIGNATION=E1.DESIGNATION
)
================================================
FILE: DBMS/Day-6/Assignment-106.txt
================================================
Display the customer id and customer name of those customers --> SELECT C.CUSTID, C.CUSTNAME FROM CUSTOMER C
who have not purchased at all -> NOT EXISTS
from any retail outlet.
--> Here we need to have some reference to the retail outlet.
Hence we use the tables Customer and PurchaseBill
to identify which customers have purchased an item from a retail outlet.
Hence, we get
___________________________________
METHOD-1:
SELECT C.CUSTID, C.CUSTNAME
FROM CUSTOMER C
WHERE NOT EXISTS
(
SELECT CUSTID
FROM PURCHASEBILL P
WHERE C.CUSTID=P.CUSTID
)
___________________________________
METHOD-2:
SELECT C.CUSTID, C.CUSTNAME
FROM CUSTOMER C
WHERE C.CUSTID NOT IN
(
SELECT CUSTID
FROM PURCHASEBILL P
WHERE C.CUSTID=P.CUSTID
)
___________________________________
================================================
FILE: DBMS/Day-6/Assignment-93.txt
================================================
SELECT ITEMCODE, ITEMTYPE, DESCR, CATEGORY FROM ITEM WHERE ITEMCODE IN (SELECT ITEMCODE FROM PURCHASEBILL)
================================================
FILE: DBMS/Day-6/Assignment-94.txt
================================================
Find the min quoted price:
SELECT MIN(QUOTEDPRICE) FROM QUOTATION
Find the corresponding distinct itemcodes:
SELECT DISTINCT ITEMCODE FROM QUOTATION WHERE QUOTEDPRICE = (SELECT MIN(QUOTEDPRICE) FROM QUOTATION)
Find the type in item table corresponding to the itemcode obained in step 2:
SELECT ITEMCODE, ITEMTYPE, DESCR, CATEGORY FROM ITEM WHERE ITEMCODE = (SELECT DISTINCT ITEMCODE FROM QUOTATION WHERE QUOTEDPRICE = (SELECT MIN(QUOTEDPRICE) FROM QUOTATION WHERE QSTATUS='Rejected'))
================================================
FILE: DBMS/Day-6/Assignment-95.txt
================================================
The management would like to know the details of the items
which has maximum quoted price
amongst the quotations that have status as 'Closed' or 'Rejected'.
Display itemcode and descr of those items.
Filter Closed and Rejected Quotations.
SELECT * FROM QUOTATION WHERE QSTATUS IN ('Rejected','Closed')
Find maximum price of those quotations.
SELECT MAX(QUOTEDPRICE) MAXI FROM QUOTATION WHERE QSTATUS IN ('Rejected','Closed')
Fetch the itemcode of the quoation.
SELECT ITEMCODE FROM QUOTATION WHERE QUOTEDPRICE= (SELECT MAX(QUOTEDPRICE) MAXI FROM QUOTATION WHERE QSTATUS IN ('Rejected','Closed'))
Display the details of the fetched item.
SELECT ITEMCODE, DESCR FROM ITEM WHERE ITEMCODE IN (SELECT DISTINCT ITEMCODE FROM QUOTATION WHERE QUOTEDPRICE = (SELECT MAX(QUOTEDPRICE) MAXI FROM QUOTATION WHERE QSTATUS IN ('Rejected','Closed')))
However, the following query doesnt show logical error:
SELECT ITEMCODE, DESCR FROM ITEM WHERE ITEMCODE IN
(
SELECT DISTINCT ITEMCODE FROM QUOTATION WHERE QUOTEDPRICE =
(
SELECT MAX(QUOTEDPRICE) FROM QUOTATION WHERE QSTATUS IN ('Rejected','Closed')
)
AND QSTATUS IN ('Rejected','Closed')
)
It is important that we also filter the 2nd inner query because max(price) from rejected and closed quotations
can also be the price for Accepted Quotation. Hence care must be taken that the quoation belongs only
and only to rejected and closed quotations.
================================================
FILE: DBMS/Day-6/Assignment-96.txt
================================================
SELECT ITEMCODE, DESCR, PRICE FROM ITEM WHERE PRICE =
(
SELECT MAX(PRICE) FROM ITEM WHERE PRICE<
(
SELECT MAX(PRICE) FROM ITEM
)
)
================================================
FILE: DBMS/Day-6/Assignment-98.txt
================================================
SELECT ENAME, JOB FROM EMP WHERE EMPNO IN
(
SELECT EMPNO FROM VEHICLE V, EMPVEHICLE EV WHERE EV.VEHICLEID=V.VEHICLEID
)
More shorthand version:
SELECT ENAME, JOB FROM EMP WHERE EMPNO IN
(
SELECT EMPNO FROM EMPVEHICLE
)
================================================
FILE: DBMS/Day-6/Assignment-99.txt
================================================
Step 1: Find max salary
Step 2: Display his/her details
SELECT ENAME FROM EMP WHERE SAL=
(
SELECT MAX(SAL) FROM EMP
)
================================================
FILE: DBMS/Day-6/Exercise-59.txt
================================================
SELECT SALEID,SLDATE FROM SALE WHERE SLDATE=(SELECT MAX(SLDATE) FROM SALE)
================================================
FILE: DBMS/Day-6/Exercise-60.txt
================================================
SELECT SNAME FROM SALESMAN WHERE SID IN (SELECT SID FROM Sale GROUP BY SID HAVING COUNT(SALEID)>=2)
Note: If we used equality operator(=)
instead of IN we get logical error,
Reason being, the inner query can return multiple rows,
which is supported by IN operators, but not by '='
operator
================================================
FILE: DBMS/Day-6/Exercise-61.txt
================================================
Step 1: Find the minimum quantity (which will be a single row)
SELECT MIN(SUM(QUANTITY)) FROM SALEDETAIL GROUP BY PRODID)
Step 2: Find the product Ids that have minimum quantity:
SELECT PRODID FROM SALEDETAIL GROUP BY PRODID HAVING SUM(QUANTITY) = (SELECT MIN(SUM(QUANTITY)) FROM SALEDETAIL GROUP BY PRODID)
Step 3: Using the prod ids fetched in the previous step,
relate these prod ids with the prod ids from the product table
and display the description:
SELECT PRODID, PDESC FROM PRODUCT WHERE PRODID IN (SELECT PRODID FROM SALEDETAIL GROUP BY PRODID HAVING SUM(QUANTITY) = (SELECT MIN(SUM(QUANTITY)) FROM SALEDETAIL GROUP BY PRODID))
================================================
FILE: DBMS/Day-6/Exercise-62.txt
================================================
The given expected Result has two rows with SID = 1 and 5.
The tuple of SID=5 doesnot statisfy the condition as given in the question
hence I am unclear with the required output.
However, here is my answer that lists the tuples with the salesamount > Avg(salesamount)
A bit complex, but lets go step by step:
Step1: Fetch all the saleids and sids from the sale table
SELECT S1.SID, S1.SALEID FROM SALE S1 ORDER BY SID
Step 2: Lets fetch the prodid and quantity corresponding to every saleid
SELECT S1.SID, S1.SALEID, S2.PRODID, S2.QUANTITY FROM SALE S1, SALEDETAIL S2 WHERE S1.SALEID=S2.SALEID ORDER BY S1.SID
Step 3: Now lets calculate the amount generated with every sale
SELECT S1.SID, S1.SALEID, S2.PRODID, S2.QUANTITY,(P.PRICE*S2.QUANTITY) AMOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID ORDER BY S1.SID
Step 4: Similarly lets also calculate the discount amount
SELECT S1.SID, S1.SALEID, S2.PRODID, S2.QUANTITY,(P.PRICE*S2.QUANTITY) AMOUNT, ((P.PRICE*S2.QUANTITY)*(P.DISCOUNT/100)) DISCOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID ORDER BY S1.SID
Step 4: Now lets replace the amount and discount columns with a single 'Total amount' column
SELECT S1.SID, S1.SALEID, S2.PRODID, S2.QUANTITY,((P.PRICE*S2.QUANTITY)*((100-P.DISCOUNT)/100)) TOTALAMOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID ORDER BY S1.SID
Step 5: Now we will calculate the total sum of amount generated by EVERY salesman.
To do it, we will "group by" SID and calculate the sum of total amount generated in the previous step.
SELECT S1.SID, SUM(((P.PRICE*S2.QUANTITY)*((100-P.DISCOUNT)/100))) TOTALAMOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID GROUP BY S1.SID ORDER BY S1.SID
Step 6: Now lets calculate the average sales amount of all sales made
We will use AVG Function on TOTAL AMOUNT calculated in Step 5
Incorrect Query:
SELECT AVG(((P.PRICE*S2.QUANTITY)*((100-P.DISCOUNT)/100))) AVGAMOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID
Incorrect Query:
SELECT AVG(SUM(((P.PRICE*S2.QUANTITY)*((100-P.DISCOUNT)/100)))) TOTALAMOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID GROUP BY S1.SID
Actual Correct Way to calculate average:
SELECT SUM(SUM(((P.PRICE*S2.QUANTITY)*((100-P.DISCOUNT)/100)))/SUM(S2.QUANTITY)) TOTALAMOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID GROUP BY S1.SID
Step 7: Now we will only select those SID's that have a total amount > Average
To do this, we will have to combine query in Step 6 with step 7
SELECT SID, SNAME, LOCATION
FROM SALESMAN
WHERE SID IN (SELECT SID FROM
(SELECT S1.SID, SUM(((P.PRICE*S2.QUANTITY)*((100-P.DISCOUNT)/100))) TOTALAMOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID GROUP BY S1.SID ORDER BY S1.SID)
WHERE TOTALAMOUNT>
(SELECT SUM(SUM(((P.PRICE*S2.QUANTITY)*((100-P.DISCOUNT)/100)))/SUM(S2.QUANTITY)) TOTALAMOUNT FROM SALE S1, SALEDETAIL S2, PRODUCT P WHERE S1.SALEID=S2.SALEID AND S2.PRODID = P.PRODID GROUP BY S1.SID)
)
================================================
FILE: DBMS/Day-6/Exercise-63.txt
================================================
SELECT P.PRODID, P.CATEGORY, P.PDESC, P.PRICE FROM PRODUCT P WHERE PRICE = (SELECT MAX(PRICE) FROM PRODUCT WHERE CATEGORY=P.CATEGORY);
================================================
FILE: DBMS/Day-6/Exercise-64.txt
================================================
SELECT SNAME FROM SALESMAN S WHERE NOT EXISTS(SELECT SID FROM SALE S1 WHERE S1.SID=S.SID)
================================================
FILE: DBMS/Day-6/Exercise-65.txt
================================================
SELECT SNAME FROM SALESMAN S WHERE EXISTS (SELECT * FROM SALE S1 WHERE S.SID=S1.SID AND TO_CHAR(S1.SLDATE, 'MM-YY')='06-15')
================================================
FILE: DBMS/Day-6/Exercise-66.txt
================================================
Display SId, SName and Location -> SELECT S.SID, S.SNAME, S.LOCATION
of those salesmen -> FROM SALESMAN S WHERE S.SID IN ()
who have total sales amount -> SUM(individual salesamount)
greater than -> '>'
average total sales amount -> SUM(individual-salesamount)/SUM(total-quantity)
of their location -> location-wise 'GROUP BY location'
calculated per salesman.
SELECT PRODID FROM PRODUCT P, SALEDETAIL S1, SALE S2 WHERE SUM(individual salesamount)>SUM(individual-salesamount)/SUM(total-quantity)
_____________________________________________________________________
SELECT SM.SID, SNAME, LOCATION FROM SALESMAN SM
INNER JOIN SALE S ON S.SID = SM.SID GROUP BY SM.SID, SNAME, LOCATION
HAVING Sum(AMOUNT)>
(SELECT MIN(SUM(AMOUNT)) FROM SALE SI INNER JOIN SALESMAN SMI
ON SI.SID = SMI.SID GROUP BY SI.SID) + 2000;
_____________________________________________________________________
SELECT SM.SID, SNAME FROM SALESMAN SM
INNER JOIN SALE S ON S.SID = SM.SID
WHERE LOCATION = 'London'
GROUP BY SM.SID, SNAME
HAVING SUM(AMOUNT) <
(SELECT AVG(SUM(AMOUNT)) FROM SALE GROUP BY SID);
___ _____ _____ _____ _______ _______ _______ ____
Calculates the average amount of sales done based on each salesman's total sale amount.
Displays SID and SNAME of salesmen whose total amount of sale is lesser than the average
amount of sale calculated and who belongs to city 'London'.
_______
Step 1: Select every in
SELECT S.SID, SUM((S1.Quantity*P.PRICE)*((100-P.DISCOUNT)/100)) Totalquantity FROM SALE S,SALEDETAIL S1, PRODUCT P WHERE S1.SALEID=S.SALEID AND S1.PRODID=P.PRODID GROUP BY S.SID ORDER BY S.SID
================================================
FILE: DBMS/Day-6/readme.md
================================================
This is day 6
================================================
FILE: DSA in Python/Day-1/Assignment 1.txt
================================================
#DSA-Assgn-1
def merge_list(list1, list2):
merged_data=""
j=len(list1)-1
for i in range(len(list1)):
str1=str2=""
if list1[i]:
str1 = list1[i]
if list2[j]:
str2 = list2[j]
j-=1
merged_data+=str1+str2
if i<len(list1)-1:
merged_data+=" "
return merged_data
#Provide different values for the variables and test your program
list2=["ue", "is", "y", "he"]
list1=["T", "sk", None, "bl"]
merged_data=merge_list(list1,list2)
print(merged_data)
================================================
FILE: DSA in Python/Day-1/Assignment 2.txt
================================================
#DSA-Assgn-2
class Car:
def __init__(self,model,year,registration_number):
self.__model=model;
self.__year=year;
self.__registration_number=registration_number
def get_model(self):
return self.__model
def get_year(self):
return self.__year
def get_registration_number(self):
return self.__registration_number
def __str__(self):
return(self.__model+" "+self.__registration_number+" "+(str)(self.__year))
class Service:
def __init__(self, car_list):
self.__car_list=car_list
def get_car_list(self):
self.__car_list
def find_cars_by_year(self, year):
list1=[]
for car in self.__car_list:
if int(car.get_year()) == year:
list1.append(car.get_model())
if(len(list1)==0):
return None
return list1
def add_cars(self, new_car_list):
self.__car_list.extend(new_car_list)
self.__car_list.sort(key=lambda x: x.get_year())
def remove_cars_from_karnataka(self):
list1=self.__car_list.copy()
for car in list1:
if car.get_registration_number()[0:2] == "KA":
self.__car_list.remove(car);
#Implement Service class here
car1=Car("WagonR",2010,"KA09 3056")
car2=Car("Beat", 2011, "MH10 6776")
car3=Car("Ritz", 2013,"KA12 9098")
car4=Car("Polo",2017,"GJ01 7854")
car5=Car("Amaze",2014,"KL07 4332")
car6=Car("Amaze1",2009,"KL07 4332")
car7=Car("Amaze2",2015,"KL07 4332")
#Add different values to the list and test the program
car_list=[car1, car2, car3, car4,car5]
new_car_list=[car6, car7]
#Create object of Service class, invoke the methods and test your
s = Service(car_list)
print(s.find_cars_by_year(2017))
s.remove_cars_from_karnataka()
================================================
FILE: DSA in Python/Day-1/Assignment 3.txt
================================================
def check_double(list1,list2):
new_list=[]
for i in list1:
for j in list2:
if j==(2*i):
new_list.append(i)
else:
continue
return new_list
#Provide different values for the variables and test your program
list1=[11,8,23,7,25,15]
list2=[6,33,50,31,46,78,16,34]
print(check_double(list1, list2))
================================================
FILE: DSA in Python/Day-1/Assignment 4.txt
================================================
#DSA-Assgn-4
This solution is incomplete. Will complete it later.
#DSA-Assgn-4
class Player:
def __init__(self,name,experience):
self.__name=name
self.__experience=experience
def get_name(self):
return self.__name
def get_experience(self):
return self.__experience
def __str__(self):
return(self.__name+" "+(str)(self.__experience))
#Implement Game class here
class Game:
def __init__(self,player_list):
self.__players_list=player_list
def sort_players_based_on_experience(self):
self.__players_list.sort(key=lambda x:x.get_experience(),reverse=True)
def shift_player_to_new_position (self,old_index_position, new_index_position):
self.__players_list.insert(new_index_position,self.__players_list[old_index_position])
del [self.__players_list[old_index_position]]
def display_player_details(self):
for player in self.__players_list:
print(player.get_name(),end=" ")
print(player.get_experience())
player1=Player("Dhoni",15)
player2=Player("Virat",10)
player3=Player("Rohit",12)
player4=Player("Raina",11)
player5=Player("Jadeja",13)
player6=Player("Ishant",9)
player7=Player("Shikhar",8)
player8=Player("Axar",7.5)
player9=Player("Ashwin",6)
player10=Player("Stuart",7)
player11=Player("Bhuvneshwar",5)
#Add different values to the list and test the program
players_list=[player1,player2,player3,player4,player5,player6,player7,player8,player9,player10,player11]
#Create object of Game class, invoke the methods and test your program\\
g=Game(players_list)
g.display_player_details()
g.sort_players_based_on_experience()
g.shift_player_to_new_position(0,4)
g.display_player_details()
================================================
FILE: DSA in Python/Day-2/Assignment 10.txt
================================================
#DSA-Assgn-10
class Node:
def __init__(self,data):
self.__data=data
self.__next=None
def get_data(self):
return self.__data
def set_data(self,data):
self.__data=data
def get_next(self):
return self.__next
def set_next(self,next_node):
self.__next=next_node
class LinkedList:
def __init__(self):
self.__head=None
self.__tail=None
def get_head(self):
return self.__head
def get_tail(self):
return self.__tail
def add(self,data):
new_node=Node(data)
if(self.__head is None):
self.__head=self.__tail=new_node
else:
self.__tail.set_next(new_node)
self.__tail=new_node
def insert(self,data,data_before):
new_node=Node(data)
if(data_before==None):
new_node.set_next(self.__head)
self.__head=new_node
if(new_node.get_next()==None):
self.__tail=new_node
else:
node_before=self.find_node(data_before)
if(node_before is not None):
new_node.set_next(node_before.get_next())
node_before.set_next(new_node)
if(new_node.get_next() is None):
self.__tail=new_node
else:
print(data_before,"is not present in the Linked list")
def display(self):
temp=self.__head
while(temp is not None):
print(temp.get_data())
temp=temp.get_next()
def find_node(self,data):
temp=self.__head
while(temp is not None):
if(temp.get_data()==data):
return temp
temp=temp.get_next()
return None
def delete(self,data):
node=self.find_node(data)
if(node is not None):
if(node==self.__head):
if(self.__head==self.__tail):
self.__tail=None
self.__head=node.get_next()
else:
temp=self.__head
while(temp is not None):
if(temp.get_next()==node):
temp.set_next(node.get_next())
if(node==self.__tail):
self.__tail=temp
node.set_next(None)
break
temp=temp.get_next()
else:
print(data,"is not present in Linked list")
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
temp=self.__head
msg=[]
while(temp is not None):
msg.append(str(temp.get_data()))
temp=temp.get_next()
msg=" ".join(msg)
msg="Linkedlist data(Head to Tail): "+ msg
return msg
class Compartment:
def __init__(self,compartment_name,no_of_passengers,total_seats):
self.__compartment_name=compartment_name
self.__no_of_passengers=no_of_passengers
self.__total_seats=total_seats
def get_compartment_name(self):
return self.__compartment_name
def get_no_of_passengers(self):
return self.__no_of_passengers
def get_total_seats(self):
return self.__total_seats
class Train:
def __init__(self,train_name,compartment_list):
self.__train_name=train_name
self.__compartment_list=compartment_list
def get_train_name(self):
return self.__train_name
def get_compartment_list(self):
return self.__compartment_list
def count_compartments(self):
temp = self.__compartment_list.get_head()
count=0
while(temp):
count+=1
temp=temp.get_next()
return count
def check_vacancy(self):
count=0
temp=self.__compartment_list.get_head()
while(temp):
per= (temp.get_data().get_total_seats() - temp.get_data().get_no_of_passengers())/temp.get_data().get_total_seats()
if per>0.5:
count+=1
temp=temp.get_next()
return count
#Use different values for compartment and test your program
compartment1=Compartment("SL",250,400)
compartment2=Compartment("2AC",125,280)
compartment3=Compartment("3AC",120,300)
compartment4=Compartment("FC",160,300)
compartment5=Compartment("1AC",100,210)
compartment_list=LinkedList()
compartment_list.add(compartment1)
compartment_list.add(compartment2)
compartment_list.add(compartment3)
compartment_list.add(compartment4)
compartment_list.add(compartment5)
train1=Train("Shatabdi",compartment_list)
count=train1.count_compartments()
print("The number of compartments in the train:",count)
vacancy_count=train1.check_vacancy()
print("The number of compartments which have more than 50% vacancy:",vacancy_count)
================================================
FILE: DSA in Python/Day-2/Assignment 5.txt
================================================
#DSA-Assgn-5
class Node:
def __init__(self,data):
self.__data=data
self.__next=None
def get_data(self):
return self.__data
def set_data(self,data):
self.__data=data
def get_next(self):
return self.__next
def set_next(self,next_node):
self.__next=next_node
class LinkedList:
def __init__(self):
self.__head=None
self.__tail=None
def get_head(self):
return self.__head
def get_tail(self):
return self.__tail
def add(self,data):
new_node=Node(data)
if(self.__head is None):
self.__head=self.__tail=new_node
else:
self.__tail.set_next(new_node)
self.__tail=new_node
def insert(self,data,data_before):
new_node=Node(data)
if(data_before==None):
new_node.set_next(self.__head)
self.__head=new_node
if(new_node.get_next()==None):
self.__tail=new_node
else:
node_before=self.find_node(data_before)
if(node_before is not None):
new_node.set_next(node_before.get_next())
node_before.set_next(new_node)
if(new_node.get_next() is None):
self.__tail=new_node
else:
print(data_before,"is not present in the Linked list")
def display(self):
temp=self.__head
while(temp is not None):
print(temp.get_data())
temp=temp.get_next()
def find_node(self,data):
temp=self.__head
while(temp is not None):
if(temp.get_data()==data):
return temp
temp=temp.get_next()
return None
def delete(self,data):
node=self.find_node(data)
if(node is not None):
if(node==self.__head):
if(self.__head==self.__tail):
self.__tail=None
self.__head=node.get_next()
else:
temp=self.__head
while(temp is not None):
if(temp.get_next()==node):
temp.set_next(node.get_next())
if(node==self.__tail):
self.__tail=temp
node.set_next(None)
break
temp=temp.get_next()
else:
print(data,"is not present in Linked list")
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
temp=self.__head
msg=[]
while(temp is not None):
msg.append(str(temp.get_data()))
temp=temp.get_next()
msg=" ".join(msg)
msg="Linkedlist data(Head to Tail): "+ msg
return msg
def create_new_sentence(word_list):
new_sentence=""
count=0
temp = word_list.get_head()
status=0
while(temp):
ch=temp.get_data()
if ch=="/" or ch=="*":
new_sentence+= " "
if temp.get_next().get_data()=="/" or temp.get_next().get_data()=="*":
status=1
temp=temp.get_next()
temp=temp.get_next()
continue
if status == 1:
ch=ch.upper()
status=0
new_sentence+=ch
temp=temp.get_next()
return new_sentence
word_list=LinkedList()
word_list.add("T")
word_list.add("h")
word_list.add("e")
word_list.add("/")
word_list.add("*")
word_list.add("s")
word_list.add("k")
word_list.add("y")
word_list.add("*")
word_list.add("i")
word_list.add("s")
word_list.add("/")
word_list.add("/")
word_list.add("b")
word_list.add("l")
word_list.add("u")
word_list.add("e")
result=create_new_sentence(word_list)
print(result)
================================================
FILE: DSA in Python/Day-2/Assignment 6.txt
================================================
#DSA-Assgn-6
class Node:
def __init__(self,data):
self.__data=data
self.__next=None
def get_data(self):
return self.__data
def set_data(self,data):
self.__data=data
def get_next(self):
return self.__next
def set_next(self,next_node):
self.__next=next_node
class LinkedList:
def __init__(self):
self.__head=None
self.__tail=None
def get_head(self):
return self.__head
def get_tail(self):
return self.__tail
def add(self,data):
new_node=Node(data)
if(self.__head is None):
self.__head=self.__tail=new_node
else:
self.__tail.set_next(new_node)
self.__tail=new_node
def insert(self,data,data_before):
new_node=Node(data)
if(data_before==None):
new_node.set_next(self.__head)
self.__head=new_node
if(new_node.get_next()==None):
self.__tail=new_node
else:
node_before=self.find_node(data_before)
if(node_before is not None):
new_node.set_next(node_before.get_next())
node_before.set_next(new_node)
if(new_node.get_next() is None):
self.__tail=new_node
else:
print(data_before,"is not present in the Linked list")
def display(self):
temp=self.__head
while(temp is not None):
print(temp.get_data())
temp=temp.get_next()
def find_node(self,data):
temp=self.__head
while(temp is not None):
if(temp.get_data()==data):
return temp
temp=temp.get_next()
return None
def delete(self,data):
node=self.find_node(data)
if(node is not None):
if(node==self.__head):
if(self.__head==self.__tail):
self.__tail=None
self.__head=node.get_next()
else:
temp=self.__head
while(temp is not None):
if(temp.get_next()==node):
temp.set_next(node.get_next())
if(node==self.__tail):
self.__tail=temp
node.set_next(None)
break
temp=temp.get_next()
else:
print(data,"is not present in Linked list")
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
temp=self.__head
msg=[]
while(temp is not None):
msg.append(str(temp.get_data()))
temp=temp.get_next()
msg=" ".join(msg)
msg="Linkedlist data(Head to Tail): "+ msg
return msg
class Child:
def __init__(self,name,item_to_perform):
self.__name=name
self.__item_to_perform=item_to_perform
def __str__(self):
return(self.__name+" "+self.__item_to_perform)
def get_name(self):
return self.__name
def get_item_to_perform(self):
return self.__item_to_perform
class Performance:
def __init__(self,children_list):
self.__children_list=children_list
def get_children_list(self):
return self.__children_list
def change_position(self, child):
temp=self.__children_list.get_head()
temp1=self.__children_list.get_head()
while(temp.get_next()):
temp1=temp1.get_next()
if temp.get_next().get_next():
temp=temp.get_next().get_next()
self.__children_list.delete(child)
self.__children_list.insert(child,temp1.get_data())
def add_new_child(self,child):
self.__children_list.add(child)
#Implement Performance class here
child1=Child("Rahul","solo song")
child2=Child("Sheema","Dance")
child3=Child("Gitu","Plays Flute")
# child4=Child("Tarun","Gymnastics")
# child5=Child("Tom","MIME")
#Add different values to the list and test the program
children_list=LinkedList()
children_list.add(child1)
children_list.add(child2)
children_list.add(child3)
# children_list.add(child4)
# children_list.add(child5)
performance=Performance(children_list)
print("The order in which the children would perform:")
performance.get_children_list().display()
print()
print("After Rahul's performance, the schedule would change to:")
performance.change_position(child1)
performance.get_children_list().display()
print()
child6=Child("Swetha","Vote of Thanks")
print("After Swetha has joined, the schedule is:")
performance.add_new_child(child6)
performance.get_children_list().display()
================================================
FILE: DSA in Python/Day-2/Assignment 7.txt
================================================
#DSA-Assgn-7
class Node:
def __init__(self,data):
self.__data=data
self.__next=None
def get_data(self):
return self.__data
def set_data(self,data):
self.__data=data
def get_next(self):
return self.__next
def set_next(self,next_node):
self.__next=next_node
class LinkedList:
def __init__(self):
self.__head=None
self.__tail=None
def get_head(self):
return self.__head
def get_tail(self):
return self.__tail
def add(self,data):
new_node=Node(data)
if(self.__head is None):
self.__head=self.__tail=new_node
else:
self.__tail.set_next(new_node)
self.__tail=new_node
def insert(self,data,data_before):
new_node=Node(data)
if(data_before==None):
new_node.set_next(self.__head)
self.__head=new_node
if(new_node.get_next()==None):
self.__tail=new_node
else:
node_before=self.find_node(data_before)
if(node_before is not None):
new_node.set_next(node_before.get_next())
node_before.set_next(new_node)
if(new_node.get_next() is None):
self.__tail=new_node
else:
print(data_before,"is not present in the Linked list")
def display(self):
temp=self.__head
while(temp is not None):
print(temp.get_data())
temp=temp.get_next()
def find_node(self,data):
temp=self.__head
while(temp is not None):
if(temp.get_data()==data):
return temp
temp=temp.get_next()
return None
def delete(self,data):
node=self.find_node(data)
if(node is not None):
if(node==self.__head):
if(self.__head==self.__tail):
self.__tail=None
self.__head=node.get_next()
else:
temp=self.__head
while(temp is not None):
if(temp.get_next()==node):
temp.set_next(node.get_next())
if(node==self.__tail):
self.__tail=temp
node.set_next(None)
break
temp=temp.get_next()
else:
print(data,"is not present in Linked list")
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
temp=self.__head
msg=[]
while(temp is not None):
msg.append(str(temp.get_data()))
temp=temp.get_next()
msg=" ".join(msg)
msg="Linkedlist data(Head to Tail): "+ msg
return msg
def remove_duplicates(duplicate_list):
temp = duplicate_list.get_head()
while(temp.get_next()):
if temp.get_data() == temp.get_next().get_data():
temp1=temp
temp=temp.get_next()
# print("Removed: "+str(temp1.get_data()))
duplicate_list.delete(temp1.get_data())
continue
temp=temp.get_next()
duplicate_list.display()
return duplicate_list
#Add different values to the linked list and test your program
duplicate_list=LinkedList()
duplicate_list.add(30)
duplicate_list.add(40)
duplicate_list.add(40)
duplicate_list.add(40)
duplicate_list.add(40)
remove_duplicates(duplicate_list)
================================================
FILE: DSA in Python/Day-2/Assignment 8.txt
================================================
#DSA-Assgn-8
class Node:
def __init__(self,data):
self.__data=data
self.__next=None
def get_data(self):
return self.__data
def set_data(self,data):
self.__data=data
def get_next(self):
return self.__next
def set_next(self,next_node):
self.__next=next_node
class LinkedList:
def __init__(self):
self.__head=None
self.__tail=None
def get_head(self):
return self.__head
def get_tail(self):
return self.__tail
def add(self,data):
new_node=Node(data)
if(self.__head is None):
self.__head=self.__tail=new_node
else:
self.__tail.set_next(new_node)
self.__tail=new_node
def insert(self,data,data_before):
new_node=Node(data)
if(data_before==None):
new_node.set_next(self.__head)
self.__head=new_node
if(new_node.get_next()==None):
self.__tail=new_node
else:
node_before=self.find_node(data_before)
if(node_before is not None):
new_node.set_next(node_before.get_next())
node_before.set_next(new_node)
if(new_node.get_next() is None):
self.__tail=new_node
else:
print(data_before,"is not present in the Linked list")
def display(self):
temp=self.__head
while(temp is not None):
print(temp.get_data())
temp=temp.get_next()
def find_node(self,data):
temp=self.__head
while(temp is not None):
if(temp.get_data()==data):
return temp
temp=temp.get_next()
return None
def delete(self,data):
node=self.find_node(data)
if(node is not None):
if(node==self.__head):
if(self.__head==self.__tail):
self.__tail=None
self.__head=node.get_next()
else:
temp=self.__head
while(temp is not None):
if(temp.get_next()==node):
temp.set_next(node.get_next())
if(node==self.__tail):
self.__tail=temp
node.set_next(None)
break
temp=temp.get_next()
else:
print(data,"is not present in Linked list")
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
temp=self.__head
msg=[]
while(temp is not None):
msg.append(str(temp.get_data()))
temp=temp.get_next()
msg=" ".join(msg)
msg="Linkedlist data(Head to Tail): "+ msg
return msg
class BakeHouse:
def __init__(self):
self.__occupied_table_list=LinkedList()
def get_occupied_table_list(self):
return self.__occupied_table_list
def allocate_table(self):
for i in range(1,11):
if not self.__occupied_table_list.find_node(i):
self.__occupied_table_list.add(i)
break
l=[]
temp=self.__occupied_table_list.get_head()
while(temp):
l.append(temp.get_data())
temp=temp.get_next()
l.sort()
self.__occupied_table_list=LinkedList()
for value in l:
self.__occupied_table_list.add(value)
def deallocate_table(self, table_number):
temp=self.__occupied_table_list.find_node(table_number)
if temp:
self.__occupied_table_list.delete(temp.get_data())
bakehouse=BakeHouse()
bakehouse.get_occupied_table_list().add(3)
bakehouse.get_occupied_table_list().add(7)
bakehouse.get_occupied_table_list().add(8)
bakehouse.get_occupied_table_list().add(9)
bakehouse.allocate_table()
bakehouse.get_occupied_table_list().display()
#Invoke the methods of BakeHouse class and test the program
================================================
FILE: DSA in Python/Day-2/Assignment 9.txt
================================================
#DSA-Assgn-9
class Node:
def __init__(self,data):
self.__data=data
self.__next=None
def get_data(self):
return self.__data
def set_data(self,data):
self.__data=data
def get_next(self):
return self.__next
def set_next(self,next_node):
self.__next=next_node
class LinkedList:
def __init__(self):
self.__head=None
self.__tail=None
def get_head(self):
return self.__head
def get_tail(self):
return self.__tail
def add(self,data):
new_node=Node(data)
if(self.__head is None):
self.__head=self.__tail=new_node
else:
self.__tail.set_next(new_node)
self.__tail=new_node
def insert(self,data,data_before):
new_node=Node(data)
if(data_before==None):
new_node.set_next(self.__head)
self.__head=new_node
if(new_node.get_next()==None):
self.__tail=new_node
else:
node_before=self.find_node(data_before)
if(node_before is not None):
new_node.set_next(node_before.get_next())
node_before.set_next(new_node)
if(new_node.get_next() is None):
self.__tail=new_node
else:
print(data_before,"is not present in the Linked list")
def display(self):
temp=self.__head
while(temp is not None):
print(temp.get_data())
temp=temp.get_next()
def find_node(self,data):
temp=self.__head
while(temp is not None):
if(temp.get_data()==data):
return temp
temp=temp.get_next()
return None
def delete(self,data):
node=self.find_node(data)
if(node is not None):
if(node==self.__head):
if(self.__head==self.__tail):
self.__tail=None
self.__head=node.get_next()
else:
temp=self.__head
while(temp is not None):
if(temp.get_next()==node):
temp.set_next(node.get_next())
if(node==self.__tail):
self.__tail=temp
node.set_next(None)
break
temp=temp.get_next()
else:
print(data,"is not present in Linked list")
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
temp=self.__head
msg=[]
while(temp is not None):
msg.append(str(temp.get_data()))
temp=temp.get_next()
msg=" ".join(msg)
msg="Linkedlist data(Head to Tail): "+ msg
return msg
def reverse_linkedlist(reverse_list):
temp=reverse_list.get_head()
l=[]
while(temp):
l.append(temp.get_data())
temp=temp.get_next()
l=l[::-1]
reverse_list=LinkedList()
for value in l:
reverse_list.add(value)
return reverse_list
#Add different values to the linked list and test your program
reverse_list=LinkedList()
reverse_list.add(10)
reverse_list.add(15)
reverse_list.add(14)
reverse_list.add(28)
reverse_list.add(30)
reversed_linkedlist=reverse_linkedlist(reverse_list)
reversed_linkedlist.display()
================================================
FILE: DSA in Python/Day-3/Assignment-11.py
================================================
#DSA-Assgn-11
class Queue:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__rear=-1
self.__front=0
def is_full(self):
if(self.__rear==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__front>self.__rear):
return True
return False
def enqueue(self,data):
if(self.is_full()):
print("Queue is full!!!")
else:
self.__rear+=1
self.__elements[self.__rear]=data
def dequeue(self):
if(self.is_empty()):
print("Queue is empty!!!")
else:
data=self.__elements[self.__front]
self.__front+=1
return data
def display(self):
for index in range(self.__front, self.__rear+1):
print(self.__elements[index])
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__front
while(index<=self.__rear):
msg.append((str)(self.__elements[index]))
index+=1
msg=" ".join(msg)
msg="Queue data(Front to Rear): "+msg
return msg
def merge_queue(queue1,queue2):
queue3=Queue(queue1.get_max_size()+queue2.get_max_size())
l = queue1.get_max_size()+queue2.get_max_size()
print(l)
for i in range(l):
if not queue1.is_empty():
queue3.enqueue(queue1.dequeue())
if not queue2.is_empty():
queue3.enqueue(queue2.dequeue())
merged_queue=queue3
return merged_queue
#Enqueue different values to both the queues and test your program
queue1=Queue(3)
queue2=Queue(6)
queue1.enqueue(3)
queue1.enqueue(6)
queue1.enqueue(8)
queue2.enqueue('b')
queue2.enqueue('y')
queue2.enqueue('u')
queue2.enqueue('t')
queue2.enqueue('r')
queue2.enqueue('o')
merged_queue=merge_queue(queue1, queue2)
print("The elements in the merged queue are:")
merged_queue.display()
================================================
FILE: DSA in Python/Day-3/Assignment-13.py
================================================
#DSA-Assgn-13
class Stack:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__top=-1
def is_full(self):
if(self.__top==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__top==-1):
return True
return False
def push(self,data):
if(self.is_full()):
print("The stack is full!!")
else:
self.__top+=1
self.__elements[self.__top]=data
def pop(self):
if(self.is_empty()):
print("The stack is empty!!")
else:
data= self.__elements[self.__top]
self.__top-=1
return data
def display(self):
if(self.is_empty()):
print("The stack is empty")
else:
index=self.__top
while(index>=0):
print(self.__elements[index])
index-=1
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__top
while(index>=0):
msg.append((str)(self.__elements[index]))
index-=1
msg=" ".join(msg)
msg="Stack data(Top to Bottom): "+msg
return msg
def change_smallest_value(number_stack):
l=[]
while(not number_stack.is_empty()):
l.append(number_stack.pop())
mini = min(l)
counter = l.count(min(l))
for i in range(counter):
number_stack.push(mini)
for element in l[::-1]:
if element!=mini:
number_stack.push(element)
return number_stack
#Add different values to the stack and test your program
number_stack=Stack(8)
number_stack.push(90)
number_stack.push(3)
number_stack.push(3)
number_stack.push(7)
number_stack.push(4)
print("Initial Stack:")
number_stack.display()
change_smallest_value(number_stack)
print("After the change:")
number_stack.display()
================================================
FILE: DSA in Python/Day-3/Assignment-14.py
================================================
#DSA-Assgn-14
class Queue:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__rear=-1
self.__front=0
def is_full(self):
if(self.__rear==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__front>self.__rear):
return True
return False
def enqueue(self,data):
if(self.is_full()):
print("Queue is full!!!")
else:
self.__rear+=1
self.__elements[self.__rear]=data
def dequeue(self):
if(self.is_empty()):
print("Queue is empty!!!")
else:
data=self.__elements[self.__front]
self.__front+=1
return data
def display(self):
for index in range(self.__front, self.__rear+1):
print(self.__elements[index])
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__front
while(index<=self.__rear):
msg.append((str)(self.__elements[index]))
index+=1
msg=" ".join(msg)
msg="Queue data(Front to Rear): "+msg
return msg
def check_numbers(number_queue):
solution_queue1=Queue(5)
while(not number_queue.is_empty()):
status=0
element=number_queue.dequeue()
for i in range(1,11):
if element%i!=0:
status=1
break
if status==0:
solution_queue1.enqueue(element)
return solution_queue1
#Add different values to the queue and test your program
number_queue=Queue(5)
number_queue.enqueue(13983)
number_queue.enqueue(10080)
number_queue.enqueue(7113)
number_queue.enqueue(2520)
number_queue.enqueue(2500)
print(check_numbers(number_queue))
================================================
FILE: DSA in Python/Day-3/Assignment-15.py
================================================
#DSA-Assgn-15
class Queue:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__rear=-1
self.__front=0
def is_full(self):
if(self.__rear==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__front>self.__rear):
return True
return False
def enqueue(self,data):
if(self.is_full()):
print("Queue is full!!!")
else:
self.__rear+=1
self.__elements[self.__rear]=data
def dequeue(self):
if(self.is_empty()):
print("Queue is empty!!!")
else:
data=self.__elements[self.__front]
self.__front+=1
return data
def display(self):
for index in range(self.__front, self.__rear+1):
print(self.__elements[index])
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__front
while(index<=self.__rear):
msg.append((str)(self.__elements[index]))
index+=1
msg=" ".join(msg)
msg="Queue data(Front to Rear): "+msg
return msg
#Implement Job, Employee and Company classes here
class Job:
def __init__(self,name, time_needed):
self.__name=name
self.__time_needed=time_needed
self.__time_elapsed=0
def get_name(self):
return self.__name
def get_time_needed(self):
return self.__time_needed
def get_time_elapsed(self):
return self.__time_elapsed
def __str__(self):
pass
def elapsed_time(self, no_of_mins):
self.__time_elapsed+=no_of_mins
if self.__time_elapsed>=self.__time_needed:
return True
else:
return False
class Employee:
def __init__(self, name):
self.__name=name
self.__allocated_job=None
def set_allocated_job(self, allocated_job):
self.__allocated_job=allocated_job
def get_name(self):
return self.__name
def get_allocated_job(self):
return self.__allocated_job
def elapsed_time(self, no_of_mins):
if self.__allocated_job.elapsed_time(no_of_mins):
job=self.__allocated_job
self.__allocated_job=None
return job
else:
return None
class Company:
def __init__(self, emp_list):
self.__employees=emp_list
self.__pending_jobs=Queue(10)
def get_employees(self):
return self.__employees
def get_pending_jobs(self):
return self.__pending_jobs
def allocate_new_job(self,job):
status=0
for employee in self.__employees:
if not employee.get_allocated_job():
employee.set_allocated_job(job)
status=1
break
if status==0:
self.__pending_jobs.enqueue(job)
def elapsed_time(self, no_of_mins):
completed_jobs=[]
for employee in self.__employees:
job = employee.elapsed_time(no_of_mins)
if job:
completed_jobs.append(job)
if(not self.__pending_jobs.is_empty()):
employee.set_allocated_job(self.__pending_jobs.dequeue())
if len(completed_jobs)>0:
return completed_jobs
else:
return None
#Change the values and test your programH
emp1=Employee("Ken")
emp2=Employee("Henry")
emp3=Employee("Jack")
emp4=Employee("Hen")
emp5=Employee("Jill")
emp_list=[emp1,emp2,emp3,emp4,emp5]
company=Company(emp_list)
job1=Job("job1",50)
job2=Job("job2",45)
job3=Job("job3",35)
job4=Job("job4",400)
job5=Job("job5",30)
job6=Job("job6",30)
job7=Job("job7",50)
job8=Job("job8",25)
company.allocate_new_job(job1)
company.allocate_new_job(job2)
company.allocate_new_job(job3)
company.allocate_new_job(job4)
company.allocate_new_job(job5)
company.allocate_new_job(job6)
company.allocate_new_job(job7)
company.allocate_new_job(job8)
print("Initial allocation:")
for emp in company.get_employees():
print(emp.get_name(),"is allocated",emp.get_allocated_job().get_name())
print()
print("Pending Jobs:")
company.get_pending_jobs().display()
completed_jobs=company.elapsed_time(30)
'''print("Completed Jobs :")
for job in completed_jobs:
print(job.name)'''
print("After completion:")
for emp in company.get_employees():
print(emp.get_name(),"needs", emp.get_allocated_job().get_time_needed()-emp.get_allocated_job().get_time_elapsed(),"more minutes for",emp.get_allocated_job().get_name())
print()
print("Pending Jobs:")
company.get_pending_jobs().display()
completed_jobs=company.elapsed_time(10)
print("After completion:")
for emp in company.get_employees():
print(emp.get_name(),"needs", emp.get_allocated_job().get_time_needed()-emp.get_allocated_job().get_time_elapsed(),"more minutes for",emp.get_allocated_job().get_name())
print()
print("Pending Jobs:")
company.get_pending_jobs().display()
================================================
FILE: DSA in Python/Day-4/Assignment-16.py
================================================
#DSA-Assgn-16
class Queue:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__rear=-1
self.__front=0
def is_full(self):
if(self.__rear==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__front>self.__rear):
return True
return False
def enqueue(self,data):
if(self.is_full()):
print("Queue is full!!!")
else:
self.__rear+=1
self.__elements[self.__rear]=data
def dequeue(self):
if(self.is_empty()):
print("Queue is empty!!!")
else:
data=self.__elements[self.__front]
self.__front+=1
return data
def display(self):
for index in range(self.__front, self.__rear+1):
print(self.__elements[index])
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__front
while(index<=self.__rear):
msg.append((str)(self.__elements[index]))
index+=1
msg=" ".join(msg)
msg="Queue data(Front to Rear): "+msg
return msg
class Stack:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__top=-1
def is_full(self):
if(self.__top==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__top==-1):
return True
return False
def push(self,data):
if(self.is_full()):
print("The stack is full!!")
else:
self.__top+=1
self.__elements[self.__top]=data
def pop(self):
if(self.is_empty()):
print("The stack is empty!!")
else:
data= self.__elements[self.__top]
self.__top-=1
return data
def display(self):
if(self.is_empty()):
print("The stack is empty")
else:
index=self.__top
while(index>=0):
print(self.__elements[index])
index-=1
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__top
while(index>=0):
msg.append((str)(self.__elements[index]))
index-=1
msg=" ".join(msg)
msg="Stack data(Top to Bottom): "+msg
return msg
def separate_boxes(box_stack):
box_color=['Red', 'Green', 'Blue']
stack=Stack(8)
queue=Queue(8)
while(not box_stack.is_empty()):
color=box_stack.pop()
if color.title() in box_color:
stack.push(color)
elif color.title() not in box_color:
queue.enqueue(color)
while(not stack.is_empty()):
box_stack.push(stack.pop())
return queue
#Use different values for stack and test your program
box_stack=Stack(8)
box_stack.push("Red")
box_stack.push("Magenta")
box_stack.push("Yellow")
box_stack.push("Red")
box_stack.push("Orange")
box_stack.push("Green")
box_stack.push("White")
box_stack.push("Purple")
print("Boxes in the stack:")
box_stack.display()
result=separate_boxes(box_stack)
print()
print("Boxes in the stack after modification:")
box_stack.display()
print("Boxes in the queue:")
result.display()
================================================
FILE: DSA in Python/Day-4/Assignment-17.txt
================================================
#DSA-Assgn-17
def find_matches(country_name):
l=[]
for match in match_list:
detail=match.split(":")
if detail[0] == country_name:
l.append(match)
return l
def max_wins():
dictionary={}
for match in match_list:
detail = match.split(":")
if detail[1] not in dictionary.keys():
dictionary[detail[1]]=None
if dictionary[detail[1]]==None:
dictionary[detail[1]]=int(detail[3])
elif dictionary[detail[1]]>=0:
if dictionary[detail[1]]<int(detail[3]):
dictionary[detail[1]]=int(detail[3])
temp=dictionary.copy()
for key, values in dictionary.items():
dictionary[key]=[]
for match in match_list:
detail = match.split(":")
if int(detail[3])==temp[detail[1]]:
dictionary[detail[1]].append(detail[0])
return dictionary
def find_winner(country1,country2):
count1,count2=0,0
for match in match_list:
detail = match.split(":")
if detail[0] == country1:
count1+=int(detail[3])
if detail[0] == country2:
count2+=int(detail[3])
if count1==count2:
return "Tie"
elif count1>count2:
return country1
else:
return country2
#Consider match_list to be a global variable
match_list=['AUS:T20:5:3', 'IND:CHAM:5:3', 'AUS:WOR:2:0', 'CAN:CHAM:5:1', 'ENG:WOR:2:0', 'IND:T20:6:4', 'PAK:T20:4:3', 'IND:WOR:5:3', 'AUS:CHAM:1:0', 'PAK:CHAM:5:1', 'SA:CHAM:5:2', 'SA:T20:5:0', 'PAK:WOR:2:0']
#Pass different values to each function and test your program
print("The match status list details are:")
print(match_list)
print(find_matches("AUS"))
print(max_wins())
================================================
FILE: DSA in Python/Day-4/Assignment-18.txt
================================================
#DSA-Assgn-18
def find_unknown_words(text,vocabulary):
l=[]
status=0
text_list=text.split(" ")
for each_text in text_list:
if each_text not in vocabulary:
if "." in each_text:
each_text=each_text.replace(".","")
l.append(each_text)
status=1
if status:
return set(l)
else:
return -1
#Pass different values of text and vocabulary to the function and test your program
text="The sun rises in the east and sets in the west."
vocabulary = ["sun","in","rises","the","east"]
unknown_words=find_unknown_words(text,vocabulary)
print("The unknown words in the file are:",unknown_words)
================================================
FILE: DSA in Python/Day-4/Assignment-19.txt
================================================
#DSA-Assgn-19
def last_instance( num_list, start, end, key):
count=0
index=0
if key in num_list:
index = num_list.index(key)
if index:
count = num_list.count(key)
return index+count-1
num_list=[1,1,2,2,3,4,5,5,5,5]
start=0
end=len(num_list)-1
key=6 #Number to be searched
#Pass different values for num_list, start,end and key and test your program
result=last_instance(num_list, start,end,key)
if(result!=-1):
print("The index position of the last occurrence of the number:",result)
else:
print("Number not found")
================================================
FILE: DSA in Python/Day-5/Assignment-20.py
================================================
#DSA-Assgn-20
#Implement Item class here
class Item:
def __init__(self, item_name, author_name, published_year):
self.__item_name=item_name
self.__author_name=author_name
self.__published_year=published_year
def get_item_name(self):
return self.__item_name
def get_author_name(self):
return self.__author_name
def get_published_year(self):
return self.__published_year
def __str__(self):
return("{} by {} published in {}".format(self.__item_name, self.__author_name, self.__published_year))
#Implement Library class here
class Library:
def __init__(self, item_list):
self.__item_list=item_list
def get_item_list(self):
return self.__item_list
def sort_item_list_by_author(self, new_item_list):
new_item_list.sort(key=lambda x:''.join(e for e in x.get_author_name() if e.isalnum()))
return new_item_list
def add_new_items(self, new_item_list):
self.__item_list.extend(new_item_list)
self.sort_item_list_by_author(self.__item_list)
def sort_items_by_published_year(self):
self.sort_item_list_by_author(self.__item_list)
self.__item_list.sort(key=lambda x:x.get_published_year())
#Use different values for item and test your program
item1=Item("A Mission In Kashmir","Andrew Whitehead",1995)
item2=Item("A Passage of India","E.M.Forster",2012)
item3=Item("A new deal for Asia","Mahathir Mohammad",1999)
item4=Item("A Voice of Freedom","Nayantara Sehgal",2001)
item5=Item("A pair of blue eyes","Thomas Hardy",1998 )
item_list=[item1,item2,item3,item4,item5]
library=Library(item_list)
print("The current items in the library are:")
for item in library.get_item_list():
print(item)
item11=Item("Broken Wing","Sarojini Naidu",2012)
item12=Item("Guide","R.K.Narayanan",2001)
item13=Item("Indian Summers","John Mathews",2001)
item14=Item("Innocent in Death","J.D.Robb",2010)
item15=Item("Life of Pi","Yann Martel",2010 )
item16=Item("Sustainability","Johny",2016)
item17=Item("Look Ahead","E.M.Freddy",2012 )
new_item_list=[item11,item12,item13,item14,item15,item16,item17]
print()
print("The new items to be added are:")
for item in new_item_list:
print(item)
new_item_list_sorted=library.sort_item_list_by_author(new_item_list)
print()
print("The new items after sorting based on the author name are:")
for item in new_item_list_sorted:
print(item.get_author_name())
library.add_new_items(new_item_list_sorted)
print()
print("The final set of items after adding the new item list are:")
for item in library.get_item_list():
print(item)
library.sort_items_by_published_year()
print()
print("The items sorted based on the increasing order of their published year:")
for item in library.get_item_list():
print(item.get_author_name() +" "+ str(item.get_published_year()))
================================================
FILE: DSA in Python/Day-5/Assignment-21.py
================================================
#DSA-Assgn-21
class Queue:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__rear=-1
self.__front=0
def is_full(self):
if(self.__rear==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__front>self.__rear):
return True
return False
def enqueue(self,data):
if(self.is_full()):
print("Queue is full!!!")
else:
self.__rear+=1
self.__elements[self.__rear]=data
def dequeue(self):
if(self.is_empty()):
print("Queue is empty!!!")
else:
data=self.__elements[self.__front]
self.__front+=1
return data
def display(self):
for index in range(self.__front, self.__rear+1):
print(self.__elements[index])
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__front
while(index<=self.__rear):
msg.append((str)(self.__elements[index]))
index+=1
msg=" ".join(msg)
msg="Queue data(Front to Rear): "+msg
return msg
class Stack:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__top=-1
def is_full(self):
if(self.__top==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__top==-1):
return True
return False
def push(self,data):
if(self.is_full()):
print("The stack is full!!")
else:
self.__top+=1
self.__elements[self.__top]=data
def pop(self):
if(self.is_empty()):
print("The stack is empty!!")
else:
data= self.__elements[self.__top]
self.__top-=1
return data
def display(self):
if(self.is_empty()):
print("The stack is empty")
else:
index=self.__top
while(index>=0):
print(self.__elements[index])
index-=1
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__top
while(index>=0):
msg.append((str)(self.__elements[index]))
index-=1
msg=" ".join(msg)
msg="Stack data(Top to Bottom): "+msg
return msg
#Global variables
flight_details=["AI890:BAN:MUM:1400","AI678:BAN:LON:1200","AI345:BAN:CAN:1410","AF780:BAN:AGF:1340","AI001:BAN:AUS:1500","AI404:BAN:NY:1220"]
passenger_details_dict=\
{"LW101":["Amanda","AI678","C7",25],"LW103":["John","AI345","A2",10],"LW107":["Alex","AI678","G5",12],\
"TW700":["Hary","AF780","D2",26],"LW167":["Kate","AI001","G3",25],"LT890":["Wade","AI404","G3",25],\
"TW677":["Preet","AF780","D3",25],"LA106":["Henry","AI001","B5",25.5],"LA104":["Ajay","AI001","A7",23],\
"LW202":["Amy","AI345","C3",24.5],"LT673":["Susan","AI404","J8",5],"TW709":["Tris","AF780","H5",22.5],\
"LA188":["Cameron","AI890","H4",22],"LA902":["Scofield","AI678","G4",23],"TW767":["Pom","AF780","H4",2],\
"LW787":["Burrows","AI890","B4",29],"LW898":["Sara","AI678","E4",14],"LW104":["Williams","AI890","C4",10] }
def find_flights(flight_time):
l=[]
for flight in flight_details:
detail=flight.split(":")
if int(detail[3]) in range(flight_time, flight_time+201):
l.append(flight)
return l
def sortMethod(val):
val1=val.split(":")
return int(val1[3])
def sort_flight_list(flight_list):
flight_list.sort(key=sortMethod)
return flight_list
def get_passenger_details(flight_detail):
l=[]
for key,value in passenger_details_dict.items():
if value[1] in flight_detail:
l.append(key)
return l
def security_check(passenger_pnr_list):
l=[]
for pnr in passenger_pnr_list:
if passenger_details_dict[pnr][3] in range(0,26):
l.append(pnr)
return l
def sortPassenger(value):
'''Followed this method in C++ but cannot be used in python:
# detail1=passenger_details_dict[value1]
# detail2=passenger_details_dict[value1]
# if detail1[2][0]==detail2[2][0]:
# if int(detail1[2][1:])>int(detail2[2][1:]):
# return int(detail2[2][1:])
# else:
# return int(detail1[2][1:])
# elif detail1[2][0]>detail2[2][0]:
# return detail2[2][0]
# else:
# return detail1[2][0]'''
detail=passenger_details_dict[value]
return detail[2]
def sort_passengers(passenger_pnr_list):
passenger_pnr_list.sort(key=sortPassenger)
return passenger_pnr_list
def boarding(passenger_pnr_list):
queue = Queue(len(passenger_pnr_list))
for passenger in passenger_pnr_list:
queue.enqueue(passenger)
return queue
def seating(passenger_queue):
stack=Stack(passenger_queue.get_max_size())
while(not passenger_queue.is_empty()):
stack.push(passenger_queue.dequeue())
return stack
print("The flight details :")
print(flight_details)
print()
print("The passenger details at the airport:")
print(passenger_details_dict)
print()
time=1130
print("Details of the flight between the timings",time,"and",time+200,"are:")
flight_list=find_flights(time)
flight_list=sort_flight_list(flight_list)
print(flight_list)
print()
print("Details of the passengers boarding the flights between the timings ",time,"and",(time+200),"are:")
print()
for i in range(0,len(flight_list)):
flight_data=flight_list[i].split(':')
flight_name=flight_data[0]
passenger_pnr_list=get_passenger_details(flight_list[i])
print("PNR details of the passengers boarding the flight",flight_name,":")
print(passenger_pnr_list)
print()
updated_passenger_pnr_list=security_check(passenger_pnr_list)
print("PNR details of the passengers of flight",flight_name," whose baggage has been cleared:")
print(updated_passenger_pnr_list)
sorted_passenger_pnr_list=sort_passengers(updated_passenger_pnr_list)
print("PNR details of the passengers of flight",flight_name," sorted based on seating number:")
print(sorted_passenger_pnr_list)
print()
print("The PNR details of the passengers at the queue",flight_name,":")
passenger_queue=boarding(updated_passenger_pnr_list)
passenger_queue.display()
print()
seating_stack=seating(passenger_queue)
print("The PNR details of the passengers in the flight",flight_name,":")
seating_stack.display()
================================================
FILE: DSA in Python/Day-5/Assignment-22.py
================================================
#DSA-Assgn-22
class Stack:
def __init__(self,max_size):
self.__max_size=max_size
self.__elements=[None]*self.__max_size
self.__top=-1
def is_full(self):
if(self.__top==self.__max_size-1):
return True
return False
def is_empty(self):
if(self.__top==-1):
return True
return False
def push(self,data):
if(self.is_full()):
print("The stack is full!!")
else:
self.__top+=1
self.__elements[self.__top]=data
def pop(self):
if(self.is_empty()):
print("The stack is empty!!")
else:
data= self.__elements[self.__top]
self.__top-=1
return data
def display(self):
if(self.is_empty()):
print("The stack is empty")
else:
index=self.__top
while(index>=0):
print(self.__elements[index])
index-=1
def get_max_size(self):
return self.__max_size
#You can use the below __str__() to print the elements of the DS object while debugging
def __str__(self):
msg=[]
index=self.__top
while(index>=0):
msg.append((str)(self.__elements[index]))
index-=1
msg=" ".join(msg)
msg="Stack data(Top to Bottom): "+msg
return msg
def merge_stack(stack1,stack2):
l=[]
stack3=Stack(stack1.get_max_size()+stack2.get_max_size())
while(not stack1.is_empty()):
l.append(stack1.pop())
while(not stack2.is_empty()):
l.append(stack2.pop())
l.sort()
for element in l:
stack3.push(element)
return stack3
#Pass different values to the function and test your program
stack2=Stack(3)
stack2.push(9)
stack2.push(11)
stack2.push(15)
stack1=Stack(4)
stack1.push(3)
stack1.push(7)
stack1.push(10)
stack1.push(21)
print("The elements in stack1 are:")
stack1.display()
print("The elements in stack2 are:")
stack2.display()
print()
output_stack=merge_stack(stack1, stack2)
print("The elements in the output stack are:")
output_stack.display()
================================================
FILE: DSA in Python/Day-5/Assignment-23.py
================================================
#DSA-Tryout
'''BEST Question solved till now!!'''
import random
other=['J','K','Q','A']
deck=['C','D','H','S']
def generate_cards_per_type(card_type):
l=[card_type+str(i) for i in [j for j in range(2,11)]+other]
return l
def generate_card_deck():
l=[]
for i in deck:
l.extend(generate_cards_per_type(i))
return l
def shuffle_card_deck(cards_list):
'''
Alternative way of shuffling cards deck is:
random.shuffle(cards_list)
'''
'''As per the given question: '''
new_cards_list=cards_list.copy()
while(new_cards_list):
r1 = random.choice(new_cards_list)
new_cards_list.remove(r1)
r2 = random.choice(new_cards_list)
new_cards_list.remove(r2)
i1=cards_list.index(r1)
i2=cards_list.index(r2)
cards_list[i1]=r2
cards_list[i2]=r1
return cards_list
def cardSort(val):
i=deck.index(val[0])*20
if val[1:] in other:
j=other.index(val[1:])+11
else:
j=int(val[1:])
return (i+j)
def sort_cards_of_each_player(card_list):
card_list.sort(key=cardSort, reverse=True)
return card_list
def allocate_cards_to_players(cards_list):
dictionary={
'player1': [],
'player2': [],
'player3': [],
'player4': []
}
for index,value in enumerate(cards_list):
dictionary['player'+str((index%4)+1)].append(value)
return dictionary
def prepare_cards():
cards_list = generate_card_deck()
new_cards_list = shuffle_card_deck(cards_list)
dictionary= allocate_cards_to_players(new_cards_list)
for i in range(1,5):
dictionary['player'+str(i)]=sort_cards_of_each_player(dictionary['player'+str(i)])
# print(dictionary['player3'])
''' Card-SA is at the highest priority. Hence it always remains at the 0th index of all the deck'''
for i in range(1,5):
# print(dictionary['player'+str(i)][0])
if "SA" in dictionary['player'+str(i)]:
return 'player'+str(i)
first_player=prepare_cards()
print(first_player)
'''Used for testng purpose'''
# # print("The first player is:",first_player)
# # print(generate_cards_per_type('C'))
# cards_list = generate_card_deck()
# # print(cards_list)
# new_cards_list = shuffle_card_deck(cards_list)
# # print(new_cards_list)
# dictionary= allocate_cards_to_players(new_cards_list)
# # print(dictionary)
# # print(dictionary['player1'])
# sorted_cards = sort_cards_of_each_player(['H9', 'H6', 'SK', 'SQ', 'D3', 'S7', 'C4', 'H3', 'S9', 'S8', 'C5', 'D9', 'D6'])
# print("sorted: "+str(sorted_cards))
================================================
FILE: DSA in Python/Day-5/Exercise-17.py
================================================
#DSA-Exer-17
def swap(num_list, first_index, second_index):
#Remove pass and write your logic here
#As python lists are mutable, num_list need not be returned after swapping
temp=num_list[first_index]
num_list[first_index]=num_list[second_index]
num_list[second_index]=temp
#Pass different values to the function and test your program
num_list=[2,3,89,45,67]
print("List before swapping:",num_list)
swap(num_list, 1, 2)
print("List after swapping:",num_list)
================================================
FILE: DSA in Python/Day-5/Exercise-18.py
================================================
#DSA-Exer-18
def find_next_min(num_list,start_index):
#Remove pass and write the logic to find the minimum element in a sub-list and return the index of the identified element in the num_list.
#start_index indicates the start index of the sub-list
small=num_list[start_index]
for i in range(start_index, len(num_list)):
if small>num_list[i]:
small=num_list[i]
return num_list.index(small)
#Pass different values to the function and test your program
num_list=[10,2,100,67]
start_index=1
print("Index of the next minimum element is", find_next_min(num_list,start_index))
================================================
FILE: DSA in Python/Day-5/Exercise-19_SELECTION-SORT-ALGO.py
================================================
#DSA-Exer-19
def swap(num_list, first_index, second_index):
temp=num_list[first_index]
num_list[first_index]=num_list[second_index]
num_list[second_index]=temp
def find_next_min(num_list,start_index):
mini = min(num_list[start_index::])
return num_list.index(mini)
def selection_sort(num_list):
for i in range(len(num_list)):
index = find_next_min(num_list, i)
swap(num_list, i,index)
#Pass different values to the function and test your program
num_list=[8,2,19,34,23, 67, 91]
print("Before sorting;",num_list)
selection_sort(num_list)
print("After sorting:",num_list)
================================================
FILE: DSA in Python/Day-5/Exercise-20_BUBBLE-SORT-ALGO.py
================================================
#DSA-Exer-20
def swap(num_list, first_index, second_index):
temp = num_list[first_index]
num_list[first_index]=num_list[second_index]
num_list[second_index]=temp
def find_next_min(num_list,start_index):
return num_list.index(min(num_list[start_index::]))
def selection_sort(num_list):
for i in range(len(num_list)):
index = find_next_min(num_list, i)
swap(num_list, i, index)
return i
def bubble_sort(num_list):
total_no_of_passes=0
end_index=len(num_list)
for index1 in range(0, end_index-1):
swapped=False
total_no_of_passes+=1
for index2 in range(0, (end_index-index1-1)):
if(num_list[index2]>num_list[index2+1]):
swap(num_list, index2, index2+1)
swapped=True;
if(swapped==False):
break
return total_no_of_passes
num_list=[8,2,19,34,23, 67, 91]
#num_list=[91,8,19,23,34,67,2]
print("Selection Sort - No. of passes:",selection_sort(num_list))
print(num_list)
num_list=[8,2,19,34,23, 67, 91]
#num_list=[91,8,19,23,34,67,2]
print("Bubble Sort - No. of passes:",bubble_sort(num_list))
================================================
FILE: DSA in Python/Day-5/Exercise-21_MERGE-SORT-ALGO.py
================================================
#DSA-Exer-21
def merge_sort(num_list):
low=0
high=len(num_list)-1
if low==high:
return num_list
else:
left_list=num_list[:(len(num_list)//2)]
right_list=num_list[(len(num_list)//2):]
list1=merge_sort(left_list)
list2=merge_sort(right_list)
sorted_list=merge(list1, list2)
return sorted_list
def merge(left_list,right_list):
i,j=0,0
sorted_list=[]
while(i<len(left_list) and j<len(right_list)):
if left_list[i]<=right_list[j]:
sorted_list.append(left_list[i])
i+=1
else:
sorted_list.append(right_list[j])
j+=1
if i<len(left_list):
sorted_list.extend(left_list[i::])
if j<len(right_list):
sorted_list.extend(right_list[j::])
return sorted_list
num_list=[34, 67, 8, 19, 2, 23, 1, 91]
print("Before sorting:",num_list)
sorted_list = merge_sort(num_list)
print("After sorting:",sorted_list)
================================================
FILE: DSA in Python/Day-5/Exercise-22.py
================================================
#DSA-Exer-22
def order_heights(student_list,height_list):
new_list=height_list.copy()
students=[]
new_list.sort()
for height in new_list:
students.append(student_list[height_list.index(height)])
return[students,new_list]
#Pass different values to the function and test your program
student_list=["Santa","Tris","Arun","Rachel","John"]
height_list=[132.7,129.2,135,130.6,140]
print("Initial student details :")
print("The students:",student_list)
print("Their heights:",height_list)
print()
result=order_heights(student_list,height_list)
print("After arranging the students in the order of their height:")
print("The students :",result[0])
print("Their heights:",result[1])
================================================
FILE: DSA in Python/Day-5/Exercise-23.py
================================================
#DSA-Exer-23
def arrange_tickets(tickets_list):
new_list=[]
for i in range(1,21):
if "T"+str(i) in tickets_list:
new_list.append("T"+str(i))
else:
if i<=10:
new_list.append('V')
print(new_list)
counter=10
for index,ticket in enumerate(new_list):
if ticket=='V' and index<=10:
new_list[index]=new_list[counter]
counter+=1
return new_list[:10]
tickets_list = ['T5', 'T17', 'T10', 'T2', 'T9', 'T15', 'T17', 'T19', 'T16', 'T1', 'T12', 'T13']
print("Ticket ids of all the available students :")
print(tickets_list)
result=arrange_tickets(tickets_list)
print()
print("Ticket ids of the ten students in Group-1:")
print(result)
================================================
FILE: DSA in Python/Day-6/Exercise-24.py
================================================
#DSA-Exer-24
def make_change(denomination_list, amount):
'''Remove pass and implement the Greedy approach to make the change for the amount using the currencies in the denomination list.
The function should return the total number of notes needed to make the change. If change cannot be obtained for the given amount, then return -1. Return 1 if the amount is equal to one of the currencies available in the denomination list. '''
denomination_list.sort()
l=[]
current_amount=amount
while(sum(l)!=amount):
if amount in denomination_list:
return 1
else:
i=len(denomination_list)
maxi=max(denomination_list[0:i])
while(maxi>current_amount):
if i:
maxi=max(denomination_list[0:i])
i-=1
else:
return -1
l.append(maxi)
current_amount-=maxi
print(l)
return len(l)
#Pass different values to the function and test your program
amount= 3
denomination_list = [10,20,30]
print(make_change(denomination_list, amount))
================================================
FILE: DSA in Python/Day-6/Exercise-25.py
================================================
#DSA-Exer-25
def sortActivity(value):
return value[1]
def sortActivities(value):
return len(value)
def find_maximum_activities(activity_list,start_time_list, finish_time_list):
activity_details = list(zip(activity_list,start_time_list, finish_time_list))
activity_details.sort(key=sortActivity)
print(activity_details)
x=[]
for i in range(len(activity_details)):
l=[activity_details[i]]
for index,activity in enumerate(activity_details):
if index>i:
if activity[1]>l[len(l)-1][2]:
l.append(activity)
x.append(l)
x.sort(key=sortActivities, reverse=True)
print(x)
y=[]
for i in x[0]:
y.append(i[0])
print("y is: "+str(y))
'''Unusual Output required - The test cases donot pass successfully if we skip the below 3 lines of code for case when list has one element. This situation is not given in the question.'''
if len(y)==1:
y=[]
y.append(x[1][0][0])#if only one task can be completed then return the second task.This is however not given in the question.
return y
#Pass different values to the function and test your program
# activity_list=[1,2,3,4,5,6,7]
# start_time_list=[1,4,2,3,6,8,6]
# finish_time_list=[2,6,4,5,7,10,9]
# activity_list=[11, 12, 32, 44, 53, 62]
# start_time_list=[12, 14, 21, 31, 16, 18]
# finish_time_list=[20, 16, 25, 35, 17, 20]
activity_list=[10, 20, 30, 40]
start_time_list=[1, 5, 10, 15]
finish_time_list=[20, 19, 24, 25]
# activity_list = [1, 2, 3, 4, 5, 6]
# start_time_list = [5, 4, 8, 2, 3, 1]
# finish_time_list = [13, 6, 16, 7, 5, 4]
print("Activities:",activity_list)
print("Start time of the activities:",start_time_list)
print("Finishing time of the activities:", finish_time_list)
result=find_maximum_activities(activity_list,start_time_list, finish_time_list)
print("The maximum set of activities that can be completed:",result)
================================================
FILE: OOP in Python/Day-1/Assignment-1.txt
================================================
Customer, Item and Employee will be objects.
================================================
FILE: OOP in Python/Day-1/Assignment-2.txt
================================================
Customer:
Attributes:customer_name, bill_amount
Methods: purchases(),pays_bill(amount)
Item:
Attributes: item_id, description, price_per_unit
Methods:
Employee:
Attributes: designation, emp_name
Methods:
================================================
FILE: OOP in Python/Day-1/assignment-3.py
================================================
#OOPR-Assgn-3
class Customer:
def __init__(self):
self.customer_name="Omkar"
self.bill_amount=0
def pays_bill(self, amount):
print(self.customer_name+" pays bill amount of Rs. "+ str(amount))
def purchases(self):
self.bill_amount=200
pay_bill=self.bill_amount*0.95
self.pays_bill(pay_bill)
c1 = Customer()
c1.purchases()
================================================
FILE: OOP in Python/Day-1/assignment-4.py
================================================
def check_type(type):
vehicle_type=['Two Wheeler', 'Four Wheeler']
if type not in vehicle_type:
return 0
return 1
class Vehicle:
def __init__(self):
pass
def set_vehicle_id(self,id):
self.__vehicle_id=id
def set_vehicle_type(self,type):
if check_type(type):
self.__vehicle_type=type
else:
return "invalid Vehicle DETAILS"
def set_vehicle_cost(self,cost):
self.__vehicle_cost=cost
def get_vehicle_id(self):
return self.__vehicle_id
def get_vehicle_type(self):
return self.__vehicle_type
def get_vehicle_cost(self):
return self.__vehicle_cost
id = property(get_vehicle_id, set_vehicle_id)
type = property(get_vehicle_type, set_vehicle_type)
cost = property(get_vehicle_cost, set_vehicle_cost)
v1 = Vehicle()
v1.id=10
print(v1.id)
================================================
FILE: OOP in Python/Day-1/assignment-8.py
================================================
#OOPR-Assgn-8
student_id_counter=1
class Student:
def __init__(self):
self.__student_id=None
self.__marks=None
self.__age=None
def validate_marks(self):
if self.__marks>=0 and self.__marks<=100:
return True
else:
return False
def validate_age(self):
if self.__age>20:
return True
else:
return False
def check_qualification(self):
if self.validate_age() and self.validate_marks():
if self.__marks>=65:
return True
return False
def set_student_id(self):
global student_id_counter
self.__student_id=student_id_counter
student_id_counter=student_id_counter+1
def get_student_id(self):
return self.__student_id
def set_marks(self, marks):
self.__marks=marks
def get_marks(self):
return self.__marks
def set_age(self, age):
self.__age=age
def get_age(self):
return self.__age
#id = property(set_student_id, get_student_id)
#marks = property(set_marks, get_marks)
#age = property(set_age, get_age)
s1=Student()
s1.set_student_id()
print(s1.get_student_id())
s1.set_age(21)
print(s1.get_age())
s1.set_marks(66)
print(s1.get_marks())
s1.check_qualification()
================================================
FILE: OOP in Python/Day-1/assignment-9.py
================================================
#OOPR-Assgn-9
courses = {
1001 : 25575.0,
1002 : 15500.0
}
class Student:
def __init__(self):
self.__student_id=None
self.__marks=None
self.__age=None
self.__course_id=None
self.__fees=None
def choose_course(self,course_id):
if course_id in courses.keys():
self.__course_id = course_id
if self.__marks>85:
self.__fees=courses[course_id]*0.75
else:
self.__fees=courses[course_id]*1.0
return True
else:
return False
def get_course_id(self):
return self.__course_id
def get_fees(self):
return self.__fees
def validate_marks(self):
if self.__marks>=0 and self.__marks<=100:
return True
else:
return False
def validate_age(self):
if self.__age>20:
return True
else:
return False
def check_qualification(self):
if self.validate_age() and self.validate_marks():
if self.__marks>=65:
return True
return False
def set_student_id(self, sid):
self.__student_id=sid
def get_student_id(self):
return self.__student_id
def set_marks(self, marks):
self.__marks=marks
def get_marks(self):
return self.__marks
def set_age(self, age):
self.__age=age
def get_age(self):
return self.__age
maddy=Student()
maddy.set_student_id(1004)
maddy.set_age(21)
maddy.set_marks(65)
if(maddy.check_qualification()):
print("Student has qualified")
if(maddy.choose_course(1002)):
print("Course allocated")
else:
print("Invalid course id")
else:
print("Student has not qualified")
================================================
FILE: OOP in Python/Day-2/assignment-10.py
================================================
#OOPR-Assgn-10
#Efficient Program by Minal Kaminwar
class CallDetail:
def __init__(self, phoneno, called_no, duration, call_type):
self.__phoneno=phoneno
self.__called_no=called_no
self.__duration=duration
self.__call_type=call_type
class Util:
def __init__(self):
self.list_of_call_objects=None
def parse_customer(self,list_of_call_string):
self.list_of_call_objects=[]
for each_call in list_of_call_string:
call_detail_list=each_call.split(",")
# print(call_detail_list)
# obj=[]
# for attribute in call_detail_list:
# obj.append(attribute)
a=CallDetail(call_detail_list[0],call_detail_list[1],call_detail_list[2],call_detail_list[3])
self.list_of_call_objects.append(a)
call='9990000001,9330000001,23,STD'
call2='9990000001,9330000002,54,Local'
call3='9990000001,9330000003,6,ISD'
list_of_call_string=[call,call2,call3]
Util().parse_customer(['9990000001,9330000001,23,STD', '9990000001,9330000002,54,Local', '9990000001,9330000003,6,ISD'])
================================================
FILE: OOP in Python/Day-2/assignment-11.py
================================================
#OOPR-Assgn-11
flowers=['Orchid','Rose','Jasmine']
levels=[15,25,40]
class Flower:
def __init__(self):
self.__flower_name=None
self.__price_per_kg=None
self.__stock_available=None
def validate_flower(self):
if self.__flower_name in flowers:
return True
else:
return False
def validate_stock(self, required_quantity):
if self.__stock_available>=required_quantity:
return True
else:
return False
def sell_flower(self,required_quantity):
if self.validate_flower() and self.validate_stock(required_quantity):
self.__stock_available -= required_quantity
def check_level(self):
if self.validate_flower():
flower_level=levels[flowers.index(self.__flower_name)]
if self.__stock_available<flower_level:
return True
return False
def get_flower_name(self):
return self.__flower_name
def get_price_per_kg(self):
return self.__price_per_kg
def get_stock_available(self):
return self.__stock_available
def set_flower_name(self, flower_name):
self.__flower_name=flower_name.title()
def set_price_per_kg(self,price_per_kg):
self.__price_per_kg=price_per_kg
def set_stock_available(self, stock_available):
self.__stock_available=stock_available
a=Flower()
a.set_flower_name('Rose')
a.set_price_per_kg(200)
a.set_stock_available(25)
print(a.check_level())
#flower_name-Roseprice_per_kg-200stock_available-25
================================================
FILE: OOP in Python/Day-2/assignment-12.py
================================================
#OOPR-Assgn-12
class Bill:
def __init__(self, bill_id, patient_name):
self.__bill_id=bill_id
self.__patient_name=patient_name
self.__bill_amount=0
def get_bill_id(self):
return self.__bill_id
def get_patient_name(self):
return self.__patient_name
def get_bill_amount(self):
return self.__bill_amount
def calculate_bill_amount(self, consultation_fees, quantity_list, price_list):
for i in range(len(quantity_list)):
self.__bill_amount += (quantity_list[i]*price_list[i])
self.__bill_amount += consultation_fees
print(self.get_bill_id())
print(self.get_patient_name())
print(self.get_bill_amount())
a=Bill(1,"Omkar")
a.calculate_bill_amount(50,[2,3],[1,2])
a.get_bill_id()
================================================
FILE: OOP in Python/Day-3/Assignment-19.txt
================================================
#OOPR-Assgn-20
class Applicant:
__application_dict={'A': 0, 'B': 4, 'C': 0}
__applicant_id_count=1000
def __init__(self, applicant_name):
self.__applicant_id=0
self.__applicant_name=applicant_name
self.__job_band=None
def get_applicant_id(self):
return self.__applicant_id
def get_applicant_name(self):
return self.__applicant_name
def get_job_band(self):
return self.__job_band
@staticmethod
def get_application_dict():
return __application_dict
def generate_applicant_id(self):
self.__applicant_id=Applicant.__applicant_id_count+1
Applicant.__applicant_id_count+=1
def apply_for_job(self, job_band):
for key,value in Applicant.__application_dict.items():
if key == job_band:
if value<5:
Applicant.__application_dict[key]+=1
self.generate_applicant_id()
self.__job_band=job_band
else:
return -1
a= Applicant("Jack")
a.apply_for_job("B")
================================================
FILE: OOP in Python/Day-3/Assignment-20.txt
================================================
#OOPR-Assgn-20
class Applicant:
__application_dict={'A': 0, 'B': 4, 'C': 0}
__applicant_id_count=1000
def __init__(self, applicant_name):
self.__applicant_id=0
self.__applicant_name=applicant_name
self.__job_band=None
def get_applicant_id(self):
return self.__applicant_id
def get_applicant_name(self):
return self.__applicant_name
def get_job_band(self):
return self.__job_band
@staticmethod
def get_application_dict():
return __application_dict
def generate_applicant_id(self):
self.__applicant_id=Applicant.__applicant_id_count+1
Applicant.__applicant_id_count+=1
def apply_for_job(self, job_band):
for key,value in Applicant.__application_dict.items():
if key == job_band:
if value<5:
Applicant.__application_dict[key]+=1
self.generate_applicant_id()
self.__job_band=job_band
else:
return -1
a= Applicant("Jack")
a.apply_for_job("B")
================================================
FILE: OOP in Python/Day-3/Assignment-21.txt
================================================
#OOPR-Assgn-21
class Patient:
def __init__(self,patient_id,patient_name,list_of_lab_test_ids):
self.__patient_id=patient_id
self.__patient_name=patient_name
self.__list_of_lab_test_ids=list_of_lab_test_ids
self.__lab_test_charge=0
def get_patient_id(self):
return self.__patient_id
def get_patient_name(self):
return self.__patient_name
def get_list_of_lab_test_ids(self):
return self.__list_of_lab_test_ids
def get_lab_test_charge(self):
return self.__lab_test_charge
def calculate_lab_test_charge(self):
self.__lab_test_charge=0.0
for test in self.__list_of_lab_test_ids:
if LabTestRepository.get_test_charge(test)>0:
self.__lab_test_charge+=LabTestRepository.get_test_charge(test)
#Remove pass and write the logic here.
class LabTestRepository:
__list_of_hospital_lab_test_ids=["L101","L102","L103","L104"]
__list_of_lab_test_charge=[2020,1750.50,5700,1320.50]
@staticmethod
def get_test_charge(lab_test_id):
if lab_test_id in LabTestRepository.__list_of_hospital_lab_test_ids:
return LabTestRepository.__list_of_lab_test_charge[LabTestRepository.__list_of_hospital_lab_test_ids.index(lab_test_id)]
else:
return -1
lab_test_list1=["L101","L103","L104",'L105']
patient1=Patient(1010,"Sam",lab_test_list1)
patient1.calculate_lab_test_charge()
print("Patient id:",patient1.get_patient_id(),"\nPatient name:",patient1.get_patient_name(),"\nPatient's test ids:",patient1.get_list_of_lab_test_ids(), "\nTotal lab test charge:",patient1.get_lab_test_charge())
a=LabTestRepository()
print(a.get_test_charge('L105'))
================================================
FILE: OOP in Python/Day-3/assignment-15.py
================================================
#OOPR-Assgn-15
class Parrot:
__counter=7000
def __init__(self, name, color):
self.__unique_number=Parrot.__counter+1
self.__color=color
self.__name=name
Parrot.__counter+=1
def get_unique_number(self):
return self.__unique_number
def get_color(self):
return self.__color
def get_name(self):
return self.__name
p1=Parrot("blue", "Sam")
p2=Parrot("blue", "Sm")
p3=Parrot("blue", "Sm")
p4=Parrot("blue", "Sm")
p5=Parrot("blue", "Sm")
p6=Parrot("blue", "Sm")
print(Parrot._Parrot__counter)
================================================
FILE: OOP in Python/Day-3/assignment-16.py
================================================
#OOPR-Assgn-16
class Customer:
def __init__(self,phone_no,name,age):
self.phone_no=phone_no
self.name=name
self.age=age
self.list_of_calls=None
class CallDetail:
def __init__(self,phone_no,called_no,duration):
self.phone_no=phone_no
self.called_no=called_no
self.duration=duration
class Util:
def __init__(self):
self.list_of_customer_calldetail_objects=None
def parse_customer(self,list_of_customers,list_of_calls):
self.list_of_customer_calldetail_objects=[]
for customer in list_of_customers:
customer.list_of_calls=[]
for call in list_of_calls:
if customer.phone_no == call.phone_no:
customer.list_of_calls.append(call)
self.list_of_customer_calldetail_objects.append(customer)
cust1=Customer(9900009901,'cust1',23)
cust2=Customer(9900009902,'cust2',24)
cust3=Customer(9900009903,'cust3',25)
list_of_customers=[cust1,cust2,cust3]
call1=CallDetail(9900009901,8800123401,5)
call2=CallDetail(9900009903,8800123402,10)
call3=CallDetail(9900009902,8800123403,2)
call4=CallDetail(9900009901,8800123404,8)
call5=CallDetail(9900009901,8800123405,7)
call6=CallDetail(9900009903,8800123406,9)
call7=CallDetail(9900009903,8800123407,4)
list_of_calls=[call1,call2,call3,call4,call5,call6,call7]
print(Util().parse_customer(list_of_customers, list_of_calls))
================================================
FILE: OOP in Python/Day-3/assignment-17.py
================================================
#OOPR-Assgn-17
class Freight:
counter=198
def __init__(self, recipient_customer, from_customer, weight, distance):
self.__recipient_customer=recipient_customer
self.__from_customer=from_customer
self.__weight=weight
self.__distance=distance
self.__freight_id=0
self.__freight_charge=0
def validate_weight(self):
if self.__weight%5==0:
return True
else:
return False
def validate_distance(self):
if self.__distance>=500 and self.__distance<=5000:
return True
else:
return False
def forward_cargo(self):
if Customer.validate_customer_id(self.__from_customer) and Customer.validate_customer_id(self.__recipient_customer) and self.validate_distance() and self.validate_weight():
self.__freight_id = Freight.counter+2
Freight.counter += 2
self.__freight_charge=(self.__weight*150)+(self.__distance*60)
else:
self.__freight_charge=0
def get_freight_charge(self):
return self.__freight_charge
def get_freight_id(self):
return self.__freight_id
def get_recipient_customer(self):
self.__recipient_customer
def get_from_customer(self):
self.__from_customer
def get_weight(self):
self.__weight
def get_distance(self):
self.__distance
class Customer:
def __init__(self, customer_id, customer_name, address):
self.__customer_id = customer_id
self.__customer_name = customer_name
self.__address = address
def validate_customer_id(self):
id=str(self.__customer_id)
if(id[0]=='1' and len(id)==6):
return True
else:
return False
def get_customer_id(self):
return self.__customer_id
def get_customer_name(self):
return self.__customer_name
def get_address(self):
return self.__address
c1=Customer(112345,"jill","chennai")
c2=Customer(2,"Omkar123","hedvgsdv")
f1=Freight(c1,c2,5,500)
================================================
FILE: OOP in Python/Day-3/assignment-18.py
================================================
#OOPR-Assgn-18
#OOPR-Assgn-18
items=[]
class Item:
def __init__(self,item_id,description,price_per_quantity):
self.__item_id=item_id.upper()
self.__description=description.upper()
self.__price_per_quantity=price_per_quantity
items.append(self)
def get_item_id(self):
return self.__item_id
def get_description(self):
return self.__description
def get_price_per_quantity(self):
return self.__price_per_quantity
class Bill:
counter=1000
def __init__(self):
self.__bill_id=1000
self.__bill_amount=0
def generate_bill_amount(self,item_quantity, items):
if not self.__bill_amount:
for key,value in item_quantity.items():
for item in items:
if item.get_item_id()==key.upper():
self.__bill_amount += value*item.get_price_per_quantity()
continue
if self.__bill_amount>0:
self.__bill_id="B"+str(Bill.counter+1)
Bill.counter += 1
def get_bill_id(self):
return self.__bill_id
def get_bill_amount(self):
return self.__bill_amount
class Customer:
def __init__(self, customer_name):
self.__customer_name=customer_name
self.__payment_status=None
def pays_bill(self,bill):
self.__payment_status="Paid"
print(self.get_customer_name())
print(bill.get_bill_id())
print(bill.get_bill_amount())
def get_customer_name(self):
return self.__customer_name
def get_payment_status(self):
return self.__payment_status
item_quantity = {'Ir987':3, 'IR346':2, 'IR658':4, 'IR123':2}
c=Customer("Omkar")
i1=Item("IR987","Sunfeast Marie",100.0)
i2=Item("ir658","Kellogs Oats",151.0)
i3=Item("Ir346","Maggie Noodles",35.75)
i4=Item("iR234","Kissan Jam",100.0)
i5=Item("IR123","Nescafe",55.5)
i6=Item("IR111","Milk",100.0)
b=Bill()
b.generate_bill_amount(item_quantity,items)
b.generate_bill_amount(item_quantity,items)
b.generate_bill_amount(item_quantity,items)
b.generate_bill_amount(item_quantity,items)
b.generate_bill_amount(item_quantity,items)
c.pays_bill(b)
print(b.get_bill_id())
print(b.get_bill_amount())
# c.pays_bill(b)
================================================
FILE: OOP in Python/Day-4/Assignment-24.py
================================================
#OOPR-Assgn-24
class Apparel:
counter=100
def __init__(self, price, item_type):
self.__item_id=item_type[0].upper()+str(Apparel.counter+1)
self.__price=price
self.__item_type=item_type.title()
Apparel.counter+=1
def get_item_id(self):
return self.__item_id
def get_item_type(self):
return self.__item_type
def get_price(self):
return self.__price
def calculate_price(self):
self.__price *= 1.05
def set_price(self, price):
self.__price=price
class Cotton(Apparel):
def __init__(self, price,discount):
Apparel.__init__(self, price, "Cotton")
self.__discount = discount
def calculate_price(self):
Apparel.calculate_price(self)
price = Apparel.get_price(self)
price *= (1-((self.__discount)/100))
price *= (1.05)
Apparel.set_price(self, price)
def get_discount(self):
return self.__discount
class Silk(Apparel):
def __init__(self, price):
Apparel.__init__(self, price, "Silk")
self.__points=0
def calculate_price(self):
Apparel.calculate_price(self)
price = self.get_price()
if price >10000:
self.__points +=10
else:
self.__points += 3
price = price * 1.10
Apparel.set_price(self, price)
def get_points(self):
return self.__points
a = Silk(1320)
a.calculate_price()
================================================
FILE: OOP in Python/Day-4/Assignment-25.py
================================================
#OOPR-Assgn-25
class FruitInfo:
__fruit_name_list=['Apple', 'Guava', 'Orange', 'Grape', 'Sweet Lime']
__fruit_price_list=[100, 800, 70, 110, 600]
@staticmethod
def get_fruit_price(fruit_name):
if fruit_name.title() in FruitInfo.__fruit_name_list:
return FruitInfo.__fruit_price_list[FruitInfo.__fruit_name_list.index(fruit_name.title())]
else:
return -1
@staticmethod
def get_fruit_name_list():
return FruitInfo.__fruit_name_list
@staticmethod
def get_fruit_price_list():
return FruitInfo.__fruit_price_list
class Purchase:
__counter=101
def __init__(self, customer,fruit_name, quantity):
self.__purchase_id=None
self.__customer=customer
self.__fruit_name=fruit_name.title()
self.__quantity=quantity
def get_purchase_id(self):
return self.__purchase_id
def get_customer(self):
return self.__customer
def get_quantity(self):
return self.__quantity
def calculate_price(self):
each_fruit_price=FruitInfo.get_fruit_price(self.__fruit_name)
if each_fruit_price>0:
self.__purchase_id = 'P' + str(Purchase.__counter)
Purchase.__counter += 1
price=each_fruit_price*self.__quantity
if each_fruit_price==max(FruitInfo.get_fruit_price_list()) and self.__quantity>1:
price*=0.98
if each_fruit_price==min(FruitInfo.get_fruit_price_list()) and self.__quantity>=5:
price*=0.95
#even if you insert 'Wholesale' in customer type, and check here for 'Wholesale'(i.e if Customer.get_cust_type(self.__customer) is 'Wholesale' and you are checking against 'Wholesale'), still the program will not pass all the test cases. It has to be 'wholesale' and not 'Wholesale'. So it is very very important to read the question carefully and only mention those words/letters as instructed in the questoion.
if Customer.get_cust_type(self.__customer)=='wholesale':
price*=0.90
return (price)
else:
return -1
class Customer():
def __init__(self, customer_name, cust_type):
self.__customer_name=customer_name.title()
#self.__cust_type=cust_type.title() will give wrong answer because in the question it is clearly mentioned that if the customer_type is 'wholesale' not 'Wholesale'. Also check at Line 40
self.__cust_type=cust_type.lower()
def get_customer_name(self):
return self.__customer_name
def get_cust_type(self):
return self.__cust_type
c=Customer("Tom", "wholesale")
p=Purchase(c,"Orange", 5)
print(p.calculate_price())
================================================
FILE: OOP in Python/Day-4/Assignment-27.py
================================================
#OOPR-Assgn-27
#This class represents ThemePark
class ThemePark:
#dict_of_games contains the game name as key, price/ride and points that can be earned by customer in a list as value
dict_of_games={"Game1":[35.5,5], "Game2":[40.0,6],"Game3":[120.0,10], "Game4":[60.0,7],"Game5":[25.0,4]}
@staticmethod
def validate_game(game_input):
if game_input.title() in ThemePark.dict_of_games.keys():
return True
else:
return False
#If game_input is present in ThemePark, return true. Else, return false.
@staticmethod
def get_points(game_input):
for game,point in ThemePark.dict_of_games.items():
if game_input.title()==game:
return point[1]
#Return the points that can be earned for the given game_input.
@staticmethod
def get_amount(game_input):
for game,point in ThemePark.dict_of_games.items():
if game_input.title()==game:
return point[0]
#Return the price/ride for the given game_input
#This class represents ticket
class Ticket:
__ticket_count=200
def __init__(self):
self.__ticket_id=None
self.__ticket_amount=0
def generate_ticket_id(self):
self.__ticket_id=Ticket.__ticket_count+1
Ticket.__ticket_count+=1
#Auto-generate ticket_id starting from 201
def calculate_amount(self, list_of_games):
for game in list_of_games:
if ThemePark.validate_game(game):
self.__ticket_amount+=ThemePark.get_amount(game)
else:
self.__ticket_amount=0
return False
return True
'''Validate the games in the list_of_games.
If all games are valid, calculate total ticket amount and assign it to attribute, ticket_amount and return true. Else, return false'''
def get_ticket_id(self):
return self.__ticket_id
def get_ticket_amount(self):
return self.__ticket_amount
class Customer:
def __init__(self, name, list_of_games):
self.__name=name
self.__list_of_games=list_of_games
self.__ticket=Ticket()
self.__points_earned=0
self.__food_coupon="No"
def play_game(self):
for game in self.__list_of_games:
self.__points_earned+=ThemePark.get_points(game)
if game=="Game3":
self.__list_of_games.append("Game2")
def update_food_coupon(self):
if "Game4" in self.__list_of_games and self.__points_earned>15:
self.__food_coupon="Yes"
def book_ticket(self):
if Ticket.calculate_amount(self.__ticket, self.__list_of_games):
Ticket.generate_ticket_id(self.__ticket)
self.play_game()
self.update_food_coupon()
return True
else:
return False
def get_name(self):
return self.__name
def get_list_of_games(self):
return self.__list_of_games
def get_ticket(self):
return self.__ticket
def get_points_earned(self):
return self.__points_earned
def get_food_coupon(self):
return self.__food_coupon
'''Represent customers and display all details of the customer, if he is able to book the ticket and play the game. Else, display appropriate error message '''
================================================
FILE: OOP in Python/Day-5/Assignment-29.py
================================================
#OOPR-Assgn-29
from abc import ABCMeta, abstractmethod
class Customer(metaclass=ABCMeta):
def __init__(self,customer_name):
self.bill_id=0
self.__customer_name=customer_name.title()
self.bill_amount=0
@abstractmethod
def calculate_bill_amount(self):
pass
def get_customer_name(self):
return self.__customer_name
class OccasionalCustomer(Customer):
__counter=1000
def __init__(self, customer_name, distance_in_kms):
self.__distance_in_kms=distance_in_kms
Customer.__init__(self, customer_name)
self.bill_id="O"+str(OccasionalCustomer.__counter+1)
OccasionalCustomer.__counter+=1
def validate_distance_in_kms(self):
if self.__distance_in_kms>=1 and self.__distance_in_kms<=5:
return True
else:
return False
def calculate_bill_amount(self):
if self.validate_distance_in_kms():
tiffin_cost=50
distance=1
while(distance<=self.__distance_in_kms):
if distance in [1,2]:
self.bill_amount=self.__distance_in_kms*5
if distance in range(3,6):
self.bill_amount=self.__distance_in_kms*7.5
distance += 1
self.bill_amount+=tiffin_cost
return self.bill_amount
else:
self.bill_amount=-1
return self.bill_amount
def get_distance_in_kms(self):
return self.__distance_in_kms
class RegularCustomer(Customer):
__counter=100
def __init__(self, customer_name, no_of_tiffin):
self.__no_of_tiffin=no_of_tiffin
Customer.__init__(self, customer_name)
self.bill_id="R"+str(RegularCustomer.__counter+1)
RegularCustomer.__counter+=1
def validate_no_of_tiffin(self):
if self.__no_of_tiffin in range(1,8):
return True
else:
return False
def calculate_bill_amount(self):
if self.validate_no_of_tiffin():
tiffin_cost=50
self.bill_amount=tiffin_cost*self.__no_of_tiffin*7
return self.bill_amount
else:
self.bill_amount=-1
return self.bill_amount
def get_no_of_tiffin(self):
return self.__no_of_tiffin
o=OccasionalCustomer("David", 5)
print(o.calculate_bill_amount())
================================================
FILE: OOP in Python/Day-5/Assignment-30.py
================================================
#OOPR-Assgn-30
types=['small', 'medium', 'Small', 'Medium']
class Customer:
def __init__(self, customer_name, quantity):
self.__customer_name=customer_name.title()
self.__quantity=quantity
def validate_quantity(self):
if self.__quantity in range(1,6):
return True
else:
return False
def get_customer_name(self):
return self.__customer_name
def get_quantity(self):
return self.__quantity
class Pizzaservice:
counter=100
def __init__(self, customer, pizza_type, additional_topping):
self.__customer = customer
self.__pizza_type = pizza_type
self.__additional_topping = additional_topping
self.pizza_cost = 0
self.__service_id=None
def validate_pizza_type(self):
if self.__pizza_type.lower() in types:
return True
else:
return False
def calculate_pizza_cost(self):
if self.validate_pizza_type() and Customer.validate_quantity(self.__customer):
if self.__pizza_type.title() == "Small" :
self.pizza_cost=150 * Customer.get_quantity(self.__customer)
if self.__additional_topping:
self.pizza_cost+=35 * Customer.get_quantity(self.__customer)
if self.__pizza_type.title()=="Medium":
self.pizza_cost=200 * Customer.get_quantity(self.__customer)
if self.__additional_topping:
self.pizza_cost+=50 * Customer.get_quantity(self.__customer)
if not self.__service_id:
self.__service_id = self.__pizza_type[0] + str(Pizzaservice.counter+1)
Pizzaservice.counter+=1
else:
self.pizza_cost=-1
def get_service_id(self):
return self.__service_id
def get_pizza_type(self):
return self.__pizza_type
def get_customer(self):
return self.__customer
def get_additional_topping(self):
return self.__additional_topping
class Doordelivery(Pizzaservice):
def __init__(self, customer, pizza_type, additional_topping, distance_in_kms):
self.__delivery_charge=0
self.__distance_in_kms = distance_in_kms
Pizzaservice.__init__(self, customer, pizza_type, additional_topping)
def validate_distance_in_kms(self):
if self.__distance_in_kms in range(1,11):
return True
else:
return False
def calculate_pizza_cost(self):
if self.validate_distance_in_kms():
Pizzaservice.calculate_pizza_cost(self)
if self.pizza_cost!= -1:
distance=1
while(distance<=self.__distance_in_kms):
if distance in range(1,6):
self.pizza_cost += 5
if distance in range(6,11):
self.pizza_cost += 7
distance += 1
else:
self.pizza_cost = -1
def get_delivery_charge(self):
return self.__delivery_charge
def get_distance_in_kms(self):
return self.__distance_in_kms
c = Customer("Asha", 5)
d = Pizzaservice(c, "MEDIUM", True)
d.calculate_pizza_cost()
d.calculate_pizza_cost()
d.calculate_pizza_cost()
d.calculate_pizza_cost()
d.calculate_pizza_cost()
print(d.pizza_cost)
print(d.get_service_id())
================================================
FILE: OOP in Python/Day-5/Assignment-31.py
================================================
#OOPR-Assgn-31
import math
from abc import ABCMeta, abstractmethod
# metaclass=ABCMeta):
class Logistics(metaclass=ABCMeta):
__counter=None
def __init__(self,start_reading,end_reading):
self.__consumer_id=None
self.__start_reading=start_reading
self.__end_reading=end_reading
def get_consumer_id(self):
return self.__consumer_id
def get_start_reading(self):
return self.__start_reading
def get_end_reading(self):
return self.__end_reading
def validate_meter_reading(self):
if(self.__start_reading >= self.__end_reading):
return False
else:
return True
def generate_consumer_id(self):
if not Logistics.__counter:
Logistics.__counter=7000
if not self.__consumer_id:
self.__consumer_id = Logistics.__counter + 1
Logistics.__counter += 1
@abstractmethod
def calculate_bill_amount(self):
pass
class PassengerLogistics(Logistics):
__list_vehicle=["BMW","TOYOTA","FORD"]
__list_minimum_charge=[3000,1500,1000]
__list_charge_for_hundred=[30,15,10]
__list_charge_after_hundred=[25,12,7]
def __init__(self,vehicle_type,start_reading,end_reading):
super().__init__(start_reading,end_reading)
self.__vehicle_type=vehicle_type
def get_vehicle_type(self):
return self.__vehicle_type
def validate_vehicle_type(self):
for index in range(0,len(PassengerLogistics.__list_vehicle)):
if(PassengerLogistics.__list_vehicle[index]==self.__vehicle_type):
return index
return -1
def calculate_bill_amount(self):
if self.validate_vehicle_type()>=0 and self.validate_meter_reading():
self.generate_consumer_id()
distance_travelled = self.get_end_reading() - self.get_start_reading()
distance = 1
bill_amount=0
index = PassengerLogistics.__list_vehicle.index(self.get_vehicle_type())
while(distance<=distance_travelled):
if distance<=100:
bill_amount+=PassengerLogistics.__list_charge_for_hundred[index]
if distance>100:
bill_amount+=PassengerLogistics.__list_charge_after_hundred[index]
distance += 1
if PassengerLogistics.__list_minimum_charge[index]>bill_amount:
bill_amount=PassengerLogistics.__list_minimum_charge[index]
bill_amount*=1.05
return bill_amount
else:
bill_amount=-1
return bill_amount
class GoodsLogistics(Logistics):
__carrier_dict={"EICHER": 38, "FORCE": 42, "TATA": 25} # stores the carrier type and rate per kilometer for 1000kg
def __init__(self,carrier_type,goods_weight,start_reading,end_reading):
super().__init__(start_reading,end_reading)
self.__carrier_type=carrier_type
self.__goods_weight=goods_weight
def get_carrier_type(self):
return self.__carrier_type
def get_goods_weight(self):
return self.__goods_weight
def validate_carrier_type(self):
for carrier in GoodsLogistics.__carrier_dict:
if(carrier==self.__carrier_type):
return True
return False
def calculate_bill_amount(self):
if(self.validate_carrier_type()):
if(self.validate_meter_reading()):
self.generate_consumer_id()
total_distance=self.get_end_reading()-self.get_start_reading()
multiplier = math.ceil(self.__goods_weight/1000)-1
charge_per_kilometer=0
bill_amount=0
if(self.__goods_weight<=1000):
charge_per_kilometer=GoodsLogistics.__carrier_dict[self.__carrier_type]
elif(self.__goods_weight >1000 and self.__goods_weight<=3000):
charge_per_kilometer=self.__carrier_dict[self.__carrier_type]*2**multiplier
else:
charge_per_kilometer=200
bill_amount+=total_distance*charge_per_kilometer
bill_amount*=1.10
bill_amount+=2000
return bill_amount
else:
return -1
else:
return -1
# # _Logistics__counter-None(Method invoked 5 times)
# passenger_logistic=PassengerLogistics("TOYOTA",300,400)
# bill_amount=passenger_logistic.calculate_bill_amount()
# # bill_amount=passenger_logistic.calculate_bill_amount()
# if(bill_amount==-1):
# print("Invalid vehicle type or meter reading ")
# else:
# print("Consumer id :",passenger_logistic.get_consumer_id())
# print("Start reading :",passenger_logistic.get_start_reading())
# print("End reading :",passenger_logistic.get_end_reading())
# print("Total Amount :",bill_amount)
# print("------------------------------------------------------------")
goods_logistic=GoodsLogistics("TATA",2000,300,400)
bill_amount=goods_logistic.calculate_bill_amount()
if(bill_amount==-1):
print("Invalid career type or meter reading ")
else:
print("Consumer id :",goods_logistic.get_consumer_id())
print("Goods weight :",goods_logistic.get_goods_weight())
print("Start reading :",goods_logistic.get_start_reading())
print("End reading :",goods_logistic.get_end_reading())
print("Total Amount :",bill_amount)
================================================
FILE: Programming in Python/Day-2/PF-Assgn-15.py
================================================
#PF-Assgn-15
def find_product(num1,num2,num3):
args=[]
args.extend([num1,num2,num3])
product=1
if 7 in args:
i = args.index(7)
if i is (len(args)-1):
return -1
else:
i = -1
for index in range(i+1,len(args)):
product = product * args[index]
return product
#Provide different values for num1, num2, num3 and test your program
product=find_product(7,6,2)
print(product)
================================================
FILE: Programming in Python/Day-2/PF-Assgn-16.py
================================================
#PF-Assgn-16
def make_amount(rupees_to_make,no_of_five,no_of_one):
five_needed=0
one_needed=0
five_needed = int(rupees_to_make/5)
one_needed = rupees_to_make%5
if five_needed <= no_of_five and one_needed <= no_of_one:
print("No. of Five needed :", five_needed)
print("No. of One needed :", one_needed)
elif five_needed > no_of_five:
total = no_of_five*5
one_needed = rupees_to_make - total
if one_needed <= no_of_one:
print("No. of Five needed :", no_of_five)
print("No. of One needed :", one_needed)
else:
print(-1)
else:
print(-1)
make_amount(28,8,5)
================================================
FILE: Programming in Python/Day-2/PF-Assgn-17.py
================================================
#PF-Tryout
#Assignment 17: Mandatory - Level 1
def find_new_salary(current_salary,job_level):
hike = [(3,15),(4,7),(5,5)]
for i in hike:
if job_level in i:
new_salary = (current_salary * (100+i[1]))//100
return new_salary
else:
return current_salary
new_salary=find_new_salary(15000,3)
print(new_salary)
================================================
FILE: Programming in Python/Day-2/PF-Assgn-18.py
================================================
#PF-Tryout
#Assignment 18: Mandatory - Level 2
def convert_currency(amount_needed_inr,current_currency_name):
converter = {
'Euro': 0.01417,
'British Pound': 0.0100,
'Australian Dollar': 0.02140,
'Canadian Dollar':0.02027
}
for Currency,Equivalent in converter.items():
if Currency == current_currency_name:
current_currency_amount = amount_needed_inr * Equivalent
return current_currency_amount
#write your logic here
return -1
#currency_needed=convert_currency(2000,"Euro")
currency_needed=convert_currency(3500,"British Pound")
if(currency_needed!= -1):
print(currency_needed )
else:
print("Invalid currency name")
================================================
FILE: Programming in Python/Day-2/PF-Assgn-19.py
================================================
#PF-Assgn-19
def calculate_bill_amount(food_type,quantity_ordered,distance_in_kms):
if quantity_ordered>=1 and distance_in_kms>0:
deli_cost = 0
bill_amount=0
dist = [(3,0),(6,3),(7,6)]
if food_type == 'V':
food_cost = quantity_ordered * 120
elif food_type == 'N':
food_cost = quantity_ordered * 150
else:
return -1
dist_covered = 0
while dist_covered <= distance_in_kms:
for distance in dist:
if dist_covered <= distance[0]:
value = distance[1]
break
deli_cost = deli_cost + value
dist_covered=dist_covered+1
bill_amount = food_cost + deli_cost
return bill_amount
else:
return -1
#Provide different values for food_type,quantity_ordered,distance_in_kms and test your program
bill_amount=calculate_bill_amount("N",2,7)
print(bill_amount)
================================================
FILE: Programming in Python/Day-2/PF-Assgn-20.py
================================================
#PF-Assgn-20
def calculate_loan(account_number,salary,account_balance,loan_type,loan_amount_expected,customer_emi_expected):
eligible_loan_amount=0
bank_emi_expected=0
loan = ['Car', 'House', 'Business']
if 1000<=account_number<=1999:
if account_balance>=100000:
if loan_type in loan:
if salary > 75000:
eligible_loan_amount = 7500000
bank_emi_expected = 84
if loan_amount_expected<=eligible_loan_amount and customer_emi_expected <=bank_emi_expected:
print("Account number:", account_number)
print("The customer can avail the amount of Rs.", eligible_loan_amount)
print("Eligible EMIs :", bank_emi_expected)
print("Requested loan amount:", loan_amount_expected)
print("Requested EMI's:",customer_emi_expected)
else:
print("The customer is not eligible for the loan")
elif 50000<salary<75000:
eligible_loan_amount = 6000000
bank_emi_expected = 60
if loan_amount_expected<=eligible_loan_amount and customer_emi_expected <=bank_emi_expected:
print("Account number:", account_number)
print("The customer can avail the amount of Rs.", eligible_loan_amount)
print("Eligible EMIs :", bank_emi_expected)
print("Requested loan amount:", loan_amount_expected)
print("Requested EMI's:",customer_emi_expected)
else:
print("The customer is not eligible for the loan")
elif 25000<salary<50000:
eligible_loan_amount = 500000
bank_emi_expected = 36
if loan_amount_expected<=eligible_loan_amount and customer_emi_expected <=bank_emi_expected:
print("Account number:", account_number)
print("The customer can avail the amount of Rs.", eligible_loan_amount)
print("Eligible EMIs :", bank_emi_expected)
print("Requested loan amount:", loan_amount_expected)
print("Requested EMI's:",customer_emi_expected)
else:
print("The customer is not eligible for the loan")
else:
print("Invalid loan type or salary")
else:
print("Invalid loan type or salary")
else:
print("Insufficient account balance")
else:
print("Invalid account number")
#Test your code for different values and observe the results
calculate_loan(1001,40000,250000,"Car",300000,30)
================================================
FILE: Programming in Python/Day-2/PF-Assgn-21.py
================================================
#PF-Tryout
def generate_next_date(day,month,year):
#Start writing your code here
daysinmonth = {1:31,2:28,3:31,4:30,5:31,6:30,7:31,8:31,9:30,10:31,11:30,12:31}
if (year%4==0 and year%100!=0) or year%400==0:
daysinmonth[2] = 29
if day<daysinmonth.get(month):
day+=1
elif day==daysinmonth.get(month):
month+=1
day = 1
if month>12:
month=1
year+=1
print(day,"-",month,"-",year)
generate_next_date(28,2,2000)
================================================
FILE: Programming in Python/Day-3/PF-Assgn-22.py
================================================
#PF-Assgn-22
def find_leap_years(given_year):
list_of_leap_years = []
while len(list_of_leap_years)!=15:
if given_year%4==0:
if given_year%100==0:
if given_year%400==0:
list_of_leap_years.append(given_year)
else:
list_of_leap_years.append(given_year)
given_year=given_year+1
return list_of_leap_years
list_of_leap_years=find_leap_years(2000)
print(list_of_leap_years)
================================================
FILE: Programming in Python/Day-3/PF-Assgn-23.py
================================================
#PF-Assgn-23
def calculate_bill_amount(gems_list, price_list, reqd_gems,reqd_quantity):
bill_amount=0
for gem in reqd_gems:
if gem in gems_list:
i1=gems_list.index(gem)
i2=reqd_gems.index(gem)
bill_amount=bill_amount+(price_list[i1]*reqd_quantity[i2])
if bill_amount>=30000:
bill_amount = bill_amount*0.95
else:
return -1
return bill_amount
reqd_quantity=[2, 1, 3]
reqd_gems=['Amber', 'Opal', 'Topaz']
gems_list=['Amber', 'Aquamarine', 'Opal', 'Topaz']
price_list=[4392, 1342, 8734, 6421]
bill_amount=calculate_bill_amount(gems_list, price_list, reqd_gems, reqd_quantity)
print(bill_amount)
================================================
FILE: Programming in Python/Day-3/PF-Assgn-24.py
================================================
#PF-Assgn-24
def form_triangle(num1,num2,num3):
success="Triangle can be formed"
failure="Triangle can't be formed"
l = [num1, num2, num3]
for n in l:
if n >= l[(l.index(n)+1)%3]+l[(l.index(n)+2)%3]:
return failure
return success
num1=3
num2=3
num3=5
form_triangle(num1, num2, num3)
================================================
FILE: Programming in Python/Day-3/PF-Assgn-26.py
================================================
#PF-Assgn-26
"""
x = no. of chickens
y = no. of rabbits
x+y = no. of heads ---- (1)
2x + 4y = no. of legs
or x+2y = (legs/2) ----- (2)
heads - y + 2y = (legs/2) ,i.e substitute (1) in (2)
hence, y = (legs/2) - heads
x = heads - y
"""
def solve(heads,legs):
error_msg="No solution"
chicken_count=0
rabbit_count=0
if legs%2==0:#legs must be even multiples
rabbit_count = (legs//2) - heads
chicken_count = heads - rabbit_count
if rabbit_count<0 or chicken_count<0:
print(error_msg)
else:
print(chicken_count,rabbit_count)
else:
print(error_msg)
#Provide different values for heads and legs and test your program
solve(38,131)
================================================
FILE: Programming in Python/Day-3/PF-Assgn-27.py
================================================
import turtle # allows us to use the turtles library
wn = turtle.Screen() # creates a graphics window
wn.setup(500,500) # set window dimension
alex = turtle.Turtle() # create a turtle named alex
alex.shape("turtle") # alex looks like a turtle
alex.color("green")# alex has a color
alex.right(60) # alex turns 60 degrees right
alex.left(60) # alex turns 60 degrees left
color = ["green", "blue", "red"]
for i in range(0,3):
alex.color(color[i])
for counter in range(1,5):
alex.circle(20*counter)
alex.right(120)
alex.left(0)
================================================
FILE: Programming in Python/Day-3/PF-Assgn-28.py
================================================
#PF-Assgn-28
def find_max(num1, num2):
max_num=-1
l = [max_num]
if num1<num2:
for num in range(num1,num2+1):
if len(str(num)) == 2:
sum = 0
for digit in str(num):
sum = sum + int(digit)
if sum%3==0:
if num%5==0:
l.append(num)
return max(l)
#Provide different values for num1 and num2 and test your program.
max_num=find_max(10,15)
print(max_num)
================================================
FILE: Programming in Python/Day-4/PF-Assgn-29.py
================================================
#PF-Assgn-29
"""
LOGIC:
expenses = (distance/milege)*fuel_cost
income = price_head * no_of_passengers
"""
def calculate(distance,no_of_passengers):
fuel_cost = 70
milege = 10
price_head = 80
expenses = (distance/milege)*fuel_cost
income = price_head * no_of_passengers
if income>=expenses:
return income-expenses
else:
return -1
distance=20
no_of_passengers=50
print(calculate(distance,no_of_passengers))
================================================
FILE: Programming in Python/Day-4/PF-Assgn-30.py
================================================
#PF-Assgn-30
def encode(message):
encode = message+"0"
l=[]
count = 1
for index, value in enumerate(encode):
if value != "0":
if value == encode[index+1]:
count = count+1
else:
l.append(str(count))
l.append(value)
count=1
return "".join(l)
encoded_message=encode("ABBBBCCCCCCCCAB")
print(encoded_message)
================================================
FILE: Programming in Python/Day-4/PF-Assgn-31.py
================================================
#PF-Assgn-31
def check_palindrome(word):
if word[::-1] == word:
return 1
else:
return 0
status=check_palindrome("malayalam")
if(status):
print("word is palindrome")
else:
print("word is not palindrome")
================================================
FILE: Programming in Python/Day-4/PF-Assgn-32.py
================================================
#PF-Assgn-32
def max_visited_speciality(patient_medical_speciality_list,medical_speciality):
l=[]
for key,value in medical_speciality.items():
l.append(patient_medical_speciality_list.count(key))
speciality=tuple(medical_speciality.values())[l.index(max(l))]
return speciality
patient_medical_speciality_list=[301,'P',302, 'P' ,305, 'P' ,401, 'E' ,656, 'E']
medical_speciality={"P":"Pediatrics","O":"Orthopedics","E":"ENT"}
speciality=max_visited_speciality(patient_medical_speciality_list,medical_speciality)
print(speciality)
================================================
FILE: Programming in Python/Day-4/PF-Assgn-33.py
================================================
#PF-Assgn-33
def find_common_characters(msg1,msg2):
l=[]
msg11=msg1.replace(" ", "")
msg22=msg2.replace(" ", "")
for letter in msg11:
if letter in msg22:
l.append(letter)
if len(l)!=0:
return "".join(l)
else:
return -1
#Provide different values for msg1,msg2 and test your program
msg1="moto"
msg2="moto"
common_characters=find_common_characters(msg1,msg2)
print(common_characters)
================================================
FILE: Programming in Python/Day-5/PF-Assgn-3.py
================================================
#PF-Assgn-38
def check_double(number):
double = number * 2
number1 = str(number)
double1 = str(double)
if len(number1) == len(double1):
for index, digit in enumerate(list(double1)):
if (digit in number1) and (digit != number1[index]):
status = True
else:
status = False
else:
status=False
return status
#Provide different values for number and test your program
print(check_double(125874))
================================================
FILE: Programming in Python/Day-5/PF-Assgn-34.py
================================================
#PF-Assgn-34
def find_pairs_of_numbers(num_list,n):
count=0
for index,num in enumerate(num_list):
for i in range(index+1,len(num_list)):
if num+num_list[i]==n:
count=count+1
return count
num_list=[1, 2, 4, 5, 6]
n=7
print(find_pairs_of_numbers(num_list,n))
================================================
FILE: Programming in Python/Day-5/PF-Assgn-35.py
================================================
#PF-Assgn-35
#Global variable
list_of_marks=(12,18,25,24,2,5,18,20,20,21)
def find_more_than_average():
avg = sum(list_of_marks)/len(list_of_marks)
count = 0
for marks in list_of_marks:
if marks>avg:
count=count+1
return (count*10)
def sort_marks():
return sorted(list(list_of_marks))
def generate_frequency():
l=[]
for value in range(0,26):
l.append(list_of_marks.count(value))
return l
print(find_more_than_average())
print(generate_frequency())
print(sort_marks())
================================================
FILE: Programming in Python/Day-5/PF-Assgn-36.py
================================================
#PF-Assgn-36
def create_largest_number(number_list):
number_list.sort(reverse = True)
new_number_list=[]
for index,value in enumerate(number_list):
ele=number_list.pop(index)
number_list.insert(index,str(ele))
'''
The InfyTQ compiler also checks for data type.
After using the join function, it returns a string.
However, the required is datatype must be int.
Hence we convert it to int using the int()
'''
return int("".join(number_list))
number_list=[23,45,67]
largest_number=create_largest_number(number_list)
print(largest_number)
================================================
FILE: Programming in Python/Day-5/PF-Assgn-37.py
================================================
#PF-Assgn-37
#Global variables
child_id=(10,20,30,40,50)
chocolates_received=[12,5,3,4,6]
def calculate_total_chocolates():
return sum(chocolates_received)
def reward_child(child_id_rewarded,extra_chocolates):
if extra_chocolates<1:
print ("Extra chocolates is less than 1")
elif child_id_rewarded not in child_id:
print("Child id is invalid")
else:
i = child_id.index(child_id_rewarded)
chocolates_received[i]=chocolates_received[i]+extra_chocolates
print(chocolates_received)
print(calculate_total_chocolates())
reward_child(20,2)
================================================
FILE: Programming in Python/Day-5/PF-Assgn-38.py
================================================
#PF-Assgn-38
def check_double(number):
double = number * 2
number1 = str(number)
double1 = str(double)
if len(number1) == len(double1):
for index, digit in enumerate(list(double1)):
if (digit in number1) and (digit != number1[index]):
status = True
else:
status = False
else:
status=False
return status
#Provide different values for number and test your program
print(check_double(125874))
================================================
FILE: Programming in Python/Day-5/PF-Assgn-39.py
================================================
#PF-Assgn-39
#This verification is based on string match.
#Global variables
menu=('Veg Roll','Noodles','Fried Rice','Soup')
quantity_available=[2,200,3,0]
def place_order(*item_tuple):
customer_items=[]
customer_quantity=[]
for i in range(len(item_tuple)):
if i%2==0:
customer_items.append(item_tuple[i])
else:
customer_quantity.append(item_tuple[i])
for index,item in enumerate(customer_items):
if item not in menu:
print (item + " is not available")
continue
else:
i=menu.index(item)
if check_quantity_available(i,customer_quantity[index]):
print (item + " is available")
else:
print(item +" stock is over")
'''This method accepts the index position of the item requested by the customer in the quantity_available list, and the requested quantity of the item.'''
def check_quantity_available(index,quantity_requested):
if quantity_available[index]<=quantity_requested:
return 1
else:
return 0
#Provide different values for items ordered and test your program
#place_order("Veg Roll",2,"Noodles",2)
place_order("Fried Rice",2,"Soup",1)
================================================
FILE: Programming in Python/Day-6/PF-Assgn-40.py
================================================
#PF-Assgn-40
def is_palindrome(word):
word.lower()
if word[::-1].lower() == word.lower():
return 1
else:
return 0
result=is_palindrome("Madam")
if(result):
print("The given word is a Palindrome")
else:
print("The given word is not a Palindrome")
================================================
FILE: Programming in Python/Day-6/PF-Assgn-41.py
================================================
#PF-Assgn-41
def find_ten_substring(num_str):
final=[]
temp=[]
for index,value in enumerate(list(num_str)):
l=[]
temp=[]
for i in range(index,len(num_str)):
l.append(int(num_str[i]))
s=sum(l)
if s < 10:
continue
elif s==10:
for value in l:
temp.append(str(value))
sum_string = "".join(temp)
final.append(sum_string)
if i!=(len(num_str)-1):
if num_str[i+1]=='0':
temp=[]
continue
break
elif s>10:
break
return final
num_str="2825302"
print("The number is:",num_str)
result_list=find_ten_substring(num_str)
print(result_list)
================================================
FILE: Programming in Python/Day-6/PF-Assgn-42.py
================================================
#PF-Assgn-42
def find_factors(num):
#Accepts a number and returns the list of all the factors of a given number
factors = []
for i in range(2,(num+1)):
if(num%i==0):
factors.append(i)
return factors
def is_prime(num, i):
#Accepts the number num and num/2 --> i and returns True if the number is prime ,else returns False
if(i==1):
return True
elif(num%i==0):
return False;
else:
return(is_prime(num,i-1))
def find_largest_prime_factor(list_of_factors):
#Accepts the list of factors and returns the largest prime factor
list_of_factors.sort(reverse=True)
for factor in list_of_factors:
if is_prime(factor,int(factor/2)):
return factor
return 1
def find_f(num):
#Accepts the number and returns the largest prime factor of the number
if is_prime(num,num/2):
return num
else:
l=find_factors(num)
return find_largest_prime_factor(l)
def find_g(num):
sum=0
for i in range(num,num+9):
sum=sum+find_f(i)
return sum
#Accepts the number and returns the sum of the largest prime factors of the 9 consecutive numbers starting from the given number
#Note: Invoke function(s) from other function(s), wherever applicable.
print(find_g(10))
================================================
FILE: Programming in Python/Day-6/PF-Assgn-43.py
================================================
#PF-Assgn-43
def find_smallest_number(num):
for value in range(1,1000):
list=[]
for n in range(1,value+1):
if value%n ==0:
list.append(n)
if len(list) == num:
return value
num=16
print("The number of divisors :",num)
result=find_smallest_number(num)
print("The smallest number having",num," divisors:",result)
================================================
FILE: Programming in Python/Day-6/PF-Assgn-44.py
================================================
#PF-Assgn-44
def find_duplicates(list_of_numbers):
dup=[]
for num in list_of_numbers:
if (list_of_numbers.count(num)>1) and (num not in dup):
dup.append(num)
return dup
list_of_numbers=[1,2,2,3,3,3,4,4,4,4]
list_of_duplicates=find_duplicates(list_of_numbers)
print(list_of_duplicates)
================================================
FILE: Programming in Python/Day-7/PF-Assgn-46.py
================================================
#PF-Assgn-46
Using Recursion:
def nearest_palindrome(number):
number=number+1
s=str(number)
if s == s[::-1]:
return number
else:
return nearest_palindrome(number)
number=99
'''
99 is also a palindrome, but as per the problem,
the program should return a "Nearest" and "GREATER"
palindrome number than the given number.
'''
print(nearest_palindrome(number))
==============================================
Using Iteration:
#PF-Assgn-46
def nearest_palindrome(number):
number=number+1
s=str(number)
while(s!=s[::-1]):
number=number+1
s=str(number)
return number
number=0
print(nearest_palindrome(number))
================================================
FILE: Programming in Python/Day-7/PF-Assgn-47.py
================================================
#PF-Assgn-47
vowels=['a','e','i','o','u']
def encrypt_sentence(sentence):
final=[]
list_sentence = sentence.split(" ")
for index,word in enumerate(list_sentence):
if (index+1)%2!=0:
final.append(word[::-1])
else:
v=[]#to store all vowels
t=[]#to store the letters temporily
for letter in word:
if letter not in vowels:
t.append(letter)
else:
v.append(letter)
t.extend(v)
final.append("".join(t))
#if len(final)>1:
return " ".join(final)
sentence="the"
encrypted_sentence=encrypt_sentence(sentence)
print(encrypted_sentence)
sentence="hello i am omkar"
encrypted_sentence=encrypt_sentence(sentence)
print(encrypted_sentence)
================================================
FILE: Programming in Python/Day-7/PF-Assgn-48.py
================================================
#PF-Assgn-48
def find_correct(word_dict):
correct,almost,wrong=0,0,0
for key,value in word_dict.items():
if key == value:
correct=correct+1
else:
if len(key)!=len(value):
wrong=wrong+1
continue
incorrect=0
for i in range(min([len(key),len(value)])):
if key[i] != value[i]:
incorrect=incorrect+1
if incorrect>2:
wrong=wrong+1
break
if incorrect<=2:
almost=almost+1
return [correct, almost, wrong]
word_dict={"CHECK": "CHEK", "RADIO": "RADICAL", "MIND": "MUND", "VENDOR": "VENDING", "ALWAYS": "ALLISWELL"}
print(find_correct(word_dict))
================================================
FILE: Programming in Python/Day-7/PF-Assgn-49.py
================================================
#PF-Tryout
import random
def biased_flip(prob_true):
return random.random()<prob_true
head,tail=0,0
for i in range(1000):
value=biased_flip(0.7)
if value:
head=head+1
else:
tail=tail+1
print("Heads: "+str(head))
print("Tails: "+str(tail))
================================================
FILE: Programming in Python/Day-7/PF-Assgn-50.py
================================================
#PF-Assgn-50
vowels=['a','e','i','o','u']
def sms_encoding(data):
temp=[]
l=data.split(" ")
for word in l:
temp_word=[]
for letter in word:
if letter.lower() not in vowels:
temp_word.append(letter)
if len(temp_word)==0:
temp_word.append(word)
temp.append("".join(temp_word))
return " ".join(temp)
data="GOOD DAYS AND BAD DAYS"
print(sms_encoding(data))
================================================
FILE: Programming in Python/Day-7/PF-Assgn-51.py
================================================
from turtle import *
wn = Screen()
wn.setup(500,500)
turtle = Turtle()
turtle.speed("fastest")
step = 31
'''
def draw_square(length,angle):
for i in range (0,step):
for b in range (0,4):
turtle.forward(length+i)
turtle.right(angle+b)
'''
def draw_square(length,angle):
global step
if step<1:
return
else:
turtle.forward(length)
turtle.right(angle)
if angle-90==3:
step=step-1
angle=89
length=length+1
return draw_square(length,angle+1)
draw_square(100,90)
================================================
FILE: Programming in Python/Day-8/PF-Assgn-52.py
================================================
#PF-Assgn-52
#This verification is based on string match.
def sum_of_numbers(list_of_num,filter_func=None):
if filter_func==None:
return sum(list_of_num)
else:
return sum(filter_func)
def even(data):
e=[]
for num in data:
if num%2!=0:
e.append(num)
return
gitextract_9es3xsz4/ ├── .github/ │ └── workflows/ │ └── greetings.yml ├── DBMS/ │ ├── Day-2/ │ │ ├── Assignment-10.txt │ │ ├── Assignment-11.txt │ │ ├── Assignment-12.txt │ │ ├── Assignment-13.txt │ │ ├── Assignment-14.txt │ │ ├── Assignment-2.txt │ │ ├── Assignment-3.txt │ │ ├── Assignment-4.txt │ │ ├── Assignment-5.txt │ │ ├── Assignment-6.txt │ │ ├── Assignment-7.txt │ │ ├── Assignment-8.txt │ │ ├── Assignment-9.txt │ │ ├── Exercise-3.txt │ │ ├── Exercise-4.txt │ │ ├── Exercise-5.txt │ │ ├── Exercise-6.txt │ │ ├── Exercise-7.txt │ │ ├── Exercise-8.txt │ │ └── Exercise-9.txt │ ├── Day-3/ │ │ ├── Assignment-15.txt │ │ ├── Assignment-16.txt │ │ ├── Assignment-17.txt │ │ ├── Assignment-18.txt │ │ ├── Assignment-19.txt │ │ ├── Assignment-20.txt │ │ ├── Assignment-21.txt │ │ ├── Assignment-22.txt │ │ ├── Assignment-23.txt │ │ ├── Assignment-24.txt │ │ ├── Assignment-25.txt │ │ ├── Assignment-26.txt │ │ ├── Assignment-27.txt │ │ ├── Assignment-28.txt │ │ ├── Assignment-29.txt │ │ ├── Assignment-30.txt │ │ ├── Assignment-31.txt │ │ ├── Assignment-32.txt │ │ ├── Assignment-33.txt │ │ ├── Assignment-34.txt │ │ ├── Assignment-35.txt │ │ ├── Assignment-36.txt │ │ ├── Assignment-37.txt │ │ ├── Assignment-38.txt │ │ ├── Assignment-39.txt │ │ ├── Exercise-10.txt │ │ ├── Exercise-11.txt │ │ ├── Exercise-12.txt │ │ ├── Exercise-13.txt │ │ ├── Exercise-14.txt │ │ ├── Exercise-15.txt │ │ ├── Exercise-16.txt │ │ ├── Exercise-17.txt │ │ ├── Exercise-18.txt │ │ ├── Exercise-19.txt │ │ ├── Exercise-20.txt │ │ ├── Exercise-21.txt │ │ └── Exercise-22.txt │ ├── Day-4/ │ │ ├── Assignment-40.txt │ │ ├── Assignment-41.txt │ │ ├── Assignment-42.txt │ │ ├── Assignment-43.txt │ │ ├── Assignment-44.txt │ │ ├── Assignment-45.txt │ │ ├── Assignment-46.txt │ │ ├── Assignment-47.txt │ │ ├── Assignment-48.txt │ │ ├── Assignment-49.txt │ │ ├── Assignment-50.txt │ │ ├── Assignment-51.txt │ │ ├── Assignment-52 │ │ ├── Assignment-55.txt │ │ ├── Assignment-56.txt │ │ ├── Assignment-57.txt │ │ ├── Assignment-58.txt │ │ ├── Exercise-23.txt │ │ ├── Exercise-24.txt │ │ ├── Exercise-25.txt │ │ ├── Exercise-26.txt │ │ ├── Exercise-27.txt │ │ ├── Exercise-28.txt │ │ ├── Exercise-29.txt │ │ ├── Exercise-30.txt │ │ ├── Exercise-31.txt │ │ ├── Exercise-32.txt │ │ ├── Exercise-33.txt │ │ ├── Exercise-34.txt │ │ ├── Exercise-35.txt │ │ ├── Exercise-36.txt │ │ ├── Exercise-37.txt │ │ ├── Exercise-38.txt │ │ └── Exercise-39.txt │ ├── Day-5/ │ │ ├── Assignment-67.txt │ │ ├── Assignment-68.txt │ │ ├── Assignment-69.txt │ │ ├── Assignment-70.txt │ │ ├── Assignment-71.txt │ │ ├── Assignment-72.txt │ │ ├── Assignment-73.txt │ │ ├── Assignment-74.txt │ │ ├── Assignment-75.txt │ │ ├── Assignment-76.txt │ │ ├── Assignment-77.txt │ │ ├── Assignment-78.txt │ │ ├── Assignment-79.txt │ │ ├── Assignment-80.txt │ │ ├── Assignment-81.txt │ │ ├── Assignment-82.txt │ │ ├── Assignment-83.txt │ │ ├── Assignment-84.txt │ │ ├── Assignment-85.txt │ │ ├── Exercise-40.txt │ │ ├── Exercise-41.txt │ │ ├── Exercise-42.txt │ │ ├── Exercise-43.txt │ │ ├── Exercise-44.txt │ │ ├── Exercise-45.txt │ │ ├── Exercise-46.txt │ │ ├── Exercise-47.txt │ │ ├── Exercise-48.txt │ │ ├── Exercise-49.txt │ │ ├── Exercise-50.txt │ │ ├── Exercise-51.txt │ │ ├── Exercise-52.txt │ │ ├── Exercise-53.txt │ │ ├── Exercise-54.txt │ │ ├── Exercise-55.txt │ │ ├── Exercise-56.txt │ │ ├── Exercise-57.txt │ │ ├── Exercise-58.txt │ │ ├── Practice-1 Self Join.txt │ │ ├── Practice-2 Outer Join.txt │ │ └── readme.md │ └── Day-6/ │ ├── Assignment-100.txt │ ├── Assignment-102.txt │ ├── Assignment-103.txt │ ├── Assignment-104.txt │ ├── Assignment-105.txt │ ├── Assignment-106.txt │ ├── Assignment-93.txt │ ├── Assignment-94.txt │ ├── Assignment-95.txt │ ├── Assignment-96.txt │ ├── Assignment-98.txt │ ├── Assignment-99.txt │ ├── Exercise-59.txt │ ├── Exercise-60.txt │ ├── Exercise-61.txt │ ├── Exercise-62.txt │ ├── Exercise-63.txt │ ├── Exercise-64.txt │ ├── Exercise-65.txt │ ├── Exercise-66.txt │ └── readme.md ├── DSA in Python/ │ ├── Day-1/ │ │ ├── Assignment 1.txt │ │ ├── Assignment 2.txt │ │ ├── Assignment 3.txt │ │ └── Assignment 4.txt │ ├── Day-2/ │ │ ├── Assignment 10.txt │ │ ├── Assignment 5.txt │ │ ├── Assignment 6.txt │ │ ├── Assignment 7.txt │ │ ├── Assignment 8.txt │ │ └── Assignment 9.txt │ ├── Day-3/ │ │ ├── Assignment-11.py │ │ ├── Assignment-13.py │ │ ├── Assignment-14.py │ │ └── Assignment-15.py │ ├── Day-4/ │ │ ├── Assignment-16.py │ │ ├── Assignment-17.txt │ │ ├── Assignment-18.txt │ │ └── Assignment-19.txt │ ├── Day-5/ │ │ ├── Assignment-20.py │ │ ├── Assignment-21.py │ │ ├── Assignment-22.py │ │ ├── Assignment-23.py │ │ ├── Exercise-17.py │ │ ├── Exercise-18.py │ │ ├── Exercise-19_SELECTION-SORT-ALGO.py │ │ ├── Exercise-20_BUBBLE-SORT-ALGO.py │ │ ├── Exercise-21_MERGE-SORT-ALGO.py │ │ ├── Exercise-22.py │ │ └── Exercise-23.py │ └── Day-6/ │ ├── Exercise-24.py │ └── Exercise-25.py ├── OOP in Python/ │ ├── Day-1/ │ │ ├── Assignment-1.txt │ │ ├── Assignment-2.txt │ │ ├── assignment-3.py │ │ ├── assignment-4.py │ │ ├── assignment-8.py │ │ └── assignment-9.py │ ├── Day-2/ │ │ ├── assignment-10.py │ │ ├── assignment-11.py │ │ └── assignment-12.py │ ├── Day-3/ │ │ ├── Assignment-19.txt │ │ ├── Assignment-20.txt │ │ ├── Assignment-21.txt │ │ ├── assignment-15.py │ │ ├── assignment-16.py │ │ ├── assignment-17.py │ │ └── assignment-18.py │ ├── Day-4/ │ │ ├── Assignment-24.py │ │ ├── Assignment-25.py │ │ └── Assignment-27.py │ └── Day-5/ │ ├── Assignment-29.py │ ├── Assignment-30.py │ └── Assignment-31.py ├── Programming in Python/ │ ├── Day-2/ │ │ ├── PF-Assgn-15.py │ │ ├── PF-Assgn-16.py │ │ ├── PF-Assgn-17.py │ │ ├── PF-Assgn-18.py │ │ ├── PF-Assgn-19.py │ │ ├── PF-Assgn-20.py │ │ └── PF-Assgn-21.py │ ├── Day-3/ │ │ ├── PF-Assgn-22.py │ │ ├── PF-Assgn-23.py │ │ ├── PF-Assgn-24.py │ │ ├── PF-Assgn-26.py │ │ ├── PF-Assgn-27.py │ │ └── PF-Assgn-28.py │ ├── Day-4/ │ │ ├── PF-Assgn-29.py │ │ ├── PF-Assgn-30.py │ │ ├── PF-Assgn-31.py │ │ ├── PF-Assgn-32.py │ │ └── PF-Assgn-33.py │ ├── Day-5/ │ │ ├── PF-Assgn-3.py │ │ ├── PF-Assgn-34.py │ │ ├── PF-Assgn-35.py │ │ ├── PF-Assgn-36.py │ │ ├── PF-Assgn-37.py │ │ ├── PF-Assgn-38.py │ │ └── PF-Assgn-39.py │ ├── Day-6/ │ │ ├── PF-Assgn-40.py │ │ ├── PF-Assgn-41.py │ │ ├── PF-Assgn-42.py │ │ ├── PF-Assgn-43.py │ │ └── PF-Assgn-44.py │ ├── Day-7/ │ │ ├── PF-Assgn-46.py │ │ ├── PF-Assgn-47.py │ │ ├── PF-Assgn-48.py │ │ ├── PF-Assgn-49.py │ │ ├── PF-Assgn-50.py │ │ └── PF-Assgn-51.py │ └── Day-8/ │ ├── PF-Assgn-52.py │ ├── PF-Assgn-53.py │ ├── PF-Assgn-53_1.py │ ├── PF-Assgn-54.py │ └── PF-Assgn-56.py ├── README.md └── _config.yml
SYMBOL INDEX (405 symbols across 73 files)
FILE: DSA in Python/Day-3/Assignment-11.py
class Queue (line 2) | class Queue:
method __init__ (line 3) | def __init__(self,max_size):
method is_full (line 9) | def is_full(self):
method is_empty (line 14) | def is_empty(self):
method enqueue (line 19) | def enqueue(self,data):
method dequeue (line 26) | def dequeue(self):
method display (line 34) | def display(self):
method get_max_size (line 39) | def get_max_size(self):
method __str__ (line 43) | def __str__(self):
function merge_queue (line 53) | def merge_queue(queue1,queue2):
FILE: DSA in Python/Day-3/Assignment-13.py
class Stack (line 2) | class Stack:
method __init__ (line 3) | def __init__(self,max_size):
method is_full (line 8) | def is_full(self):
method is_empty (line 13) | def is_empty(self):
method push (line 18) | def push(self,data):
method pop (line 25) | def pop(self):
method display (line 33) | def display(self):
method get_max_size (line 42) | def get_max_size(self):
method __str__ (line 46) | def __str__(self):
function change_smallest_value (line 56) | def change_smallest_value(number_stack):
FILE: DSA in Python/Day-3/Assignment-14.py
class Queue (line 2) | class Queue:
method __init__ (line 3) | def __init__(self,max_size):
method is_full (line 10) | def is_full(self):
method is_empty (line 15) | def is_empty(self):
method enqueue (line 20) | def enqueue(self,data):
method dequeue (line 27) | def dequeue(self):
method display (line 35) | def display(self):
method get_max_size (line 40) | def get_max_size(self):
method __str__ (line 44) | def __str__(self):
function check_numbers (line 54) | def check_numbers(number_queue):
FILE: DSA in Python/Day-3/Assignment-15.py
class Queue (line 2) | class Queue:
method __init__ (line 3) | def __init__(self,max_size):
method is_full (line 10) | def is_full(self):
method is_empty (line 15) | def is_empty(self):
method enqueue (line 20) | def enqueue(self,data):
method dequeue (line 27) | def dequeue(self):
method display (line 35) | def display(self):
method get_max_size (line 40) | def get_max_size(self):
method __str__ (line 44) | def __str__(self):
class Job (line 55) | class Job:
method __init__ (line 56) | def __init__(self,name, time_needed):
method get_name (line 60) | def get_name(self):
method get_time_needed (line 62) | def get_time_needed(self):
method get_time_elapsed (line 64) | def get_time_elapsed(self):
method __str__ (line 66) | def __str__(self):
method elapsed_time (line 68) | def elapsed_time(self, no_of_mins):
class Employee (line 75) | class Employee:
method __init__ (line 76) | def __init__(self, name):
method set_allocated_job (line 79) | def set_allocated_job(self, allocated_job):
method get_name (line 81) | def get_name(self):
method get_allocated_job (line 83) | def get_allocated_job(self):
method elapsed_time (line 85) | def elapsed_time(self, no_of_mins):
class Company (line 93) | class Company:
method __init__ (line 94) | def __init__(self, emp_list):
method get_employees (line 97) | def get_employees(self):
method get_pending_jobs (line 99) | def get_pending_jobs(self):
method allocate_new_job (line 101) | def allocate_new_job(self,job):
method elapsed_time (line 110) | def elapsed_time(self, no_of_mins):
FILE: DSA in Python/Day-4/Assignment-16.py
class Queue (line 2) | class Queue:
method __init__ (line 3) | def __init__(self,max_size):
method is_full (line 10) | def is_full(self):
method is_empty (line 15) | def is_empty(self):
method enqueue (line 20) | def enqueue(self,data):
method dequeue (line 27) | def dequeue(self):
method display (line 35) | def display(self):
method get_max_size (line 40) | def get_max_size(self):
method __str__ (line 44) | def __str__(self):
class Stack (line 54) | class Stack:
method __init__ (line 55) | def __init__(self,max_size):
method is_full (line 60) | def is_full(self):
method is_empty (line 65) | def is_empty(self):
method push (line 70) | def push(self,data):
method pop (line 77) | def pop(self):
method display (line 85) | def display(self):
method get_max_size (line 94) | def get_max_size(self):
method __str__ (line 98) | def __str__(self):
function separate_boxes (line 108) | def separate_boxes(box_stack):
FILE: DSA in Python/Day-5/Assignment-20.py
class Item (line 3) | class Item:
method __init__ (line 4) | def __init__(self, item_name, author_name, published_year):
method get_item_name (line 8) | def get_item_name(self):
method get_author_name (line 10) | def get_author_name(self):
method get_published_year (line 12) | def get_published_year(self):
method __str__ (line 14) | def __str__(self):
class Library (line 17) | class Library:
method __init__ (line 18) | def __init__(self, item_list):
method get_item_list (line 20) | def get_item_list(self):
method sort_item_list_by_author (line 22) | def sort_item_list_by_author(self, new_item_list):
method add_new_items (line 25) | def add_new_items(self, new_item_list):
method sort_items_by_published_year (line 28) | def sort_items_by_published_year(self):
FILE: DSA in Python/Day-5/Assignment-21.py
class Queue (line 2) | class Queue:
method __init__ (line 3) | def __init__(self,max_size):
method is_full (line 10) | def is_full(self):
method is_empty (line 15) | def is_empty(self):
method enqueue (line 20) | def enqueue(self,data):
method dequeue (line 27) | def dequeue(self):
method display (line 35) | def display(self):
method get_max_size (line 40) | def get_max_size(self):
method __str__ (line 44) | def __str__(self):
class Stack (line 55) | class Stack:
method __init__ (line 56) | def __init__(self,max_size):
method is_full (line 61) | def is_full(self):
method is_empty (line 66) | def is_empty(self):
method push (line 71) | def push(self,data):
method pop (line 78) | def pop(self):
method display (line 86) | def display(self):
method get_max_size (line 95) | def get_max_size(self):
method __str__ (line 99) | def __str__(self):
function find_flights (line 120) | def find_flights(flight_time):
function sortMethod (line 128) | def sortMethod(val):
function sort_flight_list (line 132) | def sort_flight_list(flight_list):
function get_passenger_details (line 137) | def get_passenger_details(flight_detail):
function security_check (line 144) | def security_check(passenger_pnr_list):
function sortPassenger (line 151) | def sortPassenger(value):
function sort_passengers (line 166) | def sort_passengers(passenger_pnr_list):
function boarding (line 170) | def boarding(passenger_pnr_list):
function seating (line 176) | def seating(passenger_queue):
FILE: DSA in Python/Day-5/Assignment-22.py
class Stack (line 2) | class Stack:
method __init__ (line 3) | def __init__(self,max_size):
method is_full (line 8) | def is_full(self):
method is_empty (line 13) | def is_empty(self):
method push (line 18) | def push(self,data):
method pop (line 25) | def pop(self):
method display (line 33) | def display(self):
method get_max_size (line 42) | def get_max_size(self):
method __str__ (line 46) | def __str__(self):
function merge_stack (line 56) | def merge_stack(stack1,stack2):
FILE: DSA in Python/Day-5/Assignment-23.py
function generate_cards_per_type (line 6) | def generate_cards_per_type(card_type):
function generate_card_deck (line 10) | def generate_card_deck():
function shuffle_card_deck (line 16) | def shuffle_card_deck(cards_list):
function cardSort (line 34) | def cardSort(val):
function sort_cards_of_each_player (line 42) | def sort_cards_of_each_player(card_list):
function allocate_cards_to_players (line 45) | def allocate_cards_to_players(cards_list):
function prepare_cards (line 56) | def prepare_cards():
FILE: DSA in Python/Day-5/Exercise-17.py
function swap (line 3) | def swap(num_list, first_index, second_index):
FILE: DSA in Python/Day-5/Exercise-18.py
function find_next_min (line 3) | def find_next_min(num_list,start_index):
FILE: DSA in Python/Day-5/Exercise-19_SELECTION-SORT-ALGO.py
function swap (line 2) | def swap(num_list, first_index, second_index):
function find_next_min (line 8) | def find_next_min(num_list,start_index):
function selection_sort (line 12) | def selection_sort(num_list):
FILE: DSA in Python/Day-5/Exercise-20_BUBBLE-SORT-ALGO.py
function swap (line 2) | def swap(num_list, first_index, second_index):
function find_next_min (line 7) | def find_next_min(num_list,start_index):
function selection_sort (line 10) | def selection_sort(num_list):
function bubble_sort (line 16) | def bubble_sort(num_list):
FILE: DSA in Python/Day-5/Exercise-21_MERGE-SORT-ALGO.py
function merge_sort (line 3) | def merge_sort(num_list):
function merge (line 15) | def merge(left_list,right_list):
FILE: DSA in Python/Day-5/Exercise-22.py
function order_heights (line 3) | def order_heights(student_list,height_list):
FILE: DSA in Python/Day-5/Exercise-23.py
function arrange_tickets (line 3) | def arrange_tickets(tickets_list):
FILE: DSA in Python/Day-6/Exercise-24.py
function make_change (line 3) | def make_change(denomination_list, amount):
FILE: DSA in Python/Day-6/Exercise-25.py
function sortActivity (line 2) | def sortActivity(value):
function sortActivities (line 4) | def sortActivities(value):
function find_maximum_activities (line 6) | def find_maximum_activities(activity_list,start_time_list, finish_time_l...
FILE: OOP in Python/Day-1/assignment-3.py
class Customer (line 2) | class Customer:
method __init__ (line 4) | def __init__(self):
method pays_bill (line 8) | def pays_bill(self, amount):
method purchases (line 11) | def purchases(self):
FILE: OOP in Python/Day-1/assignment-4.py
function check_type (line 1) | def check_type(type):
class Vehicle (line 6) | class Vehicle:
method __init__ (line 7) | def __init__(self):
method set_vehicle_id (line 9) | def set_vehicle_id(self,id):
method set_vehicle_type (line 11) | def set_vehicle_type(self,type):
method set_vehicle_cost (line 16) | def set_vehicle_cost(self,cost):
method get_vehicle_id (line 18) | def get_vehicle_id(self):
method get_vehicle_type (line 20) | def get_vehicle_type(self):
method get_vehicle_cost (line 22) | def get_vehicle_cost(self):
FILE: OOP in Python/Day-1/assignment-8.py
class Student (line 3) | class Student:
method __init__ (line 5) | def __init__(self):
method validate_marks (line 9) | def validate_marks(self):
method validate_age (line 14) | def validate_age(self):
method check_qualification (line 19) | def check_qualification(self):
method set_student_id (line 24) | def set_student_id(self):
method get_student_id (line 28) | def get_student_id(self):
method set_marks (line 30) | def set_marks(self, marks):
method get_marks (line 32) | def get_marks(self):
method set_age (line 34) | def set_age(self, age):
method get_age (line 36) | def get_age(self):
FILE: OOP in Python/Day-1/assignment-9.py
class Student (line 6) | class Student:
method __init__ (line 7) | def __init__(self):
method choose_course (line 13) | def choose_course(self,course_id):
method get_course_id (line 23) | def get_course_id(self):
method get_fees (line 25) | def get_fees(self):
method validate_marks (line 27) | def validate_marks(self):
method validate_age (line 32) | def validate_age(self):
method check_qualification (line 37) | def check_qualification(self):
method set_student_id (line 42) | def set_student_id(self, sid):
method get_student_id (line 44) | def get_student_id(self):
method set_marks (line 46) | def set_marks(self, marks):
method get_marks (line 48) | def get_marks(self):
method set_age (line 50) | def set_age(self, age):
method get_age (line 52) | def get_age(self):
FILE: OOP in Python/Day-2/assignment-10.py
class CallDetail (line 3) | class CallDetail:
method __init__ (line 4) | def __init__(self, phoneno, called_no, duration, call_type):
class Util (line 10) | class Util:
method __init__ (line 11) | def __init__(self):
method parse_customer (line 14) | def parse_customer(self,list_of_call_string):
FILE: OOP in Python/Day-2/assignment-11.py
class Flower (line 4) | class Flower:
method __init__ (line 5) | def __init__(self):
method validate_flower (line 9) | def validate_flower(self):
method validate_stock (line 14) | def validate_stock(self, required_quantity):
method sell_flower (line 19) | def sell_flower(self,required_quantity):
method check_level (line 22) | def check_level(self):
method get_flower_name (line 28) | def get_flower_name(self):
method get_price_per_kg (line 30) | def get_price_per_kg(self):
method get_stock_available (line 32) | def get_stock_available(self):
method set_flower_name (line 35) | def set_flower_name(self, flower_name):
method set_price_per_kg (line 37) | def set_price_per_kg(self,price_per_kg):
method set_stock_available (line 39) | def set_stock_available(self, stock_available):
FILE: OOP in Python/Day-2/assignment-12.py
class Bill (line 2) | class Bill:
method __init__ (line 3) | def __init__(self, bill_id, patient_name):
method get_bill_id (line 7) | def get_bill_id(self):
method get_patient_name (line 9) | def get_patient_name(self):
method get_bill_amount (line 11) | def get_bill_amount(self):
method calculate_bill_amount (line 13) | def calculate_bill_amount(self, consultation_fees, quantity_list, pric...
FILE: OOP in Python/Day-3/assignment-15.py
class Parrot (line 3) | class Parrot:
method __init__ (line 5) | def __init__(self, name, color):
method get_unique_number (line 10) | def get_unique_number(self):
method get_color (line 12) | def get_color(self):
method get_name (line 14) | def get_name(self):
FILE: OOP in Python/Day-3/assignment-16.py
class Customer (line 3) | class Customer:
method __init__ (line 4) | def __init__(self,phone_no,name,age):
class CallDetail (line 10) | class CallDetail:
method __init__ (line 11) | def __init__(self,phone_no,called_no,duration):
class Util (line 16) | class Util:
method __init__ (line 17) | def __init__(self):
method parse_customer (line 19) | def parse_customer(self,list_of_customers,list_of_calls):
FILE: OOP in Python/Day-3/assignment-17.py
class Freight (line 2) | class Freight:
method __init__ (line 4) | def __init__(self, recipient_customer, from_customer, weight, distance):
method validate_weight (line 11) | def validate_weight(self):
method validate_distance (line 16) | def validate_distance(self):
method forward_cargo (line 21) | def forward_cargo(self):
method get_freight_charge (line 29) | def get_freight_charge(self):
method get_freight_id (line 31) | def get_freight_id(self):
method get_recipient_customer (line 33) | def get_recipient_customer(self):
method get_from_customer (line 35) | def get_from_customer(self):
method get_weight (line 37) | def get_weight(self):
method get_distance (line 39) | def get_distance(self):
class Customer (line 42) | class Customer:
method __init__ (line 43) | def __init__(self, customer_id, customer_name, address):
method validate_customer_id (line 47) | def validate_customer_id(self):
method get_customer_id (line 53) | def get_customer_id(self):
method get_customer_name (line 55) | def get_customer_name(self):
method get_address (line 57) | def get_address(self):
FILE: OOP in Python/Day-3/assignment-18.py
class Item (line 4) | class Item:
method __init__ (line 5) | def __init__(self,item_id,description,price_per_quantity):
method get_item_id (line 10) | def get_item_id(self):
method get_description (line 12) | def get_description(self):
method get_price_per_quantity (line 14) | def get_price_per_quantity(self):
class Bill (line 17) | class Bill:
method __init__ (line 19) | def __init__(self):
method generate_bill_amount (line 22) | def generate_bill_amount(self,item_quantity, items):
method get_bill_id (line 33) | def get_bill_id(self):
method get_bill_amount (line 35) | def get_bill_amount(self):
class Customer (line 38) | class Customer:
method __init__ (line 39) | def __init__(self, customer_name):
method pays_bill (line 42) | def pays_bill(self,bill):
method get_customer_name (line 47) | def get_customer_name(self):
method get_payment_status (line 49) | def get_payment_status(self):
FILE: OOP in Python/Day-4/Assignment-24.py
class Apparel (line 2) | class Apparel:
method __init__ (line 4) | def __init__(self, price, item_type):
method get_item_id (line 9) | def get_item_id(self):
method get_item_type (line 11) | def get_item_type(self):
method get_price (line 13) | def get_price(self):
method calculate_price (line 15) | def calculate_price(self):
method set_price (line 17) | def set_price(self, price):
class Cotton (line 19) | class Cotton(Apparel):
method __init__ (line 20) | def __init__(self, price,discount):
method calculate_price (line 23) | def calculate_price(self):
method get_discount (line 29) | def get_discount(self):
class Silk (line 31) | class Silk(Apparel):
method __init__ (line 32) | def __init__(self, price):
method calculate_price (line 35) | def calculate_price(self):
method get_points (line 45) | def get_points(self):
FILE: OOP in Python/Day-4/Assignment-25.py
class FruitInfo (line 2) | class FruitInfo:
method get_fruit_price (line 6) | def get_fruit_price(fruit_name):
method get_fruit_name_list (line 12) | def get_fruit_name_list():
method get_fruit_price_list (line 15) | def get_fruit_price_list():
class Purchase (line 17) | class Purchase:
method __init__ (line 19) | def __init__(self, customer,fruit_name, quantity):
method get_purchase_id (line 24) | def get_purchase_id(self):
method get_customer (line 26) | def get_customer(self):
method get_quantity (line 28) | def get_quantity(self):
method calculate_price (line 30) | def calculate_price(self):
class Customer (line 48) | class Customer():
method __init__ (line 49) | def __init__(self, customer_name, cust_type):
method get_customer_name (line 53) | def get_customer_name(self):
method get_cust_type (line 55) | def get_cust_type(self):
FILE: OOP in Python/Day-4/Assignment-27.py
class ThemePark (line 3) | class ThemePark:
method validate_game (line 7) | def validate_game(game_input):
method get_points (line 14) | def get_points(game_input):
method get_amount (line 20) | def get_amount(game_input):
class Ticket (line 26) | class Ticket:
method __init__ (line 28) | def __init__(self):
method generate_ticket_id (line 31) | def generate_ticket_id(self):
method calculate_amount (line 35) | def calculate_amount(self, list_of_games):
method get_ticket_id (line 45) | def get_ticket_id(self):
method get_ticket_amount (line 47) | def get_ticket_amount(self):
class Customer (line 50) | class Customer:
method __init__ (line 51) | def __init__(self, name, list_of_games):
method play_game (line 57) | def play_game(self):
method update_food_coupon (line 62) | def update_food_coupon(self):
method book_ticket (line 65) | def book_ticket(self):
method get_name (line 73) | def get_name(self):
method get_list_of_games (line 75) | def get_list_of_games(self):
method get_ticket (line 77) | def get_ticket(self):
method get_points_earned (line 79) | def get_points_earned(self):
method get_food_coupon (line 81) | def get_food_coupon(self):
FILE: OOP in Python/Day-5/Assignment-29.py
class Customer (line 3) | class Customer(metaclass=ABCMeta):
method __init__ (line 4) | def __init__(self,customer_name):
method calculate_bill_amount (line 9) | def calculate_bill_amount(self):
method get_customer_name (line 11) | def get_customer_name(self):
class OccasionalCustomer (line 13) | class OccasionalCustomer(Customer):
method __init__ (line 15) | def __init__(self, customer_name, distance_in_kms):
method validate_distance_in_kms (line 20) | def validate_distance_in_kms(self):
method calculate_bill_amount (line 25) | def calculate_bill_amount(self):
method get_distance_in_kms (line 40) | def get_distance_in_kms(self):
class RegularCustomer (line 42) | class RegularCustomer(Customer):
method __init__ (line 44) | def __init__(self, customer_name, no_of_tiffin):
method validate_no_of_tiffin (line 49) | def validate_no_of_tiffin(self):
method calculate_bill_amount (line 54) | def calculate_bill_amount(self):
method get_no_of_tiffin (line 62) | def get_no_of_tiffin(self):
FILE: OOP in Python/Day-5/Assignment-30.py
class Customer (line 3) | class Customer:
method __init__ (line 4) | def __init__(self, customer_name, quantity):
method validate_quantity (line 7) | def validate_quantity(self):
method get_customer_name (line 12) | def get_customer_name(self):
method get_quantity (line 14) | def get_quantity(self):
class Pizzaservice (line 17) | class Pizzaservice:
method __init__ (line 19) | def __init__(self, customer, pizza_type, additional_topping):
method validate_pizza_type (line 25) | def validate_pizza_type(self):
method calculate_pizza_cost (line 30) | def calculate_pizza_cost(self):
method get_service_id (line 45) | def get_service_id(self):
method get_pizza_type (line 47) | def get_pizza_type(self):
method get_customer (line 49) | def get_customer(self):
method get_additional_topping (line 51) | def get_additional_topping(self):
class Doordelivery (line 53) | class Doordelivery(Pizzaservice):
method __init__ (line 54) | def __init__(self, customer, pizza_type, additional_topping, distance_...
method validate_distance_in_kms (line 58) | def validate_distance_in_kms(self):
method calculate_pizza_cost (line 63) | def calculate_pizza_cost(self):
method get_delivery_charge (line 76) | def get_delivery_charge(self):
method get_distance_in_kms (line 78) | def get_distance_in_kms(self):
FILE: OOP in Python/Day-5/Assignment-31.py
class Logistics (line 5) | class Logistics(metaclass=ABCMeta):
method __init__ (line 7) | def __init__(self,start_reading,end_reading):
method get_consumer_id (line 11) | def get_consumer_id(self):
method get_start_reading (line 13) | def get_start_reading(self):
method get_end_reading (line 15) | def get_end_reading(self):
method validate_meter_reading (line 17) | def validate_meter_reading(self):
method generate_consumer_id (line 22) | def generate_consumer_id(self):
method calculate_bill_amount (line 29) | def calculate_bill_amount(self):
class PassengerLogistics (line 31) | class PassengerLogistics(Logistics):
method __init__ (line 36) | def __init__(self,vehicle_type,start_reading,end_reading):
method get_vehicle_type (line 39) | def get_vehicle_type(self):
method validate_vehicle_type (line 41) | def validate_vehicle_type(self):
method calculate_bill_amount (line 46) | def calculate_bill_amount(self):
class GoodsLogistics (line 67) | class GoodsLogistics(Logistics):
method __init__ (line 69) | def __init__(self,carrier_type,goods_weight,start_reading,end_reading):
method get_carrier_type (line 73) | def get_carrier_type(self):
method get_goods_weight (line 75) | def get_goods_weight(self):
method validate_carrier_type (line 77) | def validate_carrier_type(self):
method calculate_bill_amount (line 82) | def calculate_bill_amount(self):
FILE: Programming in Python/Day-2/PF-Assgn-15.py
function find_product (line 2) | def find_product(num1,num2,num3):
FILE: Programming in Python/Day-2/PF-Assgn-16.py
function make_amount (line 2) | def make_amount(rupees_to_make,no_of_five,no_of_one):
FILE: Programming in Python/Day-2/PF-Assgn-17.py
function find_new_salary (line 4) | def find_new_salary(current_salary,job_level):
FILE: Programming in Python/Day-2/PF-Assgn-18.py
function convert_currency (line 4) | def convert_currency(amount_needed_inr,current_currency_name):
FILE: Programming in Python/Day-2/PF-Assgn-19.py
function calculate_bill_amount (line 3) | def calculate_bill_amount(food_type,quantity_ordered,distance_in_kms):
FILE: Programming in Python/Day-2/PF-Assgn-20.py
function calculate_loan (line 3) | def calculate_loan(account_number,salary,account_balance,loan_type,loan_...
FILE: Programming in Python/Day-2/PF-Assgn-21.py
function generate_next_date (line 3) | def generate_next_date(day,month,year):
FILE: Programming in Python/Day-3/PF-Assgn-22.py
function find_leap_years (line 2) | def find_leap_years(given_year):
FILE: Programming in Python/Day-3/PF-Assgn-23.py
function calculate_bill_amount (line 2) | def calculate_bill_amount(gems_list, price_list, reqd_gems,reqd_quantity):
FILE: Programming in Python/Day-3/PF-Assgn-24.py
function form_triangle (line 2) | def form_triangle(num1,num2,num3):
FILE: Programming in Python/Day-3/PF-Assgn-26.py
function solve (line 14) | def solve(heads,legs):
FILE: Programming in Python/Day-3/PF-Assgn-28.py
function find_max (line 3) | def find_max(num1, num2):
FILE: Programming in Python/Day-4/PF-Assgn-29.py
function calculate (line 7) | def calculate(distance,no_of_passengers):
FILE: Programming in Python/Day-4/PF-Assgn-30.py
function encode (line 3) | def encode(message):
FILE: Programming in Python/Day-4/PF-Assgn-31.py
function check_palindrome (line 2) | def check_palindrome(word):
FILE: Programming in Python/Day-4/PF-Assgn-32.py
function max_visited_speciality (line 2) | def max_visited_speciality(patient_medical_speciality_list,medical_speci...
FILE: Programming in Python/Day-4/PF-Assgn-33.py
function find_common_characters (line 3) | def find_common_characters(msg1,msg2):
FILE: Programming in Python/Day-5/PF-Assgn-3.py
function check_double (line 3) | def check_double(number):
FILE: Programming in Python/Day-5/PF-Assgn-34.py
function find_pairs_of_numbers (line 2) | def find_pairs_of_numbers(num_list,n):
FILE: Programming in Python/Day-5/PF-Assgn-35.py
function find_more_than_average (line 6) | def find_more_than_average():
function sort_marks (line 15) | def sort_marks():
function generate_frequency (line 18) | def generate_frequency():
FILE: Programming in Python/Day-5/PF-Assgn-36.py
function create_largest_number (line 2) | def create_largest_number(number_list):
FILE: Programming in Python/Day-5/PF-Assgn-37.py
function calculate_total_chocolates (line 7) | def calculate_total_chocolates():
function reward_child (line 10) | def reward_child(child_id_rewarded,extra_chocolates):
FILE: Programming in Python/Day-5/PF-Assgn-38.py
function check_double (line 3) | def check_double(number):
FILE: Programming in Python/Day-5/PF-Assgn-39.py
function place_order (line 7) | def place_order(*item_tuple):
function check_quantity_available (line 27) | def check_quantity_available(index,quantity_requested):
FILE: Programming in Python/Day-6/PF-Assgn-40.py
function is_palindrome (line 2) | def is_palindrome(word):
FILE: Programming in Python/Day-6/PF-Assgn-41.py
function find_ten_substring (line 2) | def find_ten_substring(num_str):
FILE: Programming in Python/Day-6/PF-Assgn-42.py
function find_factors (line 2) | def find_factors(num):
function is_prime (line 10) | def is_prime(num, i):
function find_largest_prime_factor (line 19) | def find_largest_prime_factor(list_of_factors):
function find_f (line 27) | def find_f(num):
function find_g (line 35) | def find_g(num):
FILE: Programming in Python/Day-6/PF-Assgn-43.py
function find_smallest_number (line 3) | def find_smallest_number(num):
FILE: Programming in Python/Day-6/PF-Assgn-44.py
function find_duplicates (line 3) | def find_duplicates(list_of_numbers):
FILE: Programming in Python/Day-7/PF-Assgn-46.py
function nearest_palindrome (line 3) | def nearest_palindrome(number):
function nearest_palindrome (line 23) | def nearest_palindrome(number):
FILE: Programming in Python/Day-7/PF-Assgn-47.py
function encrypt_sentence (line 4) | def encrypt_sentence(sentence):
FILE: Programming in Python/Day-7/PF-Assgn-48.py
function find_correct (line 3) | def find_correct(word_dict):
FILE: Programming in Python/Day-7/PF-Assgn-49.py
function biased_flip (line 4) | def biased_flip(prob_true):
FILE: Programming in Python/Day-7/PF-Assgn-50.py
function sms_encoding (line 3) | def sms_encoding(data):
FILE: Programming in Python/Day-7/PF-Assgn-51.py
function draw_square (line 17) | def draw_square(length,angle):
FILE: Programming in Python/Day-8/PF-Assgn-52.py
function sum_of_numbers (line 5) | def sum_of_numbers(list_of_num,filter_func=None):
function even (line 12) | def even(data):
function odd (line 19) | def odd(data):
FILE: Programming in Python/Day-8/PF-Assgn-54.py
function check_anagram (line 3) | def check_anagram(data1,data2):
FILE: Programming in Python/Day-8/PF-Assgn-56.py
function max_frequency_word_counter (line 8) | def max_frequency_word_counter(data):
Condensed preview — 251 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (193K chars).
[
{
"path": ".github/workflows/greetings.yml",
"chars": 354,
"preview": "name: Greetings\n\non: [pull_request, issues]\n\njobs:\n greeting:\n runs-on: ubuntu-latest\n steps:\n - uses: actions"
},
{
"path": "DBMS/Day-2/Assignment-10.txt",
"chars": 35,
"preview": "ALTER TABLE Supplier DROP (Emailid)"
},
{
"path": "DBMS/Day-2/Assignment-11.txt",
"chars": 48,
"preview": "CREATE TABLE City(\n City VARCHAR2(20) UNIQUE\n);"
},
{
"path": "DBMS/Day-2/Assignment-12.txt",
"chars": 83,
"preview": "ALTER TABLE CITY DROP(CITY);\nor you can also do:\nALTER TABLE CITY DROP COLUMN CITY;"
},
{
"path": "DBMS/Day-2/Assignment-13.txt",
"chars": 219,
"preview": "CREATE TABLE Address(\n HouseNo NUMBER,\n Street VARCHAR2(30),\n city VARCHAR2(20) REFERENCES City(city),\n zip NUMBER(6"
},
{
"path": "DBMS/Day-2/Assignment-14.txt",
"chars": 45,
"preview": "ALTER TABLE Address MODIFY state VARCHAR2(20)"
},
{
"path": "DBMS/Day-2/Assignment-2.txt",
"chars": 198,
"preview": "CREATE TABLE Shopper(\n Shopperid INTEGER PRIMARY KEY,\n ShopperName VARCHAR2(20) NOT NULL,\n Gender CHAR(6) CHECK(GENDE"
},
{
"path": "DBMS/Day-2/Assignment-3.txt",
"chars": 48,
"preview": "ALTER TABLE Shopper MODIFY MobileNo VARCHAR2(15)"
},
{
"path": "DBMS/Day-2/Assignment-4.txt",
"chars": 314,
"preview": "CREATE TABLE Article(\n ArCode CHAR(5) CONSTRAINT arcode_article_pk PRIMARY KEY,\n CHECK(ArCode LIKE 'A%'),\n ArName VAR"
},
{
"path": "DBMS/Day-2/Assignment-5.txt",
"chars": 211,
"preview": "CREATE TABLE Store(\n Name VARCHAR2(20) PRIMARY KEY,\n Location VARCHAR2(30) NOT NULL,\n ManagerName VARCHAR2(30) UNIQUE"
},
{
"path": "DBMS/Day-2/Assignment-6.txt",
"chars": 49,
"preview": "ALTER TABLE Store RENAME COLUMN NAME TO STORENAME"
},
{
"path": "DBMS/Day-2/Assignment-7.txt",
"chars": 282,
"preview": "CREATE TABLE Bill(\n BillNo NUMBER PRIMARY KEY,\n StoreName VARCHAR2(20) REFERENCES Store(StoreName),\n Shopperid NUMBER"
},
{
"path": "DBMS/Day-2/Assignment-8.txt",
"chars": 142,
"preview": "CREATE TABLE Supplier(\n Supplierid VARCHAR2(6) PRIMARY KEY,\n Name VARCHAR2(30),\n ContactNo VARCHAR2(15) NOT NULL,\n E"
},
{
"path": "DBMS/Day-2/Assignment-9.txt",
"chars": 42,
"preview": "ALTER TABLE Supplier ADD City VARCHAR2(10)"
},
{
"path": "DBMS/Day-2/Exercise-3.txt",
"chars": 142,
"preview": "CREATE TABLE Player (\nPId INTEGER CONSTRAINT player_pid_pk PRIMARY KEY,\nPName VARCHAR2(20) CONSTRAINT player_pname NOT N"
},
{
"path": "DBMS/Day-2/Exercise-4.txt",
"chars": 157,
"preview": "CREATE TABLE Tournament(\n TId INTEGER PRIMARY KEY,\n TName VARCHAR2(30) NOT NULL,\n StartDt DATE NOT NULL,\n EndDt DATE"
},
{
"path": "DBMS/Day-2/Exercise-5.txt",
"chars": 336,
"preview": "CREATE TABLE Match(\n MId INTEGER,\n TId INTEGER REFERENCES Tournament(TId), PRIMARY KEY(MId, TId),\n Player1 INTEGER RE"
},
{
"path": "DBMS/Day-2/Exercise-6.txt",
"chars": 69,
"preview": "ALTER TABLE Player ADD(\n MatchesPlayed NUMBER,\n MatchesWon NUMBER\n)"
},
{
"path": "DBMS/Day-2/Exercise-7.txt",
"chars": 34,
"preview": "ALTER TABLE Player DROP(ContactNo)"
},
{
"path": "DBMS/Day-2/Exercise-8.txt",
"chars": 48,
"preview": "ALTER TABLE Player RENAME COLUMN PId TO PlayerId"
},
{
"path": "DBMS/Day-2/Exercise-9.txt",
"chars": 43,
"preview": "ALTER TABLE Player MODIFY PName VARCHAR(50)"
},
{
"path": "DBMS/Day-3/Assignment-15.txt",
"chars": 412,
"preview": "Actual Answer should be:\nINSERT INTO Shopper\n(ShopperId, ShopperName, Gender, MobileNo, Address) \nVALUES \n(101, 'Mark Ja"
},
{
"path": "DBMS/Day-3/Assignment-16.txt",
"chars": 57,
"preview": "INSERT INTO Article VALUES('A1001', 'Mouse', 500, 0, 'C')"
},
{
"path": "DBMS/Day-3/Assignment-17.txt",
"chars": 77,
"preview": "INSERT INTO Store VALUES('Loyal World', 'Infy Campus, Mysore', 'Rohan Kumar')"
},
{
"path": "DBMS/Day-3/Assignment-18.txt",
"chars": 200,
"preview": "INSERT INTO Bill\nVALUES\n(1001, 'Loyal World', 101, 'A1001', 1000, '20-OCT-15', 2)\n;\n\nHere Article Code - 'A1002' is not "
},
{
"path": "DBMS/Day-3/Assignment-19.txt",
"chars": 70,
"preview": "INSERT INTO Supplier VALUES\n('S501', 'Avaya Ltd', 9012345678,'Mysore')"
},
{
"path": "DBMS/Day-3/Assignment-20.txt",
"chars": 60,
"preview": "SELECT DESCR, PRICE FROM ITEM WHERE DESCR LIKE '%Hard disk%'"
},
{
"path": "DBMS/Day-3/Assignment-21.txt",
"chars": 229,
"preview": "Method - 1: \nSELECT * FROM Quotation WHERE QSTATUS IN ('Rejected','Closed')\n\nOR\nMethod - 2:\nSELECT * FROM Quotation WHER"
},
{
"path": "DBMS/Day-3/Assignment-22.txt",
"chars": 91,
"preview": "SELECT DESIGNATION, SALARY FROM EmpDetails WHERE DESIGNATION IN ('Manager','Billing Staff')"
},
{
"path": "DBMS/Day-3/Assignment-23.txt",
"chars": 63,
"preview": "SELECT ROId, Location FROM RetailOutlet WHERE Managerid IS NULL"
},
{
"path": "DBMS/Day-3/Assignment-24.txt",
"chars": 101,
"preview": "SELECT OrderId, QuotationId, Status FROM Orders WHERE OrderDate BETWEEN '1-DEC-2014' AND '1-JAN-2015'"
},
{
"path": "DBMS/Day-3/Assignment-25.txt",
"chars": 444,
"preview": "Method 1:\nHere, output matches but it has Logical Errors\n\nSELECT ItemCode, Descr, Price FROM Item WHERE \nDescr LIKE '%Sh"
},
{
"path": "DBMS/Day-3/Assignment-26.txt",
"chars": 51,
"preview": "SELECT DISTINCT DESIGNATION, SALARY FROM EmpDetails"
},
{
"path": "DBMS/Day-3/Assignment-27.txt",
"chars": 39,
"preview": "SELECT ITEMCODE, DESCR, PRICE FROM ITEM"
},
{
"path": "DBMS/Day-3/Assignment-28.txt",
"chars": 81,
"preview": "SELECT QUOTATIONID, SNAME FROM Quotation WHERE QSTATUS in ('Accepted','Rejected')"
},
{
"path": "DBMS/Day-3/Assignment-29.txt",
"chars": 62,
"preview": "SELECT Itemcode, descr, price FROM Item WHERE DESCR LIKE '_r%'"
},
{
"path": "DBMS/Day-3/Assignment-30.txt",
"chars": 34,
"preview": "SELECT DISTINCT ITEMTYPE FROM ITEM"
},
{
"path": "DBMS/Day-3/Assignment-31.txt",
"chars": 80,
"preview": "SELECT orderid, quotationid, status, pymtdate FROM Orders WHERE pymtdate IS NULL"
},
{
"path": "DBMS/Day-3/Assignment-32.txt",
"chars": 44,
"preview": "SELECT DISTINCT ITEMTYPE, CATEGORY FROM ITEM"
},
{
"path": "DBMS/Day-3/Assignment-33.txt",
"chars": 133,
"preview": "SELECT \n EMPID,\n Salary AS \"Current Salary\", \n Salary*1.10 AS \"New Salary\", \n Salary*0.1 AS \"Incremented Amount\" \nFR"
},
{
"path": "DBMS/Day-3/Assignment-34.txt",
"chars": 33,
"preview": "INSERT INTO City VALUES('Mysore')"
},
{
"path": "DBMS/Day-3/Assignment-35.txt",
"chars": 79,
"preview": "INSERT INTO Address VALUES\n(350,'Electronics City','Mysore',570018,'Karnataka')"
},
{
"path": "DBMS/Day-3/Assignment-36.txt",
"chars": 59,
"preview": "INSERT INTO Article VALUES\n('A1002','Keyboard',1000,10,'B')"
},
{
"path": "DBMS/Day-3/Assignment-37.txt",
"chars": 97,
"preview": "SELECT quotationid, qdate, quotedprice FROM Quotation WHERE quotedprice>1400 AND quotedprice<2150"
},
{
"path": "DBMS/Day-3/Assignment-38.txt",
"chars": 59,
"preview": "SELECT itemtype, descr, price FROM Item WHERE price > 4000"
},
{
"path": "DBMS/Day-3/Assignment-39.txt",
"chars": 125,
"preview": "SELECT designation, salary FROM EmpDetails WHERE designation IN ('Manager', 'Billing Staff') AND salary BETWEEN 2500 AND"
},
{
"path": "DBMS/Day-3/Exercise-10.txt",
"chars": 81,
"preview": "INSERT INTO Salesman \n(SId, SName, Location) \nVALUES \n(11, 'Elizabeth', 'London')"
},
{
"path": "DBMS/Day-3/Exercise-11.txt",
"chars": 60,
"preview": "INSERT INTO Product VALUES \n(110, 'Bat', 50, 'Sports', NULL)"
},
{
"path": "DBMS/Day-3/Exercise-12.txt",
"chars": 21,
"preview": "SELECT * FROM Product"
},
{
"path": "DBMS/Day-3/Exercise-13.txt",
"chars": 43,
"preview": "SELECT Prodid, price, category from Product"
},
{
"path": "DBMS/Day-3/Exercise-14.txt",
"chars": 37,
"preview": "SELECT DISTINCT Category FROM Product"
},
{
"path": "DBMS/Day-3/Exercise-15.txt",
"chars": 78,
"preview": "SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE CATEGORY='Apparel'"
},
{
"path": "DBMS/Day-3/Exercise-16.txt",
"chars": 73,
"preview": "SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM Product WHERE PDESC IS NULL"
},
{
"path": "DBMS/Day-3/Exercise-17.txt",
"chars": 93,
"preview": "SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM Product WHERE CATEGORY='Apparel' AND DISCOUNT>5"
},
{
"path": "DBMS/Day-3/Exercise-18.txt",
"chars": 56,
"preview": "UPDATE Product SET DISCOUNT = 25 WHERE CATEGORY='Sports'"
},
{
"path": "DBMS/Day-3/Exercise-19.txt",
"chars": 72,
"preview": "UPDATE Product SET PRICE=50 WHERE PDESC='Trouser' AND CATEGORY='Apparel'"
},
{
"path": "DBMS/Day-3/Exercise-20.txt",
"chars": 65,
"preview": "UPDATE Salesman SET SNAME='Jenny', LOCATION='Bristol' WHERE SID=3"
},
{
"path": "DBMS/Day-3/Exercise-21.txt",
"chars": 42,
"preview": "DELETE FROM SaleDetail WHERE SaleId = 1004"
},
{
"path": "DBMS/Day-3/Exercise-22.txt",
"chars": 39,
"preview": "DELETE FROM SaleDetail WHERE QUANTITY>5"
},
{
"path": "DBMS/Day-4/Assignment-40.txt",
"chars": 274,
"preview": "SELECT DISTINCT ITEMTYPE, \nCASE\n WHEN PRICE BETWEEN 0 AND 499 THEN 'Cheap'\n WHEN PRICE BETWEEN 500 AND 1999 THEN 'Affo"
},
{
"path": "DBMS/Day-4/Assignment-41.txt",
"chars": 118,
"preview": "SELECT TO_CHAR(QDATE, 'Month') MONTH, COUNT(QUOTATIONID)QUOTATIONCOUNT FROM QUOTATION GROUP BY TO_CHAR(QDATE, 'Month')"
},
{
"path": "DBMS/Day-4/Assignment-42.txt",
"chars": 166,
"preview": "SELECT ORDERID, ROUND(MONTHS_BETWEEN(PYMTDATE, ORDERDATE),2) \"No of Months\" FROM ORDERS WHERE ROUND(MONTHS_BETWEEN(PYMTD"
},
{
"path": "DBMS/Day-4/Assignment-43.txt",
"chars": 148,
"preview": "SELECT EMPID, SALARY \"Current Salary\", ROUND(SALARY*1.2,2) \"New Salary\", SALARY*0.2 \"Incremented Amount\" FROM EmpDetails"
},
{
"path": "DBMS/Day-4/Assignment-44.txt",
"chars": 64,
"preview": "SELECT ITEMCODE FROM ITEM WHERE ABS(QTYONHAND - REORDERLEVEL)>50"
},
{
"path": "DBMS/Day-4/Assignment-45.txt",
"chars": 116,
"preview": "SELECT ITEMCODE, AVG(QTYAVAILABLE) \"Average Quantity\" FROM RETAILSTOCK GROUP BY ITEMCODE HAVING AVG(QTYAVAILABLE)<75"
},
{
"path": "DBMS/Day-4/Assignment-46.txt",
"chars": 122,
"preview": "SELECT PYMTMODE, COUNT(*) PYMTCOUNT FROM ORDERS WHERE TO_CHAR(PYMTDATE, 'YYYY')<'2015' GROUP BY PYMTMODE HAVING COUNT(*)"
},
{
"path": "DBMS/Day-4/Assignment-47.txt",
"chars": 134,
"preview": "SELECT SNAME, AVG(QUOTEDPRICE) \"Average quoted price\" FROM QUOTATION WHERE QSTATUS='Closed' GROUP BY SNAME HAVING AVG(QU"
},
{
"path": "DBMS/Day-4/Assignment-48.txt",
"chars": 171,
"preview": "\r\nSELECT ITEMTYPE, CATEGORY, ROUND(AVG(PRICE),2) \"AVG_PRICE\" FROM ITEM WHERE ITEMTYPE IN ('FMCG','Computer') GROUP BY CA"
},
{
"path": "DBMS/Day-4/Assignment-49.txt",
"chars": 116,
"preview": "SELECT JOB, AVG(SAL) \"Average Salary\" FROM EMP WHERE JOB IN ('MANAGER', 'ANALYST') GROUP BY JOB HAVING AVG(SAL)>1500"
},
{
"path": "DBMS/Day-4/Assignment-50.txt",
"chars": 131,
"preview": "SELECT JOB, DEPTNO, AVG(SAL) AS \"AVGSALARY\" FROM EMP WHERE DEPTNO IN (10,20) AND SAL>2000 GROUP BY JOB, DEPTNO HAVING AV"
},
{
"path": "DBMS/Day-4/Assignment-51.txt",
"chars": 261,
"preview": "SELECT EMPID, EMPNAME, SALARY,\r\nCASE DESIGNATION\r\nWHEN 'Administrator' THEN SALARY * 1.10\r\nWHEN 'Manager' THEN SALARY * "
},
{
"path": "DBMS/Day-4/Assignment-52",
"chars": 173,
"preview": "SELECT Empid,Salary,\nCASE \nWHEN Salary > 5000 THEN 'Class 1'\nWHEN Salary BETWEEN 2500 AND 5000 THEN 'Class 2'\nWHEN Salar"
},
{
"path": "DBMS/Day-4/Assignment-55.txt",
"chars": 156,
"preview": "SELECT ORDERID \"ORDER ID\", STATUS \"ORDER STATUS\", \r\nCASE \r\nWHEN PYMTMODE IS NULL THEN 'Payment yet not done'\r\nELSE PYMTM"
},
{
"path": "DBMS/Day-4/Assignment-56.txt",
"chars": 45,
"preview": "SELECT DESCR FROM ITEM WHERE LENGTH(DESCR)>15"
},
{
"path": "DBMS/Day-4/Assignment-57.txt",
"chars": 70,
"preview": "SELECT SUBSTR(ROID,2) AS \"Numeric Part\" FROM RETAILSTOCK GROUP BY ROID"
},
{
"path": "DBMS/Day-4/Assignment-58.txt",
"chars": 66,
"preview": "SELECT TO_CHAR(SYSDATE,'Mon/dd/yyyy Day') AS CURRENTDATE FROM DUAL"
},
{
"path": "DBMS/Day-4/Exercise-23.txt",
"chars": 79,
"preview": "SELECT PRODID, PDESC, CATEGORY FROM Product WHERE UPPER(Category)='ELECTRONICS'"
},
{
"path": "DBMS/Day-4/Exercise-24.txt",
"chars": 67,
"preview": "SELECT PRODID, SUBSTR(PDESC, 1,5) PDESC_FIVE, CATEGORY FROM Product"
},
{
"path": "DBMS/Day-4/Exercise-25.txt",
"chars": 246,
"preview": "SELECT COUNT(SALEID) SALE_COUNT FROM Sale WHERE MONTHS_BETWEEN(SYSDATE, SLDATE)<=60\n\nWe consider 60 because there are n"
},
{
"path": "DBMS/Day-4/Exercise-26.txt",
"chars": 117,
"preview": "SELECT NVL(PDESC, 'No Description') PDESC, DISCOUNT FROM Product\n\nThere is no Expected Result given for the question."
},
{
"path": "DBMS/Day-4/Exercise-27.txt",
"chars": 83,
"preview": "SELECT PRODID, CATEGORY, PRICE, DISCOUNT FROM Product ORDER BY CATEGORY DESC, PRICE"
},
{
"path": "DBMS/Day-4/Exercise-28.txt",
"chars": 114,
"preview": "SELECT PRODID, CATEGORY, DISCOUNT FROM Product WHERE CATEGORY IN ('Sports', 'Apparel') ORDER BY CATEGORY, DISCOUNT"
},
{
"path": "DBMS/Day-4/Exercise-29.txt",
"chars": 404,
"preview": "Both the queries are same, but the resultant outputs(order) is different.\nRequired Output:\nSELECT TO_CHAR(SLDATE, 'Month"
},
{
"path": "DBMS/Day-4/Exercise-30.txt",
"chars": 104,
"preview": "SELECT PRODID, SUM(QUANTITY) QTY_SOLD FROM SALEDETAIL WHERE QUANTITY>1 GROUP BY PRODID HAVING COUNT(*)>1"
},
{
"path": "DBMS/Day-4/Exercise-31.txt",
"chars": 116,
"preview": "SELECT PRODID, PDESC, PRICE AS \"Old_Price\", ROUND(PRICE*0.775,2) AS \"New_Price\" FROM Product WHERE CATEGORY='Sports'"
},
{
"path": "DBMS/Day-4/Exercise-32.txt",
"chars": 80,
"preview": "SELECT SALEID, ROUND(MONTHS_BETWEEN(SYSDATE,SLDATE),1) AS \"MONTH_AGED\" FROM Sale"
},
{
"path": "DBMS/Day-4/Exercise-33.txt",
"chars": 105,
"preview": "SELECT ROUND(AVG(PRICE), 2) \"Avg\", MIN(PRICE) \"Min\", MAX(PRICE) \"Max\", COUNT(PRODID) \"Total\" FROM Product"
},
{
"path": "DBMS/Day-4/Exercise-34.txt",
"chars": 161,
"preview": "METHOD 1:\r\nSELECT SNAME||' is from ' ||Location AS \"RESULT\" FROM SalesMan\r\n\r\nMETHOD 2:\r\nSELECT CONCAT(SNAME,CONCAT(' is "
},
{
"path": "DBMS/Day-4/Exercise-35.txt",
"chars": 120,
"preview": "SELECT TO_CHAR(TO_DATE('Jan/10/2015', 'MON/DD/YYYY'), 'Month') MONTH, TO_NUMBER('2,50,000', '9,99,999') AMOUNT FROM DUAL"
},
{
"path": "DBMS/Day-4/Exercise-36.txt",
"chars": 73,
"preview": "SELECT PRODID, PDESC, PRICE FROM Product ORDER BY PRICE DESC, PRODID DESC"
},
{
"path": "DBMS/Day-4/Exercise-37.txt",
"chars": 56,
"preview": "SELECT PRODID, PDESC, PRICE FROM Product ORDER BY PDESC "
},
{
"path": "DBMS/Day-4/Exercise-38.txt",
"chars": 73,
"preview": "SELECT LOCATION, COUNT(SID) \"NUMBER_SMAN\" FROM Salesman GROUP BY LOCATION"
},
{
"path": "DBMS/Day-4/Exercise-39.txt",
"chars": 73,
"preview": "SELECT CATEGORY FROM PRODUCT GROUP BY (CATEGORY) HAVING COUNT(PRODID) > 1"
},
{
"path": "DBMS/Day-5/Assignment-67.txt",
"chars": 98,
"preview": "SELECT E.ENAME, E.SAL, D.DNAME \r\nFROM EMP E INNER JOIN DEPT D\r\nON E.DEPTNO=D.DEPTNO AND E.SAL>2000"
},
{
"path": "DBMS/Day-5/Assignment-68.txt",
"chars": 96,
"preview": "SELECT E.ENAME, D.DNAME \r\nFROM EMP E INNER JOIN DEPT D\r\nON E.DEPTNO=D.DEPTNO AND E.JOB='MANAGER'"
},
{
"path": "DBMS/Day-5/Assignment-69.txt",
"chars": 114,
"preview": "\r\nSELECT D.DNAME\r\nFROM EMP E, DEPT D \r\nWHERE D.DEPTNO = E.DEPTNO AND SAL>1500 \r\nGROUP BY D.DNAME HAVING COUNT(*)>1"
},
{
"path": "DBMS/Day-5/Assignment-70.txt",
"chars": 394,
"preview": "Step 1: Fetch all the employee no's (including NULL) an their vehicle ids\r\nSELECT E.EMPNO, EV.VEHICLEID FROM EMP E\r\nLEFT"
},
{
"path": "DBMS/Day-5/Assignment-71.txt",
"chars": 99,
"preview": "SELECT I.ITEMCODE, I.DESCR, Q.SNAME\r\nFROM ITEM I INNER JOIN QUOTATION Q\r\nON I.ITEMCODE = Q.ITEMCODE"
},
{
"path": "DBMS/Day-5/Assignment-72.txt",
"chars": 147,
"preview": "SELECT C.CUSTID \"Customer Id\", C.CUSTNAME \"Customer Name\"\r\nFROM CUSTOMER C INNER JOIN EMPDETAILS E\r\nON C.CUSTNAME=E.EMPN"
},
{
"path": "DBMS/Day-5/Assignment-73.txt",
"chars": 144,
"preview": "SELECT I.ITEMCODE, I.DESCR, I.CATEGORY, Q.QUOTEDPRICE\r\nFROM ITEM I INNER JOIN QUOTATION Q\r\nON I.ITEMCODE=Q.ITEMCODE WHER"
},
{
"path": "DBMS/Day-5/Assignment-74.txt",
"chars": 165,
"preview": "SELECT R1.ROID, I.DESCR, I.ITEMTYPE, R2.UNITPRICE\r\nFROM ITEM I,RETAILOUTLET R1,RETAILSTOCK R2\r\nWHERE I.ITEMCODE=R2.ITEMC"
},
{
"path": "DBMS/Day-5/Assignment-75.txt",
"chars": 184,
"preview": "SELECT Q.ITEMCODE, Q.SNAME, SUM(O.QTYORDERED) TOTALQUANTITY\r\nFROM QUOTATIOn Q, ORDERS O\r\nWHERE Q.QUOTATIONID=O.QUOTATION"
},
{
"path": "DBMS/Day-5/Assignment-76.txt",
"chars": 157,
"preview": "SELECT I.ITEMCODE, I.DESCR\r\nFROM ITEM I,QUOTATION Q\r\nWHERE I.ITEMCODE=Q.ITEMCODE\r\nAND I.PRICE=Q.QUOTEDPRICE \r\nGROUP BY I"
},
{
"path": "DBMS/Day-5/Assignment-77.txt",
"chars": 128,
"preview": "SELECT Q.SNAME, Q.QUOTATIONID\r\nFROM QUOTATION Q, ORDERS O\r\nWHERE Q.QUOTATIONID=O.QUOTATIONID\r\nAND O.DELIVEREDDATE-O.ORDE"
},
{
"path": "DBMS/Day-5/Assignment-78.txt",
"chars": 294,
"preview": "SELECT NVL(E.EMPNAME,'No Manager') EMPNAME, I.CATEGORY, SUM(R2.QTYAVAILABLE) TOTALQUANTITY\r\nFROM RETAILOUTLET R1 INNER J"
},
{
"path": "DBMS/Day-5/Assignment-79.txt",
"chars": 749,
"preview": "Step 1: Fetch Locations, customer types and quantity \r\nSELECT R1.LOCATION, C.CUSTTYPE, P.QUANTITY\r\nFROM RETAILOUTLET R1,"
},
{
"path": "DBMS/Day-5/Assignment-80.txt",
"chars": 820,
"preview": "Important: Given -> all items of type 'FMCG'\r\nFor this, we will fetch all the items belonging to type 'FMCG' and apply l"
},
{
"path": "DBMS/Day-5/Assignment-81.txt",
"chars": 562,
"preview": "Important points to note:\r\nGiven:\r\n 1) For each item -> requires left outer join\r\n 2) Specific Outlet ONLY -> use AND "
},
{
"path": "DBMS/Day-5/Assignment-82.txt",
"chars": 245,
"preview": "Given:\r\n 1) details of retailoutlet should be displayed even if no employee is working in it -> indicating Left outer j"
},
{
"path": "DBMS/Day-5/Assignment-83.txt",
"chars": 573,
"preview": "Given,\r\n 1) ..of those employees who work in same retail outlet where George works... -> Self join\r\n 2) Do not display"
},
{
"path": "DBMS/Day-5/Assignment-84.txt",
"chars": 147,
"preview": "SELECT C1.CUSTID, C1.CUSTNAME\r\nFROM CUSTOMER C1 INNER JOIN CUSTOMER C2\r\nON C1.CUSTID <> C2.CUSTID\r\nWHERE C1.ADDRESS=C2.A"
},
{
"path": "DBMS/Day-5/Assignment-85.txt",
"chars": 271,
"preview": "SELECT C.CUSTNAME, P.BILLAMOUNT\r\nFROM CUSTOMER C, PURCHASEBILL P\r\nWHERE C.CUSTID=P.CUSTID\r\nAND P.BILLAMOUNT>5000\r\n\r\nDidn"
},
{
"path": "DBMS/Day-5/Exercise-40.txt",
"chars": 191,
"preview": "SELECT SID, SNAME, LOCATION FROM Salesman WHERE SNAME LIKE '%e%' AND LOCATION LIKE '%o%'\r\nUNION ALL\r\nSELECT SID, SNAME, "
},
{
"path": "DBMS/Day-5/Exercise-41.txt",
"chars": 164,
"preview": "SELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE DISCOUNT<10 \r\nUNION ALL\r\nSELECT PRODID, PDESC, CATEGORY, DIS"
},
{
"path": "DBMS/Day-5/Exercise-42.txt",
"chars": 284,
"preview": "Method - 1:\r\nSELECT PRODID, PDESC, CATEGORY, DISCOUNT FROM PRODUCT WHERE DISCOUNT<10 \r\nUNION\r\nSELECT PRODID, PDESC, CATE"
},
{
"path": "DBMS/Day-5/Exercise-43.txt",
"chars": 126,
"preview": "SELECT 'S' TYPE , SID ID, SNAME DETAILS FROM Salesman\r\nUNION ALL\r\nSELECT 'P' TYPE , PRODID ID, CATEGORY DETAILS FROM Pro"
},
{
"path": "DBMS/Day-5/Exercise-44.txt",
"chars": 101,
"preview": "SELECT ID, ENAME, DEPT, E.COMPID, MAKE\r\nFROM EMPLOYEE E INNER JOIN COMPUTER C\r\nON E.COMPID = C.COMPID"
},
{
"path": "DBMS/Day-5/Exercise-45.txt",
"chars": 130,
"preview": "SELECT ID, ENAME, E.COMPID, MAKE \r\nFROM EMPLOYEE E INNER JOIN COMPUTER c\r\nON E.COMPID=C.COMPID AND MODEL IN ('Precision'"
},
{
"path": "DBMS/Day-5/Exercise-46.txt",
"chars": 144,
"preview": "SELECT DEPT, COUNT(C.COMPID) \"NUMBER OF COMPUTERS\"\r\nFROM EMPLOYEE E INNER JOIN COMPUTER C\r\nON E.COMPID = C.COMPID AND MA"
},
{
"path": "DBMS/Day-5/Exercise-47.txt",
"chars": 105,
"preview": "SELECT S1.SALEID, S1.SLDATE\r\nFROM Sale S1, Salesman S2\r\nWHERE S1.SID = S2.SID\r\nAND S2.Location = 'London'"
},
{
"path": "DBMS/Day-5/Exercise-48.txt",
"chars": 124,
"preview": "SELECT S1.SID, S1.SNAME, S1.LOCATION\r\nFROM SALESMAN S1 INNER JOIN SALESMAN S2\r\nON S1.LOCATION=S2.LOCATION AND S1.SID<>S2"
},
{
"path": "DBMS/Day-5/Exercise-49.txt",
"chars": 110,
"preview": "SELECT S1.SNAME, S2.SALEID\r\nFROM Salesman S1 FULL OUTER JOIN Sale S2\r\nON S1.SID=S2.SID\r\nORDER BY S1.SNAME DESC"
},
{
"path": "DBMS/Day-5/Exercise-50.txt",
"chars": 2030,
"preview": "Loved this Exercise! Found this the most challenging and interesting Exercise in SQL till now.\r\nWill be a lot useful for"
},
{
"path": "DBMS/Day-5/Exercise-51.txt",
"chars": 261,
"preview": "This is the same query which we have obtained in the previous exercise(EXERCISE 50) STEP 2:\r\nSELECT S2.SALEID, S3.PRODID"
},
{
"path": "DBMS/Day-5/Exercise-52.txt",
"chars": 557,
"preview": "This query is exactly similar to Exercise 50, except that we use LEFT OUTER JOIN\r\nFurther we use NVL Function to display"
},
{
"path": "DBMS/Day-5/Exercise-53.txt",
"chars": 292,
"preview": "SIMILAR TO Exercise-50 Query:\r\n\r\nSELECT S1.LOCATION, P1.CATEGORY, SUM(S3.QUANTITY) \"Total Quantity\" \r\nFROM SALE S2 INNER"
},
{
"path": "DBMS/Day-5/Exercise-54.txt",
"chars": 127,
"preview": "SELECT E.ENAME, E.DEPT, NVL(C.MODEL,'Not allocated') \"MODEL\"\r\nFROM EMPLOYEE E LEFT OUTER JOIN COMPUTER C\r\nON E.COMPID=C."
},
{
"path": "DBMS/Day-5/Exercise-55.txt",
"chars": 104,
"preview": "SELECT E.ID, E.ENAME, E.DEPT, C.MODEL\r\nFROM EMPLOYEE E FULL OUTER JOIN COMPUTER C\r\nON E.COMPID=C.COMPID "
},
{
"path": "DBMS/Day-5/Exercise-56.txt",
"chars": 402,
"preview": "E2 Table is taken for fetching Managers. Hence E2 denotes Managers.\r\nE1 Tables denotes employees which are not managers."
},
{
"path": "DBMS/Day-5/Exercise-57.txt",
"chars": 861,
"preview": "Method - 1:\r\nSELECT s3.SID, S3.SNAME FROM Salesman S3\r\nMINUS\r\nSELECT S1.SID, S1.SNAME\r\nFROM Salesman S1 INNER JOIN Sale "
},
{
"path": "DBMS/Day-5/Exercise-58.txt",
"chars": 131,
"preview": "SELECT P1.PRODID, P1.CATEGORY, P1. PRICE \r\nFROM PRODUCT P1 INNER JOIN PRODUCT P2\r\nON P1.PRICE=P2.PRICE WHERE P1.PRODID <"
},
{
"path": "DBMS/Day-5/Practice-1 Self Join.txt",
"chars": 346,
"preview": "Another Alternative to Practice Question of Self Join:\r\n\r\nMethod - 1:\r\nSELECT E.ID, E.ENAME\r\nFROM EMPLOYEE E INNER JOIN "
},
{
"path": "DBMS/Day-5/Practice-2 Outer Join.txt",
"chars": 558,
"preview": "QUESTION: Display computer id, make, model of computers along with the id of the employee it is assigned to. Display Not"
},
{
"path": "DBMS/Day-5/readme.md",
"chars": 19,
"preview": "This is Day-5 DBMS\n"
},
{
"path": "DBMS/Day-6/Assignment-100.txt",
"chars": 377,
"preview": "Fetch the empno from EmpVehicle that share same vehcile:\nSELECT EV1.EMPNO FROM EMPVEHICLE EV1, EMPVEHICLE EV2 WHERE EV1."
},
{
"path": "DBMS/Day-6/Assignment-102.txt",
"chars": 218,
"preview": "SELECT I.ITEMCODE, I.DESCR, Q.QDATE \nFROM ITEM I, QUOTATION Q\nWHERE I.ITEMCODE=Q.ITEMCODE\nAND Q.QUOTEDPRICE <\n(\n SELECT"
},
{
"path": "DBMS/Day-6/Assignment-103.txt",
"chars": 678,
"preview": "Identify purchase bills in which -> Lets assign PURCHASEBILL 'P' table to the outer query\nthe bill amount is less than o"
},
{
"path": "DBMS/Day-6/Assignment-104.txt",
"chars": 763,
"preview": "Lets divide the question:\n\nIdentify the supplier who has submitted --> SELECT Q1.SNAME (Outer query : QUOTATION Q1)\nthe "
},
{
"path": "DBMS/Day-6/Assignment-105.txt",
"chars": 436,
"preview": "The payroll department requires the details of those employees\nwho are getting the highest salary --> MAX(SAL) \nin each "
},
{
"path": "DBMS/Day-6/Assignment-106.txt",
"chars": 790,
"preview": "Display the customer id and customer name of those customers --> SELECT C.CUSTID, C.CUSTNAME FROM CUSTOMER C\nwho have "
},
{
"path": "DBMS/Day-6/Assignment-93.txt",
"chars": 106,
"preview": "SELECT ITEMCODE, ITEMTYPE, DESCR, CATEGORY FROM ITEM WHERE ITEMCODE IN (SELECT ITEMCODE FROM PURCHASEBILL)"
},
{
"path": "DBMS/Day-6/Assignment-94.txt",
"chars": 487,
"preview": "Find the min quoted price:\nSELECT MIN(QUOTEDPRICE) FROM QUOTATION\n\nFind the corresponding distinct itemcodes:\nSELECT DIS"
},
{
"path": "DBMS/Day-6/Assignment-95.txt",
"chars": 1411,
"preview": "The management would like to know the details of the items \nwhich has maximum quoted price \namongst the quotations that "
},
{
"path": "DBMS/Day-6/Assignment-96.txt",
"chars": 148,
"preview": "SELECT ITEMCODE, DESCR, PRICE FROM ITEM WHERE PRICE = \n\t(\n\t SELECT MAX(PRICE) FROM ITEM WHERE PRICE<\n\t\t(\n\t\t SELECT MA"
},
{
"path": "DBMS/Day-6/Assignment-98.txt",
"chars": 221,
"preview": "SELECT ENAME, JOB FROM EMP WHERE EMPNO IN\n(\n SELECT EMPNO FROM VEHICLE V, EMPVEHICLE EV WHERE EV.VEHICLEID=V.VEHICLEID\n)"
},
{
"path": "DBMS/Day-6/Assignment-99.txt",
"chars": 122,
"preview": "Step 1: Find max salary\nStep 2: Display his/her details\n\nSELECT ENAME FROM EMP WHERE SAL=\n\t(\n\t\tSELECT MAX(SAL) FROM EMP\n"
},
{
"path": "DBMS/Day-6/Exercise-59.txt",
"chars": 74,
"preview": "SELECT SALEID,SLDATE FROM SALE WHERE SLDATE=(SELECT MAX(SLDATE) FROM SALE)"
},
{
"path": "DBMS/Day-6/Exercise-60.txt",
"chars": 299,
"preview": "\r\nSELECT SNAME FROM SALESMAN WHERE SID IN (SELECT SID FROM Sale GROUP BY SID HAVING COUNT(SALEID)>=2)\r\n\r\nNote: If we use"
},
{
"path": "DBMS/Day-6/Exercise-61.txt",
"chars": 649,
"preview": "Step 1: Find the minimum quantity (which will be a single row)\r\nSELECT MIN(SUM(QUANTITY)) FROM SALEDETAIL GROUP BY PRODI"
},
{
"path": "DBMS/Day-6/Exercise-62.txt",
"chars": 3302,
"preview": "The given expected Result has two rows with SID = 1 and 5.\r\nThe tuple of SID=5 doesnot statisfy the condition as given i"
},
{
"path": "DBMS/Day-6/Exercise-63.txt",
"chars": 134,
"preview": "SELECT P.PRODID, P.CATEGORY, P.PDESC, P.PRICE FROM PRODUCT P WHERE PRICE = (SELECT MAX(PRICE) FROM PRODUCT WHERE CATEGOR"
},
{
"path": "DBMS/Day-6/Exercise-64.txt",
"chars": 89,
"preview": "SELECT SNAME FROM SALESMAN S WHERE NOT EXISTS(SELECT SID FROM SALE S1 WHERE S1.SID=S.SID)"
},
{
"path": "DBMS/Day-6/Exercise-65.txt",
"chars": 124,
"preview": "SELECT SNAME FROM SALESMAN S WHERE EXISTS (SELECT * FROM SALE S1 WHERE S.SID=S1.SID AND TO_CHAR(S1.SLDATE, 'MM-YY')='06-"
},
{
"path": "DBMS/Day-6/Exercise-66.txt",
"chars": 1637,
"preview": "Display SId, SName and Location -> SELECT S.SID, S.SNAME, S.LOCATION\r\nof those salesmen -> FROM SALESMAN S WHERE S.SID I"
},
{
"path": "DBMS/Day-6/readme.md",
"chars": 14,
"preview": "This is day 6\n"
},
{
"path": "DSA in Python/Day-1/Assignment 1.txt",
"chars": 537,
"preview": "#DSA-Assgn-1\n\ndef merge_list(list1, list2):\n merged_data=\"\"\n j=len(list1)-1\n for i in range(len(list1)):\n "
},
{
"path": "DSA in Python/Day-1/Assignment 2.txt",
"chars": 1786,
"preview": "#DSA-Assgn-2\nclass Car:\n def __init__(self,model,year,registration_number):\n self.__model=model;\n self."
},
{
"path": "DSA in Python/Day-1/Assignment 3.txt",
"chars": 375,
"preview": "def check_double(list1,list2):\n new_list=[]\n for i in list1:\n for j in list2:\n if j==(2*i):\n "
},
{
"path": "DSA in Python/Day-1/Assignment 4.txt",
"chars": 1811,
"preview": "#DSA-Assgn-4\nThis solution is incomplete. Will complete it later.\n#DSA-Assgn-4\n\nclass Player:\n def __init__(self,name"
},
{
"path": "DSA in Python/Day-2/Assignment 10.txt",
"chars": 4934,
"preview": "#DSA-Assgn-10\nclass Node:\n def __init__(self,data):\n self.__data=data\n self.__next=None\n\n def get_da"
},
{
"path": "DSA in Python/Day-2/Assignment 5.txt",
"chars": 3809,
"preview": "#DSA-Assgn-5\nclass Node:\n def __init__(self,data):\n self.__data=data\n self.__next=None\n\n def get_dat"
},
{
"path": "DSA in Python/Day-2/Assignment 6.txt",
"chars": 4730,
"preview": "#DSA-Assgn-6\nclass Node:\n def __init__(self,data):\n self.__data=data\n self.__next=None\n\n def get_dat"
},
{
"path": "DSA in Python/Day-2/Assignment 7.txt",
"chars": 3569,
"preview": "#DSA-Assgn-7\nclass Node:\n def __init__(self,data):\n self.__data=data\n self.__next=None\n\n def get_dat"
},
{
"path": "DSA in Python/Day-2/Assignment 8.txt",
"chars": 4030,
"preview": "#DSA-Assgn-8\nclass Node:\n def __init__(self,data):\n self.__data=data\n self.__next=None\n\n def get_dat"
},
{
"path": "DSA in Python/Day-2/Assignment 9.txt",
"chars": 3399,
"preview": "#DSA-Assgn-9\nclass Node:\n def __init__(self,data):\n self.__data=data\n self.__next=None\n\n def get_dat"
},
{
"path": "DSA in Python/Day-3/Assignment-11.py",
"chars": 2117,
"preview": "#DSA-Assgn-11\nclass Queue:\n def __init__(self,max_size):\n self.__max_size=max_size\n self.__elements=[No"
},
{
"path": "DSA in Python/Day-3/Assignment-13.py",
"chars": 2069,
"preview": "#DSA-Assgn-13\nclass Stack:\n def __init__(self,max_size):\n self.__max_size=max_size\n self.__elements=[No"
},
{
"path": "DSA in Python/Day-3/Assignment-14.py",
"chars": 1953,
"preview": "#DSA-Assgn-14\nclass Queue:\n def __init__(self,max_size):\n\n self.__max_size=max_size\n self.__elements=[N"
},
{
"path": "DSA in Python/Day-3/Assignment-15.py",
"chars": 5262,
"preview": "#DSA-Assgn-15\nclass Queue:\n def __init__(self,max_size):\n\n self.__max_size=max_size\n self.__elements=[N"
},
{
"path": "DSA in Python/Day-4/Assignment-16.py",
"chars": 3658,
"preview": "#DSA-Assgn-16\nclass Queue:\n def __init__(self,max_size):\n\n self.__max_size=max_size\n self.__elements=[N"
},
{
"path": "DSA in Python/Day-4/Assignment-17.txt",
"chars": 1761,
"preview": "#DSA-Assgn-17\r\n\r\ndef find_matches(country_name):\r\n l=[]\r\n for match in match_list:\r\n detail=match.split(\":\""
},
{
"path": "DSA in Python/Day-4/Assignment-18.txt",
"chars": 698,
"preview": "#DSA-Assgn-18\r\n\r\ndef find_unknown_words(text,vocabulary):\r\n l=[]\r\n status=0\r\n text_list=text.split(\" \")\r\n fo"
},
{
"path": "DSA in Python/Day-4/Assignment-19.txt",
"chars": 586,
"preview": "#DSA-Assgn-19\r\n\r\ndef last_instance( num_list, start, end, key):\r\n count=0\r\n index=0\r\n if key in num_list:\r\n "
},
{
"path": "DSA in Python/Day-5/Assignment-20.py",
"chars": 2857,
"preview": "#DSA-Assgn-20\n#Implement Item class here\nclass Item:\n def __init__(self, item_name, author_name, published_year):\n "
},
{
"path": "DSA in Python/Day-5/Assignment-21.py",
"chars": 6911,
"preview": "#DSA-Assgn-21\nclass Queue:\n def __init__(self,max_size):\n\n self.__max_size=max_size\n self.__elements=[N"
},
{
"path": "DSA in Python/Day-5/Assignment-22.py",
"chars": 2157,
"preview": "#DSA-Assgn-22\nclass Stack:\n def __init__(self,max_size):\n self.__max_size=max_size\n self.__elements=[No"
},
{
"path": "DSA in Python/Day-5/Assignment-23.py",
"chars": 2598,
"preview": "#DSA-Tryout\n'''BEST Question solved till now!!'''\nimport random\nother=['J','K','Q','A']\ndeck=['C','D','H','S']\ndef gener"
},
{
"path": "DSA in Python/Day-5/Exercise-17.py",
"chars": 481,
"preview": "#DSA-Exer-17\n\ndef swap(num_list, first_index, second_index):\n #Remove pass and write your logic here\n #As python l"
},
{
"path": "DSA in Python/Day-5/Exercise-18.py",
"chars": 621,
"preview": "#DSA-Exer-18\n\ndef find_next_min(num_list,start_index):\n #Remove pass and write the logic to find the minimum element "
},
{
"path": "DSA in Python/Day-5/Exercise-19_SELECTION-SORT-ALGO.py",
"chars": 615,
"preview": "#DSA-Exer-19\ndef swap(num_list, first_index, second_index):\n temp=num_list[first_index]\n num_list[first_index]=num"
},
{
"path": "DSA in Python/Day-5/Exercise-20_BUBBLE-SORT-ALGO.py",
"chars": 1132,
"preview": "#DSA-Exer-20\ndef swap(num_list, first_index, second_index):\n temp = num_list[first_index]\n num_list[first_index]=n"
},
{
"path": "DSA in Python/Day-5/Exercise-21_MERGE-SORT-ALGO.py",
"chars": 964,
"preview": "#DSA-Exer-21\n\ndef merge_sort(num_list):\n low=0\n high=len(num_list)-1\n if low==high:\n return num_list\n "
},
{
"path": "DSA in Python/Day-5/Exercise-22.py",
"chars": 703,
"preview": "#DSA-Exer-22\n\ndef order_heights(student_list,height_list):\n new_list=height_list.copy()\n students=[]\n new_list."
},
{
"path": "DSA in Python/Day-5/Exercise-23.py",
"chars": 735,
"preview": "#DSA-Exer-23\n\ndef arrange_tickets(tickets_list):\n new_list=[]\n for i in range(1,21):\n if \"T\"+str(i) in tick"
},
{
"path": "DSA in Python/Day-6/Exercise-24.py",
"chars": 1139,
"preview": "#DSA-Exer-24\n\ndef make_change(denomination_list, amount):\n '''Remove pass and implement the Greedy approach to make t"
},
{
"path": "DSA in Python/Day-6/Exercise-25.py",
"chars": 1933,
"preview": "#DSA-Exer-25\ndef sortActivity(value):\n return value[1]\ndef sortActivities(value):\n return len(value)\ndef find_maxi"
},
{
"path": "OOP in Python/Day-1/Assignment-1.txt",
"chars": 45,
"preview": "Customer, Item and Employee will be objects.\n"
},
{
"path": "OOP in Python/Day-1/Assignment-2.txt",
"chars": 205,
"preview": "Customer:\nAttributes:customer_name, bill_amount\nMethods: purchases(),pays_bill(amount)\n\nItem:\nAttributes: item_id, descr"
},
{
"path": "OOP in Python/Day-1/assignment-3.py",
"chars": 428,
"preview": "#OOPR-Assgn-3\nclass Customer:\n \n def __init__(self):\n self.customer_name=\"Omkar\"\n self.bill_amount=0"
},
{
"path": "OOP in Python/Day-1/assignment-4.py",
"chars": 903,
"preview": "def check_type(type):\n vehicle_type=['Two Wheeler', 'Four Wheeler']\n if type not in vehicle_type:\n retu"
},
{
"path": "OOP in Python/Day-1/assignment-8.py",
"chars": 1327,
"preview": "#OOPR-Assgn-8\nstudent_id_counter=1\nclass Student:\n \n def __init__(self):\n self.__student_id=None\n sel"
},
{
"path": "OOP in Python/Day-1/assignment-9.py",
"chars": 1775,
"preview": "#OOPR-Assgn-9\ncourses = {\n 1001 : 25575.0,\n 1002 : 15500.0\n}\nclass Student:\n def __init__(self):\n self._"
},
{
"path": "OOP in Python/Day-2/assignment-10.py",
"chars": 1104,
"preview": "#OOPR-Assgn-10\n#Efficient Program by Minal Kaminwar\nclass CallDetail:\n def __init__(self, phoneno, called_no, duratio"
},
{
"path": "OOP in Python/Day-2/assignment-11.py",
"chars": 1568,
"preview": "#OOPR-Assgn-11\nflowers=['Orchid','Rose','Jasmine']\nlevels=[15,25,40]\nclass Flower:\n def __init__(self):\n self."
},
{
"path": "OOP in Python/Day-2/assignment-12.py",
"chars": 800,
"preview": "#OOPR-Assgn-12\nclass Bill:\n def __init__(self, bill_id, patient_name):\n self.__bill_id=bill_id\n self.__"
},
{
"path": "OOP in Python/Day-3/Assignment-19.txt",
"chars": 1081,
"preview": "#OOPR-Assgn-20\nclass Applicant:\n __application_dict={'A': 0, 'B': 4, 'C': 0}\n __applicant_id_count=1000\n def __"
},
{
"path": "OOP in Python/Day-3/Assignment-20.txt",
"chars": 1081,
"preview": "#OOPR-Assgn-20\nclass Applicant:\n __application_dict={'A': 0, 'B': 4, 'C': 0}\n __applicant_id_count=1000\n def __"
},
{
"path": "OOP in Python/Day-3/Assignment-21.txt",
"chars": 1706,
"preview": "#OOPR-Assgn-21\nclass Patient:\n def __init__(self,patient_id,patient_name,list_of_lab_test_ids):\n self.__patien"
},
{
"path": "OOP in Python/Day-3/assignment-15.py",
"chars": 564,
"preview": "#OOPR-Assgn-15\n\nclass Parrot:\n __counter=7000\n def __init__(self, name, color):\n self.__unique_number=Parro"
},
{
"path": "OOP in Python/Day-3/assignment-16.py",
"chars": 1425,
"preview": "#OOPR-Assgn-16\n\nclass Customer:\n def __init__(self,phone_no,name,age):\n self.phone_no=phone_no\n self.na"
}
]
// ... and 51 more files (download for full content)
About this extraction
This page contains the full source code of the omkar98/InfyTQ-Answers GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 251 files (167.1 KB), approximately 51.4k tokens, and a symbol index with 405 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.