Cadence Inc Interview Question for Software Engineer / Developers


Country: India
Interview Type: In-Person




Comment hidden because of low score. Click to expand.
1
of 1 vote

this problem will be solved using DFS on DAG.
1. we can create directed acyclic graph of the jobs and their dependences. IF job 1 have dependency on job 2 then make 1->2. similarly for others.
2. then use dfs over each node of Graph. as soon as all dependencies of a node processed then process that node.

processJobs(graph g)
{
   for each node v in graph g
    if(v is not processes)
      dfs(v);
}

void dfs(v)
{
  for each node u in adj[v]
    {
       if u is not processed
           dfs(u);
    }
    process(v);
}

write comments if any issue.

- Ashish September 09, 2014 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

1. Append first steps to the empty list
2. Check each item of the list if dependencies are done.
3. If all dependencies are done, remove it from the list and add children to the end of the list
4. If not all dependencies are finished yet stay where it is.
5. Repeat 2-4 until the list is empty.

- MangchiAndJjoe March 03, 2014 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

This gets solved with topological sort, The jobs are the Vertices(V) and the Edges are the dependencies among them

- enriquevr March 03, 2014 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More