GATE CS 2017 Set 1 | Q 48: Let A be an array of 31 numbers consisting of a sequence of 0's followed

GATE CS 2017 Set 1 | Question: 48
Let A be an array of 31 numbers consisting of a sequence of 0's followed by a sequence of 1's. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is ________.

Ans : 5
----------------------------------------------------
Subscribe my channel for more updates https://www.youtube.com/monalisacs
----------------------------------------------------------
Join Telegram GATE CSE study group: https://t.me/MonalisaCSE
----------------------------------------------------------------
Algorithm Lectures :https://www.youtube.com/playlist?list=PL767-rEuXhcNz3RzupBowAjH2VIxCiY4z
Algorithm GATE PYQ: https://www.youtube.com/playlist?list=PL767-rEuXhcPvbsxbBWbDSlRZ4e6kAVve
----------------------------------------------------------------
Compiler Design Lectures :https://www.youtube.com/watch?v=THpeYyp0gwY&list=PL767-rEuXhcOgCrFXRxyvfO_4INJET0f0&index=1
Compiler Design PYQ :https://www.youtube.com/watch?v=THpeYyp0gwY&list=PL767-rEuXhcOVm9ABkyap0uSyjFz6c5cS&index=1
----------------------------------------------------------------------
Theory Of Computation Lectures https://www.youtube.com/watch?v=vDJjYGui3Ho&list=PL767-rEuXhcPQWMuHXOCZzj5PqF9YBVZt
TOC GATE PYQ: https://www.youtube.com/watch?v=K5wIww1OnCY&list=PL767-rEuXhcN7sn9TCRxhmvDpG7RLT3UK
-------------------------------------------------------------------
Data Structure Lecture: https://www.youtube.com/watch?v=mYDsGejk3zg&list=PL767-rEuXhcMiMbX4IU_oqWshY6z8Rc7j
Data Structure PYQ: https://www.youtube.com/watch?v=mYDsGejk3zg&list=PL767-rEuXhcOWUPgW1RrIkUKAle1YBdh1
-----------------------------------------------------------------------
#gate2023 #gate_cs #gate #algorithm #binarysearch

Видео GATE CS 2017 Set 1 | Q 48: Let A be an array of 31 numbers consisting of a sequence of 0's followed канала Monalisa CS

Комментарии отсутствуют

Информация о видео

20 января 2023 г. 1:22:54

00:02:12

Monalisa CS

Правообладателям

Жалоба на материал Недопустимый материал Нарушение авторских прав

Комментарии

Другие видео канала

GATE CS 2017 Set 1 | Q 48: Let A be an array of 31 numbers consisting of a sequence of 0's followed

GATE CS 2013 | Question: 24 Consider an undirected random graph of eight vertices. The probability

GATE CS 2021 Set 1 | Question: 33 Consider the relation R(P , Q , S , T , X , Y , Z , W) with the

GATE IT 2008 | Question: 28 Consider the following Hasse diagrams.Which all of the above represent

Ch 1.3 : Relationship Sets |DBMS lectures by @MonalisaCS

GATE CS 2022 | Question: 40 The following simple undirected graph is referred to as the Peterson

Ch 4.7.0 Generating Functions part 1 | Combinatorics Lecture by @MonalisaCS

GATE CS 2025 | Set 1 | Question: 25 The height of any rooted tree is defined as the maximum number

GATE CS 2026 | Set 1 | Question: 21 In the context of relational database normalization, which of

Ch 3.2 : Basic Types , Schema Definition (create table command) | DBMS lectures by @MonalisaCS

GATE CS 2015 Set 1 | Question: 49 Let an represent the number of bit strings of length n containing

GATE CS 2016 Set 2 | Question: 52 Consider the following database table named water_schemes:

GATE CS 2025 | Set 2 | Question: 14 Which ONE of the following languages is accepted by a

GATE DA 2024| Question: 18 Consider the following tree traversals on a full binary tree:(i) Preorder

Ch 3.2.1 : Incidence Matrices | Isomorphism of Graphs | Graph Lectures by @MonalisaCS

GATE CS 2016,Set-2|Q 11:Breadth First Search (BFS) is started on a binary tree beginning from the

GATE CS 2017 Set 2 | Question: 17 An ER model of a database consists of entity types A and B.

GATE CS 2013 | Q47: Which one of the following is NOT logically equivalent to ¬∃x(∀y(∝)∧∀z(𝛽)) ?

Ch 7.6 : Rod-Cutting problem | Dynamic Programming

GATE DA 2024| Question: 20 Consider sorting the following array of integers in ascending order using

GATE DS&AI 2024 | Question: 21 Consider the following two tables named Raider and Team in a relation

Ch 4.7.1 Generating Functions part 2 | Combinatorics Lecture by @MonalisaCS