Share & grow the world's knowledge!
We want to connect the people who have knowledge to the people who need it, to bring together people with different perspectives so they can understand each other better, and to empower everyone to share their knowledge.
Data Science Internshala final test answer
Get Internshala final test answers for all courses on SIKSHAPATH-STORE Like: Data science final test answer ( Link : DATA_SCIENCE ) Blockchain final test answer Internshala blockchain final test answer Matlab final test answer Ethical hacking final test answer Android app development final test answRead more
Get Internshala final test answers for all courses on SIKSHAPATH-STORE
Like:
Data science final test answer ( Link : DATA_SCIENCE )
Blockchain final test answer
Internshala blockchain final test answer
Matlab final test answer
Ethical hacking final test answer
Android app development final test answer Internshala
Web development final test answer
Cloud computing using AWS final test answer
and many more.
Just visit: https://store.sikshapath.in/store/ or CLICK HERE -> Sikshapath-Store
See lessSolve using fractional knapsack: M=20, n=4 P= (3, 10, 15, …
The fractional knapsack problem involves selecting items to fill a knapsack of limited capacity (M=20 in this case) in such a way as to maximize the total value. Here's how to solve it: Sort the items in decreasing order of their value per unit weight (i.e. Pi/Wi). Item 1: 3/5 = 0.6 Item 2: 10/13 =Read more
The fractional knapsack problem involves selecting items to fill a knapsack of limited capacity (M=20 in this case) in such a way as to maximize the total value.
Here’s how to solve it:
So the optimal solution is to choose items 3, 2 and a fraction of item 1, with a total value of 22.
See lessAnalyse the algorithm (in terms of both time and space) …
The time complexity of the subset sum problem using dynamic programming technique is O(nW), where n is the number of items and W is the target sum. The space complexity is O(nW). The most time-consuming part of the algorithm is the bottom-up dynamic programming loop, where each cell in the n x W matRead more
The time complexity of the subset sum problem using dynamic programming technique is O(nW), where n is the number of items and W is the target sum. The space complexity is O(nW).
The most time-consuming part of the algorithm is the bottom-up dynamic programming loop, where each cell in the n x W matrix is filled in. This loop takes O(nW) time in total.
The most space-consuming part of the algorithm is the n x W matrix itself, which requires O(nW) space to store the results of the dynamic programming.
Overall, both the time and space complexity are directly proportional to the size of the n x W matrix, making the dynamic programming solution to the subset sum problem an exponential-time algorithm.
See lessA networking company uses a compression technique to encode the …
Total number of characters in the message = 100. Each character takes 1 byte. So total number of bits needed = 800. After Huffman Coding, the characters can be represented with: f: 0 c: 100 d: 101 a: 1100 b: 1101 e: 111 Total number of bits needed = 224 Hence, number of bits saved = 800 - 224 = 576Read more
What is a set of instructions used to perform some tasks?
The set of instructions that are used to perform a specific task is referred to as program, or software program. A program can be created using various programming languages, such as C, Java, Python, etc. A program contains statements that specify the logic and data of the task. Before a program canRead more
The set of instructions that are used to perform a specific task is referred to as program, or software program.
A program can be created using various programming languages, such as C, Java, Python, etc.
A program contains statements that specify the logic and data of the task.
Before a program can run on a computer, it has to be either compiled or interpreted.
A program can also communicate with other programs and hardware devices using input and output operations.
See lessDBMS QUESTION LATEST 2023
1.What is a database? a) Organized collection of information that cannot be accessed, updated, and managed b) Collection of data or information without organizing c) Organized collection of data or information that can be accessed, updated, and managed d) Organized collection of data that cannot beRead more
1.What is a database?
a) Organized collection of information that cannot be accessed, updated, and managed
b) Collection of data or information without organizing
c) Organized collection of data or information that can be accessed, updated, and managed
d) Organized collection of data that cannot be updated
2.What is DBMS?
a) DBMS is a collection of queries
b) DBMS is a high-level language
c) DBMS is a programming language
d) DBMS stores, modifies and retrieves data
3.Who created the first DBMS?
a) Edgar Frank Codd
b) Charles Bachman
c) Charles Babbage
d) Sharon B. Codd
4.Which type of data can be stored in the database?
a) Image oriented data
b) Text, files containing data
c) Data in the form of audio or video
d) All of the above
5.Which of the following is not a type of database?
a) Hierarchical
b) Network
c) Distributed
d) Decentralized
6.Which of the following is not an example of DBMS?
a) MySQL
b) Microsoft Acess
c) IBM DB2
d) Google
7.Which of the following is a feature of DBMS?
a) Minimum Duplication and Redundancy of Data
b) High Level of Security
c) Single-user Access only
d) Support ACID Property
8.Which of the following is known as a set of entities of the same type that share same properties, or attributes?
a) Relation set
b) Tuples
c) Entity set
d) Entity Relation model
9.What is information about data called?
a) Hyper data
b) Tera data
c) Meta data
d) Relations
10.What does an RDBMS consist of?
a) Collection of Records
b) Collection of Keys
c) Collection of Tables
d) Collection of Fields
11.The values appearing in given attributes of any tuple in the referencing relation must likewise occur in specified attributes of at least one tuple in the referenced relation, according to _____________________ integrity constraint.
a) Referential
b) Primary
c) Referencing
d) Specific
12._____________ is a hardware component that is most important for the operation of a database management system.
a) Microphone
b) High speed, large capacity disk to store data
c) High-resolution video display
d) Printer
13.The DBMS acts as an interface between ________________ and ________________ of an enterprise-class system.
a) Data and the DBMS
b) Application and SQL
c) Database application and the database
d) The user and the software
14.______________ is a set of one or more attributes taken collectively to uniquely identify a record.
a) Primary Key
b) Foreign key
c) Super key
d) Candidate key
15.Which of the following set should be associated with weak entity set for weak entity to be meaningful?
a) Neighbour set
b) Strong entity set
c) Owner set
d) Identifying set
16.Which forms have a relation that contains information about a single entity?
a) 4NF
b) 2NF
c) 5NF
d) 3NF
17.The top level of the hierarchy consists of ______ each of which can contain _____.
a) Schemas, Catalogs
b) Schemas, Environment
c) Environment, Schemas
d) Catalogs, Schemas
18._______ indicates the maximum number of entities that can be involved in a relationship.
a) Greater Entity Count
b) Minimum cardinality
c) Maximum cardinality
d) ERD
19.The user IDs can be added or removed using which of the following fixed roles?
a) db_sysadmin
b) db_accessadmin
c) db_securityadmin
d) db_setupadmin
20.Why the following statement is erroneous?
SELECTdept_name, ID,avg(salary)
FROM instructor
GROUPBYdept_name;
b) Group by clause is not valid in this query
c) Avg(salary) should not be selected
d) None
21.Which of the following is not the utility of DBMS?
i) Backup ii) Loading iii) Process Organization iv) File organization
a) i, ii, and iv only
b) i, ii and iii only
c) i, iii and iv only
d) All i, ii, iii, and iv
22.What is the function of the following command?
Delete from r where P;
b) Deletes relation
c) Deletes particular tuple from relation
d) All of the mentioned
23.Which of the following is popular for applications such as storage of log files in a database management system since it offers the best write performance?
a) RAID level 0
b) RAID level 1
c) RAID level 2
d) RAID level 3
24.Which of the following represents a query in the tuple relational calculus?
a) { }{P(t) | t }
b) {t | P(t)}
c) t | P() | t
d) All of the mentioned
25.Evaluate the statements issued by the DBA in the given sequence if OE and SCOTT are the users and the ORDERS table is owned by OE.
CREATEROLE r1;GRANTSELECT,INSERTONoe. orders TO r1;GRANT r1 TOscott;GRANTSELECTONoe. orders TOscott;REVOKESELECTONoe.ordersFROMscott;
What would be the outcome after executing the statements?
See lessa) The REVOKE statement would give an error because the SELECT privilege has been granted to the role R1
b) The REVOKE statement would remove the SELECT privilege from SCOTT as well as from the role R1
c) SCOTT would be able to query the OE.ORDERS table
d) SCOTT would not be able to query the OE.ORDERS table
Web and Mobile Security worksheet All worksheet 1 to 10
Click on the below drive link to download the file: https://drive.google.com/uc?export=download&id=1OlrSLOJhdFXHicWRrHQELoaa-Sf0Cu97
Click on the below drive link to download the file:
https://drive.google.com/uc?export=download&id=1OlrSLOJhdFXHicWRrHQELoaa-Sf0Cu97
See lessCreate a student class object array of size four having …
Follow the below link for answer: https://sikshapath.in/question/create-a-student-class-object-array-of-size-four-having-attributes-name-java-programming-language/
Follow the below link for answer:
See lessWhich algorithm is more efficient in constructing the minimum spanning …
In Prim's, you always keep a connected component, starting with a single vertex. You look at all edges from the current component to other vertices and find the smallest among them. You then add the neighbouring vertex to the component, increasing its size by 1. In N-1 steps, every vertex would be mRead more
In Prim’s, you always keep a connected component, starting with a single vertex. You look at all edges from the current component to other vertices and find the smallest among them. You then add the neighbouring vertex to the component, increasing its size by 1. In N-1 steps, every vertex would be merged to the current one if we have a connected graph.
In Kruskal’s, you do not keep one connected component but a forest. At each stage, you look at the globally smallest edge that does not create a cycle in the current forest. Such an edge has to necessarily merge two trees in the current forest into one. Since you start with N single-vertex trees, in N-1 steps, they would all have merged into one if the graph was connected.
Use Prim’s algorithm when you have a graph with lots of edges.
For a graph with V vertices E edges, Kruskal’s algorithm runs in O(E log V) time and Prim’s algorithm can run in O(E + V log V) amortized time, if you use a Fibonacci Heap.
Prim’s algorithm is significantly faster in the limit when you’ve got a really dense graph with many more edges than vertices. Kruskal performs better in typical situations (sparse graphs) because it uses simpler data structures.
See lessSolve using fractional knapsack: M=20, n=4 P= (3, 10, 15, …
M=20 (total capacity of bag) N=4 (no of items) Let’s find Pi/Wi (profit/weight) for each items: P1/W1=3/5 = 0.60 (O1) P2/W2=10/13= 0.76(O2) P3/W3= 15/12 = 1.25 (O3) P4/W4 = 5/8 = 0.62 (O4) Where O is object no Let’s arrange them in order: 1.25 >> 0.76 >> 0.62 >> 0.60 Object takRead more
M=20 (total capacity of bag)
N=4 (no of items)
Let’s find Pi/Wi (profit/weight) for each items:
P1/W1=3/5 = 0.60 (O1)
P2/W2=10/13= 0.76(O2)
P3/W3= 15/12 = 1.25 (O3)
P4/W4 = 5/8 = 0.62 (O4)
Where O is object no
Let’s arrange them in order: 1.25 >> 0.76 >> 0.62 >> 0.60
Object taken
profit
weight
Remaining weight
O3
15
12
8
O2
10
13
0
O4
5
8
0
O1
3
5
0
Now,
< O3,(8/13)O2 >
See less