1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
ioda
3 years ago
11

Puede existir la tecnologia sin la ciencia y sin las tecnicas,explique si o no y fundamente el porque de su respuesta

Computers and Technology
1 answer:
Marrrta [24]3 years ago
7 0

Answer:

No

Explanation:

No, La ciencia organiza toda la informacion que obtenemos despues de hacer experimentos. Esta informacion se puede replicar y probar, ademas nos ayuda ampliar nuestro conocimiento de varios temas. Las tecnicas, son procedimientos y reglas que fueron formados para solucionar problemas y obtener un resultado determinado y efectivo. Sea como sea la ciencia y las tecnicas se necesitas para que exista la tecnologia. Sin la ciencia y las tecnicas se tendria que obtener la informacion para poder entender y crear tecnologia, y para hacer eso tenes que hacer experimentos, procedimientos, y reglas (ciencia y tecnicas.)

You might be interested in
Create an instance of your queue that accepts java.lang.String Objects. Starting with an empty queue, use the enqueue(E e) metho
Aleksandr-060686 [28]

Answer:

Code is given below:

Explanation:

ode.java:

public class Node

{

String data;

Node next;

Node prev;

public Node(String data,Node next, Node prev){

this.next=next;

this.data=data;

this.prev=prev;

}

public Node(){

}

public String getData(){

return data;

}

public void setData(String data){

this.data=data;

}

public Node getNext(){

return next;

}

public void setNext(Node next){

this.next=next;

}

public Node getPrev(){

return prev;

}

public void setPrev(Node prev){

this.prev=prev;

}

}

Linked Queue.java:

public class LinkedQueues {

    Node head ;

   Node tail;

int size=0;

public Oueues(){

   this.head=null;

   this.tail=null;

}

public boolean isEmpty()

{

   return head == tail;

}    

 public int getSize()

    {

          return size;

  }    

 public void insert(String data){

   Node tmp = new Node(data,null,null);

    tmp.data=data;

    tmp.next=null;

    if(head==null){

        head=tail=tmp;

        head.prev=null;

    }

    else{

        tail.next=tmp;

        tmp.prev=tail;

        tail=tmp;

 }    

 }

 public String remove(){

  if(head.next==tail)

      return null;// list empty

  Node tmp=head.next;

  head.next=tmp.next;

  tmp.next.prev=head;

  list();

  return tmp.data;

 }

 public void list(){

     System.out.println("Queues");

     if(size==0){

         System.out.println("İs Empty");

     }

    Node tmp=head;

    while(tmp !=tail.getNext()){

        System.out.println(tmp.getVeri()+" ");

      tmp= tmp.getNext();

    }

     System.out.println();

 }

Linkedstack.java:

public class LinkedStack {

Node head = null;

Node tail = null;

int size=0;

     public int getSize() {

    return size;

      }

  public boolean isEmpty()

      {

   return head == null;

   }    

 public void Push(String data) {

    tail = head;

   head = new Node(data,null,null);

   head.data=data;

   head.next= tail;

   head.prev = null;

   if(tail != null) {

       tail.prev=head;

   }

   size++;

 }

 public void Pop() {

   if (!isEmpty()) {

       head = head.next;   // delete first node

       size--;

   } else {

       System.out.println("İs Empty");

   }

}

  public void Top() {

   Node tmp = head;

   while (tmp != null) {

       System.out.println(tmp.getData());

       tmp = tmp.getNext();

   }

}

 }

ArrayBasedQueue.java

import java.util.LinkedList;

import java.util.Queue;

 

public class ArrayBasedQueue

{

 public static void main(String[] args)

 {

   Queue<Integer> q = new LinkedList<>();

 

   // Adds elements {0, 1, 2, 3, 4} to queue

   for (int i=0; i<5; i++)

    q.add(i);

 

   // Display contents of the queue.

   System.out.println("Elements of queue-"+q);

   int removedele = q.remove();

   System.out.println("removed element-" + removedele);

 

   System.out.println(q);

   int head = q.peek();

   System.out.println("head of queue-" + head);

 

   int size = q.size();

   System.out.println("Size of queue-" + size);

 }

}

ArrayBasedStack.java:

import java.io.*;

import java.util.*;

 

public class ArrayBasedStack

{

static void stack_push(Stack<Integer> stack)

{

for(int i = 0; i < 5; i++)

{

stack.push(i);

}

}

 

// Popping element from the top of the stack

static void stack_pop(Stack<Integer> stack)

{

System.out.println("Pop :");

 

for(int i = 0; i < 5; i++)

{

Integer y = (Integer) stack.pop();

System.out.println(y);

}

}

 }

TestTimes.java:

public class TestTimes implements TestTimesInterface

{

