Welcome to SDU Institutional Repository
Communities
Select a community to browse its collections.
Recent Submissions
Digital Design
(SŰLEYMAN DEMIREL UNIVERSITY, 2002) Kiziyeva L.
Digital Design is one of the basic courses for computer engineers. Then students study special courses on the basis of Digital Design one. Thus, good knowledge of the course is a warranty of a successful study in whole. Test questions are prepared on the basis of material of eight chapters of M. Morris Mano manual "Digital Logic and Computer Design". They cover such topics as "Binary Systems", " Boolean Algebra and Logic Gates", " Simplification of Boolean Functions", “ Combinational Logic", " Combinational Logic with MSI and LSI"," Sequential Logic", " Registers, Counters, and the Memory Unit", "Register Transfer Logic". Test questions are prepare such a way to cover the course in whole. As a base of the test preparation methodic Bloom's taxonomy is used. It allows us to control the test questions-level of complexity. It is known that Bloom's taxonomy provides a useful structure in which to categorize test questions, since professor will characteristically ask questions within particular levels. Bloom proposes such levels of students competence: 1) knowledge; 2) comprehension; 3) application; 4) analysis; 5) synthesis; 6) evaluation. In our case the main part of test questions is of levels 2, 3, and 4. There are few test questions of level 1, because on average the level of Suleyman Demirel University (SDU) students' knowledge is enough high. There are few test questions of level 5 and too, because according to methodic of SDU students' knowledge checking, the tests are method only preliminary evaluation of students' knowledge and skills. Tests are used only as indicators for students and for instructor. A student can evaluate the level of his knowledge and make a decision if he wants to improve his knowledge on the subject or it is enough for him to obtain a minimum positive mark as a result of the test passage. From another side, an instructor makes a selection of students according to different criteria on the basis of the tests' results. Instructor defines the best students for creative work with them and the worst students for correction of their knowledge. Students who obtained definite number of points on the test have got a right to take part in a creative exam. During the exam they have got the tasks of levels 5 and 6 according to Bloom's taxonomy. But they must demonstrate the ways of the tasks' solution completely, show the results obtained, analyze, evaluate them, make a conclusion, they must enunciate all statements themselves. The test questions are prepared such a way, that correspondent choice may be done at any stage of the course. It gives a possibility to carry out check of the students' knowledge any moment. SDU authority can carry out it without presence of the instructor because the list if correct answers is prepared. The test questions give possibilities to students to concentrate their efforts in the important directions. According to the test questions' content they can judge about the level of requests to pass the exam and what is more important in the subject. Publishing of the test questions doesn't mean that they will be for exam exactly. They can be used only for orientation, but during the exam such changes will be done: for number base conversion the data are different, the scheme for analysis is different too and so on. But if a student can answer these published test questions, he will be able tot any questions of the same levels. The test questions will be very useful for students and any persons who are interested in their English improving, because in process of the test questions' preparation terms, typical structures of sentences of scientific English are used.
CIRCUIТ ТЕСHNOLOGIES LABORATORY WORKS DESCRIPTIONS AND TEST EXAMPLES
(SULEYMAN DEMIREL UNIVERSITY, 2011) Ertugrul M.; Kiziyeva L.; Suliyev R.
Laboratory works on the course "CIRCUIT TECHNOLOGIES" are worked out for provision of more deep understanding of basic digital circuits' operation. They cover such circuits as logic gates, code converters, decoders, encoders, multiplexers, demultiplexres. adders, flip-flops. They are used to improve students' investigation skills. In process of lab works' performance students must improve their skills of analysis and synthesis of digital circuits, investigate modes of their operation. The important part of the student's work is Scheme Design System application for the schemes' preparation. Doing the lab works students must understand the functionality of the circuits deeply and to be sure that it operates in full correspondence with its theoretical description. Lab works can be very helpful to provide hands-on reinforcement of the theoretical knowledge. Performance of lab works provides presence and development the students' skills to mount electronic schemes, to treat with measuring instruments and evaluate their readings correctly. The students must obtain skills to define the function of chips and how to treat with them. proficiency Throughout at using the labs, the standard integrated circuits are used to provide students the terminology and data sheets of the ICs.
Digital Design
(SULEYMAN DEMIREL UNIVERSITY, 2006) Kiziyeva L.
Library Digest No 12
(SDU University, 2026-04) Scientific Library
The Scientific Library Digest offers a comprehensive overview of recent developments, initiatives, and updates within the university’s library system, emphasizing its role in supporting both educational and research activities. This issue highlights key achievements, ongoing projects, and improvements in library resources and services, providing readers with timely and relevant information. By presenting essential news in a concise format, the digest aims to facilitate awareness and engagement among students, faculty, and researchers. It serves as an accessible platform to communicate the library’s efforts to enhance academic support, promote knowledge sharing, and foster an environment conducive to learning and scholarly success.
Fundamental Structures OF Computer Science (Part-2)
(SÜLEYMAN DEMIREL UNIVERSITY, 2002) Peretyat'kin M.G.
This book describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithins. As computers become faster and faster, the need for prograns that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible. Therefore, no algorithm or data structure is presented without an explanation of its running time. As computers have become more powerful, the problems they must solve have become larger and more complex, requiring development of more intricate programs. The goal of this text is to teach students good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Chapters 1 and 2 give some general approach to investigate programs and describe main classes of algorithms. Chapter 3 covers lists, stacks, and queues. The emphasis here is on coding these data structures using abstract data types, fast implementation of these data structures, and an exposition of some of their uses. There are almost no programs (just routines), but the exercises contain plenty of ideas for programming assignments. Chapter 4 covers trees, with an emphasis on search trees, including external search trees (B-trees). The UNIX file system and expression trees are used as examples. AVL trees and splay trees are introduced but not analyzed. Seventy-five percent of the code is written, leaving similar cases to be completed by the student. Chapter 5 is a relatively short chapter concerning hash tables. Some analysis is performed, and extendible hashing is covered at the end of the chapter. Chapter 6 is about priority queues. Binary heaps are covered, and there is additional material on some of the theoretically interesting implementations of priority queues. Chapter 7 covers sorting. It is very specific with respect to coding details and analysis. All the important general-purpose sorting algorithms are covered and compared. Four algorithms are analyzed in detail: insertion sort, Shellsort, heapsort, and quicksort. The analysis of the average-case running time of heap sort is new to this edition. External sorting is covered at the end of the chapter. Abstract data types have helped greatly in organizing the subject matter, both by classifying and specifying data structures, and by removing them from the algorithms. They permeate the book, and there are whole chapters devoted to their implementation. By count- ing the number of times that a characteristic operation is performed, the analyses give quite precise results, without excessive detail. Exercises, provided at the end of each chapter, match the order in which material is presented. The last exercises may address the chapter as a whole rather than a specific section. Difficult exercises are marked with an asterisk, and more challenging exercises have two asterisks. References are placed at the end of each chapter. Generally the references either are historical, representing the original source of the ma- terial, or they represent extensions and improvements to the results given in the text. Some references represent solutions to exercises. This book is intended as a text for a one-semester second or third year course on algorithms and data structures. Chapters 1-7 of the book provide enough material for one-semester data structures courses. It aims to present the central topics of the subject under a coherent or- ganization, with emphasis more on depth of treatment than on broad survey.