Computer Science
Computer Science Courses & Exams
Computer science study resources — algorithms, data structures, operating systems, networking, and programming.
Sorting Algorithms Exam
Language en - English Subject Type STEM Exam Name Sorting Algorithms Exam Brief Overall Summary This document provides an overview of several sorting algorithms, including Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, and Radix Sort. For each algorithm, the document covers the basic principle, pseudocode, time and space complexity, stability, and examples. The document also includes quizzes to test understanding of the algorithms. The main focus is on understanding how each algorithm works, its performance characteristics, and its stability properties. The document also touches on distribution-based sorting algorithms like Counting Sort. The content is suitable for a computer science course covering data structures and algorithms. Course Structure Chapter 1: Bubble Sort Chapter Overview: This chapter introduces the Bubble Sort algorithm, explaining its basic principle of repeatedly stepping through the list, comparing adjacent elements and swapping them
Dainius RimaviciusCognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft
Language en - English Subject Type - STEM Exam Name Cognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft Brief Overall Summary This document comprises two lectures aimed at preparing prospective students for the Cognitive Skills Test (CST) required for admission to the Computer Science and Engineering program at TU Delft. The first lecture focuses on mathematics, specifically addressing exponent manipulation, logarithms, trigonometric identities, sketching rational functions, integration, and optimization problems. The lecturer works through sample exercises, emphasizing strategic problem-solving approaches and relevant formulas. The second lecture introduces reasoning and logic, covering propositional and predicate logic. It highlights the importance of logic in computer science, particularly in CPU design and algorithm verification. The lecturer provides examples of logic puzzles and demonstrates how truth tables can be used for equivale
Evrika StudyULTRAData Structures and Algorithms Exam - Sorting Algorithms
Language en - English Subject Type STEM Exam Name Data Structures and Algorithms Exam - Sorting Algorithms Brief Overall Summary This document serves as a review of sorting algorithms, covering fundamental concepts, specific algorithms like Bubble Sort, Selection Sort, and Insertion Sort, as well as Merge Sort. It provides step-by-step logic, Python implementations, trace examples, and complexity analysis for each algorithm. The document also briefly touches upon other sorting algorithms like Quick Sort, Heap Sort, and Radix Sort, and discusses sorting in Python using list.sort() and sorted(). The aim is to equip students with a solid understanding of sorting algorithms, their implementations, and their performance characteristics, preparing them for exams on data structures and algorithms. Course Structure Chapter 1: Introduction to Sorting Chapter Overview: This chapter introduces the fundamental concept of sorting, defining what sorting is and the key
Mr FixitTechnology of Information and Communications - Grade 3 Exam
Language ar - Arabic Subject Type STEM Exam Name Technology of Information and Communications - Grade 3 Exam Brief Overall Summary This document is a textbook for third-grade students on the subject of Information and Communications Technology. It covers fundamental concepts of programming, including algorithms, flowcharts, and an introduction to programming languages using Scratch. The textbook is divided into four units. The first unit introduces the basics of programming, including definitions of key terms like program, programming language, and programmer. The second unit provides an overview of different programming languages and the concept of translation. The third unit focuses on algorithms and flowcharts, teaching students how to solve problems using a structured approach. The final unit introduces Scratch, a visual programming language designed for beginners. The document includes examples, exercises, and assessments to reinforce learning. Course Structure
Sally Moawiaa890Python Sets and Dictionaries Exam
Language en - English Subject Type - STEM Exam Name Python Sets and Dictionaries Exam Brief Overall Summary This document provides a concise overview of sets and dictionaries in Python, focusing on their properties, methods, and applications. It covers the fundamental concepts of sets, including creation, access, modification, and common operations like union, intersection, and difference. It also explains dictionaries, emphasizing their key-value structure, methods for accessing, modifying, and iterating through dictionary items. The document includes numerous code examples to illustrate the concepts and practical usage of sets and dictionaries. The material is geared towards security professionals who need to use these data structures in their Python scripts. The document focuses on the practical application of these data structures and their methods, making it suitable for generating exam questions that test both theoretical understanding and practical coding skills.
LAI Search Algorithms Exam
Language en - English Subject Type - STEM Exam Name AI Search Algorithms Exam Brief Overall Summary This document provides a comprehensive overview of problem-solving through search algorithms, a fundamental concept in Artificial Intelligence. It begins by defining problem-solving agents and the search process, emphasizing the importance of goal formulation, problem formulation, search, and execution. The document distinguishes between informed and uninformed search algorithms, focusing on the simplest environments. It covers various search algorithms, including breadth-first search, uniform-cost search, depth-first search, depth-limited search, iterative deepening search, bidirectional search, and A search. Each algorithm is analyzed in terms of completeness, cost optimality, time complexity, and space complexity. The document also discusses heuristic functions, their admissibility, consistency, and how they can be learned or generated from relaxed problems or subprobl
Adam DodsReasoning & Logic
Language en - English Subject Type STEM Exam Name Reasoning & Logic (Delft University of Technology, CSE1300) Brief Overall Summary This document is a textbook designed for a one-quarter introductory course in theoretical computer science, specifically tailored for the Reasoning & Logic course (CSE1300) at Delft University of Technology. It covers fundamental concepts from propositional and predicate logic, proof techniques (including mathematical induction and contradiction), discrete structures, and set theory. The textbook also explores practical applications of these concepts in computer science, such as logic circuits, and touches upon more advanced topics like relational databases and computability. The material emphasizes mathematical rigor and the ability to construct and interpret formal proofs. The textbook is derived from "Foundations of Computation" by Critchlow and Eck, with modifications and additions specific to the TU Delft curriculum. Course Structure
Algorithms and Data Structures Final Exam
Language en - English Subject Type STEM Exam Name Algorithms and Data Structures Final Exam Brief Overall Summary This document provides a structured overview of algorithms and data structures, focusing on time and space complexity analysis, fundamental data structures like arrays, linked lists, stacks, queues, and trees, and sorting algorithms. It covers empirical analysis, Big-Oh notation, and various proof methods. The document emphasizes the importance of understanding the trade-offs between different data structures and algorithms, particularly in terms of time and space complexity. It also delves into more advanced topics such as search trees, graphs, and hashing techniques, offering a comprehensive foundation for students studying algorithms and data structures. The document includes theoretical explanations, implementation details, and considerations for practical applications. Course Structure Chapter 1: Time and Space Complexity Analysis Chapter Overv
Evrika StudyULTRAMachine Learning Fundamentals Exam
Language ru - Russian Subject Type STEM Exam Name Machine Learning Fundamentals Exam Brief Overall Summary This document provides an overview of classification tasks in machine learning, focusing on various classification algorithms and metrics for evaluating model performance. It covers essential algorithms such as logistic regression, Support Vector Machines (SVM), k-Nearest Neighbors (KNN), and decision tree-based methods. The document emphasizes the importance of understanding different evaluation metrics like accuracy, precision, recall, and F-measure, and how to interpret them, especially in cases of imbalanced datasets. Practical examples in Python, using libraries like scikit-learn, are included to illustrate the application of these algorithms and metrics. Additionally, it discusses the concept of cross-validation for improving model generalization and highlights the use of confusion matrices for detailed performance analysis. The document aims to equip the read
ar1zeOperating Systems File Management Exam
Language en - English Subject Type - STEM Exam Name Operating Systems File Management Exam Brief Overall Summary This document provides a concise overview of file management concepts within operating systems. It covers the definition and purpose of file management, emphasizing its role as an interface between users and physical storage. Key roles of file management, such as organizing data, controlling file operations, managing access permissions, and providing efficient storage utilization, are outlined. The document details file system organization, including components like files, directories, metadata, file allocation tables, disk blocks, and file control blocks. It also explores different file structure types (sequential, indexed, hashed), common file operations (create, open, read, write, close, delete, rename, append, seek), and file access methods (sequential, direct, indexed). Furthermore, it discusses various directory structures (single-level, two-level, tree-
Pauline KamauComputer Organisation Resit
Language en - English Subject Type STEM Exam Name Computer Organisation Resit (CSE1400) Brief Overall Summary This document is a comprehensive resit examination paper and solution set for the "Computer Organisation" course (CSE1400) at Delft University of Technology (TU Delft). It covers the fundamental principles of how computers are structured, how they represent data, and how they execute instructions. The content spans several critical areas of computer science and engineering: 1. Data Representation: Includes radix conversions (binary, octal, hexadecimal, and custom bases like radix-40), two's complement arithmetic, Binary Coded Decimal (BCD), and custom floating-point notations using excess-bias exponents. 2. Digital Logic and Circuitry: Focuses on Boolean algebra, Karnaugh map (K-map) minimization (including "don't care" conditions), CMOS transistor-level gate implementation (specifically XOR), and the design of combinational components like full adder
Evrika StudyULTRACSE1305 Algorithms and Data Structures Exam
Language en - English Subject Type - STEM Exam Name CSE1305 Algorithms and Data Structures Exam Brief Overall Summary This document serves as comprehensive lecture notes for the CSE1305 course on Algorithms and Data Structures, focusing on foundational concepts essential for understanding algorithm efficiency, data organization, and problem-solving in computer science. It emphasizes time and space complexity analysis, including empirical and theoretical approaches, Big-Oh notation, and recursive function complexity, providing tools to evaluate algorithm performance without implementation. The scope covers linear data structures like arrays, linked lists (singly, doubly, circular), stacks, queues, and deques, detailing operations, implementations, and trade-offs in time complexity. Tree structures are explored, including binary trees, traversals (preorder, inorder, postorder, breadth-first, Euler), and balanced variants like AVL and red-black trees. Priority queues and he
Evrika StudyULTRAIntroduction to Programming and Computer Science - Full Course
YouTube video: Introduction to Programming and Computer Science - Full Course by freeCodeCamp.org
Evrika StudyULTRAData Structures and Algorithms First Exam
Language en - English Subject Type STEM Exam Name Data Structures and Algorithms First Exam Brief Overall Summary This document serves as a review for a first exam on data structures and algorithms. It covers fundamental data structures like arrays and linked lists, abstract data types (ADTs) such as stacks and queues, and concepts like iterators, index lists, positional lists, and trees. The review also includes asymptotic analysis, covering big O notation and common growth rates. The document provides concise explanations of each topic, including their implementations, costs, and applications. It emphasizes the importance of understanding the properties of different data structures and their impact on algorithm efficiency. The review concludes with a summary of key concepts and skills necessary for the exam, including analyzing algorithm complexity and writing pseudo-code. Course Structure Chapter 1: Fundamental Data Structures and Abstract Data Types Chapter
Caden JonesBacalaureat - Matematică M_mate-info
Language ro - Romanian Subject Type STEM Exam Name Bacalaureat - Matematică Mmate-info Brief Overall Summary This document presents a model exam for the Romanian Baccalaureate in Mathematics, specifically for the Mmate-info specialization (mathematics and computer science). It covers topics in algebra, calculus, and geometry, divided into three main sections (Subiectul I, Subiectul al II-lea, and Subiectul al III-lea), each worth 30 points. The exam assesses students' understanding of complex numbers, functions, equations, probability, geometry, matrices, composition laws, limits, derivatives, and integrals. The problems range in difficulty and require students to apply theoretical knowledge to solve specific mathematical tasks. The document provides a comprehensive overview of the expected level of mathematical proficiency for students in this specialization. Course Structure Chapter 1: Subiectul I - Algebra and Geometry Fundamentals Chapter Overview: This
Cristian NeicuReasoning & Logic Exam
Language en - English Subject Type - STEM Exam Name Reasoning & Logic Exam Brief Overall Summary This document serves as a textbook for an introductory course in theoretical computer science, focusing on the foundations of logic, proof techniques, discrete structures, set theory, and the theory of computation. It emphasizes the practical application of these concepts in computer science. The text covers propositional and predicate logic, including logical operators, truth tables, and logical equivalence. It delves into proof methods such as direct proof, proof by contradiction, and mathematical induction, providing examples and exercises. Set theory is explored, covering basic concepts, operations on sets, and the Boolean algebra of sets. The document also touches on functions and relations, including their properties and applications. Finally, it briefly introduces the concepts of computability and the limitations of formal systems, referencing Gödel's incompleteness th
Ion GigelProgramming Fundamentals and Data Structures Exam
Language en - English Subject Type - STEM Exam Name Programming Fundamentals and Data Structures Exam Brief Overall Summary This document is a collection of True/False, Short Answer, and Programming questions designed to test understanding of fundamental programming paradigms, core data structures, and C/C++ programming concepts. It covers procedural, object-oriented, and functional programming paradigms, focusing on their differences and advantages. The document also includes questions on essential data structures like stacks, lists, queues, and binary trees, emphasizing their properties, operations, and implementations in C/C++. Furthermore, it assesses knowledge of C and C++ programming, including pointers, dynamic memory allocation, classes, inheritance, and operator overloading. The questions range from basic definitions and concepts to practical programming exercises, making it a comprehensive resource for exam preparation in computer science fundamentals. The docu
Ryan GuanzonMATH-109
Language en - English Subject Type - STEM Exam Name MATH-109 Brief Overall Summary This document, "Mathematics for Computer Science - Lecture 1," provides an overview of fundamental mathematical concepts relevant to computer science. It covers the classification of numbers (natural, integers, rational, irrational, and real), interval notation, and basic functions (linear, quadratic, cubic, absolute value, Nth root, and rational). The lecture emphasizes understanding the properties and representations of these mathematical entities, including their domains, ranges, symmetries, and graphical representations. The document also includes examples and exercises related to these concepts. The main goal is to establish a solid foundation in basic mathematical principles that are essential for computer science applications. Course Structure Chapter 1: Classification of Numbers and Intervals Chapter Overview: This chapter introduces the fundamental building blocks of ma
Examenul Național de Bacalaureat - Informatică
Language ro - Romanian Subject Type STEM Exam Name Examenul Național de Bacalaureat - Informatică Brief Overall Summary This document outlines the curriculum for the Informatics discipline within the National Baccalaureate exam in Romania, specifically targeting students in mathematics-informatics specializations (both standard and intensive). It details the competencies to be evaluated, including algorithm construction, problem-solving analysis, data structure utilization, and modular programming. The content covers fundamental programming concepts such as data types, control structures, subprograms, and basic algorithms. It also includes more advanced topics like recursion, backtracking, and graph theory. The document emphasizes practical application and problem-solving skills, preparing students for the Informatics portion of the Baccalaureate exam. The document provides a structured overview of the topics, ranging from basic algorithms and data struct
Bacalaureat - Matematică M_mate-info
Language ro - Romanian Subject Type STEM Exam Name Bacalaureat - Matematică Mmate-info Brief Overall Summary This document presents a sample exam for the Romanian Baccalaureate in Mathematics, specifically for the Mmate-info specialization (mathematics and computer science). It consists of three subjects (Subiectul I, Subiectul II, and Subiectul III), each worth 30 points, with an additional 10 points awarded by default. The exam covers a range of topics including complex numbers, functions, probability, geometry, matrices, polynomials, and calculus. The problems vary in difficulty and require students to demonstrate their understanding of mathematical concepts and their ability to apply them in problem-solving scenarios. The exam aims to assess the students' mathematical skills and knowledge acquired during their high school studies, preparing them for higher education. Course Structure Chapter 1: Subiectul I - Algebra, Functions, Probability, and Geometry Ch
Evrika StudyULTRAExamenul de Bacalaureat 2024 - Matematică M_mate-info
Language ro - Romanian Subject Type STEM Exam Name Examenul de Bacalaureat 2024 - Matematică Mmate-info Brief Overall Summary This document presents a model exam for the 2024 Baccalaureate in Mathematics (Mmate-info profile) in Romania. It covers topics relevant to the theoretical track, specializing in mathematics and computer science, and the vocational track, specializing in military mathematics. The exam consists of three subjects (I, II, and III), each worth 30 points, with 10 points awarded ex officio. The subjects cover a range of mathematical concepts including algebra (complex numbers, functions, equations), geometry (coordinate geometry, trigonometry), calculus (functions, derivatives, integrals), and abstract algebra (matrices, composition laws). The document provides specific problems for each subject, outlining the expected level of knowledge and skills required for the exam. The model exam serves as a guide for students preparing for the B
Cognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft
Language en - English Subject Type STEM Exam Name Cognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft Brief Overall Summary This document consists of two lectures aimed at preparing students for the Cognitive Skills Test (CST) required for admission to the Computer Science and Engineering program at TU Delft. The first lecture, delivered by Nick, focuses on reviewing mathematical concepts and problem-solving techniques relevant to the test, including exponents, logarithms, trigonometric identities, rational functions, integration, optimization, and calculus. The lecture involves step-by-step solutions to sample exercises, emphasizing strategies for approaching different types of math problems. The second lecture, given by Stan, introduces the core concepts of reasoning and logic, particularly propositional and predicate logic. It covers topics such as propositions, logical operators (AND, OR, NOT, implication), truth tables, logical equiv
Evrika StudyULTRABacalaureat - Matematică M_mate-info
Language ro - Romanian Subject Type STEM Exam Name Bacalaureat - Matematică Mmate-info Brief Overall Summary This document presents a sample exam for the Romanian Baccalaureate in Mathematics, specifically for the Mmate-info specialization (mathematics and computer science). It covers topics from algebra, calculus, and geometry. The exam consists of three sections (Subiectul I, Subiectul al II-lea, Subiectul al III-lea), each worth 30 points, with an additional 10 points awarded by default. The problems range in difficulty and require students to demonstrate their understanding of key mathematical concepts and their ability to apply them to solve problems. The exam assesses a student's ability to perform calculations, solve equations, analyze functions, and apply geometric principles. The problems are designed to test both theoretical knowledge and practical problem-solving skills. Course Structure Chapter 1: Subiectul I - Algebra and Geome
Evrika StudyULTRALogic Fundamentals Examination
Language en - English Subject Type STEM Exam Name Logic Fundamentals Examination Brief Overall Summary This document is Chapter 2 from a textbook on logic, providing a comprehensive introduction to both propositional and predicate logic. The chapter begins by explaining logical deduction using the classical example of Socratic reasoning, then progresses through the mechanical and computational aspects of logic. It covers propositional logic including truth tables, logical operators, Boolean algebra, and their application to digital logic circuits. The chapter then advances to predicate logic, introducing quantifiers, logical equivalence, and formal structures. It concludes with a detailed section on deduction, valid arguments, and formal proofs in both propositional and predicate logic. The material serves as foundational knowledge for computer science students, with applications to circuit design, programming logic, and mathematical reasoning. Throughout, the chapter e
Web and Database Technologies Exam
Language en - English Subject Type STEM Exam Name Web and Database Technologies Exam Brief Overall Summary This document provides an overview of web and database technologies, focusing on the engineering lifecycle and the role of data modeling within it. It contrasts engineers, scientists, and programmers, highlighting the practical, problem-solving nature of engineering. The document introduces the CDIO (Conceive, Design, Implement, Operate) framework and extends it to CDIAO (Conceive, Design, Implement, Assess, Operate) to emphasize the importance of assessment in computer science engineering. It then transitions into data modeling, presenting it as a method to formalize data requirements, particularly within relational databases. The document uses the Studyguide web application as a case study to illustrate the concepts of data modeling and information architecture. It concludes with an introduction to different data model theories, including relational, key-value, do
Evrika StudyULTRAAlgorithms and Data Structures Final Exam
Language en - English Subject Type STEM Exam Name Algorithms and Data Structures Final Exam Brief Overall Summary This document provides a comprehensive overview of algorithms and data structures, focusing on time and space complexity analysis, fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs, and sorting algorithms. It covers empirical analysis, Big-Oh notation, and various proof methods for algorithm analysis. The document also delves into specific implementations and trade-offs of different data structures, such as singly and doubly linked lists, circular lists, and the use of hash tables for maps. It emphasizes the importance of understanding the underlying principles and complexities of these data structures and algorithms for efficient problem-solving. The document also covers search trees and their balancing, as well as graph traversal algorithms. Course Structure Chapter 1: Time and Space Complexity Analysis Chapt
Evrika StudyULTRAComputer Networking Comprehensive Exam
Language en - English Subject Type STEM Exam Name Computer Networking Comprehensive Exam Brief Overall Summary This document provides a comprehensive overview of computer networking concepts, protocols, and technologies. It covers fundamental principles such as network models (OSI and TCP/IP), network topologies, transmission media, and various protocols operating at different layers of the network stack. The document delves into specific topics such as data link layer protocols (including ALOHA, CSMA, and Ethernet), routing algorithms (distance vector and link state), congestion control, and application layer protocols (HTTP, SMTP, DNS). It also addresses key concepts like addressing schemes (IPv4 and IPv6), subnetting, and network security. The document emphasizes practical aspects and provides examples to illustrate complex concepts, making it a valuable resource for understanding the core principles of computer networks. Course Structure Chapter 1: Foundations
Sussy ImpostarSorting Algorithms Exam
Language en - English Subject Type STEM Exam Name Sorting Algorithms Exam Brief Overall Summary This document provides an overview of several sorting algorithms, including Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, and Radix Sort. For each algorithm, the document covers the basic principle, pseudocode, time and space complexity, stability, and examples. The document also includes quizzes to test understanding of the algorithms. The main focus is on understanding how each algorithm works, its performance characteristics, and its stability properties. The document also touches on distribution-based sorting algorithms like Counting Sort. The content is suitable for a computer science course covering data structures and algorithms. Course Structure Chapter 1: Bubble Sort Chapter Overview: This chapter introduces the Bubble Sort algorithm, explaining its basic principle of repeatedly stepping through the list, comparing adjacent elements and swapping them
Evrika StudyULTRAFundamentals for Quantitative Analysis Exam
Language es - Spanish Subject Type STEM Exam Name Fundamentals for Quantitative Analysis Exam Brief Overall Summary This document, titled "Fundamentals for Quantitative Analysis," provides a structured learning guide for understanding foundational algebraic concepts. It is designed for students in informatics and covers topics such as number systems, set theory, polynomials, systems of linear equations, matrices, vector spaces, and linear transformations. The material is organized into seven chapters, each focusing on a specific area of quantitative analysis. Each chapter includes detailed explanations, examples, and exercises aimed at developing analytical and problem-solving skills. The document emphasizes the importance of mathematical foundations in the field of informatics, highlighting how these concepts are applied in algorithm design, data structures, and other areas of computer science. It also incorporates practical applications and real-world examples to aid c
Miguel EduardoMedical Dosimetrist Certification Board (MDCB) Exam
Language en - English Subject Type - STEM Exam Name Medical Dosimetrist Certification Board (MDCB) Exam Brief Overall Summary This learning guide synthesizes information from two documents related to radiation therapy physics and radiobiology. The documents primarily consist of notes covering a wide range of topics relevant to the Medical Dosimetrist Certification Board (MDCB) exam. The content spans from fundamental concepts like photon interactions, dose calculation algorithms, and machine characteristics to more advanced topics such as treatment planning techniques, brachytherapy, radiation protection, and radiobiology. The notes also include numerous example problems and formulas, indicating a strong emphasis on quantitative problem-solving skills. The document serves as a comprehensive review of key concepts and practical applications necessary for success in the MDCB exam. The notes also cover specific treatment techniques like VMAT, IMRT, SRS, SBRT, and TBI, highl
Evrika StudyULTRADiscrete Mathematics Final Exam
Language en - English Subject Type STEM Exam Name Discrete Mathematics Final Exam Brief Overall Summary This document provides a comprehensive overview of fundamental concepts in discrete mathematics, focusing on logic, proofs, set theory, functions, sequences, summations, and algorithms. It covers propositional and predicate logic, including truth tables, logical equivalences, and quantifiers. Various proof techniques, such as direct proof, proof by contraposition, and proof by contradiction, are explained and illustrated. The document also introduces set theory, including set operations, set identities, and Cartesian products. Functions, including injections, surjections, bijections, and function composition, are defined and explored. Finally, it covers sequences, summations, and basic algorithm design, including searching and sorting algorithms. The material is presented in a structured manner, suitable for exam preparation, with definitions, examples, and potential e
Noah AregaMachine Learning (CE 40477) Exam
Language en - English Subject Type - STEM Exam Name Machine Learning (CE 40477) Exam Brief Overall Summary This document provides an overview of fundamental concepts in machine learning, focusing primarily on supervised learning techniques. It begins by defining machine learning and outlining different paradigms, including supervised, unsupervised, and reinforcement learning. The core of the document delves into supervised learning, specifically linear and polynomial regression. It covers the components of supervised learning, differentiating between regression and classification tasks. The document explains the hypothesis space, cost functions (like Squared Error), and optimization algorithms, including analytical solutions and gradient descent methods (batch, mini-batch, and stochastic). It also addresses the limitations of linear regression and introduces polynomial regression as a method to model non-linear relationships. The document concludes with an example compar
Mahsa JalaliOperating Systems Concepts Exam
Language en - English Subject Type - STEM Exam Name Operating Systems Concepts Exam Brief Overall Summary This document provides a concise overview of deadlocks in operating systems, focusing on their definition, necessary conditions, handling strategies, and comparison. It begins by defining deadlocks as a situation where two or more processes are unable to proceed because each is waiting for a resource held by another. The document then outlines the four necessary conditions for a deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait. The core of the document discusses four major strategies for handling deadlocks: prevention, avoidance, detection and recovery, and (in some systems) ignorance. Deadlock prevention involves ensuring that at least one of the four necessary conditions cannot hold. Deadlock avoidance, particularly through the Banker's Algorithm, proactively examines resource allocation requests to prevent potential deadlocks. D
Pauline KamauTU Delft CSE Selection Test
Language en - English Subject Type - STEM Exam Name TU Delft CSE Selection Test Brief Overall Summary This document contains two lectures designed to prepare students for the TU Delft Computer Science and Engineering (CSE) selection test. The test comprises three parts: Mathematics, Systematic Reasoning, and Algorithmic & Computational Thinking. The first lecture focuses on mathematics, specifically algebra and calculus, and involves working through example exercises related to exponents, logarithms, trigonometric identities, sketching rational functions, integration, and optimization. The second lecture introduces reasoning and logic, covering propositional and predicate logic, truth tables, logical equivalence, and proof techniques. The document emphasizes that the selection test assesses cognitive skills rather than rote knowledge, highlighting the importance of problem-solving and abstract thinking. The lectures aim to provide insights into the types of questions ask
Evrika StudyULTRAAlgorithms and Data Structures Exam
Language en - English Subject Type STEM Exam Name Algorithms and Data Structures Exam Brief Overall Summary This document provides a concise overview of algorithms and data structures, focusing on time/space complexity analysis, fundamental data structures like arrays, linked lists, stacks, and queues, and advanced topics such as trees, graphs, and sorting algorithms. It emphasizes the theoretical aspects of algorithm design and analysis, including Big-Oh notation, and practical implementation considerations for various data structures. The document also covers essential concepts related to trees, including binary trees, balanced search trees (AVL and Red-Black trees), and tree traversal methods. Furthermore, it delves into graph algorithms, such as depth-first search, breadth-first search, Dijkstra's algorithm, and Kruskal's algorithm, along with discussions on graph representations and traversals. The document is geared towards students preparing for an exam on algorit
Evrika StudyULTRABacalaureat - Matematică M_mate-info
Language ro - Romanian Subject Type - STEM Exam Name Bacalaureat - Matematică Mmate-info Brief Overall Summary This document presents the Variant 3 of the Mathematics exam (Mmate-info profile) for the 2022 Romanian Baccalaureate. The exam is divided into three subjects (I, II, and III), each worth 30 points. Subject I covers basic mathematical skills, including complex numbers, functions, equations, probability, and geometry. Subject II focuses on matrices and algebraic structures, specifically composition laws. Subject III tests calculus skills, including derivatives, monotonicity, limits, and integrals. The document is designed to assess the mathematical knowledge and problem-solving abilities of high school graduates specializing in mathematics and computer science. Course Structure Chapter 1: Subiectul I - Baze Matematice Fundamentale Chapter Overview: This chapter covers fundamental mathematical concepts necessary for higher-level problem-solving. It in
Evrika StudyULTRABacalaureat - Matematică M_mate-info
Language ro - Romanian Subject Type STEM Exam Name Bacalaureat - Matematică Mmate-info Brief Overall Summary This document presents a model exam for the Romanian Baccalaureate in Mathematics, specifically for the Mmate-info specialization (mathematics and computer science). It comprises three subjects (I, II, and III), each worth 30 points, covering a range of topics including algebra, geometry, calculus, and mathematical analysis. The exam aims to assess students' understanding of fundamental mathematical concepts and their ability to apply these concepts to solve problems. The problems range in difficulty and require a combination of theoretical knowledge and problem-solving skills. The model exam provides a comprehensive overview of the expected content and format for the actual Baccalaureate examination. Course Structure Chapter 1: Subiectul I - Algebra and Geometry Fundamentals Chapter Overview: This chapter covers fundamental concepts in algebra and ge
Resit Computer Organisation CSE1400
Language en - English Subject Type STEM Exam Name Resit Computer Organisation CSE1400 Brief Overall Summary This document is a comprehensive resit examination for the Computer Organisation course (CSE1400) at Delft University of Technology (TU Delft). It spans 22 high-level questions covering a broad spectrum of computer science fundamentals, from the historical evolution of computing and basic digital logic to advanced architectural concepts. Key areas of focus include: - Digital Logic and Circuit Design: Boolean algebra, Karnaugh maps for logic optimization, CMOS transistor-level implementation of gates (specifically XOR), and the construction of complex components like full adders using multiplexers. - Data Representation: Extensive exercises on number systems (radix conversion), including non-standard bases, Binary Coded Decimal (BCD), 2's complement for signed integers, and custom floating-point notations involving specific exponent biases. - Instruction
Evrika StudyULTRAJava Fundamentals and Turtle Graphics Exam
Language en - English Subject Type - STEM Exam Name Java Fundamentals and Turtle Graphics Exam Brief Overall Summary This document provides a concise introduction to Java programming concepts, focusing on the fundamentals necessary for understanding and creating simple Java programs. It begins with a brief overview of computer science concepts, including hardware components like the CPU and RAM, and the distinction between high-level and low-level programming languages. The document then delves into the Java compilation process, explaining the roles of the JDK, JRE, and JVM. A basic Java program structure is presented, emphasizing the importance of the public class and public static void main methods. Finally, the document introduces Turtle Graphics as a visual method for learning Java, covering basic commands for moving and turning the turtle, and demonstrating how to draw a square. The material is suitable for beginners with little to no prior programming experienc
MistaSatudyComputer Organisation CSE1400 Endterm
Language en - English Subject Type - STEM Exam Name Computer Organisation CSE1400 Endterm Brief Overall Summary This document is an endterm exam for a Computer Organisation course (CSE1400). It covers a range of topics related to computer architecture, memory organization, and parallel processing. The exam consists of 11 questions, each with a specified point value. The questions assess understanding of RISC vs. CISC architectures, memory addressing and organization (including interleaved and flat layouts), cache memory (associativity, replacement algorithms), pipelining, virtual memory, and parallel processing using GPUs. The problems require both conceptual understanding and the ability to apply that understanding to solve quantitative problems. The exam emphasizes the importance of showing work and providing detailed explanations for answers. The document provides solutions to each question, although it notes that these are intended as guidelines and that full credit
Evrika StudyULTRAClass VII Annual Examination
Language en - English Subject Type General Exam Name Class VII Annual Examination Brief Overall Summary This document outlines the annual examination schedule and portions for Class VII students. It covers various subjects including Social Science, Kannada, Hindi/Sanskrit, Science, English, Mathematics, and Computer Science & Art. For each subject, the specific chapters or topics to be studied are listed. The document also provides guidance on the types of questions and skills that will be assessed in each subject. It emphasizes the importance of referring to textbooks, workbooks, notebooks, and classwork for preparation. The schedule is designed to ensure comprehensive coverage of the curriculum and to assess students' understanding of key concepts and their ability to apply them. Course Structure Chapter 1: Social Science Examination Details Chapter Overview: This chapter outlines the topics for the Social Science examination, covering History, Geography, an
Vijayalakshmi SFundamentos de Desenvolvimento de Softwares Exam
Language pt - Portuguese Subject Type - STEM Exam Name Fundamentos de Desenvolvimento de Softwares Exam Brief Overall Summary This document provides an introductory overview of software development fundamentals. It covers essential concepts such as the definition of software, programs, and systems, highlighting their differences and relationships. The document explores the role of operating systems and their interaction with hardware and software. It delves into algorithms and programming languages, explaining syntax and semantics, and provides examples in different languages like C, Java, and Python. Furthermore, it introduces key terminology used in the software development industry, including front-end, back-end, full-stack, APIs, and frameworks. Finally, it discusses software development life cycles, comparing traditional (Waterfall) and agile methodologies (Extreme Programming and Scrum), outlining their principles, practices, and components. The document aims to eq
Thiago Gomes RamosПрикладна Статистика
Language uk - Ukrainian Subject Type - STEM Exam Name Прикладна Статистика Brief Overall Summary This document is a Ukrainian-language textbook on applied statistics, intended for bachelor's degree students in Computer Science and Systems Analysis. It covers core concepts and methods used in statistical data analysis, with a focus on building statistical models, constructing interval forecasts, and evaluating risks. The text emphasizes practical application, particularly in the context of financial and production processes. The document is structured into chapters covering linear regression, non-linear regression, and multiple linear regression. Each chapter includes theoretical background, examples of method application, and step-by-step instructions for computer-based practical exercises using tools like Excel. Key topics include assessing the tightness and significance of relationships between variables, hypothesis testing, and identifying and addressing issues like
Lisa ZayarchenkoLogic Exam
Language en - English Subject Type STEM Exam Name Logic Exam Brief Overall Summary This document provides an introduction to logic, specifically propositional logic, and is structured as a lecture and accompanying chapter material. It covers the relevance of logic in various fields such as mathematics, AI, and computer science. The document then delves into propositional logic, covering topics such as valid inferences, constructing formulas, semantic situations using truth tables, and classifications of formulas. It also covers concepts like valuations, logical consequences, and equivalences. The document uses examples, exercises, and detailed explanations to illustrate these concepts, guiding the reader through the foundational principles of propositional logic and its applications. It also introduces proof systems for propositional logic. Course Structure Chapter 1: Introduction to Logic Chapter Overview: This chapter provides a gener
Alessia TomusEndterm Calculus CSE1200
Language en - English Subject Type STEM Exam Name Endterm Calculus CSE1200 Brief Overall Summary This document consists of the official examination paper and detailed solutions for the "Endterm Calculus CSE1200" held on February 1, 2023. The course covers advanced calculus topics essential for computer science and engineering students, specifically focusing on multivariable calculus, complex analysis, and infinite series. The exam is structured into two main parts: "Short Answer Questions," which test immediate conceptual application and calculation without requiring written justification, and "Open Questions," which demand rigorous mathematical argumentation and step-by-step computations. Key mathematical areas evaluated include: 1. Vector Algebra: Computing angles between three-dimensional vectors using dot products and norms. 2. Complex Analysis: Finding roots of complex numbers (De Moivre's Theorem), expressing numbers in polar/exponential forms, and anal
Evrika StudyULTRAAlgorithms and Data Structures Final Exam
Language en - English Subject Type STEM Exam Name Algorithms and Data Structures Final Exam Brief Overall Summary This document provides a comprehensive overview of algorithms and data structures, focusing on time and space complexity analysis, fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs, and various sorting and searching algorithms. The material emphasizes both theoretical concepts and practical implementation details, including algorithm design principles, common pitfalls, and performance considerations. It covers empirical analysis, Big-Oh notation, and various proof methods. The document also delves into advanced topics such as adaptable priority queues, hashing techniques, search trees, and graph traversal algorithms. The content is structured to facilitate a deep understanding of algorithm efficiency and the trade-offs associated with different data structure choices. Course Structure Chapter 1: Time and Space Com
Cognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft
Language en - English Subject Type - STEM Exam Name Cognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft Brief Overall Summary This document comprises two lectures aimed at preparing prospective students for the Cognitive Skills Test (CST) required for admission to the Computer Science and Engineering program at TU Delft. The first lecture focuses on mathematics, specifically addressing exponent manipulation, logarithms, trigonometric identities, sketching rational functions, integration, and optimization problems. The lecturer works through sample exercises, emphasizing strategic problem-solving approaches and relevant formulas. The second lecture introduces reasoning and logic, covering propositional and predicate logic. It highlights the importance of logic in computer science, particularly in CPU design and algorithm verification. The lecturer provides examples of logic puzzles and demonstrates how truth tables can be used for equivale
Data Structures and Algorithms Final Exam
Language en - English Subject Type STEM Exam Name Data Structures and Algorithms Final Exam Brief Overall Summary This document provides a comprehensive overview of algorithms and data structures, focusing on time/space complexity analysis, fundamental data structures (arrays, linked lists, stacks, queues, trees, graphs, and hash tables), sorting algorithms, and search trees. It emphasizes the theoretical aspects of algorithm design and analysis, including Big-Oh notation, and provides practical implementation details for various data structures. The document also covers advanced topics such as adaptable priority queues, balanced search trees, and graph traversal algorithms. The overall aim is to equip students with the knowledge and skills necessary to design and analyze efficient algorithms and data structures for solving complex computational problems. Course Structure Chapter 1: Time and Space Complexity Analysis Chapter Overview: This chapter introduces t
Evrika StudyULTRAIntroduction to Programming and Computer Science - Full Course
YouTube video: Introduction to Programming and Computer Science - Full Course by freeCodeCamp.org
Evrika StudyULTRAComputer Science LM-18 Exam
Language it - Italian Subject Type STEM Exam Name Computer Science LM-18 Exam Brief Overall Summary This document outlines the study plan for the Master's Degree in Computer Science (LM-18) at the University of Bari for the academic year 2024-2025. It details the courses, their respective credits (CFU/ECTS), didactic activities, and assessment methods for both full-time and part-time students. The curriculum is structured over two years, with specializations offered in Artificial Intelligence and Security Engineering. The document provides a comprehensive overview of the required and elective courses, including their scientific disciplinary sectors (SSD), the type of didactic activity (TAF), and the distribution of credits between lectures, exercises/labs, and projects. Furthermore, it specifies the assessment methods for each course, primarily exams. The study plan is designed to provide students with a solid foundation in computer science, enabling them
Algorithms and Data Structures Exam - Flashcards
Evrika StudyULTRADeck 1
Ananya BhargavaDeck 1
marissa yasminAlgorithms and Data Structures Final Exam - Flashcards
Evrika StudyULTRAAlgorithms and Data Structures Final Exam - Flashcards
Evrika StudyULTRAData Structures and Algorithms First Exam - Flashcards
Caden JonesProgramming Fundamentals and Data Structures Exam - Flashcards
Ryan GuanzonComputer Science LM-18 Exam - Flashcards 2
Operating Systems Concepts Exam - Flashcards 1
Pauline KamauComputer Science LM-18 Exam - Flashcards 4
Data Structures and Algorithms Final Exam - Flashcards
Evrika StudyULTRAComputer Science LM-18 Exam - Flashcards 3
Sorting Algorithms Exam - Flashcards 1
Dainius RimaviciusData Structures and Algorithms First Exam - Flashcards
Caden JonesComputer Science LM-18 Exam - Flashcards 1
Operating Systems Exam - Flashcards
April ASorting Algorithms Exam - Flashcards 2
Dainius RimaviciusOperating Systems Concepts Exam - Flashcards 2
Pauline KamauCognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft - Flashcards
Evrika StudyULTRASorting Algorithms Exam - Flashcards 2
Evrika StudyULTRASorting Algorithms Exam - Flashcards 1
Evrika StudyULTRAExpert Logic and Computer Science Practice Test
This practice test assesses expert-level understanding of logic, Boolean algebra, logic circuits, and predicate logic, focusing on their application in computer science. All questions are based on the provided summary document.
Theoretical Computer Science Practice Test
A practice test covering fundamental concepts in theoretical computer science, including logic, proofs, sets, functions, and relations.
Delftse Foundations of Computation: Practice Test
This practice test assesses your understanding of fundamental concepts in theoretical computer science, logic, proof techniques, and discrete structures, as introduced in the 'Delftse Foundations of Computation' textbook summary.
Computer Science LM-18 Exam - Practice Test 1
Organized practice test covering selected topics
Computer Science LM-18 Exam - Practice Test 2
Organized practice test covering selected topics
Computer Science LM-18 Exam - Practice Test 3
Organized practice test covering selected topics
Computer Science LM-18 Exam - Practice Test 4
Organized practice test covering selected topics
Computer Science LM-18 Exam - Practice Test 5
Organized practice test covering selected topics
Cognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft - Practice Test
Organized practice test covering selected topics
Programming Fundamentals and Data Structures Exam - Practice Test
Organized practice test covering selected topics
Operating Systems Concepts Exam - Practice Test
Organized practice test covering selected topics
Data Structures & Algorithm Fundamentals - Practice Exam 1
Organized practice test covering selected topics
Data Structures and Algorithms First Exam - Cheatsheet
Caden JonesCognitive Skills Test (CST) for Computer Science and Engineering Program at TU Delft - Cheatsheet
Evrika StudyULTRAData Structures and Algorithms First Exam - Cheatsheet
Caden JonesProgramming Fundamentals and Data Structures Exam - Cheatsheet
Ryan GuanzonAlgorithms & Data Structures: Exam Essentials
Evrika StudyULTRAComputer Science LM-18 Exam - Cheatsheet
Algorithms and Data Structures: Exam Essentials
Evrika StudyULTRASorting Algorithms Exam - Cheatsheet 1
Dainius RimaviciusSorting Algorithms Exam - Cheatsheet 2
Dainius RimaviciusSorting Algorithms Exam - Cheatsheet 1
Evrika StudyULTRASorting Algorithms Exam - Cheatsheet 2
Evrika StudyULTRACAIE IGCSE Computer Science: Core Concepts & Algorithms
Ananya BhargavaExplore Evrika
Evrika — AI-powered study platform with free flashcards, practice tests, and study notes for Medical College Admission Test, United States Medical Licensing Examination, National Council Licensure Examination, International Medical Admissions Test, Pharmacy College Admission Test, Dental Admission Test, North American Pharmacist Licensure Examination, North American Veterinary Licensing Examination and more.