A tantárgyleírás hatályossága
Hatályosság kezdete:
2026. March 21.
Hatályosság vége:
—
| Subject name (Hungarian, English) |
Informatika 2
Informatics 2
|
||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject code | BMEVIAUAB01 | ||||||||||||
| Subject type | — | ||||||||||||
| Training Level | — | ||||||||||||
| Course types and hours (weekly/semester) |
|
||||||||||||
| Assessment type | vizsga | ||||||||||||
| Credits | 5 | ||||||||||||
| Subject coordinator |
DR. Csorba Kristóf
position: egyetemi docens
contact:
csorba.kristof@vik.bme.hu
|
||||||||||||
| Responsible department |
Automatizálási és Alkalmazott Informatikai Tanszék
|
||||||||||||
| Faculty | Villamosmérnöki és Informatikai Kar | ||||||||||||
| Subject website | — | ||||||||||||
| Primary curriculum type | — | ||||||||||||
| Direct prerequisites – Strong prerequisite | none | ||||||||||||
| Direct prerequisites – Weak prerequisite | none | ||||||||||||
| Direct prerequisites – Parallel prerequisite | none | ||||||||||||
| Direct prerequisites – Milestone prerequisite | none | ||||||||||||
| Direct prerequisites – Exclusion | none |
Objectives
Programme
Database Management
- General concepts
and components of a database system. Data independence, architectural
layers.
- Entity, relational
descriptions, binary and many-valued relations. Data storages,
representation.
- Relation, domain,
attribute, key concepts. Integrity rules, operations on relations.
Relational database.
- Entity-Relationship
diagrams. Enhanced ER-diagrams.
- Database operations
(insert, delete, update). Introduction to relational algebra. Relational database
design by ER-to-Relational mapping
- Introduction to
SQL. Creating a table, and inserting, modifying, deleting data. Database
search. Static and dynamic SQL. Data types, null. Queries in SQL; filters,
expressions, operators. Grouping, sorting. Complex queries, embedded
queries (join). DML and DDL statements.
- Transactions and
basics of transaction management. Data consistency.
Computer Networks
- General approach:
protocol, network edge, network core. Access networks (DSL, cable,
wireless, etc.) and physical media (coaxial, fiber, radio). Network
topologies.
- Packet switching
vs. circuit switching. Delay, loss, throughput concepts. Internet and OSI
protocol stack.
- Application layer.
Network applications: client-server and peer-to-peer. Web caching.
- HTTP protocol
overview: request/response messages, persistent/non-persistent, cookies,
get/post. FTP protocol overview: connections, sample commands.
- Electronic mail:
SMTP, POP, IMAP protocols.
- Domain naming
system (DNS): root name servers, TLD servers, local DNS servers.
- Transport layer: key
functions. Multiplexing and demultiplexing. Main principles of reliable
data transfer. UDP vs. TCP. Main principles of congestion control.
- Network layer: key
functions. Virtual circuits. Internet Protocol (IP): datagram format, MTU,
fragmentation. IP addressing: subnets, DHCP, address spaces (class A-E). Network
Address Translation (NAT). Internet Control Message Protocol (ICMP), IPv4
and IPv6.
- Datalink layer: key
functions and services. Error detection and correction: parity check, CRC.
Multiple access protocol classes: channel partitioning, random access,
taking turns. MAC address and ARP protocol.
- Physical layer
encodings: Manchester, Differential Manchester, NRZ, NRZ-I
Formal Languages and
State Machines
- Introduction to
automata theory. Basic concepts of formal languages.
- Deterministic
finite automaton (DFA). DFA minimization.
- Non-deterministic
finite automaton (NFA). NFA to DFA
conversion.
- Finite state machine (FSM) and regular languages.
FSM transformations.
- Non-regular
languages.
- General concepts
and functions of a compiler. Lexical and syntactic parsers. High-level
language elements (case study).
This
course is a basic BSc course based on the previous terms. The main goal is
providing a comprehensive approach to the following areas: computer networking,
database management, data processing, programming theory, and formal languages.
Both
theoretical and practical approaches are presented in order to help students in
their research activities as electrical engineers. As a result, students bacome
able to detect, analyze and manage problems that arise in network systems,
database engines, and simple human-computer and computer-to-computer
interfaces.
Learning outcomes
Ez a tantárgy a KKK rendeletben meghatározott, következő kompetenciák fejlesztését szolgálja:
Knowledge
No learning outcomes recorded.
Skills
No learning outcomes recorded.
Attitudes
No learning outcomes recorded.
Autonomy and responsibility
No learning outcomes recorded.
Oktatási módszertan
Lectures
and computer laboratories.
Tanulástámogató anyagok
Online források
Computer; Networks:; Andrew S. Tanenbaum; "Computer Networks", 2010.; James Kurose, Keith; Ross „Computer Networking: A Top-Down Approach”, 2017; Database; Systems:; Jeff D. Ullman,; Jennifer Widom "A first course in Database Systems", 2007; Hector; Garcia-Molina, Jeff Ullman, Jennifer Widom "Database Systems: The; Complete Book", 2014.; SQL for Nerds by; Philip Greenspun, link: http://philip.greenspun.com/sql/; Formal; Languages:; ; Alfred V. Aho, Ravi; Sethi, et. al. "Compilers: principles, techniques, and tools",; 2006, Chapters 1-4.; The Visual Automata; Simulator is a tool for simulating various automata. Link: http://automatonsimulator.com ; Michael Sipser; "Introduction to the theory of computation", 2012. This textbook; covers automata theory, computability theory, and complexity theory. It; also contains exercises, problems and solutions.
Recommended preliminary knowledge for completing the subject
Knowledge type competencies
(azon előzetes ismeretek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
Good knowledge of the C++ programming
language and object-oriented programming techniques (Basics of Programming 2)
Skill type competencies
(azon előzetes képességek és készségek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
nincs
Recommended (non-compulsory) preliminary competencies
(azon ajánlott (nem kötelező) előzetesen megszerzendő kompetenciák összessége, amelyek jelentősen hozzájárulnak a tantárgy eredményes teljesítéséhez)
Good knowledge of the C++ programming
language and object-oriented programming techniques (Basics of Programming 2)
General rules
Requirements:
In lecture term:
The continuity of
learning is checked by placement tests at laboratories, which is a
pass/fail check (10 minute written test). If a student fails the placement
test, his attendance at the laboratory is null. The placement test cannot
be retaken.
In one week after
each laboratory exercise, the student should submit a laboratory report
that requires the documentation of tasks and exercises, including system
and algorithm designs, test cases, and theoretical background if needed.
It should be submitted electronically at the course webpage. The student
must always follow the directions of Laboratory Instructor (if any), or
else his report will not be accepted.
The quality of
learning is checked by a Midterm Test that will take place during the
semester.
The signature is given, if
1)
The student is a regular attendant at the lectures and laboratories; the
absence cannot exceed 30% as it is defined in the Code of Studies and Exams
(CSE), Article 14, Point 3. Absence at lectures and laboratories is taken
separately.
2)
The student has completed 6 laboratory exercises out of 7, and all
corresponding laboratory reports are accepted by the laboratory instructor.
3)
The Midterm Test grade is at least "pass".
The course is finished successfully
(the credits are given), if
1)
The signature is obtained.
2)
The exam grade is at least “pass”.
In
this course, we want to encourage collaboration and the free interchange of
ideas among students, and in particular the discussion of laboratory exercises.
However, we do not allow plagiarism, which, as commonly defined, consists of
passing off as one's own ideas, words, writings, etc., which belong to another.
In accordance with this definition, you are committing plagiarism if you copy
the work of another person and turn it in as your own, even if you should have
the permission of that person. Therefore, a student who is unsure whether an
action constitutes an offence, or who needs help in learning how to avoid
offences (e.g., plagiarism, cheating) or about rules for group
work/collaboration should seek guidance from the course instructor or academic
advisor.
Additional possibilities:
Throughout the
semester, there are computer laboratories; one of them can be retaken at the
end of the lecture term. The unsatisfactory Midterm Test and Final Exam can be
retaken in accordance with CSE (TVSZ).
Assessment methods
In-term assessments
No detailed assessments provided.
Weight of in-term assessments
No weights provided.
Exam-period assessments
No detailed assessments provided.
Weight of exam elements
No weights provided.
Grade calculation
No grade thresholds provided.
Attendance requirements
No attendance requirements provided.
Rules for retake and resubmission
Not provided.
Short description
Not provided.
Detailed description
Not provided.
Recommended courses
Not provided.
Workload to complete the subject
No workload breakdown provided.
Validity of subject requirements
Requirements valid from:
—
Requirements valid until:
—
Curriculum placement
No curriculum placements recorded for this subject version.