Java

Deadlock nima? U race condition bilan qanday farq qiladi? Deadlockni qanday oldini olish mumkin, hatto bloklarni olish tartibini oldindan aniqlash mumkin bo'lmasa ham?

Senior

VK

Agar siz GC ni loyihalasangiz, erishish grafigini yuritishdan tashqari qanday axlat to'plash yondashuvlarini bilasiz?

Senior

VK

In-memory saqlashdan foydalanib, getTop(User user, int limit) va addDocument(Document document) metodlari bilan RecommenderService ni amalga oshiring

Senior

VK

Ko'rsatkich qancha vazn? Bu nima?

Senior

VK

Stack nima uchun kerak va heap nima uchun kerak? Farqi nima?

Senior

VK

Heap (xip) nima?

Senior

VK

Nima uchun test NullPointerException bilan muvaffaqiyatsiz bo'ldi va buni qanday tuzatish mumkin?

Senior

VK

Java'da heap'dan obyektlarni qanday o'chirilishini aytib bering. Garbage Collector haqida gapiring.

Senior

VK

Quyidagi kod parchalarning ishlashini taqqoslang, ular Integer massividan int massiviga va aksincha elementlarni nusxalashadi, shuningdek, int qiymatlaridan yangi Integer obyektlari yaratiladigan holatni ham o'z ichiga oladi: ```java int SIZE = 1000000; int[] x = new int[SIZE]; Integer[] y = new Integer[SIZE]; for (;;) { for (int i = 0; i < SIZE; ++i) { x[i] = y[i]; } } ``` ```java int SIZE = 1000000; int[] x = new int[SIZE]; Integer[] y = new Integer[SIZE]; for (;;) { for (int i = 0; i < SIZE; ++i) { y[i] = x[i]; } } ``` ```java int SIZE = 1000000; int[] x = new int[SIZE]; Integer[] y = new Integer[SIZE]; for (;;) { for (int i = 0; i < SIZE; ++i) { y[i] = new Integer(x[i]); } } ``` Tahlil qiling va bu yondashuvlar orasidagi ishlash va xulq-atvor farqlarini tushuntiring.

Senior

VK

Hozirgi amalga oshirishda qaysi SOLID tamoyili buzilgan, bu yerda xizmat aniq saqlash amalga oshirishiga (ArrayList) qattiq bog'langan?

Senior

VK

Unix operatsion tizimining interfeys darajasida qanday jarayonlararo aloqa (IPC) usullarini bilasiz?

Senior

VK

Synchronized nima uchun kerak? Synchronized o'rniga iplar xavfsiz hisoblagichni qanday amalga oshirasiz?

Senior

VK

int SIZE = 1000000; int[] x = new int[SIZE]; Integer[] y = new Integer[SIZE]; for (;;) { for (int i = 0; i < SIZE; ++i) { y[i] = new Integer(x[i]); } }

Senior

VK

Bir nechta REST so'rovlar bilan parallel ravishda xizmatga kirishda ishlab chiqarish muhitida qanday muammo yuzaga kelishi mumkin?

Senior

VK

Primitive qanday qilib stackda paydo bo'ladi va qanday qilib heapda?

Senior

VK

/** * Ikki sonni massivda qidirish, ularning yig'indisi berilgan son bilan teng * <p> * Bir funksiyani yozing, birinchi argument sifatida tartibsiz ijobiy sonlardan iborat massivni qabul qiladi * va ikkinchi argument sifatida ijobiy son. Funksiya, massivda * yig'indisi ikkinchi argumentga teng bo'lgan 2 son bo'lsa, true qaytarishi kerak. * <p> * Kiritish: ([10, 15, 3, 7], 17) * Chiqish: true */

Senior

VK

Hozirgi yondashuvda har safar getTop chaqirilganda butun ro'yxatni saralashning qanday kamchiliklari bor?

Senior

VK

ACID qisqartmasini shifrlang va har bir xususiyatini tushuntiring.

Senior

VK

Xizmatda bog'liqliklarni (Dependency Injection) qanday to'g'ri joriy etish — qaysi yondashuv afzalroq?

Senior

VK

Unix oilaviy tizimlarida fork tizim chaqiruvi nima?

Senior

VK