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 (
Elementi kvaliteta softvera:Funkcionalnost,Pouzdanost,Efikasnost,Odgovarajuci korisnicki interfejs,Adekvatna dokumentacija,Transparentnost,Mogucnost lakog odrzavanja,Adaptivnost. Zivotni ciklus softvera: Period od trenutka identifikacije potreba za softverskim proizvodom do trenutka prestanka koriscenja softverskog proizvoda.Faze u zivotnom ciklusu softvera: Iniciranje i definisanje projekta(definicija problema)–3%,Analiza i specifikacija zahteva(specifikacija problema)–3%,Idejno projektovanje–7%
Lényege:
A szociológia a társadalmi élet törvényszerűségeit kutató tudomány.
Tudományos módszert használ → probléma → elmélet → adatokkal ellenőrzés.
Más tudományok is vizsgálják a társadalmat:
pszichológia (egyén),
közgazdaságtan (gazdaság),
politológia (politika),
szociológia → ezek kölcsönhatásait vizsgálja.
Példa:
A közgazdász megmondja, miért baj, ha túl...
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:...
Q.3) What is an algorithm? Explain its characteristics using a real life data structure example.
An algorithm is a finite sequence of well-defined instructions designed to solve a specific problem or perform a computation. Algorithms are the foundation of computer programming and data processing. In the context of data structures, algorithms are used to manipulate and manage data efficiently, such as searching, sorting, inserting, or deleting elements.
Characteristics of an Algorithm:
1. Finiteness:
✓ What is UDP??
User Datagram Protocol (UDP) is a connectionless transport layer protocol used in computer networks for sending datagrams over the Internet Protocol (IP) network.
Unlike TCP, UDP does not establish a connection before transmitting data, making it faster and more efficient with minimal overhead.
This connectionless nature means there is no handshake or acknowledgment process; data transmission begins immediately, which is ideal for real-time applications where speed is crucial
1. Digital Library – Definition
A Digital Library is a collection of digital objects such as text, images, audio, and video, stored electronically and accessible via the internet or computer networks.
It provides organized, searchable, and shareable access to information resources anytime and anywhere.
2. Needs and Characteristics of Digital Library
Needs:
1. KADA SU SE POJAVILI PRVI MIKROKONTROLERI I KO SU BILI PROIZVODJACI Prvi mikrokontroleri su se pojavili 70-ih godina dvadesetog veka a proizvodile su ih kompanije Intel i Motorola. Nastali su kako rezultat razvoja računarskih arhitektura i tehnologije izrade integrisanih kola 2. KOJA JE RAZLIKA IZMEDJU MIKROPROCESORA I MIKROKONTROLERA Mikroprocesori su pre svega optimizovani za brzinu i performanse kod računarskih programa, dok su mikrokontroleri otimizovani u pravcu integracije većeg broja