GFG KARE Student Chapter

Day 99: Test Your Knowledge - Topic : Network Layer Hello Geeks👋 #Day99 Of Aptitude Mastery Series, exploring the fascinating world of Computer Networks.Join us to boost your aptitude skills and evaluate your interview and Gate preparation! Today's Question : Which one of the following protocols is NOT used to resolve one form of address to another one? #Share Your #Answer and Reasoning In #Comment and let's dive deep into the topic together! Stay Connected🤝 #Follow Us GFG KARE Student Chapter for more exciting questions and updates on our activities. Sandeep Jain, GeeksforGeeks, Shikhar Goel, Saurabh Mahawar, Akshay Kumar Paswan, CSE-KARE, Kalasalingam University, Raja Sekar R, Shanmugapriya Sankaran, Mastan Shaik, Navadeep Marella, Sabari S, Pidigundla Venkateswara Rao, Garnepudi Prasanthi, Kunapareddy Bala Rajesh #Gate #preparation #geeksforgeeks #gfgkare #linkedin #newteam

🎯 Algorithmist'25 - Elevate Your Problem Solving Skills!🚀 Hello Geeks👋 Get ready for an exciting adventure that will elevate your Problem Solving skills to new heights!.Join us for a series of dynamic events designed to challenge and inspire coding enthusiasts like you!🫵 💻 📚What's Happening? 🔹 Participate in 5 engaging rounds from January to March 2025, aimed at enhancing your coding proficiency. 🔹Explore and master 30 essential algorithms crucial for technical interviews and competitive programming. 🔹Collaborate with GeeksforGeeks, a leading platform in coding education. 🔹Earn 2 Experiential Elective Credits, rewarding the top 100 participants for their achievements! 🏆 🎪 Event Lineup: 1️⃣ Algorithm Quiz - Test your DSA knowledge 2️⃣ Expert Seminars - Showcase your algorithm expertise 3️⃣ Q&A Challenge - Collaborate to create and solve problems in teams 4️⃣ Debug Marathon - Fix and optimize your code 5️⃣ Grand Finale- The ultimate coding showdown on the GFG platform 💫 Important Details: 🔹 limited spots available! 🔹 Last Date to Register: January 2, 2025 🔹Spots are filled on a first-come, first-served basis! 🔗Quick Links: 🔹 Register here: https://lnkd.in/gM_GyBSF 🔹View the Algorithm List:https://lnkd.in/gs5CbGt8 🔹Join the group :https://lnkd.in/gMRYD8iR ❓ Got Questions? Reach Out To: 🔹 Navadeep: 7075072880 🔹Sabari: 8754605197 🔹Prasanthi: 9032772680 🔹Siri: 9491146276 🔹Mastan : 7670925466 Don't miss this incredible opportunity to enhance your coding skills! Register ASAP! 🎯 GFG KARE STUDENT CHAPTER 💚 Shasi Anand Sridharan, Sridharan Kalasalingam, Kalasalingam University, Dr.P.Deepalakshmi Ramkumar, Dr.sureshkumar nagarajan, Raja Sekar R, Shanmugapriya Sankaran, Sandeep Jain, GeeksforGeeks, Akshay Kumar Paswan, Saurabh Mahawar, KRISHNA VINEETH, Navuluri Balaji, Ashok Reddy Cheluri, PARIMAL ADINI, Mastan Shaik, Batchu Gnana Sampath, Navadeep Marella, Sabari S, Pidigundla Venkateswara Rao, Garnepudi Prasanthi, Siri Chowdary #Algorithmist25 #gfgkare #registernow #coding #technology #innovation #kare #career #linkedin

