Skip to main content

ALGORITHMS & CODING

1) You are developing a web browser (something like e.g. Netscape, etc.) and need to display all
visited links on a page. The visited links need to use a different color then that used to display
scheme than the unvisited links. Now, given a history of links you have visited before, how
would you go about writing the piece of code that makes the determination if you have seen this
link before? Answer or not? The answer could be a simple string comparison, but then think
about the time it will take for the client to render any HTML page. Alternatively, so, given a
history of URLs, come-up with an elegant way (algorithm, data structures, etc.) to make the
determination if a given link already exists in the history list? (Answer)
2) Since web pages can have multiple URLs pointing to them, as a web browser developer how can
you make sure you have never seen the same content before? (Answer)
3) Write a function to print all the possible permutations of a string. Now, modify the algorithm to
discard duplicates. (Answer)
4) Design a memory management scheme.
5) Implement strstr(), strcpy(), strtok() etc. (Answer)
6) Write an algorithm and C code to find the sub array with the largest sum given an array that
contains both positive and negative integers (Answer)
7) A square picture is cut into 16 squares and then shuffled. Write a program to rearrange the 16
squares to get the original big square. (Answer)
8) Implement an algorithm to reverse a singly linked list (with and without recursion). (Answer)
9) Count the total number of set bits in a number without using a loop. (Answer)
10) Given an array of characters which form a sentence of words, give an efficient algorithm to
reverse the order of the words in it. (Answer)
11) Do the class/structure description for a Hash table, and write the source code for the insert
function. (Answer)
12) What sort of technique you would use to update a set of files over a network, where a server
contains the master copy.
13) How do you handle deadlock on a table that is fed with a live serial feed?
14) Say you have three integers between 0-9. You have the equation: A! +B! +C! = ABC (where
ABC is a three digit number, not A*B*C). Find A, B, and C that satisfies this equation.
(Answer)
15) Is it possible to keep 2 stacks in a single array if one grows from position one of the array, and
the other grows from the last position? Write a procedure PUSH (x, s) that pushes element x
onto stack S, where S is one or the other of these two stacks. Include all necessary error checks.
16) How would you find a cycle in a linked list? Try to do it in O(n) time. Try it using a constant
amount of memory. (Answer)
17) Implement an algorithm to reverse a doubly linked list. (Answer)
18) The web can be modeled as a directed graph. Come up with a graph traversal algorithm. Make
the algorithm non-recursive and breadth-first. (Answer)
19) How would you implement a queue from a stack? (Answer)
20) Write source code for printHex (int i) in C/C++. (Answer)
21) Given an array of size N in which every number is between 1 and N, determine if there are any
duplicates in it. (Answer)
22) You are given one fixed list of numbers (let’s call it the first list) and one other list (second list).
How can you efficiently find out if there is any element in the second list that is an element of
the first list? (Answer)
23) Give me an algorithm and C code to shuffle a deck of cards, given that the cards are stored in an
array of ints. Try to come up with a solution that does not require any extra space. (Answer)
24) Do a breadth first traversal of a tree. (Answer)
25) Write a function to find the depth of a binary tree. (Answer)
26) Given 2 nodes in a tree, how do you find the common root of the nodes? (Answer)
27) Write atoi().

Comments

Popular posts from this blog

OWASP Top 10 Threats and Mitigations Exam - Single Select

Last updated 4 Aug 11 Course Title: OWASP Top 10 Threats and Mitigation Exam Questions - Single Select 1) Which of the following consequences is most likely to occur due to an injection attack? Spoofing Cross-site request forgery Denial of service   Correct Insecure direct object references 2) Your application is created using a language that does not support a clear distinction between code and data. Which vulnerability is most likely to occur in your application? Injection   Correct Insecure direct object references Failure to restrict URL access Insufficient transport layer protection 3) Which of the following scenarios is most likely to cause an injection attack? Unvalidated input is embedded in an instruction stream.   Correct Unvalidated input can be distinguished from valid instructions. A Web application does not validate a client’s access to a resource. A Web action performs an operation on behalf of the user without checking a shared sec

CKA Simulator Kubernetes 1.22

  https://killer.sh Pre Setup Once you've gained access to your terminal it might be wise to spend ~1 minute to setup your environment. You could set these: alias k = kubectl                         # will already be pre-configured export do = "--dry-run=client -o yaml"     # k get pod x $do export now = "--force --grace-period 0"   # k delete pod x $now Vim To make vim use 2 spaces for a tab edit ~/.vimrc to contain: set tabstop=2 set expandtab set shiftwidth=2 More setup suggestions are in the tips section .     Question 1 | Contexts Task weight: 1%   You have access to multiple clusters from your main terminal through kubectl contexts. Write all those context names into /opt/course/1/contexts . Next write a command to display the current context into /opt/course/1/context_default_kubectl.sh , the command should use kubectl . Finally write a second command doing the same thing into /opt/course/1/context_default_no_kubectl.sh , but without the use of k

标 题: 关于Daniel Guo 律师

发信人: q123452017 (水天一色), 信区: I140 标  题: 关于Daniel Guo 律师 关键字: Daniel Guo 发信站: BBS 未名空间站 (Thu Apr 26 02:11:35 2018, 美东) 这些是lz根据亲身经历在 Immigration版上发的帖以及一些关于Daniel Guo 律师的回 帖,希望大家不要被一些马甲帖广告帖所骗,慎重考虑选择律师。 WG 和Guo两家律师对比 1. fully refund的合约上的区别 wegreened家是case不过只要第二次没有file就可以fully refund。郭家是要两次case 没过才给refund,而且只要第二次pl draft好律师就可以不退任何律师费。 2. 回信速度 wegreened家一般24小时内回信。郭律师是在可以快速回复的时候才回复很快,对于需 要时间回复或者是不愿意给出确切答复的时候就回复的比较慢。 比如:lz问过郭律师他们律所在nsc区域最近eb1a的通过率,大家也知道nsc现在杀手如 云,但是郭律师过了两天只回复说让秘书update最近的case然后去网页上查,但是上面 并没有写明tsc还是nsc。 lz还问过郭律师关于准备ps (他要求的文件)的一些问题,模版上有的东西不是很清 楚,但是他一般就是把模版上的东西再copy一遍发过来。 3. 材料区别 (推荐信) 因为我只收到郭律师写的推荐信,所以可以比下两家推荐信 wegreened家推荐信写的比较长,而且每封推荐信会用不同的语气和风格,会包含lz写 的research summary里面的某个方面 郭家四封推荐信都是一个格式,一种语气,连地址,信的称呼都是一样的,怎么看四封 推荐信都是同一个人写出来的。套路基本都是第一段目的,第二段介绍推荐人,第三段 某篇或几篇文章的abstract,最后结论 4. 前期材料准备 wegreened家要按照他们的模版准备一个十几页的research summary。 郭律师在签约之前说的是只需要准备五页左右的summary,但是在lz签完约收到推荐信 ,郭律师又发来一个很长的ps要lz自己填,而且和pl的格式基本差不多。 总结下来,申请自己上心最重要。但是如果选律师,lz更倾向于wegreened,