 public static enum TimeUnits {};

 public static enum MemoryUnits{};

}

Driver.java:

public class driver

{

public static void main(String args[])

{

   Scanner s = new Scanner(System.in);

   LinkedStack y = new LinkedStack();

   LinkedQueues k = new LinkedQueues();

   ArrayBasedStack as=new ArrayBasedStack();

     ArrayBasedQueue as=new ArrayBasedQueue();

   FileWriter fwy;

   FileWriter fwk;

   File stack = new File("stack.txt");

   if (!stack.exists()) {

       stack.createNewFile();

   } else {

       System.out.println("already exists ");

   }

   BufferedReader reader = null;

   reader = new BufferedReader(new FileReader(stack));

   String line = reader.readLine();

   while (line != null) {

       y.Push(line = reader.readLine());

       System.out.println(line);

   }

   File queue = new File("queue.txt");

   if (!queue.exists()) {

       queue.createNewFile();

   } else {

       System.out.println("already exists ");

   }

   BufferedReader read = null;

   read = new BufferedReader(new FileReader(queue));

   String lines = read.readLine();

   while (lines != null) {

       lines = read.readLine();

       k.insert(lines);

       System.out.println(lines);

   }

int choice;

     System.out.println("1. Stack out- queue add");

     System.out.println("2. Stack add- queue out");

     System.out.println("3. Stack and queue ");

     System.out.println("4. File writer");

     choice = s.nextInt();

   switch (choice) {

       case 1:

           k.insert(s.next());

           k.list();

           y.pop();

           break;

       case 2:

         y.Push(s.next());

           y.Top();

         k.remove();

           break;

       case 3:

           y.Top();

           k.list();

           break;

       case 4:

           fwy = new FileWriter(stack);

           Node no = y.head;

           while (no.next != null) {

               fwy.write("\n" + no.data);

               no = no.next;

           }

           fwy.flush();

           fwy.close();

           fwk = new FileWriter(queue);

           Node noo = k.head;

           while (noo.next != null) {

               fwk.write("\n" + noo.data);

               noo = noo.next;

           }

           fwk.flush();

           fwk.close();

           break;

        }

 

}

}

6 0
3 years ago
What is a unit to measure loudness
FinnZ [79.3K]

decibels i believe is the correct answer. hope it helps :)

3 0
3 years ago
In a _error,solution is working but not giving required results
drek231 [11]

Answer:

<h2>it is a random error </h2>

Explanation:

<h3>I HOPE THAT THIS ANSWER HELPS YOU </h3>
7 0
2 years ago
A check list should be based on that apply to your industry.
frozen [14]
Can you please elaborate? This is as your question isn't very clear.
6 0
3 years ago
Read 2 more answers
Assign numMatches with the number of elements in userValues that equal matchValue. userValues has NUM_VALS elements. Ex: If user
Sedbober [7]

Answer:

Replace /* Your solution goes here */ with:

cin>>matchValue;

numMatches = 0;

for (i = 0; i < userValues.size(); ++i) {

if(matchValue == userValues.at(i))

{

numMatches++;

}

}

Explanation:

This line gets input for matchValue

<em>cin>>matchValue; </em>

This line initializes numMatches to 0

<em>numMatches = 0; </em>

The following iteration checks for the number of matches (numMatches) of the matchValue

<em>for (i = 0; i < userValues.size(); ++i) { </em>

<em>if(matchValue == userValues.at(i)) </em>

<em>{ </em>

<em> numMatches++; </em>

<em>} </em>

<em>} </em>

<em>See Attachment for full source code</em>

Download cpp
3 0
3 years ago
Other questions:
  • Exit network systems, information support, and software development are all careers in which career cluster?
    10·1 answer
  • Which sentence uses a pair of synonyms? Because there was so much shouting, many of the protestors began screaming in order to b
    6·2 answers
  • In the cis configuration, the methyl groups are placed _____.
    8·2 answers
  • What set operator would you use if you wanted to see all of the Customers and the Employees including any records that may appea
    14·1 answer
  • Why are medical related professions and human resources important? ​
    8·1 answer
  • Wearables, video playback and tracking devices can help athletes because
    15·1 answer
  • 6.What does transgenic mean?​
    12·2 answers
  • What is good work ethic?​
    11·1 answer
  • Which characteristics support an agile mis infrastructure?
    6·1 answer
  • What stipulates that the source code of any software published under its license must be freely available.
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!