A tantárgyleírás hatályossága
Hatályosság kezdete:
2026. March 21.
Hatályosság vége:
—
| Subject name (Hungarian, English) |
Szoftver Labor 1.
Software Laboratory 1.
|
||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject code | BMEVIEEA101 | ||||||||||||
| Subject type | — | ||||||||||||
| Training Level | — | ||||||||||||
| Course types and hours (weekly/semester) |
|
||||||||||||
| Assessment type | félévközi érdemjegy | ||||||||||||
| Credits | 2 | ||||||||||||
| Subject coordinator |
Dr. Czirkos Zoltán
position: adjunktus
contact:
czirkos-EZT-TOROLD-KI@eet.bme.hu
|
||||||||||||
| Responsible department |
Elektronikus Eszközök Tanszéke
|
||||||||||||
| 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
First week Introduction to the computer lab, to the system, and to the structure of the university network. Operating System basics: command line program can be started from the command line, its parameters.
Second week
Introduction of an Integrated Development Environment. Compilation of simple programs. Basics of debugging, monitoring the assignment to variables. Editing the program source and compilation. The compiler error messages.Third week
Coding simple algorithms from a Pseudo code / structogram representation. Programs with simple I/O. printf, scanf, format strings.4th week
Exercise simple algorithms. Nested loops. Multiplication table, 'draw' a rectangle. Programming of known algorithms (eg, prime, gcd). Find my Number (guess, smaller, bigger).5th week
The basics of array handling. Creating arrays. Search, count the number of pairs in it, etc.. Demonstration of out-of-range indexing of an array.6th week
Bit functions. Dump number in binary form. Bit-pattern generation, c = set(c, 5). Effect of overflow. Determination of the bits of an integer. Demonstration of floating point inaccuracy.7th week
Built-in string processing functions. Handling arrays - more exercise. Multi-dimensional arrays.8th week
File management, for example: writing an array into file and reading back. Programs split to multiple modules. Processing of command line arguments. File copy.9th week
State machine coding. Redirect input from file and/or to file. TH counter, comment filter. Pattern Recognition.10th week
Array algorithms, pointers. Search and Sort implementations. Using multiple module source, decomposition.11th week
Implementation of list handling. Building a list. Writing to a file, reading from a file. Application of a sentry. Insert, delete.12th week
Coding of recursive functions. Fibonacci series, iteratively and recursively. False recursion, printing of a number. True recursion, colouring shapes. Maze - Can you reach the exit.13th week
Handling of trees.14th week
Practice for exam.
The main objective of the course is to give the students an opportunity to put their theoretical knowledge obtained in the lectures into practice, in order to provide students with appropriate skills in computerized problem-solving and basic use of tools that are required during their further studies. The classes are completed with a long-term individual homework assignment to help improve the students' skills.
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
There are two computer laboratory practices every week. This subject is strongly related to Basics of Programming 1.
Tanulástámogató anyagok
Online források
[1] B.W. Kernighan - D.M. Ritchie: The C Programming Language. Prentice Hall, 1988. 2nd edition; [2] N.Wirth: Algorithms + Data Structures = Programs; Prentice Hall, 1976. 1st edition
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)
-
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)
-
General rules
Requirements:
a. During the semester: It is compulsory to visit the laboratory practices. The presence is checked every time. The absence of a student must be less than a prescribed limit. (see Code of Studies and Exams) Reaching this limit results in denial of the signature.
This subject is strongly related to Basics of Programming 1. Students must follow the topics of the lectures and of the classroom practices to be able to successfully comply with the requirements of the lab. Tutors are entitled to check the required knowledge of the students prior to the lab, or during the lab. The lab is registered as absence for students failing this check. There are five small tests during the semester. The average of the three best tests count. A miss test is treated as 0. There is no way to repeat any of the small tests. Beside the small tests there is a long-term individual homework assignment for each student to solve. The specification is published on week 6, the solution is to be delivered on week 13. Late delivery is accepted by 12:00 of the last day of the semester (Friday of week 14) while paying a late delivery fee. Beyond week 14 there is no way to deliver a homework.
To get the signature for the semester all of the following three conditions must fulfil: · The average of small tests is at least 2.0 (pass)
· The homework was delivered in time, is an acceptable solution in accordance with the specification, together with the prescribed documentation. Students must present their homework to the tutor in person. · The absence of the student does not exceed the prescribed rate.
Failing in any of the above three requirements results in denial of signature. Mid-semester mark is given to those students who have signature. The calculation of the mark is simply the rounded value of two grades: the mean average of the small test grade and the homework grade. The tutor has the right to modify this calculated mark by ± 1 grade according to the general performance of the student during the lab classes.
Additional possibilities:
There is no repeat possibility neither for the presence, nor for the small tests. For the homework assignment there is no acceptance after the last day of the semester.
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
-
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.