[algogeeks] Fwd: UCEKU2006-10 Fwd: FW: Entry Level Software Test Engineer Position- Hiring Drive - 17th Oct 2015
*Brocade Communications, Bangalore* *Off-Campus Hiring for Software Test Engineers* *Tentative Date of Off Campus Drive: 17th Oct 2015 Saturday @ Brocade Campus* *Process for sending resumes:* 1. Send mail to kranthi0...@gmail.com <kranthi...@gmail.com> 2. Send one resume per mail. 3. Mention the Job title in the subject line. 4. Feedback on the resumes whether it is shortlisted/ rejected will be sent based on the manager’s feedback. 5. Resumes will be valid for 6months *Job Title-Experience-Location* *Job Description* *Software Test Engineer* *Experience Level: 1** to 2.5 years* *Preferred Skills : *Testing/Layer 2/Layer 3 Testing*,* Data structure, Algorithms, Programming, Automation Testing, TCL, Python,LTE,Mobile backhaul,IP Networking *Location: Bangalore* *Call for Entry level career opportunities with 1 to 2.5 years of experience from Tier1/Tier2 Engineering College Graduates* *Eligibility Criteria:* ·Experience 1 to 2.5 Years ·*70% or CGPA 7.0* and above marks in B.E/B.Tech/M.E/M- CS/E/EEE ·*MCA/M.sc graduates are not eligible.* ·Experience in Networking Domain, Layer 2/Layer 3 Testing, scripting and Operating System. ·CCNA/CCNP is preferred. *Thanks and Regards,* *Staffing Team* [image: cid:image003.png@01CFDCA7.31A4D950] -- Sincerely, Kranthi Raj A 9620246959 For What Profits A Man If He Gains The Whole World But Loses His Own Soul -Mark 8:36 -- Sincerely, Kranthi Raj A 9620246959 For What Profits A Man If He Gains The Whole World But Loses His Own Soul -Mark 8:36 -- -- UCEKU 2006-10 Best Batch... --- You received this message because you are subscribed to the Google Groups "UCEKU2006-10" group. To unsubscribe from this group and stop receiving emails from it, send an email to uce2006-10+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout. -- Sincerely, Kranthi Raj A 9620246959 For What Profits A Man If He Gains The Whole World But Loses His Own Soul -Mark 8:36 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Oracle EBS Consultant////Columbus, OH/////12+Months
Hello Partner, Hope you are doing great!! Please let me know if you have any consultants for the below position,I would appreciate if you can send a word version of your Consultant resume and the best number to reach,Visa Status and Current Location of him/her.. *Job Title : Oracle EBS Consultant* *Location: Columbus, OH* *Duration: 12+Months* --- Minimum Requirements: 1) At least 7 years of strong experience in Oracle EBS development.(Order to Cash ) 2) End to end knowledge of SDLC 3) Familiar with AIM Methodology(MD70) 4) Technical Skills: a) PL/SQL b) Forms/Reports c) Forms Personalization d) Workflow e) BPEL - SOA f) BI Publisher 5) Excellent communication skills 6) Team player Additional desirable skill sets include: 1) Agile Development Framework 2) XML/BI Publisher 3) Java 4) Demantra 5)Demand to Build or Procure to Pay or Value Chain Planning, ASCP Thanks and Regards, Raj Paul Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Availability of Sharepoint Admin or Architect
Hi partners, Hope you are doing well. I have excellent consultant for your sharepoint Admin/Architect requirements. He can relocate any where. 248-918-2510 EXT 1002 rajp...@viprainfosystems.com *MAHESH* *SUMMARY*: § *15+ years* of experience in designing and implementing several large-scale, high profile multi-tier, database-driven, client-server, Internet, Intranet, mobile devise projects. Able to deliver projects from concept through deployment. § *5+ *yrs. of Microsoft SharePoint platform and solution development in SharePoint 2003/2007/and 2010 platforms - which includes, high level project scoping, estimating, capacity planning, proposing the server farm topology, solution design and implementation and business user training. § Worked in Microsoft Corporation, Redmond, USA for 1.5 yrs., and worked for 1.5 years at Microsoft GDCI, India projects as a Technical Lead. § Overall 6 yrs. of onsite experience in USA, in various client locations, such as Shell Oil corporation, Microsoft, JCPenney, Eli-Lilly Company, Hughes Telematics, Providence Healthcare, and University of Chicago Medicine § *SharePoint 2013/2010/2007, ASP.NET http://ASP.NET 3.5/4.0, C#, AJAX, WCF, LINQ, WF, Capacity planning, Custom development,* *Web Content Management,* *Dashboard development*, *Windows Workflow Foundation, SQL Server 2005/2008, Business Connectivity Services, InfoPath, SQL Server Reporting Services (SSRS), DotNetNuke 4.8* *TECHNICAL SKILLS* Languages *C#,* JAVA, VB 6.0, COBOL, C, BASIC Web Technologies Share Point 2013/2010 / 2007, ASP.NET, Web Services, WCF, REST, Workflow Foundation, AJAX, JQuery, ADO.NET, Telerik r.a.d controls, XML, XSLT, XPATH, JavaScript, VBScript, HTML, DHTML, CSS, ASP, JSP, Java Servlets, PERL RDBMS SQL Server 2005/2008, Oracle 9 /10g, DB2 Development TOOLS Visual Studio.Net 2010, Team Foundation Server/VSS/SVN, SQL Profiler, Microsoft Enterprise library 4.0, Share point Designer 2010, SAP.NETConnector, Visio, FxCop Operating Systems Windows 2008/2003 Servers, Windows 7/ XP/ 2000/NT, UNIX, MVS, ES 9000, MPE/iX, MAC. Thanks and Regards, *Raj Paul* Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Sr. Java Developer with retail exp.//////Columbus, OH////// 6+Months
Hello Partner, Hope you are doing great!! Please let me know if you have any consultants for the below position,I would appreciate if you can send a word version of your Consultant resume and the best number to reach,Visa Status and Current Location of him/her.. *Job Title : Sr. Java Developer with retail exp.* *Location: Columbus, OH* *Duration: 6+Months* *Interview: Phone* --- 8- 10years exp Responsible for analysis, design, coding and testing of new applications or enhancements to existing applications using Java-based technologies, including Java, J2EE, JSP, XML, JDBC, and Servlets. Must be able to apply SDLC concept and have a proven track record of delivering solid, robust applications. Must have a solid understanding of Object Oriented Programming. Strong communication skills are required as position will interact with business owners. Will be working on the Digital Platform project Top 3 skills the hiring manager is looking for: Strong Java skill set, strong communication with business partners and ability to quickly drive results Thanks and Regards, Raj Paul Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Sr. Network Engineer with CCIE//////Columbus, Ohio//////Long term contract
Hello Partner, Hope you are doing great!! Please let me know if you have any consultants for the below position,I would appreciate if you can send a word version of your Consultant resume and the best number to reach,Visa Status and Current Location of him/her.. *Job Title : Sr. Network Engineer with CCIELocation: Columbus, OhioDuration: Long term contract* *HOT REQUIREMENT... URGENT NEEDED* --- Job Description: This technical leadership position is primarily responsible for analyzing, designing, installing, configuring, maintaining and repairing enterprise data network infrastructure to ensure that performance and reliability meets and exceeds the requirements of the business. The successful candidate for this position will be a motivated self-starter and leader that interacts well with IT team members and professionally with internal and external customers. Required Skills/Experience: Education · Bachelor of Science degree (EE, CS, etc.) oCandidates without a Bachelor's degree will NOT be considered · Vendor Certifications: oCisco Certified Network Professional (CCNP) - Required *oCisco Certified Internetwork Expert (CCIE) - Desired* Technology Leadership 8-10 years of managing large multinational WAN solutions · Cisco Switches Routers in a large data center environments · MPLS, Frame-Relay, and VPN WAN topologies · VLAN, HSRP, Spanning-Tree configurations · Data network design focusing on redundancy and resiliency · Ciscoworks, NetFlow and HP Business Service Management and/or HP Openview · Fault isolation and remediation · Capacity management, planning, and reporting · Thorough knowledge of WAN, LAN and wireless network technology · A complete understanding of TCP/IP in addition to well-known ports and protocols · Network packet capture and interpretation experience · Experience developing and maintaining comprehensive network documentation · Hands-on experience with Wintel, UNIX and/or Linux operating systems · Experience with Firewalls, IPS / IDS and Load Balancers Preferred Skills/Experience: · ITIL PMP certifications · Touch typing *Thanks and Regards,* *Raj Paul* *Sr. Technical Recruiter* *Phone : 248-918-2510 EXT 1002* *Email: rajp...@viprainfosystems.com rajp...@viprainfosystems.com* *IM Gtalk Skype : rajpaul232* *VipraInfoSystems |http://www.viprainfosystems.com http://www.viprainfosystems.com* *West Big Beaver Rd. Suite 200,Troy, MI 48084 USA* -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Sr .Net Developer///////Madison, WI //////3 years
Hello Partner, Hope you are doing great!! Please let me know if you have any consultants for the below position,I would appreciate if you can send a word version of your Consultant resume and the best number to reach,Visa Status and Current Location of him/her.. *Job Title : Sr .Net Developer* *Location: Madison, WI (Locals or Near by)* *Duration: 3 years* *Interview: Phone then Face to Face.* --- Application Architect I (Sr .Net Developer) Need Senior Consultant · This position is for multiple high profile web application projects within the FSE section. These projects include .Net MVC web applications with an Oracle, SQL Server or DB2 backend and mainframe applications that have to be converted to the web using ASP.Net MVC while maintaining connectivity with DB2. Additionally, there is an initiative to develop a mobile application with a vendor. This position will work with the vendor as the DCF technical representative. · Project Duties include requirements analysis, design, web application development, testing, implementation and leading/mentoring a team in the use of ASP.Net MVC, AJAX, JQuery and JQuery UI. · Deliverables include architecture and design documentation, documentation that provides guidance for development to new developers, estimates for design and development and quality code developed on time. This position is needed for a period of 3 years. Hardware/Software Environment: .Net Application and Web Application Design Patterns * Strategic Planning * AJAX, Javascript, JQuery and JQuery UI * ASP.Net Web forms - VB.Net and C# * Thanks and Regards, Raj Paul Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Sr Business Object Developer //////Lake Oswego, OR //////1-2 years
Hello Partner, Hope you are doing great!! Please let me know if you have any consultants for the below position,I would appreciate if you can send a word version of your Consultant resume and the best number to reach,Visa Status and Current Location of him/her.. *Job Title : Sr Business Object Developer * *Location: Lake Oswego, OR * *Duration: 1-2 years* --- Primary Skills: Set up and maintain Business Object Universe and assist report writing team with learning business objects and report development Senior Business Objects Developer · 8 plus years' experience · Experience setting/maintaining BO Universe Business Objects Report development · Healthcare Claims reporting · Must have excellent communication skills and able to mentor Thanks and Regards, Raj Paul Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] excellent consultant for your sharepoint Admin/Architect requirements.
Hi partners, Hope you are doing well. I have excellent consultant for your sharepoint Admin/Architect requirements. He can relocate any where. 248-918-2510 EXT 1002 rajp...@viprainfosystems.com *MAHESH* *SUMMARY*: § *15+ years* of experience in designing and implementing several large-scale, high profile multi-tier, database-driven, client-server, Internet, Intranet, mobile devise projects. Able to deliver projects from concept through deployment. § *5+ *yrs. of Microsoft SharePoint platform and solution development in SharePoint 2003/2007/and 2010 platforms - which includes, high level project scoping, estimating, capacity planning, proposing the server farm topology, solution design and implementation and business user training. § Worked in Microsoft Corporation, Redmond, USA for 1.5 yrs., and worked for 1.5 years at Microsoft GDCI, India projects as a Technical Lead. § Overall 6 yrs. of onsite experience in USA, in various client locations, such as Shell Oil corporation, Microsoft, JCPenney, Eli-Lilly Company, Hughes Telematics, Providence Healthcare, and University of Chicago Medicine § *SharePoint 2013/2010/2007, ASP.NET http://ASP.NET 3.5/4.0, C#, AJAX, WCF, LINQ, WF, Capacity planning, Custom development,* *Web Content Management,* *Dashboard development*, *Windows Workflow Foundation, SQL Server 2005/2008, Business Connectivity Services, InfoPath, SQL Server Reporting Services (SSRS), DotNetNuke 4.8* *TECHNICAL SKILLS* Languages *C#,* JAVA, VB 6.0, COBOL, C, BASIC Web Technologies Share Point 2013/2010 / 2007, ASP.NET, Web Services, WCF, REST, Workflow Foundation, AJAX, JQuery, ADO.NET, Telerik r.a.d controls, XML, XSLT, XPATH, JavaScript, VBScript, HTML, DHTML, CSS, ASP, JSP, Java Servlets, PERL RDBMS SQL Server 2005/2008, Oracle 9 /10g, DB2 Development TOOLS Visual Studio.Net 2010, Team Foundation Server/VSS/SVN, SQL Profiler, Microsoft Enterprise library 4.0, Share point Designer 2010, SAP.NETConnector, Visio, FxCop Operating Systems Windows 2008/2003 Servers, Windows 7/ XP/ 2000/NT, UNIX, MVS, ES 9000, MPE/iX, MAC. Thanks and Regards, *Raj Paul* Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] excellent consultant for your sharepoint Admin/Architect requirements
Hi partners, Hope you are doing well. I have excellent consultant for your sharepoint Admin/Architect requirements. He can relocate any where. 248-918-2510 EXT 1002 rajp...@viprainfosystems.com *MAHESH* *SUMMARY*: § *15+ years* of experience in designing and implementing several large-scale, high profile multi-tier, database-driven, client-server, Internet, Intranet, mobile devise projects. Able to deliver projects from concept through deployment. § *5+ *yrs. of Microsoft SharePoint platform and solution development in SharePoint 2003/2007/and 2010 platforms - which includes, high level project scoping, estimating, capacity planning, proposing the server farm topology, solution design and implementation and business user training. § Worked in Microsoft Corporation, Redmond, USA for 1.5 yrs., and worked for 1.5 years at Microsoft GDCI, India projects as a Technical Lead. § Overall 6 yrs. of onsite experience in USA, in various client locations, such as Shell Oil corporation, Microsoft, JCPenney, Eli-Lilly Company, Hughes Telematics, Providence Healthcare, and University of Chicago Medicine § *SharePoint 2013/2010/2007, ASP.NET http://ASP.NET 3.5/4.0, C#, AJAX, WCF, LINQ, WF, Capacity planning, Custom development,* *Web Content Management,* *Dashboard development*, *Windows Workflow Foundation, SQL Server 2005/2008, Business Connectivity Services, InfoPath, SQL Server Reporting Services (SSRS), DotNetNuke 4.8* *TECHNICAL SKILLS* Languages *C#,* JAVA, VB 6.0, COBOL, C, BASIC Web Technologies Share Point 2013/2010 / 2007, ASP.NET, Web Services, WCF, REST, Workflow Foundation, AJAX, JQuery, ADO.NET, Telerik r.a.d controls, XML, XSLT, XPATH, JavaScript, VBScript, HTML, DHTML, CSS, ASP, JSP, Java Servlets, PERL RDBMS SQL Server 2005/2008, Oracle 9 /10g, DB2 Development TOOLS Visual Studio.Net 2010, Team Foundation Server/VSS/SVN, SQL Profiler, Microsoft Enterprise library 4.0, Share point Designer 2010, SAP.NETConnector, Visio, FxCop Operating Systems Windows 2008/2003 Servers, Windows 7/ XP/ 2000/NT, UNIX, MVS, ES 9000, MPE/iX, MAC. Thanks and Regards, *Raj Paul* Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] SAP FICO Sr Functional Analyst///////Columbus, OH///////// 6+Months
Hello Partner, Hope you are doing great!! Please let me know if you have any consultants for the below position,I would appreciate if you can send a word version of your Consultant resume and the best number to reach,Visa Status and Current Location of him/her.. *Role: SAP FICO Sr Functional Analyst* *Location: Columbus, OH* *Duration: 6+Months* *HOT Requirement.. Back fill Position* --- Position Description: Role is for SAP FI/CO Functional Analyst/Data Conversion Lead. This resource will design FI/CO data maintenance processes for GL, CO, AA, and PS modules referencing established data conversion procedures from previous go-lives. This includes the creation of to-be process flows, SAP configuration, prototype data set-up and functional specifications. In addition, this resource will be responsible for the extraction, profiling, cleansing, transformation, conversion and validation of G/L historical balances and FI/CO master data. The resource could transition to the Implementation project after Design is complete. Application / Modules: * SAP ECC 6.0 * IS-Retail Industry Solution (preferred) * SAP implementation experience with FI modules, including: * G/L * CO * Fixed Assets * Project Systems * SAP LSMW (preferred) Responsibilities: * Perform SAP master data configuration * Set-up master data for prototype work * Develop master data functional specifications * Extract, profile, cleanse, transform, convert and validate GL historical balances and FI/CO Master Data * Participate in weekly data conversion meetings Skill Level * 5-7 years of SAP FI/CO experience * Must have been through full lifecycle implementation in a prior project as a Data Conversion specialist in at least one desired module * Familiar with blueprinting methodologies and SDLC processes Thanks and Regards, Raj Paul Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Oracle Apps Techno Functional Consultant//////Columbus, OH////12+Months
Hello Partner, Hope you are doing great!! *Job Title : Oracle Apps Techno Functional Consultant* *Location: Columbus, OH* *Duration: 12+Months* --- Minimum Requirements: 1) At least 7 years of strong experience in Oracle EBS development.(Order to Cash ) 2) End to end knowledge of SDLC 3) Familiar with AIM Methodology(MD70) 4) Technical Skills: a) PL/SQL b) Forms/Reports c) Forms Personalization d) Workflow e) BPEL - SOA f) BI Publisher 5) Excellent communication skills 6) Team player Additional desirable skill sets include: 1) Agile Development Framework 2) XML/BI Publisher 3) Java 4) Demantra 5)Demand to Build or Procure to Pay or Value Chain Planning, ASCP Thanks and Regards, Raj Paul Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
[algogeeks] Certified Microsoft .NET web Developer///////Madison, WI //////3 Years
*Role: Certified Microsoft .NET web Developer* *Location: Madison, WI * *Duration: 3 Years* *Interview: Telephone Interview * --- · This request is for a Certified Microsoft .NET Web Developer III having experience and knowledge with systems analysis, multi-layered object oriented design techniques, Microsoft Web applications architecture and development software to be responsible for designing, developing and supporting web applications in .NET. · This position will support the Document Generation Sub-System replacement project, the new KIDS web based user interface project, and other federally mandated, state budget and administrative projects in addition to supporting current child support applications including Child Support Online Services (CSOS) for participant financial and personal information; Lien Docket Web for Lien information; and License Certification Web for occupational and recreational license information. · Project duties will be to work as a .NET web developer and part of a team to develop and maintain child support applications in a Microsoft environment using web tools and techniques. · Project duties will also include analysis, design, and coding, testing, quality assurance, development of user documentation, training materials and help screens. Application Development and Support of IIS/ASP.Net/MVC/DB2/Oracle Server Based Systems Using Visual * .Net Application and Web Application Design Patterns * DB2 * Oracle SQL tuning * SQL Client tools * .Net (MS) * ASP.NET * Crystal Reports * ASP.Net MVC * Thanks and Regards, Raj Paul Sr. Technical Recruiter Phone : 248-918-2510 EXT 1002 Email: rajp...@viprainfosystems.com IM Gtalk Skype : rajpaul232 VipraInfoSystems |http://www.viprainfosystems.com West Big Beaver Rd. Suite 200,Troy, MI 48084 USA -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] c++ this pointer
When destroy called it will print garbage then it will print desired one.
Coz this pointer is self link but with different address of this pointer.
So after deletion of pointer this ...
On 5 Jun 2013 14:37, shubham saini shubhamsain...@gmail.com wrote:
#includeiostream
using namespace std;
class Test
{
private:
int x;
int y;
public:
Test(int x = 0, int y = 0) { this-x = x; this-y = y; }
void setX(int a) { x = a; }
void setY(int b) { y = b; }
void destroy() { delete this;
coutx=this-x,y= this-y;
}
void print() { cout x = x y = y endl; }
};
int main()
{
Test *obj=new Test();
(*obj).setX(10);
(*obj).setY(20);
(*obj).destroy();
(*obj).print();
return 0;
}
i created object dynamically yet how it is still able to print values of x
y even after deletion of object through 'this' .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an
email to algogeeks+unsubscr...@googlegroups.com.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] c++ this pointer
@saini oops... i answered very fast...Let me think...Destruction of this
pointer. Delete operator works only for heap allocated data. If you object
is created using new, then you can apply delete this, otherwise behavior is
undefined
delete this will not normally affect the this pointer itself, so it can
still be used to call the function. This behaviour is undefined though - it
might work, it might not. In general, delete this is a bad idea in C++. The
only justification for using it is in some reference counted classes, and
there are beter approaches to reference counting which do not require its
use.
On Wed, Jun 5, 2013 at 9:21 PM, Nitish Raj raj.n...@gmail.com wrote:
When destroy called it will print garbage then it will print desired one.
Coz this pointer is self link but with different address of this pointer.
So after deletion of pointer this ...
On 5 Jun 2013 14:37, shubham saini shubhamsain...@gmail.com wrote:
#includeiostream
using namespace std;
class Test
{
private:
int x;
int y;
public:
Test(int x = 0, int y = 0) { this-x = x; this-y = y; }
void setX(int a) { x = a; }
void setY(int b) { y = b; }
void destroy() { delete this;
coutx=this-x,y= this-y;
}
void print() { cout x = x y = y endl; }
};
int main()
{
Test *obj=new Test();
(*obj).setX(10);
(*obj).setY(20);
(*obj).destroy();
(*obj).print();
return 0;
}
i created object dynamically yet how it is still able to print values of
x y even after deletion of object through 'this' .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an
email to algogeeks+unsubscr...@googlegroups.com.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] What data structures will you use to implement a text editor. Size of editor can be changed and you also need to save the styling information for all the text like italic, bold etc.EO
Ravi you r correct. Rope aka Cord. On Sun, May 26, 2013 at 9:36 AM, Ravi Ranjan ravi.cool2...@gmail.comwrote: Rope On Sat, May 25, 2013 at 10:24 PM, Nishant Pandey nishant.bits.me...@gmail.com wrote: In one of the interview it was asked, can some one suggest good DS for this. Thanks -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] Appropriate data structure
steps: 1) make max heapify and min heapify for first k days 2)for the next day... remove first element from max heapify and min heapify then add new element to existing max heapify and min heapify . 3) Then return max and min in O(1)from max heapify and min heapify . PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] flipkart question
plz explain ur ans .how it is calculated? On Sat, Jul 7, 2012 at 12:54 PM, Amol Sharma amolsharm...@gmail.com wrote: Three 0's and Three 6's. 36 possibilities and 12 possible values of sum, so each sum should come in 3 possibilities and hence three 0's and three 6's. -- Amol Sharma Final Year Student Computer Science and Engineering MNNIT Allahabad http://gplus.to/amolsharma99 http://twitter.com/amolsharma99http://in.linkedin.com/pub/amol-sharma/21/79b/507http://www.simplyamol.blogspot.com/http://facebook.com/amolsharma99 On Sat, Jul 7, 2012 at 12:52 AM, Hraday Sharma hradaysha...@gmail.comwrote: You are given 2 dice. Both are fair. One of the dice has no numbers printed on it. You have to label the unmarked dice such that when both the dice are thrown, the sum on the faces is evenly distributed between 1 and 12 . -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks]
l value - address r value - content of variable(value) ex- x=2 x has value and address but 2 has only value cout++x++ I think this will result into l error . PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Amazon interview question
array of bits? if the current integer is present set the bit if else make it zero, searching, insertion and deletion all in O(1) time. On Thu, May 24, 2012 at 4:15 PM, rishabh shukla rockrishabh.mn...@gmail.com wrote: Suggest a data structure for storing million trillion numbers efficiently in very less space. Means space complexity should be as less as possible -- Rishabh Shukla B.Tech Final Year MNNIT Allahabad -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] finding anagrams in a list of words
use trie trees, and for every word sort the word and store the sorted word in the trie tree and also keep the index of that word in leaf of trie tree..after traversing the whole list of words you'll have all the indices of a anagrams of a particular word in its leaf nodes. On Fri, May 11, 2012 at 5:24 PM, mayur mayursa...@gmail.com wrote: Hi all, I am stuck with a question for a long time...can someone provide the best algorithm for this.. Question).. find all the anagrams in a list of words. The algorithm should be efficient as the list can be very large. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/c4cSIMcBYLEJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] finding anagrams in a list of words
if asking me..yes !! On Fri, May 11, 2012 at 5:27 PM, Raghavendhra Chowdary MV raghavendhra20061...@gmail.com wrote: Is this amazon question buddy?? On Fri, May 11, 2012 at 5:24 PM, mayur mayursa...@gmail.com wrote: Hi all, I am stuck with a question for a long time...can someone provide the best algorithm for this.. Question).. find all the anagrams in a list of words. The algorithm should be efficient as the list can be very large. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/c4cSIMcBYLEJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks Regards, M.V.Raghavendhra Chowdary. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] How many games you will conduct to decide a winner for N players. Visualize in terms of a Data Structure.
Ya tournament tree is fine, you can even check it on http://www.geeksforgeeks.org/archives/11556 To decide a winner among N people, ( n-1 ) people should loose. So N-1 games will decide. On Mon, Apr 9, 2012 at 12:45 AM, SAMM somnath.nit...@gmail.com wrote: This can be done using Tournament Tree ... PLzz refer wiki or http://www.geeksforgeeks.org/archives/11556 ... This will surely help .. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Modified binary search
how can there be multiple spikes and valleys?? say 1 2 3 4 5 6 7 if you rotate it once with rotation index 3 4 5 6 7 1 2 3 then again with index 2 6 7 1 2 3 4 5 So the multiple times rotation just means that the index of rotation is more then 1. On Fri, Apr 6, 2012 at 7:02 AM, Ashish Goel ashg...@gmail.com wrote: code needed… not ble to visualize what to do if there are too many spikes and valleys in the multiple times rotated array, is that possible?? On Sep 28, 2011, at 1:36 AM, Gene wrote: Indeed you must be given that all the array elements are unique or at least that there are no more than floor(n/2) repeats). Otherwise this is impossible. The simplest way to think about it is first to search for i such that a[i] a[i+1]. At that point you know there are two sorted ranges a[0]..a[i] and a[i+1] to a[n-1], so you can use regular binary search on each of these pieces. So how to find i? This is itself a binary search. At each stage, check whether a[0] a[mid] and a[mid] a[n-1]. The half that passes this test contains i. So throw away the other. On Sep 27, 10:01 am, Decipher ankurseth...@gmail.com wrote: A given sorted array is rotated unknown number of times , write a C/C++ code to find an element in the sorted array in O(log n) time . I know the solution to this problem is through binary search , but don't know the exact solution . Please help !! -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Given an array A[1..n] of log n bit integers, sort them in-place in O(n) time
Can you please explain the question again. As what I understood according to me the question is size of array : n and the range of the elements present at each location is log n. On Wed, Apr 4, 2012 at 2:57 AM, Doom duman...@gmail.com wrote: Any ideas? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/aGzMcjTFcAYJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Area of a Self-intersecting Polygon in O(n) complexity
How would you find the area of a polygon in O(n) time? Of course thereis this way of using the formula, but it doesnt quite work out in case of Self intersecting polygons. One could maybe divide it into triangles and then solve it, but that'd require for one to sort the vertices first which would take O(n logn) time. Is there anyway one could maybe use preprocessing or any sort of transformations so as to obtain the area in O(n) time? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Vertical Sum in a given Binary Tree
Vertical sum is sum of all the nodes that are present in same horizontal distance from the root. In the example quoted by you the root 1 is at 0 Horizontal distance from root, while its children are both -1 and +1 distance from root. Now take the case of 1,5 and 6, 1 being the root is at 0 horizontal distance, 5 being the right child of 2 ( which is at -1 distance ) is again at -1 + 1=0 horizontal distance, similarly 6 will be at +1-1 =0 Horizontal distance. Hope that helps. Thanks and regards, Aman Raj On Sat, Mar 17, 2012 at 3:29 PM, rahul sharma rahul23111...@gmail.comwrote: what is vertical sum in binayr tree...i dnt need the algo for this..just need the concept...that what is vertical sum??? Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical lines. Examples: 1 / \ 2 3 / \/ \ 4 5 6 7 The tree has 5 vertical lines Vertical-Line-1 has only one node 4 = vertical sum is 4 Vertical-Line-2: has only one node 2= vertical sum is 2 Vertical-Line-3: has three nodes: 1,5,6 = vertical sum is 1+5+6 = 12 Vertical-Line-4: has only one node 3 = vertical sum is 3 Vertical-Line-5: has only one node 7 = vertical sum is 7 So expected output is 4, 2, 12, 3 and 7 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] COMPRO TECH INTERVIEW
HIII CAN ANY BODY TELL ME WHAT KIND OF PUZZLE ASKED IN COMPRO TECH INTERIVEW AUR WHAT R THE SUBJECT AND KIND OF QUEST. THEY ASKED IN COMPRO CAMPUS INTERVIEW IN DELHI PLZ ANSWER asap THANKS -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] [Combinatorics] count possible number of binary search trees, given number of nodes
It will be very helpful if u could tell me for binary search tree and binary tree both... PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Binary Search Tree Question
mirror of tree PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks]
choose greedy algorithm... in in minimum spanning tree.. PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: MS Question -Reverse a Linked List in size of 2
Steps: 1)Reverse the list ... 2)Now do the swap two nodes... consecutively... PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: MS Q
Idea: 1)Take count =0; 2) make Outer loop ...and search for 1's . 3) Start ...searching for 1 consecutively... and make it ..0 untill all consecutive 1's becomes 0.. and then count++ 4) go to 1) untill all 1's finished.. count will give the total number of islands... PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] anybody c output?
hello world must be o/p... but don't understand abt the o/p in ideone... PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: sort 2D array
This can be done... k way merge... c- number of columns r- number of rows In O(c*r*log(r)) PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: MS Q
name it. PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING On Wed, Jan 25, 2012 at 12:45 AM, atul anand atul.87fri...@gmail.comwrote: @Praveen : i have doubt in your algo...it seem it may fail for some cases... On Tue, Jan 24, 2012 at 5:59 PM, praveen raj praveen0...@gmail.comwrote: Idea: 1)Take count =0; 2) make Outer loop ...and search for 1's . 3) Start ...searching for 1 consecutively... and make it ..0 untill all consecutive 1's becomes 0.. and then count++ 4) go to 1) untill all 1's finished.. count will give the total number of islands... PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Amazon ques
Answer is already given in group search it... PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] suggest algo
Steps: 1) hashmapping and to keep track of value with its count.. 2)now put these elements in 2D array...m[r][2].r - number of different elements... 1st col...have... the value.. 2nd col...have ..the frequency.. 3) Now run the randomized partition...and find (n-k)th smallest according to frequency.take k elements... below it...have most frequent elements PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Longest sequence of numbers with atmost diff K
this is like a DP problem to me 1) build a 2 D array . 2) store If difference b/w any two number is = K then M[i,j]=1 else M[i,j]=0 3) Now find max size square (containing all ones) by using Dynamic Programming. PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Generate all possible binary trees given in-order traversal
int countBT(int N)
{
int count =0;
int count1;
if(N==0)
return 0;
if(N=1)
return 1;
else
{
for(int j=1;j=N;j++)
{
count1 = countBT(j-1)
count2 =countBT(N-j);
count+=(count1*count2);
}
return (count);
}
}
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Generate all possible binary trees given in-order traversal
yes... right...
i forget to remove this statement..
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
On Fri, Dec 30, 2011 at 2:17 PM, Lucifer sourabhd2...@gmail.com wrote:
@praveen
I think what u are doing above is the following:
Say, F(n) denotes the no. of binary trees that can be formed using N
elements given the inorder sequence..
F(n) = SumOver(i= 1 to N) { F(i-1) * F(N-i) }
which is nothing but..
F(N) = (2n C n)/ (n+1) i.e. catalan's no.
Also, i would like to mention that in ur code probably u need to
remove the following condition otherwise u result outcome will always
be zero..
*
if(N==0) return 0;
On 30 Dec, 13:41, praveen raj praveen0...@gmail.com wrote:
int countBT(int N)
{
int count =0;
int count1;
if(N==0)
return 0;
if(N=1)
return 1;
else
{
for(int j=1;j=N;j++)
{
count1 = countBT(j-1)
count2 =countBT(N-j);
count+=(count1*count2);
}
return (count);
}
}
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Find even length palindrome.
The Question is: whther there exist a even length pallindrome or not since for even ... the two consecutive character will be equal... so find two character which are equal.. consecutively.. PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: amazon ques
IT will grt help for me... if u all tell me.. mapstring,int m; m[topcoder]=2 My question is this: Is 2 is an key value??or index value of hash table...??... kindly explain how actual mapping is done... in hash table...plz... PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING On Tue, Dec 27, 2011 at 9:00 PM, Jagannath Prasad Das jpdasi...@gmail.comwrote: @shashank and @samm: Is the deletion and searching is o(1). I doubt On Sat, Oct 1, 2011 at 6:30 PM, SAMM somnath.nit...@gmail.com wrote: Yaa it will work , but in case of deletion don't u think array will not as efficient as linked list becoz array is Static we need to define the memory b4 hand.. On 10/1/11, WgpShashank shashank7andr...@gmail.com wrote: @All Why don't try with combination of* hash-table Array* , It Will Work , try it out :P Thanks Shashank Mani CSE, BIT Mesra -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/v_MplK3KzegJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Somnath Singh -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Frequency Sort Algo
steps: 1) use hash mapping to keep track of frequency of each and every element. 2)Then iterate hash table and store in 2D array with 1st column(element value) and 2nd column(frequency of element value). 3)sort the row according to second column(i.e frequency). 4)Then Print the element row wise.. . PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Obstacle Avoidance
Procedure: 1.if out of boundary return 0; 2.If reach final point return 1. 3.if(next point has no obstacle then go for it.. recursively) PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Find even length palindrome.
@atul I am not sure whether I got ur question correctly.If you only want to check whether an even palindrome exist or not,then u can check for whether adjacent characters are same or not.It is very simple.If you want the longest string then its gets difficult.Same algo can be also used for presence of odd palindrome with minor modification.Here u take each character and chk whether both of its neighbors are same.Both are O(n) -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/8H0NSrsEJ5IJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Find even length palindrome.
@atul If we need to find the longest palindrome whether even or odd we can use DP.The recursion can look this: LP(i,j) = max( LP(i+1,j),LP(i,j-1) if(string[i]!=string[j]) max( LP(i+1,j),LP(i,j-1),LP(i+1,j-1)+1 ) else Note : Do LP(i+1,j-1)+1 only if it returns value equal to j-1.So that we can add adj characters also as they will be continuous The time will be O(n^2) and space also O(n^2).You can optimize space to O(n). Correct me if I am wrong. @Lucifier I didnt understand ur algo -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/J8hZJllMTfgJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Frequency Sort Algo
Hashmapping O(n) On 25-Dec-2011 2:15 AM, sravanreddy001 sravanreddy...@gmail.com wrote: any better approach than O(N log N) time? maintain a heap of nodes value, count for each element, if already present increase the count. Else add the elements. Max-Heap -- fetch the node, print it count number of times, (time to search in heap -- log N) doing this for N elements. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/rJMBHTFmv8IJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: doubt in TSUM
@shamm:it means if we want for triplet do we nd 2 go for 3 time multiplication of polynomial and den division of coefficient by 3.. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: doubt in spoj 8473 ways
@saurav: if you dnt mind cn i c ur code...like earlier your post was also related to f(n) bt it wz out f d limit -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] doubt in spoj 8473 ways
#includestdio.h
#define s(n) scanf(%d,n)
#define I int
I a[14][14];
I d(I m,I n)
{
I s=a[m][n];
I k;
if(!m||!n)
k=1;
else if(s)
k=s;
else
{
k=d(m-1,n)+d(m,n-1);
s=k;
}
return k;
}
main()
{
I t,n,k;s(t);
while(t--)
{
s(n);
k=d(n,n);
printf(%d\n,k);
}
}
@saurav:this is the actual and very simple code...may be u cn
reduce its no of bytesits simple dp approach...tnx
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: doubt in TSUM
@samm:tnx dude lemme first chk it...den i wl b able 2 discuss it further. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: doubt in spoj 8473 ways
@samm:i hv googled it several time bt by code no path r ways as a tag bt cudnt get ne link..cn u plz paste the link here.i jst want 2 do ittnx in advnce -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: doubt in TSUM
@samm:you are checking for each sum between min sum and max sum in each
loop we are skipping several triplets(sum) which hai intermediate
sum..this is also a o(n^3) brute-force almost...i have written
a code jst c it .can u think in this direction so dat we wl b able
to cum on a right code.this is efficient but it is skipping some
cases..jst think on sum part so that we can get sum widout using
loop.tnx
#includeiostream
#includecstring
#includealgorithm
using namespace std;
main()
{
int n;
int a[40001],b[60001];
memset(b,0,sizeof(b));
cinn;
for(int i=0;in;i++)
cina[i];
sort(a,a+n);
int max=-60001;
for(int i=0;in-2;i++)
{
int l=i+1;
int h=n-1;
int k;
while(lh)
{
k=a[l]+a[h]+a[i];
b[k]++;
if(maxk)
max=k;
l++;
}
l=i+1;
h=n-2;
while(lh)
{
k=a[l]+a[h]+a[i];
b[k]++;
if(maxk)
max=k;
h--;
}
}
for(int i=0;i=max;i++)
if(b[i])
couti : b[i]\n;
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: doubt in TSUM
hey dude jst paste the link of ways(paths-120 bytes) you told its on google but i cudnt find it.tnx -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] doubt in spoj .9529. Maya Calendar MAYCA
this is my almost working code for spoj mayca ...can anyone suggest me
anytest cases.for which it is not working.tnx in advance
#includeiostream
#includecstdio
#includecstring
using namespace std;
char
maya[][10]={pop,no,zip,zotz,tzec,xul,yoxkin,mol,chen,yax,zac,ceh,mac,kankin,muan,pax,koyab,cumhu,uayet};
char
tzoklin[][10]={imix,ik,akbal,kan,chicchan,cimi,manik,lamat,muluk,ok,chuen,eb,ben,ix,mem,cib,caban,eznab,canac,ahau};
int search(char*x)
{
for(int i=0;i20;i++)
if(strcmp(x,maya[i])==0)
return i;
}
main()
{
int t;
char a[30];
char b[10];
scanf(%d\n,t);
while(t--)
{
int d,y;
gets(a);
sscanf(a,%d.%s%d,d,b,y);
int m=search(b);
int dt;
if(m18)
dt=y*365+search(b)*20+d+1;
else
dt=y*365+18*20+d+1;
int ye=dt/260;
int x,p,n;
p=dt%260;
if(p%13)
x=p%13;
else x=13;
n=p%20;
coutx' 'tzoklin[n-1]' 'ye\n;
}
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: SPOJ . 10186.PUCMM025
hey ,i got the bug and got AC ALSO..there was several bugs ...sry ,for silly dbt -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: doubt in TSUM
shashank.dude the algorithm whch u suggested in the morning for tsum ...hv u tried it wid urself bcoz wid the wiki link method if we wl sort the array den wat b the delimiter so that ,i wl get get all combination of 3 .in dat method dat wz given for sum of three number equal to zero so we are checking for specific cases of 3 number sets..bt here we want all possible sets of 3 so hw it wl b possible to have it widout using n^3. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] doubt in spoj 8473 ways
we have to submit it in 120 byte cn ne 1 tl me dat whr z the chances of
further byte reduction in this code.
#includestdio.h
#define s(n) scanf(%d,n)
#define I int
I a[14][14];I d(I m,I n){I s=a[m][n];I k;if(!m||!n)k=1;else
if(s)k=s;else{k=d(m-1,n)+d(m,n-1);s=k;}return k;}main(){I
t,n,k;s(t);while(t--){s(n);k=d(n,n);printf(%d\n,k);}}
tnx in advnce
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] doubt in TSUM
hey guys ,i am trying to solve TSUM ..on spoj... http://www.spoj.pl/problems/TSUM/.in which we have to find the sum of any triplets in n numbers.can any one suggests me any approach other than brute-force of (n^3).. ..thanks in advance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: doubt in TSUM
HEY DUDE TNX FOR THE REPLY .CAN YOU PASTE ME THE LINK FOR THAT WIKI PAGE. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] NUMBER OF MST ?
N!/2 On 03-Dec-2011 11:30 PM, Dipit Grover dipitgro...@gmail.com wrote: ^ we need to count each permutation and its reverse together as one possibility since both would result in identical mst. -- Dipit Grover B.Tech in Computer Science and Engineering - lllrd year IIT Roorkee, India -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Finding Maximum subarray in a circle
This can be done by kadanes algo..
//suppose n numbers has been stored in array
// i is the intial point
// n is the number of points to be considered in O(n)
int maxsum(int a[], int N,int i,int n)
{
int max=0;
int max_end_ here =0;
int max_so_far=0;
for(int j=i;jN;j++)
{
if(j==N)
{ j=0;
N=n-(N-i);
}
if(maxa[j])
max=a[j];
}
if(max0) // // check Is there any positive value or notif not then
return max value..could be least negative number
{
for(int j=i;jN;j++) //
{
if(j==N)
{ j=0;
N=n-(N-i);
}
max_end_ here= max_end_ here+a[j];
if(max_end_ here0)
max_end_ here=0;
if(max_so_farmax_end_ here)
max_so_far= max_end_ here
}
}
else
{ max_so_far=max; // return max value..could be least negative number
}
return (max_so_far);
}
With regards,
Praveen Raj
DCE-IT
735993
praveen0...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Microsoft Question
Priority Queue:
when popped ... returns the max priority element and if the priorities
of two or more elements are same...then they will popped as they are
inserted ..
when pushed the element : puts the element in the list according to the
priority...
For making priority queue into Queue::
on popping : make priority of every element same... so on popping... the
element...(popped according to which they are inserted)
on pushing : insert the element as same priority as other inserted
elements
For making priority queue into stack..:
make priority of elements in increasing order... .. so on popping the
element... will pop the topmost element(with the highest priority
value)..
on pushing the element... push the element... with the priority value more
than topmost priority value...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Thu, Sep 15, 2011 at 6:37 PM, Yogesh Yadav medu...@gmail.com wrote:
For Stack:
just make a structure:
struct stack_with_priorityqueue
{
int num;
int priority;
struct stack_with_priorityqueue *ptr;
}
now when we add another number just increase the priority... priority++
For Queue:
do same...just decrease priority...priority--
...
On Wed, Sep 14, 2011 at 4:41 PM, bharatkumar bagana
bagana.bharatku...@gmail.com wrote:
The well known examples of priority queue is minheap and maxheap..
i guess the question is how do we implement one of these(at least) using
queue?
On Wed, Sep 14, 2011 at 9:08 AM, Ankuj Gupta ankuj2...@gmail.com wrote:
I guess the functionality of priority should be maintained
On Sep 13, 11:59 pm, Ankur Garg ankurga...@gmail.com wrote:
But dude are u saying stack will be implemented as a map with
value,priority
and then choose element based on priority ?
regards
Ankur
On Tue, Sep 13, 2011 at 10:16 PM, Ankuj Gupta ankuj2...@gmail.com
wrote:
For stack :- Keep incrementing the priority of each pushed element.
So
the last pushed element will have the greatest priority and the
element pushed first will have
lowest priority.
For queue:- keep decrementing the priority of each inserted element.
On Sep 13, 1:45 am, Ankur Garg ankurga...@gmail.com wrote:
How to Implement a Queue with a Priority Queue
Similarly how woud you implement Stack with Priority Queue
--
You received this message because you are subscribed to the Google
Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
**Please do not print this e-mail until urgent requirement. Go Green!!
Save Papers = Save Trees
*BharatKumar Bagana*
**http://www.google.com/profiles/bagana.bharatkumarhttp://www.google.com/profiles/bagana.bharatkumar
*
Mobile +91 8056127652*
bagana.bharatku...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] A logical Question
amount displaced by (boat +man + suitcase) = amount displaced by (boat+man) + amount displaced by suitcase therefore no change of level... With regards, Praveen Raj DCE-IT 3rd yr 735993 praveen0...@gmail.com On Thu, Sep 15, 2011 at 4:24 PM, hary rathor harry.rat...@gmail.com wrote: no increase or no decrease -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Finding connection b/w 2 profiles
@jitesh rightly said... since there is no limit of depth... we can go for BFS.. we can reduce space by comparing A's and C's profile... whatever is common ... we can use it to find connection... between A and C With regards, Praveen Raj DCE-IT 3rd yr 735993 praveen0...@gmail.com On Wed, Sep 14, 2011 at 4:31 PM, JITESH KUMAR jkhas...@gmail.com wrote: Using DFS we can stuck in the blind ally as there is not limit of depth.. On Wed, Sep 14, 2011 at 4:16 PM, tech coder techcoderonw...@gmail.comwrote: we can also use dfs and find if there exist path between given two nodes(profiles here). if yea , there is a connection b/w two profiles. On Wed, Sep 14, 2011 at 1:58 PM, Azhar Hussain azhar...@gmail.comwrote: Union Find Algorithm would do - Azhar. On Wed, Sep 14, 2011 at 1:42 PM, JITESH KUMAR jkhas...@gmail.comwrote: Neither depth is known nor we have to find the shortest path. We just have to find the path. -- *Regards Jitesh Kumar * -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- *Regards Jitesh Kumar There is only one 'YOU' in this world. You are Unique and Special. * *Don't Ever Forget it.* -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] pgm2
if length is even : then every element must occurs even times if length is odd : then every element must occurs even times except one element occurs odd... With regards, Praveen Raj DCE-IT 735993 praveen0...@gmail.com -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] explain the output..!!
grt :) With regards, Praveen Raj DCE-IT 3rd yr 735993 praveen0...@gmail.com -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Exchanging bit values in a number
int func(int x)
{
int y=(1i)+(1j);
int z=xy;// if after bitwise and ..we get power of 2 then ...
we have to flip the bits..
if((z(z-1))==0)
return(x^y);
else
return x;
}
With regards,
Praveen Raj
DCE-IT
735993
praveen0...@gmail.com
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Modified binary search
+1 Gene With regards, Praveen Raj DCE-IT 3rd yr 735993 praveen0...@gmail.com On Wed, Sep 28, 2011 at 1:36 AM, Gene gene.ress...@gmail.com wrote: Indeed you must be given that all the array elements are unique or at least that there are no more than floor(n/2) repeats). Otherwise this is impossible. The simplest way to think about it is first to search for i such that a[i] a[i+1]. At that point you know there are two sorted ranges a[0]..a[i] and a[i+1] to a[n-1], so you can use regular binary search on each of these pieces. So how to find i? This is itself a binary search. At each stage, check whether a[0] a[mid] and a[mid] a[n-1]. The half that passes this test contains i. So throw away the other. On Sep 27, 10:01 am, Decipher ankurseth...@gmail.com wrote: A given sorted array is rotated unknown number of times , write a C/C++ code to find an element in the sorted array in O(log n) time . I know the solution to this problem is through binary search , but don't know the exact solution . Please help !! -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: FACEBOOK ONLINE CODING ROUND
logic: N=3.. k=5th(position).length... no. of setbit :0... 000 k =5 no. of setbit :1.. on every loop get next number of same number of bits and decrement k by 1. 001k = 4 010k=3 100k= 2 no. of setbit: 2 011 k=1.. 101 110 Therefore answer is 011 complexity : O(n)... With regards, Praveen Raj DCE-IT 735993 praveen0...@gmail.com -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: FACEBOOK ONLINE CODING ROUND
code::
#include stdio.h
#includeconio.h
void check(int count, int k,int max)
{
int right,leftmost,rightmost;
if(k==1)
return;
right=count(-count);
leftmost=count+right;
rightmost=count^leftmost;
rightmost=rightmost/right;
rightmost=rightmost2;
count=leftmost|rightmost;
if(count=max)
return;
k=k-1;
check(count,k,max);
}
void func(int n,int k)
{
int count =1,j,max;
if(k==1)
printf(%d\n,0);
else
{
k=k-1;
for(int i=1;i=n;i++)
{
count=1;
j=1;
max=1n;
while(j!=i)
{count=(count1)+1;
j++;
}
check(count,k,max);
if(k==1)
{ printf(%d\n,count);
break;
}
else
k=k-1;
}
}
}
int main()
{
func(7,127);//left for N0 and and right for K..chech for any other
values
getch();
return 0;
}
Tell me .. if u find any test cases failed...Thankx...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Wed, Oct 26, 2011 at 1:56 PM, praveen raj praveen0...@gmail.com wrote:
made it.. :)
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Tue, Oct 25, 2011 at 11:13 AM, raju nikutel...@gmail.com wrote:
@icy
It's still there except that you'll get a different question.
That page promises you a telephone interview if you solve the challenge
but I don't know how true that is for non-US guys ..
i solved one question two weeks back .. and no one contacted me till now
..
~raju
On Tue, Oct 25, 2011 at 3:27 AM, icy` vipe...@gmail.com wrote:
is this contest still going? if so, where ? i have a solution that
does
(100, 1267650600228229401496703205376 )(just one hundred 1's)
in 0.03 seconds in an older ruby on an older pc
I'd like to submit ;P
On Oct 21, 10:48 pm, sunny agrawal sunny816.i...@gmail.com wrote:
yea i know 1st Approach is much better and is Only O(N^2) for
precomputing all the values for nck and then O(k) for finding no of
bits set in The Kth number and another loop of O(k) to find the
required number
i posted 2nd approach in the context to vandana's tree approach of
sorting 2^N numbers, rather simply sort the numbers in the array...
and this approach is O(N*2^N)
On 10/21/11, sravanreddy001 sravanreddy...@gmail.com wrote:
@Sunny.. why do we need an O(2^N) complexity?
for a value of N=40-50, the solution is not useful..
but, your 1st approach is lot better and i have got it too..
1. O(N) complexity to search the k. (k bits in the numbers) x-
(sigma 1-k
(n C i))
2. again, keep substracting (k-i) for i= 0-k-1 so.. O(k) here
and recursively performing step 2. (worst case complexity is O(T))
where T = nCk
O(N) + O(T) == O(T) as it dominates the given number. unless it
doesn't
fall in the range.. or equivalently -- max( O(T), O(N) )
--
You received this message because you are subscribed to the Google
Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/NJR9l-UB7c8J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Sunny Aggrawal
B.Tech. V year,CSI
Indian Institute Of Technology,Roorkee
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Amazon OS question
good question.. With regards, Praveen Raj DCE-IT 3rd yr 735993 praveen0...@gmail.com On Tue, Sep 27, 2011 at 6:40 AM, Kunal Patil kp101...@gmail.com wrote: Nice question nice answer... :) On Tue, Sep 27, 2011 at 6:25 AM, UTKARSH SRIVASTAV usrivastav...@gmail.com wrote: what's the algo of this question On Mon, Sep 26, 2011 at 2:38 PM, vikas vikas.rastogi2...@gmail.comwrote: simple graph question, graph is given as list , just check the dependancy On Sep 25, 6:25 pm, siva viknesh sivavikne...@gmail.com wrote: thanks a lot yogesh... On Sep 25, 2:23 pm, Yogesh Yadav medu...@gmail.com wrote: T1-T2-T3-T6 T1-T2-T4-T7 T1-T2-T5-T8 2 Processor: (T1-T2) ..2 TS (T3T4)...1 TS (T6T5)...1 TS (T7T8)...1 TS 4 Processor (T1-T2) ..2 TS (T3T4T5)...1 TS (T6T7T8)...1 TS . On Sun, Sep 25, 2011 at 2:33 PM, siva viknesh sivavikne...@gmail.comwrote: plz give detailed explanation On Sep 25, 1:58 pm, siva viknesh sivavikne...@gmail.com wrote: can u plz giv the sequence On Sep 25, 11:36 am, Sanjay Rajpal srn...@gmail.com wrote: yah rite answer would be 5 and 4 resp. Sanju :) On Sat, Sep 24, 2011 at 10:04 PM, Dheeraj Sharma dheerajsharma1...@gmail.com wrote: 5 4? On Sun, Sep 25, 2011 at 9:33 AM, sivaviknesh s sivavikne...@gmail.comwrote: A parallel program consists of 8 tasks – T1 through T8. Each task requires one time step to be executed on a single processor. Let X - Y denote the fact that task X must be executed before task Y is executed. Suppose only the tasks X, Y are to be executed. On any multiprocessor machine it would require at least 2 time steps since in the first step X could be executed, and Y could be executed in the next time step (since it requires X to complete first). Now, suppose the following dependencies exist between the tasks T1 – T8: T1 - T2 T2 - T3 T3 - T6 T2 - T4 T4 - T7 T2 - T5 T5 - T8 What is the minimum number of time steps required to execute these 8 tasks on a 2 processor machine and a 4 processor machine? a)4 2 b)5 2 c)5 4 d)6 2 -- Regards, $iva -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- *Dheeraj Sharma* Comp Engg. NIT Kurukshetra -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- *UTKARSH SRIVASTAV CSE-3 B-Tech 3rd Year @MNNIT ALLAHABAD* -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email
Re: [algogeeks] adobe question help
N=(N( (~0j) | (~(1i))) | (Mi) With regards, Praveen Raj DCE-IT 735993 praveen0...@gmail.com On Tue, Oct 25, 2011 at 11:46 AM, Bittu Sarkar bittu...@gmail.com wrote: N = (N | ((1(j-i+1)-1)i) (Mi); On 12 October 2011 01:22, prasad jondhale jondhale.pra...@gmail.comwrote: grt -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Bittu Sarkar 5th Year Dual Degree Student Department of Computer Science Engineering Indian Institute of Technology Kharagpur -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Questions on Hashing ...Share ur ideas...
problem 4.. good question...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Tue, Oct 25, 2011 at 5:57 PM, kumar raja rajkumar.cs...@gmail.comwrote:
Problem 1: Remove duplicate elements from an unsorted array of size N
Problem 2: Find intersection of K unsorted array of N elements each.
Intersection consists of elements that appear in all the K arrays.
Problem 3: How to make a linked list support operations in O(1) time. The
operations on linked list can be insertion after any arbitrary valued node,
deletion of any arbitrary valued node
Problem 4: Find all unique pairs of element in an array that sum to S. For
ex. If array = {2,4,6,4,6} and S = 8 then answer is {2,6, 4,4}
Problem 5: Consider an array containing unique elements. Find a triplet of
elements in the array that sum to S (extension of problem 4). Can hashtables
improve the running time of your algorithm.
Problem 6: Consider two strings of size M, N. Perform string matching in
size O(M+N).
Problem 7: Find top K most frequent elements in an array of size N.
Problem 8: Given a file with N integers. Find top K most frequent
integers. Assume N to be very large such that all the N numbers cannot fit
into memory. Design for the worst case.
--
Regards
Kumar Raja
M.Tech(SIT)
IIT Kharagpur,
10it60...@iitkgp.ac.in
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Amazon Onsite
I will choose the point where amount of fuel is maximum choose the shortest path from two direction (clockwise or anticlockwise).. With regards, Praveen Raj DCE-IT 3rd yr 735993 praveen0...@gmail.com On Mon, Oct 24, 2011 at 4:36 PM, Aniket aniket...@gmail.com wrote: Suppose there is a circle. You have five points on that circle. Each point corresponds to a petrol pump. You are given two sets of data. 1. The amount of petrol that petrol pump will give. 2. Distance from that petrol pump tp the next petrol pump. (Assume for 1 lit Petrol the truck will go 1 km) Now calculate the first point from where a truck will be able to complete the circle. (The truck will stop at each petrol pump and it has infinite capacity). Give o(n) solution. You may use o(n) extra space. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] K-best assignment problem
Its like a queen problem ...with row and column are not same.. With regards, Praveen Raj DCE-IT 3rd yr 735993 praveen0...@gmail.com On Tue, Oct 18, 2011 at 12:06 AM, Don dondod...@gmail.com wrote: Given a cost matrix with N columns and M rows such that M=N, find the K lowest total cost ways to select one item from each column, with the restriction that only one item may be selected from any row. Don -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] choosing numbers
for 3 set .. set value stored in array a[3] and p is the sum
for( i=0;i=a[0];i++)
{
for(j=0;j=a[1];j++)
{
for(k=a[2];k=0;k--)
{
if((i+j+k)p) // improve running time
break;
if((i+j+k)==p)
coutijk;
}
}
}
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Mon, Oct 24, 2011 at 3:00 AM, Piyush Kapoor pkjee2...@gmail.com wrote:
Suppose u choose ith element from the Kth set,then
dp[K][Sum]=sum(from i=0 to number of elements in the Kth set)
dp[K-1][Sum-(ith element of Kth set)]
On Sun, Oct 23, 2011 at 3:31 PM, cegprakash cegprak...@gmail.com wrote:
hi i recently came across this problem..
there are K sets
each sets can contain n numbers from 0 to n
we've to choose exactly one number from each set
the sum of all the elements that we chose should be equal to P.
we have to find how many such possibilities are there to choose so..
for example
assume there are 3 sets containing 1,2,3 elements in them
so the first set contains 0 and 1
second set contains 0,1 and 2
third set contains 0,1,2 and 3
assume P=2
in this case there are 5 possibilities
(0,0,2), (0,1,1), (0,2,0), (1,0,1), (1,1,0)
i'm struggling for a DP solution!! help me out
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Regards,*
*Piyush Kapoor,*
*2nd year,CSE
IT-BHU*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Amazon Question - Find Pythagorean triplet in an unsorted array
N2 would me minimum On 13-Oct-2011 11:08 PM, ravindra patel ravindra.it...@gmail.com wrote: Hi, Another question I faced in Amazon F2F. Given an unsorted array of integers, find all triplets that satisfy x^2 + y^2 = z^2. For example if given array is - 1, 3, 7, 5, 4, 12, 13 The answer should be - 5, 12, 13 and 3, 4, 5 I suggested below algo with complexity O(n^2) - - Sort the array in descending order. - O(nlogn) - square each element. - O(n) Now it reduces to the problem of finding all triplets(a,b,c) in a sorted array such that a = b+c. The interviewer was insisting on a solution better than O(n^2) which I dont think is feasible, but I couldn't prove that. Anyone has any idea. Thanks, - Ravindra -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] IVY comptech????
someone please reply -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] citrix question
* Which of the following restricts a process to the memory allocated to it* * *a. stack pointers b. memory allocation hardware c. kernel d. none of these what's the answer of this question -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] citrix question
Kernel. On 08-Oct-2011 11:33 AM, raj kumar megamonste...@gmail.com wrote: * Which of the following restricts a process to the memory allocated to it * * *a. stack pointers b. memory allocation hardware c. kernel d. none of these what's the answer of this question -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] citrix question
Plz put more question that has beem asked in citrix. On 08-Oct-2011 11:33 AM, raj kumar megamonste...@gmail.com wrote: * Which of the following restricts a process to the memory allocated to it * * *a. stack pointers b. memory allocation hardware c. kernel d. none of these what's the answer of this question -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Help sourcebit !!!
Plz put the technical written paper pattern ...of sourcebit... and some sample papers...of what type of questions(level) would be asked... -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Number of Multiplications
Make two conditions for even and odd power. and use it to make solve
higher power
That could be solved in log b time
.
On 30-Sep-2011 4:12 AM, Dave dave_and_da...@juno.com wrote:
@Don, Ankuj. I believe that Don's algorithm uses precisely
floor{log_2(b)) + (the number of one bits in b) - 1.
Dave
On Sep 29, 1:38 pm, Don dondod...@gmail.com wrote:
Because a^b = (a*a)^(b/2), so each multiplication reduces the exponent
by half. Therefore the number of multiplications is (roughly) log2 b.
int pow(int a, int b)
{
int result = a;
while(b 1)
{
result *= (b1) ? a*result : result;
b = 1;
}
return result;
}
You can see that a^16 will require 4 multiplications, which is
log2(16), but a^15 will require 6 multiplications (an alternative
algorithm could do it in 4 multiplications and a division).
Also note that the function above is only correct for b 0.
Don
On Sep 29, 12:54 pm, Ankuj Gupta ankuj2...@gmail.com wrote:
How do you deduce number of multiplication that when we perform a^b
function using dividing the exponent by 2 at each stage to be log b?-
Hide quoted text -
- Show quoted text -
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Amazon - array problem
Take two array... one will take care of left products... and othr will take care of right product.. at any index left[i]=A[i-1]*left[i-1] starting from left and right[i]= A[i+1]*right[i+1] starting frm right…… -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Infinite Array
@don we dnt hve ny info about arrangement... -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Explain output
Ptr cannot be used to allocate block of memory .. void pointer use only to store address... -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Directi Questions - needed answers
@nitin Plz explain how u have reached answer of question no. 4 and 6 On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com wrote: Answer 3 - 100 Answer 6 - 103 Answer 4 - 194 total processes including the parent Answer 7 - 12 km south, 12 km east On Sun, Sep 18, 2011 at 11:53 PM, Ashima . ashima.b...@gmail.com wrote: @malay: how cm n+logn-2? cn u explain the logic ? Ashima M.Sc.(Tech)Information Systems 4th year BITS Pilani Rajasthan On Sun, Sep 18, 2011 at 11:07 AM, Ashima . ashima.b...@gmail.com wrote: rite! 62.5% Ashima M.Sc.(Tech)Information Systems 4th year BITS Pilani Rajasthan On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti m1234...@gmail.com wrote: create a tournament tree.in each round one value is eliminated to obtain in the process the winner or the highest value in n-1 comparisons. Then check the queue of the winner which contains log(n) entries of the values beaten by the winner which implicitly will contain the runners up.Then log(n)-1 comparisons to find the highest among all the losers whom the winner had beaten. So all over complexity will be n-1 +log(n) -1 = n+log(n)-2. Hp that answers ur query. nice question btw :) On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI viharri@gmail.com wrote: hey i'm also thinking n + logn -2.. but couldnt able to figure out how??? can you please explain the logic -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Nitin Garg Personality can open doors... but only Character can keep them open -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Directi Questions - needed answers
For question 2 see ashima link.
On 19-Sep-2011 1:43 PM, Nitin Garg nitin.garg.i...@gmail.com wrote:
Can someone tell answers to question 2 and 5 with explanation??
On Mon, Sep 19, 2011 at 1:40 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
In Question 4 i just kept counting new processes that are being added in
every iteration.
No. of new processes being created is equal to the already running no. of
even pid processes.
Time - PId
0 - 0 1
1 - 0,12
2, - 0,1,23
3, - 0,1,2,3,4 5
4 - 0,1,2,3,4,5,6,7 8
.
.
.
1,2,3,5,8,11,17,25,38,57,86,129,194
I kept counting, got 194.
Don't know of any shortcut.
On Mon, Sep 19, 2011 at 1:35 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Question 6 -
Intuitively you can see that the greater the sum is, the greater the
favorable events in sample space.
e.g. - sum = 1 .. cases {(1)} Pr = 1/6
sum = 2 cases {(2),(1,1)} Pr = 1/6 + 1/36
sum = 3cases {(3),(2,1)(1,2)(1,1,1)} Pr = 1/6 + 1/36 +1/36
+ 1/216
for a more formal proof, look at the recursion -
P(k) = (P(k-6) + P(k-5) + P(k-4)... P(k-1)))/6
where P(0) = 1, P(i) = 0 for i0
Base case -
P(2) P(1)
Hypothesis -
P(i) P(i-1) for all i = k
To prove
P(k+1) P(k)
Proof
P(k+1) - P(k) = (P(k) - P(k-6))/6 0
On Mon, Sep 19, 2011 at 1:04 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Question 3 -
To eliminate one player, you need to host atleast 2 matches and make
him loose in both 2. These 2 matches can not contribute to elimination of
any other player.
So, min 2 matches for every player who is to be eliminated, hence 100.
On Mon, Sep 19, 2011 at 11:54 AM, Bhanu Chowdary
bhanuchowd...@gmail.com wrote:
@Nitin: Answer to question 3 is 50.
On Mon, Sep 19, 2011 at 11:44 AM, praveen raj praveen0...@gmail.com
wrote:
@nitin Plz explain how u have reached answer of question no. 4 and 6
On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Answer 3 - 100
Answer 6 - 103
Answer 4 - 194 total processes including the parent
Answer 7 - 12 km south, 12 km east
On Sun, Sep 18, 2011 at 11:53 PM, Ashima . ashima.b...@gmail.com
wrote:
@malay: how cm n+logn-2?
cn u explain the logic ?
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Sun, Sep 18, 2011 at 11:07 AM, Ashima . ashima.b...@gmail.com
wrote:
rite! 62.5%
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti
m1234...@gmail.com wrote:
create a tournament tree.in each round one value is eliminated
to obtain in the process the winner or the highest value in n-1 comparisons.
Then check the queue of the winner which contains log(n) entries of the
values beaten by the winner which implicitly will contain the runners
up.Then log(n)-1 comparisons to find the highest among all the losers whom
the winner had beaten. So all over complexity will be n-1 +log(n) -1 =
n+log(n)-2. Hp that answers ur query. nice question btw :)
On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI viharri@gmail.com
wrote:
hey i'm also thinking n + logn -2.. but couldnt able to figure
out
how??? can you please explain the logic
--
You received this message because you are subscribed to the
Google Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the
Google Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Nitin Garg
Personality can open doors... but only Character can keep them
open
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks
Re: [algogeeks] Re: Directi Questions - needed answers
Given in the question
.
On 19-Sep-2011 2:57 PM, Bhanu Chowdary bhanuchowd...@gmail.com wrote:
@Nithin: Sorry I did not understand your logic!! If a person looses a
match
he should be knocked out of the tournament. Could you please explain why 2
matches to knock out a person??
On Mon, Sep 19, 2011 at 2:47 PM, praveen raj praveen0...@gmail.com
wrote:
For question 2 see ashima link.
On 19-Sep-2011 1:43 PM, Nitin Garg nitin.garg.i...@gmail.com wrote:
Can someone tell answers to question 2 and 5 with explanation??
On Mon, Sep 19, 2011 at 1:40 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
In Question 4 i just kept counting new processes that are being added
in
every iteration.
No. of new processes being created is equal to the already running no.
of even pid processes.
Time - PId
0 - 0 1
1 - 0,1 2
2, - 0,1,2 3
3, - 0,1,2,3,4 5
4 - 0,1,2,3,4,5,6,7 8
.
.
.
1,2,3,5,8,11,17,25,38,57,86,129,194
I kept counting, got 194.
Don't know of any shortcut.
On Mon, Sep 19, 2011 at 1:35 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Question 6 -
Intuitively you can see that the greater the sum is, the greater the
favorable events in sample space.
e.g. - sum = 1 .. cases {(1)} Pr = 1/6
sum = 2 cases {(2),(1,1)} Pr = 1/6 + 1/36
sum = 3 cases {(3),(2,1)(1,2)(1,1,1)} Pr = 1/6 + 1/36 +1/36
+ 1/216
for a more formal proof, look at the recursion -
P(k) = (P(k-6) + P(k-5) + P(k-4)... P(k-1)))/6
where P(0) = 1, P(i) = 0 for i0
Base case -
P(2) P(1)
Hypothesis -
P(i) P(i-1) for all i = k
To prove
P(k+1) P(k)
Proof
P(k+1) - P(k) = (P(k) - P(k-6))/6 0
On Mon, Sep 19, 2011 at 1:04 PM, Nitin Garg
nitin.garg.i...@gmail.com
wrote:
Question 3 -
To eliminate one player, you need to host atleast 2 matches and make
him loose in both 2. These 2 matches can not contribute to elimination of
any other player.
So, min 2 matches for every player who is to be eliminated, hence
100.
On Mon, Sep 19, 2011 at 11:54 AM, Bhanu Chowdary
bhanuchowd...@gmail.com wrote:
@Nitin: Answer to question 3 is 50.
On Mon, Sep 19, 2011 at 11:44 AM, praveen raj
praveen0...@gmail.com
wrote:
@nitin Plz explain how u have reached answer of question no. 4 and
6
On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Answer 3 - 100
Answer 6 - 103
Answer 4 - 194 total processes including the parent
Answer 7 - 12 km south, 12 km east
On Sun, Sep 18, 2011 at 11:53 PM, Ashima .
ashima.b...@gmail.com
wrote:
@malay: how cm n+logn-2?
cn u explain the logic ?
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Sun, Sep 18, 2011 at 11:07 AM, Ashima .
ashima.b...@gmail.com wrote:
rite! 62.5%
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti
m1234...@gmail.com wrote:
create a tournament tree.in each round one value is
eliminated
to obtain in the process the winner or the highest value in n-1
comparisons.
Then check the queue of the winner which contains log(n) entries of the
values beaten by the winner which implicitly will contain the runners
up.Then log(n)-1 comparisons to find the highest among all the losers
whom
the winner had beaten. So all over complexity will be n-1 +log(n) -1 =
n+log(n)-2. Hp that answers ur query. nice question btw :)
On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI
viharri@gmail.com wrote:
hey i'm also thinking n + logn -2.. but couldnt able to
figure
out
how??? can you please explain the logic
--
You received this message because you are subscribed to the
Google Groups Algorithm Geeks group.
To post to this group, send email to
algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the
Google Groups Algorithm Geeks group.
To post to this group, send email to
algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the
Google Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Nitin Garg
Personality can open doors... but only Character can keep them
open
--
You received this message because you
Re: [algogeeks] Re: Directi Questions - needed answers
For question 5 reentrant
On 19-Sep-2011 1:43 PM, Nitin Garg nitin.garg.i...@gmail.com wrote:
Can someone tell answers to question 2 and 5 with explanation??
On Mon, Sep 19, 2011 at 1:40 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
In Question 4 i just kept counting new processes that are being added in
every iteration.
No. of new processes being created is equal to the already running no. of
even pid processes.
Time - PId
0 - 0 1
1 - 0,1 2
2, - 0,1,2 3
3, - 0,1,2,3,4 5
4 - 0,1,2,3,4,5,6,7 8
.
.
.
1,2,3,5,8,11,17,25,38,57,86,129,194
I kept counting, got 194.
Don't know of any shortcut.
On Mon, Sep 19, 2011 at 1:35 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Question 6 -
Intuitively you can see that the greater the sum is, the greater the
favorable events in sample space.
e.g. - sum = 1 .. cases {(1)} Pr = 1/6
sum = 2 cases {(2),(1,1)} Pr = 1/6 + 1/36
sum = 3 cases {(3),(2,1)(1,2)(1,1,1)} Pr = 1/6 + 1/36 +1/36 +
1/216
for a more formal proof, look at the recursion -
P(k) = (P(k-6) + P(k-5) + P(k-4)... P(k-1)))/6
where P(0) = 1, P(i) = 0 for i0
Base case -
P(2) P(1)
Hypothesis -
P(i) P(i-1) for all i = k
To prove
P(k+1) P(k)
Proof
P(k+1) - P(k) = (P(k) - P(k-6))/6 0
On Mon, Sep 19, 2011 at 1:04 PM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Question 3 -
To eliminate one player, you need to host atleast 2 matches and make
him
loose in both 2. These 2 matches can not contribute to elimination of
any
other player.
So, min 2 matches for every player who is to be eliminated, hence 100.
On Mon, Sep 19, 2011 at 11:54 AM, Bhanu Chowdary
bhanuchowd...@gmail.com wrote:
@Nitin: Answer to question 3 is 50.
On Mon, Sep 19, 2011 at 11:44 AM, praveen raj praveen0...@gmail.com
wrote:
@nitin Plz explain how u have reached answer of question no. 4 and 6
On 19-Sep-2011 12:26 AM, Nitin Garg nitin.garg.i...@gmail.com
wrote:
Answer 3 - 100
Answer 6 - 103
Answer 4 - 194 total processes including the parent
Answer 7 - 12 km south, 12 km east
On Sun, Sep 18, 2011 at 11:53 PM, Ashima . ashima.b...@gmail.com
wrote:
@malay: how cm n+logn-2?
cn u explain the logic ?
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Sun, Sep 18, 2011 at 11:07 AM, Ashima . ashima.b...@gmail.com
wrote:
rite! 62.5%
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Sat, Sep 17, 2011 at 9:04 PM, malay chakrabarti
m1234...@gmail.com wrote:
create a tournament tree.in each round one value is eliminated
to
obtain in the process the winner or the highest value in n-1
comparisons.
Then check the queue of the winner which contains log(n) entries of
the
values beaten by the winner which implicitly will contain the runners
up.Then log(n)-1 comparisons to find the highest among all the losers
whom
the winner had beaten. So all over complexity will be n-1 +log(n) -1
=
n+log(n)-2. Hp that answers ur query. nice question btw :)
On Sun, Sep 18, 2011 at 8:02 AM, VIHARRI viharri@gmail.com
wrote:
hey i'm also thinking n + logn -2.. but couldnt able to figure
out
how??? can you please explain the logic
--
You received this message because you are subscribed to the
Google Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the
Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Nitin Garg
Personality can open doors... but only Character can keep them
open
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr
Re: [algogeeks] C++ Query
Yes u r saying correct . On 19-Sep-2011 6:39 PM, teja bala pawanjalsa.t...@gmail.com wrote: Why do we pass a reference for copy constructors? If it does shallow copy for pass by value (user defined object), how will it do the deep copy? Ans:- if we don't pass the reference, every time a new object copy like A a=b; constructor will be called twice ,, correct me if i'm wrong... help me regarding about shallow copy and deep copy in copy constructor. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] All valid dictionary words must be found and printed.
Use trie. On 19-Sep-2011 8:20 PM, Sangeeta sangeeta15...@gmail.com wrote: given an array of characters without spaces and a dictionary.All valid dictionary words must be found and printed. i/p : BANKERKCATXYWOMAN. o/p: BANK BANKER CAT WOMAN MAN (the only function you could use for dictionary is dictionary.findword(char *str) which returns a Boolean value). Eg. Dictionary.findword(“bank”) =true Dictionary.findword(“hj”) =false -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Plz explain the output..........
This will show syntax error due to x==9 and otherwise since memory address
given at the declarAtion there fore x value will. Change at every
assignment , but i m not sure printf will give an error or not . Plz reply.
On 17-Sep-2011 1:13 AM, Anshul AGARWAL anshul.agarwa...@gmail.com wrote:
#includestdio.h
int main()
{float t;
long x;
t=98;
printf(%d\n,t);
printf(%f\n,x);
{
x=1;
printf(%f\n,x);
{
x=30;
printf(%f\n,x);
}
printf(%f\n,x);
}
x==9;
printf(%f\n,x);
}
---
Anshul Agarwal
Nit Allahabad
Computer Science
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks]
*Write a program to find out the combination of an element of each
array gives a result 0.*
For example:
array 1: {2,1,4,7}
array 1: {3,-3,-8,0}
array 1: {-1,-4,-7,6}
Output:
pairs =
{2,-8,6}
{1,3,-4}
{4,-3,-1}
{7,0,-7}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] program
program to find the top 3 repeating number from the given array
eg
You r given an array and u have to find out the top 3 repeated
numbers.
for ex: GAURAV[]={20,8,3,7,8,9,20,6,4,6,20,8,20}
so the output will be: 20 is repeated 4 times 8 is repeated 3 times 6
is repeated 2 times.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] InfoEdge
InfoEdge is going to visit in my collage. Anyone knows which type of question ask in written test and interview. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Implementing a grep
correct me if I m wrong.. grep function is to print all line which has substring. containing... the string to be search we r picking a line by line... by getline function... from text file... approaches : trie approach :if memory could not be a problem ..it would not be a problem to use it... but we have to care of freeing trie ... list after searching for the given substring. KMP approach : would be otherwise... better With regards, Praveen Raj DCE-IT 4th yr -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] What would be the ans.
Can anyone explain me approach. how u r calculating..it... With regards, Praveen Raj DCE-IT 3rd yr -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Kth largest element
@kunal.. +1 @dave ... for min heap.. read my statement again... kth largest would be (n-k+1)th smallest... @others ... randomized- partioning.. will not assure of finding an element..in O(n) for finding median ... we can be assure... that... O(n).. proof given in the cormenn With regards, Praveen Raj DCE-IT 3rd yr -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
