Anyone want ssc je or gate ese paid civil engg lecture of top institute msg here or react this post
๐7
INTERNSHIP๐
Coincent offers certified Microsoft Summer Internship Program for the 1st, 2nd and 3rd Year Engineering and Arts students
Benefits:
โ 2/ 3 months internship program
โ Live mentorship sessions
โ Training completion certificate
โ Internship completion Certificate
โ Resumes will be sent to 200+ tie up companies
โ Possibility of PPO from top companies
Deadline :- May 20th, 2024 (6:00Pm)
Interested candidates can register through the below form:-
https://coincent.ai/prospect/microsoft-summer-internship-cec
Note:
Shortlisting will happen after you register
Coincent offers certified Microsoft Summer Internship Program for the 1st, 2nd and 3rd Year Engineering and Arts students
Benefits:
โ 2/ 3 months internship program
โ Live mentorship sessions
โ Training completion certificate
โ Internship completion Certificate
โ Resumes will be sent to 200+ tie up companies
โ Possibility of PPO from top companies
Deadline :- May 20th, 2024 (6:00Pm)
Interested candidates can register through the below form:-
https://coincent.ai/prospect/microsoft-summer-internship-cec
Note:
Shortlisting will happen after you register
๐2
Amrit Code Community on LinkedIn ๐๏ธ
โ Follow us for coding stuffs
โ Follow us for Hackathon updates
โ Follow us for MNC companies questions โ๏ธ
https://www.linkedin.com/groups/9849038
โ Follow us for coding stuffs
โ Follow us for Hackathon updates
โ Follow us for MNC companies questions โ๏ธ
https://www.linkedin.com/groups/9849038
LinkedIn
LinkedIn Login, Sign in | LinkedIn
Login to LinkedIn to keep in touch with people you know, share ideas, and build your career.
โค1๐1
Forwarded from PK
The protocol data unit(PDU) for the application layer in the Internet stack is
โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ เผ๐ ฐ๐ ผ๐๐ ธ๐ ๐ บ๐ ด๐๐ ท๐๐ ธ
โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ เผ๐ ฐ๐ ผ๐๐ ธ๐ ๐ บ๐ ด๐๐ ท๐๐ ธ
Anonymous Quiz
42%
Segment
38%
Datagram
12%
Message
8%
Frame
๐2๐ฅ2โค1
๐ฒ Quiz '๐ ๐ฃ๐ฅ๐ข๐๐ฅ๐๐ ๐ ๐๐ก๐ ๐ค๐จ๐๐ญ ๐๐ฌ ๐๐ ๐ฅ๐๐ง ๐๐๐ฆ๐๐ฅ๐ @AMRITKESHRI'
๐ 36 questions ยท โฑ 1 min
๐ 36 questions ยท โฑ 1 min
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is
โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ เผ๐ ฐ๐ ผ๐๐ ธ๐ ๐ บ๐ ด๐๐ ท๐๐ ธโงููููููููููููโงูููููููููููู
โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ เผ๐ ฐ๐ ผ๐๐ ธ๐ ๐ บ๐ ด๐๐ ท๐๐ ธโงููููููููููููโงูููููููููููู
Anonymous Quiz
25%
ฮ(n)
44%
ฮ(logn)
23%
ฮ(n*logn)
8%
ฮ(1)
๐1
An algorithm performs (logN)1/2 find operations, N insert operations, (logN)1/2 , delete operations, and (logN)1/2 decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased.
Which one data structures is most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?
โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ เผ๐ ฐ๐ ผ๐๐ ธ๐ ๐ บ๐ ด๐๐ ท๐๐ ธโงููููููููููููโงูููููููููููู
โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ โธ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ ๊ เผ๐ ฐ๐ ผ๐๐ ธ๐ ๐ บ๐ ด๐๐ ท๐๐ ธโงููููููููููููโงูููููููููููู
Anonymous Quiz
19%
Unsorted array
28%
Min-heap
33%
Sorted array
19%
Sorted doubly linked list
๐2
๐ฒ Quiz '๐ ๐ฃ๐ฅ๐ข๐๐ฅ๐๐ ๐ ๐๐ก๐ ๐ค๐จ๐๐ญ ๐๐ฌ ๐๐ ๐ฅ๐๐ง ๐๐๐ฆ๐๐ฅ๐ @AMRITKESHRI'
๐ 36 questions ยท โฑ 1 min
๐ 36 questions ยท โฑ 1 min
