a) The number of edges connected to that vertex

b) The number of vertices connected to that vertex

c) The total number of vertices in the graph

d) The total number of edges in the graph

a) A graph where all vertices are connected to all other vertices

b) A graph where the vertices can be divided into two disjoint sets such that no two vertices within the same set are adjacent

c) A graph with no edges

d) A graph with only one vertex

a) All vertices are connected to each other

b) No two vertices are connected

c) There is exactly one edge in the graph

d) It has a tree structure

a) There is a path between any two vertices

b) Every vertex has an odd degree

c) Every vertex has an even degree

d) It contains no edges

a) The minimum number of colors required to color the vertices of the graph such that no two adjacent vertices have the same color

b) The maximum number of colors required

c) The number of edges in the graph

d) The degree of the graph

a) It is a connected graph with no cycles

b) It has exactly one cycle

c) It is disconnected

d) It is a complete graph

a) n(n−1)/2

b) n(n+1)/2

c)n(n-1)

d) 2n

a) A cycle that visits each vertex exactly once

b) A cycle that visits each vertex multiple times

c) A cycle that does not visit all vertices

d) A path that visits all edges

a) A circuit that visits every edge exactly once

b) A circuit that visits every vertex exactly once

c) A cycle that does not have repeated edges

d) A path that does not contain cycles

A. Faster processing speed

B. Data Redundancy

C. Efficient data management and querying

D. Lack of security features

A single record in a database

A collection of related attributes

A collection of similar types of entities

A specific relationship between entities

Student

Order Item (linked to Orders)

Product

Employee

Key Constraint

Participation Constraint

Aggregation

Weak Entity Set

Data Binary Management System

Database Management System

Data Build Module System

Digital Base Memory System

A property or characteristic of an entity

A collection of relationships

A group of tables

A set of constraints

Oval

Rectangle

Diamond

Triangle

Manager supervises Employees

Student enrolls in a Course

Employee works in Department

All of the above

Representation of relationships

Definition of entity sets

File-based data storage

Use of key constraints

• Compile Java source code to bytecode

• Interpret and execute Java bytecode on a specific platform

• Manage memory and file I/O in Java

• Convert Java bytecode to machine code for execution

• Every Java program must have a main method.

• Java programs do not require classes.

• Java programs can only contain one class.

• Packages are optional in a Java program.

• They help manage memory in Java applications.

• They provide reusable code for common tasks such as I/O, networking, and data manipulation.

• They convert Java bytecode to machine code.

• They compile Java programs.

• Ends the loop completely

• Skips the remaining code in the current iteration and moves to the next iteration

• Exits the loop and proceeds with the next statement after the loop

• Stops the loop and returns to the main method

• Method Overloading

• Method Overriding

• Both A and B

• Only A

• Arrays in Java can store values of different data types.

• Arrays have a fixed size once they are initialized.

• Arrays in Java are automatically resized when elements are added.

• Arrays are objects, and they can hold only primitive data types.

==

=

!=

===

int

float

longint

boolean

• It can be used to declare a variable that cannot be changed.

• It can be used to prevent a class from being inherited.

• It can be used to prevent a method from being overridden.

• All of the above.

1

0

true

false

• An interface can contain both abstract methods and method implementations.

• A class can implement multiple interfaces.

• An interface can only extend one class.

• Interfaces cannot contain constants.

• It has a complex syntax.

• It is only used for web development.

• It has simple syntax and large community support.

• It is used only in artificial intelligence.

• List

• Dictionary

• Set

• Tuple

exit

return

break

stop

int x = 10;

x = 10

var x = 10

variable x = 10

// This is a comment

*This is a comment*

# This is a comment

-- This is a comment

Stops the loop

Skips the current iteration and moves to the next

Exits the loop and continues execution

Restarts the loop

{} (Curly brackets)

() (Parentheses)

Indentation

begin...end

.java

.py

.exe

.cpp

Python Essential Programming

Python Execution Process

Python Enhancement Proposal

Python Error Processing

Store data permanently

Perform arithmetic and logical operations

Control input and output operations

Manage power supply

Transfers data between devices

Transfers memory addresses

Sends control signals for operations

Stores data permanently

8

12

16

32