Contact Us

 

Contact Us

For any queries just send an email at the address given below or fill in contact from. We will respond to you as soon as possible.

Comments

Post a Comment

Popular posts from this blog

Software Testing Week 5 : Assignment 5 | 2022

Image
  Week 5 : Assignment 5 Due date: 2022-08-31, 23:59 IST. Assignment not submitted 1 point State true or false: GACC subsumes predicate coverage.   True.   False. 1 point When we test to check if a particular clause does not determine a predicate, which kind of coverage criteria are we considering?   Active coverage criteria.   Inactive coverage criteria 1 point Which of the following represents a correct order of subsumption amongst logic coverage criteria? In the options below, read → as ‘subsumes’.   Correlated active clause coverage → Predicate coverage → Clause coverage.   Combinatorial coverage → Predicate coverage → Clause coverage.   Combinatorial coverage → Correlated active clause coverage → Predicate coverage.   General active clause coverage → Correlated active clause coverage → Clause coverage. Consider the logical predicate  p = a ∨ ( b ∧ c ) p = a ∨ ( b ∧ c ) . Truth table for the predicate is given below with rows numbered...
Read more

Flipkart Runway: Season 3 | 2025 | Internship

Image
  Flipkart Flipkart Runway: Season 3: Stages and Timelines Online Quiz The registered participants will take an online quiz where they will be tested on their basic coding skills. The students will be shortlisted based on their test scores. Start Date 18 Mar 23, 12:00 PM IST End Date 18 Mar 23, 08:00 PM IST Guidelines SOP (Statement of Purpose) Submission Round The shortlisted students from the online quiz round will be required to submit their SOP (Statement of Purpose). Start Date 21 Mar 23, 06:00 PM IST End Date 26 Mar 23, 11:59 PM IST Interview Round The shortlisted students will be invited to appear for the interviews at Flipkart. To be announced. 2025 All that you need to know about Flipkart Runway: Season 3 We’re back with Season 3 of Flipkart Runway, our Early Career Program for Women Engineers that aims to provide them with an accelerated pathway to a successful career in technology.  Runway aims at laying an early foundation for women in engineering by giving them ea...
Read more

Global Alphathon | Internship OR Full-Time | Apply Now

Image
  All that you need to know about Global Alphathon Break into the world of quantitative finance and participate in WorldQuant BRAIN’s 2022 Global Alphathon — one of the world’s largest quant competitions. The Global Alphathon is a three-stage, team-based competition running from August to November 2022. Using WorldQuant BRAIN’s web-based simulation platform, Global Alphathon participants accumulate points by building alphas* using historical market data and predefined operators to simulate equity positions. *Alphas are mathematical models that seek to predict the future price movements of various financial instruments. About WorldQuant and WorldQuant BRAIN: Headquartered in the US, WorldQuant is a quantitative asset management firm founded in 2007 with over 750 employees spread across 13 countries. We seek to produce high-quality predictive signals (alphas) through our proprietary research platform. These signals are employed in financial strategies across a variety of asset classe...
Read more

Yet Another Tree Problem

Image
  Nayra doesn't like stories of people receiving random trees as birthday presents, but this time she received a tree as a present for her own birthday! After struggling for a day trying to figure out what to do with this tree, she asked Aryan for help. He gave her this problem. You are given a tree with  N N  vertices and weighted edges. It is rooted at vertex  1 1 . Define  g ( u , v ) g ( u , v )  to be the maximum weight of an edge on the shortest path between vertex  u u  and vertex  v v  in this tree. Just calculating  g ( u , v ) g ( u , v )  is too easy, so you have to process  Q Q  queries. In each query, you are given  K K   distinct  vertices  v 1 , v 2 , … , v K v 1 , v 2 , … , v K . You have to compute the sum of the  g g -values of each pair of vertices among these  K K , i.e, the value ∑ i = 1 K − 1 ∑ j = i + 1 K g ( v i , v j ) ∑ i = 1 K − 1 ∑ j = i + 1 K g ( v i , v j ) N...
Read more