All categories

2 years ago

What is property in educational technology

1 answer:

3 0

1. It is based on scientific and technological advancements.
2. It is more a practical discipline and less a theoretical one.
3. It is a fast growing modern discipline.
4. It makes use of the research findings of psychology, sociology, engineering, sciences and social psychology etc., and applies the same to the field of education.
5. It brings pupils, teachers and technical means together in an effective way.
6. It is the science of techniques and methods. It locates the problems in the field of education, remedies them and ultimately aims at improving the education system.
7. It is bound to improve the teacher, the learner and the teaching learning process.

You might be interested in

Is a program that hides in a computer or mobile device and allows someone from a remote location to take full control of the com

antoniya [11.8K]

Yes there are such programs/viruses.

5 0

3 years ago

Describe the Pros and Cons Associated with Cloud Computing Cloud Computing was introduced in 1999 by a company named "Salesforce

Rudik [331]

Answer & Explanation:

Pros of cloud computing:

Cloud computing provides high speed due to faster deployment of services in fewer clicks.
It eliminates the need of IT infrastructure and manageability.
It is cost efficient as it provides huge space availability.
It makes it easy to get backup and recovery.
It is easy to access information anytime and anywhere in the world.
Due to cloud computing, it is very easy to add or remove services as required.

Cons of cloud computing:

It makes the data vulnerable and information theft challenges can be encountered.
Internet connection is required all the time.
There is less control available as it runs on remote servers.
Migrating information can become difficult.
It can face technical issues so the information will not be available for a limited time.

7 0

3 years ago

Generally, websites ending in .edu, .gov, and .org are less likely to be biased, or to show preference toward a certain financia

svetlana [45]

Answer:

True

Explanation:

Domain extensions always appear at the end of a website's address.

It's a means to categorise websites.

.edu domains are used for educational purposes

.gov are restricted to by government entities

.org is largely used by nonprofit websites.

While

.net is derived from the word network, indicating it was originally intended for organizations involved in networking technologies, such as Internet service providers and other infrastructure companies

.biz is intended for registration of domains to be used by businesses

The right domain extension adds credibility and memorability to your website by aligning it with a specific brand purpose.

8 0

3 years ago

What is an undirected graph?

ella [17]

Answer: An undirected graph is the graph that has the connection of the objects in the form of bidirectional edges.This graph is formed for by the attachment of the collection of the objects which get displayed in the form of network and thus, also known as the undirected graph.

The graph is formed by the nodes or objects getting connected and form edges or link(which is typically in the form of line).

5 0

3 years ago

Let's implement a classic algorithm: binary search on an array. Implement a class named BinarySearcher that provides one static

yKpoI14uk [10]

Answer:

Hope this helped you, and if it did , do consider giving brainliest.

Explanation:

import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

// main method

public static void main(String[] args) {

// create a list of Comparable type

List<Comparable> list = new ArrayList<>();

// add elements

list.add(1);

list.add(2);

list.add(3);

list.add(4);

list.add(5);

list.add(6);

list.add(7);

// print list

System.out.println("\nList : "+list);

// test search method

Comparable a = 7;

System.out.println("\nSearch for 7 : "+search(list,a));

Comparable b = 3;

System.out.println("\nSearch for 3 : "+search(list,b));

Comparable c = 9;

System.out.println("\nSearch for 9 : "+search(list,c));

Comparable d = 1;

System.out.println("\nSearch for 1 : "+search(list,d));

Comparable e = 12;

System.out.println("\nSearch for 12 : "+search(list,e));

Comparable f = 0;

System.out.println("\nSearch for 0 : "+search(list,f));

}

// static method named search takes arguments Comparable list and Comparable parameter

public static boolean search(List<Comparable> list, Comparable par) {

// if list is empty or parameter is null the throw IllegalArgumentException

if(list.isEmpty() || par == null ) {

throw new IllegalArgumentException();

}

// binary search

// declare variables

int start=0;

int end =list.size()-1;

// using while loop

while(start<=end) {

// mid element

int mid =(start+end)/2;

// if par equal to mid element then return

if(list.get(mid).equals(par) )

{

return true ;

}

// if mid is less than parameter

else if (list.get(mid).compareTo(par) < 0 ) {

start=mid+1;

}

// if mid is greater than parameter

else {

end=mid-1;

}

// if not found then retuen false

return false;

}

}import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

// main method

public static void main(String[] args) {

// create a list of Comparable type

List<Comparable> list = new ArrayList<>();

// add elements

list.add(1);

list.add(2);

list.add(3);

list.add(4);

list.add(5);

list.add(6);

list.add(7);

// print list

System.out.println("\nList : "+list);

// test search method

Comparable a = 7;

System.out.println("\nSearch for 7 : "+search(list,a));

Comparable b = 3;

System.out.println("\nSearch for 3 : "+search(list,b));

Comparable c = 9;

System.out.println("\nSearch for 9 : "+search(list,c));

Comparable d = 1;

System.out.println("\nSearch for 1 : "+search(list,d));

Comparable e = 12;

System.out.println("\nSearch for 12 : "+search(list,e));

Comparable f = 0;

System.out.println("\nSearch for 0 : "+search(list,f));

}

// static method named search takes arguments Comparable list and Comparable parameter

public static boolean search(List<Comparable> list, Comparable par) {

// if list is empty or parameter is null the throw IllegalArgumentException

if(list.isEmpty() || par == null ) {

throw new IllegalArgumentException();

}

// binary search

// declare variables

int start=0;

int end =list.size()-1;

// using while loop

while(start<=end) {

// mid element

int mid =(start+end)/2;

// if par equal to mid element then return

if(list.get(mid).equals(par) )

{

return true ;

}

// if mid is less than parameter

else if (list.get(mid).compareTo(par) < 0 ) {

start=mid+1;

}

// if mid is greater than parameter

else {

end=mid-1;

}

// if not found then retuen false

return false;

}

7 0

2 years ago