목록Computer Science (44)
Code&Data Insights
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/AFnnX/btsy4jEGIvw/sv8KCodk6mJfyEumItLAV0/img.png)
[ Adversarial Search ] : a strategy used in artificial intelligence for decision-making in competitive scenarios, such as games. It involves representing the problem as a game tree, using the Minimax algorithm, evaluation functions, and techniques like (ex) chess, checkers, and in various real-world domains like business strategy, auctions, and negotiations. : Alpha-Beta Pruning to f..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bX8zU6/btsy05f2DFp/PK0xfVhH8oRtDiUNRqRkdK/img.png)
: we try to identify which nodes seems more Optimistic, and explore these first - With heuristics (useful rules or empirical knowledge) or additional information is used to find the most efficient path. - A way to visit the most promising nodes first [ Heuristic ] - A technique improves the efficiency of search - Focus on nodes that seem most optimistic acc..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/rKksG/btsyVbH0Pb4/FZs4BQjCSWareAasHrLhDK/img.png)
: all nodes are equally optimistic, so we explore them systematically => Simple search method, without heuristics or information, explores all possible paths. · Data Structure - Open List(=frontier) - Closed List(=explored set) · Generic Search Algorithm 1) Initialize OPEN with the initial node n0 and its parent 2) Initialize CLOSED to empty 3) Repeat A) If OPEN is empty, t..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/cNFBND/btsy366wgRP/V3bbSkKsGa4WsbYcQKQcd1/img.png)
: Finding a solution from initial state to a goal state [ State Space ] · Problem is represented by 1) Initial State - Starting state 2) Set of Operators - Actions for transition between states 3) Goal test function - determine if it is matched with a goal state 4) Calculate Path cost function - Assigns a cost to a path if a path is best among others · State space ..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/6VrcK/btr0Iv6FiWS/9nEUSAdKznVlRckFuh0eL1/img.png)
Schemas and Instances - Databases instance: the current content of the DB - Databases schema: the structure of the data(relations/classes) -> Relation(table) is as a set or tuple! What is the meaning of Data Independence?? : the ability to modify definition of schema at one level with little or no effect on the schema at a high level - Logical data independence: adding new fields to a record or ..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/dba38I/btr0GbgJZBB/vfKr4OXTy61Wk22lLHOLAk/img.png)
What is a Database? : a collection (Not a random pile of data) of data that exists over a long period time. DBMS : a complex software package developed to store and manage databases è Mysql, mongoDB, … è Provide convenient, efficient, and secure access and manipulation of large amounts of data è Controls access to shared data from multiple, simultaneous users with properties Atomicity, Consisten..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/mawdw/btrZIfEZLuZ/h0EKMUTiD8dnV30mcQqia1/img.png)
5. Give details of employees who worked in at least two different facilities. Details include employee’s first-name, last-name, start date, end date, facility name, role (nurse, doctor, etc.), Medicare card number, telephone-number, and email address. Results should be displayed sorted in ascending order by first name, then by last name, then by start date. QUERY) SELECT e.firstName, e.lastName..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/oGDjP/btrYwn9V1YR/KIwKWPS9C7dhH6okkCLLgk/img.png)
Inner Join : selects records that have matching values in both tables. => intersection of two tables SELECT column_name(s) FROM table1 INNER JOIN table2 ON table1.column_name = table2.column_name; Left Join SELECT column_name(s) FROM table1 LEFT JOIN table2 ON table1.column_name = table2.column_name; Right Join SELECT column_name(s) FROM table1 RIGHT JOIN table2 ..