🎯 Algorithmist 25 - Elevate Your DSA Skills!🚀 Hello Geeks👋 Get ready for an exciting adventure that will elevate your Data Structures and Algorithms (DSA) skills to new heights! Join us for a series of dynamic event Algorithmist 25 is designed to challenge and inspire coding enthusiasts like you🫵 💻 📚 What's Happening? 🔹Participate in 5 engaging rounds from January to March 2025, aimed at enhancing your coding proficiency. 🔹Explore and master 30 essential algorithms crucial for technical interviews and competitive programming. 🔹Collaborate with GeeksforGeeks, a leading platform in coding education. 🔹Earn 2 Experiential Elective Credits, rewarding the top 100 participants for their achievements! 🏆 🎪 Event Lineup: 1️⃣ Algorithm Quiz - Test your DSA knowledge 2️⃣ Expert Seminars - Showcase your algorithm expertise 3️⃣ Q&A Challenge - Collaborate to create and solve problems in teams 4️⃣ Debug Marathon - Fix and optimize your code 5️⃣ Grand Finale- The ultimate coding showdown on the GFG platform 💫 Important Details: 🔹Only limited spots available! 🔹 2 credits under Experiential Elective will be provided to the top 100 performers. 🔹 Last Date to Register: January 2, 2025 🔹 Spots are filled on a first-come, first-served basis! 🔗 Quick Links: 🔹Register here: https://lnkd.in/gM_GyBSF 🔹 View the list of Algorithms: https://lnkd.in/gQuzB5bc 🔹Check Rounds Details: https://lnkd.in/g5uUkbjV ❓ Got Questions? Reach Out To: 🔹Navadeep: 7075072880 🔹Sabari: 8754605197 🔹Prasanthi: 9032772680 🔹Siri: 9491146276 🔹Mastan:7670925466 Don't miss this incredible opportunity to enhance your coding skills! Register ASAP! 🎯 Shasi Anand Sridharan, Sridharan Kalasalingam, Sandeep Jain, Shikhar Goel, Akshay Kumar Paswan, Saurabh Mahawar, GeeksforGeeks, Kalasalingam University, CSE-KARE, Dr.P.Deepalakshmi Ramkumar, Dr.sureshkumar nagarajan, Raja Sekar R, Shanmugapriya Sankaran, Mastan Shaik, KRISHNA VINEETH, Navuluri Balaji, Ashok Reddy Cheluri, PARIMAL ADINI, Navadeep Marella, Pidigundla Venkateswara Rao, Sabari S, Siri Chowdary, Garnepudi Prasanthi, Kunapareddy Bala Rajesh, vivek charan tej kosireddy #Algorithmist25 #GeeksforGeeks #gfgkare #coding #Innovation #programming #career #technology #networking #dsa #interview #preparation

Day 98: Test Your Knowledge - Topic : TCP Protocols Hello Geeks👋 #Day98 Of Aptitude Mastery Series, exploring the fascinating world of Computer Networks.Join us to boost your aptitude skills and evaluate your interview and Gate preparation! Today's Question : The maximum window size for data transmission using the selective reject protocol with n-bit frame sequence numbers is?? #Share Your #Answer and Reasoning In #Comment and let's dive deep into the topic together! Stay Connected🤝 #Follow Us GFG KARE Student Chapter for more exciting questions and updates on our activities. Sandeep Jain, GeeksforGeeks, Shikhar Goel, Akshay Kumar Paswan, Saurabh Mahawar, Kalasalingam University, CSE-KARE, Raja Sekar R, Shanmugapriya Sankaran, Mastan Shaik, Garnepudi Prasanthi, Navadeep Marella, Sabari S, Pidigundla Venkateswara Rao #Gate #preparation #geeksforgeeks #gfgkare

🎄✨ Wishing Everyone a Merry Christmas ✨🎄 We extend our heartfelt Christmas greetings to everyone. This season is a time for reflection, gratitude, and meaningful connections. May the magic of Christmas fill your heart with joy, your home with love and your life with endless blessings 🎅🎁 On this special day, let us come together to celebrate the joy of giving, fostering a spirit of generosity and compassion. May the warmth of this season inspire us to strengthen our connections and spread happiness 💖🌟🤝🎉 Best Regards GFG KARE Student Chapter 💚 Shasi Anand Sridharan, Sridharan Kalasalingam, Kalasalingam University, Dr.P.Deepalakshmi Ramkumar, Dr.sureshkumar nagarajan, Sandeep Jain, Shikhar Goel, Akshay Kumar Paswan, Saurabh Mahawar, GeeksforGeeks, Raja Sekar R, Shanmugapriya Sankaran, Garnepudi Prasanthi, Navadeep Marella, Mastan Shaik, Sabari S, Pidigundla Venkateswara Rao, Batchu Gnana Sampath, Kunapareddy Bala Rajesh, Siri Chowdary, CSE-KARE #Christmas #celebrations #Unity #geeksforgeeks #gfgkare #linkedinpost

Day 97: Test Your Knowledge - Topic : Shortest Path Hello Geeks👋 #Day97 Of Aptitude Mastery Series, exploring the fascinating world of Data Structures and Algorithms.Join us to boost your aptitude skills and evaluate your interview and Gate preparation! Today's Question : Suppose you have a directed acyclic graph with n vertices and O(n) edges, all having nonnegative weights. Running time (in form of n) of an efficient algorithm for finding the shortest path to each vertex from a single source is?? #Share Your #Answer and Reasoning In #Comment and let's dive deep into the topic together! Stay Connected🤝 #Follow Us GFG KARE Student Chapter 💚 for more exciting questions and updates on our activities. Sandeep Jain, GeeksforGeeks, Shikhar Goel, Akshay Kumar Paswan, Saurabh Mahawar, Kalasalingam University, CSE-KARE, Raja Sekar R, Shanmugapriya Sankaran, Mastan Shaik, Navadeep Marella, Sabari S, Pidigundla Venkateswara Rao, Garnepudi Prasanthi #Gate #preparation #geeksforgeeks #gfgkare #challenge #linkedinfamily

