643 subscribers
6 photos
36 files
48 links
๐„๐ฏ๐ž๐ซ๐ฒ๐๐š๐ฒ ๐ฒ๐จ๐ฎ ๐ฐ๐ข๐ฅ๐ฅ ๐ ๐ž๐ญ 3-4 ๐ช๐ฎ๐ข๐ณ ๐ช๐ฎ๐ž๐ฌ๐ญ๐ข๐จ๐ง๐ฌ ๐ฐ๐ก๐ข๐œ๐ก ๐š๐ซ๐ž ๐ข๐ฆ๐ฉ๐จ๐ซ๐ญ๐š๐ง๐ญ ๐š๐ง๐ ๐š๐ฌ๐ค๐ž๐ ๐ข๐ง ๐ฉ๐ฅ๐š๐œ๐ž๐ฆ๐ž๐ง๐ญ ๐ž๐ฑ๐š๐ฆ๐ฌ ๐จ๐ซ ๐ข๐ฆ๐ฉ๐จ๐ซ๐ญ๐š๐ง๐ญ ๐Ÿ๐จ๐ซ ๐ฒ๐จ๐ฎ๐ซ ๐ˆ๐“ ๐ฃ๐จ๐›๐ฌ

ADMIN @TEAM_PQR
Download Telegram
Anyone want ssc je or gate ese paid civil engg lecture of top institute msg here or react this post
๐Ÿ‘7
Channel name was changed to ยซCoding Quiz Groupยป
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
๐Ÿ‘2
Hi
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
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
Are you interested in Quiz?
Anonymous Quiz
94%
Yes
6%
No
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
Channel photo updated
Channel name was changed to ยซNeoCodeยป
Hello guys kasa hoo
Anonymous Quiz
73%
Fine
27%
Sad
Happy Republic Day Guys
Anonymous Quiz
93%
Happy Republic Day Amrit
7%
Ghussa hai Amrit se