Q7
Suit of Civil Nature
A suit of civil nature refers to a legal dispute that involves a claim or question of a civil nature, such as:
1. Property rights: Disputes related to ownership, possession, or title of property.
2. Contractual disputes: Disputes arising from contracts, agreements, or obligations.
3. Tortious claims: Claims for damages for wrongful acts, such as negligence or defamation.
4. Personal rights: Disputes related to personal rights, such as marriage, divorce, or inheritance.
## Exclusion
1) Define Data Structure. Explain different categories of Data Structure.
A **data structure** is a specialized way of organizing, storing, and managing data in a computer to enable efficient access, manipulation, and operations. It defines how data is stored and the relationships between data elements.
Data structures are categorized into two main types:
- **Primitive Data Structures**: Basic building blocks like integers, floats, characters, and booleans, which handle simple data types directly
...# **Program 1: NumPy Array Operations**
import numpy as np
arr=np.array([[1,2,3],[4,5,6],[7,8,9]])
print("Sum of all columns:",np.sum(arr,axis=0))
print("Product of all rows:",np.prod(arr,axis=1))
print("Last two rows and columns:\n",arr[1:,1:])
arr2=np.array([[9,8,7],[6,5,4],[3,2,1]])
print("Element-wise addition:\n",arr+arr2)
.
.
# **Program 2: Vowel Frequency in Each Word**
sentence=input("Enter a sentence in lowercase: ")
vowels='aeiou'
for w in sentence.split():
print(f"{w}: {sum(w.count(v) for v...
## **1. a) Define Java Bytecode. Justify that Java is platform independent
**Java Bytecode** is the intermediate code generated by the Java compiler after compiling a Java program. When you write a Java source file (`.java`) and compile it using `javac`, the compiler converts it into a bytecode file (`.class`). This bytecode is not specific to any machine and can be executed by the **Java Virtual Machine (JVM)** on any platform.
**Platform independence** means that a Java program can run on any
...Q1
Principles of Non-Discrimination in International Trade Law
In international trade law, non-discrimination is a fundamental principle that ensures equal treatment of goods, services, and service suppliers from different countries. The two main principles of non-discrimination in international trade law are:
### 1. Most-Favored-Nation (MFN) Principle
- Definition: The MFN principle requires that a country treats goods, services, and service suppliers from one country no less favorably than it treats
WIAT-III: Early Reading Skills, Reading Comprehension, Word Reading (called Letter and Word Recognition on KTEA), Pseudoword Decoding (nonsense words), Oral Reading Fluency.
Comparison with KTEA-3:
WJ IV Achievement: Letter and Word Recognition (Identify and read letters and...
Zero Coupon Bonds (ZCBs) are debt instruments that do not pay any periodic interest. They are issued at a discount and redeemed at face value upon maturity. The investor’s return is the difference between the purchase price and the redemption value. For example, a ₹1,000 bond issued at ₹700 gives ₹300 profit at maturity. The price is calculated as P = \frac{F}{(1+r)^n}, where P = price, F = face value, r = rate of return, and n = years to maturity
Advantages: predictable return, no reinvestment
...1. Space Complexity:
It is the amount of memory an algorithm needs to run, including input data, auxiliary variables, and recursion stack.Recurrence Relation for Merge Sort:
T(n) = 2T(n/2) + O(n)
3Worst-Case Time Complexity of Quick Sort:O(n²)
4. Asymptotic Notations:
They are mathematical tools to describe the running time of algorithms, such as Big O, Big Ω, and Big Θ.5. Time Complexity of Strassen’s Matrix Multiplication:
O(n^2.81)6. Data Structure for Disjoint Sets:
Disjoint Set Union (
Q.1) Define data structure, explain its type with example
A data structure is a specialized format for organizing, processing, retrieving, and storing data. It enables efficient access and modification of data, making it a fundamental concept in computer science and programming. Data structures are essential for managing large amounts of data, supporting various operations such as searching, sorting, insertion, deletion, and traversal.
Data structures can be broadly classified into two categories:...