Day 96: Test Your Knowledge - Topic : Shortest Path Hello Geeks👋 #Day96 Of Aptitude Mastery Series, exploring the fascinating world of Data Structures and Algorithms.Join us to boost your aptitude skills and evaluate your interview and Gate preparation! Today's Question : Consider the following strategy to solve the single source shortest path problem with edge weights from source s. 1. Replace each edge with weight w by w edges of weight 1 connected by new intermediate nodes. 2. Run BFS(s) on the modified graph to find the shortest path to each of the original vertices in the graph. Which of the following statements is correct? #Share Your #Answer and Reasoning In #Comment and let's dive deep into the topic together! Stay Connected🤝 #Follow Us GFG KARE Student Chapter 💚 for more exciting questions and updates on our activities. Sandeep Jain, GeeksforGeeks, Shikhar Goel, Akshay Kumar Paswan, Saurabh Mahawar, Kalasalingam University, CSE-KARE, Raja Sekar R, Shanmugapriya Sankaran, Mastan Shaik, Navadeep Marella, Sabari S, Batchu Gnana Sampath, Garnepudi Prasanthi, Siri Chowdary #Gate #preparation #geeksforgeeks #gfgkare #challenge

Day 95: Test Your Knowledge - Topic : Graph Traversal Hello Geeks👋 #Day95 Of Aptitude Mastery Series, exploring the fascinating world of Data Structures and Algorithms.Join us to boost your aptitude skills and evaluate your interview and Gate preparation! Today's Question : Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing?? #Share Your #Answer and Reasoning In #Comment and let's dive deep into the topic together! Stay Connected🤝 #Follow Us GFG KARE Student Chapter 💚 for more exciting questions and updates on our activities. Sandeep Jain, GeeksforGeeks, Shikhar Goel, Akshay Kumar Paswan, Saurabh Mahawar, Kalasalingam University, CSE-KARE, Raja Sekar R, Shanmugapriya Sankaran, Mastan Shaik, Sabari S, Navadeep Marella, Pidigundla Venkateswara Rao, Garnepudi Prasanthi, Siri Chowdary #Gate #preparation #geeksforgeeks #gfgkare #kalasalingam_university

Day 94: Test Your Knowledge - Topic : Graph Traversal Hello Geeks👋 #Day94 Of Aptitude Mastery Series, exploring the fascinating world of Data Structures and Algorithms.Join us to boost your aptitude skills and evaluate your interview and Gate preparation! Today's Question : Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the maximum possible value of n is?? #Share Your #Answer and Reasoning In #Comment and let's dive deep into the topic together! Stay Connected🤝 #Follow Us GFG KARE Student Chapter 💚 for more exciting questions and updates on our activities. Sandeep Jain, GeeksforGeeks, Shikhar Goel, Akshay Kumar Paswan, Saurabh Mahawar, Kalasalingam University, CSE-KARE, Raja Sekar R, Shanmugapriya Sankaran, Mastan Shaik, Navadeep Marella, Pidigundla Venkateswara Rao, Garnepudi Prasanthi, Siri Chowdary, Batchu Gnana Sampath #Gate #preparation #geeksforgeeks #gfgkare

Day 93: Test Your Knowledge - Topic : Divide and Conquer Hello Geeks👋 #Day93 Of Aptitude Mastery Series, exploring the fascinating world of Data Structures and Algorithms.Join us to boost your aptitude skills and evaluate your interview and Gate preparation! Today's Question : What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n? #Share Your #Answer and Reasoning In #Comment and let's dive deep into the topic together! Stay Connected🤝 #Follow Us GFG KARE Student Chapter 💚 for more exciting questions and updates on our activities. Sandeep Jain, GeeksforGeeks, Shikhar Goel, Akshay Kumar Paswan, Saurabh Mahawar, Kalasalingam University, CSE-KARE, Raja Sekar R, Shanmugapriya Sankaran, Mastan Shaik, Navadeep Marella, Sabari S, Pidigundla Venkateswara Rao, Garnepudi Prasanthi, Batchu Gnana Sampath #Gate #preparation #geeksforgeeks #gfgkare